Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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 finite local trace misses a disconnected solution branch

Example

The smooth equation F(x,λ)=x2−1=0 has two disconnected solution components. A valid finite pseudo-arclength trace on one component cannot certify that the other component has been found.

Facts & Assumptions

Given: F:R2→R, F(x,λ)=x2−1.

[F1]

Finite-budget pseudo-arclength continuation with a certified local corrector: accepted section balls certify only local roots; a finite-trace status makes no global branch-completeness claim.

[F2]

A bounded residual and derivative error give a local root certificate: an exact zero with an invertible Jacobian and a sufficiently small ball satisfies the strict contraction certificate with zero residual error.

Verification

technique · direct
1.1givenalgebra

The equation factors as (x−1)(x+1)=0, so its complete solution set is S=({1}×R)∪({−1}×R). Each set is connected and open-and-closed relative to S, and the two sets are disjoint; therefore they are the two connected components of S.

1.2F1F2givenchoosealgebra

Choose h>0 and 0<R0<min⁡{h/2,1/4}. The seed section is G−1(x,λ)=(x2−1,λ) with center (1,0) and radius R0. Its residual is zero, its Jacobian inverse there is diag⁡(1/2,1) with norm 1, and its Jacobian is 2-Lipschitz. Thus the exact-data certificate has q=2R0<1 and zero residual term, and certifies the seed ball by [F2]. In V={(x,λ):∣x−1∣<1, −h<λ<2h} every zero lies on c(s)=(1,s) for s∈[−h,2h]. Rank is one there.

1.3givenalgebra

At (1,0), DF=[2 0] has rank 1 and unit tangent t=(0,1). Choose previous orientation and candidate tangent τ=t^=t=(0,1). The chart has a=κ=1, rch+=2h, and h>R0, h+R0<2h, so the previous-normal offset and chart tests in [F1] pass. The augmented equation is (x2−1,λ−h)=0, whose unique root in any ball of radius less than 1 centered at (1,h) is (1,h). Its bordered derivative is [2001], so the local corrector is nonsingular.

2.1F2step 1.3givenchoosealgebra

At the exact center (1,h) the augmented residual is zero and the Jacobian is invertible. The augmented Jacobian is 2-Lipschitz; with exact data, choose 0<R<min⁡{1/4,h/4}, so the whole corrected ball lies in V, set β^=1, and use zero residual and derivative errors. Then q=2R<1 and βρ=0, so [F2] certifies the unique local section root. With Nreq=Ns=1 and Nc=0, the exact predictor already solves this section and both the seed and next ball are certified. The ball of radius R<1 also excludes the other root (−1,h).

3.1F1step 1.1step 1.3step 2.1given∎

The other component {−1}×R contains no point of that local chart around (1,0), and the accepted one-step trace contains no point with x=−1. Nevertheless both components satisfy F=0. By [F1], the finite trace correctly certifies its local step but cannot certify that the second component is absent or that all branches have been found.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

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