Difference between revisions of "Free group"
ComplexZeta (talk | contribs) |
m |
||
(6 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
− | A '''free group''' is a type of [[group]] that is of particular importance in [[combinatorics]]. Let <math>I</math> be any nonempty [[ | + | A '''free group''' is a type of [[group]] that is of particular importance in [[combinatorics]]. Let <math>I</math> be any [[nonempty]] index [[set]]. Informally, a free group on <math>I</math> is the collection of [[finite]] strings of characters from the collection <math>\{X_i,X_i^{-1}:i\in I\}</math> subject only to the criterion that <math>X_iX_i^{-1}=X_i^{-1}X_i=1</math> where <math>1</math> is the group [[identity]] and is equal to the empty string. The group [[operation]] is concatenation. |
+ | |||
+ | An example of an element of the free group on <math>I = \{1, 2\}</math> is <math>X_1X_2^{-1}X_1^{-1}X_2^3</math> (where by <math>X_2^3</math> we mean <math>X_2X_2X_2</math>). | ||
+ | |||
+ | The [[inverse with respect to an operation | inverse]] of a given element of a free group can be found by reversing the string and the sign of all exponents. Thus, the string given above has inverse <math>X_2^{-3}X_1X_2X_1^{-1}</math>. This is easy to check: we just apply the group operation to the two strings to get <cmath>\begin{align*}X_2^{-3}X_1X_2X_1^{-1}X_1X_2^{-1}X_1^{-1}X_2^3 &= X_2^{-3}X_1X_2X_2^{-1}X_1^{-1}X_2^3\\ &= X_2^{-3}X_1X_1^{-1}X_2^3\\ &= X_2^{-3}X_2^3 = 1 \;.\end{align*}</cmath> (Note that we implicitly used the [[associativity]] of the group operation repeatedly in this process.) Showing that this string is a right inverse is equally straightforward. The proof that this holds for every string is by [[induction]] using the same idea. | ||
More formally, free groups are defined by [[universal property|universal properties]]. A group <math>F</math> is called a free group on <math>I</math> if there is a function <math>\phi:I\to F</math> so that for any group <math>G</math> and a function <math>\theta:I\to G</math>, there is a unique group homomorphism <math>\psi:F\to G</math> so that <math>\theta=\psi\phi</math>, i.e. so that <math>\theta(i)=\psi\circ\phi(i)</math> for all <math>i\in I</math>. We often like to draw a diagram to represent this relationship; however WE DON'T HAVE THE xy PACKAGE INCLUDED, SO I CAN'T TeX IT. | More formally, free groups are defined by [[universal property|universal properties]]. A group <math>F</math> is called a free group on <math>I</math> if there is a function <math>\phi:I\to F</math> so that for any group <math>G</math> and a function <math>\theta:I\to G</math>, there is a unique group homomorphism <math>\psi:F\to G</math> so that <math>\theta=\psi\phi</math>, i.e. so that <math>\theta(i)=\psi\circ\phi(i)</math> for all <math>i\in I</math>. We often like to draw a diagram to represent this relationship; however WE DON'T HAVE THE xy PACKAGE INCLUDED, SO I CAN'T TeX IT. | ||
+ | |||
+ | ===Commutivity in Free Groups=== | ||
+ | The free group over <math>I</math> has "as little structure as possible." Thus, we can show that two elements of the free group [[commute]] only when it's "necessary": | ||
+ | If <math>u, v</math> are elements of the free group over a set <math>I</math> and <math>uv = vu</math>, then <math>u^m = v^n</math>, for some [[integer]]s <math>m</math> and <math>n</math>. | ||
+ | |||
+ | ====Proof==== | ||
+ | |||
{{stub}} | {{stub}} | ||
+ | |||
+ | [[Category:Group theory]] |
Latest revision as of 17:54, 16 March 2012
A free group is a type of group that is of particular importance in combinatorics. Let be any nonempty index set. Informally, a free group on
is the collection of finite strings of characters from the collection
subject only to the criterion that
where
is the group identity and is equal to the empty string. The group operation is concatenation.
An example of an element of the free group on is
(where by
we mean
).
The inverse of a given element of a free group can be found by reversing the string and the sign of all exponents. Thus, the string given above has inverse . This is easy to check: we just apply the group operation to the two strings to get
(Note that we implicitly used the associativity of the group operation repeatedly in this process.) Showing that this string is a right inverse is equally straightforward. The proof that this holds for every string is by induction using the same idea.
More formally, free groups are defined by universal properties. A group is called a free group on
if there is a function
so that for any group
and a function
, there is a unique group homomorphism
so that
, i.e. so that
for all
. We often like to draw a diagram to represent this relationship; however WE DON'T HAVE THE xy PACKAGE INCLUDED, SO I CAN'T TeX IT.
Commutivity in Free Groups
The free group over has "as little structure as possible." Thus, we can show that two elements of the free group commute only when it's "necessary":
If
are elements of the free group over a set
and
, then
, for some integers
and
.
Proof
This article is a stub. Help us out by expanding it.