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
Control TheoryGraph TheoryLinear algebra·Captain: mikedeng1

Synchronization via Pinning Control on General Complex Networks II: Componentwise LMIs on the Strongly Connected Components Globally Synchronize a Pinned Network with a Directed Spanning TreeResearch Paper

Networks of identical dynamical systems coupled along a directed graph model power grids, sensor and robot swarms, neural populations and coupled oscillators. A basic control question is how to steer every node of such a network onto a prescribed reference trajectory by acting directly on only a few nodes. This is pinning control: feedback is injected at a…

7 thms2 active usersReviewed
Harmonic AnalysisMachine LearningProbability·Captain: mikedeng1

Approximation Bounds for Random Neural Networks and Reservoir Systems II: Echo State Networks with Random Weights Approximate Regular Functionals with an Explicit L² Error Bound (Theorem 2)Research Paper

Reservoir computing learns an input/output system from data in two stages. A dynamical system, the reservoir, is driven by the input sequence and its state is recorded; then only a linear readout of that state is trained, by least squares. The echo state network (ESN) is the most widely used reservoir: its state evolves by …

11 thms2 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

Approximation Bounds for Random Neural Networks and Reservoir Systems III: Echo State Networks with Output Feedback and Random Weights Approximate Contracting Reservoirs (Theorem 4)Research Paper

An echo state network with output feedback is a recurrent model whose previous output is fed back into its next hidden-state update. In reservoir computing only the linear output weights are trained, while the internal weights are fixed, typically after being drawn at random. This raises a quantitative question: if the internal rows are sampled from a fixed…

8 thms2 active usersReviewed
AnalysisControl TheoryOperations Research·Captain: mikedeng1

Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications 2: Regular Initial Opinions Converge to Clusters with |B − A| ≥ 1 + min{W_A, W_B}/max{W_A, W_B}Research Paper

Bounded-confidence opinion dynamics model a population in which each agent repeatedly moves its opinion towards the opinions of those agents whose views lie within a fixed distance of its own. Introduced in discrete time by Krause (1997) and studied as the Hegselmann–Krause model, these systems are a standard test case for multi-agent coordination with state…

11 thms2 active usersReviewed
Machine LearningOptimizationProbability·Captain: mikedeng1

Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization 5: Decreasing-Step Adam Converges Almost Surely to the Critical Points of FResearch Paper

Adam (Kingma and Ba, 2015) is the default optimizer for training neural networks: a stochastic gradient method that keeps an exponential moving average mnm_nmn​ of past gradients and an exponential moving average vnv_nvn​ of their coordinatewise squares, and divides the first by the square root of the second. Its practical success came well before any convergence…

16 thms2 active usersReviewed
Machine LearningOptimization·Captain: mikedeng1

Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization 2: The Continuous-Time Adam Trajectory Converges to the Critical Points of FResearch Paper

Adam (Kingma and Ba, 2015) is the default optimizer for training neural networks. At step nnn it keeps an exponential moving average mnm_nmn​ of stochastic gradients and an exponential moving average vnv_nvn​ of their squared coordinates, corrects both for their initialization at zero (the bias correction or debiasing step), and moves the iterate by …

14 thms2 active usersReviewed
Convex OptimizationOptimization·Captain: mikedeng1

First-Order Optimization Algorithms via Inertial Systems with Hessian Driven Damping I: Under (G₂)–(G₃), (DIN-AVD)α,β,b Trajectories Satisfy f(x(t)) − min f = O(1/(t²w(t)))Research Paper

Accelerated first-order methods for convex minimization, starting with Nesterov's 1983 scheme, reach the rate f(xk)−min⁡f=O(1/k2)f(x_k)-\min f=\mathcal O(1/k^2)f(xk​)−minf=O(1/k2), which is optimal for the class of convex functions with Lipschitz gradient. Su, Boyd and Candès (NIPS 2014; JMLR 2016) showed that Nesterov's method is a discretization of the second-order ODE …

7 thms2 active usersReviewed
Machine LearningOptimization·Captain: mikedeng1

Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization 3: Under a Łojasiewicz Condition the Adam ODE Converges to One Critical Point at Rate t^(−θ/(1−2θ))Research Paper

Adam (Kingma and Ba, 2015) is the default optimizer for training neural networks. At each step it keeps an exponential moving average mmm of stochastic gradients and an exponential moving average vvv of their squared coordinates, corrects both for their initialization at zero (the bias correction), and moves the iterate by …

9 thms2 active usersReviewed
Numerical AnalysisOptimization·Captain: mikedeng1

