[Bilingual]Klein四元群的四个例子Four examples of Klein four-group

Klein四元群的结构 Structure of Klein four-group

Klein四元群$K$是满足下列乘法表的群

Klein four-group is the group satisfying the following multpilicative table

$$\begin{array}{|c|c|c|c|c|}\hline    \cdot & 1  & a & b & c \\ \hline 1 & 1& a & b & c \\ \hline a & a & 1 & c & b \\ \hline b & b & c & 1 & a \\ \hline c & c & b & a & 1  \\ \hline \end{array}$$

显然，$K\cong \mathbb{Z}/2\times \mathbb{Z}/2$，这是最小的非循环群。

Clearly, $K\cong \mathbb{Z}/2\times \mathbb{Z}/2$, which is the smallest non-cyclic group. 

我们知道如下三个事实

We know the following three facts

• 毫无疑问，$K$的自同构群是第三个对称群$\mathfrak{S}_3$. 

  There is no doubt that the automorphism group is the 3rd symmatric group $\mathfrak{S}_3$. 

• Klein四元群的特征表是

  The character table of Klein four group is 

  $$\begin{array}{|c|c|c|c|c|}\hline  & 1 & a & b & c \\ \hline 1 & 1 & 1 & 1 & 1 \\ \hline \chi_a & 1 & 1 & -1 & -1 \\ \hline \chi_b & 1 & -1 & 1 & -1 \\ \hline \chi_c &1 & -1 & -1 & 1\\ \hline \end{array}$$

• 最小的忠实置换表示是$\{1, (12)(34), (13)(24), (14)(23)\}\subseteq \mathfrak{S}_4$. 

  The minimal faithful permutation representaion is $\{1, (12)(34), (13)(24), (14)(23)\}\subseteq \mathfrak{S}_4$. 

上述皆可由由下述解释。考虑三维空间中以$(1,1,1), (1,-1,-1), (-1,1,-1),(-1,-,1,1)$为顶点正四面体，其中$a,b,c$在上面的作用分别是绕$x,y,z$轴旋转$180^\circ$. 这实际上给出所有正四面体的反射自同构。面的置换就是上面的忠实表示。

All of above can be summarized as follow. Consider the tetrahedron in 3D space whose vertices are $(1,1,1), (1,-1,-1), (-1,1,-1),(-1,-,1,1)$, where the action of $a$, $b$ and $c$ is the rotation of $180^\circ$ along axis $x$, $y$ and $z$ respectively. These actually give rise to all of the automorphisms of reflection of the tetrahedron. The permutation of faces is exactly the faithful representation above. 

第一个应用 First Application

如图在这篇博文中所提到的，有红黄蓝三色绵羊各15, 19, 20只，如果两只不同颜色的棉羊相撞，那么他们合体成另一个颜色的一只绵羊。问最终会全变成哪种颜色的羊？

There are 15, 19 and 20 sheep of color red, yellow and blue respectively. If two sheep of distinct colors collide, then they will blend into one sheep in the other color. What kind of species will unify the farm at the end? 

我们可以给出一个染色的方法，给三种颜色的绵羊染上Klein四元群中的$a,b,c$，那么相撞时，所有羊所染元素的乘积是不变的。

We can give a method through coloring---color three different kind of sheep with $a$, $b$ and $c$ in Klein four-group respectively. Then when collision happens, the product of elements colored is invariant. 

而$15a+19b+20c=a+b=c$，所以最终是黄色的羊统一整个农场。

Note that 15a+19b+20c=a+b=c$, so the yellow sheep will unifty the whole farm. 

第二个应用 Second Application

考虑一个正八面体，我们在所有顶点上安装了一盏灯泡，在每个面上安装一个开关。每次使用开关，这个面的三个顶点的灯泡状态会发生改变——亮的灯被熄灭，熄灭的灯被点亮。如果现只有一盏灯亮着，我们能把所有灯关掉吗？

Consider a octahedron. We equip each vertice a bulb and each face a switch.  Each usage of a switch, the three vertices of this face will change its state---the light one gets extincted, the light-off one turns off. Now there is only one bulb open, can we turn off all the bulbs? 

 

同样，我们给出一个染色的方法。将三组对径的顶点分别染上Klein四元群中的$a,b,c$，那么每次操作开关，所有亮的灯所染元素的乘积是不变的。

Similarly, we shall present a coloring solution. Coloring the three pairs of antipodal vertices with $a$, $b$ and $c$  in Klein four-group respectively. Then no matter how the switches are operated,  the product of elements of light bulbs is invariant. 

现在，只有一盏灯亮，当然没法变成都灭的状态。

Now, there is only one bulb on, it cannot become the state with all distinct. 

第三个应用 Third Application

第三个应用是经典的，我们证明经典小游戏欧版的孔明棋（也称独立钻石）是无解的。

This application is classic. We will show that the game Peg Solitaire is unsolvable for European version. 

给棋盘条带状染上Klein四元群中的$a,b,c$，每次跳子不会改变所有元素的乘积。

Coloring the board with $a$, $b$ and $c$  in Klein four-group in striped pattern. Each skip does change the product of all elements. 

		a	b	c
	a	b	c	a	b
