Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

Subring: a subset containing 1R and closed under addition, additive inverses and multiplication

Definition

Let R be a ring (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides) with zero 0R and identity 1R. A subset S⊆R is a subring of R when

  • (T1) 1R∈S;
  • (T2) x,y∈S implies x+y∈S;
  • (T3) x∈S implies −x∈S;
  • (T4) x,y∈S implies xy∈S.

Why S is then a ring, with the same zero and the same identity. From (T1) and (T3), −1R∈S, and from (T2), 0R=1R+(−1R)∈S. So S contains 0R, is closed under addition and closed under additive inverses, which are exactly conditions (S1), (S2) and (S3) of Subgroup for the abelian group (R,+,0R); hence S is a subgroup of (R,+,0R), and Subgroup states that a subgroup with the restricted operation is itself a group, whose identity and whose inverses are those of the ambient group. So (S,+,0R) is an abelian group, commutativity being inherited.

By (T4) multiplication restricts to a binary operation on S (Binary operation on a set; associativity, commutativity, and a subset closed under the operation), and that restriction is associative because it is associative on R. By (T1) the element 1R lies in S and satisfies 1Rx=x=x1R there, so it is a two-sided identity for the restricted multiplication (Left identity, right identity, and two-sided identity for a binary operation); thus (S,⋅,1R) is a monoid. Both distributive laws hold in S because they hold in R and are equations between elements of S.

Therefore (S,+,⋅,0R,1R) is a ring, and

0S=0R,1S=1R,−Sx=−Rx(x∈S).

This last line is not decoration: it is what makes a statement proved in S transportable to R without translation, and it is used when a subfield of an ordered field is shown to inherit the order and when scalars are restricted along a subfield inclusion.

Remarks

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