Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

The factor set of a section is a normalized two-cocycle

Statement

If s is a normalized section of an abelian-kernel extension, then its factor set fs is a normalized two-cocycle.

Facts & Assumptions

Given: An extension 1→M→E→G→1 with abelian kernel, and a normalized section s:G→E.

[F1]

Normalized two-cocycles are characterized by the cocycle and normalization equations (Normalized two-cocycle and two-coboundary).

[F2]

The factor set of a normalized section is defined by s(g)s(h)s(gh)−1=i(fs(g,h)) (Normalized set-theoretic section and factor set).

Proof

technique · direct
1.1F2givenalgebra

Because s(1)=1, [F2] gives i(fs(1,g))=s(1)s(g)s(g)−1=1 and likewise i(fs(g,1))=1. The kernel map i is injective, so fs(1,g)=fs(g,1)=0.

1.2F2algebra

Compute (s(g)s(h))s(k) and s(g)(s(h)s(k)) using [F2]. The left-associated expansion is i(fs(g,h)) i(fs(gh,k)) s(ghk), while the right-associated expansion is s(g) i(fs(h,k)) s(g)−1 i(fs(g,hk)) s(ghk). Translating the conjugation term by the given G-action yields g⋅fs(h,k)−fs(gh,k)+fs(g,hk)−fs(g,h)=0.

2.1F1step 1.1step 1.2∎

Steps 1.1 and 1.2 are exactly the conditions of [F1], so fs∈Z2(G,M).

Depends on

Used by

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