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.

The rescaled pulse endpoint map converges to the kick K(q,p)=(q,p+q2−a) in C1, and the period map is smooth, symplectic and C1-close to F

Statement

Fix a≥100, put R:=a+3≥13, S:=[−R−1,R+1]2, and let w, δ, P, βδ, R0, the rescaled pulse equation, the endpoint map Kδ and the stroboscopic map Gδ=Kδ∘R0 be as in The smooth P-periodic pulsed oscillator: the normalized pulse, its Hamiltonian and its stroboscopic (period) map. Let

K(q,p):=(q, p+q2−a),F(q,p):=(p, p2−a−q),J:=(01−10),

so that F=K∘R0. Then there are constants δ1>0 and C1<∞ depending only on a and w such that for every 0<δ≤δ1:

  1. (existence on the pulse) for every (q,p)∈S the solution of the rescaled equation with initial data (q,p) exists on [0,1] and stays in the compact tube T:=[−R−2,R+2]×[−M,M], M:=R+1+(R+1)2+1; hence Kδ is defined on S, Kδ(S)⊆T, and

sup⁡S(∣Kδ−K∣+∥DKδ−DK∥)≤C1δ

for the Euclidean norm and the operator norm; 2. (closeness of the period map) sup⁡S(∣Gδ−F∣+∥DGδ−DF∥)≤C1δ; 3. (smoothness, invertibility, symplecticity) Gδ is of class C∞ on an open neighbourhood N of S; DGδ(z) is invertible for every z∈N and Gδ is injective on N, so Gδ:N→Gδ(N) is a C∞ diffeomorphism onto its image; and

DGδ(z)TJ DGδ(z)=J(z∈N),

that is, Gδ is symplectic; 4. (the reverse-conjugated map) let Sw(q,p):=(p,q) and Hδ:=Sw∘Gδ−1∘Sw on a neighbourhood of S. Then Hδ is of class C∞ there, and there is C2<∞, depending only on a and w, with

sup⁡S(∣Hδ−F∣+∥DHδ−DF∥)≤C2δ.

Consequently, each of the six componentwise closeness inequalities for Gδ and Hδ holds on S with common bound Cˉδ, where Cˉ:=max⁡(C1,C2): each coordinate difference is bounded by the Euclidean norm, and each derivative-entry difference is bounded by the operator norm.

Facts & Assumptions

Given: The data in the Statement. Extend w by zero to a smooth function on R, and put fδ(s,q,p)=(δp,−δq+w(s)(q2−a)) for real δ.

[F3]

On an established common compact interval the derivative in initial data solves Y′=Dzf(s,z)Y, Y(0)=I (C1 dependence of solutions on initial data). The jointly smooth field has local smooth dependence on initial data and parameters (Smooth dependence of ODE solutions on parameters); this local assertion will be patched over the established interval, rather than assumed to give existence for a whole period.

[F4]

Closed Euclidean boxes are compact (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line). The Euclidean inverse-function theorem supplies a C1 local inverse for a C1 map on an open domain with invertible derivative (The Euclidean inverse function theorem); a smooth map then has smooth local inverses by A local inverse of a Ck regular map is Ck. Euclidean calculus uses the chain rule, mean-value inequality, continuity and boundedness of continuous derivatives on compact sets (Ck Euclidean maps and diffeomorphisms, The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), On a convex open set, a uniform bound ∥Df(z)v∥2≤M∥v∥2 implies ∥f(y)−f(x)∥2≤M∥y−x∥2, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Open ball, closed ball and sphere in a metric space, Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point, Absolute value in an ordered field, Basic properties of the absolute value, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Proof

technique · direct; trap the forward and backward pulse evolutions in separate compact tubes, compare their state and variational equations, and use uniqueness to identify the backward endpoint as the inverse
1.1givenF1F2algebra

At δ=0 the forward solution through (q0,p0) is z0(s)=(q0,p0+(q02−a)∫0sw). For initial data in S, ∣q0∣≤R+1 and ∣q02−a∣≤(R+1)2; hence ∣p0+(q02−a)∫0sw∣≤M−1 on [0,1]. Thus this reference solution lies at least distance 1 from the boundary of the stated tube T. Its endpoint is K(q0,p0).

2.1step 1.1F1F2F4algebra

On T and for ∣δ∣≤1, there are constants B0,L0 depending only on a,w such that ∣fδ−f0∣≤B0∣δ∣ and ∥Dzfδ∥≤L0: one may take B0=M+R+2 and L0=1+2∥w∥∞(R+2). Up to the first exit from T, subtracting the integral equations gives ∣zδ(s)−z0(s)∣≤B0∣δ∣+L0∫0s∣zδ−z0∣, so Gronwall gives sup⁡∣zδ−z0∣≤B0eL0∣δ∣. Choose d0>0 with B0eL0d0<1/2. An exit on [0,1] is impossible by the distance margin in step 1.1. A maximal solution terminating before the end without exiting is extendible by [F1]. Therefore every datum in S has a solution on [0,1] staying in T.

3.1givenstep 2.1F1F2F4algebra

Larger tubes establish the domains needed for inversion. Set b:=R+2, Q:=[−b,b]2, B:=b+b2+a+2 and E:=[−B,B]2. For every datum in E, the forward reference solution has ∣q∣≤B, ∣p∣≤B+B2+a. For a terminal datum y=(yq,yp)∈E at s=1, the reference backward solution is (yq,yp−(yq2−a)∫s1w) with exactly the same bounds. Both reference families therefore have distance at least 1 from the boundary of TE:=[−B−1,B+1]×[−B−B2−a−1,B+B2+a+1]. Apply the integral comparison of step 2.1 on this tube, in the backward case after τ=1−s so that the field is −fδ(1−τ,z). This field has the same boundedness and Lipschitz estimates. With a smaller threshold dE>0, both evolutions exist over the whole unit interval for all their data in E, and their state differences from the reference evolutions are uniformly O(∣δ∣). All constants depend only on a,w. In particular K−1(Q)⊂int⁡E, since K−1(y)=(yq,yp−yq2+a) and its coordinates are bounded by b and b+b2+a=B−2. This uses the actual inverse preimage, without assuming it lies in Q.

4.1step 3.1F1F3F4choose

These families are smooth in initial or terminal data and δ on neighbourhoods of the compact data sets after decreasing dE. To justify the whole interval from the local assertion [F3], cover each reference graph by finitely many local time-state-parameter neighbourhoods where [F3] gives smooth local solution operators, and subdivide [0,1] into finitely many sufficiently short successive intervals. The graph stays inside the tube with a positive margin by step 3.1; the field and its state derivative are bounded on a slightly enlarged compact tube, so one common short interval is admissible at every graph point. At each subdivision endpoint local existence and smooth dependence apply to the endpoint data from the preceding interval. Their finite composition is smooth and equals the unique solution. Shrinking the initial-data and parameter neighbourhoods finitely many times keeps each intermediate value in its admissible neighbourhood. Finitely many such initial-data neighbourhoods cover each compact data set, yielding one positive parameter threshold. The same argument for the time-reflected field gives the backward family. Thus Kδ and the backward endpoint map Lδ(y):=z(0) for z(1)=y are smooth near E and Q, respectively, for all sufficiently small ∣δ∣, including 0.

5.1step 2.1step 3.1step 4.1F2F3F4algebra

The state comparisons in steps 2.1 and 3.1 also hold in C1. Indeed, on either compact tube, Dzfδ−Dzf0 is bounded by ∣δ∣, and Dzf0 is uniformly Lipschitz in z, so along compared trajectories ∥Dzfδ(s,zδ)−Dzf0(s,z0)∥≤C∣δ∣. By [F3] their derivative matrices solve the variational equations with the same initial matrix I. Gronwall first bounds both matrices by eL, then, after subtracting their integral equations, bounds the difference by Ce2L∣δ∣, with fixed constants for the tube. The identical argument for the reflected field controls derivatives in terminal data. Consequently there are finite positive Cf,Cb with sup⁡Q(∣Kδ−K∣+∥DKδ−DK∥)≤Cf∣δ∣ and sup⁡Q(∣Lδ−K−1∣+∥DLδ−DK−1∥)≤Cb∣δ∣. Increasing Cf includes the forward estimates on S in the original tube; hence clause 1 follows.

