Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 stiff penalty equation defeats a fixed explicit step

Example

Let the nonempty closed convex set C=[0,∞) and f=−1 in the projected dynamics of Projected contact dynamics and explicit projection Euler step, starting at x0=0. Compare this constrained motion with the penalty equation yκ′=−1+κ(−yκ)+,yκ(0)=0, where κ>0 and s+=max⁡(s,0). The explicit Euler penalty method uses a fixed step h>0 and horizon 2h.

Facts & Assumptions

Given: The scalar constrained and penalty models in the Example.

[F1]

Projected contact dynamics and explicit projection Euler step: f−x˙∈NC(x), with NC outward.

[F4]

Verification

1.1F1F2F3F4givenalgebra

For C=[0,∞), NC(0)=(−∞,0] because ⟨n,z⟩=nz≤0 for every z≥0. Thus x(t)=0 solves the projected inclusion: f−x˙=−1∈NC(0). For yκ(t)=−(1−e−κt)/κ, [F2] gives yκ′=−e−κt=−1−κyκ; [F3]–[F4] give 0<e−κt<1 for t>0, so yκ(t)<0 and the penalty equation holds. Also 0≤1−e−κt≤1, so sup⁡0≤t≤2h∣yκ(t)∣≤1/κ and the exact penalty paths converge uniformly to the constrained path as κ→∞.

2.1step 1.1givenalgebra∎

Explicit Euler gives y1=−h, since the penalty is zero at y0=0. At y1=−h, the next value is y2=−h+h(−1+κh)=κh2−2h. For fixed h>0, y2→+∞ as κ→∞, despite the continuous penalty solutions converging uniformly to zero. Therefore the timestep must be controlled as stiffness grows; this example makes no general penalty-to-rigid-impact limit claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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