Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Bar two-cocycles classify abelian-kernel extensions

Statement

Assume AC. For a group G and a fixed left G-module A, normalized bar H2(G,A) is in bijection with equivalence classes of extensions 0AEG1 inducing the fixed action on A. The zero class corresponds exactly to extensions with a homomorphic section. The derived interpretation of bar cohomology retains its supplied-resolution comparison convention.

Facts & Assumptions

Given: AC, G and A as stated; extension equivalences fix kernel and quotient.

[F1]

The bar coboundary in degree two is the alternating action/multiplication formula (Inhomogeneous group cochains).

[F2]

Normalized cochains compute H2 under the inherited convention (Normalized cochains compute group cohomology).

[F3]

Equivalence fixes the identified kernel and quotient (Equivalence of group extensions with fixed kernel and fixed quotient).

[F4]

Every family of nonempty sets has a choice function (The Axiom of Choice).

Proof

1.1

For an extension E, apply AC to the nonempty fibers of EG and set s(1)=1. Unique kernel coordinates define f by s(g)s(h)=i(f(g,h))s(gh). Then f(1,g)=f(g,1)=0. Associativity of s(g)s(h)s(l) gives f(g,h)+f(gh,l)=gf(h,l)+f(g,hl), exactly δf=0. The action term follows from s(g)i(a)s(g)1=i(ga), the prescribed action.

F1F4givenalgebra
2.1

Conversely, for a normalized cocycle f define Ef=A×G with (a,g)(b,h)=(a+gb+f(g,h),gh). The first coordinates of the two triple products differ by f(g,h)+f(gh,l)gf(h,l)f(g,hl)=0, so multiplication is associative. The identity is (0,1). The inverse is (a,g)1=(g1ag1f(g,g1),g1); the right product is the identity, and the left product is too since the cocycle identity gives f(g1,g)=g1f(g,g1). Inclusion a(a,1) and projection to G are exact and conjugation induces ga.

F1step 1.1algebra
3.1

A new normalized section sb(g)=i(b(g))s(g) changes f to fb=f+δb, where (δb)(g,h)=b(g)+gb(h)b(gh). The map EfEfb, (a,g)(ab(g),g) is an isomorphism: substitution in the two multiplication laws gives first coordinate a+gc+f(g,h)b(gh) on both sides. It fixes A and G and has inverse adding b(g). If two normalized cocycles differ by a coboundary, the cochain b is normalized as well, since its coboundary at (1,g) equals b(1).

F1F3step 2.1algebra
4.1

The map EfE, (a,g)i(a)s(g), is a homomorphism by the factor-set equation; unique kernel coordinates in each fiber make it a bijection fixing A and G. Conversely any equivalence carries a chosen section to a section and preserves its factor set. Thus the two constructions induce inverse bijections on the quotient by coboundaries and on extension classes. By F2 this quotient is the indicated H2.

F2F3step 1.1step 3.1algebra
5.1

If the class is zero, choose a normalized b with f+δb=0; the section sb is then a homomorphism. A homomorphic section conversely has f=0 and hence zero class. For A=0 there is the unique extension G, and for G=1 the unique extension A; both have zero class. Only step 1.1 uses arbitrary choice; supplied sections suffice for an individual construction.

step 1.1step 3.1step 4.1algebra

Depends on

Used by

Dependency tree · two levels

10 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