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.
The Heisenberg group of order over
Definition
Let be a prime (Prime and composite integers: is prime when and its only positive divisors are and ) and let carry the addition and multiplication of For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold, which make it a field (For every prime , the two operations on make it a field). The Heisenberg group of order is the set
with the multiplication
That this is a group law (Group and abelian group), that it is not commutative, and that has elements are proved in The Heisenberg multiplication is a group law, nonabelian, on a set of elements ↗.
Remarks
The same multiplication is written on the published example The finite Heisenberg group is the unique Sylow -subgroup of its coordinate upper-triangular group, where the triple records the three entries above the diagonal of a unipotent upper-triangular matrix over ; the two constructions produce the same group, and the notation is kept identical so that a reader meets one object rather than two.
The asymmetry of the third coordinate, rather than , is a choice of convention: the opposite choice gives the group with the roles of the first two coordinates exchanged, and the map carries one to the other. Nothing below depends on which is taken, provided one is taken throughout.
At the construction does not produce a group of exponent two: the element squares to , so has an element of order four.
Depends on
- Group and abelian group
- For every natural $n$, $(\mathbb{Z}/n,+)$ is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$
Used by
- For odd p, a direct product of two Heisenberg groups is special with centre of order p², hence not extraspecial Counterexample
- At p=2 the Heisenberg construction produces Dih(C₄), not a group of exponent 2 Example
- The Heisenberg group of order 27 has exponent 3 and thirteen subgroups of order 3 Example
- For odd p, a central product of two modular groups of order p³ is a central product of a modular group with a Heisenberg group Lemma
- The Heisenberg group of order p³ is extraspecial, and for odd p it has exponent p Proposition
- The Heisenberg multiplication is a group law, nonabelian, on a set of p³ elements Proposition
- For each prime there are exactly two nonabelian groups of order p³ up to isomorphism Theorem
- For odd p and each n≥1 there are exactly two extraspecial groups of order p¹⁺²ⁿ, distinguished by their exponent Theorem
Dependency tree · two levels
29 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
- M. van Beek, Topics in Finite p-Groups, Definition 2.31 (standard reference, not scraped)
- D. A. Craven, The Theory of p-Groups, Definition 3.3 (standard reference, not scraped)