A generating set of cardinality $n$ in the free group $F_n$ is a free basis.
$begingroup$
Let $F_n$ be the free group on $n$ letters. Let $S={s_1,s_2,ldots,s_n}$ be a set of $n$ elements of $F_n$.
Is there any way to prove that $S$ is in fact a free basis for $F_n$ without using the Nielsen transformations?
abstract-algebra free-groups
$endgroup$
add a comment |
$begingroup$
Let $F_n$ be the free group on $n$ letters. Let $S={s_1,s_2,ldots,s_n}$ be a set of $n$ elements of $F_n$.
Is there any way to prove that $S$ is in fact a free basis for $F_n$ without using the Nielsen transformations?
abstract-algebra free-groups
$endgroup$
$begingroup$
There is a simple geometric proof that uses Stallings fold sequences, but I suspect you won't like that because Stallings fold sequences are more-or-less a geometric version of Nielsen transformations.
$endgroup$
– Lee Mosher
Dec 16 '18 at 4:57
add a comment |
$begingroup$
Let $F_n$ be the free group on $n$ letters. Let $S={s_1,s_2,ldots,s_n}$ be a set of $n$ elements of $F_n$.
Is there any way to prove that $S$ is in fact a free basis for $F_n$ without using the Nielsen transformations?
abstract-algebra free-groups
$endgroup$
Let $F_n$ be the free group on $n$ letters. Let $S={s_1,s_2,ldots,s_n}$ be a set of $n$ elements of $F_n$.
Is there any way to prove that $S$ is in fact a free basis for $F_n$ without using the Nielsen transformations?
abstract-algebra free-groups
abstract-algebra free-groups
asked Dec 16 '18 at 1:27
moutheticsmouthetics
50137
50137
$begingroup$
There is a simple geometric proof that uses Stallings fold sequences, but I suspect you won't like that because Stallings fold sequences are more-or-less a geometric version of Nielsen transformations.
$endgroup$
– Lee Mosher
Dec 16 '18 at 4:57
add a comment |
$begingroup$
There is a simple geometric proof that uses Stallings fold sequences, but I suspect you won't like that because Stallings fold sequences are more-or-less a geometric version of Nielsen transformations.
$endgroup$
– Lee Mosher
Dec 16 '18 at 4:57
$begingroup$
There is a simple geometric proof that uses Stallings fold sequences, but I suspect you won't like that because Stallings fold sequences are more-or-less a geometric version of Nielsen transformations.
$endgroup$
– Lee Mosher
Dec 16 '18 at 4:57
$begingroup$
There is a simple geometric proof that uses Stallings fold sequences, but I suspect you won't like that because Stallings fold sequences are more-or-less a geometric version of Nielsen transformations.
$endgroup$
– Lee Mosher
Dec 16 '18 at 4:57
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Sure, $S$ induces a surjective map $phi: Fto F$, defined by sending a free basis to $S$. To show $S$ is a free basis for $F$, it therefore suffices to show that any surjective map $Fto F$ is in fact an isomorphism.
This is essentially the statement that finitely generated free groups are Hopfian.
I'll essentially copy over the proofs needed to arrive at this conclusion given on the groupprops wiki. None of them use Nielsen transformations, or anything similar. They are what I'd consider "algebraic" rather than "combinatorial."
Lemma. Free groups are residually finite, i.e. for any nonidentity element, there is a finite index normal subgroup not containing that element, or in other words, there for any nonidentity element from the group to a finite group which is not the identity on that element.
Proof:
Let $F$ be the free group, with some free basis $T$. Let $w=a_na_{n-1}cdots a_2a_1$ be a nonidentity reduced word, with $a_iin T$ or $a_i^{-1}in T$.
We'll define a map from $g:Tto S_{n+1}$ which induces a map $G:Fto S_{n+1}$ which sends $w$ to a nonidentity permutation. For each $tin T$, let $A_t={i : t=a_i}$ and $B_t={j : t=a_j^{-1}}$. Now for each $t$, if $A_t=B_t=varnothing$, define $f(t)=1$. Otherwise, if one of $A_t$ or $B_t$ is nonempty, choose a permutation $sigma$ such that $sigma(i)=i+1$ for $iin A_t$ and $sigma(j+1)=j$ for $jin B_t$. This is possible, since $i+1ne j$ for any $iin A_t$ and $jin B_t$, since that would mean that the word wasn't reduced, and any partial injection can be extended to a bijection. Then observe that $G(w)$ sends $1$ to $n$ by construction. Thus $G$ is not the identity on $w$. $quadblacksquare$
Now we can prove that finitely generated free groups are Hopfian, i.e. that any surjective endomorphism is an automorphism. In fact this proof shows that any finitely generated, residually finite group is Hopfian.
Proof:
Let $F$ be a finitely generated, residually finite group. Let $phi : F to F$ be a surjective endomorphism. Assume for contradiction that $kerphi ne 1$. Then there exists $win kerphi$ with $wne 1$. Since $F$ is residually finite, there exists $alpha : Fto G$ with $G$ finite and $alpha (w)ne 1$. Then $alphacirc phi^n$ are pairwise distinct homomorphisms from $F$ to $G$ for all $nin Bbb{N}$, since if we let $w_i$ be elements such that $phi^i(w_i)=w$ using the surjectivity of $phi$, then we have that $w_i$ is in the kernel of $alphacirc phi^n$ precisely when $n> i$. Thus the kernels of the maps $alphacircphi^n$ are all distinct.
However, since $G$ is finite and $F$ is finitely generated, if $F$ has a generating set with $m$ elements, there are at most $m|G|$ homomorphisms from $F$ to $G$. Contradiction. $quadblacksquare$
$endgroup$
$begingroup$
Great! That's what I was looking for. Thank you very much for writing the proof, I really appreciate.
$endgroup$
– mouthetics
Dec 19 '18 at 21:46
add a comment |
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%2f3042140%2fa-generating-set-of-cardinality-n-in-the-free-group-f-n-is-a-free-basis%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Sure, $S$ induces a surjective map $phi: Fto F$, defined by sending a free basis to $S$. To show $S$ is a free basis for $F$, it therefore suffices to show that any surjective map $Fto F$ is in fact an isomorphism.
This is essentially the statement that finitely generated free groups are Hopfian.
I'll essentially copy over the proofs needed to arrive at this conclusion given on the groupprops wiki. None of them use Nielsen transformations, or anything similar. They are what I'd consider "algebraic" rather than "combinatorial."
Lemma. Free groups are residually finite, i.e. for any nonidentity element, there is a finite index normal subgroup not containing that element, or in other words, there for any nonidentity element from the group to a finite group which is not the identity on that element.
Proof:
Let $F$ be the free group, with some free basis $T$. Let $w=a_na_{n-1}cdots a_2a_1$ be a nonidentity reduced word, with $a_iin T$ or $a_i^{-1}in T$.
We'll define a map from $g:Tto S_{n+1}$ which induces a map $G:Fto S_{n+1}$ which sends $w$ to a nonidentity permutation. For each $tin T$, let $A_t={i : t=a_i}$ and $B_t={j : t=a_j^{-1}}$. Now for each $t$, if $A_t=B_t=varnothing$, define $f(t)=1$. Otherwise, if one of $A_t$ or $B_t$ is nonempty, choose a permutation $sigma$ such that $sigma(i)=i+1$ for $iin A_t$ and $sigma(j+1)=j$ for $jin B_t$. This is possible, since $i+1ne j$ for any $iin A_t$ and $jin B_t$, since that would mean that the word wasn't reduced, and any partial injection can be extended to a bijection. Then observe that $G(w)$ sends $1$ to $n$ by construction. Thus $G$ is not the identity on $w$. $quadblacksquare$
Now we can prove that finitely generated free groups are Hopfian, i.e. that any surjective endomorphism is an automorphism. In fact this proof shows that any finitely generated, residually finite group is Hopfian.
Proof:
Let $F$ be a finitely generated, residually finite group. Let $phi : F to F$ be a surjective endomorphism. Assume for contradiction that $kerphi ne 1$. Then there exists $win kerphi$ with $wne 1$. Since $F$ is residually finite, there exists $alpha : Fto G$ with $G$ finite and $alpha (w)ne 1$. Then $alphacirc phi^n$ are pairwise distinct homomorphisms from $F$ to $G$ for all $nin Bbb{N}$, since if we let $w_i$ be elements such that $phi^i(w_i)=w$ using the surjectivity of $phi$, then we have that $w_i$ is in the kernel of $alphacirc phi^n$ precisely when $n> i$. Thus the kernels of the maps $alphacircphi^n$ are all distinct.
However, since $G$ is finite and $F$ is finitely generated, if $F$ has a generating set with $m$ elements, there are at most $m|G|$ homomorphisms from $F$ to $G$. Contradiction. $quadblacksquare$
$endgroup$
$begingroup$
Great! That's what I was looking for. Thank you very much for writing the proof, I really appreciate.
$endgroup$
– mouthetics
Dec 19 '18 at 21:46
add a comment |
$begingroup$
Sure, $S$ induces a surjective map $phi: Fto F$, defined by sending a free basis to $S$. To show $S$ is a free basis for $F$, it therefore suffices to show that any surjective map $Fto F$ is in fact an isomorphism.
This is essentially the statement that finitely generated free groups are Hopfian.
I'll essentially copy over the proofs needed to arrive at this conclusion given on the groupprops wiki. None of them use Nielsen transformations, or anything similar. They are what I'd consider "algebraic" rather than "combinatorial."
Lemma. Free groups are residually finite, i.e. for any nonidentity element, there is a finite index normal subgroup not containing that element, or in other words, there for any nonidentity element from the group to a finite group which is not the identity on that element.
Proof:
Let $F$ be the free group, with some free basis $T$. Let $w=a_na_{n-1}cdots a_2a_1$ be a nonidentity reduced word, with $a_iin T$ or $a_i^{-1}in T$.
We'll define a map from $g:Tto S_{n+1}$ which induces a map $G:Fto S_{n+1}$ which sends $w$ to a nonidentity permutation. For each $tin T$, let $A_t={i : t=a_i}$ and $B_t={j : t=a_j^{-1}}$. Now for each $t$, if $A_t=B_t=varnothing$, define $f(t)=1$. Otherwise, if one of $A_t$ or $B_t$ is nonempty, choose a permutation $sigma$ such that $sigma(i)=i+1$ for $iin A_t$ and $sigma(j+1)=j$ for $jin B_t$. This is possible, since $i+1ne j$ for any $iin A_t$ and $jin B_t$, since that would mean that the word wasn't reduced, and any partial injection can be extended to a bijection. Then observe that $G(w)$ sends $1$ to $n$ by construction. Thus $G$ is not the identity on $w$. $quadblacksquare$
Now we can prove that finitely generated free groups are Hopfian, i.e. that any surjective endomorphism is an automorphism. In fact this proof shows that any finitely generated, residually finite group is Hopfian.
Proof:
Let $F$ be a finitely generated, residually finite group. Let $phi : F to F$ be a surjective endomorphism. Assume for contradiction that $kerphi ne 1$. Then there exists $win kerphi$ with $wne 1$. Since $F$ is residually finite, there exists $alpha : Fto G$ with $G$ finite and $alpha (w)ne 1$. Then $alphacirc phi^n$ are pairwise distinct homomorphisms from $F$ to $G$ for all $nin Bbb{N}$, since if we let $w_i$ be elements such that $phi^i(w_i)=w$ using the surjectivity of $phi$, then we have that $w_i$ is in the kernel of $alphacirc phi^n$ precisely when $n> i$. Thus the kernels of the maps $alphacircphi^n$ are all distinct.
However, since $G$ is finite and $F$ is finitely generated, if $F$ has a generating set with $m$ elements, there are at most $m|G|$ homomorphisms from $F$ to $G$. Contradiction. $quadblacksquare$
$endgroup$
$begingroup$
Great! That's what I was looking for. Thank you very much for writing the proof, I really appreciate.
$endgroup$
– mouthetics
Dec 19 '18 at 21:46
add a comment |
$begingroup$
Sure, $S$ induces a surjective map $phi: Fto F$, defined by sending a free basis to $S$. To show $S$ is a free basis for $F$, it therefore suffices to show that any surjective map $Fto F$ is in fact an isomorphism.
This is essentially the statement that finitely generated free groups are Hopfian.
I'll essentially copy over the proofs needed to arrive at this conclusion given on the groupprops wiki. None of them use Nielsen transformations, or anything similar. They are what I'd consider "algebraic" rather than "combinatorial."
Lemma. Free groups are residually finite, i.e. for any nonidentity element, there is a finite index normal subgroup not containing that element, or in other words, there for any nonidentity element from the group to a finite group which is not the identity on that element.
Proof:
Let $F$ be the free group, with some free basis $T$. Let $w=a_na_{n-1}cdots a_2a_1$ be a nonidentity reduced word, with $a_iin T$ or $a_i^{-1}in T$.
We'll define a map from $g:Tto S_{n+1}$ which induces a map $G:Fto S_{n+1}$ which sends $w$ to a nonidentity permutation. For each $tin T$, let $A_t={i : t=a_i}$ and $B_t={j : t=a_j^{-1}}$. Now for each $t$, if $A_t=B_t=varnothing$, define $f(t)=1$. Otherwise, if one of $A_t$ or $B_t$ is nonempty, choose a permutation $sigma$ such that $sigma(i)=i+1$ for $iin A_t$ and $sigma(j+1)=j$ for $jin B_t$. This is possible, since $i+1ne j$ for any $iin A_t$ and $jin B_t$, since that would mean that the word wasn't reduced, and any partial injection can be extended to a bijection. Then observe that $G(w)$ sends $1$ to $n$ by construction. Thus $G$ is not the identity on $w$. $quadblacksquare$
Now we can prove that finitely generated free groups are Hopfian, i.e. that any surjective endomorphism is an automorphism. In fact this proof shows that any finitely generated, residually finite group is Hopfian.
Proof:
Let $F$ be a finitely generated, residually finite group. Let $phi : F to F$ be a surjective endomorphism. Assume for contradiction that $kerphi ne 1$. Then there exists $win kerphi$ with $wne 1$. Since $F$ is residually finite, there exists $alpha : Fto G$ with $G$ finite and $alpha (w)ne 1$. Then $alphacirc phi^n$ are pairwise distinct homomorphisms from $F$ to $G$ for all $nin Bbb{N}$, since if we let $w_i$ be elements such that $phi^i(w_i)=w$ using the surjectivity of $phi$, then we have that $w_i$ is in the kernel of $alphacirc phi^n$ precisely when $n> i$. Thus the kernels of the maps $alphacircphi^n$ are all distinct.
However, since $G$ is finite and $F$ is finitely generated, if $F$ has a generating set with $m$ elements, there are at most $m|G|$ homomorphisms from $F$ to $G$. Contradiction. $quadblacksquare$
$endgroup$
Sure, $S$ induces a surjective map $phi: Fto F$, defined by sending a free basis to $S$. To show $S$ is a free basis for $F$, it therefore suffices to show that any surjective map $Fto F$ is in fact an isomorphism.
This is essentially the statement that finitely generated free groups are Hopfian.
I'll essentially copy over the proofs needed to arrive at this conclusion given on the groupprops wiki. None of them use Nielsen transformations, or anything similar. They are what I'd consider "algebraic" rather than "combinatorial."
Lemma. Free groups are residually finite, i.e. for any nonidentity element, there is a finite index normal subgroup not containing that element, or in other words, there for any nonidentity element from the group to a finite group which is not the identity on that element.
Proof:
Let $F$ be the free group, with some free basis $T$. Let $w=a_na_{n-1}cdots a_2a_1$ be a nonidentity reduced word, with $a_iin T$ or $a_i^{-1}in T$.
We'll define a map from $g:Tto S_{n+1}$ which induces a map $G:Fto S_{n+1}$ which sends $w$ to a nonidentity permutation. For each $tin T$, let $A_t={i : t=a_i}$ and $B_t={j : t=a_j^{-1}}$. Now for each $t$, if $A_t=B_t=varnothing$, define $f(t)=1$. Otherwise, if one of $A_t$ or $B_t$ is nonempty, choose a permutation $sigma$ such that $sigma(i)=i+1$ for $iin A_t$ and $sigma(j+1)=j$ for $jin B_t$. This is possible, since $i+1ne j$ for any $iin A_t$ and $jin B_t$, since that would mean that the word wasn't reduced, and any partial injection can be extended to a bijection. Then observe that $G(w)$ sends $1$ to $n$ by construction. Thus $G$ is not the identity on $w$. $quadblacksquare$
Now we can prove that finitely generated free groups are Hopfian, i.e. that any surjective endomorphism is an automorphism. In fact this proof shows that any finitely generated, residually finite group is Hopfian.
Proof:
Let $F$ be a finitely generated, residually finite group. Let $phi : F to F$ be a surjective endomorphism. Assume for contradiction that $kerphi ne 1$. Then there exists $win kerphi$ with $wne 1$. Since $F$ is residually finite, there exists $alpha : Fto G$ with $G$ finite and $alpha (w)ne 1$. Then $alphacirc phi^n$ are pairwise distinct homomorphisms from $F$ to $G$ for all $nin Bbb{N}$, since if we let $w_i$ be elements such that $phi^i(w_i)=w$ using the surjectivity of $phi$, then we have that $w_i$ is in the kernel of $alphacirc phi^n$ precisely when $n> i$. Thus the kernels of the maps $alphacircphi^n$ are all distinct.
However, since $G$ is finite and $F$ is finitely generated, if $F$ has a generating set with $m$ elements, there are at most $m|G|$ homomorphisms from $F$ to $G$. Contradiction. $quadblacksquare$
answered Dec 18 '18 at 17:51
jgonjgon
14.6k22042
14.6k22042
$begingroup$
Great! That's what I was looking for. Thank you very much for writing the proof, I really appreciate.
$endgroup$
– mouthetics
Dec 19 '18 at 21:46
add a comment |
$begingroup$
Great! That's what I was looking for. Thank you very much for writing the proof, I really appreciate.
$endgroup$
– mouthetics
Dec 19 '18 at 21:46
$begingroup$
Great! That's what I was looking for. Thank you very much for writing the proof, I really appreciate.
$endgroup$
– mouthetics
Dec 19 '18 at 21:46
$begingroup$
Great! That's what I was looking for. Thank you very much for writing the proof, I really appreciate.
$endgroup$
– mouthetics
Dec 19 '18 at 21:46
add a comment |
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%2f3042140%2fa-generating-set-of-cardinality-n-in-the-free-group-f-n-is-a-free-basis%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$
There is a simple geometric proof that uses Stallings fold sequences, but I suspect you won't like that because Stallings fold sequences are more-or-less a geometric version of Nielsen transformations.
$endgroup$
– Lee Mosher
Dec 16 '18 at 4:57