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 , and for , carries units to units, and has a subring as its image; composites of ring homomorphisms are ring homomorphisms
Statement
Let and be rings (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides) and a ring homomorphism (Ring homomorphism: additive, multiplicative, and required to send to ). Then:
- and for every ; consequently ;
- for every and every , the multiples being those of Integer multiples in a ring: , , and for all and ;
- if then and ;
- the image is a subring of (Subring: a subset containing and closed under addition, additive inverses and multiplication);
- if is a ring homomorphism then so is , and the identity map of is a ring homomorphism.
Facts & Assumptions
Given: Rings , with zeros , and identities , , and a function with , and . For claim 5, let be a ring and let be a ring homomorphism (Ring homomorphism: additive, multiplicative, and required to send to ).
for all .
for all .
.
and are abelian groups, and by [A1] the map 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).
A group homomorphism satisfies , and for every ; read additively, , and (A group homomorphism automatically satisfies and , and for every ; for monoid homomorphisms preservation of the identity must be assumed, Powers : natural exponents in a monoid and integer exponents in a group, with ).
The integer multiple in a ring is the integer power of in its additive group, read additively (Integer multiples in a ring: , , and for all and , Powers : natural exponents in a monoid and integer exponents in a group, with ).
A unit of a ring is an invertible element of its multiplicative monoid, its inverse is unique, and a single equation or determines it (Left inverse, right inverse, and invertible element of a monoid, In a monoid, a left inverse and a right inverse of the same element are equal; hence an invertible element has exactly one inverse, and it is two-sided, The units of a ring are the invertible elements of its multiplicative monoid, and is a group under multiplication; only in the zero ring).
Subring criterion: is a subring exactly when and and for all (Subring criterion: is a subring if and only if and and for all ; and an intersection of subrings is a subring, Subring: a subset containing and closed under addition, additive inverses and multiplication).
Proof
By [L1] the map is a homomorphism from the additive group of to the additive group of , so [L2] applies to it.
Claim 5: for , and , while . The identity map satisfies the three conditions trivially.
Claim 3: let with inverse , so . Applying and using [A2] and [A3], . So has the two-sided inverse in , hence , and because inverses in a monoid are unique.
Claim 1: [L2] read additively gives and ; hence .
Claim 2: by [L3] the multiple is the integer power of in , and is the integer power of in ; so the claim is the third part of [L2] read additively.
Claim 4: by [A3]; for we have by step 2.1 and by [A2]. So satisfies the subring criterion.
Claims 1 to 5 are established in steps 2.1, 2.2, 1.3, 3.1 and 1.2.
Remarks
-
Claim 1 is free, claim 3 is not. comes from additivity alone, because the additive structure is a group and cancellation is available there (A group homomorphism automatically satisfies and , and for every ; for monoid homomorphisms preservation of the identity must be assumed). The multiplicative analogue would be , and it is not free: it is axiom (RH3) of Ring homomorphism: additive, multiplicative, and required to send to , and the step proving claim 3 above uses it twice.
-
The image is a subring, not merely a non-unital one, and that too rests on (RH3): without it the image would still be closed under subtraction and multiplication but might miss , and the companion page's map has exactly that image.
-
Claim 2 is a dictionary entry, not new arithmetic. The multiples on both sides are the additive powers of Powers : natural exponents in a monoid and integer exponents in a group, with , so the statement is the power law of A group homomorphism automatically satisfies and , and for every ; for monoid homomorphisms preservation of the identity must be assumed with additive notation; nothing is proved twice.
Depends on
Ring homomorphism: additive, multiplicative, and required to send to
Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides
Monoid homomorphism and group homomorphism
A group homomorphism automatically satisfies and , and for every ; for monoid homomorphisms preservation of the identity must be assumed
Subring: a subset containing and closed under addition, additive inverses and multiplication
Subring criterion: is a subring if and only if and and for all ; and an intersection of subrings is a subring
Left inverse, right inverse, and invertible element of a monoid
In a monoid, a left inverse and a right inverse of the same element are equal; hence an invertible element has exactly one inverse, and it is two-sided
The units of a ring are the invertible elements of its multiplicative monoid, and is a group under multiplication; only in the zero ring
Integer multiples in a ring: , , and for all and
Powers : natural exponents in a monoid and integer exponents in a group, with