Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 center of a ring

Definition

Let A be a ring. An element z∈A is central when za=az for every a∈A. The center of A is Z(A)={z∈A:za=az for every a∈A}. It is a subring of A containing the identity, and it is commutative; consequently A is commutative if and only if Z(A)=A. An element of Z(A) is called a central element of A. No choice is used.

Facts & Assumptions

Given: A ring A (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides) with zero 0, identity 1, and center Z(A)={z∈A:za=az for every a∈A}.

[F1]

A is an abelian group under addition with identity 0 in which every element has an additive inverse, a monoid under multiplication with identity 1, and multiplication distributes over addition on both sides (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides).

[F2]

A subset S⊆A is a subring of A exactly when 1∈S and S is closed under addition, additive inverses, and multiplication (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication).

[F3]

The ring A is commutative exactly when xy=yx for all x,y∈A (Commutative ring).

Verification

technique · direct
1.1F1givenalgebra

Zero and one are central: for every a∈A distributivity gives a⋅0=a⋅(0+0)=a⋅0+a⋅0, and cancelling a⋅0 in the additive group yields a⋅0=0, while 0⋅a=(0+0)⋅a=0⋅a+0⋅a similarly yields 0⋅a=0; hence 0⋅a=0=a⋅0 and 0∈Z(A). Likewise 1⋅a=a=a⋅1 for every a by the identity law, so 1∈Z(A).

1.2F1givenalgebra

The center is closed under addition: if z,z′∈Z(A) and a∈A, then (z+z′)⋅a=z⋅a+z′⋅a=a⋅z+a⋅z′=a⋅(z+z′) by the two distributive laws, so z+z′∈Z(A).

1.3F1givenalgebra

The center is closed under multiplication: if z,z′∈Z(A) and a∈A, then (zz′)⋅a=z⋅(z′⋅a)=z⋅(a⋅z′)=(z⋅a)⋅z′=(a⋅z)⋅z′=a⋅(z⋅z′), using associativity of multiplication together with the centrality of z and then of z′; hence zz′∈Z(A).

1.4givenalgebra

The center is commutative: for z,z′∈Z(A), centrality of z evaluated at a=z′ gives zz′=z′z, so multiplication in Z(A) is commutative.

1.5F3givenalgebra

The equivalence A commutative ⇔ Z(A)=A holds: if A is commutative then za=az for all z,a∈A by [F3], so every element of A is central and Z(A)=A; conversely if Z(A)=A, then for arbitrary x,y∈A the element x lies in Z(A) and hence xy=yx, so A is commutative by [F3].

2.1F1step 1.1givenalgebra

The center is closed under additive inverses: if z∈Z(A) and a∈A, then (−z)⋅a+z⋅a=(−z+z)⋅a=0⋅a=0 by step 1.1, so (−z)⋅a is the additive inverse of z⋅a and therefore equals −(z⋅a) by uniqueness of additive inverses in (A,+,0); symmetrically a⋅(−z)=−(a⋅z). Since z is central, −(z⋅a)=−(a⋅z), so (−z)⋅a=a⋅(−z) and −z∈Z(A).

3.1F2step 1.1step 1.2step 2.1step 1.3

By steps 1.1, 1.2, 2.1 and 1.3 the subset Z(A) contains 1 and is closed under addition, additive inverses and multiplication, so it is a subring of A by [F2]; in particular it is a ring in its own right, with the addition, multiplication, zero and identity inherited from A.

4.1step 1.1step 1.2step 1.3step 2.1step 3.1step 1.4step 1.5∎

Steps 1.1-1.3 and 2.1 supply the closure conditions of the center with its identity, step 3.1 assembles them into the statement that Z(A) is a subring of A, step 1.4 shows that this subring is commutative, and step 1.5 gives the asserted equivalence between commutativity of A and Z(A)=A; every element considered lies in A and no choice principle is used.

Depends on

Used by

Dependency tree · two levels

11 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