Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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 parameterized C5 center manifold exists at a simple Hopf spectral split

Statement

Let f(x,λ) be C5 near (0,0) in Rd×R, and suppose f(0,λ)=0 for all sufficiently small λ. Assume A=Dxf(0,0) has a simple pair ±iω, ω>0, and every other eigenvalue has nonzero real part. Choose q≠0 with Aq=iωq and set Ec=span⁡R{Re⁡q,Im⁡q}. Let Es and Eu be the real sums of generalized eigenspaces with eigenvalues of negative and positive real part, respectively, and set Eh=Es⊕Eu. For the extended system λ˙=0, there are neighborhoods U⊂Ec and J⊂R of zero and a C5 map h:U×J→Eh whose graph x=z+h(z,λ) is tangent to Ec×R at the origin and contains every sufficiently small periodic trajectory that remains in the chosen neighborhood.

Write Aλ=Dxf(0,λ). Since f is C5, this matrix path is C4; let ζ(λ) be its C4 simple eigenvalue branch from A simple eigenpair has a regularity-matched gauge-fixed parameter branch. For each small λ, the graph tangent plane range⁡Dz(z+h)(0,λ) is the invariant plane spanned by the right eigenvectors for ζ(λ) and ζ(λ)‾.

Write Pc,Ph for the spectral projections of A and define

fc(z,h,λ):=Pcf(z+h,λ),fh(z,h,λ):=Phf(z+h,λ).

The graph satisfies the actual invariance equation

Dzh(z,λ)fc(z,h(z,λ),λ)=fh(z,h(z,λ),λ),h(0,λ)=0,Dzh(0,0)=0.

On a smaller neighborhood it also satisfies h(z,λ)=O(∥z∥2+∣λ∣∥z∥). No Axiom of Choice is used.

Facts & Assumptions

Given: f, A, ω, Ec, Es, Eu, and the hypotheses in the Statement.

[F1]

Hopf spectral and multilinear normal-form data: the critical eigenpair is simple, and the only eigenvalues of A on the imaginary axis are ±iω.

[F2]

Weighted trajectory space for a local center-manifold construction: Cη(E)={u∈C(R,E):sup⁡te−η∣t∣∥u(t)∥<∞}.

[F3]

The weighted trajectory space is complete: this weighted trajectory space is complete.

[F4]

A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point: a contraction of a nonempty complete metric space into itself has a unique fixed point, obtained by iteration.

[F5]

Ck Euclidean maps and diffeomorphisms: C5 means continuous derivatives through order five.

[F6]

The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F′(c)=f(c); in particular a continuous f has F as a primitive: for a continuous integrand on a compact interval, its integral primitive differentiates to that integrand at every point, with one-sided derivatives at endpoints.

[F8]

Jordan form over the base field exists exactly when the characteristic polynomial splits and Jordan bases and Jordan canonical forms over the base field: when a finite-dimensional complex linear map has split characteristic polynomial, it has a Jordan basis, and each block is Jm(α)=αI+N with Nm=0.

[F9]

A smooth bump between concentric Euclidean balls: there is a smooth cutoff equal to one on a smaller closed ball and supported in a larger open ball.

[F11]

For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: every nonempty closed bounded subset of Rd is compact, and a continuous real-valued function on it attains a finite maximum.

[F12]

A simple eigenpair has a regularity-matched gauge-fixed parameter branch: a Ck matrix path with a simple eigenvalue has a unique local Ck eigenvalue and gauge-fixed right-eigenvector branch. Here Aλ is C4 because f is C5, so these branches are C4.

[F13]

Characteristic roots preserve separated cluster counts under matrix perturbation: near a matrix with separated eigenvalue neighborhoods, each neighborhood retains the same algebraic root count under small perturbation.

[F14]

R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R: the ambient extended state space Rd+1 with its Euclidean norm is complete.

[F16]

The complex exponential by its power series: exp⁡z=∑n≥0zn/n! for every z∈C.

[F17]

The complex exponential is entire and its complex derivative is itself: ddtexp⁡(αt)=αexp⁡(αt) for α∈C and real t.

