General formula to find number of Bases in $(mathbb{Z}/2mathbb{Z})^n$
$begingroup$
If we consider $(mathbb{Z}/2mathbb{Z})^2$ (n=2) as a vector space, we get the Bases:
B1 = {$begin{pmatrix}1\0end{pmatrix},begin{pmatrix}0\1end{pmatrix}$}
B2 = {$begin{pmatrix}1\0end{pmatrix},begin{pmatrix}1\1end{pmatrix}$}
B3 = {$begin{pmatrix}0\1end{pmatrix},begin{pmatrix}1\1end{pmatrix}$}
So we get 3 Bases
For n=3 I came up with the following calculation: $${7*6*4over 3!}= 28$$
There are $2^3$ possible vectors in $(mathbb{Z}/2mathbb{Z})^3$ and the Bases must have 3
linearly independent vectors.
A Basis does not include the $0$ vector so 7*(number of possible vectors left (6))*(number of vectors left that aren't a linear combination of the first two (4)) and we divide that by 3! since we don't care about the order in which the vectors are chosen.
So we get 28 Bases
My questions are: Is this correct so far? and does $$prod_{k=0}^{n-1}{(2^n-2^k)over (k+1)}$$
work as a possible general formula for any n? (I don't know how to show this)
It would be much appreciated if you could help me show this a little bit more rigorously.
linear-algebra cyclic-groups
$endgroup$
add a comment |
$begingroup$
If we consider $(mathbb{Z}/2mathbb{Z})^2$ (n=2) as a vector space, we get the Bases:
B1 = {$begin{pmatrix}1\0end{pmatrix},begin{pmatrix}0\1end{pmatrix}$}
B2 = {$begin{pmatrix}1\0end{pmatrix},begin{pmatrix}1\1end{pmatrix}$}
B3 = {$begin{pmatrix}0\1end{pmatrix},begin{pmatrix}1\1end{pmatrix}$}
So we get 3 Bases
For n=3 I came up with the following calculation: $${7*6*4over 3!}= 28$$
There are $2^3$ possible vectors in $(mathbb{Z}/2mathbb{Z})^3$ and the Bases must have 3
linearly independent vectors.
A Basis does not include the $0$ vector so 7*(number of possible vectors left (6))*(number of vectors left that aren't a linear combination of the first two (4)) and we divide that by 3! since we don't care about the order in which the vectors are chosen.
So we get 28 Bases
My questions are: Is this correct so far? and does $$prod_{k=0}^{n-1}{(2^n-2^k)over (k+1)}$$
work as a possible general formula for any n? (I don't know how to show this)
It would be much appreciated if you could help me show this a little bit more rigorously.
linear-algebra cyclic-groups
$endgroup$
$begingroup$
You might find this relevant: en.wikipedia.org/wiki/General_linear_group
$endgroup$
– Randall
Dec 13 '18 at 4:20
1
$begingroup$
take a look at this.
$endgroup$
– dezdichado
Dec 13 '18 at 4:54
add a comment |
$begingroup$
If we consider $(mathbb{Z}/2mathbb{Z})^2$ (n=2) as a vector space, we get the Bases:
B1 = {$begin{pmatrix}1\0end{pmatrix},begin{pmatrix}0\1end{pmatrix}$}
B2 = {$begin{pmatrix}1\0end{pmatrix},begin{pmatrix}1\1end{pmatrix}$}
B3 = {$begin{pmatrix}0\1end{pmatrix},begin{pmatrix}1\1end{pmatrix}$}
So we get 3 Bases
For n=3 I came up with the following calculation: $${7*6*4over 3!}= 28$$
There are $2^3$ possible vectors in $(mathbb{Z}/2mathbb{Z})^3$ and the Bases must have 3
linearly independent vectors.
A Basis does not include the $0$ vector so 7*(number of possible vectors left (6))*(number of vectors left that aren't a linear combination of the first two (4)) and we divide that by 3! since we don't care about the order in which the vectors are chosen.
So we get 28 Bases
My questions are: Is this correct so far? and does $$prod_{k=0}^{n-1}{(2^n-2^k)over (k+1)}$$
work as a possible general formula for any n? (I don't know how to show this)
It would be much appreciated if you could help me show this a little bit more rigorously.
linear-algebra cyclic-groups
$endgroup$
If we consider $(mathbb{Z}/2mathbb{Z})^2$ (n=2) as a vector space, we get the Bases:
B1 = {$begin{pmatrix}1\0end{pmatrix},begin{pmatrix}0\1end{pmatrix}$}
B2 = {$begin{pmatrix}1\0end{pmatrix},begin{pmatrix}1\1end{pmatrix}$}
B3 = {$begin{pmatrix}0\1end{pmatrix},begin{pmatrix}1\1end{pmatrix}$}
So we get 3 Bases
For n=3 I came up with the following calculation: $${7*6*4over 3!}= 28$$
There are $2^3$ possible vectors in $(mathbb{Z}/2mathbb{Z})^3$ and the Bases must have 3
linearly independent vectors.
A Basis does not include the $0$ vector so 7*(number of possible vectors left (6))*(number of vectors left that aren't a linear combination of the first two (4)) and we divide that by 3! since we don't care about the order in which the vectors are chosen.
So we get 28 Bases
My questions are: Is this correct so far? and does $$prod_{k=0}^{n-1}{(2^n-2^k)over (k+1)}$$
work as a possible general formula for any n? (I don't know how to show this)
It would be much appreciated if you could help me show this a little bit more rigorously.
linear-algebra cyclic-groups
linear-algebra cyclic-groups
asked Dec 13 '18 at 4:18
Nick T. WolffNick T. Wolff
161
161
$begingroup$
You might find this relevant: en.wikipedia.org/wiki/General_linear_group
$endgroup$
– Randall
Dec 13 '18 at 4:20
1
$begingroup$
take a look at this.
$endgroup$
– dezdichado
Dec 13 '18 at 4:54
add a comment |
$begingroup$
You might find this relevant: en.wikipedia.org/wiki/General_linear_group
$endgroup$
– Randall
Dec 13 '18 at 4:20
1
$begingroup$
take a look at this.
$endgroup$
– dezdichado
Dec 13 '18 at 4:54
$begingroup$
You might find this relevant: en.wikipedia.org/wiki/General_linear_group
$endgroup$
– Randall
Dec 13 '18 at 4:20
$begingroup$
You might find this relevant: en.wikipedia.org/wiki/General_linear_group
$endgroup$
– Randall
Dec 13 '18 at 4:20
1
1
$begingroup$
take a look at this.
$endgroup$
– dezdichado
Dec 13 '18 at 4:54
$begingroup$
take a look at this.
$endgroup$
– dezdichado
Dec 13 '18 at 4:54
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3037588%2fgeneral-formula-to-find-number-of-bases-in-mathbbz-2-mathbbzn%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3037588%2fgeneral-formula-to-find-number-of-bases-in-mathbbz-2-mathbbzn%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
You might find this relevant: en.wikipedia.org/wiki/General_linear_group
$endgroup$
– Randall
Dec 13 '18 at 4:20
1
$begingroup$
take a look at this.
$endgroup$
– dezdichado
Dec 13 '18 at 4:54