Projects
days until the end of spring semester.days until Snakes on a Plane.
Boxes unpacked
Math article project
Finished mathematical core of article. Next: Write analytical core of article.
Dummit and Foote, Abstract Algebra
Finished section 1.6 (86 to go)
Silverman and Tate, Rational Points on Elliptic Curves
FInished 2.5 (31 to go)
Conway, Functions of One Complex Variable I
Finished section 7.5 (27 to go)
Munkres, Topology
Finished section 21 (60 to go)
Royden, Real Analysis
Finished section 2.4 (97 to go)
Nonfiction book project
Todo list uptodate
Fiction book project
1443 out of 100,000 projected words written.
Top 100 novels of all time
Reading Ulysses
IMDB top 250 films
Tengoku to jigoku next in queue.
Blogroll
This academic life
Academic CoachConfessions of a Community College Dean
Learning Curves
The Little Professor
My Hiding Place
New Kid on the Hallway
One Bright Star
Planned Obsolescence
Tall, Dark, and Mysterious
Math blogs
Ars MathematicaMathForge
MathPuzzle
Think Again
Archives

July 2003
August 2003
September 2003
October 2003
November 2003
December 2003
January 2004
February 2004
March 2004
April 2004
May 2004
June 2004
July 2004
August 2004
September 2004
October 2004
December 2004
January 2005
March 2005
April 2005
May 2005
June 2005
July 2005
August 2005
September 2005
October 2005
November 2005
December 2005
January 2006
February 2006
March 2006
April 2006
May 2006
Vito Prosciutto: Teaching community college math on the road to a PhD.
Wednesday, September 10, 2003
10:36My little mathematical breakthrough
For readers who may not have studied abstract algebra, let me back up and explain what these terms mean.
First, a group consists of a set and a binary operation (for example, the set of integers and the operation +) with the following requirements:
 There exists an identity (we'll call it e) such that e+a=a+e=a for all a in the set (note that I'm using + as my operation here).
 The associative law applies.
 For each a in the set there exists an element a^{1} such that a+a^{1}=a^{1}+a=e
Note that we do not require a commutative law, and there are plenty of groups which meet the above requirements but are not commutative (one of the most notable being the set of invertible 2x2 matrices with the operation being binary multiplication).
When we talk about the order of a group, it's the number of elements in the group. The order of the group defined by integers and addition is infinite. On the other hand, if we choose the set of complex numbers {1, 1, i, i} and the operation multiplication, the order of this group will be 4.
When we talk about the order of an element we mean the smallest positive integer k such that a^{k}=e. The order of the identity is always 1, and with addition and integers all non0 integers have infinite order (note that in this instance when we talk about a^{k}, we really mean ka.
For our second example, the order of 1 will be 2 ((1)^{2}=1), the order of i will be 4 (i^{4}=1), and the order of i will also be 4.
One of the easiest ways to verify that you have a group is to construct the multiplication table and if you can have each element of the set appear exactly once in each row and column, then you have a group. I played around with some ideas using the set of whole numbers for a while trying to make a^{2}=e for all elements and this morning I finally hit upon an arrangement which worked. Looking at patterns I realized that my binary operation was a bitwise binary exclusive or. For nonCS types reading this, the operation works by expressing the two nonnegative integers in binary. In each bit position, the result will be 1 if only one of the two integers has that bit position on, 0 otherwise. So, for example, 5$3 will have the bits 101 and 011 and will result in 110 or 6 as its result. For any number a 0$a=a and a$a=0.
In fact, we can extend this to an infinite number of groups by taking the breakdown of an integer in base n and having a$b being the sum of each digit position being taken mod n. This is actually the additive group of polynomials Z/nZ[x] but without the upper limit on the power of polynomials (although it seems to me that the upper limit of the exponents should be n1. In this instance, the order of each element will be no greater than n.
After coming up with this, I also realized that if we take the set of complex numbers with the property that x^{k}=1 for some integer k, we also have a finite order for every element in the group, although here it's not bounded.
I'm afraid this might not be as clear as I'd like it to be, but it should be possible for someone with some basic group theory to follow this argument at least in outline.