Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Dynamical Systems

180 missions · 114 completed

Missions

Open66Completed114All180
🏆Completed
Control TheoryOperations Research·Captain: mikedeng1

Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems 4: A Run-Truncating Priority-Queue Supervisor Keeps Every Buffer Bounded When ρₘ < 1Research Paper

A flexible manufacturing system routes several part types through a set of machines; a machine that switches from one kind of part to another must spend a set-up time first. Each machine has to decide, in real time and from local information only, which of its waiting buffers to work on and for how long. Long runs waste little time on set-ups but starve…

8 thms2 active usersReviewed
Control TheoryOperations ResearchOptimization·Captain: mikedeng1

Homogeneous Approximation, Recursive Observer Design, and Output Feedback: Global Asymptotic Stabilization of a Chain of Integrators by a Homogeneous-in-the-Bi-Limit Output FeedbackResearch Paper

Many nonlinear control systems behave like a chain of integrators, x˙1=x2,…,x˙n=u\dot x_1=x_2,\dots,\dot x_n=ux˙1​=x2​,…,x˙n​=u, with additional terms that are small either near the origin or far from it. Designs based on weighted homogeneity handle such systems by making the closed loop invariant under a dilation, which gives robustness to perturbations that are dominated by the…

13 thms2 active usersReviewed
🏆Completed
Control TheoryOperations Research·Captain: mikedeng1

Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems 1: Clearing Policies Are Unstable on a Re-Entrant Two-Machine Line, Even Without Set-UpsResearch Paper

