Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27
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 (M,⋅,e) and (M′,⋅′,e′) be monoids (Semigroup and monoid). A monoid homomorphism from M to M′ is a function f:M→M′ such that

  • (H1) f(x⋅y)=f(x)⋅′f(y) for all x,y∈M;
  • (H2) f(e)=e′.

Let G and G′ be groups (Group and abelian group). A group homomorphism from G to G′ is a function f:G→G′ satisfying (H1) alone:

f(xy)  =  f(x) f(y)for all x,y∈G.

Condition (H2) is not imposed for groups because it follows: a group homomorphism automatically satisfies f(e)=e′ and f(x−1)=f(x)−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). 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 M is a monoid homomorphism, and a composite of monoid homomorphisms is one, since (g∘f)(xy)=g(f(x)f(y))=g(f(x)) g(f(y)) and (g∘f)(e)=g(e′)=e′′; the same computation, without the second clause, shows a composite of group homomorphisms is a group homomorphism.

Remarks

Depends on

Used by

…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