Changes

MyWikiBiz, Author Your Legacy — Monday December 23, 2024
Jump to navigationJump to search
→‎Note 19: edit + markup
Line 3,491: Line 3,491:     
==Note 19==
 
==Note 19==
 +
 +
So long as we're in the neighborhood, we might as well take in some more of the sights, for instance, the smallest example of a non-abelian (non-commutative) group.  This is a group of six elements, say, <math>G = \{ \operatorname{e}, \operatorname{f}, \operatorname{g}, \operatorname{h}, \operatorname{i}, \operatorname{j} \},\!</math> with no relation to any other employment of these six symbols being implied, of course, and it can be most easily represented as the permutation group on a set of three letters, say, <math>X = \{ A, B, C \},\!</math> usually notated as <math>G = \operatorname{Sym}(X)</math> or more abstractly and briefly, as <math>\operatorname{Sym}(3)</math> or <math>S_3.\!</math>  The next Table shows the intended correspondence between abstract group elements and the permutation or substitution operations in <math>\operatorname{Sym}(X).</math>
    
<pre>
 
<pre>
| Consider what effects that might 'conceivably'
  −
| have practical bearings you 'conceive' the
  −
| objects of your 'conception' to have.  Then,
  −
| your 'conception' of those effects is the
  −
| whole of your 'conception' of the object.
  −
|
  −
| Charles Sanders Peirce,
  −
| "Maxim of Pragmaticism", CP 5.438.
  −
  −
So long as we're in the neighborhood, we might as well take in
  −
some more of the sights, for instance, the smallest example of
  −
a non-abelian (non-commutative) group.  This is a group of six
  −
elements, say, G = {e, f, g, h, i, j}, with no relation to any
  −
other employment of these six symbols being implied, of course,
  −
and it can be most easily represented as the permutation group
  −
on a set of three letters, say, X = {A, B, C}, usually notated
  −
as G = Sym(X) or more abstractly and briefly, as Sym(3) or S_3.
  −
Here are the permutation (= substitution) operations in Sym(X):
  −
   
Table 2.  Permutations or Substitutions in Sym_{A, B, C}
 
Table 2.  Permutations or Substitutions in Sym_{A, B, C}
 
o---------o---------o---------o---------o---------o---------o
 
o---------o---------o---------o---------o---------o---------o
Line 3,527: Line 3,510:  
|        |        |        |        |        |        |
 
|        |        |        |        |        |        |
 
o---------o---------o---------o---------o---------o---------o
 
o---------o---------o---------o---------o---------o---------o
 +
</pre>
   −
Here is the operation table for S_3, given in abstract fashion:
+
Here is the operation table for <math>S_3,\!</math> given in abstract fashion:
    +
<pre>
 
Table 3.  Symmetric Group S_3
 
Table 3.  Symmetric Group S_3
   Line 3,569: Line 3,554:  
|                      \ /
 
|                      \ /
 
|                        ¯
 
|                        ¯
 +
</pre>
   −
By the way, we will meet with the symmetric group S_3 again
+
By the way, we will meet with the symmetric group <math>S_3\!</math> again when we return to take up the study of Peirce's early paper "On a Class of Multiple Algebras" (CP 3.324&ndash;327), and also his late unpublished work "The Simplest Mathematics" (1902) (CP 4.227&ndash;323), with particular reference to the section that treats of "Trichotomic Mathematics" (CP 4.307&ndash;323).
when we return to take up the study of Peirce's early paper
  −
"On a Class of Multiple Algebras" (CP 3.324-327), and also
  −
his late unpublished work "The Simplest Mathematics" (1902)
  −
(CP 4.227-323), with particular reference to the section
  −
that treats of "Trichotomic Mathematics" (CP 4.307-323).
  −
</pre>
      
==Work Area==
 
==Work Area==
12,080

edits

Navigation menu