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 rationals embed densely in the reals
Statement
The map (The real numbers) is an embedding of ordered fields. Every real is approximated by rationals: for and rational there is with . Consequently, strictly between any two reals lies a rational.
Statement references
Facts & Assumptions
Given: A real and a rational .
The orders of and ; ordered-field arithmetic (The rationals form a totally ordered field, The reals form a totally ordered field).
Field arithmetic in : are positive rationals, and every nonzero rational has a reciprocal with (The rationals form a field).
Cauchy definition (Cauchy sequence of rationals).
Real positivity via eventual rational lower bounds (Order on the reals).
is a field (The reals form a field), and , are the classes of the constant sequences (The real numbers). A multiplicative inverse there is unique: if then .
Proof
Embedding: constant sequences are Cauchy; iff the constant is null iff ; operations match termwise; and gives the constant lower bound , so and order is preserved and reflected.
Fix with for all , and set .
The difference has representative with for ; hence both and have representatives eventually , so both are positive: .
Inverses: let be a nonzero rational. Then by the injectivity of step 1.1, and exists in by [L2]; since the operations match termwise (step 1.1), . Inverses in are unique by [L5], so : the embedding preserves reciprocals.
Density: let ; pick rational and with the representative of eventually ; set and pick with ; then satisfies and , so .
The rationals embed as an ordered subfield — injectively, preserving the order in both directions, the ring operations, and reciprocals — and they approximate every real arbitrarily well and separate any two reals.
Depends on
Used by
- Brownian paths are locally Holder below one half Corollary
- Brownian paths have infinite total variation Corollary
- Conditional cauchy schwarz inequality Corollary
- No function ℝ → ℝ is continuous at every rational and discontinuous at every irrational, because ℚ is not G_δ Corollary
- One-dimensional Brownian motion is recurrent Corollary
- ℚ is F_σ, meager and not G_δ, while the irrationals are G_δ, residual and not F_σ Corollary
- Standard borel spaces have countable generating and measure determining algebras Corollary
- Stolz-Cesaro, 0/0 form: if bₖ is strictly decreasing to 0, aₖ → 0, and the difference quotient converges, then aₖ/bₖ converges to the same value Corollary
- The Brownian zero set is uncountable Corollary
- The Cauchy-sequence reals have the least-upper-bound property Corollary
- The critical Hölder boundary at zero Corollary
- A nonconstant summary can lose an identifiable parameter Counterexample
- A null sequence times an unbounded sequence need not be null: (k+1)⁻¹·(k+1) = 1 Counterexample
- An identifiable model can have persistent ABC summary distortion Counterexample
- An infinite-dimensional Gaussian has no locally finite translation-invariant density reference Counterexample
- An unbounded stopped exponential martingale needs uniform integrability Counterexample
- In ℝ the interiors of ℚ and of its complement are both empty while the interior of their union is everything Counterexample
- Infinite-dimensional Gaussian random-walk reverse flow is singular Counterexample
- On (0,∞) the metrics |x-y| and |1/x - 1/y| share their topology and not their Cauchy sequences Counterexample
- On ℕ with d(m,n) = 1 + 1/(m+n) for m ≠ n the sets {n, n+1, …} are nested, closed, bounded and complete with empty intersection Counterexample
- On the positive integers the metrics |m-n| and |1/m - 1/n| both induce the discrete topology, and only the first is complete Counterexample
- ℚ ∩ [0,1] has measure zero and not content zero, although it is bounded Counterexample
- ℚ ∩ [0,2] is bounded and disconnected, so being an interval of ℚ is not enough Counterexample
- ℚ is dense in ℝ and has measure zero Counterexample
- ℝ is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions Counterexample
- ℝ/ℚ carries the indiscrete topology, although ℝ is metrizable and the quotient has more than one point Counterexample
- Refuted: the agreement set of two continuous maps is closed, with no hypothesis on the codomain. Two continuous maps ℝ → {a,b} into the indiscrete two-point space have agreement set ℚ Counterexample
- The indicator of ℚ has a limit at no point of ℝ Counterexample
- The indicator of ℚ is continuous at no point of ℝ Counterexample
- The irrationals form a residual G_δ set that is not F_σ Counterexample
- The truncated decimal approximations of √2 form a Cauchy sequence of rationals with no rational limit Counterexample
- x ↦ 1/x is continuous on (0,1) and sends the Cauchy sequence (1/(k+2))_k ≥ 0 to an unbounded one Counterexample
- x ↦ x/2 maps (0,1] into itself, is a 1/2-contraction, and has no fixed point Counterexample
- ψ(1/x) has no limit at 0: two sequences tending to 0 give values constantly 0 and constantly 1/2 Counterexample
- Cauchy sequence in a metric space Definition
- Convergence of a sequence in a metric space: xₖ → x iff d(xₖ, x) → 0 in ℝ Definition
- Countably Infinite-Mode CAR C*-Algebra Definition
- Measurable and decomposable operator fields Definition
- Real powers from suprema of rational powers, with the reciprocal convention below base one Definition
- Sequences of reals: bounded, eventually, frequently, tails, subsequences Definition
…and 209 more results.
Dependency tree · two levels
20 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)
- Dense set (Wikipedia) (standard reference, not scraped)