Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-29
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 fundamental theorem for nonautonomous smooth ODEs

Statement

Let DR×Rn be open and let F:DRn be smooth. For every base point (t0,x0)D there are h>0 and an open neighbourhood W of (t0,x0) such that each initial pair (s,y)W has a unique solution on [sh,s+h], and the resulting local solution map is smooth in the initial time and initial state.

Facts & Assumptions

Given: A smooth nonautonomous field F(t,x) and a base point (t0,x0)D.

[L1]

Autonomous smooth ODEs have unique local smooth flows (The fundamental theorem for autonomous smooth ODEs).

[L2]

Smooth parameter-dependent ODEs have solutions depending smoothly on the parameters (Smooth dependence of ODE solutions on parameters).

Proof

technique · direct
1.1

Introduce an extra variable s and consider the autonomous system below on R×Rn.

L1

s(t)=1,x(t)=F(s(t),x(t)).

Its right-hand side is smooth. By [L1], this augmented autonomous system has a unique local smooth flow.

2.1

The first equation forces s(t)=s0+t when s(0)=s0, so the second equation becomes exactly the original nonautonomous system with initial time s0. Reading the initial value (s0,x0) as a parameter, [L2] makes the resulting solution map smooth in (s0,x0). This is precisely the claimed local theorem for nonautonomous smooth ODEs.

L2step 1.1

Depends on

Used by

Dependency tree · two levels

7 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