Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
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 separated simple Floquet multiplier has a left/right-conditioned finite enclosure

Statement

Let A∈Cn×n have an algebraically simple eigenvalue λ0, with right vector v normalized by ∥v∥2=1 and compatible left vector w normalized by w∗v=1. Put Q=I−vw∗, W=ker⁡w∗, q=∥Q∥2, and κ=∥w∥2. The restriction AW=A∣W is well-defined. Let D={λ:∣λ−λ0∣≤ρ} be a disk such that every λ∈D makes λIW−AW invertible and R≥sup⁡λ∈D∥(λIW−AW)−1∥2<∞. If n≥2, ∥E∥2≤δ, and Rq2δ<1, then every eigenvalue λ of A+E in D satisfies

∣λ−λ0∣≤κδ+κqRδ21−Rq2δ.

When A+E is a monodromy matrix, this bounds its Floquet multipliers lying in D; A may be a numerical reference matrix. The formula is a finite nonnormal perturbation enclosure under the stated complementary-resolvent separation hypothesis; it supplies no enclosure for a cluster lacking that separation.

Facts & Assumptions

Given: A simple eigenvalue, compatible normalized left/right vectors, an isolating disk for the complementary restriction, and a perturbation norm bound.

[F1]

A simple eigenvalue admits compatible left and right eigenvectors whose pairing is nonzero and can be normalized to one (For a simple eigenvalue, left and right eigenvectors pair nontrivially and may be normalized by y∗x=1, Compatible left and right eigenvectors for a simple eigenvalue).

[F3]

For any differentiable simple-eigenpair branch along A+tE with compatible normalized eigenvectors equal to v,w at t=0, the eigenvalue derivative there is w∗Ev (Along a differentiable matrix path, a simple eigenvalue satisfies λ′=y∗A′x under the normalization y∗x=1).

[F5]

The monodromy matrix and its eigenvalues are the Floquet data of the periodic orbit (Local periodic-orbit, Poincare-return, and Floquet data); a validated matrix enclosure is part of the shooting jet (Certified residual, Jacobian, trajectory, and monodromy enclosures for periodic shooting).

Proof

1.1F1F2givenalgebra

Since w∗A=λ0w∗, W is invariant; since Av=λ0v and w∗v=1, every vector splits uniquely as αv+y with y∈W. The restriction has no eigenvalue λ0 by algebraic simplicity. Also Q is the projection onto W. For n≥2, its range is nonzero and Q acts as the identity there, so q≥1.

2.1givenstep 1.1algebra

Let λ∈D be an eigenvalue of A+E with eigenvector x=αv+y, y∈W. If α=0, projection onto W gives y=(λIW−AW)−1QEy. Thus ∥y∥2≤Rqδ∥y∥2, while Rqδ≤Rq2δ<1, forcing y=0, contrary to x≠0. Hence α≠0; rescale the eigenvector so α=1.

3.1givenstep 2.1algebra

Projecting (A+E)(v+y)=λ(v+y) onto W gives y=(λIW−AW)−1QE(v+y). Therefore ∥y∥2≤Rqδ(1+∥y∥2) and ∥y∥2≤Rqδ/(1−Rqδ).

4.1F3F5step 1.1step 3.1algebra∎

Applying w∗ to the same eigen-equation gives λ−λ0=w∗Ev+w∗Ey. The first term, which [F3] identifies as the derivative along any differentiable normalized simple-eigenpair branch through (λ0,v,w), has modulus at most κδ, while the second is at most κδ∥y∥2. Substituting step 3.1 gives the stronger denominator 1−Rqδ. Since q≥1, 1−Rq2δ≤1−Rqδ and both are positive, so replacing by the smaller denominator yields the stated bound. If A+E is monodromy, [F5] identifies λ as one of its Floquet multipliers. No monodromy property of A alone is needed or sufficient for that interpretation.

Depends on

Used by

Dependency tree · two levels

28 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