Line 3,221: |
Line 3,221: |
| |} | | |} |
| | | |
− | <pre>
| + | It is part of the definition of a group that the 3-adic relation <math>L \subseteq G^3</math> is actually a function <math>L : G \times G \to G.</math> It is from this functional perspective that we can see an easy way to derive the two regular representations. Since we have a function of the type <math>L : G \times G \to G,</math> we can define a couple of substitution operators: |
− | It is part of the definition of a group that the 3-adic | |
− | relation L c G^3 is actually a function L : G x G -> G. | |
− | It is from this functional perspective that we can see | |
− | an easy way to derive the two regular representations. | |
| | | |
− | Since we have a function of the type L : G x G -> G,
| + | {| align="center" cellpadding="6" width="90%" |
− | we can define a couple of substitution operators:
| + | | valign="top" | 1. |
| + | | <math>\operatorname{Sub}(x, (\underline{~~}, y))</math> puts any specified <math>x\!</math> into the empty slot of the rheme <math>(\underline{~~}, y),</math> with the effect of producing the saturated rheme <math>(x, y)\!</math> that evaluates to <math>xy.\!</math> |
| + | |- |
| + | | valign="top" | 2. |
| + | | <math>\operatorname{Sub}(x, (y, \underline{~~}))</math> puts any specified <math>x\!</math> into the empty slot of the rheme <math>(y, \underline{~~}),</math> with the effect of producing the saturated rheme <math>(y, x)\!</math> that evaluates to <math>yx.\!</math> |
| + | |} |
| | | |
− | 1. Sub(x, <_, y>) puts any specified x into | + | In (1) we consider the effects of each <math>x\!</math> in its practical bearing on contexts of the form <math>(\underline{~~}, y),</math> as <math>y\!</math> ranges over <math>G,\!</math> and the effects are such that <math>x\!</math> takes <math>(\underline{~~}, y)</math> into <math>xy,\!</math> for <math>y\!</math> in <math>G,\!</math> all of which is notated as <math>x = \{ (y : xy) ~|~ y \in G \}.</math> The pairs <math>(y : xy)\!</math> can be found by picking an <math>x\!</math> from the left margin of the group operation table and considering its effects on each <math>y\!</math> in turn as these run across the top margin. This aspect of pragmatic definition we recognize as the regular ante-representation: |
− | the empty slot of the rheme <_, y>, with
| |
− | the effect of producing the saturated
| |
− | rheme <x, y> that evaluates to xy.
| |
| | | |
− | 2. Sub(x, <y, _>) puts any specified x into
| + | {| align="center" cellpadding="6" width="90%" |
− | the empty slot of the rheme <y, _>, with
| + | | align="center" | |
− | the effect of producing the saturated
| + | <math>\begin{matrix} |
− | rheme <y, x> that evaluates to yx.
| + | \operatorname{e} |
| + | & = & \operatorname{e}\!:\!\operatorname{e} |
| + | & + & \operatorname{f}\!:\!\operatorname{f} |
| + | & + & \operatorname{g}\!:\!\operatorname{g} |
| + | & + & \operatorname{h}\!:\!\operatorname{h} |
| + | \\[4pt] |
| + | \operatorname{f} |
| + | & = & \operatorname{e}\!:\!\operatorname{f} |
| + | & + & \operatorname{f}\!:\!\operatorname{e} |
| + | & + & \operatorname{g}\!:\!\operatorname{h} |
| + | & + & \operatorname{h}\!:\!\operatorname{g} |
| + | \\[4pt] |
| + | \operatorname{g} |
| + | & = & \operatorname{e}\!:\!\operatorname{g} |
| + | & + & \operatorname{f}\!:\!\operatorname{h} |
| + | & + & \operatorname{g}\!:\!\operatorname{e} |
| + | & + & \operatorname{h}\!:\!\operatorname{f} |
| + | \\[4pt] |
| + | \operatorname{h} |
| + | & = & \operatorname{e}\!:\!\operatorname{h} |
| + | & + & \operatorname{f}\!:\!\operatorname{g} |
| + | & + & \operatorname{g}\!:\!\operatorname{f} |
| + | & + & \operatorname{h}\!:\!\operatorname{e} |
| + | \end{matrix}</math> |
| + | |} |
| | | |
− | In (1), we consider the effects of each x in its | + | In (2) we consider the effects of each <math>x\!</math> in its practical bearing on contexts of the form <math>(y, \underline{~~}),</math> as <math>y\!</math> ranges over <math>G,\!</math> and the effects are such that <math>x\!</math> takes <math>(y, \underline{~~})</math> into <math>yx,\!</math> for <math>y\!</math> in <math>G,\!</math> all of which is notated as <math>x = \{ (y : yx) ~|~ y \in G \}.</math> The pairs <math>(y : yx)\!</math> can be found by picking an <math>x\!</math> from the top margin of the group operation table and considering its effects on each <math>y\!</math> in turn as these run down the left margin. This aspect of pragmatic definition we recognize as the regular post-representation: |
− | practical bearing on contexts of the form <_, y>, | |
− | as y ranges over G, and the effects are such that | |
− | x takes <_, y> into xy, for y in G, all of which | |
− | is summarily notated as x = {<y : xy> : y in G}. | |
− | The pairs <y : xy> can be found by picking an x | |
− | from the left margin of the group operation table | |
− | and considering its effects on each y in turn as | |
− | these run across the top margin. This aspect of | |
− | pragmatic definition we recognize as the regular | |
− | ante-representation:
| |
| | | |
− | e = e:e + f:f + g:g + h:h
| + | {| align="center" cellpadding="6" width="90%" |
| + | | align="center" | |
| + | <math>\begin{matrix} |
| + | \operatorname{e} |
| + | & = & \operatorname{e}\!:\!\operatorname{e} |
| + | & + & \operatorname{f}\!:\!\operatorname{f} |
| + | & + & \operatorname{g}\!:\!\operatorname{g} |
| + | & + & \operatorname{h}\!:\!\operatorname{h} |
| + | \\[4pt] |
| + | \operatorname{f} |
| + | & = & \operatorname{e}\!:\!\operatorname{f} |
| + | & + & \operatorname{f}\!:\!\operatorname{e} |
| + | & + & \operatorname{g}\!:\!\operatorname{h} |
| + | & + & \operatorname{h}\!:\!\operatorname{g} |
| + | \\[4pt] |
| + | \operatorname{g} |
| + | & = & \operatorname{e}\!:\!\operatorname{g} |
| + | & + & \operatorname{f}\!:\!\operatorname{h} |
| + | & + & \operatorname{g}\!:\!\operatorname{e} |
| + | & + & \operatorname{h}\!:\!\operatorname{f} |
| + | \\[4pt] |
| + | \operatorname{h} |
| + | & = & \operatorname{e}\!:\!\operatorname{h} |
| + | & + & \operatorname{f}\!:\!\operatorname{g} |
| + | & + & \operatorname{g}\!:\!\operatorname{f} |
| + | & + & \operatorname{h}\!:\!\operatorname{e} |
| + | \end{matrix}</math> |
| + | |} |
| | | |
− | f = e:f + f:e + g:h + h:g
| + | If the ante-rep looks the same as the post-rep, now that I'm writing them in the same dialect, that is because <math>V_4\!</math> is abelian (commutative), and so the two representations have the very same effects on each point of their bearing. |
− | | |
− | g = e:g + f:h + g:e + h:f
| |
− | | |
− | h = e:h + f:g + g:f + h:e
| |
− | | |
− | In (2), we consider the effects of each x in its
| |
− | practical bearing on contexts of the form <y, _>,
| |
− | as y ranges over G, and the effects are such that
| |
− | x takes <y, _> into yx, for y in G, all of which
| |
− | is summarily notated as x = {<y : yx> : y in G}.
| |
− | The pairs <y : yx> can be found by picking an x
| |
− | from the top margin of the group operation table
| |
− | and considering its effects on each y in turn as
| |
− | these run down the left margin. This aspect of
| |
− | pragmatic definition we recognize as the regular
| |
− | post-representation:
| |
− | | |
− | e = e:e + f:f + g:g + h:h
| |
− | | |
− | f = e:f + f:e + g:h + h:g
| |
− | | |
− | g = e:g + f:h + g:e + h:f
| |
− | | |
− | h = e:h + f:g + g:f + h:e
| |
− | | |
− | If the ante-rep looks the same as the post-rep, | |
− | now that I'm writing them in the same dialect, | |
− | that is because V_4 is abelian (commutative), | |
− | and so the two representations have the very | |
− | same effects on each point of their bearing. | |
− | </pre>
| |
| | | |
| ==Note 17== | | ==Note 17== |