Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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 subgroup of the central quotient and its orthogonal complement have orders multiplying to the order of the quotient

Statement

Let P be an extraspecial p-group of order p1+2n, let V=P/Z(P) and let bz be its commutator pairing. For a subgroup UV put

U:={vV:bz(v,u)=0 for every uU}.

Then U is a subgroup of V and

UU=V=p2n.

This is a statement about this pairing on this quotient, proved by counting inside V; no theory of bilinear forms on a vector space is used.

Facts & Assumptions

Given: An extraspecial p-group P of order p1+2n, the quotient V=P/Z(P) with its commutator pairing bz, and a subgroup UV.

[F1]

The commutator pairing of P relative to z is the map bz:V×VFp determined by [x,y]=zbz(xˉ,yˉ) (The commutator pairing of an extraspecial p-group relative to a chosen generator of its centre).

[F2]

A subset S of an elementary abelian p-group spans when every element is a product sSsas with coefficients in Fp, and is independent when such a product is the identity only for zero coefficients; a basis is an independent spanning subset (Fp-spanning sets, independence, and bases in an elementary abelian p-group).

[F3]

An elementary abelian p-group is a finite abelian p-group in which every nonidentity element has order p (Elementary abelian p-groups).

[L1]

The commutator pairing is well defined, Fp-bilinear and alternating (The commutator pairing is well defined on the central quotient, is bilinear over Fp, and is alternating).

[L2]

The radical of the commutator pairing is trivial (The commutator pairing of an extraspecial p-group has trivial radical).

[L3]

An extraspecial p-group has P=p1+2n with n1 and P/Z(P)=p2n (An extraspecial p-group has order p1+2n for some n1).

[L4]

Every finite elementary abelian p-group has a basis; every independent subset extends to a basis, every spanning subset contains a basis, and all bases have the same finite size (Finite elementary abelian p-groups have bases, basis extension, and a well-defined dimension).

[L5]

The rule aˉx=xa gives every elementary abelian p-group its canonical Fp-vector-space structure (An elementary abelian p-group has a canonical Fp-vector-space structure).

[L6]

For every homomorphism f:GH, the rule gkerff(g) is an isomorphism from G/kerf onto imf (First isomorphism theorem for groups: G/kerfimf).

[L7]

For a finite group G and HG, G=[G:H]H (Lagrange's theorem: G=[G:H]H for every subgroup H of a finite group G).

Proof

technique · direct
1.1

The group V is elementary abelian of order p2n, and U is a subgroup of it, hence also a finite abelian p-group whose nonidentity elements have order p.

F3L3L5
1.2

For each fixed uV the map vbz(v,u) is a homomorphism from V to the additive group of Fp, by additivity of bz in its first variable; U is the intersection of the kernels of these maps as u runs over U, hence a subgroup of V.

F1L1
2.1

Choose a basis u1,,uk of U and extend it to a basis u1,,um of V. Unique representation in a basis makes the assignment of coefficient families to elements a bijection, so U=pk and pm=V=p2n, whence m=2n.

F2L4L5step 1.1
3.1

Define Ψ:VV by Ψ(v)=i=1muibz(v,ui). It is a homomorphism, again by additivity in the first variable. If Ψ(v) is the identity then independence of the basis forces bz(v,ui)=0 for every i, and then additivity in the second variable gives bz(v,w)=0 for every wV, so v is the identity by triviality of the radical. Thus Ψ is injective, hence bijective because V is finite.

F1F2L1L2step 2.1
4.1

Let π:VU send i=1muiai to i=1kuiai; unique representation makes π a well-defined homomorphism, and it is surjective onto U because it fixes each ui with ik. The composite Φ=πΨ is therefore a surjective homomorphism from V onto U, and Φ(v) is the identity exactly when bz(v,ui)=0 for every ik, which by additivity in the second variable is exactly vU.

F2step 2.1step 3.1
5.1

The first isomorphism theorem and Lagrange applied to Φ give V=UU, that is UU=p2n.

L6L7step 2.1step 4.1

Remarks

The two ends of the range behave as the formula predicts and are worth naming. For the trivial subgroup the formula reads V=V, since the perpendicular of the trivial subgroup is all of V; for U=V it reads V=1, which is triviality of the radical.

Depends on

Used by

Dependency tree · two levels

46 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