Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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 ring homomorphism satisfies f(0)=0f(0) = 0, f(a)=f(a)f(-a) = -f(a) and f(ma)=mf(a)f(ma) = m f(a) for mZm \in \mathbb{Z}, carries units to units, and has a subring as its image; composites of ring homomorphisms are ring homomorphisms

Statement

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) and f:RSf : R \to S a ring homomorphism (Ring homomorphism: additive, multiplicative, and required to send 11 to 11). Then:

  1. f(0R)=0Sf(0_R) = 0_S and f(a)=f(a)f(-a) = -f(a) for every aRa \in R; consequently f(ab)=f(a)f(b)f(a - b) = f(a) - f(b);
  2. f(ma)=mf(a)f(ma) = m\,f(a) for every aRa \in R and every mZm \in \mathbb{Z}, the multiples being those of Integer multiples in a ring: (m+n)a=ma+na(m + n)a = ma + na, m(a+b)=ma+mbm(a + b) = ma + mb, (ma)b=m(ab)=a(mb)(ma)b = m(ab) = a(mb) and (ma)(nb)=(mn)(ab)(ma)(nb) = (mn)(ab) for all m,nZm, n \in \mathbb{Z} and a,bRa, b \in R;
  3. if uR×u \in R^{\times} then f(u)S×f(u) \in S^{\times} and f(u)1=f(u1)f(u)^{-1} = f(u^{-1});
  4. the image f(R)={f(a):aR}f(R) = \{\, f(a) : a \in R \,\} is a subring of SS (Subring: a subset containing 1R1_R and closed under addition, additive inverses and multiplication);
  5. if g:STg : S \to T is a ring homomorphism then so is gf:RTg \circ f : R \to T, and the identity map of RR is a ring homomorphism.

Facts & Assumptions

Given: Rings RR, SS with zeros 0R0_R, 0S0_S and identities 1R1_R, 1S1_S, and a function f:RSf : R \to S with f(x+y)=f(x)+f(y)f(x+y) = f(x)+f(y), f(xy)=f(x)f(y)f(xy) = f(x)f(y) and f(1R)=1Sf(1_R) = 1_S. For claim 5, let TT be a ring and let g:STg : S \to T be a ring homomorphism (Ring homomorphism: additive, multiplicative, and required to send 11 to 11).

[A1]

f(x+y)=f(x)+f(y)f(x+y) = f(x) + f(y) for all x,yRx, y \in R.

[A2]

f(xy)=f(x)f(y)f(xy) = f(x)f(y) for all x,yRx, y \in R.

[A3]

f(1R)=1Sf(1_R) = 1_S.

[A4]

g(y+z)=g(y)+g(z)g(y+z) = g(y) + g(z) for all y,zSy,z\in S (Ring homomorphism: additive, multiplicative, and required to send 11 to 11).

[A5]

g(yz)=g(y)g(z)g(yz) = g(y)g(z) for all y,zSy,z\in S (Ring homomorphism: additive, multiplicative, and required to send 11 to 11).

[L1]

(R,+,0R)(R,+,0_R) and (S,+,0S)(S,+,0_S) are abelian groups, and by [A1] the map ff is a homomorphism of these groups in the sense of Monoid homomorphism and group homomorphism (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides).

[L2]

A group homomorphism hh satisfies h(e)=eh(e) = e', h(g1)=h(g)1h(g^{-1}) = h(g)^{-1} and h(gn)=h(g)nh(g^{n}) = h(g)^{n} for every nZn \in \mathbb{Z}; read additively, h(0)=0h(0) = 0, h(a)=h(a)h(-a) = -h(a) and h(na)=nh(a)h(na) = n\,h(a) (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, Powers gng^{n}: natural exponents in a monoid and integer exponents in a group, with g0=eg^{0} = e).

Proof

technique · direct
1.1

By [L1] the map ff is a homomorphism from the additive group of RR to the additive group of SS, so [L2] applies to it.

A1L1
1.2

Claim 5: for x,yRx, y \in R, (gf)(x+y)=g(f(x)+f(y))=g(f(x))+g(f(y))(g \circ f)(x+y) = g(f(x)+f(y)) = g(f(x)) + g(f(y)) and (gf)(xy)=g(f(x)f(y))=g(f(x))g(f(y))(g\circ f)(xy) = g(f(x)f(y)) = g(f(x))g(f(y)), while (gf)(1R)=g(1S)=1T(g \circ f)(1_R) = g(1_S) = 1_T. The identity map satisfies the three conditions trivially.

A1A2A3A4A5A6
1.3

Claim 3: let uR×u \in R^{\times} with inverse u1u^{-1}, so uu1=1R=u1uu u^{-1} = 1_R = u^{-1}u. Applying ff and using [A2] and [A3], f(u)f(u1)=f(1R)=1S=f(u1)f(u)f(u)f(u^{-1}) = f(1_R) = 1_S = f(u^{-1})f(u). So f(u)f(u) has the two-sided inverse f(u1)f(u^{-1}) in SS, hence f(u)S×f(u) \in S^{\times}, and f(u)1=f(u1)f(u)^{-1} = f(u^{-1}) because inverses in a monoid are unique.

A2A3L4
2.1

Claim 1: [L2] read additively gives f(0R)=0Sf(0_R) = 0_S and f(a)=f(a)f(-a) = -f(a); hence f(ab)=f(a+(b))=f(a)+f(b)=f(a)f(b)f(a-b) = f(a + (-b)) = f(a) + f(-b) = f(a) - f(b).

step 1.1A1L2
2.2

Claim 2: by [L3] the multiple mama is the integer power of aa in (R,+,0R)(R,+,0_R), and mf(a)m f(a) is the integer power of f(a)f(a) in (S,+,0S)(S,+,0_S); so the claim is the third part of [L2] read additively.

step 1.1L2L3
3.1

Claim 4: 1S=f(1R)f(R)1_S = f(1_R) \in f(R) by [A3]; for f(a),f(b)f(R)f(a), f(b) \in f(R) we have f(a)f(b)=f(ab)f(R)f(a) - f(b) = f(a-b) \in f(R) by step 2.1 and f(a)f(b)=f(ab)f(R)f(a)f(b) = f(ab) \in f(R) by [A2]. So f(R)f(R) satisfies the subring criterion.

step 2.1A2A3L5
4.1

Claims 1 to 5 are established in steps 2.1, 2.2, 1.3, 3.1 and 1.2.

step 1.2step 2.1step 2.2step 1.3step 3.1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 57 results over 18 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