6.1step 4.1step 5.1F1F3F4algebra

Choose δ1>0 below all previous thresholds and with Cbδ1<1. Then Lδ(Q)⊂int⁡E, because K−1(Q) has coordinate margin at least 2 in E. Put V:=(−b,b)2 and O:=int⁡E. Uniqueness of the original and reflected equations shows that Kδ is injective on O: solutions sharing their terminal value coincide when evolved backwards. Its differential is invertible by the following direct calculation: the rescaled field is J∇h for h(s,q,p)=δ(p2+q2)/2+w(s)(aq−q3/3); hence A=Dzfδ=JHess⁡h with symmetric Hessian and ATJ+JA=0. The variational matrix satisfies (YTJY)′=0 and Y(0)=I, so YTJY=J. A vector in the kernel of Y must then lie in the kernel of the invertible matrix J, so Y is invertible. By The Euclidean inverse function theorem, the smooth map Kδ on the open set O has C1 local inverses at every point; A local inverse of a Ck regular map is Ck upgrades these to smooth local inverses, which agree by injectivity; therefore Kδ:O→Kδ(O) is a smooth diffeomorphism onto its open image. For every y∈V, its backward trajectory starts at Lδ(y)∈O and ends at y; hence V⊂Kδ(O) and the inverse on V is exactly Lδ. Define N:=R0−1(O), an open neighbourhood of S. Then Gδ=Kδ∘R0:N→Kδ(O) is a smooth diffeomorphism, and clause 2 follows from step 5.1 and R0(Q)=Q, since R0 is a linear isometry.

7.1givenstep 6.1F3F4algebra

The matrix computation of step 6.1 also gives symplecticity. The rescaled field is J∇h with h(s,q,p)=δ(p2+q2)/2+w(s)(aq−q3/3). Its derivative matrix is A=JHess⁡h with symmetric Hessian. Since JT=−J and J2=−I, direct multiplication gives ATJ+JA=0. Therefore the variational matrix satisfies (YTJY)′=YT(ATJ+JA)Y=0 and Y(0)=I, giving YTJY=J. This identity forces Y invertible (a vector in its kernel must lie in the kernel of J). Also DR0=J satisfies JTJJ=J. Applying the chain rule to the composition yields DGδTJDGδ=J on N, proving clause 3.

7.2step 5.1step 6.1F4algebra

Since Sw(V)=V, the conjugated inverse is defined on the open neighbourhood V of S and has the explicit expression Hδ=R0∘Sw∘Lδ∘Sw, using SwR0−1=R0Sw. At δ=0 this is SwF−1Sw=F. Fixed linear isometries preserve both state and derivative comparison norms, so step 5.1 gives sup⁡S(∣Hδ−F∣+∥DHδ−DF∥)≤Cbδ. The composition is a smooth diffeomorphism onto its image, and clause 4 holds with C2:=Cb and clause 2 with C1:=Cf.

8.1step 5.1step 6.1step 7.1step 7.2F4algebra∎

Increase C1,C2 to positive constants if needed and decrease δ1 to include every threshold above. For 0<δ≤δ1, each coordinate difference is bounded by the Euclidean difference norm and each derivative entry difference by the operator norm. Thus both maps satisfy the six componentwise closeness inequalities with the common bound Cˉδ, where Cˉ:=max⁡(C1,C2). The forward tube conclusion was established independently in steps 1.1-2.1 and was preserved throughout the enlarged-domain argument.

Remarks

  • The enlarged compact set E is used only for forward and inverse domain control. The stated small forward tube T for data in S is retained. Constants and smallness thresholds depend on the fixed a and w; no global completeness of the polynomial field is assumed.

  • Symplecticity is proved directly for the time-dependent system. The autonomous result The derivative of the Hamiltonian flow satisfies YTJY=J and det⁡Y=1 is not invoked. The coordinate matrix agrees with the canonical layer, while the whole-period smoothness assertion uses explicit finite patching of local solution maps.

Depends on

Dependency tree · 2 levels

Sources