What is a simple example of a free group?
up vote
5
down vote
favorite
Can someone give me a simple example of a free group with a basis, given the definition below? I don't think I'm understanding the definition clearly.
For example if $F= (Bbb Z, +)$, $X = {0}$, $phicolon{0} rightarrow G$ is any function, then there should exist a unique homomorphism $tilde phicolon Bbb Z rightarrow G$ such that $tilde phi(0) = phi(0)$.
But if $phicolon{0} mapsto text{non identity element of $G$}$, then there's no way any homomorphism exists because identities of one group are mapped to the other group.
abstract-algebra group-theory definition examples-counterexamples free-groups
add a comment |
up vote
5
down vote
favorite
Can someone give me a simple example of a free group with a basis, given the definition below? I don't think I'm understanding the definition clearly.
For example if $F= (Bbb Z, +)$, $X = {0}$, $phicolon{0} rightarrow G$ is any function, then there should exist a unique homomorphism $tilde phicolon Bbb Z rightarrow G$ such that $tilde phi(0) = phi(0)$.
But if $phicolon{0} mapsto text{non identity element of $G$}$, then there's no way any homomorphism exists because identities of one group are mapped to the other group.
abstract-algebra group-theory definition examples-counterexamples free-groups
add a comment |
up vote
5
down vote
favorite
up vote
5
down vote
favorite
Can someone give me a simple example of a free group with a basis, given the definition below? I don't think I'm understanding the definition clearly.
For example if $F= (Bbb Z, +)$, $X = {0}$, $phicolon{0} rightarrow G$ is any function, then there should exist a unique homomorphism $tilde phicolon Bbb Z rightarrow G$ such that $tilde phi(0) = phi(0)$.
But if $phicolon{0} mapsto text{non identity element of $G$}$, then there's no way any homomorphism exists because identities of one group are mapped to the other group.
abstract-algebra group-theory definition examples-counterexamples free-groups
Can someone give me a simple example of a free group with a basis, given the definition below? I don't think I'm understanding the definition clearly.
For example if $F= (Bbb Z, +)$, $X = {0}$, $phicolon{0} rightarrow G$ is any function, then there should exist a unique homomorphism $tilde phicolon Bbb Z rightarrow G$ such that $tilde phi(0) = phi(0)$.
But if $phicolon{0} mapsto text{non identity element of $G$}$, then there's no way any homomorphism exists because identities of one group are mapped to the other group.
abstract-algebra group-theory definition examples-counterexamples free-groups
abstract-algebra group-theory definition examples-counterexamples free-groups
edited yesterday
José Carlos Santos
143k20112208
143k20112208
asked Jul 25 '17 at 15:10
Oliver G
1,5781528
1,5781528
add a comment |
add a comment |
5 Answers
5
active
oldest
votes
up vote
11
down vote
accepted
The simplest example is $(mathbb{Z},+)$ with the basis $X={1}$. Let $varphi$ be any function from $X$ into a group $G$ and let $g=varphi(1)$. Now, define $tilde{varphi}(m)=g^m$, for each integer $m$. Then $tildevarphi$ is a group homomorphism. Furthermore, it is the only group homomorphism from $(mathbb{Z},+)$ into $G$ such that $tildevarphi(1)=varphi(1)$.
add a comment |
up vote
5
down vote
The simplest non-abelian example is $F_2$, with generating set $S={a,b}$. The elements are just reduced words of the form $a^{r_1}b^{s_1}cdots a^{r_n}b^{s_n}$. In fact, $F_2$ can be shown to be isomorphic to a matrix subgroup of $SL_2(mathbb{Z})$, namely the subgroup generated by
$$ a =
begin{pmatrix}
1 & 2 \
0 & 1
end{pmatrix},
b =
begin{pmatrix}
1 & 0 \
2 & 1
end{pmatrix},
$$
see the Ping-Pong Lemma.
add a comment |
up vote
1
down vote
You have a set $X$. The elements of $F_X$ the free group on $X$ are
"reduced words" in $X$; finite sequences of symbols $x$ and $x^{-1}$
for $xin X$ where no $x$ and $x^{-1}$ are adjacent and including the
empty word, which I'll write as $1$ as it is the identity. So for $X={x,y,z}$ reduced words include $1$, $x$, $y$, $z^{-1}$, $yx$, $xzx^{-1}$, $xxyx^{-1}z^{-1}xzy^{-1}z$ etc. To multiply, concatenate, and cancel any $xx^{-1}$s or $x^{-1}x$s.
If you have $X={x}$ with one element, the reduced words are $1$,
$xxcdots x$ (with $n$ $x$s) and $x^{-1}x^{-1}cdots x^{-1}$ (with $n$ $x^{-1}$s). If we write these instead as $x^0$, $x^n$ and $x^{-n}$
we see that $F_XcongBbb Z$.
Rather perversely, in your notation you have chosen $0$ to be the element. This results in reduced words like $0000$ and $0^{-1}0^{-1}0^{-1}$. These can cause confusion...
add a comment |
up vote
0
down vote
The identity in F is the empty word. This alleviates your problem because X consists of elements of F (not "0"). X has no identity. X isn't a group; it's just a set.
add a comment |
up vote
0
down vote
Whilst it is important to understand the formal definition of free groups, I shall give you a more geometric example heralding from algebraic topology, because intuitively it is more of use.
Imagine that you have a flower which has only two petals. Consider also that the meeting point of these two petals is of dimension 0 (namely it is a point). Now, the free group on two generators describes exactly the difficulty for a small insect to walk on the contour of the petals (no flying's allowed!). This "difficulty" is formally defined in algebraic topology as the fundamental group of that surface. Obviously, if you had a flower with k-petals (imagine a bouquet), then the free group on k generators would express the respective difficulty to walk on all these petals.
add a comment |
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
11
down vote
accepted
The simplest example is $(mathbb{Z},+)$ with the basis $X={1}$. Let $varphi$ be any function from $X$ into a group $G$ and let $g=varphi(1)$. Now, define $tilde{varphi}(m)=g^m$, for each integer $m$. Then $tildevarphi$ is a group homomorphism. Furthermore, it is the only group homomorphism from $(mathbb{Z},+)$ into $G$ such that $tildevarphi(1)=varphi(1)$.
add a comment |
up vote
11
down vote
accepted
The simplest example is $(mathbb{Z},+)$ with the basis $X={1}$. Let $varphi$ be any function from $X$ into a group $G$ and let $g=varphi(1)$. Now, define $tilde{varphi}(m)=g^m$, for each integer $m$. Then $tildevarphi$ is a group homomorphism. Furthermore, it is the only group homomorphism from $(mathbb{Z},+)$ into $G$ such that $tildevarphi(1)=varphi(1)$.
add a comment |
up vote
11
down vote
accepted
up vote
11
down vote
accepted
The simplest example is $(mathbb{Z},+)$ with the basis $X={1}$. Let $varphi$ be any function from $X$ into a group $G$ and let $g=varphi(1)$. Now, define $tilde{varphi}(m)=g^m$, for each integer $m$. Then $tildevarphi$ is a group homomorphism. Furthermore, it is the only group homomorphism from $(mathbb{Z},+)$ into $G$ such that $tildevarphi(1)=varphi(1)$.
The simplest example is $(mathbb{Z},+)$ with the basis $X={1}$. Let $varphi$ be any function from $X$ into a group $G$ and let $g=varphi(1)$. Now, define $tilde{varphi}(m)=g^m$, for each integer $m$. Then $tildevarphi$ is a group homomorphism. Furthermore, it is the only group homomorphism from $(mathbb{Z},+)$ into $G$ such that $tildevarphi(1)=varphi(1)$.
edited yesterday
answered Jul 25 '17 at 15:15
José Carlos Santos
143k20112208
143k20112208
add a comment |
add a comment |
up vote
5
down vote
The simplest non-abelian example is $F_2$, with generating set $S={a,b}$. The elements are just reduced words of the form $a^{r_1}b^{s_1}cdots a^{r_n}b^{s_n}$. In fact, $F_2$ can be shown to be isomorphic to a matrix subgroup of $SL_2(mathbb{Z})$, namely the subgroup generated by
$$ a =
begin{pmatrix}
1 & 2 \
0 & 1
end{pmatrix},
b =
begin{pmatrix}
1 & 0 \
2 & 1
end{pmatrix},
$$
see the Ping-Pong Lemma.
add a comment |
up vote
5
down vote
The simplest non-abelian example is $F_2$, with generating set $S={a,b}$. The elements are just reduced words of the form $a^{r_1}b^{s_1}cdots a^{r_n}b^{s_n}$. In fact, $F_2$ can be shown to be isomorphic to a matrix subgroup of $SL_2(mathbb{Z})$, namely the subgroup generated by
$$ a =
begin{pmatrix}
1 & 2 \
0 & 1
end{pmatrix},
b =
begin{pmatrix}
1 & 0 \
2 & 1
end{pmatrix},
$$
see the Ping-Pong Lemma.
add a comment |
up vote
5
down vote
up vote
5
down vote
The simplest non-abelian example is $F_2$, with generating set $S={a,b}$. The elements are just reduced words of the form $a^{r_1}b^{s_1}cdots a^{r_n}b^{s_n}$. In fact, $F_2$ can be shown to be isomorphic to a matrix subgroup of $SL_2(mathbb{Z})$, namely the subgroup generated by
$$ a =
begin{pmatrix}
1 & 2 \
0 & 1
end{pmatrix},
b =
begin{pmatrix}
1 & 0 \
2 & 1
end{pmatrix},
$$
see the Ping-Pong Lemma.
The simplest non-abelian example is $F_2$, with generating set $S={a,b}$. The elements are just reduced words of the form $a^{r_1}b^{s_1}cdots a^{r_n}b^{s_n}$. In fact, $F_2$ can be shown to be isomorphic to a matrix subgroup of $SL_2(mathbb{Z})$, namely the subgroup generated by
$$ a =
begin{pmatrix}
1 & 2 \
0 & 1
end{pmatrix},
b =
begin{pmatrix}
1 & 0 \
2 & 1
end{pmatrix},
$$
see the Ping-Pong Lemma.
edited Jul 25 '17 at 19:38
answered Jul 25 '17 at 15:50
Dietrich Burde
76.8k64286
76.8k64286
add a comment |
add a comment |
up vote
1
down vote
You have a set $X$. The elements of $F_X$ the free group on $X$ are
"reduced words" in $X$; finite sequences of symbols $x$ and $x^{-1}$
for $xin X$ where no $x$ and $x^{-1}$ are adjacent and including the
empty word, which I'll write as $1$ as it is the identity. So for $X={x,y,z}$ reduced words include $1$, $x$, $y$, $z^{-1}$, $yx$, $xzx^{-1}$, $xxyx^{-1}z^{-1}xzy^{-1}z$ etc. To multiply, concatenate, and cancel any $xx^{-1}$s or $x^{-1}x$s.
If you have $X={x}$ with one element, the reduced words are $1$,
$xxcdots x$ (with $n$ $x$s) and $x^{-1}x^{-1}cdots x^{-1}$ (with $n$ $x^{-1}$s). If we write these instead as $x^0$, $x^n$ and $x^{-n}$
we see that $F_XcongBbb Z$.
Rather perversely, in your notation you have chosen $0$ to be the element. This results in reduced words like $0000$ and $0^{-1}0^{-1}0^{-1}$. These can cause confusion...
add a comment |
up vote
1
down vote
You have a set $X$. The elements of $F_X$ the free group on $X$ are
"reduced words" in $X$; finite sequences of symbols $x$ and $x^{-1}$
for $xin X$ where no $x$ and $x^{-1}$ are adjacent and including the
empty word, which I'll write as $1$ as it is the identity. So for $X={x,y,z}$ reduced words include $1$, $x$, $y$, $z^{-1}$, $yx$, $xzx^{-1}$, $xxyx^{-1}z^{-1}xzy^{-1}z$ etc. To multiply, concatenate, and cancel any $xx^{-1}$s or $x^{-1}x$s.
If you have $X={x}$ with one element, the reduced words are $1$,
$xxcdots x$ (with $n$ $x$s) and $x^{-1}x^{-1}cdots x^{-1}$ (with $n$ $x^{-1}$s). If we write these instead as $x^0$, $x^n$ and $x^{-n}$
we see that $F_XcongBbb Z$.
Rather perversely, in your notation you have chosen $0$ to be the element. This results in reduced words like $0000$ and $0^{-1}0^{-1}0^{-1}$. These can cause confusion...
add a comment |
up vote
1
down vote
up vote
1
down vote
You have a set $X$. The elements of $F_X$ the free group on $X$ are
"reduced words" in $X$; finite sequences of symbols $x$ and $x^{-1}$
for $xin X$ where no $x$ and $x^{-1}$ are adjacent and including the
empty word, which I'll write as $1$ as it is the identity. So for $X={x,y,z}$ reduced words include $1$, $x$, $y$, $z^{-1}$, $yx$, $xzx^{-1}$, $xxyx^{-1}z^{-1}xzy^{-1}z$ etc. To multiply, concatenate, and cancel any $xx^{-1}$s or $x^{-1}x$s.
If you have $X={x}$ with one element, the reduced words are $1$,
$xxcdots x$ (with $n$ $x$s) and $x^{-1}x^{-1}cdots x^{-1}$ (with $n$ $x^{-1}$s). If we write these instead as $x^0$, $x^n$ and $x^{-n}$
we see that $F_XcongBbb Z$.
Rather perversely, in your notation you have chosen $0$ to be the element. This results in reduced words like $0000$ and $0^{-1}0^{-1}0^{-1}$. These can cause confusion...
You have a set $X$. The elements of $F_X$ the free group on $X$ are
"reduced words" in $X$; finite sequences of symbols $x$ and $x^{-1}$
for $xin X$ where no $x$ and $x^{-1}$ are adjacent and including the
empty word, which I'll write as $1$ as it is the identity. So for $X={x,y,z}$ reduced words include $1$, $x$, $y$, $z^{-1}$, $yx$, $xzx^{-1}$, $xxyx^{-1}z^{-1}xzy^{-1}z$ etc. To multiply, concatenate, and cancel any $xx^{-1}$s or $x^{-1}x$s.
If you have $X={x}$ with one element, the reduced words are $1$,
$xxcdots x$ (with $n$ $x$s) and $x^{-1}x^{-1}cdots x^{-1}$ (with $n$ $x^{-1}$s). If we write these instead as $x^0$, $x^n$ and $x^{-n}$
we see that $F_XcongBbb Z$.
Rather perversely, in your notation you have chosen $0$ to be the element. This results in reduced words like $0000$ and $0^{-1}0^{-1}0^{-1}$. These can cause confusion...
answered Jul 25 '17 at 15:18
Lord Shark the Unknown
98.1k958131
98.1k958131
add a comment |
add a comment |
up vote
0
down vote
The identity in F is the empty word. This alleviates your problem because X consists of elements of F (not "0"). X has no identity. X isn't a group; it's just a set.
add a comment |
up vote
0
down vote
The identity in F is the empty word. This alleviates your problem because X consists of elements of F (not "0"). X has no identity. X isn't a group; it's just a set.
add a comment |
up vote
0
down vote
up vote
0
down vote
The identity in F is the empty word. This alleviates your problem because X consists of elements of F (not "0"). X has no identity. X isn't a group; it's just a set.
The identity in F is the empty word. This alleviates your problem because X consists of elements of F (not "0"). X has no identity. X isn't a group; it's just a set.
answered Jul 25 '17 at 17:55
Chris Custer
9,3653624
9,3653624
add a comment |
add a comment |
up vote
0
down vote
Whilst it is important to understand the formal definition of free groups, I shall give you a more geometric example heralding from algebraic topology, because intuitively it is more of use.
Imagine that you have a flower which has only two petals. Consider also that the meeting point of these two petals is of dimension 0 (namely it is a point). Now, the free group on two generators describes exactly the difficulty for a small insect to walk on the contour of the petals (no flying's allowed!). This "difficulty" is formally defined in algebraic topology as the fundamental group of that surface. Obviously, if you had a flower with k-petals (imagine a bouquet), then the free group on k generators would express the respective difficulty to walk on all these petals.
add a comment |
up vote
0
down vote
Whilst it is important to understand the formal definition of free groups, I shall give you a more geometric example heralding from algebraic topology, because intuitively it is more of use.
Imagine that you have a flower which has only two petals. Consider also that the meeting point of these two petals is of dimension 0 (namely it is a point). Now, the free group on two generators describes exactly the difficulty for a small insect to walk on the contour of the petals (no flying's allowed!). This "difficulty" is formally defined in algebraic topology as the fundamental group of that surface. Obviously, if you had a flower with k-petals (imagine a bouquet), then the free group on k generators would express the respective difficulty to walk on all these petals.
add a comment |
up vote
0
down vote
up vote
0
down vote
Whilst it is important to understand the formal definition of free groups, I shall give you a more geometric example heralding from algebraic topology, because intuitively it is more of use.
Imagine that you have a flower which has only two petals. Consider also that the meeting point of these two petals is of dimension 0 (namely it is a point). Now, the free group on two generators describes exactly the difficulty for a small insect to walk on the contour of the petals (no flying's allowed!). This "difficulty" is formally defined in algebraic topology as the fundamental group of that surface. Obviously, if you had a flower with k-petals (imagine a bouquet), then the free group on k generators would express the respective difficulty to walk on all these petals.
Whilst it is important to understand the formal definition of free groups, I shall give you a more geometric example heralding from algebraic topology, because intuitively it is more of use.
Imagine that you have a flower which has only two petals. Consider also that the meeting point of these two petals is of dimension 0 (namely it is a point). Now, the free group on two generators describes exactly the difficulty for a small insect to walk on the contour of the petals (no flying's allowed!). This "difficulty" is formally defined in algebraic topology as the fundamental group of that surface. Obviously, if you had a flower with k-petals (imagine a bouquet), then the free group on k generators would express the respective difficulty to walk on all these petals.
answered Jul 26 '17 at 16:03
Constantinos
815
815
add a comment |
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f2371278%2fwhat-is-a-simple-example-of-a-free-group%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