Two disjoint synthemes form a six-cycle, whose complement is a triangular prism. The prism has a unique partition into three perfect matchings, so the pair extends uniquely to a total of synthemes. Eight synthemes are disjoint from a fixed syntheme; grouping them four per total yields two totals through it, and double counting gives six totals in all.
// Target: combinatorics.bigb
Duad 2026-10-07
A duad is an unordered pair of distinct points. On a six-point set there are duads. They are the edges of the complete graph and are grouped into synthemes.
Use the six-point matching geometry. A duad is an edge of the complete graph on six points, a syntheme is a perfect matching of its three pairs, and a pentad is a one-factorization: five pairwise edge-disjoint synthemes covering all fifteen duads.
First count the pentads without assuming their number. There are fifteen synthemes: the partner of the first point has five choices, the least remaining point then has three possible partners, and the last pair is forced. For a fixed syntheme , eight others share no edge with it: inclusion-exclusion gives . Two edge-disjoint synthemes have union a six-cycle. The complement of that cycle is a triangular prism, consisting of two triangles with three corresponding cross edges. It has precisely four perfect matchings: the all-cross matching and three matchings using one cross edge plus one edge from each triangle. The all-cross matching leaves two odd triangles and therefore cannot be completed by two matchings. The other three matchings are pairwise edge-disjoint and partition the prism. Hence extend to exactly one pentad.
Each pentad through uses four of its eight disjoint partners, and every partner gives exactly one completion. Thus lies in two pentads. Counting incidences gives pentads in total. Distinct pentads cannot share two synthemes because two disjoint synthemes determine their unique completion. Every syntheme therefore identifies a distinct pair of pentads; there are fifteen such pairs, so this incidence map is a bijection.
Permuting the six original points permutes the six pentads, defining a group homomorphism . It is faithful. If an element fixes every pentad, it fixes every syntheme by the pair-incidence bijection. A duad is the unique common edge of two distinct synthemes containing it, so every duad is fixed as well. A permutation fixing all two-element subsets fixes every point, by intersecting and for distinct . The kernel of a group homomorphism is therefore trivial. Both groups have order , so labeling the pentads produces an group automorphism of .
It remains to prove this group automorphism is outer. A transposition, say , fixes no pentad. If it fixed one, the unique syntheme in that pentad containing the duad would be fixed. Every other syntheme in the pentad contains 1 and 2 in separate edges. Swapping them changes those two edges but leaves the third edge unchanged. Hence is a distinct syntheme sharing an edge with , impossible for two members of the same pentad. Thus acts without fixed points on the six pentads and becomes a product of three disjoint transpositions.
Inner automorphisms preserve cycle type, whereas sends a single transposition to a triple transposition. Consequently
This realizes the exceptional class-size coincidence from part (a). It is the full symmetric-group version of the pentad construction of the exceptional alternating-group automorphism, with faithfulness proved directly from incidence rather than borrowed from a simplicity theorem.
First prove Simplicity of alternating groups. The -cycles generate : express an even permutation as an even number of transpositions and pair them. A pair sharing a point is a -cycle, an identical pair cancels, and a disjoint pair can be written . All -cycles are conjugate in when : a conjugator in can have its parity corrected by a transposition on two points outside the target triple, without changing its effect on that triple.
Let and choose . Some -cycle does not commute with . Indeed, commuting with every -cycle would preserve every triple setwise; intersecting all triples containing a given point forces that point to be fixed, so would make . The nonidentity group commutator is supported on at most six points. Its possible nontrivial even cycle types are a -cycle, a double transposition, a -cycle, two disjoint -cycles, or a -cycle times a transposition. Each yields a -cycle in by explicit group commutators:
For , use with a fifth point ; conjugation reverses , so the group commutator is . For , use : the group commutator is . The same calculation works for . For , use ; its conjugate is , and the product is a -cycle, reducing to the preceding case. Thus contains a -cycle, hence the whole conjugacy class of -cycles, and hence all of . Therefore
For the exceptional automorphism, a duad is an unordered pair of six points, a syntheme is a partition into three duads, and a pentad is a set of five synthemes covering every duad once. There are fifteen synthemes. To count pentads, fix , where bars separate duads. A syntheme disjoint from it in duads is one of eight; the union of the two matchings is a six-cycle, so the stabilizer of the fixed syntheme is transitive on these eight choices. For the choice , the remaining compatible synthemes are , , and . The last shares a duad with each of the first three and cannot belong to a completion; the first three form the unique completion. Thus each of the eight choices has a unique completion through the fixed syntheme. Each completion contains four of them, so exactly two pentads contain a fixed syntheme, and there are pentads in total.
Here is the complete list, which also defines concrete labels for the induced action:
Relabelling points gives a group homomorphism on these pentads. Direct substitution in the table gives
The restriction to is nontrivial, hence faithful by the simplicity just proved. Therefore the full kernel has order at most two. An order-two normal subgroup would be central, whereas has trivial centre: an element centralizing every transposition fixes every unordered pair and consequently every point. The kernel is trivial, and equal orders make an automorphism. It preserves , because that is the unique index-two subgroup of : any nontrivial group homomorphism to sends every conjugate transposition to the nonidentity element, and is therefore the sign map. Its restriction is the pentad construction of the exceptional alternating-group automorphism. It maps a -cycle to two disjoint -cycles, while conjugation in preserves cycle type. Hence this automorphism of is not induced by any element of .
For the other degrees, recover the points from -cycles. An element of order three has type . Its centralizer in has order . That centralizer contains an odd permutation: either swap two fixed points, or, when , swap two three-cycles by three transpositions. Thus
For , only is possible. For , the value is strictly largest. For equality first occurs at , and the ratio increases strictly with . For , already at one has : it holds at , and the inductive ratio is . Increasing again increases the ratio. Consequently every automorphism preserves the set of -cycles when .
Each cyclic subgroup generated by a -cycle corresponds to its three-point support. Two distinct such subgroups commute exactly when the supports are disjoint. If they meet in one point, products of their nonidentity generators have order five. If they meet in two points, those products have order two or three. These intrinsic tests recover adjacency in the Johnson graph , so the automorphism acts on its vertices.
We can reconstruct the underlying points without an additional group-theoretic bound. The maximal cliques of a Johnson graph in are the triples containing a fixed pair, and the four triples contained in a fixed four-set. To verify the classification, take adjacent triples and with . Any common adjacent triple either contains or lies in . A triple of the first kind outside that four-set is not adjacent to a triple of the second kind omitting a point of , so a clique cannot mix the two alternatives. Extending a clique therefore gives exactly one of the two listed families.
For , , their sizes distinguish the pair-containing cliques. Their intersections reconstruct the pair graph : two such cliques intersect precisely when their defining pairs meet in one point. In this graph the maximal cliques are stars of pairs through a point and triangles of three pairs within a triple. These sizes are different for , so its automorphisms permute the stars and hence the points. Every pair is the intersection of its two point stars, and every triple is determined by its three pairs. Thus the original graph action comes from some .
Undo conjugation by . The remaining group automorphism fixes each cyclic -subgroup, so it fixes or inverts each generator. For adjacent supports, inverting exactly one generator changes the order of their product between two and three; inverting both preserves that order. Hence the two inversion choices must agree. The triple-support graph is connected, since one can replace differing points one at a time, so the choice is uniform. Inverting every -cycle is impossible: take , , whose product is the -cycle . Then , whereas the group homomorphism property would give ; these are unequal because do not commute. Therefore fixes every -cycle and is the identity. Conversely, conjugation by acts faithfully on , since centralizing all -cycles fixes every triple and every point. The automorphisms of alternating groups from triple supports are exactly
A duad is an unordered pair of letters, a syntheme is a partition of the six letters into three duads, and a total of synthemes is a set of five synthemes partitioning the 15 duads. There are synthemes. Fix one, . Each of its three duads lies in three synthemes, and two distinct duads of can occur together only in itself. Thus precisely synthemes meet in a duad, leaving eight disjoint from it.
For any syntheme disjoint from , their union as edges in is a six-cycle: the two perfect matchings alternate, and no two-cycle is possible in a simple graph. Its complement is a triangular prism, namely two triangles joined by three corresponding edges. The prism has four perfect matchings. One consists of all three joining edges; each of the other three consists of one joining edge and the remaining edge in each triangle. To partition the prism into three perfect matchings, one cannot use the all-joining matching, since what remains is two odd triangles. The other three do partition it. Hence two disjoint synthemes extend to a unique synthematic total.
There are eight choices for and four choices of within each synthematic total containing . Thus lies in exactly two synthematic totals. Counting incidences of synthemes and synthematic totals now gives the counting synthematic totals formula
Two distinct synthematic totals share at most one syntheme, since sharing two would force them to be the unique synthematic total extending that pair. Each syntheme gives a pair of synthematic totals containing it, and the 15 synthemes account for all pairs. Therefore every pair of synthematic totals shares exactly one syntheme.
This also explains why the action on the six synthematic totals defines an automorphism of . A permutation fixing all synthematic totals fixes their pairwise intersections, hence every syntheme. Each duad is the intersection of two distinct synthemes containing it, so every duad is then fixed. Intersecting two duads through a point shows that every point is fixed. The action is faithful and, by equality of orders, maps onto the full symmetric group of the synthematic totals. Part iii shows that a transposition acts as a triple transposition, establishing that this is an outer automorphism.
A Steiner system consists of 12 points and a collection of six-element blocks such that every five-element subset lies in exactly one block. The blocks are often called hexads. Necessarily their number is . We give the synthematic construction of the small Witt design explicitly and prove this defining property.
Write and . For an unordered pair , let denote the unique syntheme shared by its two synthematic totals. A duad belongs to three synthemes. The corresponding three pairs partition : every synthematic total contains in exactly one of its synthemes, and each syntheme lies in exactly two synthematic totals. Thus the incidence gives a perfect matching of the six synthematic totals for each duad.
To describe the blocks with three points in each half, take an unordered partition into triples. A syntheme is cross if each of its three duads joins to . Form a graph on by declaring an edge exactly when is cross. This graph is the union of two disjoint triangles. Indeed a synthematic total partitions the nine cross duads; every syntheme has either one or three cross duads, so if of its five synthemes are cross, then , giving . Each vertex therefore has degree two. The stronger assertion about its components follows directly for , when the two triangles are
any other triple partition is obtained by relabelling , which also permutes the synthematic totals. Denote the two components by .
The complete block collection is given by the following three rules:
  • Include and .
  • For each of size two and each duad , include and its complement .
  • For each unordered triple partition and its two components , include , , , and .