A flexible manufacturing system is a set of machines through which parts of several types travel along fixed routes; each machine serves several buffers and must pay a set-up time whenever it switches from one buffer to another. Real-time scheduling decides, as the system evolves, which buffer each machine works on. Perkins and Kumar (IEEE Trans. Automat.…

10 thms2 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Subadditive Ergodic Theory 2: For Every Increasing Γ There Is a C^∞ Process with Stationary Increments and P{|y_t| ≤ Γ(t) for All Large t} = 0Research Paper

Kingman's subadditive ergodic theorem (Theorem 1 of Kingman 1973, first proved in Kingman 1968) says that for a discrete-parameter subadditive process x=(xst)x=(x_{st})x=(xst​) the ratio x0t/tx_{0t}/tx0t​/t converges with probability one and in mean. Applications in first-passage percolation, products of random matrices and longest increasing subsequences often come with a…

7 thms2 active usersReviewed
🏆Completed
AnalysisOperations ResearchOptimization·Captain: mikedeng1

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems III: Bounded Subgradient Trajectories Converge with Łojasiewicz RatesResearch Paper

Many optimization algorithms are discretizations of a continuous-time descent: the gradient flow x˙=−∇f(x)\dot x=-\nabla f(x)x˙=−∇f(x) for smooth objectives, and its nonsmooth analogue, the subgradient dynamical system, for objectives with kinks or constraints. A basic question about such a flow is whether a bounded trajectory actually converges, rather than merely…

22 thms2 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Dynamics of Stochastic Approximation Algorithms 7: Weak Limit Points of the Occupation Measures of a Weak Asymptotic Pseudotrajectory Are InvariantResearch Paper

Stochastic approximation algorithms are recursions xn+1−xn=γn+1(F(xn)+Un+1)x_{n+1}-x_n=\gamma_{n+1}(F(x_n)+U_{n+1})xn+1​−xn​=γn+1​(F(xn​)+Un+1​) driven by small steps γn\gamma_nγn​ and noise Un+1U_{n+1}Un+1​; they include the Robbins–Monro scheme, stochastic gradient methods and learning dynamics in games. The ODE method studies their long-run behaviour by comparing a time-interpolation of the iterates with the…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

Dynamics of Stochastic Approximation Algorithms 1: Limit Sets of Precompact Asymptotic Pseudotrajectories Are Internally Chain TransitiveResearch Paper

A stochastic approximation algorithm updates an estimate by small noisy steps, xn+1−xn=γn+1(F(xn)+Un+1)x_{n+1}-x_n=\gamma_{n+1}(F(x_n)+U_{n+1})xn+1​−xn​=γn+1​(F(xn​)+Un+1​), with step sizes γn→0\gamma_n\to0γn​→0 and noise UnU_nUn​. Such recursions underlie stochastic gradient descent, adaptive control, reinforcement learning (Q-learning, temporal-difference methods) and learning in games (fictitious play, reinforcement…

12 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

Dynamics of Stochastic Approximation Algorithms 2: Under A1 and A2 the Interpolated Process Is an Asymptotic Pseudotrajectory of the Flow of FResearch Paper

A stochastic approximation algorithm is a recursion

9 thms2 active usersReviewed
Geometry & Topology·Captain: LG

Building Anosov flows on 3-manifolds (Béguin–Bonatti–Yu)Research Paper

Anosov flows are the model of uniformly hyperbolic, chaotic continuous-time dynamics: a nonsingular vector field XXX on a closed manifold MMM is Anosov when the tangent bundle splits as TM=Es⊕RX⊕EuTM=E^s\oplus\mathbb RX\oplus E^uTM=Es⊕RX⊕Eu, with EsE^sEs uniformly contracted and EuE^uEu uniformly expanded by the derivative of the flow. They are structurally stable, so one can hope to…

59 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimization·Captain: LG

Lindgren 2022: Dynamic-Programming Price Adjustment and Lyapunov StabilityResearch Paper

In a Walrasian pure exchange economy, agents trade a fixed stock of lll commodities, and a price vector p∈Rlp\in\mathbb R^lp∈Rl is a general equilibrium when aggregate excess demand vanishes. Existence of equilibrium (Arrow–Debreu, 1954) says nothing about how prices reach it. The classical tâtonnement model of Samuelson (1947), dpi/ds=ciZi(p)dp_i/ds = c_i Z_i(p)dpi​/ds=ci​Zi​(p), is not derived…

8 thms2 active usersReviewed
Differential Geometry·Captain: LG

Pugh's Closing LemmaResearch Paper

A periodic point of a map f ⁣:M→Mf\colon M\to Mf:M→M is a point xxx with fn(x)=xf^n(x)=xfn(x)=x for some n≥1n\ge 1n≥1. A nonwandering point is a much weaker form of recurrence: every neighbourhood UUU of xxx eventually returns to meet itself, fn(U)∩U≠∅f^n(U)\cap U\ne\emptysetfn(U)∩U=∅ for some n≥1n\ge 1n≥1. Every periodic point is nonwandering, but a nonwandering point need not be periodic, and the orbit of such a…

8 thms2 active usersReviewed
Captain: LG

The C¹-generic diffeomorphism has trivial centralizer (Bonatti–Crovisier–Wilkinson)Research Paper

Two commuting diffeomorphisms f,gf,gf,g of a manifold MMM share all of their dynamics: ggg permutes the orbits of fff and preserves every smooth and topological invariant of fff. The centralizer of f∈Diffr(M)f\in\mathrm{Diff}^r(M)f∈Diffr(M),

7 thms2 active usersReviewed
Algebraic Geometry·Captain: LG

Albouy–Kaloshin: Finiteness of Planar Five-Body Central ConfigurationsResearch Paper

A central configuration of the Newtonian nnn-body problem is a placement of nnn point masses in which the gravitational acceleration of every body points toward the centre of mass and is proportional to its distance from it. Central configurations generate the only explicitly known solutions of the nnn-body problem (the homographic, or self-similar, motions),…

10 thms2 active usersReviewed
Control TheoryLinear algebra·Captain: mikedeng1

Stabilization for a Perturbed Chain of Integrators in Prescribed Time I: Prescribed-Time Estimates for the Linear Time-Varying FeedbackResearch Paper

Many control tasks have to settle at a given deadline, not merely eventually. Examples are missile guidance, where the interception time is fixed in advance, and rendezvous or consensus manoeuvres that must finish by a scheduled instant. Prescribed-time stabilization asks for a feedback that brings the state of a system to the origin at a time T>0T>0T>0 chosen by…

10 thms2 active usersReviewed
ProbabilityReinforcement LearningStochastic Systems·Captain: mikedeng1

The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning I: Stability and Almost-Sure Convergence under Tapering StepsizesResearch Paper

Stochastic approximation is the family of recursive algorithms that locate a zero of a function observed only through noisy evaluations. It goes back to Robbins and Monro (1951) and today underlies stochastic gradient descent, temporal-difference learning, Q-learning and actor–critic methods in reinforcement learning, and models of learning by boundedly…

17 thms2 active usersReviewed
🏆Completed
Number TheoryProbability·Captain: mysticflounder

Tao 2022: Almost All Collatz Orbits Attain Almost Bounded ValuesResearch Paper

The Collatz map sends an even positive integer nnn to n/2n/2n/2 and an odd one to 3n+13n+13n+1. The Collatz conjecture asserts that every orbit of this map eventually reaches 111. It remains an open problem.

15 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Einstein's Static Universe: the Λ\LambdaΛ Balance and Its InstabilityTextbook

The cosmological constant Λ\LambdaΛ entered physics in 1917, when Einstein added a term Λgμν\Lambda g_{\mu\nu}Λgμν​ to his field equations in order to allow a spatially homogeneous universe that neither expands nor contracts (Einstein, Kosmologische Betrachtungen zur allgemeinen Relativitätstheorie, 1917). The resulting Einstein static universe is the unique balance…

10 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Coupling Constant: One-Loop Running, Asymptotic Freedom and the Landau PoleTextbook

A coupling constant is the number that fixes the strength of an interaction: it is the coefficient that multiplies the interaction term of a Lagrangian relative to its kinetic term, and in a perturbative treatment it is the parameter the expansion is organised in. The central structural fact about such a coupling in a quantum field theory is that it is not…

9 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Celestial Mechanics I: Binary Star SystemsTextbook

Roughly half of the stars in our galaxy belong to binary star systems: pairs of stars close enough to each other that their mutual gravitational attraction dominates every other influence, and far enough from every other star that the rest of the galaxy can be ignored. Such a pair is the cleanest physical realization of the Newtonian two-body problem, and…

8 thms2 active usersReviewed
🏆Completed
Captain: LG

An Introduction to Chaotic Dynamical Systems II: Sarkovskii's TheoremTextbook

In 1964 A. N. Sarkovskii proved a theorem about continuous maps of the real line that is remarkable both for how little it assumes — continuity, nothing more — and for how much it concludes: the set of periods of the periodic orbits of such a map is completely constrained by a single linear ordering of the positive integers. Its best-known corollary,…

12 thms2 active usersReviewed
🏆Completed
Captain: LG

An Introduction to Chaotic Dynamical Systems I: Chaos in the Quadratic FamilyTextbook

The word chaos entered mathematics with a precise meaning, and Robert L. Devaney's An Introduction to Chaotic Dynamical Systems (2nd edition, Westview Press, 2003) is the text that fixed the meaning now used in most of the literature: a map is chaotic when it is unpredictable (sensitive dependence on initial conditions), indecomposable (topological…

21 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: LG

Kawahira: The Riemann Hypothesis and Holomorphic Index in Complex DynamicsResearch Paper

The Riemann hypothesis asserts that every non-trivial zero of the Riemann zeta function ζ\zetaζ lies on the line Re⁡s=1/2\operatorname{Re} s = 1/2Res=1/2; the simplicity hypothesis asserts in addition that every such zero is a simple zero of ζ\zetaζ. Both are statements about the location and the order of a discrete set of points in the complex plane, and almost every…

22 thms2 active usersReviewed
🏆Completed
Group TheoryTopology·Captain: dbenbenn

Brin–Squier: the group of piecewise-linear homeomorphisms of the line with finitely many breakpoints has no free subgroup of rank greater than oneResearch Paper

Von Neumann introduced amenability in 1929 in response to the Banach–Tarski paradox: a group is amenable when it carries a finitely additive, translation-invariant probability measure on its subsets, and no amenable group contains a free subgroup of rank 222 — which is exactly what the paradox needs. The converse is the von Neumann conjecture, and it is…

32 thms2 active usersReviewed
Control TheoryMathematical LogicTheoretical Computer Science·Captain: Shuze Chen

Global asymptotic stability of homogeneous polynomial vector fields is undecidableResearch Paper

A differential equation can have a simple finite description while its solutions have complicated long-term behavior. In control theory, one basic question is whether every state eventually approaches an equilibrium and whether starting close to it guarantees remaining close. An algorithm answering that question for every polynomial vector field would…

22 thms1 active userReviewed
Complexity TheoryNumerical AnalysisTheoretical Computer Science·Captain: iris

One Polynomial Field for Every Euler Step and the Flow: Polynomial Dynamics for PTIME and PSPACEResearch Paper

Ordinary differential equations with polynomial right-hand sides are a model of analog computation: chemical reaction networks, the General Purpose Analog Computer and continuous-time recurrent networks all reduce to them. Since Graça, Campagnolo and Buescu (2008) and Bournez, Graça and Pouly (2017) it is known that polynomial ODEs simulate Turing machines…

32 thms1 active userReviewed
PreviousPage 6 of 8Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me