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
AnalysisControl Theory·Captain: mikedeng1

Ordinary Differential Equations and Dynamical Systems V: Limit Sets and the Krasovskii–LaSalle PrincipleTextbook

Most differential equations that model physical, biological or engineered systems cannot be solved in closed form, yet the question asked about them is usually qualitative: does the system settle down to an equilibrium, and does it stay near the equilibrium when perturbed? Liapunov's direct method answers that question without solving the equation, by…

19 thms3 active usersReviewed
🏆Completed
Analysis·Captain: mikedeng1

Ordinary Differential Equations and Dynamical Systems I: Existence, Uniqueness and Peano's TheoremTextbook

Almost every quantitative statement about an ordinary differential equation, from the stability of an equilibrium to the existence of a periodic orbit, presupposes that the equation has a solution through each initial point and, usually, that this solution is unique and depends continuously on the data. Chapter 2 of Gerald Teschl's graduate textbook Ordinary…

10 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryProbabilityStochastic Systems·Captain: mikedeng1

On the Global Convergence of Stochastic Fictitious Play II: Almost Sure Convergence in Zero-Sum Games and Symmetric Games with an Interior ESSResearch Paper

Fictitious play is the oldest model of learning in games: players repeatedly play a fixed normal form game, and each round every player best-responds to the empirical frequencies of the opponents' past play. Brown (1951) proposed it as an algorithm for computing the value of a zero-sum game, and Robinson (1951) proved that the empirical frequencies converge…

12 thms3 active usersReviewed
🏆Completed
Control TheoryGraph TheoryLinear algebra·Captain: mikedeng1

On Controllability of Delayed Boolean Control Networks: Trajectory Controllability Avoiding Forbidden Trajectories Iff the Reduced Transition-Count Matrix Is IrreducibleResearch Paper

Boolean networks model gene regulatory networks by giving each gene an on/off value and updating all values synchronously by logical rules (Kauffman, 1969). Adding external Boolean inputs gives Boolean control networks (BCNs), in which a designer (a drug, an intervention) chooses the inputs over time. The basic control-theoretic question is controllability:…

9 thms3 active usersReviewed
🏆Completed
Group Theory·Captain: dbenbenn

Cannon–Floyd–Parry: Thompson's group F and the simplicity of its commutator subgroupTextbook

This mission formalizes §4 of Cannon, Floyd and Parry's Introductory notes on Richard Thompson's groups, together with the definition of Thompson's group FFF from their §1. The goal is their Theorem 4.5: the commutator subgroup [F,F][F,F][F,F] is simple.

34 thms3 active usersReviewed
🏆Completed
AnalysisControl Theory·Captain: chenyu

End-to-End Metabolic Control Analysis in Lean 4Research Paper

Metabolic control analysis (MCA) describes how changes in enzyme activities propagate through a biochemical network. It is used to separate local biochemical sensitivity from global system-level control, which is relevant to pathway engineering, drug-target analysis, and quantitative interpretation of steady-state experiments. The summation and connectivity…

5 thms2 active usersReviewed
AnalysisOptimization·Captain: iris

Desingularization of the Sweeping Process Mapping: Desingularizing the Oriented Coderivative ⇔ Uniform Length Control of Orbits ⇔ Bounded Lengths of Piecewise Orbits ⇔ Integrable Oriented TalwegResearch Paper

A sweeping process is the evolution of a point that is pushed by a moving set: given a set-valued map S:R⇉RnS:\mathbb R\rightrightarrows\mathbb R^nS:R⇉Rn, an orbit γ\gammaγ stays in S(t)S(t)S(t) and moves only along inner normals of S(t)S(t)S(t). J.-J. Moreau introduced the model in the 1970s for elastoplasticity and unilateral mechanics, and it is now a standard object of nonsmooth…

27 thms2 active usersReviewed
🏆Completed
Differential GeometryGeometry & Topology·Captain: dbenbenn

