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.
A uniformly bounded equicontinuous sequence of -valued curves on a nonempty compact interval has a uniformly convergent subsequence
Statement
Let be a nonempty compact interval and . Say that a sequence of continuous maps is uniformly bounded when one satisfies for all , and equicontinuous when for every there is such that implies for every . Every such sequence has a subsequence that converges uniformly to a continuous map . The construction requires no choice principle.
A uniformly bounded equicontinuous sequence of -valued curves on a nonempty compact interval has a uniformly convergent subsequence.
Facts & Assumptions
Given: The uniformly bounded equicontinuous sequence in the Statement.
The rationals are countably infinite: ( is countably infinite).
Continuous -valued curves on a compact interval are complete in the supremum metric (Continuous -valued curves on a nonempty compact interval form a complete supremum-metric space).
Every closed bounded interval in is compact (Heine-Borel by bisection: every closed bounded interval is compact).
The rationals are dense in (Both and are dense in , and every nonempty open subset of is uncountable).
Every nonempty subset of has a least element (The well-ordering principle).
Euclidean space is complete for ( and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in ).
A total self-map and an initial value determine a unique sequence of iterates (The recursion theorem).
Proof
Fix a time and a strictly increasing index map . Enclose the bounded sequence in the cube . Repeatedly bisect the current cube into its finitely many coordinate subcubes, retain the lexicographically first subcube containing infinitely many remaining terms, and take the least unused index whose value lies in it. The retained cubes are nested and their diameters tend to zero by [L9]; the selected values are therefore Cauchy and converge in by [L7]. Least indices exist by [L6]. This defines a specific strictly increasing extractor whose selected values converge at , without making a choice from an unspecified family.
If , use from step 1.1. Otherwise [L1] and [L5] give an enumeration of the dense set . Apply [L8] to the total update , starting with the identity index map, and write the nested maps as . The diagonal indices are strictly increasing. For each fixed , every sufficiently late lies in the range of , so is a subsequence of the convergent sequence selected at . Thus converges at every enumerated dense time, and the singleton construction has the same conclusion at its sole point.
Given , equicontinuity, [L4], and [L5] give a finite net of the dense times from step 2.1 on which the diagonal subsequence is eventually -close; in the singleton case use its sole point. The triangle inequality then makes the subsequence uniformly Cauchy on all of .
Applying [L3] to the uniformly Cauchy subsequence gives a continuous uniform limit, completing the construction.
Depends on
- $\mathbb{Q}$ is countably infinite
- Both $\mathbb{Q}$ and $\mathbb{R} \setminus \mathbb{Q}$ are dense in $\mathbb{R}$, and every nonempty open subset of $\mathbb{R}$ is uncountable
- Continuous $\mathbb{R}^n$-valued curves on a nonempty compact interval form a complete supremum-metric space
- Heine-Borel by bisection: every closed bounded interval $[a,b]$ is compact
- $\mathbb{R}$ and $\mathbb{R}^n$ for $n \ge 1$ with the Euclidean metric are complete, componentwise from the Cauchy criterion in $\mathbb{R}$
- The recursion theorem
- The well-ordering principle
- For $|r| < 1$ the sequence $r^k$ is null, and for $|r| > 1$ the sequence $|r|^k$ diverges to $+\infty$
Used by
Dependency tree · two levels
81 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
- Gerald Teschl, Ordinary Differential Equations and Dynamical Systems, Ch. 2 (standard reference, not scraped)
- Jiri Lebl, Basic Analysis I, Section 6.3 (standard reference, not scraped)