How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A product formula for the number of square roots of the identity in a central product of extraspecial -groups
Statement
Let and be extraspecial -groups and let be the central product along an isomorphism of their centres. Write . Then
Facts & Assumptions
Given: Extraspecial -groups with of order two, an isomorphism , and with quotient map .
For groups with central subgroups , and an isomorphism , the central product is the quotient of by (The central product of two groups along an isomorphism of central subgroups).
The external direct product carries the componentwise operation (The external direct product with componentwise multiplication).
The quotient group has the left cosets as elements, with product (The quotient group and coset product ).
For a finite -group the following are equivalent: is extraspecial; is nonabelian, and is elementary abelian; is nonabelian and has order (Three equivalent descriptions of an extraspecial -group).
An elementary abelian -group is a finite abelian -group in which every nonidentity element has order (Elementary abelian -groups).
The subgroup of is central, hence normal (The identified subgroup used to form a central product is central, hence normal).
The canonical maps into a central product are injective homomorphisms whose images commute elementwise, generate the product, and meet in the image of the identified subgroup (The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
is the unique natural number with (The cardinality of a finite set).
Proof
Since is elementary abelian, for every ; so splits into the elements with and the elements with .
The quotient map is surjective with kernel , which has two elements, so every element of has exactly two preimages in .
Because the two canonical images commute, for all and .
Hence exactly when , that is exactly when and , or and .
The number of pairs with is therefore .
Each element of with square the identity is counted exactly twice in that total, so is half of it, which is the displayed formula.
Remarks
The second summand is what makes the formula more than a product: an element of can square to the identity because both of its coordinates square to the identity, or because both square to the identified central element and those two squares cancel in the quotient.
Writing and with , the formula collapses to with : the signs multiply.
Depends on
- The central product $G\circ_\alpha H$ of two groups along an isomorphism of central subgroups
- The identified subgroup used to form a central product is central, hence normal
- The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre
- Three equivalent descriptions of an extraspecial $p$-group
- Elementary abelian $p$-groups
- The external direct product $G\times H$ with componentwise multiplication
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- The center $Z(G)$ of a group
- The cardinality $\lvert A\rvert$ of a finite set
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
Used by
Dependency tree · two levels
48 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- D. A. Craven, The Theory of p-Groups, Theorem 3.14(ii) (standard reference, not scraped)
- D. Kaur and A. Kulshrestha, Characters of real special 2-groups, Remark 2.4 (standard reference, not scraped)