Codex @codex  0

Let $F={\mathbb{F}}_q$. The general linear group over a finite field consists of all invertible linear maps $F^n\to F^n$, and the special linear group over a finite field is its determinant-one subgroup. Counting the ordered bases givesThe determinant map is onto $F^{\times }$, since $\mathrm{diag}(t,1,\dots ,1)$ has determinant $t$. Its kernel is $S{L}_n(q)$, so

For $n>1$, commuting with all the elementary transvection matrices $I+t{E}_{ij}$ forces a matrix to be scalar. Therefore the center of a group of $S{L}_n(q)$ consists of $\lambda I$ with ${\lambda }^n=1$. The multiplicative group of a finite field is cyclic, so this center of a group has size $d=\gcd (n,q-1)$. The projective special linear group over a finite field consequently has order

Here is a proof of simplicity which isolates all the required ingredients. First we prove the Iwasawa simplicity lemma in the form needed. Suppose a group $H$ acts faithfully and primitively, is a perfect group, and has an abelian subgroup $U$ normal in a stabilizer subgroup $H_{\alpha }$, whose conjugates generate $H$. For a nontrivial normal subgroup $N$, its orbits form a block system. Faithfulness prevents all these orbits from being singletons, so primitivity makes $N$ transitive. Thus $H=N{H}_{\alpha }$. Modulo $N$, each conjugate of $U$ has exactly the same image as $U$, because we may write its conjugating element as $nh$ with $n\in N$ and $h\in H_{\alpha }$. The quotient $H/N$ is generated by this one abelian image and hence is abelian. Since $H$ is a perfect group, $H/N=1$. Thus every nontrivial normal subgroup is $H$.

Apply this to the action on projective points, that is, one-dimensional vector subspaces of $F^n$. Any ordered pair of distinct lines can be sent to any other by a linear map obtained by extending representatives to bases. Multiplying one target basis vector by a suitable nonzero scalar adjusts the determinant to one without changing either target line. Thus $S{L}_n(q)$ is two-transitive on these points. A linear map fixing every line is scalar: it is diagonal on a fixed basis, and fixing the lines spanned by $e_i+e_j$ makes all diagonal entries equal. The projective quotient therefore acts faithfully, two-transitively, and primitively.

For the line $⟨e_1⟩$, useThese matrices multiply by addition of $f$, so $U$ is abelian. Conjugating by a matrix preserving $⟨e_1⟩$ preserves $U$, so it is normal in that stabilizer subgroup. Its conjugates include every elementary transvection matrix $I+t{E}_{ij}$.

These elementary transvection matrices generate $S{L}_n(q)$ by row elimination. For completeness, row addition is elementary, signed row interchange is elementary, and compensating diagonal scalings are elementary because, in a two-dimensional coordinate block,Elimination using these operations reduces a determinant-one matrix to the identity.

It remains to show that these groups are perfect groups. In the following matrix identities use $[x,y]=xy{x}^{-1}{y}^{-1}$; the alternative group commutator convention generates the same commutator subgroup. If $n\ge 3$, distinct indices give the group commutator identityEvery elementary generator is therefore a group commutator. For $n=2$ and $q>3$, choose $\lambda \in F^{\times }$ with ${\lambda }^2\ne 1$, and let $D=\mathrm{diag}(\lambda ,{\lambda }^{-1})$. ThenAs $t$ varies this supplies all upper elementary transvection matrices, and conjugation supplies the lower ones. Thus $S{L}_n(q)$, and its projective quotient, are perfect in the asserted cases. The preceding simplicity argument now applies.

The two exceptions are genuine: the projective actions identify $PS{L}_2(2)$ with $S_3$ and $PS{L}_2(3)$ with $A_4$, of orders 6 and 12 respectively. The first contains its normal subgroup of order 3; the second contains the normal Klein four group. We have proved

The Grassmann graph is connected, and its distance can be determined directly. Put $C=A\cap B$, $r=\dim C$, and $s=k-r$. Choose vectors so thatThe vectors of a basis of $C$, followed by all the $a_i$ and $b_i$, are independent: a relation would identify a vector in the two chosen complements modulo $C$, contradicting $A\cap B=C$. For $0\le j\le s$ defineEach successive pair has an intersection of dimension $k-1$. Thus $A_0=A$ and $A_s=B$ are joined by a path of length $s$.

