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 solution whose graph approaches a compact interior region at a finite endpoint extends past that endpoint
Statement
Let solve a Picard-Lindelof ODE and suppose . If there are for which lies in one compact subset of the open ODE domain, then extends to a solution beyond . A solution whose graph has a sequence approaching a compact interior endpoint state extends past that endpoint. The reflected statement holds at a finite left endpoint.
Facts & Assumptions
Given: The solution, finite endpoint, compact set, and sequence in the Statement.
A bounded sequence in , , has a convergent subsequence (For every bounded sequence in has a convergent subsequence).
For an integrable vector-valued function on with , (For and integrable when , ; for , is integrable).
Picard-Lindelöf gives a unique local solution through each point of the open ODE domain (Picard-Lindelöf local existence and uniqueness for first-order systems).
Locally unique solutions agreeing at a common endpoint glue to a solution on the union interval (Locally unique ODE solutions agree on overlaps and glue across a common endpoint).
A subset of Euclidean space is compact if and only if it is closed and bounded (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
Proof
Compactness makes the sequence of graph points bounded, so [L1] in gives a subsequence converging to ; [L5] makes closed, hence and lies in the interior of the ODE domain.
Choose a compact cylinder about inside the ODE domain and let bound the field there; for large , lies within half its state radius and is smaller than the remaining half, so a first-exit argument using [L2] keeps the whole tail in that cylinder and gives ; [L3] starts a solution at and [L4] glues it to past , with immediate.
Depends on
- Picard-Lindelöf local existence and uniqueness for first-order systems
- Locally unique ODE solutions agree on overlaps and glue across a common endpoint
- For $n \ge 1$ every bounded sequence in $\mathbb{R}^n$ has a convergent subsequence
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- For $a \le b$ and $f : [a,b] \to \mathbb{R}^m$ integrable when $a<b$, $\bigl\lVert\int_a^b f\bigr\rVert_2 \le \int_a^b \lVert f\rVert_2$; for $a<b$, $\lVert f\rVert_2$ is integrable
Used by
Dependency tree · two levels
83 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)