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.
Baer sum of two extensions of cyclic groups
Example
The Baer sum of two copies of the nonsplit extension is split. Thus among extension classes of by .
Facts & Assumptions
Given: The two copies of displayed above. All groups and maps in the calculation are abelian.
Baer sum is diagonal pullback followed by codiagonal pushout: The Baer sum of extension classes.
The split class The split extension class is the additive zero whenever extension classes form a set, by Baer sum makes extension classes an abelian group.
Verification
Any middle group in an extension of by has four elements. Transporting its law and endpoint maps to a fixed four-element set shows that the classes have a finite set realization. The extension is nonsplit because every element of above has order four.
The diagonal pullback has middle group and kernel map . Its codiagonal pushout is , where . The endpoint maps are and .
The map is injective since a relation with first component has . If , write ; its class equals . Thus , and is surjective. The class has and , the relation for .
Therefore defines a homomorphic section of . The map is an endpoint-preserving isomorphism : surjectivity and injectivity follow from the kernel description and . Hence the Baer sum is split and equals the zero class.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- Charles A. Weibel, An Introduction to Homological Algebra, Chapters 3–4 (standard reference, not scraped)