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.
FALSE: canonical factor maps into every group pushout are injective
Statement
False claim: both canonical factor maps into every group pushout are injective.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
For a pushout of and , Hence canonical factor maps in an arbitrary group pushout need not be injective. No equality with their full kernels is asserted. (The kernels of the amalgamating maps are killed in the opposite canonical maps to a group pushout).
For homomorphisms and , let be the normal closure in of Then , with the induced factor maps and , is a pushout of and . (A group pushout is the quotient of a free product by the amalgamating relations).
For every , view as its canonical nonnegative integer and put . Then the left cosets of in are exactly the congruence classes modulo , and coset addition is the published addition of congruence classes. Thus as the same group on the same underlying set. This includes and . (For every , the congruence-class group is the quotient group ).
Refutation
Take , , , with trivial and the identity.
The amalgamating relation kills the generator of , so the quotient construction makes the pushout trivial. Equivalently, kernel collapse kills .
The canonical map is not injective, refuting the claim.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 61 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- George D. Torres, Combinatorial Group Theory, §2 (standard reference, not scraped)
- B. H. Neumann, Lectures on Topics in the Theory of Infinite Groups, Ch. 9 (standard reference, not scraped)