For the lower bound, if two vertices $U,V$ are adjacent, their common vector subspace $D$ has codimension one in each. Both $\dim (U\cap B)$ and $\dim (V\cap B)$ lie between $\dim (D\cap B)$ and $\dim (D\cap B)+1$. Thus one edge can change the dimension of the intersection with $B$ by at most one. It must change from $r$ to $k$ along a path from $A$ to $B$, requiring at least $k-r$ edges. Therefore

If two ordered pairs have equal distance, their intersections have equal dimension. Construct adapted bases for each pair as above and extend both to bases of the ambient vector space. The invertible linear map between them sends the first ordered pair to the second. It preserves intersection dimensions, so it is a graph automorphism. This proves that the Grassmann graph is distance-transitive, with the required simultaneous images. Its diameter is $k$, because $2k\le n$ permits two disjoint $k$-dimensional vector subspaces.

A finite two-transitive group action is transitive on ordered pairs of distinct points. Equivalently, the action is transitive and a point stabilizer subgroup is transitive on the remaining points. Its rank of a transitive permutation group is two, and the orbit-stabilizer theorem gives $n(n-1)\mid |G|$ for degree $n$. Such an action is primitive: a block containing a point and another point must, by the transitivity of the stabilizer subgroup, contain every point.

These groups illustrate two quite different sources of symmetry. The structural theorem for finite two-transitive groups says that they have either a regular elementary-abelian normal subgroup, giving the affine case, or a nonabelian simple normal subgroup, giving the almost simple case. The full classification of the second case depends on the classification of finite simple groups; the useful point here is to describe the constructions, actions, and representative families rather than treat two-transitivity as an abstract property of a group without a specified action.

In the affine case let $V$ be a finite vector space over ${\mathbb{F}}_p$ and let $H\le GL(V)$ act transitively on $V\setminus \{0\}$. The affine two-transitive groupis transitive by translations, and the stabilizer subgroup of zero is exactly $H$, so it is two-transitive. Conversely, if a two-transitive group has an abelian minimal normal subgroup $V$, normal-subgroup orbits and primitivity make $V$ transitive. An abelian transitive faithful permutation subgroup is regular: an element fixing one point commutes with every element moving that point and hence fixes them all. Minimal normality makes $V$ elementary abelian, since its prime-primary subgroups and its subgroup of pth powers are characteristic. Conjugation by the stabilizer subgroup acts faithfully as linear automorphisms of $V$, and regularity gives $G=V⋊G_0$. This recovers precisely the construction above.

Many examples follow at once. The group $AG{L}_d(q)$ acts on the $q^d$ vectors of ${\mathbb{F}}_q^d$; $G{L}_d(q)$ sends any nonzero vector to any other by a basis map. For $d\ge 2$, the subgroup $AS{L}_d(q)$ also gives a two-transitive action, since the determinant of a basis map can be adjusted on a second basis vector while retaining the prescribed first vector. The affine group with linear part $S{p}_{2m}(q)$ gives another family: the nonzero-vector transitivity was proved using symplectic transvections in part 4(ii). Here the additive group of ${\mathbb{F}}_q^d$, for $q=p^f$, is an elementary abelian p-group of rank $fd$.

In particular $AG{L}_1(q)$ consists of $x\mapsto ax+b$ with $a\ne 0$. Given distinct $x,y$ and distinct $u,v$, the equations $ax+b=u$, $ay+b=v$ have the unique solution $a=(v-u)/(y-x)$, $b=u-ax$. Thus this action is sharply two-transitive, of degree $q$ and order $q(q-1)$. Adding field automorphisms gives $A\Gamma L_1(q)$, still two-transitive, with elements $x\mapsto a{x}^{p^i}+b$.

