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 reals form a totally ordered field
Statement
The relation of Order on the reals is well defined and makes (The reals form a field) a totally ordered field.
Facts & Assumptions
Given: Reals with representatives .
A sequence of rational numbers is null if, for every rational , there is such that for every (Null sequence).
Ordered-field arithmetic in : ; sums and products of eventual lower bounds (The rationals form a totally ordered field).
Dichotomy for non-null Cauchy sequences: eventually or eventually (A non-null Cauchy sequence is eventually bounded away from zero, with constant sign).
is a field (The reals form a field).
In , iff a representative is null; so iff every representative is non-null (The real numbers).
Proof
Positivity is independent of the representative: if for and is null, then beyond some also , so : the defining property holds for with .
Trichotomy: if , any representative is non-null, so by the dichotomy either eventually ( positive) or eventually ( positive); the two exclude each other, and exactly one of positive, , positive holds.
Positives are closed under and : from and eventually, and eventually, with .
Consequently is a total order (trichotomy plus transitivity from closure under sums), compatible with addition (translation preserves the difference) and with multiplication by positives: is a totally ordered field.
Depends on
Used by
- ℝ((t⁻¹)) does not have the least-upper-bound property; its canonical naturals have no supremum Corollary
- The Cauchy-sequence reals have the least-upper-bound property Corollary
- The symmetric Lovász Local Lemma under ep(d+1)≤1 Corollary
- Adjoining one root need not split the polynomial: ℚ(³√2) does not split x³-2 Counterexample
- Not every ordered field is Archimedean Counterexample
- The first quadrant of ℝ² contains 0 and is closed under addition and is not a linear subspace, since it is not closed under multiplication by -1 Counterexample
- The unrestricted nested interval property fails in ℝ((t⁻¹)) Counterexample
- Algebraically constructible real numbers as the smallest real subfield closed under positive square roots Definition
- Finite probability spaces, outcome weights, events, and event probabilities Definition
- For n≥1, the determinant over a commutative ring by the Leibniz formula, and |det A| for a real matrix Definition
- Orientation of a finite-dimensional real vector space Definition
- Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p-q of a real symmetric bilinear or quadratic form Definition
- Real edge-weighted graphs, total tree weight and minimum spanning trees Definition
- The formal Laurent series ℝ((t⁻¹)): support bounded below, valuation, leading coefficient Definition
- The uniform probability space on a nonempty finite set Definition
- Variance, standard deviation, and covariance on a finite probability space Definition
- Assuming Choice, real algebraic numbers embed properly in an algebraic closure of ℚ Example
- Assuming the Axiom of Choice, compactness of [0,1] derived from the subbase lemma alone, using only the rays as a subbasis and the least upper bound property Example
- ℚ and ℝ are fields, hence commutative rings, integral domains and ordered rings, all of characteristic 0 Example
- ℚ(√2) carries exactly two distinct field orders, exchanged by the conjugation √2 ↦ -√2 Example
- ℚ(³√2) has three embeddings into ℚ̄ but only one ℚ-automorphism Example
- ℝ ≈ P(ℕ) in ZF, by the Cantor set for one injection and by the cuts {q ∈ ℚ : q < x} for the other; so | ℝ | = 2^ℵ₀ under the Axiom of Choice Example
- ℝ as a vector space over ℚ has a basis, and every such basis is infinite; the existence proof exhibits none Example
- ℝ is a vector space over itself, over the embedded copy of ℚ by restriction of scalars, and over ℚ itself via the embedding Example
- ℝ with the half-open intervals [a,b) as a basis is not compact and, assuming the Axiom of Countable Choice, is Lindel"of, while its square is not Lindel"of, the antidiagonal being an uncountable closed discrete subspace Example
- The polynomial x²+1 is irreducible over ℝ Example
- The rational function field ℝ(t) ordered by the eventual sign is an ordered field, worked out Example
- The real 2-dimensional irreducible representation of C₃ has endomorphism ring ℂ Example
- x³-2 over ℝ and over ℂ Example
- x⁴+1 factors over ℝ into two irreducible quadratics Example
- Normalization, nonnegativity, monotonicity, complements, and differences in a finite probability space Lemma
- ℝ((t⁻¹)) is a commutative ring: the product is a finite sum and both operations preserve support bounded below Lemma
- The Cauchy-sequence reals are Archimedean Lemma
- The rationals embed densely in the reals Lemma
- Valuation and leading coefficient in ℝ((t⁻¹)): v(fg) = v(f) + v(g), and the behaviour of v under sums Lemma
- x²+1 is irreducible over ℝ Lemma
- A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism Theorem
- ℂ=ℝ[x]/(x²+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a-bi)/(a²+b²) Theorem
- Equivalence of the Cauchy and Dedekind constructions of ℝ Theorem
- Every complex number has a square root, by an explicit Cartesian formula Theorem
…and 6 more results.
Cited to discharge well-definedness by Order on the reals.
Dependency tree · two levels
16 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
- T. Tao, Analysis I, 3rd ed., §5.4 (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (standard reference, not scraped)
- L. S. Krapp, Constructions of the real numbers: a set theoretical approach (Oxford, 2014) (standard reference, not scraped)