There are distinct blocks. The first two rules have different intersection sizes with from the third; within the third, a block determines its triple and its component. We next verify the Steiner system property, rather than relying solely on this count.
We need one further consequence of the triangle construction. The three synthemes attached to the three pairs within are pairwise disjoint, since any two belong to their common synthematic total, and together they are all nine cross duads of the complete bipartite graph between and . Thus determines the unordered partition uniquely: it is the bipartition of this connected graph. There are 10 such partitions, each giving two different components, hence 20 different triples in . Since , each triple in corresponds to exactly one triple partition of . The same reasoning applies to .
Let be any five-point set and put . If , only can contain it; if , only can contain it, because no other block has five points in either half.
If , set and write . The three pairs attached to partition , so exactly one contains ; its block is the unique block through . If , put and write . The three duads of partition , so exactly one contains ; this gives the unique block .
If , write and . A syntheme has either one or three duads crossing . In the one-cross case, has exactly one duad internal to , and the unique block is . No block with three points in each half is possible, since is then not an edge of either triangle. In the three-cross case, is an edge of exactly one triangle , giving the unique block ; no duad of is internal to , so a block with four points in is impossible.
Finally let , write and , and use the uniquely associated partition just proved. If crosses this partition, the three synthemes belonging to the pairs inside contain each cross duad exactly once. Thus the matching of attached to has exactly one pair internal to . It has exactly one pair internal to as well, since a matching must leave equal numbers of vertices in the two halves for cross pairs. The unique block containing is then ; is not contained in either or , so no block of the third rule applies. If is internal to or , none of its attached pairs lies inside or , since the synthemes attached to these internal pairs are cross. Thus the second rule gives no block. The third rule gives exactly one, namely or , according to which part contains .
All possibilities have now been exhausted, proving
This is the small Witt design; the construction uses only duads, synthemes, their synthematic totals, and the induced action on those synthematic totals.
A point is an element of . A duad is an unordered two-element subset. A syntheme is a partition of into three duads, and a total of synthemes is a collection of five synthemes whose duads partition all fifteen duads. In graph terms these are vertices, edges, perfect matchings and one-factorization of .
The first counts are , , and
synthemes. To count totals, first observe that two edge-disjoint synthemes have union a six-cycle. Its complement in is a triangular prism: two triangles on alternate cycle vertices, joined by the three remaining cross edges. Its perfect matchings are the matching using all three cross edges and three matchings using one cross edge each. The all-cross matching cannot be used in a factorization, because the remaining two odd triangles cannot be matched. The other three matchings partition the prism edges. Therefore every pair of disjoint synthemes extends to a unique total.
Fix a syntheme . Each of its three duads belongs to three synthemes. Inclusion-exclusion shows that synthemes share a duad with , including itself. Thus eight are disjoint from . A total containing uses four of these, and each disjoint syntheme determines exactly one such total. Hence belongs to totals. Counting incidences gives
Two different totals share at most one syntheme, by the unique-completion assertion. There are fifteen pairs of totals and fifteen synthemes each belonging to two totals; consequently each pair of totals has exactly one common syntheme. This incidence property drives the next construction.
Write for the total of assigned to a point . The duad-syntheme duality on six points is constructed entirely from incidence, as follows.
For a duad , define to be the unique syntheme common to and . This is a bijection between the fifteen duads and the fifteen synthemes of , by the last incidence count in part (a).
For a duad of , the three synthemes containing each belong to two totals. Each total contains exactly one of these synthemes, since its five matchings cover every duad exactly once. Their three pairs of totals therefore partition all six totals. Pulling these pairs back to gives a syntheme . Different give different , since two distinct synthemes of containing have intersection exactly that duad. There are fifteen of each, so this construction is bijective. Define by its inverse. Equivalently, the three synthemes for have common duad . In particular,
For a total of , map its five synthemes to five duads of . Any two of the original synthemes are disjoint. Their image duads must intersect: if two image duads were disjoint, the unique syntheme containing both in would give a common duad in the original two synthemes through the pairs-of-totals construction. Conversely intersecting duads cannot lie together in a syntheme and give disjoint original synthemes. Five distinct pairwise-intersecting edges must form the full star at one point. Indeed two edges meeting at a point either force every other edge through that point or leave only the three edges of a triangle, which cannot contain five edges. Define to be the star's center. Distinct totals give distinct stars; since there are six of each, this is a bijection to the points of .
It remains to extend to unordered three-versus-three partitions. Start with a partition of . Its six cross synthemes are the perfect matchings between the two triples, parametrized by permutations in . Two of these are disjoint exactly when the quotient of their permutations is a three-cycle. Hence the six cross synthemes split into two classes of three: within a class any two are disjoint, and between classes any pair shares a duad. This unordered division into two classes is independent of the chosen orderings of the triples.
Every total has exactly two cross synthemes. To see this, any syntheme has either one or three cross duads. If a total has all-cross synthemes, it covers cross duads; the whole complete graph has nine, so . Its two cross synthemes belong to the same parity class. Conversely any pair in one class extends to a unique total. Thus the six totals split into two triples, the three totals arising from pairs in each parity class. Pulling them back through the original point-total bijection defines a partition of .
Under the duad mapping, its six internal duads become exactly the six cross synthemes of : a syntheme in a parity class belongs to the two totals formed by pairing it with the other two members. These incidences give the three edges of a triangle on each triple of totals. Therefore the partition is characterized by
This correspondence is injective: the six cross synthemes determine all nine cross duads of , whose bipartition is unique up to interchange. There are partitions on each side, so it is bijective. Define by the inverse of the construction above.
The inverse incidence rule is also useful. If a duad is internal to , none of the cross synthemes contains it, so its inverse syntheme has no internal duad of and is entirely cross. If is cross, exactly two cross synthemes contain it, so the inverse syntheme has two internal duads and one cross duad. Thus internal duads and cross synthemes exchange roles in both directions. All the extensions are natural: they use intersections and incidence, with no auxiliary ordering left in the answer.
A Steiner system is an -point set together with -element blocks such that every -element subset is contained in exactly one block. On , define the following six-element blocks using the incidence extensions of .
Take the two blocks and . For each duad of and each duad in the syntheme , take
These give forty-five blocks of type and forty-five of type . Finally, for every corresponding partition pair and , take all four unions
There are ten partition pairs and forty blocks of type . Distinct indexing data give distinct blocks within each family, and different types have different intersection sizes with . Thus the total is
To prove the defining property, fix a five-element subset and set .
If or , only or can contain it. If , write and with . A containing block must have type and its omitted duad is . The total has exactly one syntheme containing ; the other total containing that syntheme determines a unique second point . Thus the unique block is .
If , write and . A containing block must have type , with omitted duad . Exactly one duad contains , so is the unique block.
If , write and , where . There are only two possible types. A block exists exactly when the matching has a duad contained in . There is then exactly one such duad, since two disjoint duads cannot fit inside a triple. For a perfect matching on two triples, either all three pairs are cross, or there is one internal pair in each triple and one cross pair. Thus a block exists precisely when is not entirely cross for .
On the other hand, a block containing must use the unique partition of corresponding to . It exists precisely when is contained in one of that partition's triples, and is then unique. By the partition incidence rule in part (b), this happens precisely when is entirely cross. Hence exactly one of the two possible block types exists, always uniquely.
For , interchange the roles of and and use the inverse partition incidence rule proved in part (b). More explicitly, the duad either has an inverse syntheme with an internal pair in the complement of the triple , yielding a unique block, or its inverse syntheme is entirely cross, yielding the unique block. These alternatives are exclusive and exhaustive for the same matching-on-two-triples reason.
Every split therefore gives exactly one containing block. We have constructed
As an independent count, each block contains six five-subsets and . The case proof establishes uniqueness and existence; the count alone would not have done so.
The complete graph on six points has fifteen edges and fifteen perfect matchings. Its six one-factorizations organize a dual incidence geometry exchanging points with factorizations and edges with matchings. The classical names are duads, synthemes and totals of synthemes. This geometry supports duad-syntheme duality on six points and a construction of the small Witt design.