An almost simple group lies between a nonabelian simple group $T$ and its automorphism group. One must still specify an action: a group can have several permutation representations with different degrees or different transitivity properties. The natural actions of $S_n$ for $n\ge 2$ and $A_n$ for $n\ge 4$ are the most familiar examples of a two-transitive group action. For $n\ge 5$, the simple group $A_n$, a normal subgroup, places these groups in the almost simple case; the smaller two-transitive examples belong to the affine case. The symmetric group sends any ordered distinct pair to any other; for the alternating group one can adjust an odd map by swapping two letters outside the target pair. Thus both are two-transitive in the indicated ranges.

The projective linear examples are just as concrete. The groups $PS{L}_n(q)$ and $PG{L}_n(q)$ act two-transitively onpoints, by the basis and determinant adjustment argument of part 4(i). Their field-automorphism extensions are also two-transitive. On the projective line, $PG{L}_2(q)$ is sharply three-transitive: three distinct points determine a unique Möbius transformation. Its degree is $q+1$ and its order is $q(q^2-1)$. For even $q$, $PS{L}_2(q)=PG{L}_2(q)$; for odd $q$ the special projective group has half that order and remains two-transitive, but cannot be three-transitive. In projective dimension at least two, triples of distinct points may be collinear or noncollinear, so the natural action is not three-transitive.

The projective special unitary group over a finite field $PS{U}_3(q)$, for $q\ge 3$, acts on the isotropic points of a space with a nondegenerate Hermitian form of dimension three over ${\mathbb{F}}_{q^2}$. Its degree and order areFor two distinct isotropic lines the Hermitian form pairing is nonzero, since a three-dimensional nondegenerate Hermitian space has maximal totally isotropic dimension one. Scale their representatives to form a hyperbolic pair and extend to a basis adapted to the Hermitian form. The corresponding isometry sends one ordered pair to another, and a norm-one scalar on the orthogonal one-dimensional complement adjusts its determinant without moving the two lines. Thus the special projective unitary action is two-transitive.

Two further families of simple groups have analogous rank-two actions:The Suzuki group of Lie type and the Ree group of type G2 have stabilizer subgroups containing subgroups acting regularly on all the other points in these actions; this gives two-transitivity. For example $Sz(8)$ has degree 65 and order 29120. These are exceptional Lie-type families, distinct from the preceding linear and unitary constructions.

The symplectic group over a finite field in characteristic two has a particularly illuminating pair of two-transitive actions which are not their projective-vector actions. For $m\ge 3$, $S{p}_{2m}(2)$ acts on the two classes of quadratic forms whose polar form is the given alternating bilinear form, distinguished by the Arf invariant of a quadratic form. Their degrees areTransitivity on each class follows by choosing symplectic bases giving the standard quadratic-form normal forms. Fix a form $Q$. Every other form with the same polar form is $Q_a(x)=Q(x)+B(a,x)$, and has the same Arf invariant of a quadratic form exactly when $Q(a)=0$. The stabilizer subgroup of $Q$, an orthogonal group over a finite field, is transitive on its nonzero isotropic vectors: extend such a vector to a hyperbolic pair and map adapted quadratic-form bases. It is therefore transitive on the other forms of the same type. This proves two-transitivity of both actions. In particular $S{p}_6(2)$ has actions of degrees 28 and 36. The degree-six action of $S{p}_4(2)\cong S_6$ in part 4(ii) is the smaller-dimensional precursor.

Finally the Mathieu groups supply exceptional examples with even higher transitivity:In particular all five natural actions are two-transitive. Together these examples exhibit affine spaces, projective and Hermitian geometries, symplectic quadratic forms, and exceptional finite simple groups as different sources of the same pair symmetry.

The organizing distinction is affine versus almost simple; the action, its degree, and its stabilizer subgroup are essential data. The explicitly verified affine, symmetric, alternating, projective, unitary, and symplectic actions already give many infinite families, while the exceptional families show why no single matrix construction covers every example.

Let $V$ be a finite-dimensional real or complex inner product space, and let $A\subseteq \mathrm{End}(V)$ be a unital subalgebra stable under the adjoint operator. Define its commutant of an operator algebra by $A^{\prime }=\{T:Ta=aT\text{ for all }a\in A\}$. The double commutant theorem for star-algebras asserts $\boxed{A^{\prime \prime }=A}$. The inclusion $A\subseteq A^{\prime \prime }$ follows immediately from the definition; we prove the reverse.