a	b	c	a	b	c	a
b	c	a	b	c	a	b
c	a	b	c	a	b	c
	b	c	a	b	c
		a	b	c

现在，所有元素的乘积是$1$，说明不存在最终只有一个子的情况。

Now, the product is $1$. This shows that there does not exist the final state of only one chess. 

第四个应用 Fourth Application 

第四个例子同样是经典的。是关于骨牌铺满棋盘的问题。考虑一个第一行被删去了第一个方块和最后一个方块$8\times 8$棋盘，证明用$1\times 2$和$2\times 1$的骨牌密铺，一定用了奇数个$1\times 2$骨牌。

The fourth application is also classic. It is about the problem of tiling board with dominoes. Consider an $8\times 8$ board delated the first block and the last block in the first row, prove that if we tile it by $1\times 2$ and $2\times 1$ dominoes, we will always need odd many $1\times 2$ dominoes.

策略依旧是染色。如上染色，任何横着放的骨牌上面元素的乘积都是$a$，竖着放的则是$b$。

The strategy is still coloring. Coloring as above, then for each $1\times 2$horizon domino, the product of element on it takes $a$, but the for the vertical, it takes $b$. 

Klein四元群的对称性的一个小注记 A small Remark on the Symmetry of Klein four-group

考虑Hadamard最大行列式问题（目前还是公开问题）。一个每个位置都是$\pm 1$的$n$阶方阵，行列式最大是多少？

Consider Hadamard's maximal determinant problem (which is now still an open problem). What's the maximal value of determinant of the matrix of order $n$ with each entry $\pm 1$. 

有两个结果。

There are two results. 

• 使用归纳法可以得到$(\textrm{$n$阶上界})\leq n(\textrm{$n-1$阶上界})$，从而有上界$n!$. 如果注意到$n=3$时，最大为$4$，那么还可以进一步缩减为$\frac{2}{3}n!$. 

  Using induction we can find $(\textrm{upper bound for $n$})\leq n(\textrm{upper bound for $n-1$})$, so it has upper bound $n!$. If we note that when $n=3$, the maximal determinant is $4$, then we can get more strict bound $\frac{2}{3} n!$. 

• 著名的不等式$\det (a_{ij})\leq \prod_{i} \sqrt{\sum_j a_{ij}^2}$表明有上界$\sqrt{n^n}$. 

  Famous inequality $\det (a_{ij})\leq \prod_{i} \sqrt{\sum_j a_{ij}^2}$ indicates the upper bound $n\sqrt{n}$. 

注意到，$n=4$时，$\frac{2}{3}n!=\sqrt{n^n}$，当$n>4$时，$\sqrt{n^n}$总比$\frac{2}{3}n!=\sqrt{n^n}$更小。

Note that when $n=4$, $\frac{2}{3}n!=\sqrt{n^n}=16$, and when $n>4$, $\sqrt{n^n}$ is always smaller than $\frac{2}{3}n!=\sqrt{n^n}$. 

这是一个有趣的问题，实际上这个问题可以转化成$n-1$维立方体中$n-1$维四面体（或者说单纯形）的最大体积是多少。因为$\frac{1}{n!}\det \left(\begin{matrix} 1 & x^1_1 & \ldots & x^1_n \\ \vdots & \vdots & \ddots & \vdots \\ 1 & x^{n+1}_1 & \ldots & x^{n+1}_{n}\end{matrix}\right)$正是$(x^1_1,\ldots,x^1_n), \ldots, (x^{n+1}_1,\ldots,x^{n+1}_n)$为顶点的$n$维四面体的体积。显然，正方体内的正四面体给出最大的体积。这解释了$n=4$的情况。

This is an interesting problem. The problem can be reduced to tha problem that what is the maximal volume of $n-1$-dimientional tetrahedron (or simplex) inside the $n-1$-dimensional cube. Since $\frac{1}{n ! }\det \left(\begin{matrix} 1 & x^1_1 & \ldots & x^1_n \\ \vdots & \vdots & \ddots & \vdots \\ 1 & x^{n+1}_1 & \ldots & x^{n+1}_{n}\end{matrix}\right)$ is exactly the volume of the $n-1$-dimientional tetrahedron whose vertices are $(x^1_1,\ldots,x^1_n), \ldots, (x^{n+1}_1,\ldots,x^{n+1}_n)$. Obviously, the regular tetrahedron in cube takes the maximal volume. This explain the case $n=4$, whose bound is $16$. 

注意：$\det \left(\begin{matrix}1 & 1 & 1 & \ldots & 1 \\ 1 & 1 & -1 & \ldots & -1 \\ 1 & -1 & 1 & \ldots & -1 \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ 1 & -1 & -1 & \ldots & 1 \end{matrix}\right)=-2^{n-1}(n-2)$. 

Note: $\det \left(\begin{matrix}1 & 1 & 1 & \ldots & 1 \\ 1 & 1 & -1 & \ldots & -1 \\ 1 & -1 & 1 & \ldots & -1 \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ 1 & -1 & -1 & \ldots & 1 \end{matrix}\right)=-2^{n-1}(n-2)$.