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.
, , has maximal solution on
Example
, , has maximal solution on . The vector field is nevertheless defined on all of .
Facts & Assumptions
Given: The scalar equation and initial value .
If the positive maximal endpoint is finite, the solution must eventually leave every compact set (At a finite maximal time an ODE solution leaves every compact subset of the domain).
The quotient rule gives wherever is differentiable and nonzero (Sums, scalar multiples, products and quotients: , , , and when ).
Every Picard–Lindelöf IVP has a unique maximal solution, and every other solution through the same data is its restriction (Every Picard–Lindelöf initial value problem has one maximal solution on an open interval).
Verification
Differentiation gives and . On the connected component of a solution's nonzero set containing , [L2] gives , so integration forces . If that component had a finite boundary inside the solution interval, continuity would give there and hence , while the identity gives , a contradiction. Thus the component is the whole solution interval.
On every compact state interval , one has , so the polynomial field satisfies the local state-Lipschitz hypothesis of [L3]. The formula is defined on and tends to as ; no finite value permits continuation through , while the formula continues indefinitely to the left. Thus it is the unique maximal solution from [L3], consistently with the compact-escape conclusion [L1].
Depends on
- Every Picard–Lindelöf initial value problem has one maximal solution on an open interval
- At a finite maximal time an ODE solution leaves every compact subset of the domain
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
Used by
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
- 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)