Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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 stroboscopic (time-P) map of a P-periodic first-order system

Definition

Let n≥1, let U⊆Rn be open, let P>0, and let F:R×U→Rn be a map that is continuous and locally Lipschitz in the state variable, in the sense of the hypotheses of Every Picard–Lindelöf initial value problem has one maximal solution on an open interval, and that is P-periodic:

F(t+P,z)=F(t,z)(t∈R, z∈U).

Consider the first-order system x′(t)=F(t,x(t)) of First-order systems, initial value problems, and solutions on intervals on the open domain R×U. For z∈U let

xz:Jz⟶U

be the unique maximal solution of the initial value problem x′(t)=F(t,x(t)), x(0)=z; here Jz is the open maximal interval of existence containing 0, and by Every Picard–Lindelöf initial value problem has one maximal solution on an open interval every solution of this initial value problem is a restriction of xz (Extensions, maximal solutions, maximal intervals, and global solutions, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

The domain of the stroboscopic map is

DP:={ z∈U:[0,P]⊆Jz },

the set of initial states whose solution exists over one full period. The stroboscopic map (or time-P map) of the system is the function

θP:DP⟶U,θP(z):=xz(P).

This is a well-defined function: for z∈DP the interval Jz contains P, so xz(P) is a point of U, and by the uniqueness clause of the maximal-solution theorem the value xz(P) does not depend on any choice, since xz is the only maximal solution through (0,z).

Remarks

  • The definition depends on the chosen initial time 0. Replacing the initial time by t0 and defining θPt0(z):=xt0,z(t0+P) on the corresponding domain gives the same family of maps up to the time-translation flow of the P-periodic system; only the initial time 0 is used on this page.

  • The domain DP is the set where the solution exists up to time P; it need not be invariant under θP or equal all of U. Openness of this domain is not proved here. Formal iterates θPk are defined only on the subset of points for which each successive value remains in DP; the precise statement is Iterates of the stroboscopic map, and equilibria as fixed points.

  • If F does not depend on t (the autonomous case), then θP is the time-P map of the autonomous system and every equilibrium z∗ of the autonomous right-hand side satisfies θP(z∗)=z∗. A fixed point z∈DP yields a P-periodic solution: repeat xz∣[0,P] on every interval [kP,(k+1)P], k∈Z. Values at each joining point equal z, and the one-sided derivatives agree because F(P,z)=F(0,z). Periodicity of F makes each segment solve the same equation; hence the repeated curve is a solution on R, and uniqueness identifies it with xz. Conversely a P-periodic solution through z gives θP(z)=z. Constant solutions are included, so a fixed point alone does not imply a nonconstant periodic orbit.

  • The map θP can be studied as a discrete-time map. Applying the hyperbolic-fixed-point definition of Hyperbolic equilibria, hyperbolic fixed points, periodic orbits, limit cycles and homoclinic trajectories requires a differentiable self-map of an open neighbourhood of the fixed point; such a restriction is not supplied here. No relation to a continuous-time stability criterion is asserted here.

Depends on

Dependency tree · 2 levels

Sources