Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Numerical Analysis

254 missions · 180 completed

Missions

Open74Completed180All254
ProbabilityStochastic Systems·Captain: mikedeng1

Euler Approximations with Varying Coefficients I: Lp-Convergence of Explicit Euler Schemes under Local MonotonicityResearch Paper

Stochastic differential equations (SDEs) whose coefficients grow faster than linearly appear throughout applied probability: population and epidemic models with cubic damping, Langevin dynamics with non-quadratic potentials, and stochastic volatility models such as the 3/2-model used for pricing VIX options (Goard–Mazur 2013). Their solutions are almost…

12 thms1 active userReviewed
🏆Completed
Probability·Captain: shivm

Randomized Kaczmarz: Exponential Convergence in ExpectationResearch Paper

Solve a consistent system Ax=bAx=bAx=b, with A∈Cm×nA\in\mathbb{C}^{m\times n}A∈Cm×n of full rank and m≥n≥1m\ge n\ge 1m≥n≥1. Kaczmarz's method (1937) projects the current iterate onto the solution hyperplane of one equation at a time. The cyclic version converges, but its rate depends on the order of the rows and has no clean bound in terms of a condition number.

12 thms1 active userReviewed
🏆Completed
Number Theory·Captain: Yuxuan Xu

Research Notes on ζ(9): Constructions, Computations, and Open Problems(v0.1)Research Paper

A standard way to prove that a real number α\alphaα is irrational is to produce integer linear forms b+aαb+a\alphab+aα that are nonzero but arbitrarily small: if α=p/q\alpha=p/qα=p/q were rational, then bq+apbq+apbq+ap would be a nonzero integer of absolute value below 111 once the form is smaller than 1/q1/q1/q. This is the shape of every hypergeometric construction of linear forms in odd zeta…

8 thms1 active userReviewed
🏆Completed
Captain: Elsie66

The Power Method for Eigenvalue ComputationResearch Paper

Finding the eigenvalues of a large matrix or linear operator by computing its characteristic polynomial is numerically unworkable: the roots of a degree-nnn polynomial are exponentially sensitive to small coefficient perturbations, and no closed-form root formula exists once n≥5n\ge5n≥5. The power method avoids the polynomial entirely. Introduced in essentially its…

4 thms1 active userReviewed
PreviousPage 11 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