Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge 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 1R1_R and closed under addition, additive inverses and multiplication

Definition

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

  • (T1) 1RS1_R \in S;
  • (T2) x,ySx, y \in S implies x+ySx + y \in S;
  • (T3) xSx \in S implies xS-x \in S;
  • (T4) x,ySx, y \in S implies xySxy \in S.

Why SS is then a ring, with the same zero and the same identity. From (T1) and (T3), 1RS-1_R \in S, and from (T2), 0R=1R+(1R)S0_R = 1_R + (-1_R) \in S. So SS contains 0R0_R, 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)(R,+,0_R); hence SS is a subgroup of (R,+,0R)(R,+,0_R), 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)(S,+,0_R) is an abelian group, commutativity being inherited.

By (T4) multiplication restricts to a binary operation on SS (Binary operation on a set; associativity, commutativity, and a subset closed under the operation), and that restriction is associative because it is associative on RR. By (T1) the element 1R1_R lies in SS and satisfies 1Rx=x=x1R1_R x = x = x 1_R 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)(S,\cdot,1_R) is a monoid. Both distributive laws hold in SS because they hold in RR and are equations between elements of SS.

Therefore (S,+,,0R,1R)(S, +, \cdot, 0_R, 1_R) is a ring, and

0S=0R,1S=1R,Sx=Rx(xS).0_S = 0_R, \qquad 1_S = 1_R, \qquad -_S x = -_R x \quad (x \in S).

This last line is not decoration: it is what makes a statement proved in SS transportable to RR 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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 19 results over 15 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources