Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-07-28
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.

Ring homomorphism: additive, multiplicative, and required to send 11 to 11

Definition

Let RR and SS be rings (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides). A ring homomorphism from RR to SS is a function f:RSf : R \to S such that, for all x,yRx, y \in R,

  • (RH1) f(x+y)=f(x)+f(y)f(x + y) = f(x) + f(y);
  • (RH2) f(xy)=f(x)f(y)f(xy) = f(x)f(y);
  • (RH3) f(1R)=1Sf(1_R) = 1_S.

A ring homomorphism from a ring to itself is a ring endomorphism; a bijective ring homomorphism is a ring isomorphism.

(RH3) is imposed, not derived, and the reason is exactly the reason Monoid homomorphism and group homomorphism treats monoids and groups differently. Condition (RH1) says that ff is a homomorphism of the additive groups (R,+,0R)(S,+,0S)(R,+,0_R) \to (S,+,0_S), and for groups preservation of the identity is free: it follows from (RH1) by cancellation (A group homomorphism automatically satisfies f(e)=ef(e) = e' and f(g1)=f(g)1f(g^{-1}) = f(g)^{-1}, and f(gn)=f(g)nf(g^{n}) = f(g)^{n} for every nZn \in \mathbb{Z}; for monoid homomorphisms preservation of the identity must be assumed). Condition (RH2) says only that ff is a homomorphism of the multiplicative semigroups, and (R,,1R)(R,\cdot,1_R) is a monoid that need not be a group (Semigroup and monoid); for monoids preservation of the identity does not follow and must be assumed, which is precisely why Monoid homomorphism and group homomorphism puts the clause f(e)=ef(e) = e' into the definition of a monoid homomorphism and leaves it out of the definition of a group homomorphism (Left identity, right identity, and two-sided identity for a binary operation).

So a ring homomorphism is: a homomorphism of additive groups that is also a homomorphism of multiplicative monoids. The clause is not redundant: the companion page exhibits a map ZZ×Z\mathbb{Z} \to \mathbb{Z} \times \mathbb{Z} satisfying (RH1) and (RH2) and failing (RH3).

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 11 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.

Sources