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.
Statement
Let be the central product of two copies of the quaternion group along the unique isomorphism between their centres. Then is also an internal central product of two subgroups isomorphic to meeting in , and therefore
Facts & Assumptions
Given: Two copies of , the central product along the unique isomorphism of their centres, the canonical images of the generators of and of those of , and the common central image , so that , and .
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).
Subgroups of form an internal central product when they generate and for (Internal central products of a finite family of subgroups).
is the smallest subgroup of containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
, the element is its only element of order two, and each of has order four ( is a subgroup of with eight elements, and is its only element of order ).
and are extraspecial of order eight ( and are extraspecial of order , with six and two solutions of respectively).
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).
A central product of two extraspecial -groups identified along their centres is extraspecial of order (A central product of extraspecial -groups identified along their centres is extraspecial).
Subgroups form an internal central product of if and only if the multiplication map from their direct product is a surjective homomorphism; for two factors along the identity of (Internal central products are the images of external ones).
For , with and , of order ( with inversion action has order and the dihedral relations).
The conditions , , hold if and only if conjugation restricts to an action and is an isomorphism ( Recognition theorem: with , exactly realises an external semidirect product).
For a finite group and , (Lagrange's theorem: for every subgroup of a finite group ).
Proof
The two canonical images are isomorphic copies of that commute elementwise, generate , and meet exactly in ; and is extraspecial of order .
Each has order four, since and with ; likewise each .
Put and . Then , because commutes with ; likewise .
Also , because commutes with everything in the first image; likewise .
Neither lies in nor in : if were a power of then would lie in the first canonical image, hence in , contradicting that has order four.
Set and . In the cyclic subgroup of order four is normalised by and meets trivially, and ; so is the internal semidirect product of a cyclic group of order four by a group of order two acting by inversion, that is of order eight with . The same holds for .
The four generators commute in pairs across the two subgroups: commutes with and with ; commutes with ; and while , and these agree because gives . Hence .
The two subgroups generate : they contain , hence and , hence both canonical images, which generate .
So and form an internal central product of , and the recognition theorem gives along the identity of . Comparing orders, , so and .
Since and are isomorphic to by isomorphisms carrying to the centre, is a central product of two copies of along the unique isomorphism of their centres, which is what was claimed.
Remarks
The identity is the whole of the computation in step 4.1, and it is where the quaternion hypothesis is spent: in a central product of two dihedral groups the corresponding squares are both trivial and the same computation succeeds for a different reason. What the statement records is that these two central products are the same group, so the number of quaternion factors in a decomposition is not an invariant of it.
Depends on
- Internal central products of a finite family of subgroups
- Internal central products are the images of external ones
- The central product $G\circ_\alpha H$ of two groups along an isomorphism of central subgroups
- The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre
- A central product of extraspecial $p$-groups identified along their centres is extraspecial
- $\operatorname{Dih}(C_4)$ and $Q_8$ are extraspecial of order $8$, with six and two solutions of $x^2=1$ respectively
- The quaternion group $Q_8=\{\pm1,\pm i,\pm j,\pm k\}$ inside the nonzero quaternions
- The quaternions $\mathbb{H}$: real quadruples with componentwise addition and an explicit multiplication formula matching the table on $1, i, j, k$
- $Q_8$ is a subgroup of $\mathbb{H}^{\times}$ with eight elements, and $-1$ is its only element of order $2$
- $\operatorname{Dih}(C_n)=C_n\rtimes C_2$ with inversion action has order $2n$ and the dihedral relations
- Recognition theorem: $G=NH$ with $N\trianglelefteq G$, $N\cap H=1$ exactly realises an external semidirect product
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- 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
- The center $Z(G)$ of a group
Used by
Dependency tree · two levels
70 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, Proposition 3.13(i) (standard reference, not scraped)
- M. van Beek, Topics in Finite p-Groups, Exercise 2.37 (standard reference, not scraped)