Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: 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.

The map n↦(n,0) from Z to Z×Z preserves addition and multiplication and does not preserve 1, so the clause f(1)=1 is not redundant

Statement refuted

False claim: if R and S are rings and f:R→S satisfies f(x+y)=f(x)+f(y) and f(xy)=f(x)f(y) for all x,y∈R, then f is a ring homomorphism (Ring homomorphism: additive, multiplicative, and required to send 1 to 1); that is, clause (RH3), f(1R)=1S, is redundant.

The map

f:Z⟶Z×Z,f(n):=(n,0)

refutes it, Z×Z being the product ring (The product ring R×S with componentwise operations, its identity (1R,1S) and its units R××S×). It satisfies both displayed conditions and sends 1 to (1,0), which is not the identity (1,1) of Z×Z.

Facts & Assumptions

Given: The commutative ring Z, the product ring Z×Z with componentwise operations, zero (0,0) and identity (1,1), and the map f(n)=(n,0) (Z is a commutative ring and an ordered ring, the published construction being an instance of the general definitions, The product ring R×S with componentwise operations, its identity (1R,1S) and its units R××S×).

[L2]

Z×Z is a ring whose operations are componentwise, whose zero is (0,0) and whose identity is (1,1); two of its elements are equal exactly when both components agree (The product ring R×S with componentwise operations, its identity (1R,1S) and its units R××S×).

[L4]

1≠0 in Z, since 1=ι(1), 0=ι(0), ι is injective, and 1=σ(0)≠0 in N by Peano axiom (P1) (The naturals embed in the integers, Arithmetic on the integers, The von Neumann naturals form a Peano system).

[L5]

A ring homomorphism must satisfy (RH1) additivity, (RH2) multiplicativity and (RH3) f(1R)=1S; (RH1) alone makes f a homomorphism of the additive groups (Ring homomorphism: additive, multiplicative, and required to send 1 to 1, Monoid homomorphism and group homomorphism).

[L6]

The refuted claim: (RH1) and (RH2) imply (RH3).

Counterexample

technique · direct
1.1

f is additive: f(m+n)=(m+n,0)=(m,0)+(n,0)=f(m)+f(n), the middle equality being componentwise addition with 0+0=0. So f satisfies (RH1) and is a homomorphism of the additive groups.

L1L2L5
1.2

f is multiplicative: f(mn)=(mn,0) and f(m)f(n)=(m,0)(n,0)=(mn,  0⋅0)=(mn,0), using componentwise multiplication and 0⋅0=0. So f satisfies (RH2).

L2L3
1.3

f(1)=(1,0)≠(1,1), since the second components differ: 0≠1 in Z by [L4]. So (RH3) fails for f.

L2L4
2.1

By steps 1.1, 1.2 and 1.3 the map f satisfies (RH1) and (RH2) and fails (RH3), so it is not a ring homomorphism and the claim of [L6] is false: clause (RH3) of Ring homomorphism: additive, multiplicative, and required to send 1 to 1 is not redundant.

step 1.1step 1.2step 1.3L5L6∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

44 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