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.
Periodic orbit shooting collocation and Floquet error — Examples
1 · Prerequisites
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Chain Complexes and Homology
- Chain Homotopy and the Homotopy Category
- Codimension One Foliations, Secondary Classes and Characteristic Disk Foundations
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Power Series and Analytic Functions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cw Complexes and Cellular Homology
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Equivalent Forms of Completeness
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Exactness and the Member Calculus
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Further Trigonometric Identities and Inverse Functions
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Homology Axioms Degree and Classical Applications
- Homotopy and Homotopy Equivalence
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Interval newton krawczyk and polynomial root isolation
- Isolated Singularities and Laurent Series
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Local bifurcation normal forms and numerical certificates
- Long Exact Sequences in Homology
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Differentiation and First-order Spectral Perturbation
- Matrix Norms, Condition Numbers and Numerical Stability
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Nonlinear Boundary-Value Solvers
- Nonlinear equations and Newton methods
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Outward rounded interval and ball arithmetic
- Partitions of Unity and Paracompactness
- Periodic orbit shooting collocation and Floquet error
- pi: the Equivalent Characterizations
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Relative Homology Excision and Mayer Vietoris
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Sine, Cosine, and the Definition of Pi
- Singular Chains and Singular Homology
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Argument Principle and Rouché's Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Diagram Lemmas in an Abelian Category
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Logarithm and General Powers
- The Residue Theorem and the Evaluation of Real Integrals
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The Winding Number and the Global Cauchy Theorem
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Uniform Spaces: the Three Definitions
- Universal Properties, Representables and the Yoneda Lemma
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Verified linear systems and spectral enclosures
2 · Summary
Objective
The examples compute a stable planar cycle whose bad phase slice makes the shooting Jacobian singular, while a transverse phase makes it invertible. A coarse Euler step overestimates a stable transverse mode and produces a spurious multiplier of modulus greater than one. A near-unit interval enclosure demonstrates why a cluster count alone cannot decide stability. The van der Pol example states the exact conditional implication from a future validated orbit and complete strict Floquet cluster certificate; it supplies no fabricated numerical orbit or interval values.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A coarse Euler variational step gives a spurious unstable multiplier
Statement
For , consider the annular oscillator The unit circle has period and exact transverse variational equation , whose multiplier is . Define one forward-Euler step of length on that transverse equation by . With it multiplies the perturbation by , whose modulus exceeds one. This approximate number is not a validated Floquet enclosure.
Facts & Assumptions
Given: The autonomous oscillator, its unit-circle orbit, and the forward-Euler variational update .
A Floquet multiplier is an eigenvalue of the exact monodromy matrix, and the tangent direction of an autonomous periodic orbit has multiplier one (Local periodic-orbit, Poincare-return, and Floquet data, An autonomous periodic orbit has a neutral Floquet multiplier).
Proof
The identities and give and . Hence is a periodic orbit with least period . Differentiating at gives , whose exact solution is ; this transverse multiplier lies strictly between zero and one.
By the forward-Euler update specified in the Statement, with and we have . Thus its one-step amplification has modulus , despite the exact transverse multiplier being stable. Since this calculation provides no enclosure of the truncation defect or exact variational flow, it cannot serve as a certified multiplier claim under [F1].
A stable planar cycle can have a singular phase slice
Statement
On the annulus consider
The unit circle is an orbitally asymptotically stable periodic orbit of period . At the affine phase has a singular phase-bordered shooting Jacobian, while is transverse and gives an invertible phase-bordered shooting Jacobian.
Facts & Assumptions
Given: The smooth autonomous field on the annulus, the unit-circle candidate orbit, and the two affine phase functions.
The phase-bordered residual for phase covector is , and its Jacobian has period column (The phase-bordered periodic-orbit BVP residual).
The bordered Jacobian is singular when and is invertible when the neutral multiplier is simple and the phase is transverse (A simple neutral multiplier and transverse phase make the shooting Jacobian invertible).
Proof
The identities and give and . Thus is invariant and , so the least period is . Differentiating at gives the radial variational equation , whose multiplier is ; the angular variational equation is , whose multiplier is . Because the polar-coordinate Jacobian at times and is the same invertible matrix, the Cartesian monodromy is conjugate to . For the radial derivative is positive, and for it is negative, so each nearby radius moves monotonically toward and remains between its initial value and . It has a limit ; if , then is eventually bounded away from zero, contradicting convergence. Hence is an equilibrium, and the interval between the initial radius and contains only the equilibrium , so . These bounds also give Lyapunov stability of the unit circle. Thus the orbit is orbitally asymptotically stable and its neutral multiplier is simple.
At the vector field is . For , and , so [F2] gives a singular shooting Jacobian. For , and ; the phase multiplier is simple by step 1.1, so [F2] gives an invertible Jacobian.
A near-unit multiplier enclosure does not decide stability
Statement
Suppose a validated transverse multiplier enclosure is the real interval . It intersects the unit circle at and contains both a strictly stable scalar multiplier, for example , and a strictly unstable one, for example . A cluster count may establish how many multipliers the interval represents, but the strict Floquet separation hypothesis of Strict Floquet cluster enclosures certify orbital asymptotic stability is not established; the stability verdict is inconclusive.
Facts & Assumptions
Given: The interval enclosure for a non-phase multiplier and the unit-circle separation rule.
A validated shooting jet encloses a family of exact monodromy matrices and their multiplier data (Certified residual, Jacobian, trajectory, and monodromy enclosures for periodic shooting).
The cluster procedure certifies algebraic root counts inside a polygon, while orbital stability requires strict non-phase separation from the unit circle (Finite complex-contour validation of Floquet multiplier clusters, A verified contour count encloses every Floquet multiplier in a cluster, Strict Floquet cluster enclosures certify orbital asymptotic stability).
Proof
Both and lie in , but the first has modulus less than one and the second has modulus greater than one. Thus the interval alone admits opposite stability classifications, and it also intersects the unit circle at .
A contour count can certify the number of roots enclosed without sharpening their location relative to the circle. Since the enclosure does not place every non-phase multiplier strictly inside the unit disk or strictly outside it, the hypotheses required for a stability verdict in [F2] are not met. The sound output is inconclusive.
Conditional van der Pol stability from a validated enclosure
Statement
For the van der Pol system , , fix . If a future run of Finite-budget phase-fixed periodic-orbit correction and validation certifies a positive-period nonconstant orbit, and pairwise disjoint Floquet cluster polygons have counts summing to , with one polygon containing multiplier at count one and the other count-one polygon strictly inside the unit disk, then that certified orbit is orbitally asymptotically stable. This example states a conditional implication only; it supplies no computed interval, orbit, or numerical certificate.
Facts & Assumptions
Given: The parameter value and the hypothetical successful root and cluster certificate records stated above.
A successful validated-root corrector record includes a complete Krawczyk partition with one unique-root box and every other box root-free, outward residual/Jacobian bounds, a nonsingular preconditioner, strict inclusion and a separate contraction bound, and a field component excluding zero. Together with its successful validated trajectory/monodromy jet, these certify a unique phase-fixed nonconstant periodic orbit in its box (Finite-budget phase-fixed periodic-orbit correction and validation, A Krawczyk inclusion certifies a unique phase-fixed nonconstant periodic orbit).
The Floquet cluster theorem certifies the algebraic multiplier counts for every matrix in the validated family (Finite complex-contour validation of Floquet multiplier clusters, A verified contour count encloses every Floquet multiplier in a cluster).
A complete cluster family with a single neutral multiplier and all other clusters strictly inside the unit disk implies orbital asymptotic stability (Strict Floquet cluster enclosures certify orbital asymptotic stability).
Proof
Under the stated hypothetical corrector output, [F1] supplies the exact periodic orbit and a monodromy matrix in the enclosure family.
The assumed cluster certificates apply to that matrix by [F2]. The van der Pol field is polynomial and hence . The neutral multiplier cannot be on a certified polygon boundary, so it is interior to its count-one polygon. The other filled polygon is compact and lies strictly inside the unit disk, so its maximum modulus satisfies ; take . The two counts sum to the state dimension , giving the complete cluster hypotheses of [F3], so the orbit is orbitally asymptotically stable. No numerical conclusion is claimed without those certificates.