Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedverified 2026-09-26 (gpt-6-sol)
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.

Central extensions of a cyclic group

Example

Assume the Axiom of Choice (The Axiom of Choice).

Let n≥1, let G=Cn=⟨x⟩, and let A be an abelian group with trivial Cn-action. A central extension class is represented by a relation

x~n=a∈A,

and changing the lift x~ by b∈A changes a to a+nb. Hence the extension classes are parametrized by A/nA.

Facts & Assumptions

Given: The Axiom of Choice, an integer n≥1, a cyclic quotient Cn=⟨x⟩, and a trivial-action abelian kernel A.

[L1]

Under the assumed Axiom of Choice, central extensions are classified by H2(Cn,A) (Central extensions are classified by H^2 with trivial action).

Verification

technique · direct
1.1F2givenconstructalgebra

In any central extension, choose a lift x~ of the generator x. Since the quotient has order n, the element x~n lies in the central kernel A; write it as a∈A. For every a∈A, construct Ea=(A×Z)/⟨(−a,n)⟩. The subgroup in the denominator is normal because A×Z is abelian. The map A→Ea, b↦[(b,0)], is injective: if (b,0)=k(−a,n) then kn=0, hence k=0 and b=0. The map Ea→Cn, [(b,m)]↦xm, is well defined and surjective, with kernel precisely the image of A; if m=kn, then [(b,m)]=[(b+ka,0)]. Thus Ea is a central extension, and its distinguished lift [(0,1)] has nth power [(a,0)].

2.1step 1.1givenalgebra

The homomorphism A×Z→E defined by (b,m)↦bx~m is onto: an element of E has quotient xm, so differs from x~m by an element of A. Its kernel is exactly ⟨(−a,n)⟩: a kernel element has m=kn, and then bx~kn=b+ka=0 in the embedded kernel. Therefore it descends to an extension equivalence Ea≅E. Every central extension in the example is realized by one of the Ea.

3.1step 1.1step 2.1algebra

Replacing x~ by bx~ changes its nth power from a to a+nb because A is central. Conversely, if a′=a+nb, sending the distinguished lift [(0,1)]∈Ea′ to [(b,1)]∈Ea and fixing A defines an extension equivalence: the new lift has nth power a+nb=a′. Hence two parameters define equivalent extensions exactly when they differ by an element of nA.

4.1L1step 1.1step 2.1step 3.1∎

Steps 1.1--3.1 identify the extension classes with A/nA. Under the stated Choice premise, [L1] identifies those same classes with H2(Cn,A), giving the claimed cohomological description.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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