Differential Variational Inequalities 3: For a Cone K and a Strongly Monotone Composite F, the Time-Stepping Iterates Exist, Are Unique and Are Uniformly BoundedResearch Paper

A differential variational inequality (DVI) couples an ordinary differential equation with a finite-dimensional variational inequality whose solution enters the dynamics as a control. Contact mechanics with friction, electrical circuits with diodes, dynamic traffic equilibria, hybrid engineering systems and the continuous-time limits of Nash games all have…

10 thms2 active usersReviewed
Control TheoryGraph Theory·Captain: mikedeng1

Synchronization and Transient Stability in Power Networks and Nonuniform Kuramoto Oscillators 3: Identical ω_i/D_i and Zero Phase Shifts Give Exponential Phase SynchronizationResearch Paper

Networks of coupled oscillators model generators in an electric power grid, pacemaker cells, Josephson junction arrays and many other systems in which units with their own rhythm interact through their phase differences. Dörfler and Bullo (arXiv:0910.5673v4; SIAM J. Control Optim. 50(3), 2012, doi:10.1137/110851584) show that, after a singular-perturbation…

13 thms2 active usersReviewed
Numerical AnalysisOptimization·Captain: mikedeng1

Differential Variational Inequalities 2: Uniformly Bounded Euler Time-Stepping Iterates Converge Along a Subsequence, and Every Limit Is a Weak Solution of the Initial-Value DVIResearch Paper

A differential variational inequality (DVI) couples an ordinary differential equation with a finite-dimensional variational inequality whose solution acts as an algebraic input to the dynamics. The class contains linear complementarity systems, mechanical systems with unilateral contact and friction, dynamic Nash games and many hybrid engineering models.…

9 thms2 active usersReviewed
AnalysisControl Theory·Captain: mikedeng1

Small Gain Theorems for Large Scale Systems and Construction of ISS Lyapunov Functions 2: Under the Small Gain Condition Γ_μ ≱ id, an Ω-Path ExistsResearch Paper

A large control system is often built from many subsystems Σ1,…,Σn\Sigma_1,\dots,\Sigma_nΣ1​,…,Σn​, each of which is input-to-state stable (ISS) with respect to the states of the others. Whether the interconnection is again ISS is decided by a small gain condition on the matrix of interconnection gains. For two subsystems this goes back to Jiang, Teel and Praly (1994) and…

18 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
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
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
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
Operations ResearchProbability·Captain: iris

Dense Orbits of the Bayesian Updating Group Action: with at least as many signals as states, a generic signalling structure makes the orbit of every interior prior dense in the simplexResearch Paper

A decision maker holds a prior over a finite set of states, observes a signal, and moves to a posterior by Bayes' rule. Repeating this step is the standard model of learning in decision theory and in repeated games of incomplete information. Hellman and Levy (Dense Orbits of the Bayesian Updating Group Action) study this process through topological…

7 thms1 active userReviewed
Control Theory·Captain: iris

On Convergence of the Nonlinear Active Disturbance Rejection Control for MIMO Systems: global convergence of nonlinear ADRC, eventual O(ε) tracking and extended-state-observer errorsResearch Paper

Active disturbance rejection control (ADRC) is a feedback design in which an observer estimates, in real time, not only the state of an uncertain plant but also its total disturbance: the combined effect of unmodelled dynamics, external disturbances and the mismatch between the true and the nominal control gains. The controller cancels this estimate and…

34 thms1 active userReviewed
Group TheoryRepresentation Theory·Captain: LG

Spectral Gap Conjecture (Wikipedia): Random Elements of SU(2)Open Problem

Finitely many rotations of the sphere generate a group whose orbits are typically dense. A basic quantitative question is how fast those orbits fill the sphere: after words of length ℓ\ellℓ in the generators, how uniformly are the points spread? The answer is controlled by the spectral gap of an averaging operator built from the generators. The question goes…

5 thms1 active userReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Propagation of Chaos for Stochastic Spatially Structured Neuronal Networks with Delay driven by Jump Diffusions 1: The Spatially Structured McKean–Vlasov Delay Equation with Jumps Is Well-PosedResearch Paper

Networks of conductance-based neurons, such as FitzHugh–Nagumo networks, are modelled by systems of stochastic differential equations in which each neuron interacts with the others through synapses, and the signal from one neuron reaches another only after a transmission delay. Biological neurons sit at positions in space, belong to a few distinct subpopulat…

17 thms1 active userReviewed
PreviousPage 2 of 3Next

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