Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Analysis

363 missions · 270 completed

Missions

Open93Completed270All363
🏆Completed
Operations Research·Captain: mikedeng1

Regret in Decision Making under Uncertainty 1: Under Assumptions 2 and 3, Utility over Final and Foregone Assets Takes the Regret Form u(x, y) = αv(x) + f(v(x) − v(y))Research Paper

Expected utility theory predicts that a decision maker's choice between two lotteries depends only on the distribution of final wealth under each. Observed behaviour contradicts this in systematic ways: the Allais paradox, the coexistence of insurance and gambling, and the reflection effect documented by Kahneman and Tversky (1979). David Bell's 1982 paper (…

10 thms3 active usersReviewed
🏆Completed
Differential GeometryOptimization·Captain: mikedeng1

Projection-like Retractions on Matrix Manifolds II: The Metric Projection onto a C^k Submanifold Is Locally Unique and C^(k−1), so Projecting a Tangent Step Is a RetractionResearch Paper

Many optimization problems in statistics, signal processing and control are posed over sets of matrices with a constraint that makes them curved: matrices of fixed rank, matrices with orthonormal columns, symmetric matrices with a prescribed spectrum. Algorithms on such sets ("optimization on manifolds") compute a step in the tangent space at the current…

8 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization+2·Captain: mikedeng1

Stochastic Optimal Control: The Discrete-Time Case VI: Lower Semianalytic Functions — Analytically Measurable ε-Optimal Selectors (Jankov–von Neumann)Textbook

Dynamic programming over uncountable state and control spaces needs two things at every stage: the optimal cost-to-go, obtained by minimizing over the control, must be a function that can be integrated against the next stage's transition probabilities, and a policy that nearly attains the minimum must be measurable, so that it defines a stochastic process.…

8 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization+2·Captain: mikedeng1

Stochastic Optimal Control: The Discrete-Time Case V: Semicontinuous Functions — a Borel-Measurable Minimizing Selector for Lower Semicontinuous CostsTextbook

Every step of the dynamic programming algorithm on a general state space does three things: it takes a conditional expectation of the cost-to-go under a transition kernel, it minimizes the resulting function of state and control over the control, and, if a policy is to be produced, it picks a control for each state that attains or nearly attains that…

10 thms3 active usersReviewed
🏆Completed
Functional AnalysisMachine Learning·Captain: mikedeng1

Theory of Reproducing Kernels II: One Reproducing Kernel Class Contains Another iff a Multiple of Its Kernel Dominates the Other KernelResearch Paper

A reproducing kernel Hilbert space (RKHS) is a Hilbert space of functions in which evaluation at each point is a continuous functional. Each such space is determined by its kernel, and in practice spaces are usually given by their kernels: Gaussian or Sobolev kernels in kernel methods and Gaussian-process regression, the Bergman and Szegő kernels in complex…

14 thms3 active usersReviewed
🏆Completed
Calculus of VariationsFunctional AnalysisOptimization·Captain: mikedeng1

On the Variational Principle I: Near Every ε-Minimizer of a Lower Semicontinuous Function Bounded Below on a Complete Metric Space Lies a Strict Minimizer of F + (ε/λ)d(v, ·)Research Paper

A function that is bounded below need not attain its infimum: exe^xex on R\mathbb{R}R has infimum 000 and no minimizer. The classical "variational principle" says that at a minimizer uˉ\bar uuˉ of a differentiable functional, F′(uˉ)=0F'(\bar u)=0F′(uˉ)=0. Without compactness there may be no minimizer, and the principle has nothing to say. In 1974 Ivar Ekeland showed that a weaker…

6 thms3 active usersReviewed
🏆Completed
Functional AnalysisMachine Learning·Captain: mikedeng1

Theory of Reproducing Kernels III: The Product of Two Reproducing Kernels Is the Kernel of the Diagonal Restrictions of the Direct ProductResearch Paper

A reproducing kernel is the function K(x,y)K(x,y)K(x,y) that represents point evaluation in a Hilbert space of functions: f(y)=(f,K(⋅,y))f(y) = (f, K(\cdot, y))f(y)=(f,K(⋅,y)). Kernels are combined all the time. In machine learning, a kernel on pairs of objects is routinely built as the pointwise product of two simpler kernels, and in complex analysis the product ∣K(x,y)∣2=K(x,y)K(y,x)|K(x,y)|^2 = K(x,y)K(y,x)∣K(x,y)∣2=K(x,y)K(y,x) of a…

9 thms3 active usersReviewed
🏆Completed
Functional AnalysisMachine Learning·Captain: mikedeng1

Theory of Reproducing Kernels I: The Sum of Two Reproducing Kernels Is the Kernel of the Sum Class with the Minimal-Decomposition NormResearch Paper

Reproducing kernel Hilbert spaces are Hilbert spaces of functions in which evaluation at a point is a continuous linear functional. They appear wherever a space of functions carries a natural quadratic norm: Bergman and Hardy spaces of analytic functions, spaces of harmonic functions and solutions of elliptic equations, Sobolev spaces in one dimension, and,…

8 thms3 active usersReviewed
🏆Completed
Markov ChainOperations ResearchProbability+1·Captain: mikedeng1

Fundamentals of Queueing Theory III: The Transient M/M/1 Queue via Modified Bessel FunctionsTextbook

Steady-state formulas describe a queue that has been running forever. Many practical questions are about a queue that has not: a call centre just after opening, a server just after a reset, a system under a burst of load. For these, the relevant quantity is the transient distribution pn(t)=Pr⁡{N(t)=n}p_n(t) = \Pr\{N(t) = n\}pn​(t)=Pr{N(t)=n} of the number N(t)N(t)N(t) in the system at a finite time …

15 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Minimization Methods for Non-Differentiable Functions II: Convex Functions Are Almost Differentiable and Their Almost-Gradients Are SubgradientsTextbook

Gradient methods assume a continuous gradient; subgradient methods assume convexity. Many objective functions met in practice satisfy neither. Shor's example is economic planning, where components of the objective are piecewise-smooth, not necessarily convex functions of a parameter describing the productivity of a unit, and where minimax formulations…

9 thms3 active usersReviewed
🏆Completed
Probability·Captain: mikedeng1

Stochastic Dynamic Programming and the Control of Queueing Systems XII: A Tauberian Theorem Linking Abel and Cesàro Means of Nonnegative SeriesTextbook

In the theory of Markov decision chains two cost criteria dominate: the discounted cost, in which a cost incurred at time nnn is weighted by αn\alpha^nαn for a discount factor α∈(0,1)\alpha \in (0,1)α∈(0,1), and the average cost, the long-run cost per unit time. A standard route to average cost optimal policies is to solve the discounted problem and let α→1−\alpha \to 1^-α→1−. That…

14 thms3 active usersReviewed
🏆Completed
Probability·Captain: mikedeng1

Stochastic Dynamic Programming and the Control of Queueing Systems XI: The Generalized Dominated Convergence Theorem for Approximating DistributionsTextbook

Linn Sennott's Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999) studies Markov decision chains with countably many states, finite action sets and unbounded nonnegative costs. Its main computational device, the approximating sequence method (Definition 2.5.1, p. 28), replaces the countable state space SSS by an increasing…

12 thms3 active usersReviewed
🏆Completed
Functional AnalysisMathematical PhysicsPartial Differential Equations·Captain: mikedeng1

Mathematical Methods in Quantum Mechanics XII: Self-Adjointness and Essential Spectrum of One-Particle Schrödinger OperatorsTextbook

The Hamiltonian of a single nonrelativistic particle in Rn\mathbb R^nRn moving in a potential VVV is the Schrödinger operator H=−Δ+VH = -\Delta + VH=−Δ+V acting in L2(Rn)L^2(\mathbb R^n)L2(Rn). Before anything can be said about the dynamics or the energy levels of such a particle, one must know that HHH is a genuine observable: a self-adjoint operator on a specified domain. For potentials…

20 thms3 active usersReviewed
🏆Completed
Functional AnalysisMathematical Physics·Captain: mikedeng1

Mathematical Methods in Quantum Mechanics V: Stone's Theorem and the RAGE TheoremTextbook

In quantum mechanics the state of a system at time ttt is ψ(t)=e−itAψ\psi(t) = \mathrm e^{-\mathrm itA}\psiψ(t)=e−itAψ, where the Hamiltonian AAA is a self-adjoint operator. The spectral theorem splits the Hilbert space into subspaces according to the type of the spectral measure of a vector (absolutely continuous, singularly continuous, pure point). That splitting is defined…

16 thms3 active usersReviewed
🏆Completed
Dynamical Systems·Captain: mikedeng1

Ordinary Differential Equations and Dynamical Systems X: Periodic Orbits and the Poincaré MapTextbook

Periodic solutions are the simplest non-stationary long-time behaviour of an autonomous system x˙=f(x)\dot x = f(x)x˙=f(x): limit cycles in oscillators and population models, closed orbits of conservative systems. The first question about a periodic orbit is whether it is stable. Poincaré introduced the first-return map on a transversal section, which turns this question…

22 thms3 active usersReviewed
🏆Completed
Functional AnalysisMathematical Physics·Captain: mikedeng1

Mathematical Methods in Quantum Mechanics X: The Uncertainty Principle and the Harmonic OscillatorTextbook

The quantum harmonic oscillator is the Schrödinger operator of a particle in a quadratic potential. It describes small vibrations around an equilibrium, the modes of the electromagnetic field, and phonons in a crystal. It is also one of the very few Schrödinger operators whose spectrum and eigenfunctions are known in closed form. The eigenvalues are equally…

15 thms3 active usersReviewed
🏆Completed
Dynamical Systems·Captain: mikedeng1

Ordinary Differential Equations and Dynamical Systems IX: Interval Maps, Symbolic Dynamics and the Tent-Map RepellorTextbook

One-dimensional maps are the smallest systems in which deterministic dynamics becomes unpredictable. Chapter 11 of Gerald Teschl's graduate text Ordinary Differential Equations and Dynamical Systems (author's version; AMS Graduate Studies in Mathematics 140, 2012, doi:10.1090/gsm/140) uses them to make the word "chaos" precise. The chapter proves that a…

