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.
Finite-budget phase-fixed periodic-orbit correction and validation
Definition
For a state dimension , the vector-field input is a map in fixed-parameter mode or a one-parameter family with scalar parameter in section mode, where and are open. Also supply an affine phase with nonzero rational covector and rational reference point, a compact convex validation tube, and the sound range provider of Exact range-oracle contract for validated flow and monodromy enclosures. Supply positive finite step counts for each requested validated jet run, finite arithmetic and candidate-update budgets, a rational initial candidate, a dyadic point preconditioner , a rational inverse witness , a positive rational minimum box width , and a finite Krawczyk box budget. In fixed-parameter mode the rational candidate box is with the parameter held fixed, so both the variable and residual have dimension . In section mode require exactly one scalar continuation parameter (the case of Certified residual, Jacobian, trajectory, and monodromy enclosures for periodic shooting), take with rational , and set . Then has dimension , the affine section adds one scalar equation, and both and have dimension . Independent validation retains every admitted rational endpoint of and uses the exact affine dyadic unit-box chart below; non-dyadic physical endpoints are not a failure condition. Supply an open convex shooting domain containing on which the exact flow exists through every admitted positive period, so is there. All rational point, endpoint, interval and matrix operations below are exact or return an explicit arithmetic-failure status within the supplied cap.
Write in fixed-parameter mode. In section mode, used for continuation, require one scalar continuation parameter and write and , where is the parameterized map in Certified residual, Jacobian, trajectory, and monodromy enclosures for periodic shooting, is a supplied unit normal, and is a supplied predictor. Supply certified rational enclosures for the coefficients and constant term of this affine row at every requested accuracy; if they are rational use their exact values, and otherwise use outward interval arithmetic. If a finite row enclosure cannot be obtained within the arithmetic cap, return inconclusive. For the one-parameter field use the static-parameter augmentation in that definition and supply its sound augmented range provider and tube. For every section-mode jet query, first reorder its input to . Reorder the returned Jacobian columns from to , leaving its residual rows unchanged. Then append a sound outward enclosure of the affine section row to every residual and Jacobian enclosure (the exact row when its data are rational). Apply this rule both to candidate updates and to every independent-validation callback. In fixed-parameter mode, and both have dimension ; in section mode, and both have dimension .
The procedure retains the following candidate modes; candidate generation alone never validates a root.
- Enclosure-guided single shooting: this mode needs only the supplied range provider, not a pointwise differentiable numerical IVP evaluator. Start at the supplied rational . At each of at most the supplied number of updates, run the validated shooting-jet procedure of Certified residual, Jacobian, trajectory, and monodromy enclosures for periodic shooting on the singleton , using its validated Euler method and the supplied finite caps. If a tube, range, domain or arithmetic check fails, return its inconclusive status and the last candidate. Otherwise let and be the coordinatewise rational midpoints of the returned boxes for and . Record as a candidate and attempt the independent validation below. If it does not validate and updates remain, call Newton correction for a square vector residual on . A singular matrix returns singular-jacobian; otherwise its rational correction proposes . Reject a proposal outside with invalid-trial. The midpoint matrix is only a proposal matrix: it is not claimed to be the exact derivative of a numerical residual map. Exhaustion returns the last candidate and candidate-budget-exhausted.
- Differentiable single shooting: supply, as an additional input for this mode, a certified differentiable evaluator satisfying Certified differentiable IVP approximation interface for shooting for the augmented BVP, including its approximate trajectories, endpoint map, exact numerical-map derivative, and uniform trajectory-error bound. Run Finite-budget single shooting for a nonlinear two-point BVP on the phase-bordered BVP. In section mode augment the state by the constant parameter and append the affine section condition to its boundary residual. An interval jet alone is not this additional evaluator; if it is absent, return evaluator-unavailable without making the call.
- Discretized candidate: either run Finite-budget multiple shooting for a nonlinear two-point BVP on the augmented segment BVP with separately supplied certified differentiable segment evaluators satisfying the same interface, or run Finite-budget implicit-midpoint collocation for a nonlinear BVP using the pointwise field/boundary values and their exact derivatives required by its residual. Use the residuals of Multiple-shooting and midpoint-collocation residuals for a phase-fixed periodic orbit; in section mode include the constant parameter and affine section row. Missing pointwise/segment evaluation data returns evaluator-unavailable. Use the last finite tuple's first physical state and positive period (and parameter in section mode) as a shooting candidate. Reject a candidate outside or a nonrational candidate without a supplied rational proposal; rationalization is only a new candidate, not a trajectory or residual certificate.
All modes propagate evaluator-failure, invalid-endpoint-pair, invalid-trial, singular-jacobian, inconclusive and exhausted-budget statuses. No candidate mode is assumed to succeed from arbitrary data. In particular, the first mode composes the available interval-enclosure provider directly; it does not infer a point evaluator from interval boxes.
Independent validation: retain the exact rational candidate box in the declared physical variable order, where or . If any side is degenerate, return inconclusive for validation, retaining the candidate: a box with empty ambient interior cannot pass the strict-interior inclusion required for a unique-root return. Degenerate boxes remain admitted inputs, and candidate-generation queries may still use their rational singleton or lower-dimensional boxes. Otherwise put , , and . Use the supplied open convex shooting domain containing , where the exact residual is ; failure to certify that domain returns inconclusive. The chart has an open convex preimage domain, and , by Rational boxes admit dyadic enclosure boundaries and exact affine root charts. Run Finite-budget multidimensional Krawczyk root certification on and the finite dyadic box , using the supplied dyadic , rational , box budget and normalized minimum width . Here is used as a preconditioner for this normalized residual; no approximate-inverse quality was assumed of it. The witness check remains the exact check . A normalized terminal box of maximum width at most has physical image of maximum width at most ; the budget still bounds all processed boxes. For every processed dyadic subbox , let be its dyadic midpoint and set and , the exact rational physical midpoint. The residual callback runs the validated shooting jet on and appends the section-row enclosure when present. The Jacobian callback runs it on the rational box , appends the physical affine section row when present, and multiplies column of this physical Jacobian enclosure by . Exact rational endpoint operations followed by outward dyadic hull conversion give finite dyadic enclosures and . A failed conversion or overflow marks unresolved; it is never supplied as a finite interval. This uses the actual midpoint of the current normalized box, whose image is the actual midpoint of , even when it differs from the candidate center. A failed query or tube inclusion marks that box unresolved. Normalized Krawczyk interval operations are outward under Finite real interval operations enclose their exact values. Retain the complete normalized Krawczyk output partition, including every terminal box and its status, and its exact physical image partition under . Status labels on physical images mean the corresponding root conclusions transferred by the affine bijection, not a Krawczyk computation with an unscaled physical Jacobian. Continue only if the overall Krawczyk status is complete, exactly one normalized terminal box has status unique-root, and every other terminal box has status root-free; if there is no such unique box, more than one, or any existence-only/unresolved box, return inconclusive. Set . Let and be the physical-state and period projections of this rational unique-root image box, and include in section mode. Form in section mode, or in fixed-parameter mode. Check is contained in the supplied augmented tube and query the same sound range provider for its augmented field enclosure. Divide the first coordinates by the positive interval with exact rational endpoint arithmetic to obtain an interval box containing (or in fixed-parameter mode). Require at least one component interval to exclude zero; if inclusion, query or division fails, or no component excludes zero, return inconclusive. Finally require a successful full-box jet run on to enclose the entire trajectory and monodromy; a failed query or tube check returns inconclusive.
Return validated-root only for such a box , and report it as the output box together with the complete terminal partition, the affine chart , unique normalized box , the actual physical midpoint residual enclosure, physical Jacobian enclosure, normalized Jacobian enclosure, inverse witness, normalized strict inclusion and contraction inequalities, field component excluding zero, trajectory tube and monodromy enclosure. The bijection and complete mapped partition prove that contains the only zero in the original rational box . If subdivision was used the output box is , not the original larger . Otherwise return inconclusive or the precise finite candidate failure status. Candidate midpoints and correction residuals never replace the independently validated callback enclosures.
Depends on
- Rational boxes admit dyadic enclosure boundaries and exact affine root charts
- Newton correction for a square vector residual
- Certified differentiable IVP approximation interface for shooting
- The phase-bordered periodic-orbit BVP residual
- Multiple-shooting and midpoint-collocation residuals for a phase-fixed periodic orbit
- Certified residual, Jacobian, trajectory, and monodromy enclosures for periodic shooting
- Finite-budget single shooting for a nonlinear two-point BVP
- Finite-budget multiple shooting for a nonlinear two-point BVP
- Finite-budget implicit-midpoint collocation for a nonlinear BVP
- Finite-budget Newton for a square vector residual
- Finite-budget multidimensional Krawczyk root certification
- Real boxes and interval Jacobian enclosures
- Exact range-oracle contract for validated flow and monodromy enclosures
- Finite real interval operations enclose their exact values
Used by
- Finite pseudo-arclength continuation of phase-fixed periodic orbits Algorithm
- Conditional van der Pol stability from a validated enclosure Example
- A Krawczyk inclusion certifies a unique phase-fixed nonconstant periodic orbit Theorem
- Strict Floquet cluster enclosures certify orbital asymptotic stability Theorem
Dependency tree · two levels
40 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
- E. J. Doedel and B. E. Oldeman, AUTO-07P full manual (2021) (standard reference, not scraped)
- R. B. Kearfott, Interval Computations: Introduction, Uses, and Resources, Euromath Bulletin 2(1) (1996) (standard reference, not scraped)