[F18]
[F20]

Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative: if a scalar function is continuous on a compact interval and differentiable in its interior with continuous integrable derivative, integrating the derivative recovers the endpoint difference; apply this componentwise to finite-dimensional derivative arrays.

[F21]

The finite-dimensional product rule follows directly from total differentiability: for scalar maps a,b, expand a(y+h)=a(y)+Da(y)h+o(∥h∥) and b(y+h)=b(y)+Db(y)h+o(∥h∥) and multiply. The linear part is a(y)Db(y)h+b(y)Da(y)h, and all other terms are o(∥h∥). Applying this to each coordinate and summing proves the rule for every finite bilinear product and for evaluation of a multilinear array on varying arguments.

[F23]

Finite componentwise sums/products and compositions of Ck Euclidean maps are Ck for every finite k (Ck Euclidean maps are closed under componentwise algebra and composition). Thus the cutoff products and all finite derivative-array operations below retain their declared regularity.

Proof

1.1F1F7F8F15F16F17F18F19F21F22givenalgebra

On the extended state (x,λ), the linearization is diag⁡(A,0) because f(0,λ)≡0. Its characteristic polynomial has positive degree and splits over C by [F22], so [F8] gives the direct sum of complex generalized eigenspaces with Jordan blocks as defined by Jordan bases and Jordan canonical forms over the base field. The real and imaginary parts of q are independent: otherwise q would be a nonzero complex multiple of a real vector r, forcing Ar=iωr, impossible because Ar is real and iωr is nonreal. Since A is real, conjugation maps the generalized eigenspace for α onto the one for αˉ; grouping conjugate chains gives a real invariant splitting into the critical plane Ec and Es⊕Eu, and adjoining the parameter's zero coordinate gives center space Ec×R. To define the linear flow notation used below, on a Jordan block J=αI+N with Nm=0 put TJ(t):=exp⁡(αt)∑k=0m−1tkNk/k!. By [F7], [F17] and [F21], TJ′(t)=JTJ(t) and TJ(0)=I; by [F18] and the finite binomial expansion, TJ(t)TJ(s)=TJ(t+s), since every term involving Nk with k≥m vanishes. Conjugating these block operators by one fixed Jordan basis defines eBt on the center, stable and unstable summands; paired conjugate blocks give operators preserving the real subspaces. The simple critical pair has no nontrivial Jordan part and the parameter zero block is one-dimensional, so the center flow is bounded: on the critical blocks [F19] gives ∣exp⁡(±iωt)∣=1, and on the parameter block it is the identity. On a stable block write a=−Re⁡α>0 and choose 0<γ<a; [F19] gives ∣exp⁡(αt)∣=e−at. For each k<m, tke−(a−γ)t is bounded on [0,∞): on [0,1] it is at most 1, and for t≥1 [F16] and the real-extension clause of [F18] give e(a−γ)t≥((a−γ)t)k/k!. The same argument with −t applies to unstable blocks. There are finitely many blocks, so choose one γ>0 smaller than every nonzero ∣Re⁡α∣; the finite sums and products have a common finite bound. The changes of basis, their inverses, and the projections have finite operator norms by [F15]; enlarging K to include these and the bounded center flow gives ∥eAct∥≤K, ∥eAst∥≤Ke−γt and ∥e−Aut∥≤Ke−γt for t≥0. If the hyperbolic complement is zero, its estimates are vacuous.

1.2F5F7F9F10F11F21F23givenconstructalgebra

In these coordinates write the extended state as (v,w), with v=(z,λ)∈Ec×R and w=(ws,wu)∈Es⊕Eu, and write its equation as v˙=Acv+Nc(v,w) and w˙=Ahw+Nh(v,w). The nonlinear remainder N has N(0)=DN(0)=0. On a small closed ball its second derivative is bounded; applying [F10] first to DN and then to N gives ∥DN(y)∥≤C∥y∥ and ∥N(y)∥≤C∥y∥2. Choose a fixed smooth bump χ equal to one on the unit ball and supported in the ball of radius two, using [F9]. Its derivative has finite bound by [F11]; set χr(y)=χ(y/r), so [F7] gives ∥Dχr∥≤Cχ/r. On the support ball, the product rule [F21] gives ∥D(χrN)∥≤Cr+Cr2(Cχ/r)=C′r. Extend χrN by zero outside the coordinate domain; its support is compactly contained there, so [F23] makes the extension C5, compactly supported, and has bounded derivatives through order five.

2.1F9F10step 1.2algebra

The support of χr lies in the radius-2r ball, where the preceding derivative estimate holds; outside it the derivative of the extended product is zero. The global derivative bound and [F10] make the cut-off remainder globally Lipschitz with constant at most C′r. Taking r small makes this constant the required ε, while the cutoff equals one on the radius-r ball. Hence solutions staying in that smaller ball solve the original equation.

3.1F2F3F14step 1.1step 2.1givenalgebra

Let Eext:=(Ec×R)⊕Es⊕Eu, identified with Rd+1 by the invariant splitting in step 1.1 and equipped with the transported Euclidean norm; [F14] makes it complete and [F3] makes Cη(Eext) complete for every η>0. Choose η>0 with η6:=36η<γ and put ηj=3jη for 0≤j≤6. For each center initial value ξ∈Ec×R, define a map on Cη0(Eext) by v(t)=eActξ+∫0teAc(t−s)Nc(v(s),w(s)) ds, ws(t)=∫−∞teAs(t−s)Ns(v(s),w(s)) ds, and wu(t)=−∫t∞eAu(t−s)Nu(v(s),w(s)) ds, where v(t)∈Ec×R and w(t)=(ws(t),wu(t)). The cut-off remainder is bounded, so these integrals define elements of the weighted space. For a weight δ<γ, the center integral difference is bounded by Kε/δ and each hyperbolic integral difference by Kε/(γ−δ). Choose the cutoff radius in step 2.1 small enough that Kε(1/ηj+2/(γ−ηj))<1 for all 0≤j≤6. In particular the map is a contraction on Cη0(Eext).

4.1F3F4F6F7F21step 1.1step 3.1algebra

By [F4], for each ξ there is a unique fixed trajectory Γξ in this weighted space. For each σ∈{s,u}, splitting the corresponding improper integral at a finite time t0 and using the semigroup identity from step 1.1 gives wσ(t)=eAσ(t−t0)wσ(t0)+∫t0teAσ(t−s)Nσ(Γξ(s)) ds; for σ=u this uses the minus sign in the defining future integral and the oriented integral from t0 to t. For the center component, factor eAc(t−s)=eActe−Acs in its integral formula. The finite-interval integrands are continuous; componentwise [F6] differentiates their primitives, and [F7], [F21] differentiate the products with the linear flows. Thus Γξ solves the cut-off differential equation and has center coordinate ξ at time zero.

5.1F2F3F4F5F7F14step 3.1step 4.1algebra

Let Xj:=Cηj(Eext) for 0≤j≤6, and let K denote the three integral operators in step 3.1. Write Tξ(u)=ιcξ+K(N∘u), where ιcξ(t)=(eActξ,0,0), and define the formal linearization Lξv:=K(DN(Γξ)v). This definition does not assert same-weight Fréchet differentiability of Tξ; parameter derivatives are established below using increasing weights. The estimates in step 3.1 give ∥Lξ∥Xj→Xj≤κj:=Kε(1/ηj+2/(γ−ηj))<1 for every j≤6, so (I−Lξ)−1=∑n≥0Lξn on each Xj. Define candidate derivatives recursively by U1[v]=(I−Lξ)−1ιcv and, for 2≤j≤5, by the unique solution of (I−Lξ)Uj[v1,…,vj]=K∑π∈Πj, ∣π∣≥2D∣π∣N(Γξ)[U∣B∣[vi:i∈B]:B∈π], where Πj is the set of partitions of {1,…,j}. The recursion and induction make each Uj symmetric multilinear in its direction arguments. In every forcing summand the positive block sizes ki:=∣Bi∣ sum to j and ∑iηki<ηj: for positive integers a,b, 3a+3b<3a+b, and iteration gives the strict inequality for every partition with at least two blocks. Since the derivatives of the cutoff remainder are bounded, each forcing term belongs to Xj; the Neumann series therefore defines a unique Uj∈Xj.

6.1F5F7F21F23step 5.1algebra

The finite-dimensional partition rule used in step 5.1 follows by labelled-direction induction from [F7] and [F21]. At first order, D(N∘u)[v1]=DN(u)Du[v1], the single partition of {1}. Given the expression indexed by partitions of {1,…,j−1}, differentiate in a new direction vj. Differentiating the coefficient D∣π∣N(u) adds the singleton block {j}; differentiating a factor D∣B∣u[vi:i∈B] inserts j into that block B. Every partition of {1,…,j} arises exactly once: remove its singleton {j} if present, or remove j from its unique nonsingleton block. Hence the resulting sum is ∑π∈ΠjD∣π∣N(u)[D∣B∣u[vi:i∈B]:B∈π]. Its one-block term is DN(u)Dju, which is the term moved to the left in step 5.1; all other terms use only lower derivatives of u. For the difference-quotient argument in steps 7.1–8.1 this induction is first an algebraic identity for the candidate terms: the actual derivative limit is then established there, rather than assumed. Only derivatives of N through order j≤5 occur, and [F23] licenses the finite-dimensional coefficient operations.

6.2F3F4F5step 3.1step 4.1step 5.1algebra

Set U0(ξ):=Γξ. Subtracting the fixed-point equations gives ∥ΔU0∥X0≤C∣δ∣ by the contraction estimate. After moving LξΔU0 left, the Taylor remainder K(N(Γξ+ΔU0)−N(Γξ)−DN(Γξ)ΔU0)/δ tends to zero in X1: on bounded time intervals this follows from continuity of D2N, while on the tails it is bounded by C∣δ∣e2η0∣t∣ and 2η0<η1. The inverse of I−Lξ on X1 therefore gives DξU0=U1 as defined in step 5.1.

7.1F5F7F20F21step 1.2step 3.1step 4.1step 5.1step 6.2algebra

For 2≤j≤5, write Fj−1(ξ) for the partition forcing in step 5.1, so (I−Lξ)Uj−1(ξ)=Fj−1(ξ). Subtracting at ξ+δv and ξ gives (I−Lξ)ΔUj−1=(Lξ+δv−Lξ)Uj−1(ξ+δv)+ΔFj−1. Inductively the same identity for each lower Uk gives ∥ΔUk∥Xk+1≤C∣δ∣ for k<j−1: the coefficient change in L contributes ΔΓ of weight η0 times Uk of weight ηk, and each forcing difference changes either a coefficient DmN (controlled by bounded Dm+1N through componentwise [F20]) or a lower U factor. The strict partition inequality in step 5.1 bounds these products in Xk+1. Consequently the displayed right side is O(∣δ∣) in Xj, since η0+ηj−1<ηj and every forcing product has at least two positive-order factors; hence ΔUj−1/δ is bounded in Xj.

8.1F2F3F4F5F7F14F20F21F23step 1.2step 3.1step 4.1step 5.1step 6.1step 7.1algebra

Expand the coefficient and factor differences in step 7.1. Componentwise [F20] gives the first-order coefficient terms, the induction gives the compact-interval limits of lower difference quotients, and the labelled-direction identity of step 6.1 collects the limits into exactly the partition forcing defining Uj in step 5.1. On the tails, every divided coefficient term has growth exponent at most η0+ηj−1<ηj, and every divided lower-factor term has exponent a sum ∑iηki<ηj over a partition with at least two blocks. Thus the residual after subtracting the defining equation for Uj is bounded uniformly by Ceσ∣t∣ for some σ<ηj, and its Xj tail beyond T is at most Ce−(ηj−σ)T. First choose T large, then use compact-interval convergence to send δ to zero. The residual tends to zero in Xj, and ∥(I−Lξ)−1∥Xj→Xj≤(1−κj)−1 proves DξUj−1=Uj for every j≤5.

9.1F2F3F4F5F7F14step 1.2step 3.1step 4.1step 5.1step 6.2step 7.1step 8.1algebra

Subtract the recursion equations without division. For j<5, coefficient changes are controlled by bounded Dm+1N and lower-factor changes by steps 6.2–8.1; each product has total derivative order at most j, so its weight exponent is below ηj+1 and Uj(ξ+δv)→Uj(ξ) in Xj+1. For j=5, D5N is uniformly continuous because it is continuous with compact support; split into a bounded time interval and tails, where products have exponent below η5<η6, to obtain continuity in X6. Evaluation at t=0 is continuous on every Xj, so h(ξ)=Γξ(0)h is C5. All fixed points are unique; no Banach implicit-function or choice theorem is used.

10.1F4F7step 4.1step 5.1step 6.2step 9.1givenalgebra

Define h(ξ) to be the hyperbolic component of Γξ(0). Step 9.1 makes h C5. For each small λ, the constant extended trajectory (x(t),λ(t))=(0,λ) solves the cut-off equation because f(0,λ)=0; it obeys the integral equations with center value (0,λ), so uniqueness in step 4.1 gives h(0,λ)=0. At the origin, DN(0)=0, and the parameter derivative Ecv has zero hyperbolic component, so the equation for U1 gives Dzh(0,0)=0. If a fixed trajectory is shifted a sufficiently small time, the shifted trajectory still lies in the weighted space and solves the same integral equations with its new center value. Uniqueness in step 4.1 therefore makes the graph locally invariant. Differentiating that invariance relation using [F7] gives the displayed invariance equation.

11.1F10F20step 1.1step 3.1step 4.1step 10.1algebra

Since h(0,λ)=0, componentwise [F20] along s↦h(sz,λ) gives h(z,λ)=∫01Dzh(sz,λ)z ds. Bounded D2h on a smaller convex neighborhood and [F10] applied componentwise to Dzh give ∥Dzh(sz,λ)−Dzh(0,0)∥≤C(s∥z∥+∣λ∣); since Dzh(0,0)=0, integrating yields h(z,λ)=O(∥z∥2+∣λ∣∥z∥). If a periodic trajectory remains in the smaller neighborhood for all real time, its center component and its stable and unstable components are bounded. Letting the initial time tend to −∞ in the stable variation formula and to +∞ in the unstable formula removes the homogeneous terms by the exponential bounds of step 1.1. The trajectory then satisfies the fixed-point equations of step 3.1 and, by uniqueness, lies on the graph.

12.1F12F13step 9.1step 10.1givenalgebra∎

Put X(z,λ)=z+h(z,λ) and g(z,λ)=fc(z,h(z,λ),λ). Differentiating the invariance equation at z=0 gives DzX(0,λ)Dzg(0,λ)=AλDzX(0,λ), since g(0,λ)=0. The derivative DzX(0,0) is the identity on Ec, so it remains injective for small λ; its range is therefore a two-dimensional invariant subspace. Choose pairwise disjoint disks covering the finite spectrum of A0, with separate critical disks around ±iω. These two disks cover the spectrum of Dzg(0,0) as well. Since Dzg(0,λ)→Dzg(0,0) and Aλ→A0, [F13] gives the same root counts in these disks for all sufficiently small λ; otherwise a violating sequence λn→0 would contradict [F13]. Thus Dzg(0,λ) has one eigenvalue near each critical value. The restriction of Aλ to the invariant range is conjugate to Dzg(0,λ), hence has that pair. Applying [F13] to Aλ shows its full spectrum has exactly one eigenvalue in each critical disk; because Aλ is real the roots are conjugates, and [F12] identifies them as ζ(λ) and ζ(λ)‾. Thus the invariant plane is their span, as asserted.

Remarks

The cutoff is only a local construction device; all conclusions are restricted to the ball where it equals one. The proof uses unique Banach fixed points and finite-dimensional spectral decompositions, not arbitrary-index choice.

Depends on

Used by

Dependency tree · two levels

143 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