Instructing Group Theory Concepts from Pre-Kindergarten to College through Movement Activities
AThesis
Presented in Partial Fulfillment of the Requirements for the Degree Master of Mathematical Science in the Graduate School of The Ohio State University
By
Jessica Wheeler, B.A.
Graduate Program in Mathematics
The Ohio State University
2016
Master’s Examination Committee:
Dr. Bart Snapp, Advisor Dr. Rodica Costin, Advisor Dr. Herb Clemens c Copyright by Jessica Wheeler
2016 Abstract
Group theory is a mathematical topic that is usually reserved for upper-level un- dergraduate courses. In this thesis, we will explicitly show the connection between group theory and fundamental mathematics taught in grade school, and present activ- ities designed for pre-k through 3rd,4th through 9th,and7th through 12th grade levels with culminating activities for college level students. Our annotated activities are explicitly connected to standards from the common core, they aim to provide hands- on learning environments for students, and demonstrate that topics from higher level courses have deep connections to fundamental mathematics.
ii This thesis is dedicated to my parents for their support of my education and their
unwavering encouragement.
iii Vita
2010 ...... Karns High School
2014 ...... B.A. Mathematics, Radford University
2014 ...... B.A. Dance, Radford University
2014-present ...... Graduate Teaching Associate, The Ohio State University
Fields of Study
Major Field: Mathematics
iv Table of Contents
Page
Abstract...... ii
Dedication ...... iii
Vita ...... iv
Chapters:
1. Introduction ...... 1
2. Functions,Groups,andGroupActions ...... 3
2.1 Functions ...... 3 2.2 Groups ...... 6 2.2.1 Free Group ...... 7 2.2.2 GroupAction...... 18
3. Pre-Kindergarten to Third Grade ...... 20
3.1 Rational Tangles ...... 20 3.1.1 AllTangledUp! ...... 20 3.1.2 AddingupTangles ...... 25 3.2 Contra Dancing ...... 28 3.2.1 DancingAroundaSquare ...... 28
4. FourthGradetoNinthGrade ...... 34
4.1 Rational Tangles ...... 34 4.1.1 Tangles & Fractions ...... 34 4.2 Contra Dancing ...... 40 4.2.1 Contra Dance Functions ...... 40
v 5. Seventh to Twelfth Grade ...... 46
5.1 Rational Tangles ...... 46 5.1.1 Tangles & Functions ...... 46 5.2 Contra Dancing ...... 53 5.2.1 Math-y Dance ...... 53 5.2.2 Dancing Functions ...... 58
6. College ...... 66
6.1 Rational Tangles ...... 66 6.1.1 Tangles ...... 66 6.2 Contra Dancing ...... 74 6.2.1 PropertiesofContraDanceFigures...... 74 6.2.2 Generators and Relations ...... 81 6.2.3 Free Group ...... 84
7. Irrational Tangles ...... 88
7.1 Rational and Irrational Tangles ...... 88 7.1.1 Connections to the Tangle Group ...... 94
Appendices:
A. Pre-KindergartentoThirdGradeActivities ...... 96
A.1 AllTangledUp! ...... 96 A.2 AddingupTangles ...... 98 A.3 DancingAroundaSquare ...... 100
B. FourthGradetoNinthGradeActivities ...... 105
B.1 Tangles & Fractions ...... 105 B.2 Contra Dance Functions ...... 109
C. SeventhGradetoTwelfthGradeActivities...... 113
C.1 Tangles & Functions ...... 113 C.2 Math-yDance ...... 118 C.3 Dancing Functions ...... 122
vi D. College Activities ...... 128
D.1 Tangles ...... 128 D.2 PropertiesofContraDanceFigures...... 134 D.3 Generators and Relations ...... 140 D.4 Free Group ...... 142
Bibliography ...... 145
vii Chapter 1: Introduction
Group theory is a fundamental topic in mathematics that is typically introduced at the college level. In particular group theory is notably absent from the kindergarten through twelfth grade curriculum. In this thesis we will explicitly show the connection between group theory and fundamental mathematics, and give activities designed for pre-kindergarten through third grade, fourth grade through ninth grade, and seventh grade through twelfth grade with a culmination chapter on activities for college level students.
The subsets of grade levels chosen for these activities are motivated by the grade level cuto↵s for teacher licensures in Ohio. Three main categories for educators in the state of Ohio to be licenced are Early Childhood Licensure, Middle Childhood
Licensure, and Adolescence to Young Adult Licensure. These are separated by the grade levels pre-k – 3, 4 – 9, and 7 – 12, respectively [8].
In this thesis we provide movement activities to help instruct concepts of group theory in a friendly and engaging manner. The activities are based on the ideas of rational tangles and square dancing [7, 14]. Rational tangles is an activity first devised by John Conway and has various mathematical applications [5]. Contra dancing is a folk dance with many dance figures. The activities in the following chapters simplify
1 this folk dance and use only a few basic moves. This allows the dance to be accessible to more students and illustrates the symmetries of a square discussed in Chapter 2.
These activities illustrate ways for students at any level to learn about groups and functions. Each activity corresponds to standards from the Common Core State
Standards Initiative [12]. It is our hope that this may facilitate the use of activities such as these in an actual classroom.
The chapters in this thesis provide annotated activities, and blank activities can be found in the appendix. We also include a final chapter that makes connections between the real numbers and the tangle group discussed in Chapter 2.
2 Chapter 2: Functions, Groups, and Group Actions
2.1 Functions
The concept of a function and functional notation are taught in grade school.
As we will see, functions are also fundamental to group theory. Functions describe relationships between sets.
Definition 1. A set is an aggregation of elements such that one always knows if one given element is in the set or not.
We notate x X to indicate that an object x is an element of the set X.Sets 2 can contain any type of object; they are not restricted to numbers.
Example 2.1.1. S = cat, dog, mouse is a set with 3 elements such that dog S, { } 2 but frog / S. 2 Definition 2. The cartesian product of two sets X and Y is the set X Y with ⇥ elements (x, y)suchthatx X and y Y . 2 2
Two elements (x, y) X Y and (x0,y0) X Y are equal if and only if x = x0 2 ⇥ 2 ⇥ and y = y0.
Example 2.1.2. Let S = cat, dog, mouse and T = spots, furry .Then { } { } (dog, spots) S T while (dog, bark) / S T . 2 ⇥ 2 ⇥ 3 Definition 3. A function with domain X and range Y is a subset f X Y that ✓ ⇥ satisfies the following three properties.
For all x X,thereexistsy Y such that (x, y) f.Thismeansthata • 2 2 2 function must map every element in the domain, or else that element is not in
the domain.
For all y Y ,thereexistsx X such that (x, y) f.Thismeansthata • 2 2 2 function must map to every element in the range or else that element is not in
the range.
If (x, a) f and (x, b) f,thena = b.Thismeansthatforeveryelementin • 2 2 the domain, there is exactly 1 element in the range.
A function is the correspondence between X and Y given as an ordered pair.
Given a function f = (x, y) X Y :(x, y) f ,wewritef : X Y and notate { 2 ⇥ 2 } ! f(x)=y for the mapping of a given element x X to y Y . 2 2
Example 2.1.3. The function f(x)=x is an identity function because it returns the same element as the input.
Example 2.1.4. f(x, y, z)=xyz defines a function with domain X = R3 and range
Y = R.
1 1 The inverse of a function f is denoted by f and we write f = (y, x) Y X : { 2 ⇥ (x, y) X Y . 2 ⇥ }
1 Definition 4. Afunctionf : X Y is invertible if for each y Y , f (y)has ! 2 exactly one element.
4 An invertible function satisfies the properties of a function as well as the property that for every element in the range, there is exactly 1 element in the domain.
Not every function is invertible. Consider the function f(x, y, z)=xyz, f : R3 ! R from Example 2.1.4. 60 is an element in the range that has at least two elements in the domain, (1, 2, 30) and (10, 3, 2), such that f(1, 2, 30) = 60 and f(10, 3, 2) = 60.
Functions can be combined by using the operation of composition.
Definition 5. The composition of two functions f : X Y and g : Y Z is the ! ! function g f : X Z such that g f = (x, z) X Z :(f(x),z) g . ! { 2 ⇥ 2 }
Taking the composition of two functions, g f,isreadfromrighttoleftsuchthat f is mapped to some element in its range, which g then maps to some element of its range.
Theorem 2.1.1 (Functional composition is always associative). Let f, g, and h be functions such that f : X Y , g : Y Z, and h : Z W . Then h (g f)= ! ! ! (h g) f.
Proof. We want to show that h (g f)=(h g) f. By definition of composition of functions,
g f = (x, z) X Z :(f(x),z) g . { 2 ⇥ 2 }
Thus,
h (g f)(x)= (x, w) X W :(g f(x),w) h . { 2 ⇥ 2 }
Now, by definition of composition of functions,
h g = (y, w) Y W :(g(y),w) h . { 2 ⇥ 2 }
5 Thus,
(h g) f = (x, w) X W :(f(x),w) h g . { 2 ⇥ 2 }
If (f(x),w) h g,then(f(x),w) Y W such that (g(f(x)),w) h.Thus, 2 2 ⇥ 2
(h g) f = (x, w) X W :(g f(x),w) h . { 2 ⇥ 2 }
Therefore, h (g f)=(h g) f. 2.2 Groups
As previously mentioned, functions are fundamental to group theory. We will see their connection to groups by first introducing the definition.
Definition 6. A group is a nonempty set G equipped with an operation, ,such that
1. G is closed under the operation ,thatis,iff,g G then f g G. 2 2
2. The operation is associative, meaning that for any elements f,g,h G, f 2 (g h)=(f g) h.
3. G contains an element e,calledtheidentity,suchthatg e = e g = g for all g G. 2
1 1 1 4. Every element g G has an inverse, g ,suchthatg g = e and g g = e. 2
We can in fact think of the definition of a group as an algebraic description of what it means to be a set of invertible functions that are closed under composition.
Asetofinvertiblefunctionsthatareclosedundercompositionimmediatelysatisfies
1 properties 1 and 4. Property 3 is satisfied since f f = e for any function in our set. 6 Functional composition is always associative by Theorem 2.1.1, satisfying property 2.
Thus, our claim above is true.
2.2.1 Free Group
While there are many excellent choices of groups to start with: the integers, cyclic group, dihedral group, symmetric group, etc., we choose to start with free groups.
The definition of a free group has many nice connections to grade school curriculum.
It also allows us to discuss groups in terms of generators and relations. We will use this characterization of a group to discuss two main examples that will be referenced in the following chapters.
Consider the set A = a . Using A as an alphabet,wecancreatewords through { } the operation of concatenation a
aa
aaa
aaaa
··· It is convenient to notate these words as a1, a2, a3, a4,etc.,respectively.Words can also be created by concatenating two words together. If aj and ak are words, then ajak = aj+k is also a word. Also, words are equal if and only if their string lengths are equal. For example, am and an are equal if and only if m = n.Wewilldenote the set of words on A by F [A]. Thus, concatenation is a binary operation mapping
F [A] F [A] F [A]. ⇥ ! The definition of concatenation is identical to the exponential rules found in high school. When multiplying two exponents of the same base, the rule is to add the
7 exponents. For example, x4x7 = x4+7 = x11.Thisisidenticaltoconcatenatingtwo words together.
The concatenation operation is also associative. Given a word ajakal we see that
(ajak)al = aj+kal
= aj+k+l
= ajak+l
= aj(akal)
Thus, F [A]isasemigroup.
Definition 7. A semigroup is a nonempty set G equipped with an operation, , such that
1. G is closed under the operation .Iff,g G then f g G. 2 2
2. The operation is associative. For any elements f,g,h G, f (g h)=(f g) h. 2
In concatenation we simply omit the symbol ,thatis,a a is denoted by aa. The word containing no letters is denoted by e and is called the empty word,and it is conveniently denoted by a0.Ifweconcatenateanywordwiththeemptyword, we are left with the original word. Consider the word ak.Then
ake = aka0
= ak+0
= ak and eak = a0ak
= a0+k
= ak
8 We again see the connection to the high school exponential rules since we choose to denote the empty word by a0:anyvalueraisedtothepowerof0is1.Thus, x0xk =1xk = xk. So, concatenating words with the empty word directly relates to the property of multiplying values by 1.
The empty word is an identity element for our set A = a under the operation { } of concatenation. Now including the identity element, our set of words formed by the alphabet A, F [A], is a monoid.
Definition 8. A monoid is a nonempty set G equipped with an operation, ,such that
1. G is closed under the operation .Iff,g G then f g G. 2 2
2. The operation is associative. For any elements f,g,h G, f (g h)=(f g) h. 2
3. G contains an element e,calledtheidentity,suchthatg e = e g = g for all g G. 2
1 Let a denote a new letter, called the inverse element of a,whichweassumeto
1 1 obey the rule aa = e = a a.Weextendthedefinitionofawordformedbythe
1 alphabet A by allowing strings of both a and a in any order, where repetition is
1 1 allowed. A word is then reduced if all instances of aa and a a are replaced by e.LetF [A]denotethesetofallreducedwordsformedbythealphabetA with the operation of concatenation. F [A]isnowagroup.
In general, if A = a is any set, we can further extend the definition of a word { i} on A and reduced words.
Definition 9. A word on A is a sequence of the elements a A and their inverses i 2 1 ai joined by concatenation where repetition is allowed.
9 ✏1 ✏2 ✏3 Definition 10. [11] A word a1 a2 a3 ... is a reduced word if it satisfies the follow- ing.
1 1. a and a are not adjacent for all a A. i i 2
2. If a = e then a = e for all j k. k j
Example 2.2.1. Consider a set of red and black chips. Let each red chip represent
1andeachblackchiprepresent+1.Thus,everycombinationof1redchipand1 1 black chip returns an overall value of 0. We can think that a =ablackchipanda = a red chip. Addition of positive and negative values can be represented by using this chip model. For example, 4 7=4+( 7) can be represented by combining 4 black chips with 7 red chips. We can match up one red chip and one black chip at a time until there are no more matches. Since 4 red chips can match up with 4 black chips, we are left with 3 single red chips. The pairs all have a value of 0 and the three red chips have a value of 3. Thus, the value of 4 7is0+0+0+0 3= 3.
Example 2.2.1 illustrates the process of reducing a word. Part 1 of Definition 10 corresponds to the process of matching pairs of red and black chips. Inverse elements cancel each other out just as a red chip cancels out a black chip. Part 2 is illustrated in the last step of Example 2.2.1. In our chip model, we replace 0 + 0 + 0 + 0 3with 3. Once part 1 is satisfied, we remove e unless the word overall is e. Again, F [A]asdefinedasthesetofallreducedwordsonA is a group. As we have defined F [A], A is a generating set of F [A].
Definition 11. Let S be a subset of a group G. S is said to generate G if it has the property such that all the elements of G can be written as products of elements of S and their inverses.
10 Example 2.2.2. Consider a wagon wheel with 8 spokes:
As the wagon moves to the right, the wheel must rotate. We can see the rotational symmetry in this wheel as it rotates in increments of 45 . Notate a 45 rotation
2 3 clockwise by ⇢.Thus,⇢ is a 90 rotation, ⇢ is a 135 rotation, and so on. If the wagon were to move left, the wheel would rotate counterclockwise. Since this movement is the opposite of rotating clockwise, we can denote a 45 rotation counterclockwise by
1 ⇢ .
Example 2.2.2 illustrates how ⇢ is a function that generates all possible positions that map the wheel onto itself. A given position of the wheel can be described as some string of ⇢ and its inverse.
Given a group G and a set S that generates G, G defined to be a free group when it is free of all relations.Moreexplicitly,theelementsinthesetA are free of relations.
Definition 12. Equations in a group G that are satisfied by the generators are called relations.
In Example 2.2.2 ⇢8 = e.Thisrelationiscalledanequationsatisfiedbythe generator, ⇢.
Definition 13. If A is a set such that the elements satisfy no relations, and F [A]is the set of all reduced words on A,thenF [A]isthefree group generated by A.
The universal property of a free group uniquely defines the relationship between asetA,agroupG,andafreegroupF [A].
11 Definition 14. Let G and H be groups under the operations and ,respectively. • Afunctionf : G H is a homomorphism if !
f(x y)=f(x) f(y) • for all x, y G. 2
AhomomorphismrelatesthestructuresofthetwogroupsG and H.
Example 2.2.3. Consider the following two groups: the integers, Z, under the oper- ation of addition and the free group on one generator, F [A], where A = a .There { } is a homomorphism where : F [A] Z. Using our convenient notation of words on ! A as ak, we define the homomorphism as (ak)=k.Wecancheckthatthisfunction satisfies the conditions from Definition 14. For all k, l Z, 2