Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

A two-interval shooting residual has a block-bidiagonal sensitivity Jacobian

Example

For u′=θu on two intervals of length τ>0, define shooting nodes z0,z1,z2 and residuals R0=z0−a, R1=z1−eτθz0, and R2=z2−eτθz1. This uses the exact parameterized ODE flow covered locally by Parameter-dependent ODE flows have the variational tangent on a common tube. On the shooting solution set, take terminal objective J=z2.

Facts & Assumptions

Given: a∈R, τ>0, the two exact-flow intervals, and the finite shooting graph.

[F1]

The parameterized ODE flow has its variational tangent when its uniqueness and common-tube hypotheses hold (Parameter-dependent ODE flows have the variational tangent on a common tube).

[F2]

The reverse recursion computes the exact gradient of a finite state-step objective (The reverse recursion is the exact gradient of a finite state-step objective).

Verification

1.1F3F4

The function u(t)=eθts satisfies u′=θu and u(0)=s. Conversely, for any solution v with this initial value, the product and chain rules give (e−θtv(t))′=0. By [F4] this product is constantly s on its solution interval, and positivity and the reciprocal identity in [F3] imply v(t)=eθts. Thus the displayed solution exists globally and is unique.

2.1F1F3step 1.1

Verify the actual common-tube hypotheses locally at any (s∗,θ∗). Fix ε,δ,η>0 and restrict the parameters to ∣s−s∗∣<ε, ∣θ−θ∗∣<δ. For −η≤t≤τ+η, ∣eθts∣≤B:=(∣s∗∣+ε)exp⁡((∣θ∗∣+δ)(τ+η)). Treat (s,θ) as the flow parameter, with initial map (s,θ)↦s and field (t,u,s,θ)↦θu on R4. The bounded convex open set (−η,τ+η)×(−B−1,B+1)×(s∗−2ε,s∗+2ε)×(θ∗−2δ,θ∗+2δ) has compact closure inside that field's domain and contains all these trajectories for 0≤t≤τ and the restricted parameters. The field and initial map are C1. Step 1.1 supplies existence and uniqueness, so [F1] applies. Each shooting interval uses this same argument with its own initial node; since there are two intervals, a common finite bound may also be taken.

3.1F3F4step 1.1step 2.1algebra

The exact interval map is therefore Φτ(s,θ)=eτθs. Differentiate the residuals with respect to (z0,z1,z2) and θ, writing E=eτθ: DzR=(100−E100−E1),DθR=(0−τEz0−τEz1). The state Jacobian is lower bidiagonal, and the parameter column contains the two local flow sensitivities.

4.1F2F3F4step 3.1algebra∎

Solving R=0 gives z0=a, z1=Ea, and z2=E2a. Direct differentiation yields Dθz2=2τE2a. The discrete adjoint for the two flow steps seeds p2=1, then gives p1=E and p0=E2; its parameter sum is τEz0p1+τEz1p2=2τE2a. Thus the reverse gradient agrees with the differentiated shooting solution.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

45 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