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.
Monoid homomorphism and group homomorphism
Definition
Let and be monoids (Semigroup and monoid). A monoid homomorphism from to is a function such that
- (H1) for all ;
- (H2) .
Let and be groups (Group and abelian group). A group homomorphism from to is a function satisfying (H1) alone:
Condition (H2) is not imposed for groups because it follows: a group homomorphism automatically satisfies and (A group homomorphism automatically satisfies and , and for every ; for monoid homomorphisms preservation of the identity must be assumed). For monoids it does not follow and must be assumed, which is why the two definitions differ.
A homomorphism from a structure to itself is an endomorphism. The identity map of is a monoid homomorphism, and a composite of monoid homomorphisms is one, since and ; the same computation, without the second clause, shows a composite of group homomorphisms is a group homomorphism.
Remarks
-
(H1) is a statement about two different operations. On the left the product is formed in , on the right in ; the notation suppresses that and the reader must supply it. The definition says exactly that turns products into products, and nothing else.
-
The asymmetry between the two definitions is real, not stylistic. The map sending every integer to satisfies (H1) for the multiplicative monoid of , since , and it sends the identity to , so it is not a monoid homomorphism. In a group the same phenomenon is impossible, and cancellation is the reason (A group homomorphism automatically satisfies and , and for every ; for monoid homomorphisms preservation of the identity must be assumed).
-
Only the definition is given here. Kernels, images, isomorphisms and the isomorphism theorems belong to a later page; nothing on this page or its companion uses them.
Depends on
Used by
- Each factor is a retract of a free product when all other factors are sent trivially Corollary
- For a trivial action, first cohomology is Hom Corollary
- Frobenius automizer criterion for p nilpotence Corollary
- Maximal subgroups of a finite p-group are the inverse images of Frattini hyperplanes Corollary
- A nonsurjective homomorphism need not carry the Frattini subgroup into the target Frattini subgroup Counterexample
- Cyclic sylow does not alone imply a normal p complement Counterexample
- Squaring is not a homomorphism on a nonabelian group Counterexample
- The doubling endomorphism of (ℤ,+) has trivial kernel but is not surjective Counterexample
- The group coequalizer of doubling and zero on the integers is not its underlying-set coequalizer Counterexample
- The map n ↦ (n,0) from ℤ to ℤ × ℤ preserves addition and multiplication and does not preserve 1, so the clause f(1) = 1 is not redundant Counterexample
- A directed set and an inverse system of groups indexed by it Definition
- A finite-dimensional representation ρ:G→ GL(V) over a field, and its degree Definition
- A graph of groups Definition
- A retraction of the kernel in a group extension Definition
- Additive characters of a finite abelian group Definition
- An HNN extension with its stable letter Definition
- Ascending HNN extensions of injective endomorphisms Definition
- Endpoint monodromy of an unordered configuration loop as a permutation of the labels Definition
- Free abelian group on a set Definition
- Free group on a set of generators Definition
- Group extensions, sections, complements, and split extensions Definition
- Group isomorphisms, automorphisms and the set Aut(G) Definition
- Lie-group homomorphism, isomorphism, and automorphism Definition
- Morphisms of group extensions Definition
- P residual of a finite group Definition
- Pushouts of group homomorphisms Definition
- Ring homomorphism: additive, multiplicative, and required to send 1 to 1 Definition
- The free product of an arbitrary family of groups Definition
- The homomorphism on fundamental groups induced by a pointed continuous map Definition
- The kernel and image of a group homomorphism Definition
- The quotient graph of groups attached to a tree action Definition
- Transfer homomorphism for a finite index subgroup Definition
- For n≥2, reduction ℤ→ℤ/n has kernel nℤ and realises ℤ/n by the first isomorphism theorem Example
- The equalizer of two group homomorphisms is their agreement subgroup Example
- The free word monoid on X represents M mapstoSet(X,U(M)) Example
- The trivial homomorphism G→ H has kernel G and image {e_H} Example
- FALSE: a set-theoretic section of an extension is automatically a homomorphism False statement
- A group homomorphism automatically satisfies f(e) = e' and f(g⁻¹) = f(g)⁻¹, and f(gⁿ) = f(g)ⁿ for every n ∈ ℤ; for monoid homomorphisms preservation of the identity must be assumed Lemma
- A ring homomorphism satisfies f(0) = 0, f(-a) = -f(a) and f(ma) = m f(a) for m ∈ ℤ, carries units to units, and has a subring as its image; composites of ring homomorphisms are ring homomorphisms Lemma
- Abelian-group model for spectral-sequence computations Lemma
…and 34 more results.
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
- Group homomorphism (Wikipedia) (standard reference, not scraped)
- Monoid homomorphism (Wikipedia) (standard reference, not scraped)