Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-11
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.

The kernels of the amalgamating maps are killed in the opposite canonical maps to a group pushout

Statement

For a pushout of f:K→G and h:K→H, iH(h(ker⁡f))={e},iG(f(ker⁡h))={e}. Hence canonical factor maps in an arbitrary group pushout need not be injective. No equality with their full kernels is asserted.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Given homomorphisms f:K→G and h:K→H as in def-group-homomorphism, a pushout is a group P with homomorphisms iG:G→P and iH:H→P such that iG∘f=iH∘h, and such that every compatible pair u:G→Q, v:H→Q factors through a unique w:P→Q with w∘iG=u and w∘iH=v. The maps f,h need not be injective. (Pushouts of group homomorphisms).

[L2]

For homomorphisms f:K→G and h:K→H, let N be the normal closure in G∗H of {jG(f(k))jH(h(k))−1:k∈K}. Then (G∗H)/N, with the induced factor maps jG and jH, is a pushout of f and h. (A group pushout is the quotient of a free product by the amalgamating relations).

[L3]

Let G and G′ be groups with identities e and e′, and let f:G→G′ be a group homomorphism (def-group-homomorphism), so f(xy)=f(x)f(y) for all x,y∈G. Then: 1. f(e)=e′; 2. f(g−1)=f(g)−1 for every g∈G; 3. f(gn)=f(g)n for every g∈G and every n∈Z, powers being those of def-group-power. For monoid homomorphisms the analogue of claim 1 is false, so preservation of the identity has to be part of the definition: the map u:Z→Z with u(x)=0 for every x satisfies u(xy)=u(x)u(y) for the multiplicative monoid (Z,⋅,1), yet u(1)=0≠1. (A group homomorphism automatically satisfies f(e)=e′ and f(g−1)=f(g)−1, and f(gn)=f(g)n for every n∈Z; for monoid homomorphisms preservation of the identity must be assumed).

Proof

technique · direct
1.1

If k∈ker⁡f, commutativity gives iH(h(k))=iG(f(k))=iG(e)=e.

givenL1L2L3
2.1

Interchanging f and h gives iG(f(ker⁡h))={e}.

step 1.1
3.1

Therefore a nontrivial image of one kernel is killed by the opposite canonical map. This occurs, for example, for any nontrivial group K with G=1, H=K, f trivial, and h=idK: then h(ker⁡f)=K, so iH is not injective. This proves both the containments and the asserted possible failure.

step 2.1∎

Depends on

Used by

Dependency tree · two levels

23 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