A counterexample to Viterbo's conjecture (Haim-Kislev–Ostrover 2026)Research Paper

This mission formalizes P. Haim-Kislev and Y. Ostrover, A counterexample to Viterbo's conjecture, Ann. of Math. (2) 203 (2026) 603–622, doi:10.4007/annals.2026.203.2.5 (arXiv:2405.16513v3, whose page numbers are used).

31 thms2 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: Shuze Chen

Stability of Queueing Networks IV: Stability of FIFO Networks of Kelly TypeTextbook

In a queueing network, spare average capacity at every station does not by itself guarantee that queues remain stable. Jobs move between stations, and the service discipline affects how congestion propagates. Bramson gives examples of subcritical networks that are unstable, including examples with first-in, first-out service. The distinction matters when…

18 thms2 active usersReviewed
🏆Completed
AnalysisOptimization·Captain: mikedeng1

Examples of Pathological Dynamics of the Subgradient Method for Lipschitz Path-Differentiable Functions: A Bounded Subgradient Sequence That Does Not Converge for a Whitney-Stratifiable KŁ FunctionResearch Paper

The small-step subgradient method is the basic algorithm for minimizing a nonsmooth, nonconvex, locally Lipschitz function f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R. It is also the scheme behind stochastic gradient training of neural networks with nonsmooth activations. From a starting point x0x_0x0​ it iterates

18 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryEconomics·Captain: mikedeng1

Network Externalities and Market Dominance: Under In/Out Demand the Impulse Selects the Introspective Equilibrium by Its Position Relative to the Middle EquilibriumResearch Paper

Markets with network externalities can support several levels of adoption at the same price. A consumer's willingness to buy may rise when many other consumers buy, while the ordinary price effect still works in the opposite direction. A price and an aggregate demand curve can therefore identify several self-consistent quantities without identifying which…

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

Minimum Earnings Regulation and the Stability of Marketplaces II: Without Subsidies a Utilization Shock u₀ Can Be Absorbed Exactly When u₀ ≥ M/J(C(M))Research Paper

In 2018 New York City's Taxi and Limousine Commission adopted a minimum earnings rule for ride-hailing drivers: each platform must pay drivers, per hour spent with a passenger, at least a target hourly earnings level divided by the platform's measured driver utilization in the previous period. The rule ties next period's wage floor to this period's idle…

6 thms2 active usersReviewed
🏆Completed
EconomicsOperations ResearchOptimization·Captain: mikedeng1

Minimum Earnings Regulation and the Stability of Marketplaces III: A Minimum Earnings Marketplace Is Dynamically Stable Exactly When It Is Statically StableResearch Paper

In 2018 New York City's Taxi and Limousine Commission (TLC) imposed a minimum pay formula on the largest ride-hailing platforms, following a proposal by Parrott and Reich (2018): the pay per minute and per mile driven is divided by the platform's utilization rate, the fraction of drivers' working time spent carrying passengers. Seattle adopted a similar…

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

Alexander–Temple–Vogler 2025: Instability of the Critical Friedmann Spacetime at the Big BangResearch Paper

The Friedmann spacetimes (FLRW spacetimes) are the explicit, spatially homogeneous and isotropic solutions of Einstein's field equations on which standard Big Bang cosmology is built. Under a pressureless (dust, p=0p=0p=0) equation of state they form a family indexed by a curvature parameter kkk: the critical spacetime k=0k=0k=0, the underdense spacetimes k<0k<0k<0 and the…

13 thms2 active usersReviewed
Topology·Captain: LG

C^r Stability Conjecture (Palis–Smale)Open Problem

Structural stability asks when the qualitative behaviour of a dynamical system survives small perturbations. A diffeomorphism fff of a closed manifold is structurally stable if every diffeomorphism ggg close enough to fff is topologically conjugate to fff: some homeomorphism hhh of the manifold satisfies h∘f=g∘hh\circ f=g\circ hh∘f=g∘h, so that hhh carries orbits of fff onto orbits of …

