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.
Pseudo arclength crosses the fold
Example
For , the solution curve is . At its fold , the natural parameter turns around, while an -normal pseudo-arclength step can pass from the negative- branch through the fold to the positive- branch.
Facts & Assumptions
Given: The equation on , the fold point , and for the certified local realization.
A simple fold has a unique local Lyapunov–Schmidt chart and nonzero parameter curvature: for a simple fold, and the solution curve has tangent in the normalized fold parameter.
A transverse pseudo-arclength section has a locally quadratic Newton corrector: at a regular solution point, a transverse augmented section has an invertible bordered derivative and its exact Newton corrections are locally quadratic.
A bounded residual and derivative error give a local root certificate: if the strict contraction inequalities hold for an augmented residual on a closed ball, that ball contains exactly one zero and the theorem gives its center error bound.
Finite-budget pseudo-arclength continuation with a certified local corrector: a finite continuation step is accepted only after its section-root certificate passes; a finite trace claims no global branch completeness.
Verification
At , , , and . With , and , so [F1] gives . The full derivative is , which has rank everywhere, and at the fold its unit kernel tangent is .
Choose and use the seed center , radius , previous orientation , and seed section point , so . At the seed center the residual is zero and the inverse of the bordered Jacobian is , whose operator norm is less than . The Jacobian is -Lipschitz, so the exact-data certificate with , , zero error bounds, and radius has and certifies the seed ball. The ball lies in , where every zero lies on the regular graph and has rank . Parametrize that graph from by arclength . Its positive unit tangent is , so the previous normal has dot product at least throughout . The forward chart length to is at least .
At the seed root, the exact unit tangent oriented toward increasing is . The tangent callback may return with certified error . With the previous normal , the angle tests are and . Set the algorithm's step length to . Then the predictor is . Its section is , with unique zero , where . The forward-offset tests hold because and . The section is transverse throughout the chart. At its selected root, set , , and . The unit vector spans , and , so has inverse norm . Since , [F2] gives a local quadratic Newton corrector; the bordered Jacobian has determinant .
At the predictor, the augmented residual is and its Jacobian is . The Newton equation forces and , so one exact correction reaches the section root .
At the corrected center , where , the inverse bordered Jacobian is . Its operator norm is at most its Frobenius norm . Choose corrected-ball radius . The ball lies in since . With exact data, , zero residual and derivative errors, and Jacobian Lipschitz constant , the certificate has and . It therefore certifies the next section root and, because the whole ball lies in , identifies it with the unique forward branch point. With , residual tolerance , and exact callbacks, steps 2.1 and 3.1 produce this accepted ball in one attempt and one Newton update.
The certified trace therefore starts at and accepts a next section root at , with the fold lying between them on the supplied chart. It is a finite local continuation step through the fold even though ; it asserts nothing about other components.
Depends on
- Finite-budget pseudo-arclength continuation with a certified local corrector
- A transverse pseudo-arclength section has a locally quadratic Newton corrector
- A simple fold has a unique local Lyapunov–Schmidt chart and nonzero parameter curvature
- A bounded residual and derivative error give a local root certificate
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 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.