Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck 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)=0, f(−a)=−f(a) and f(ma)=mf(a) for m∈Z, carries units to units, and has a subring as its image; composites of ring homomorphisms are ring homomorphisms

Statement

Let R and S be rings (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides) and f:R→S a ring homomorphism (Ring homomorphism: additive, multiplicative, and required to send 1 to 1). Then:

  1. f(0R)=0S and f(−a)=−f(a) for every a∈R; consequently f(a−b)=f(a)−f(b);
  2. f(ma)=m f(a) for every a∈R and every m∈Z, the multiples being those of Integer multiples in a ring: (m+n)a=ma+na, m(a+b)=ma+mb, (ma)b=m(ab)=a(mb) and (ma)(nb)=(mn)(ab) for all m,n∈Z and a,b∈R;
  3. if u∈R× then f(u)∈S× and f(u)−1=f(u−1);
  4. the image f(R)={ f(a):a∈R } is a subring of S (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication);
  5. if g:S→T is a ring homomorphism then so is g∘f:R→T, and the identity map of R is a ring homomorphism.

Facts & Assumptions

Given: Rings R, S with zeros 0R, 0S and identities 1R, 1S, and a function f:R→S with f(x+y)=f(x)+f(y), f(xy)=f(x)f(y) and f(1R)=1S. For claim 5, let T be a ring and let g:S→T be a ring homomorphism (Ring homomorphism: additive, multiplicative, and required to send 1 to 1).

[A1]

f(x+y)=f(x)+f(y) for all x,y∈R.

[A2]

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

[A3]

f(1R)=1S.

[A4]

g(y+z)=g(y)+g(z) for all y,z∈S (Ring homomorphism: additive, multiplicative, and required to send 1 to 1).

[A5]

g(yz)=g(y)g(z) for all y,z∈S (Ring homomorphism: additive, multiplicative, and required to send 1 to 1).

[L1]

(R,+,0R) and (S,+,0S) are abelian groups, and by [A1] the map f 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 h satisfies h(e)=e′, h(g−1)=h(g)−1 and h(gn)=h(g)n for every n∈Z; read additively, h(0)=0, h(−a)=−h(a) and h(na)=n h(a) (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, Powers gn: natural exponents in a monoid and integer exponents in a group, with g0=e).

Proof

technique · direct
1.1

By [L1] the map f is a homomorphism from the additive group of R to the additive group of S, so [L2] applies to it.

A1L1
1.2

Claim 5: for x,y∈R, (g∘f)(x+y)=g(f(x)+f(y))=g(f(x))+g(f(y)) and (g∘f)(xy)=g(f(x)f(y))=g(f(x))g(f(y)), while (g∘f)(1R)=g(1S)=1T. The identity map satisfies the three conditions trivially.

A1A2A3A4A5A6
1.3

Claim 3: let u∈R× with inverse u−1, so uu−1=1R=u−1u. Applying f and using [A2] and [A3], f(u)f(u−1)=f(1R)=1S=f(u−1)f(u). So f(u) has the two-sided inverse f(u−1) in S, hence f(u)∈S×, and f(u)−1=f(u−1) because inverses in a monoid are unique.

A2A3L4
2.1

Claim 1: [L2] read additively gives f(0R)=0S and f(−a)=−f(a); hence 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 ma is the integer power of a in (R,+,0R), and mf(a) is the integer power of f(a) in (S,+,0S); so the claim is the third part of [L2] read additively.

step 1.1L2L3
3.1

Claim 4: 1S=f(1R)∈f(R) by [A3]; for f(a),f(b)∈f(R) we have f(a)−f(b)=f(a−b)∈f(R) by step 2.1 and f(a)f(b)=f(ab)∈f(R) by [A2]. So 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 · two levels

33 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