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

Kernel conjugation by an element of the coefficient group corresponds to a principal crossed homomorphism

Statement

Let G act on an abelian group A, let z:GA be a crossed homomorphism, and let aA. If za:GA is defined by

za(g)=z(g)+gaa,

then the graph subgroup Γza is the conjugate of Γz by (a,1) in AG.

Facts & Assumptions

Given: An action of G on an abelian group A, a crossed homomorphism z:GA, and an element aA.

[L1]

The principal crossed homomorphism attached to a is ggaa (Principal crossed homomorphism for abelian coefficients).

[L2]

The graph subgroup of a map is Γz={(z(g),g):gG} (The graph subgroup attached to a map into a semidirect product).

[L3]

The semidirect-product multiplication is (x,g)(y,h)=(x+gy,gh) for abelian coefficients ( The semidirect-product multiplication makes N×H a group).

Proof

technique · direct
1.1

In AG, the inverse of (a,1) is (a,1). Therefore (a,1)(z(g),g)(a,1)=(a+z(g)+ga,g)=(za(g),g) by [L3] and the definition in [L1].

givenL1L3algebra
2.1

Step 1.1 shows that conjugating each element of Γz by (a,1) produces the corresponding element of Γza. Hence (a,1)Γz(a,1)=Γza. So kernel conjugation changes the graph exactly by a principal crossed homomorphism.

L2step 1.1

Depends on

Used by

Dependency tree · two levels

7 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