Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Forward Euler creates an observation-map error

Example

For each parameter θ∈R, solve z˙θ(t)=θt,zθ(0)=0(0≤t≤1), and observe zθ(1). The exact observation map is A(θ)=θ/2. Apply one explicit forward-Euler step of size h=1, z1=z0+hθt0with (t0,z0)=(0,0); the resulting discretized observation map is Ah(θ)=0. In the computed inversion error budget with X=Y=R, datum b=0, truth θ=1, zero observation error, and λ=1, the pre-inversion discrepancy is dh=1/2.

Facts & Assumptions

Given: θ∈R, the scalar ODE and initial value in the example, one forward-Euler step with h=1, datum b=0, and the computed-inversion error-budget interface.

[F3]

The reals are complete: every Cauchy sequence in R converges in R.

[F4]

Hilbert space: a complete real inner-product space with its induced norm is a real Hilbert space.

[F5]

A bounded linear operator between normed spaces: a linear map is bounded if some K≥0 satisfies ∥Tx∥≤K∥x∥ for every x.

[F6]

Bounded finite rank operators are compact: a bounded linear operator whose range has a finite basis is compact.

[F7]

Error budget for computed Tikhonov inversion: for the stated compact A, bounded finite-dimensional-range Ah, supplied adjoints, positive λ, and bijective shifted normal operators, the pre-inversion discrepancy is dh=(A−Ah)x†.

Verification

1.1givenF1F8algebra

The function zθ(t)=θt2/2 has zθ(0)=0 and, by [F1], derivative z˙θ(t)=θt. Any other solution is continuous on [0,1] and has the same derivative on (0,1), so [F8] makes its difference from zθ constant; the common initial value makes this constant zero. Thus the solution is unique and gives the exact endpoint map A(θ)=zθ(1)=θ/2. At θ=1 the exact observation is 1/2.

1.2givenF2F3F4F5F6F7algebra

The stated datum b=0 belongs to Y=R. By [F2]–[F4], X=Y=R with the standard inner product is a real Hilbert space. The maps A(θ)=θ/2 and Ah(θ)=0 are linear and bounded by [F5], with bounds 1/2 and 0; their ranges have bases (1) and the empty basis, respectively. Hence A is compact by [F6], and Ah has finite-dimensional range. The adjoints are multiplication by 1/2 and 0, since ⟨Aθ,y⟩=θy/2=⟨θ,y/2⟩ and ⟨Ahθ,y⟩=0. For λ=1, the shifted normal operators are multiplication by 5/4 and 1, so both are bijective. All hypotheses of [F7] are satisfied.

2.1givenstep 1.1algebra

The stated forward-Euler formula at (t0,z0)=(0,0) gives z1=0+1⋅θ⋅0=0, so Ah(θ)=0 and Ah(1)=0. Thus the two endpoint maps differ even though the observation perturbation is zero.

3.1givenF7step 1.1step 2.1algebra∎

Set x†=1, e=0, δ=0, and λ=1. Then [F7] gives dh=(A−Ah)x†=1/2−0=1/2. This is a nonzero discretization contribution with no observation noise.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

60 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.