Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Existence and uniqueness of parallel sections

Statement

Let γ:IM be smooth on an interval, with smooth one-sided data at included endpoints. For every t0I and v0Eγ(t0) there is exactly one parallel section V on all of I with V(t0)=v0. The same holds for a piecewise smooth curve on a compact interval, with continuity at its finitely many corners. A singleton carries its prescribed vector. No AC is required for a supplied connection and curve.

Facts & Assumptions

Given: The supplied connection, curve, initial parameter and initial vector.

[F1]

Parallel sections solve the local homogeneous linear system and are continuous across corners (Parallel section along a curve).

[F2]

Continuous linear matrix ODEs with specified initial matrix have unique solutions on the whole prescribed compact interval (Linear matrix ODEs have unique global solutions on a fixed interval).

Proof

1.1

On a compact curve segment contained in a frame domain, the matrix ω(γ˙) is continuous, so [F2] solves v=ω(γ˙)v for every initial vector. To pass from its matrix statement to vectors when rank r>0, use an initial r by r matrix with first column v0 and all other columns zero, and take its first solution column. Any second vector solution can be inserted as that column with zero other columns, so matrix uniqueness proves vector uniqueness. Rank zero has the unique empty coefficient vector. If the coefficient matrix is smooth, v=Cv inductively makes v smooth, including one-sided derivatives.

F1F2
2.1

For a compact nondegenerate interval [a,b], pull back all frame domains to an open cover of [a,b]. By [F3] choose a mesh smaller than its Lebesgue number and refine to include t0 and all finitely many curve corners. Every closed mesh segment lies in one frame domain. Select frames only for these finitely many segments. Starting at t0, solve successively to the right and left with the preceding endpoint value as initial data. Step 1.1 gives solutions on each entire closed segment. They agree at common endpoints, giving a continuous piecewise smooth section. At an artificial subdivision point where the curve is smooth, local ODE uniqueness on a neighbourhood identifies both pieces with one local smooth solution through that value, so the section is smooth there.

F3step 1.1
3.1

Any two solutions with the same initial value agree successively on every mesh segment by step 1.1. A common refinement therefore proves independence of the mesh and frames. On a general nondegenerate interval, solve on every compact subinterval containing t0; two such solutions agree on their intersection by compact-interval uniqueness. Their unique union is a solution everywhere, since each interior point has a neighbourhood in one such compact interval and each included endpoint has a one-sided neighbourhood. This does not require a selected exhaustion or a countable choice of frames.

step 1.1step 2.1
4.1

On a singleton the only section with value v0 is that vector by convention; an empty interval admits no initial parameter and makes the quantified statement vacuous. Zero initial vector gives the zero solution by uniqueness. Constant curves give constant vectors in their fixed fibre frame. Thus all stated cases, including corner and endpoint initial times, are covered.

F1step 3.1

Depends on

Used by

Dependency tree · two levels

25 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