Kite'sthoughts on twin squares: Difference between revisions

(5 intermediate revisions by the same user not shown)

Line 3:

<math>

\begin{array} {rrr}

~~per~~ \\

period \\

~~gen~~ \\

generator \\

~~com \\~~

comma \\

~~\end{array}~~

~~\begin{array} {r}~~

~~2 & 3 & 5~~ \\

\end{array}

\left[ \begin{array} {rrr}

Line 33:

Line 30:

* discard the rows in the mapping matrix that corresponds to those commas

The two matrices follow a simple rule: the dot product of any row in one with any row in another is 1 if the 2 rows are opposite each other (e.g. 2nd row of each matrix), and 0 if not (e.g. 1st row of one and 3rd row of the other). Thus one can easily verify that one is the inverse of the other. In fact, it's not too difficult to derive both matrices from either the comma list or the mapping. One proceeds step by step, checking as ~~you go~~, similar to solving a sudoku puzzle.

The two matrices follow a simple rule: the dot product of any row in one with any row in another is 1 if the two rows are opposite each other (e.g. 2nd row of each matrix), and 0 if not (e.g. 1st row of one and 3rd row of the other). Thus one can easily verify that one is the inverse of the other. In fact, it's not too difficult to derive both matrices from either the comma list or the mapping. One proceeds step by step, checking as one goes, similar to solving a sudoku puzzle.

[[Category:Mapping]]

@@ Line 3: / Line 3: @@
 <math>
 \begin{array} {rrr}
-per \\
+period \\
-gen \\
+generator \\
-com \\
+comma \\
-\end{array}
-\begin{array} {r}
-& 3 & 5 \\
 \end{array}
 \left[ \begin{array} {rrr}
@@ Line 33: / Line 30: @@
 * discard the rows in the mapping matrix that corresponds to those commas
-The two matrices follow a simple rule: the dot product of any row in one with any row in another is 1 if the 2 rows are opposite each other (e.g. 2nd row of each matrix), and 0 if not (e.g. 1st row of one and 3rd row of the other). Thus one can easily verify that one is the inverse of the other. In fact, it's not too difficult to derive both matrices from either the comma list or the mapping. One proceeds step by step, checking as you go, similar to solving a sudoku puzzle.
+The two matrices follow a simple rule: the dot product of any row in one with any row in another is 1 if the two rows are opposite each other (e.g. 2nd row of each matrix), and 0 if not (e.g. 1st row of one and 3rd row of the other). Thus one can easily verify that one is the inverse of the other. In fact, it's not too difficult to derive both matrices from either the comma list or the mapping. One proceeds step by step, checking as one goes, similar to solving a sudoku puzzle.
 [[Category:Mapping]]
 {{todo|review}}