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 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.
For the block computation only, place the -vectors in the order after the -vectors. This temporary reversal of the second block changes no transformations. The form matrix becomes .
Let be upper unitriangular of size , and let be symmetric. The matrices
satisfy by direct block multiplication. The generator is , because the inverse transpose adds to . The generators and are respectively and . This proves all of them preserve the form, in every characteristic.
The -generators generate every upper unitriangular , by elimination of off-diagonal entries. The generators add all elementary symmetric entries, so they generate every . Moreover
which keeps symmetry. Therefore the generated group is exactly
The two factors are uniquely determined by its diagonal and off-diagonal blocks. Their counts are and , giving
It is a -group, and this equals the full -part found in part (a); hence is a Sylow -subgroup. In the original reversed- ordering, these matrices are upper unitriangular throughout, exactly as the prescribed generators suggest. This is consistent with the finite symplectic group order. No factor of two was divided out, so characteristic two is included.
The symplectic group consists of the invertible linear maps preserving the alternating bilinear form:
We use row-vector action in this question, which is the convention compatible with its printed upper-triangular flag stabilizer subgroup. Thus matrices preserve a form matrix by .
Count ordered symplectic bases. There are choices for the first nonzero vector . Nondegeneracy makes the equation a nonzero linear-functional equation, with solutions. Their span is a nondegenerate plane; its orthogonal complement is symplectic of dimension . Repeating there gives
Each symplectic basis is the image of a fixed one under exactly one form-preserving map, justifying the count as a group order. If , every factor is prime to , so the exact -part is .
Iwasawa's simplicity lemma states the following. Suppose acts faithfully and primitively on a set, and a stabilizer subgroup has an abelian normal subgroup whose -conjugates generate . Then every nontrivial normal subgroup contains . In particular, if is nontrivial and perfect, then is simple.
Indeed a nontrivial normal subgroup in a faithful primitive action is transitive, so . Since normalizes , all conjugates of have the same image in . Those images generate the quotient, which is therefore abelian. This gives and proves the stated conclusion.
Put , and let . Sharp two-transitivity gives and . A nonidentity element fixes at most one point. Counting the nonidentity elements in the stabilizer subgroups shows that there are fixed-point-free elements. Let be this set together with the identity. We first prove it is a normal subgroup, rather than presuming that fixed-point-free elements are closed under multiplication.
For , and directly. Otherwise use complex characters of a finite group. Let be the permutation character and , the character of the permutation representation with its constant line removed. For every nontrivial irreducible character of , form the virtual character
Its values are at the identity and at every fixed-point-free element. At an element with one fixed point, conjugate it to ; induction gives , because there is exactly one fixed coset.
The identity and the fixed-point-free elements together contribute to the inner product. The remaining elements are partitioned into the nonidentity parts of the stabilizer subgroups. Hence character orthogonality gives
A virtual character of norm one is plus or minus an irreducible character: its coefficients in the irreducible-character basis are integers whose squares sum to one. Its positive degree selects the plus sign. Thus each is an actual irreducible character.
For a group representation, holds exactly on its kernel: make the representation unitary and compare the sum of its unit-modulus eigenvalues with its dimension. All of therefore lies in the intersection of the kernels of the . Conversely, a nonidentity element fixing a point gives in . Some nontrivial irreducible character of has , since otherwise the regular representation of would not vanish at . Consequently
This proves normality and subgroup closure. It has order and no nonidentity element fixing a point, so it is a regular permutation subgroup.
Now acts transitively by conjugation on : identify an element of with its image of and use transitivity of on the remaining points. Thus all nonidentity elements of have the same order. Taking a suitable power of one element shows this common order is a prime . By Cauchy's theorem no other prime divides , so is a -group. Its nontrivial center is -invariant, so transitivity forces the center to be all of . Therefore is elementary abelian of order .
Since is prime to , is the unique Sylow -subgroup of . Uniqueness makes it characteristic under every group automorphism. We have proved
The character argument supplies the regular kernel of a finite sharply two-transitive group; the final Sylow argument establishes the stronger characteristic assertion.
For , a group is sharply t-transitive when any two ordered -tuples of distinct points are related by exactly one group element. Equivalently its action on the set of such tuples is regular. In the finite case
and the stabilizer subgroup of an ordered -tuple is trivial. The condition includes both existence and uniqueness, not just transitivity.
Here is the double-coset criterion for a one-point extension. Let , and suppose swaps and . Then is a one-point extension if and only if
For necessity, in an extension fixes both and , so normalizes it and lies in it. Since is transitive on , the extension has exactly two double cosets relative to : and . For , moves into and is in the latter double coset.
For sufficiency, the displayed conditions make closed under multiplication. Products with middle element in reduce using ; those with middle element outside remain in . A finite nonempty multiplication-closed set of permutations containing the identity is a group. It contains and , hence equals . Every element in moves , while fixes it, giving the required stabilizer subgroup. The group is transitive because is transitive on and moves the additional point.
Extend each element of to fix . A one-point extension of a permutation group is a transitive permutation group such that
with the induced action on equal to the prescribed action. The stabilizer subgroup equality is the substantive condition: merely adjoining an element that moves does not suffice. If , the orbit-stabilizer theorem gives .
Use the Sylow theorems. The number divides and is congruent to one modulo . Since , it is either one or . Suppose . Different subgroups of prime order intersect trivially, so their nonidentity elements occupy places, leaving only nonidentity elements of other prime orders.
If neither the Sylow -subgroup nor the Sylow -subgroup is normal, then and . Indeed divides , and its possible divisor cannot satisfy the Sylow congruence; the smallest remaining nontrivial possibility is at least . Likewise any nontrivial divisor of is at least . Their elements would require at least
places, since the excess is . Hence some Sylow subgroup of order is normal.
In the quotient by this normal subgroup, the largest prime has a normal Sylow subgroup: for a group of order with its Sylow count divides and so equals one. Pulling back gives a normal subgroup of order . Inside it, the subgroup of order is again the unique Sylow -subgroup. It is characteristic in that normal subgroup and therefore normal in , contradicting . Thus .
Let be this normal Sylow subgroup. In , of order , its subgroup of order is normal by the same argument. Its preimage is a normal Hall -subgroup. The series
has factors of orders , hence cyclic and abelian. Therefore This establishes solubility before using any Hall-existence conclusion that itself assumes solubility.
We prove Hall subgroup existence in soluble groups by induction on . The trivial group is immediate. Choose a nontrivial minimal normal subgroup , elementary abelian of order by part (c). Induction gives a Hall -subgroup of ; let be its full preimage.
If , then itself is the required subgroup. If and , apply induction inside the soluble subgroup to obtain a Hall -subgroup of . Since and are both -numbers, is Hall in too.
It remains to treat and . Then is a -group. If , the subgroup one works. Otherwise choose a minimal normal subgroup of , an elementary abelian -group with . Let be a Sylow -subgroup of . As and , we have . The permitted Frattini argument gives
The last equality uses and the normality of .
If , then is a power of , hence a -number. Apply induction to and multiply indices as before. If , then is a nontrivial normal -subgroup. Induction in gives a Hall -subgroup whose full preimage in is Hall, since its additional factor is a -number. These cases exhaust the possibilities, proving existence for every prime set. No unproved complement theorem or conjugacy theorem for Hall subgroups was inserted into the proof.
A Hall subgroup for a prime set is a subgroup whose order has only prime divisors in and whose index has no prime divisor in :
Here one is allowed in either class, and is the complementary set of primes. Equivalently contains the complete prime-power contribution to for each prime in .
Let be a minimal normal subgroup. Its commutator subgroup is characteristic in , hence normal in . Minimality makes or . The latter would prevent the soluble group from having a terminating derived series, so and is abelian.
Choose a prime dividing . In a finite abelian group its Sylow -subgroup is characteristic, so minimal normality makes this subgroup all of . The subgroup is nontrivial, characteristic and hence normal in . Minimality again makes it all of . Thus
an elementary abelian p-group. Both abelianness and minimal normality are essential to the two characteristic subgroup arguments.
If , induction gives , because commutators of elements of a subgroup are also commutators in the larger group. Thus termination of the derived series of forces termination for .
For a normal subgroup , the quotient map sends to the commutator of their images. Surjectivity then gives
Consequently subgroups and quotient groups of a soluble group are soluble. The assertion about a quotient uses a normal subgroup; it is not a quotient by an arbitrary subgroup.

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