21 thms3 active usersReviewed
🏆Completed
Dynamical Systems·Captain: mikedeng1

Ordinary Differential Equations and Dynamical Systems VI: The Poincaré–Bendixson TheoremTextbook

Long-time behaviour is the central question about an autonomous differential equation x˙=f(x)\dot x = f(x)x˙=f(x): where does a trajectory go as t→±∞t \to \pm\inftyt→±∞? In the plane this question has an almost complete answer. The theory begun by Poincaré (Mémoire sur les courbes définies par une équation différentielle, 1881–1886) and completed by Bendixson (Sur les courbes…

16 thms3 active usersReviewed
🏆Completed
Control TheoryDynamical Systems·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
Dynamical Systems·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
Partial Differential EquationsPure Mathematics·Captain: mikedeng1

Tasty Bits of Several Complex Variables VI: The Hartogs PhenomenonTextbook

In one complex variable every open set is the natural domain of some holomorphic function: 1/z1/z1/z on a punctured disc cannot be continued across the puncture. In two or more variables this fails in a striking way. Hartogs observed in 1906 that a function holomorphic on the complement of a compact set inside a domain always extends across the hole (Hartogs,…

10 thms3 active usersReviewed
🏆Completed
Pure Mathematics·Captain: mikedeng1

Tasty Bits of Several Complex Variables II: The Ball and the Polydisc Are Not BiholomorphicTextbook

In one complex variable the Riemann mapping theorem classifies a whole class of domains by topology alone: every nonempty simply connected proper subdomain of C\mathbb{C}C is biholomorphic to the unit disc. Nothing of the kind holds in several variables. The two most obvious generalizations of the disc to Cn\mathbb{C}^nCn, the unit ball and the unit polydisc, are…

18 thms3 active usersReviewed
🏆Completed
Functional AnalysisPartial Differential Equations·Captain: mikedeng1

Notes on Partial Differential Equations X: Galerkin Existence of Weak Solutions of Parabolic PDEsTextbook

Linear second-order parabolic equations such as ut+Lu=fu_t + Lu = fut​+Lu=f model diffusion with advection, growth or decay, and external sources. The heat equation is the prototype. For coefficients that are only bounded and measurable, classical solutions need not exist, and the natural well-posedness theory is the L2L^2L2 energy theory of weak solutions. In that theory the…

17 thms3 active usersReviewed
🏆Completed
Functional AnalysisPartial Differential Equations·Captain: mikedeng1

Notes on Partial Differential Equations VIII: Strongly Continuous Semigroups and the Lumer–Phillips TheoremTextbook

Many linear partial differential equations of evolution type — the heat equation, the Schrödinger equation, linear wave and Klein–Gordon equations, linearized reaction–diffusion and Kuramoto–Sivashinsky equations — can be written as an ordinary differential equation

9 thms3 active usersReviewed
🏆Completed
Harmonic AnalysisPartial Differential Equations·Captain: mikedeng1

Notes on Partial Differential Equations II: The Newtonian Potential and Hölder Estimates for Poisson's EquationTextbook

Poisson's equation −Δu=f-\Delta u = f−Δu=f is the model elliptic partial differential equation. It describes the electrostatic potential of a charge density, the gravitational potential of a mass density, and the steady temperature of a body with internal heat sources. Its solution on the whole space by convolution with a point-source potential, and the fact that…

36 thms3 active usersReviewed
PreviousPage 5 of 11Next

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