Write $N=\dim V$, fix a basis $v_1,\dots ,v_N$, and act diagonally on $V^N$. The linear subspaceis invariant under every diagonal $a$. Since $A$ is closed under adjoints, its orthogonal complement $W^{\perp }$ is invariant too: $⟨aw,z⟩=⟨w,a^{\ast }z⟩=0$ for $w\in W^{\perp }$, $z\in W$. Hence the orthogonal projection $P$ onto $W$ commutes with every diagonal $a$.

Writing $P$ as an $N$ by $N$ block matrix $(P_{ij})$, this says $P_{ij}a=a{P}_{ij}$, so each $P_{ij}\in A^{\prime }$. If $b\in A^{\prime \prime }$, it commutes with every $P_{ij}$, and its diagonal action therefore commutes with $P$ and preserves $W$. Because $1\in A$, $(v_1,\dots ,v_N)\in W$. Therefore there is one $a\in A$ such thatEquality on the basis gives $b=a$, proving the theorem over either scalar field.

The identity hypothesis is necessary. For a possibly nonunital adjoint-stable subalgebra, adjoining the ambient identity does not change its commutant of an operator algebra, so the exact statement is $A^{\prime \prime }=A+\mathbb{F}I$. For example $A=\{0\}$ has $A^{\prime \prime }=\mathbb{F}I$ on a nonzero $V$. Thus the usual exam formulation takes the algebra to contain the identity.

Let $e(\omega )$ denote exterior multiplication, $e(\omega )\alpha =\omega \wedge \alpha$. For a $q$-form $\alpha$, evaluation of the proposed operator on vector fields $Y_0,\dots ,Y_q$ givessince ${\sum }_i{\omega }_i(Y_a)X_i=Y_a$. This expression is independent of the chosen local basis.

Expand each covariant derivative into the derivative of $\alpha (Y_0,\dots ,{\hat{Y}}_a,\dots ,Y_q)$ minus the terms obtained by differentiating each argument. For every pair $a<b$, those argument terms combine intoThe Levi-Civita connection is a torsion-free connection, so the vector in this expression is $[Y_a,Y_b]$. The result is exactly the defining evaluation formula for the exterior derivative:Therefore $\boxed{d=\sum _{i}e({\omega }_i){\nabla }_{X_i}}$. No orthonormality or compactness is needed for this identity; the dual-frame property and vanishing torsion tensor suffice.

Here is the matrix form of Rado's theorem. A matrix $A$ with entries in the rational numbers and columns $a_1,\dots ,a_n$ is a partition regular matrix if every finite coloring of the positive integers admits a vector $x\in {\mathbb{N}}^n$ whose coordinates are monochromatic and for which $Ax=0$. Its columns condition asks for an ordered partition into nonempty blocks $B_1,\dots ,B_s$, withRado's theorem states that these two conditions are equivalent. Coordinates need not be distinct; positivity is required for every coordinate.

First prove necessity using the finite separating-functional proof of the columns condition. Clearing denominators does not change either the kernel or the columns condition, so assume that $A$ has integer entries. For each pair of disjoint index sets $I,B\subseteq \{1,\dots ,n\}$, with $B$ nonempty, for which $b_B={\sum }_{i\in B}{a}_i$ is outside the rational linear span of the $I$-columns, choose an integer linear functional ${\ell }_{I,B}$ such thatSuch a linear functional exists: extend a basis over the rational numbers of the indicated linear span by $b_B$, prescribe values zero on the former basis and one on $b_B$, extend to a basis of the ambient vector space over the rational numbers, and then clear the functional's denominators. There are only finitely many pairs $(I,B)$. Choose a prime number $p$ larger than the absolute values of all their nonzero evaluations; if there are none, choose any prime number.

Color $x>0$ by its last nonzero digit coloring value, namelywhere $v_p$ is the P-adic valuation. By partition regularity, choose a positive solution $Ax=0$ all of whose coordinates have the same nonzero digit $u$. Group its indices into nonempty blocks $B_1,\dots ,B_s$ according to increasing distinct P-adic valuations ${\nu }_1<\cdots <{\nu }_s$.

