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.
Cohomologous two-cocycles give equivalent extensions
Statement
Let and be normalized two-cocycles. Then the twisted products and are equivalent extensions with fixed kernel and quotient if and only if is a two-coboundary.
Facts & Assumptions
Given: Normalized two-cocycles .
A twisted product is a group exactly when its factor set is a normalized two-cocycle (The twisted product is a group iff the factor set is a two-cocycle).
The twisted-product extension and its kernel and quotient maps are defined in Twisted product extension from a two-cocycle.
Extension equivalence fixes the chosen kernel and quotient maps (Equivalence of group extensions with fixed kernel and fixed quotient).
Changing a section changes the factor set by a coboundary (Changing the section changes the factor set by a coboundary).
Proof
Suppose . Define by . Using the product formulas from [F1], the identity , and [L1], one checks directly that The inverse is , so is a group isomorphism. It fixes the kernel and quotient maps, so [F2] makes the two extensions equivalent.
Conversely, suppose is an extension equivalence. Because [F2] fixes quotient and kernel, has the form for a unique normalized one-cochain . Comparing the image of under with the product of the images gives So is a coboundary.
Step 1.1 proves the forward implication and step 1.2 proves the reverse implication.
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
- Clara Loh, Group Cohomology, SS 2019 (standard reference, not scraped)
- Caroline Lassueur, Cohomology of Groups, SS 2021 (standard reference, not scraped)