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
Differential Geometry·Captain: marwahaha

A zero-entropy system without a smooth positive-volume modelOpen Problem

A measure-preserving system may have low information production yet fail to admit a smooth realization. The target asks for a single ergodic system excluding every finite-dimensional smooth positive-volume model. The source manuscript presents the surrounding research claim.

5 thms2 active usersReviewed
🏆Completed
Algebraic Topology·Captain: marwahaha

A C^1 Counterexample to the Entropy ConjectureOpen Problem

Topological entropy measures orbit complexity, whereas the induced map on homology measures algebraic growth. The mission asks for a C¹ self-map where these two measurements violate the proposed entropy lower bound. The source manuscript presents the surrounding research claim.

4 thms2 active usersReviewed
🏆Completed
Analysis·Captain: marwahaha

Positive Metric Entropy for the Standard Map at Large ParametersOpen Problem

The standard map is a concrete area-preserving torus system whose global chaotic behavior is difficult to infer from local stretching. The target asks for positive metric entropy along an entire large-parameter tail. The source manuscript presents the surrounding research claim.

22 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: marwahaha

Equidistribution of Prime-Degree Torus Packets with Arbitrary Local TypeOpen Problem

Closed diagonal orbits encode lattices in totally real number fields. Their distribution tests whether arithmetic families fill the space of unimodular lattices as their discriminants grow. The source manuscript presents the surrounding research claim.

13 thms2 active usersReviewed
🏆Completed
Functional Analysis·Captain: wurtle

Invariant-projection counterexamples for every irrational rotationResearch Paper

The invariant subspace problem asks whether every bounded operator on a separable infinite-dimensional complex Hilbert space has a nontrivial closed invariant subspace. Inside a finite von Neumann algebra there is a sharper, algebra-relative version: given TTT in a type II1\mathrm{II}_1II1​ factor MMM, is there a projection p∈Mp\in Mp∈M with 0<τ(p)<10<\tau(p)<10<τ(p)<1 and (1−p)Tp=0(1-p)Tp=0(1−p)Tp=0, i.e.…

43 thms2 active usersReviewed
🏆Completed
Mathematical PhysicsProbability·Captain: wurtle

The sharp factor-of-IID threshold for the free Ising model on regular treesResearch Paper

A random configuration on the vertices of a graph is a factor of IID if it can be produced by a measurable rule from independent uniform labels at the vertices, where the rule commutes with the graph's automorphisms. On trees this notion connects ergodic theory (which invariant processes are "Bernoulli-like"), local algorithms on sparse random graphs…

26 thms2 active usersReviewed
🏆Completed
Graph TheoryProbability·Captain: wurtle

The free uniform spanning forest is a factor of IIDResearch Paper

A uniform spanning tree of a finite connected graph is a spanning tree chosen uniformly at random. On an infinite graph one takes limits along finite pieces: the free uniform spanning forest (FUSF) is the weak limit of uniform spanning trees of an increasing sequence of finite connected subgraphs, with no boundary identification. Uniform spanning forests…

11 thms2 active usersReviewed
🏆Completed
Pure Mathematics·Captain: wurtle

Ergodicity of triangular billiards with an irrational angleResearch Paper

A billiard in a polygon is a point moving at unit speed inside the table and reflecting off the sides by the law "angle of incidence equals angle of reflection". It is one of the simplest Hamiltonian systems and a standard model in mathematical physics; triangles also model two point masses colliding on a segment. The natural invariant probability measure…

2 thms2 active usersReviewed
🏆Completed
Analysis·Captain: wurtle

Boundedness and persistence of weakly reversible mass-action systemsResearch Paper

Chemical reaction network theory studies the polynomial differential equations that describe concentrations of interacting species under mass-action kinetics, where each reaction proceeds at a rate proportional to the product of the concentrations of its reactants. A central theme is which properties of the dynamics are forced by the structure of the…

2 thms2 active usersReviewed
🏆Completed
Probability·Captain: wurtle

Rokhlin's multiple-mixing problem for one transformationResearch Paper

Mixing is the basic notion of asymptotic independence in ergodic theory: a measure-preserving transformation TTT is mixing if the event AAA at time 000 and the event BBB at time nnn become independent as n→∞n\to\inftyn→∞. Mixing of order kkk asks the same for kkk events at times whose gaps all tend to infinity. In 1949 Rokhlin introduced higher-order mixing and asked whether…

6 thms2 active usersReviewed
🏆Completed
Functional AnalysisHarmonic Analysis·Captain: wurtle

A smooth three-torus diffeomorphism with simple Lebesgue spectrumResearch Paper

A measure-preserving transformation TTT of a probability space acts on square-integrable functions by the Koopman operator UTg=g∘TU_Tg=g\circ TUT​g=g∘T, a unitary operator. Its spectral type (discrete, singular continuous, absolutely continuous) and its multiplicity are basic invariants of ergodic theory. The Lebesgue spectrum is the spectral type of the shift on …

4 thms2 active usersReviewed
🏆Completed
Analysis·Captain: wurtle

Two limit cycles for quintic Liénard systemsResearch Paper

A limit cycle of a planar vector field is a periodic orbit that is isolated among periodic orbits. The second part of Hilbert's sixteenth problem asks how many limit cycles a polynomial vector field of a given degree can have, and it is open even for quadratic fields. The classical Liénard systems

9 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryLinear algebra·Captain: mikedeng1

Uncoupled Dynamics Do Not Lead to Nash Equilibrium 2: Near Jordan's Three-Player Game Γ₀ of Section III, No Uncoupled Dynamic Is Nash-ConvergentResearch Paper

A central question of the theory of learning in games is whether simple adaptive behavior leads players to a Nash equilibrium. Many natural dynamics — fictitious play, best-reply dynamics, replicator dynamics — fail to converge in some games, and the failures are usually exhibited one dynamic at a time. Hart and Mas-Colell (AER 2003) asked a structural…

6 thms2 active usersReviewed
🏆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
🏆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
🏆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
🏆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
PreviousPage 4 of 5Next

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