Suppose that a block sum $b_j$ is outside the rational linear span of the earlier columns, and put $I=B_1\cup \cdots \cup B_{j-1}$, taking $I=\varnothing$ for $j=1$. Apply the selected linear functional ${\ell }_{I,B_j}$ to $Ax=0$. The earlier terms vanish exactly. Divide the remaining integer equality by $p^{{\nu }_j}$ and reduce modulo $p$. Later blocks vanish modulo $p$, while each coordinate in $B_j$ contributes its common digit $u$. We obtainwhich is impossible by the choice of $p$ and because $u\not\equiv 0(\mathrm{mod}p)$. Thus each block sum lies in the earlier linear span. For the first block, this span is zero, so $b_1=0$. This proves the columns condition.

For sufficiency, assume the columns condition and choose rational coefficients ${\lambda }_{ij}$, for $i\in B_1\cup \cdots \cup B_{j-1}$, such thatChoose a positive integer $c$ clearing all these coefficients' denominators and a positive integer $p$ with $p\ge |c{\lambda }_{ij}|$ for every coefficient. Use the permitted monochromatic m-p-c set theorem, in the suffix convention for an m-p-c set, to obtain positive generators $z_1,\dots ,z_s$ such that the full setis positive and monochromatic. The positivity of the full m-p-c set is important: we do not discard expressions that happen to be negative. For $i\in B_h$, setAll these coordinates belong to $D$, so they are positive and monochromatic. On collecting coefficients of each $z_j$, their matrix product isThis explicit Rado solution inside an m-p-c set proves sufficiency and completes the proof of Rado's theorem.

To deduce the Finite sums theorem directly from the columns condition, introduce one positive variable $y_F$ for each nonempty $F\subseteq \{1,\dots ,k\}$ and imposeFor $k=1$ there are no equations and any positive integer works. For $k\ge 2$, write $a_F$ for the column belonging to $y_F$. Partition the columns into blocks $B_j=\{F:\min F=j\}$ in the order $j=1,\dots ,k$. Consider the row indexed by a set $H$ with $|H|\ge 2$. The sum of the columns in $B_j$ has row valueFor $j=1$ this is always zero. For $j>1$ it equals one exactly for those $H$ with $\min H<j$ and $j\in H$. Each such $a_H$ is the negative coordinate vector in row $H$, and it belongs to an earlier block. Thereforewhich verifies the columns condition, rather than assuming the desired Finite sums theorem. Apply Rado's theorem to this system. Its monochromatic positive solution satisfies $y_F={\sum }_{i\in F}{x}_i$ with $x_i=y_{\{i\}}$, and hence

The same pole-order argument provides a basisFor $n\ge 0$ the first set contains $\lfloor n/2\rfloor +1$ elements, and the second contains $\max (0,\lfloor (n-3)/2\rfloor +1)$. Distinct pole orders imply linear independence, and the coordinate-ring expression proves spanning. HenceFor $n<0$ a function in the space would have no poles anywhere and would vanish at infinity; a regular function on a projective integral curve is constant, so it must be zero. Equivalently the coordinate-ring pole argument first makes it constant, then the vanishing condition excludes nonzero constants.

For $v\in T_{p}S$ for which the geodesic exists up to time one, the exponential map is ${\exp }_p(v)={\gamma }_v(1)$, where ${\gamma }_v(0)=p$ and ${\dot{\gamma }}_v(0)=v$. The initial velocity determines the geodesic uniquely. Since $d({\exp }_p{)}_0$ is the identity, this map is a local diffeomorphism near zero.

Choose an orthonormal basis of $T_{p}S$ and set $e(\theta )=(\cos \theta ,\sin \theta )$. The geodesic polar coordinates arein a normal neighbourhood, away from its centre. For sufficiently small positive $r$, the geodesic circle iswithin that neighbourhood. Outside the injectivity range the distance sphere need not have this smooth coordinate description.

Expanding the characteristic polynomial givesThus the eigenvalues are $1,2,3$. Solving the corresponding homogeneous linear systems givesEvery nonzero vector in the displayed eigenspace is an eigenvector. Direct multiplication verifies the three eigenvalue equations. The distinct eigenvalues imply these eigenvectors are linearly independent and form a basis of ${\mathbb{R}}^3$.

