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.
Two independent proofs that is Cauchy complete, and why the library records both
This library now contains two proofs of the same sentence, that every Cauchy sequence of reals converges, and they have almost nothing in common. This remark says what each one actually establishes, why neither makes the other redundant, and which further statements about completeness are not proved here.
Route 1: from the construction. The reals are complete lives on the Cauchy-construction page. There is built as equivalence classes of Cauchy sequences of rationals, and completeness is proved by a diagonal argument on representatives: given a Cauchy sequence of reals, one picks a rational close to each term and shows the resulting rational sequence is Cauchy, so it is a real, and it is the limit. That argument is about the objects the construction produced, and every step of it mentions representatives.
Route 2: from the axioms. The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges, proved on this page, uses only that is a complete ordered field (Complete ordered field (least-upper-bound property)). It goes through boundedness of Cauchy sequences, Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence, and the upgrade of a convergent subsequence to a convergent sequence. Nothing in it refers to a construction, and it therefore proves the statement for every complete ordered field, however that field was obtained: by Dedekind cuts, by Cauchy sequences, or by fiat as an axiom system.
Why both are kept. The two are not the same theorem with two proofs; they are two theorems that happen to have the same words. Route 1 is a fact about the object this library built. Route 2 is a fact about the axioms, and it is the one that transfers. A reader who takes axiomatically, as most courses do, has no access to Route 1 at all, and a reader following the construction gets Route 1 several pages before the machinery of Route 2 exists. Keeping only one would either strand a reader or hide the fact that the axioms alone suffice.
The uniqueness of the complete ordered field up to isomorphism means the two statements are about the same field, so no inconsistency is possible between them; but uniqueness is itself a theorem, and it does not turn one proof into the other.
Which implication is being proved, and which is not. Everything above proves
The converse is false as stated: Cauchy completeness alone does not imply the least-upper-bound property, and the standard counterexamples are non-Archimedean ordered fields that are Cauchy complete and not Dedekind complete. What is true is that Cauchy completeness together with the Archimedean property implies the least-upper-bound property. That implication is not available at this point in the reading order. It belongs to the page on the equivalent forms of completeness, which comes later in this library, and no item here may be cited for it.
The same holds for the nested interval property. A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to is proved here from the least-upper-bound property. The converse route, that nested intervals together with the Archimedean property give back the least-upper-bound property, is again a genuine theorem and again is not proved here. The reason for the recurring Archimedean hypothesis is worth stating plainly: monotone convergence, nested intervals and Cauchy completeness are all statements about sequences, and a non-Archimedean field has elements that no sequence of naturals can reach, so sequential statements cannot see them. The least-upper-bound property can.
What this page does establish about the relationships. Reading the items in order, the least-upper-bound property gives monotone convergence (A nondecreasing sequence bounded above converges to the supremum of its range, and a nonincreasing sequence bounded below to the infimum), which gives both the nested interval property and, through the peak lemma, Bolzano-Weierstrass (Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence), which gives the Cauchy criterion (The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges). That is a chain of implications from one axiom, not an equivalence, and every arrow in it is proved here.
Depends on
- The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges
- The reals are complete
- Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence
- A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to $0$
- Complete ordered field (least-upper-bound property)
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 74 results over 24 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
- Completeness of the real numbers (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 and Ch. 3 (standard reference, not scraped)
- T. Tao, Analysis I, 3rd ed., §5.4 and §6.4 (standard reference, not scraped)
- J. Lebl, Basic Analysis I, §1.1 and §2.4 (standard reference, not scraped)