Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generated
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.

Breakdown versus trapping: the blow-up of x′=x2 and the global trapped solution of x′=−x2

Example

Let D:=R×R. For z∈R define G+(z):=z2 and G−(z):=−z2, and define the autonomous vector fields F±:D→R by F±(t,z):=G±(z). Their continuity and local Lipschitz property in the state variable are verified below.

(i) Finite-time breakdown despite a pointwise-finite vector field. The function x+:[0,1)→R, x+(t):=11−t, solves x′(t)=F+(t,x+(t)) with x(0)=1 on [0,1), and no solution of this initial value problem extends past b=1. For every compact K⊆D and every η>0 there is t∈(1−η,1) with (t,x+(t))∉K: the graph leaves every compact subset of D as t↑1. The compact-containment hypothesis of Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it fails here, and its escape consequence A non-extendable solution leaves every compact subset of the domain near its finite endpoint; an autonomous solution trapped in a compact subset of its state domain cannot break down there is witnessed explicitly.

(ii) Trapping forces continuation. The function x−:[0,∞)→R, x−(t):=11+t, solves x′(t)=F−(t,x−(t)) with x(0)=1, and its values lie in the compact set K0:=[0,1]⊆R. For each finite b>0, its restriction to [0,b) is trapped in K0, so clause 2 of A non-extendable solution leaves every compact subset of the domain near its finite endpoint; an autonomous solution trapped in a compact subset of its state domain cannot break down there extends it past b; thus no finite right endpoint is nonextendable, and the displayed formula supplies a global extension on [0,∞).

Both fields are the same polynomial expression up to sign, so (i) and (ii) exhibit the continuation criterion of Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it as a statement about compact trapping, not about pointwise finiteness of the vector field.

Facts & Assumptions

Given: D=R×R, the state maps G±(z)=±z2, the vector fields F±(t,z)=G±(z), and the two initial value problems x′=F±(t,x), x(0)=1 in the sense of First-order systems, initial value problems, and solutions on intervals.

[L3]

Mean value inequality: if g:[a,b]→R is continuous and differentiable on (a,b) with ∣g′∣≤L on (a,b), then ∣g(b)−g(a)∣≤L(b−a) (The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a)).

Verification

technique · direct
1.1givenL1algebra

The quotient rule [L1] gives x+′(t)=(1−t)−2=x+(t)2=F+(t,x+(t)) on [0,1) and x+(0)=1, and x−′(t)=−(1+t)−2=−x−(t)2=F−(t,x−(t)) on [0,∞) and x−(0)=1.

1.2givenL1L3

Local Lipschitz continuity of F±: by [L1], G± are differentiable and continuous, with G±′(z)=±2z; consequently F± are continuous, since (t,z)→(t0,z0) implies z→z0 and F±(t,z)=G±(z). Here a compact time-state cylinder means C=T×[a,b], where T⊆R is a compact interval and a≤b; this includes the one-dimensional closed-ball cylinders used in [L2] of Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it. Put S:=[a,b]. Set R:=max⁡{∣a∣,∣b∣}, so ∣G±′(z)∣≤2R on S. For (t,z),(t,w)∈C with the same time and z≠w, the mean value inequality [L3] on the interval between z and w gives ∣F±(t,z)−F±(t,w)∣=∣G±(z)−G±(w)∣≤2R∣z−w∣, since that interval lies in S; for z=w the inequality is immediate. If C is empty it holds with L=0. This verifies the local Lipschitz condition of Local Lipschitz continuity in the state variable, locally uniform in time and parameters on every such cylinder.

2.1step 1.1step 1.2givenL1L2

Non-extendability in (i): suppose a solution x~ of the IVP x′(t)=F+(t,x(t)), x(0)=1 existed on [0,1+ε) for some ε>0. Both x~ and x+ solve the same IVP on the common interval [0,1) containing 0, and F+ is continuous and locally Lipschitz in the state variable by step 1.2. The uniqueness clause of Picard-Lindelöf (Picard-Lindelöf local existence and uniqueness for first-order systems) gives x~=x+ on [0,1), so x~(t)=1/(1−t)→+∞ as t↑1. But x~ is continuous [L1] on the compact interval [0,1], so [L2] bounds ∣x~∣ there, a contradiction. Hence no extension past b=1 exists.

3.1step 2.1givenL2algebra

Escape in (i): let K⊆D be compact and η>0. Put η0:=min⁡{η,1/2}>0, so (1−η0,1)⊆(1−η,1) and all times in the smaller interval lie in [0,1). By [L2], K is bounded, so there is R>0 with ∣z∣≤R for every (t,z)∈K. Choose t∈(1−η0,1) with 11−t>R, which is possible since 11−t→+∞; then x+(t)>R, so (t,x+(t))∉K. This is the escape asserted by A non-extendable solution leaves every compact subset of the domain near its finite endpoint; an autonomous solution trapped in a compact subset of its state domain cannot break down there for this solution.

4.1step 1.1step 1.2givenL2algebra∎

Trapping in (ii): K0=[0,1]⊆R=R1 is closed and bounded, hence compact by [L2], and 0<x−(t)≤1 for every t≥0, so x−(t)∈K0 throughout its domain. For any finite b>0, its restriction to [0,b) is a solution trapped in K0 near b; clause 2 of A non-extendable solution leaves every compact subset of the domain near its finite endpoint; an autonomous solution trapped in a compact subset of its state domain cannot break down there therefore extends that restriction past b. Thus no finite right endpoint can be a nonextendable endpoint for this solution, and the displayed formula gives its global extension.

Depends on

Dependency tree · 2 levels

Sources