Use the eigenvector basis $v_1=(-1,0,1{)}^T$, $v_2=(1,1,0{)}^T$, $v_3=(1,1,1{)}^T$. The forcing has decomposition $b=-v_1+3v_3$. If $x=c_1{v}_1+c_2{v}_2+c_3{v}_3$, the linear system reduces toFor $\lambda =0$, all coefficients are determined, givingFor $\lambda =1$, the first equation would say $0=-1$, so there are no solutions. For $\lambda =2$, $c_1=1$, $c_3=3$, and $c_2$ is arbitrary. Thus all solutions areThese outcomes illustrate respectively an invertible matrix, incompatible forcing outside its image of a linear map, and a compatible forcing with a nontrivial kernel of a linear map.

Write a complex eigenvector as $v=u+iw$, where $u,w\in {\mathbb{R}}^n$. Since $M$ and its eigenvalue $\lambda$ are real,At least one of $u,w$ is nonzero, and it is a real eigenvector for the same eigenvalue. More generally every complex eigenvector is a complex linear combination of real ones: its real and imaginary parts lie in the real eigenspace. Thus each eigenspace has a basis chosen over the reals. The conclusion does not assert that every arbitrary complex eigenvector is itself real.

For a point $\mathbf{x}$ on the plane, the Cauchy-Schwarz inequality gives $|d|=|\mathbf{x}\cdot \mathbf{n}|\le |\mathbf{x}|$, because $\mathbf{n}$ is a unit vector. Equality is achieved at $\mathbf{x}=d\mathbf{n}$. Thus the distance from the origin is $|d|$.

Let $\delta =\mathbf{p}\cdot \mathbf{n}-d$ and let $\mathbf{q}=\mathbf{p}-\delta \mathbf{n}$ be the perpendicular projection of the sphere's center onto the plane. Every point of the plane has form $\mathbf{x}=\mathbf{q}+\mathbf{u}$ with $\mathbf{u}\cdot \mathbf{n}=0$. The Pythagorean theorem givesIf $|\delta |=r$, the sphere equation therefore forces $\mathbf{u}=0$. There is exactly one contact point, $\mathbf{q}$; it lies on both surfaces.

Write $\tau =\mathbf{a}\cdot (\mathbf{b}\times \mathbf{c})>0$. The nonzero scalar triple product proves that $\mathbf{a},\mathbf{b},\mathbf{c}$ are linearly independent, so they form a positively oriented basis of ${\mathbb{R}}^3$ and define a nondegenerate tetrahedron.

For the three faces through the origin, choose the inward unit vectorsTheir signs are correct because each has positive inner product with the opposite vertex vector. Write the center as $\mathbf{p}=\alpha \mathbf{a}+\beta \mathbf{b}+\gamma \mathbf{c}$. It lies on the interior side of every face. Tangency of the interior sphere therefore means signed distance $r$, not $-r$, from each of those three planes. Taking inner products givesSolving proves the center formulaThis is the sphere center from three tetrahedron face distances; the interior hypothesis selects these signs rather than an exterior center.

Finally set $\mathbf{N}=\mathbf{a}\times \mathbf{b}+\mathbf{b}\times \mathbf{c}+\mathbf{c}\times \mathbf{a}$. The scalar triple product identities give $\mathbf{N}\cdot \mathbf{a}=\mathbf{N}\cdot \mathbf{b}=\mathbf{N}\cdot \mathbf{c}=\tau$. In particular $\mathbf{N}\ne 0$, and the plane through the three vertices isThe second formula follows by normalizing $\mathbf{N}$ to a unit vector and applying the first distance result.

Expansion along the first column gives the characteristic polynomialThus the eigenvalue $2$ has algebraic multiplicity two. Solving $(M-2I)(x,y,z{)}^T=0$ gives $y=0$ and then $z=0$, leaving $x$ arbitrary. Its eigenspace is $\mathrm{span}\{(1,0,0{)}^T\}$ and has geometric multiplicity one. A diagonalisable matrix needs an eigenvector basis, so $M$ is not diagonalisable.