Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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

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=aA,

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

Facts & Assumptions

Given: A cyclic quotient Cn=x and a trivial-action abelian kernel A.

[L1]

Central extensions are classified by H2(Cn,A) (Central extensions are classified by H^2 with trivial action).

Verification

technique · direct
1.1

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 kernel A. That kernel is central, so the extension is determined by the parameter a:=x~n.

L1givenchoosealgebra
2.1

Replacing x~ by bx~ with bA changes the parameter to (bx~)n=nb+x~n because A is central and written additively. Thus two parameters define equivalent extensions exactly when they differ by an element of nA.

step 1.1algebra
3.1

So the central extension classes are parametrized by A/nA, which is the familiar description of H2(Cn,A) from [L1].

L1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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