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.
A pushout along an isomorphism is isomorphic to the other factor
Statement
If is an isomorphism and is any homomorphism, then the pushout is isomorphic to , compatibly with the canonical maps.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
Given homomorphisms and as in def-group-homomorphism, a pushout is a group with homomorphisms and such that , and such that every compatible pair , factors through a unique with and . The maps need not be injective. (Pushouts of group homomorphisms).
Group isomorphisms, automorphisms and the set . An isomorphism is a bijective group homomorphism (def-group-homomorphism, def-injection-surjection-bijection). When , it is an automorphism of . Write (Group isomorphisms, automorphisms and the set ).
The inverse of a bijective group homomorphism is a group homomorphism. If is a bijective group homomorphism, then its set-theoretic inverse is a group homomorphism. (The inverse of a bijective group homomorphism is a group homomorphism).
Proof
The maps and are compatible because .
For any other compatible pair , , compatibility forces , so the unique mediator from is .
Thus satisfies the pushout universal property and is uniquely isomorphic to the given pushout. The proof also covers trivial groups.
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: 24 results over 10 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.