12 thms2 active usersReviewed
Captain: LG

Palis Conjecture: Denseness of Finitude of AttractorsOpen Problem

A basic aim of the theory of dynamical systems is to describe the long-term behaviour of typical orbits of typical systems. In the 1960s Smale's programme hoped that hyperbolic (structurally stable) systems would be dense, so that the asymptotic behaviour of a dense set of systems would be described by finitely many hyperbolic pieces. This hope fails: there…

13 thms2 active usersReviewed
Topology·Captain: LG

C^r Closing Lemma for DiffeomorphismsOpen Problem

A central question in smooth dynamics is how much of the long-term behaviour of a system is captured by its periodic orbits. Every periodic point is nonwandering (each of its neighbourhoods returns to itself under some iterate), but a nonwandering point need not be periodic. The closing lemma asks whether this gap can be removed by an arbitrarily small…

5 thms2 active usersReviewed
🏆Completed
Linear algebra·Captain: LG

Dynamic Stochastic General Equilibrium I: The Taylor Principle and DeterminacyTextbook

Dynamic stochastic general equilibrium (DSGE) models are the standard framework used by central banks and fiscal authorities for policy analysis and forecasting (Wikipedia overview). The models used for monetary-policy analysis are built from three interrelated blocks — demand, supply and a monetary-policy rule — that jointly determine output, inflation and…

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Understanding the Acceleration Phenomenon via High-Resolution Differential Equations V: Along the High-Resolution ODE of NAG-C, inf ‖∇f(X(u))‖² ≤ (12 + 9sL)‖x₀ − x⋆‖²/(2√s(t³ − t₀³))Research Paper

Nesterov's accelerated gradient method for smooth convex functions, called NAG-C in the source paper, minimizes an LLL-smooth convex function fff with function values decreasing at the rate O(L/k2)O(L/k^2)O(L/k2). That rate is optimal among first-order methods (Nesterov, 1983). A line of work starting with Su, Boyd & Candès (2016) studies such methods through ordinary…

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

Propagation of Chaos for Stochastic Spatially Structured Neuronal Networks with Delay driven by Jump Diffusions 2: The Neuronal Network Converges in L² to Its McKean–Vlasov LimitResearch Paper

Large networks of neurons are often modelled as systems of coupled stochastic differential equations: each neuron carries a low-dimensional state (a membrane potential and recovery variables, as in the FitzHugh–Nagumo model), receives synaptic input from the other neurons with a transmission delay, and is perturbed by noise. Because the number of neurons is…

15 thms2 active usersReviewed
Control TheoryGraph TheoryLinear algebra·Captain: mikedeng1

Sub/Super-Stochastic Matrix with Applications to Bipartite Tracking Control over Signed Networks 3: ψ < 1/(τd_M), Structural Balance and Leader Reachability Give Asynchronous Bipartite TrackingResearch Paper

Networks of agents that interact both cooperatively and competitively are modelled by signed graphs: a positive edge weight means that one agent moves towards another, a negative weight means that it moves towards the other's opposite. Since Altafini's work on consensus over antagonistic networks (IEEE TAC 2013), the standard target on such networks has…

9 thms2 active usersReviewed
AnalysisStochastic Systems·Captain: mikedeng1

On Well-Posedness of Forward–Backward SDEs—A Unified Approach 3: With Constant Coefficients, σ₃ ≠ 0, σ₃h ≠ 1 the Dominating ODE Keeps y and (1 − σ₃y)⁻¹ Bounded for Every T Iff One of Four Cases HoldsResearch Paper

A forward–backward stochastic differential equation (FBSDE) couples a forward diffusion XXX with a backward equation for a pair (Y,Z)(Y,Z)(Y,Z) whose terminal value depends on XTX_TXT​. Such systems arise from the stochastic maximum principle, from option pricing with large investors, and from stochastic differential games. Whether an FBSDE with Lipschitz coefficients has a…

14 thms2 active usersReviewed
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
PreviousPage 4 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