For the Johnson graph, an edge exchanges one member of a -set. Along one edge, intersection size with a fixed target can increase by at most one, so any path in a graph from to has length at least . Replacing the elements of successively by elements of gives a path in a graph attaining that bound. Hence the distance in a Johnson graph is
If two ordered pairs have the same distance , their four regions (intersection, first-only, second-only and outside the union) have sizes . Choose bijections between corresponding regions. Their union is a ground-set permutation sending the ordered pair to the other pair and preserving graph adjacency. The symmetric group is distance-transitive. For the graph diameter is .
For the Grassmann graph, a codimension-one exchange changes intersection dimension with a fixed target by at most one. More explicitly, if are adjacent, their common -space shows , and exchanging the two gives the reverse bound. Thus distance is at least .
Choose a basis of , complement it in by , and in by . These combined vectors are independent because . The spaces
form a path in a graph of length . Consequently
Equal-distance ordered pairs have the same dimensions in this adapted basis construction. Extend both combined bases to bases of , and match them by a invertible linear map. It maps the first ordered pair to the second and preserves dimensions of intersections, hence graph adjacency. is distance-transitive, over an arbitrary field, with graph diameter under .
For the symplectic dual polar graph, vertices are Lagrangian -spaces. Let have dimension . The quotient is a nonsingular symplectic vector space of dimension , and are complementary Lagrangian subspaces. Their mutual pairing is nonsingular: a vector orthogonal to both lies in , so vanishes in the quotient. Choose dual bases in and in , and lift them into . Their span is a nonsingular symplectic -space. Complete it by a basis of and suitable dual partners. This gives the pair normal form
The spaces remain totally isotropic subspace: a present pairs only with the absent . They give an adjacent-step path in a graph of length . The previous intersection-dimension lower bound still applies, proving
For two ordered pairs at the same distance, match their adapted symplectic bases. The resulting map preserves the alternating bilinear form and sends the pairs to each other, so lies in . Equivalently, construct the isometry of a space with a form on from the displayed normal form and extend it by Witt's lemma. The action of the symplectic group over a field is distance-transitive, over every field, and its graph has graph diameter . The zero-dimensional boundary cases give a single vertex and trivial transitivity.
For the degree-ten partition action of S6, take unordered partitions of six letters into two triples. There are . Fix . Its stabilizer is , permuting each triple and interchanging them. The subgroup generated by a 3-cycle in each triple has order nine, so is a Sylow subgroup of . Any normalizer preserves its two three-point orbits; conversely all the indicated within-triple permutations and the swap normalize it. This proves the asserted normalizer exactly.
For any different partition , is one or two after excluding the identical partition. Interchanging and identifies these two possibilities. The stabilizer of is transitive on each fixed intersection pattern, hence on all other nine partitions. The degree-ten action is two-transitive. It is also faithful: two distinct partitions have a common refinement with two singleton cells and two cells of size two. Every unordered pair of letters occurs as those singleton cells. A permutation fixing every partition therefore fixes every pair and consequently every letter.
For the subgroup factorization from coset transitivity, use cosets (right cosets) and right multiplication by . The orbit of is precisely . This is every coset if and only if every can be written , proving
A natural fixing one letter is transitive on the ten partitions: the triple containing the fixed letter is determined by any two of the other five. Taking , gives ; inversion gives the requested order as well,
Now let be the binary nondegenerate alternating bilinear form. Its binary quadratic refinements form an affine space: the difference of two such forms is linear, so for a fixed every one is uniquely
In a symplectic basis each refinement is
A two-dimensional summand with admits a basis of singular vectors paired to one and is hyperbolic; the summand is anisotropic. Two planes spanned by anisotropic vectors for a form together become two hyperbolic planes of a quadratic form: with anisotropic basis pairs , the singular vectors pair to one; their orthogonal complement for a sesquilinear form has singular paired basis . Consequently every refinement is equivalent to either hyperbolic planes of a quadratic form or hyperbolic planes of a quadratic form and one anisotropic plane (all three nonzero vectors are anisotropic vectors for a form).
These two types are different. Indeed the character sum of each plane is or , so
Thus there are exactly two symplectic orbits , the signs denoting . Counting the three coefficient pairs with product zero and the one with product one gives
The same character sum gives the corresponding numbers of singular vectors, including zero, in a fixed form of either type.
Fix a form of type . Completing the square by shows
The stabilizer of is exactly . It sends the parameter by its natural linear action or inverse action according to the chosen left/right convention. Other forms of the same type correspond to nonzero singular vectors , and all forms of opposite type correspond to nonsingular vectors . For two nonzero vectors of the same value, the map between their spans is an isometry of a space with a form. Witt's lemma extends it, so the orthogonal stabilizer is transitive on each of these two vector sets. This proves the two-transitive binary quadratic-form actions: the symplectic group over a finite field is transitive on each type and its point stabilizer is transitive on all other members of that type.
In particular is transitive on the plus orbit. Identify that orbit with the cosets (right cosets) of a plus stabilizer, using as a right action. The coset criterion then proves
Both genuine two-transitive actions require . At the plus orbit has three forms and the minus orbit is a singleton; transitivity and the factorization remain true, while two-transitive action on the singleton is only vacuous if one's convention permits degree one. No special simplicity assertion is needed for this argument. At the orbit sizes are ten and six, linking these actions with and the partition action above.
Let be a nondegenerate alternating bilinear form on of dimension over . A symplectic basis has and all and pairings zero. Such bases are built by choosing a nonzero , finding with , and continuing in their nonsingular orthogonal complement for a sesquilinear form. In these coordinates the group preserving is
Its action on symplectic bases is regular. There are choices for and for , so induction gives the finite symplectic group order
The center of a group consists of with , and has order . To see there are no other central elements, a central element commutes with every symplectic transvection and hence fixes every symplectic transvection center line; a linear map fixing every line is scalar. Consequently the projective symplectic group over a finite field has this order divided by .
Here is a proof of the main ingredients in simplicity. The symplectic transvection
preserves , has inverse , and fixes pointwise. These transformations generate . Indeed if , then sends to . If the pairing is zero, choose an intermediate vector having nonzero pairing with both, so two symplectic transvections suffice. This aligns the first vector of any symplectic basis. For partners of the same , their difference lies in . If a symplectic transvection centered at aligns them and fixes . If it is zero and the partners differ, pairs nontrivially with both and still pairs to one with ; two such symplectic transvections work. After fixing the pair, induction in its orthogonal complement for a sesquilinear form aligns the rest of the basis.
The projective action on one-spaces is faithful. For , a line stabilizer has three orbits: the line itself, the other lines perpendicular to it, and the lines not perpendicular to it. Witt's lemma proves transitivity within the latter two orbits by matching the two-dimensional restricted form. This action is primitive. A block containing distinct perpendicular lines is invariant under both stabilizers and therefore contains a line perpendicular to but not to . A block containing distinct nonperpendicular lines likewise contains a line perpendicular to but not to , by using the stabilizer. Such lines exist by nonsingularity in dimension at least four. Either possibility makes the block contain both nontrivial stabilizer orbits, hence every line. For the action on the projective line is two-transitive and thus primitive.
Symplectic transvections with one fixed center line form an Abelian normal subgroup of its stabilizer, and their conjugates generate the whole group. The Iwasawa simplicity lemma now reduces simplicity to being perfect. Its short proof is useful: any nontrivial normal subgroup of a faithful primitive group is transitive, since its orbits are blocks. Writing , where is a point stabilizer, shows that all conjugates of the specified Abelian subgroup have the same image modulo . Thus is Abelian. If is perfect, .
The groups can also be shown to be perfect concretely. For choose with and let scale by and by . Then
so every symplectic transvection is a group commutator. For , symplectic transvections of coefficient one are conjugate, have order three, and the four with centers in a two-dimensional totally isotropic subspace multiply to the identity. They commute, and the sum of their rank-one terms is zero modulo three. Their common class in the abelianization is therefore annihilated by both three and four, hence is zero. For , use the seven nonzero vectors of a three-dimensional totally isotropic subspace. The symplectic transvections commute and their product is the identity, because each diagonal coefficient occurs four times and each cross coefficient twice. Their common abelianized class is annihilated by two and seven, hence is zero. Generation now proves these groups are perfect.
It follows that
The exceptions are , and respectively. For odd the full symplectic group over a finite field has nontrivial center of a group, so simplicity refers to its quotient group; for even the center of a group is trivial.
A symplectic parabolic subgroup stabilizes a flag of totally isotropic subspaces. The maximal such parabolic subgroups stabilize a single -space, . In an adapted basis their Levi subgroup is , with an arbitrary block of parameters and a remaining symmetric block of parameters. Thus
These are the single-member flag stabilizers, equivalently the standard maximal parabolic subgroups obtained by omitting one node of the symplectic Dynkin diagram. Two particular cases have transparent descriptions.
For the symplectic point stabilizer, write . Its unipotent radical consists of
All pairings are preserved by direct substitution. The product law is , so this radical has order . With group commutator convention , its commutator has central parameter : it is Heisenberg-type in odd characteristic, but Abelian in characteristic two. A Levi subgroup scales inversely and acts as , giving
This index counts the one-spaces, all of which are isotropic for an alternating bilinear form.
For a Lagrangian subspace , the symplectic Lagrangian stabilizer has block form
Substituting into proves both the inverse-transpose lower block and symmetry of . The unipotent radical is the additive group of symmetric matrices, and acts by . Therefore
The last identity follows by canceling -powers and factors in the two order formulas; it counts maximal totally isotropic subspaces.
The isomorphic pair is ; is different. All three have order , so order alone does not settle the question; explicitly . We give a concrete realization and an element-order distinction.
On , the Pfaffian is
It is a nonsingular plus-type quadratic form: the three displayed pairs give a hyperbolic decomposition. Change of basis multiplies the Pfaffian by the determinant, which is always one in . Hence the exterior-square realization of PSL4 over F2 embeds into . The kernel of a group homomorphism is trivial: an element acting trivially on the exterior square fixes every decomposable two-space, then every one-space as an intersection of two-spaces, and hence is a scalar; over this scalar is one.
For a second model let be the even-weight vector subspace of and quotient by the all-one vector. The dot product descends to a nondegenerate alternating bilinear form on the six-dimensional quotient, and
is well defined, since complementing an even subset changes half its weight from to . It has zero vectors, so is plus type. Coordinate permutations give a faithful action: fixing the quotient fixes each weight-two subset, because its complement has weight six, and fixing all two-subsets forces the identity permutation.
From the independently derived symplectic order and quadratic orbit count below,
Thus and the image of is its index-two subgroup . The index-two subgroup is unique: a nontrivial group homomorphism sends every transposition to the same nonidentity element and is the sign map.
To separate , observe that contains of order 15. An odd-order projective element of lifts to a semisimple linear operator, since its order upstairs divides three times an odd order in characteristic two. The possible eigenspace degree patterns are , and . In the split case all eigenvalues have order dividing three, so the projective element has no order 15. In the case the eigenvalues are with ; its fifth power is scalar because , so its projective order divides five. In the irreducible case the determinant-one torus has order and quotienting its scalar subgroup of order three gives projective order dividing seven. There is therefore no element of order 15 in .
Several small-parameter coincidences connect the finite classical groups to permutation groups. The projective-line action immediately gives , , and by faithful actions of degrees three, four and five and their orders. Also : its involutions have Klein-four centralizers, giving five Sylow subgroups; their conjugation action is faithful and embeds its order-60 simple group into . Simplicity here can be checked from class sizes : no proper nontrivial normal class union has order dividing 60. The same five-subgroup action extends to , with trivial kernel of a group homomorphism and order 120, giving . Indeed its kernel intersects trivially, so centralizes that normal subgroup. Commuting projectively with both upper and lower elementary unipotents forces a representing matrix to be scalar, so this kernel is trivial.
The less immediate coincidence can be exhibited on the ten unordered triple partitions used in Question 4. Let , , , assign to and to , and label the other partitions by applying to the zero partition, with and . Inspection of these nine partitions gives
Translations and inversion generate : conjugating the upper unitriangular matrices by inversion gives the lower ones, and elementary elimination generates . Their projective action has order . These partition permutations come from even permutations of six letters, whose partition action is faithful as proved below; hence they fill .
Finally, on the even-weight module of modulo its all-one vector, coordinate permutations preserve a nondegenerate alternating bilinear form in dimension four and act faithfully, again by the weight-two-subset argument. Both and have order 720, proving , with commutator subgroup . These examples illustrate both the need to quotient group centers and the low-rank exceptions to general simplicity. They do not make equal orders sufficient for group isomorphism, as the two order-20160 examples already demonstrate.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact