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 be near in , and suppose for all sufficiently small . Assume has a simple pair , , and every other eigenvalue has nonzero real part. Choose with and set . Let and be the real sums of generalized eigenspaces with eigenvalues of negative and positive real part, respectively, and set . For the extended system , there are neighborhoods and of zero and a map whose graph is tangent to at the origin and contains every sufficiently small periodic trajectory that remains in the chosen neighborhood.
Write . Since is , this matrix path is ; let be its simple eigenvalue branch from A simple eigenpair has a regularity-matched gauge-fixed parameter branch. For each small , the graph tangent plane is the invariant plane spanned by the right eigenvectors for and .
Write for the spectral projections of and define
The graph satisfies the actual invariance equation
On a smaller neighborhood it also satisfies . No Axiom of Choice is used.
Facts & Assumptions
Given: , , , , , , and the hypotheses in the Statement.
Hopf spectral and multilinear normal-form data: the critical eigenpair is simple, and the only eigenvalues of on the imaginary axis are .
The weighted trajectory space is complete: this weighted trajectory space is complete.
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.
Euclidean maps and diffeomorphisms: means continuous derivatives through order five.
The first fundamental theorem: if is integrable on and continuous at , then ; in particular a continuous has 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.
The chain rule for total derivatives: : derivatives of compositions obey the chain rule.
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 with .
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.
On a convex open set, a uniform bound implies : a uniform derivative bound on a convex open set gives the corresponding Lipschitz bound.
For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: every nonempty closed bounded subset of is compact, and a continuous real-valued function on it attains a finite maximum.
A simple eigenpair has a regularity-matched gauge-fixed parameter branch: a matrix path with a simple eigenvalue has a unique local eigenvalue and gauge-fixed right-eigenvector branch. Here is because is , so these branches are .
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.
and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in : the ambient extended state space with its Euclidean norm is complete.
Every Euclidean linear map has a unique matrix and satisfies for some : every Euclidean linear map has a finite operator-norm bound.
The complex exponential by its power series: for every .
, and the complex exponential extends the real exponential: for complex .
, , and : for real .
Newton–Leibniz needs only continuity on , differentiability on , 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.
The finite-dimensional product rule follows directly from total differentiability: for scalar maps , expand and and multiply. The linear part is , and all other terms are . 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.
is monic of degree ; for its coefficient is and its constant coefficient is , while and A complex polynomial of degree has exactly roots counted with multiplicity: the extended matrix's characteristic polynomial has degree and splits over .
Finite componentwise sums/products and compositions of Euclidean maps are for every finite ( 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
On the extended state , the linearization is because . Its characteristic polynomial has positive degree and splits over 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 are independent: otherwise would be a nonzero complex multiple of a real vector , forcing , impossible because is real and is nonreal. Since is real, conjugation maps the generalized eigenspace for onto the one for ; grouping conjugate chains gives a real invariant splitting into the critical plane and , and adjoining the parameter's zero coordinate gives center space . To define the linear flow notation used below, on a Jordan block with put . By [F7], [F17] and [F21], and ; by [F18] and the finite binomial expansion, , since every term involving with vanishes. Conjugating these block operators by one fixed Jordan basis defines 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 , and on the parameter block it is the identity. On a stable block write and choose ; [F19] gives . For each , is bounded on : on it is at most , and for [F16] and the real-extension clause of [F18] give . The same argument with applies to unstable blocks. There are finitely many blocks, so choose one smaller than every nonzero ; 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 to include these and the bounded center flow gives , and for . If the hyperbolic complement is zero, its estimates are vacuous.
In these coordinates write the extended state as , with and , and write its equation as and . The nonlinear remainder has . On a small closed ball its second derivative is bounded; applying [F10] first to and then to gives and . 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 , so [F7] gives . On the support ball, the product rule [F21] gives . Extend by zero outside the coordinate domain; its support is compactly contained there, so [F23] makes the extension , compactly supported, and has bounded derivatives through order five.
The support of lies in the radius- 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 . Taking small makes this constant the required , while the cutoff equals one on the radius- ball. Hence solutions staying in that smaller ball solve the original equation.
Let , identified with by the invariant splitting in step 1.1 and equipped with the transported Euclidean norm; [F14] makes it complete and [F3] makes complete for every . Choose with and put for . For each center initial value , define a map on by , , and , where and . 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 and each hyperbolic integral difference by . Choose the cutoff radius in step 2.1 small enough that for all . In particular the map is a contraction on .
By [F4], for each there is a unique fixed trajectory in this weighted space. For each , splitting the corresponding improper integral at a finite time and using the semigroup identity from step 1.1 gives ; for this uses the minus sign in the defining future integral and the oriented integral from to . For the center component, factor 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.
Let for , and let denote the three integral operators in step 3.1. Write , where , and define the formal linearization . This definition does not assert same-weight Fréchet differentiability of ; parameter derivatives are established below using increasing weights. The estimates in step 3.1 give for every , so on each . Define candidate derivatives recursively by and, for , by the unique solution of , where is the set of partitions of . The recursion and induction make each symmetric multilinear in its direction arguments. In every forcing summand the positive block sizes sum to and : for positive integers , , 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 ; the Neumann series therefore defines a unique .
The finite-dimensional partition rule used in step 5.1 follows by labelled-direction induction from [F7] and [F21]. At first order, , the single partition of . Given the expression indexed by partitions of , differentiate in a new direction . Differentiating the coefficient adds the singleton block ; differentiating a factor inserts into that block . Every partition of arises exactly once: remove its singleton if present, or remove from its unique nonsingleton block. Hence the resulting sum is . Its one-block term is , which is the term moved to the left in step 5.1; all other terms use only lower derivatives of . 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 through order occur, and [F23] licenses the finite-dimensional coefficient operations.
Set . Subtracting the fixed-point equations gives by the contraction estimate. After moving left, the Taylor remainder tends to zero in : on bounded time intervals this follows from continuity of , while on the tails it is bounded by and . The inverse of on therefore gives as defined in step 5.1.
For , write for the partition forcing in step 5.1, so . Subtracting at and gives . Inductively the same identity for each lower gives for : the coefficient change in contributes of weight times of weight , and each forcing difference changes either a coefficient (controlled by bounded through componentwise [F20]) or a lower factor. The strict partition inequality in step 5.1 bounds these products in . Consequently the displayed right side is in , since and every forcing product has at least two positive-order factors; hence is bounded in .
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 in step 5.1. On the tails, every divided coefficient term has growth exponent at most , and every divided lower-factor term has exponent a sum over a partition with at least two blocks. Thus the residual after subtracting the defining equation for is bounded uniformly by for some , and its tail beyond is at most . First choose large, then use compact-interval convergence to send to zero. The residual tends to zero in , and proves for every .
Subtract the recursion equations without division. For , coefficient changes are controlled by bounded and lower-factor changes by steps 6.2–8.1; each product has total derivative order at most , so its weight exponent is below and in . For , is uniformly continuous because it is continuous with compact support; split into a bounded time interval and tails, where products have exponent below , to obtain continuity in . Evaluation at is continuous on every , so is . All fixed points are unique; no Banach implicit-function or choice theorem is used.
Define to be the hyperbolic component of . Step 9.1 makes . For each small , the constant extended trajectory solves the cut-off equation because ; it obeys the integral equations with center value , so uniqueness in step 4.1 gives . At the origin, , and the parameter derivative has zero hyperbolic component, so the equation for gives . 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.
Since , componentwise [F20] along gives . Bounded on a smaller convex neighborhood and [F10] applied componentwise to give ; since , integrating yields . 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.
Put and . Differentiating the invariance equation at gives , since . The derivative is the identity on , so it remains injective for small ; its range is therefore a two-dimensional invariant subspace. Choose pairwise disjoint disks covering the finite spectrum of , with separate critical disks around . These two disks cover the spectrum of as well. Since and , [F13] gives the same root counts in these disks for all sufficiently small ; otherwise a violating sequence would contradict [F13]. Thus has one eigenvalue near each critical value. The restriction of to the invariant range is conjugate to , hence has that pair. Applying [F13] to shows its full spectrum has exactly one eigenvalue in each critical disk; because 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
- Hopf spectral and multilinear normal-form data
- Weighted trajectory space for a local center-manifold construction
- The weighted trajectory space is complete
- A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point
- $C^k$ Euclidean maps and diffeomorphisms
- Every Euclidean linear map has a unique matrix and satisfies $\|Lh\|_2\le K\|h\|_2$ for some $K\ge0$
- Newton–Leibniz needs only continuity on $[a,b]$, differentiability on $(a,b)$, and a Riemann-integrable extension of the interior derivative
- 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
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- $C^k$ Euclidean maps are closed under componentwise algebra and composition
- Jordan form over the base field exists exactly when the characteristic polynomial splits
- Jordan bases and Jordan canonical forms over the base field
- $\chi_A(x)$ is monic of degree $n$; for $n\geq1$ its $x^{n-1}$ coefficient is $-\operatorname{tr}(A)$ and its constant coefficient is $(-1)^n\det(A)$, while $\chi_{0\times0}=1$
- A complex polynomial of degree $n$ has exactly $n$ roots counted with multiplicity
- A smooth bump between concentric Euclidean balls
- On a convex open set, a uniform bound $\|Df(z)v\|_2\le M\|v\|_2$ implies $\|f(y)-f(x)\|_2\le M\|y-x\|_2$
- For a nonempty subset of $\mathbb{R}^n$ with $n\ge1$, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent
- $\mathbb{R}$ and $\mathbb{R}^n$ for $n \ge 1$ with the Euclidean metric are complete, componentwise from the Cauchy criterion in $\mathbb{R}$
- The complex exponential by its power series
- The complex exponential is entire and its complex derivative is itself
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- A simple eigenpair has a regularity-matched gauge-fixed parameter branch
- Characteristic roots preserve separated cluster counts under matrix perturbation
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
- J. E. Marsden and M. McCracken, The Hopf Bifurcation and Its Applications, Springer-Verlag, 1976 (standard reference, not scraped)
- Yuri A. Kuznetsov, Elements of Applied Bifurcation Theory, 2nd ed., Springer (standard reference, not scraped)