Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Linear algebra

332 missions · 207 completed

Missions

Open125Completed207All332
🏆Completed
Statistics·Captain: LG

Local Distance Network (H0DN 2026): generalized least squares behind the H0 consensusResearch Paper

The Hubble constant H0H_0H0​ is the present expansion rate of the Universe. Its value measured locally with distance-ladder methods disagrees with the value inferred from the early Universe under the standard Λ\LambdaΛCDM model (the Hubble tension). The H0DN Collaboration (A&A 708, A166, 2026) combined geometric distances, Cepheids, the tip of the red giant…

15 thms2 active usersReviewed
🏆Completed
Condensed Matter PhysicsMathematical PhysicsQuantum Information+2·Captain: Alien60

Seiberg–Seifnashri–Shao 2024: Non-invertible Kramers–Wannier symmetry on the Ising chainResearch Paper

Kramers–Wannier duality was found in 1941 as a map between the high- and low-temperature phases of the two-dimensional Ising model (Kramers–Wannier 1941). In its quantum form it exchanges the transverse field XjX_jXj​ and the nearest-neighbour coupling Zj−1ZjZ_{j-1}Z_jZj−1​Zj​ of the transverse-field Ising chain, and it fixes the critical point. In conformal field theory it…

8 thms2 active usersReviewed
🏆Completed
Dynamical Systems·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
CombinatoricsGraph Theory·Captain: mikedeng1

Three Conjectures in Extremal Spectral Graph Theory 2: For Large n, K₂ + Pₙ₋₂ Is the Unique Planar Graph on n Vertices of Maximum Spectral Radius (Boots–Royle / Cao–Vince Conjecture)Research Paper

The spectral radius of a graph, the largest eigenvalue of its adjacency matrix, measures how densely and how unevenly the edges of the graph are distributed. Asking which graph in a class maximizes it is a spectral analogue of the extremal question "which graph in the class has the most edges". For planar graphs the question has a long history in spectral…

21 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

Three Conjectures in Extremal Spectral Graph Theory 1: For Large n, K₁ + Pₙ₋₁ Is the Unique Outerplanar Graph on n Vertices of Maximum Spectral Radius (Cvetković–Rowlinson Conjecture)Research Paper

The spectral radius λ1(G)\lambda_1(G)λ1​(G) of a graph GGG, the largest eigenvalue of its adjacency matrix, is a standard measure of how densely and how centrally a graph is connected. A classical theme of spectral graph theory asks, for a natural family of graphs, which member of the family on nnn vertices maximizes λ1\lambda_1λ1​. For planar graphs this question was raised…

12 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

Three Conjectures in Extremal Spectral Graph Theory 3: For Large n, a Connected n-Vertex Graph Maximizing Spectral Radius Minus Average Degree Is a Pineapple GraphResearch Paper

How far is a graph from being regular? Several numerical irregularity measures answer this question, and spectral graph theory supplies a natural one. For a graph GGG with nnn vertices and e(G)e(G)e(G) edges, the largest eigenvalue λ1(G)\lambda_1(G)λ1​(G) of the adjacency matrix is always at least the average degree d(G)=2e(G)/nd(G) = 2e(G)/nd(G)=2e(G)/n, with equality exactly when GGG is regular. The…

13 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

A Harary-Sachs Theorem for Hypergraphs: The Codegree-d Coefficient of the Characteristic Polynomial of a k-Graph as a Weighted Sum over Its Veblen InfragraphsResearch Paper

The characteristic polynomial of an ordinary graph records spectral information in coefficients that can also be described by finite graph configurations. The classical Harary–Sachs theorem is an instance of this connection. For a uniform hypergraph, the adjacency object is a tensor rather than a matrix, and its characteristic polynomial is defined through…

45 thms2 active usersReviewed
🏆Completed
Numerical AnalysisOptimizationTheoretical Computer Science·Captain: mikedeng1

Low Rank Approximation and Regression in Input Sparsity Time 2: Sketched Multiple-Response Regression Is (1 + 4ε)-Optimal in Squared Error If the Sketch Embeds the Subspace and Approximates ProductsResearch Paper

Least-squares regression, min⁡X∥AX−B∥F\min_X\|AX-B\|_FminX​∥AX−B∥F​ for a tall matrix A∈Rn×dA\in\mathbb R^{n\times d}A∈Rn×d with n≫dn\gg dn≫d, is among the most frequently solved problems in numerical computation. Direct methods (QR or SVD) cost O(nd2)O(nd^2)O(nd2) time, which is prohibitive when nnn is in the millions. Sketching replaces the problem by a much smaller one: choose a matrix S∈Rt×nS\in\mathbb R^{t\times n}S∈Rt×n…

7 thms2 active usersReviewed
🏆Completed
Control TheoryDynamical Systems·Captain: mikedeng1

Lyapunov Equations, Energy Functionals, and Model Order Reduction of Bilinear and Stochastic Systems 2: An Explicit Bilinear System Whose Field x ↦ P̃(x)⁻¹x Is Not a Gradient, So (3.8) FailsResearch Paper

Balanced truncation reduces a large control system to a small one by discarding the states that are both hard to reach and hard to observe. For linear systems "hard to reach" is measured exactly by the controllability Gramian PPP: the minimal input energy needed to steer the system from 000 to x0x_0x0​ is x0TP−1x0x_0^T P^{-1} x_0x0T​P−1x0​. For bilinear systems, in which the input…

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

Baumgarten 2018: How to (Un-) Quantum Mechanics — Phase-Space AlgebraResearch Paper

C. Baumgarten's essay How to (Un-) Quantum Mechanics (arXiv:1810.06981, v2 2025) argues that much of the mathematical formalism usually presented as specifically "quantum" — Heisenberg's equation of motion, commutators, eigenvalue problems, the real Pauli and Dirac algebras — already follows from classical linear Hamiltonian mechanics on an abstract phase…

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

Davidson–Nardi–Nir 2008 (Leptogenesis), Eq. (5.10): upper bound on the flavoured CP asymmetry in N1 decaysResearch Paper

Leptogenesis is a class of scenarios in which the baryon asymmetry of the Universe is produced from a lepton asymmetry generated in the out-of-equilibrium decays of heavy singlet neutrinos NkN_kNk​, which also give the light neutrinos their small masses through the type I seesaw (Fukugita–Yanagida 1986). The review of Davidson, Nardi and Nir (Phys. Rep. 466…

6 thms2 active usersReviewed
🏆Completed
AlgebraCombinatoricsDiscrete Geometry·Captain: mikedeng1

Generalising the Scattered Property of Subspaces 3: A Maximum h-Scattered Subspace of Dimension rn/(h + 1) Meets Every Hyperplane in Dimension Between rn/(h + 1) − n and rn/(h + 1) − n + hResearch Paper

Scattered subspaces are a central object of finite geometry. An Fq\mathbb F_qFq​-subspace UUU of an rrr-dimensional vector space over Fqn\mathbb F_{q^n}Fqn​ defines an Fq\mathbb F_qFq​-linear set of the projective space PG(r−1,qn)\mathrm{PG}(r-1,q^n)PG(r−1,qn), and when UUU is scattered this linear set has the largest possible number of points for its rank. Maximum scattered subspaces give rise to…

18 thms2 active usersReviewed
🏆Completed
AlgebraComplexity TheoryTheoretical Computer Science·Captain: mikedeng1

Most Tensor Problems Are NP-Hard 4: A Rational 2×2×2 Tensor Has Smaller Rank over the Reals Than over the RationalsResearch Paper

The rank of a matrix does not depend on the field in which its entries are read: a rational matrix has the same rank over Q\mathbb QQ, R\mathbb RR and C\mathbb CC, because rank is computed by Gaussian elimination, which never leaves the field of the entries. For 3-tensors, arrays A=[ ⁣[aijk] ⁣]\mathcal A = [\![a_{ijk}]\!]A=[[aijk​]] with three indices, this fails. Tensor rank governs the…

8 thms2 active usersReviewed
🏆Completed
Convex OptimizationNumerical AnalysisOperations Research+1·Captain: mikedeng1

A Primal-Dual Interior-Point Algorithm for Nonsymmetric Exponential-Cone Optimization 2: Rank-One Recursions Factor Y₀(Y₀ᵀS₀)⁻¹Y₀ᵀ = VVᵀ and S₀(Y₀ᵀS₀)⁻¹S₀ᵀ = UUᵀResearch Paper

Quasi-Newton methods replace the Hessian of an objective by a matrix H≻0H \succ 0H≻0 that is updated from observed pairs of steps and gradient changes. The secant equation HS=YHS = YHS=Y asks the new matrix to map the observed steps SSS to the observed changes YYY. The best-known update is BFGS, which for ppp simultaneous pairs S,Y∈Rn×pS, Y \in \mathbb{R}^{n\times p}S,Y∈Rn×p reads

7 thms2 active usersReviewed
🏆Completed
Graph TheoryTheoretical Computer Science·Captain: mikedeng1

Graph Sparsification by Effective Resistances 2: Approximate Laplacian Solves Preserve Effective-Resistance Sketches up to (1±ε)²Research Paper

The effective resistance between two vertices of a weighted graph is the voltage difference that appears between them when the graph is viewed as an electrical network, edge weights being conductances, and one unit of current is injected at one vertex and extracted at the other. Effective resistances drive the spectral sparsification algorithm of Spielman…

5 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: marwahaha

Complex Matrix Multiplication Below 2.258 and Rectangular BoundsOpen Problem

Rectangular matrix products arise when the two outer dimensions are much larger than the inner dimension. The dual exponent records the largest inner growth rate compatible with arithmetic exponent two. The source manuscript presents the surrounding research claim.

4 thms2 active usersReviewed
🏆Completed
Complexity TheoryTheoretical Computer Science·Captain: wurtle

Finite tensor savings and exact Fourier circuitsResearch Paper

The discrete Fourier transform of length nnn is computed by the fast Fourier transform with O(nlog⁡n)O(n\log n)O(nlogn) arithmetic operations, and this has been the benchmark since Cooley and Tukey (1965). Whether Ω(nlog⁡n)\Omega(n\log n)Ω(nlogn) operations are necessary is one of the basic open questions of algebraic complexity theory. Lower bounds of order nlog⁡nn\log nnlogn are known only under…

8 thms2 active usersReviewed
🏆Completed
Complexity TheoryTheoretical Computer Science·Captain: wurtle

Staggered extraction for exact matrix multiplication over every fieldResearch Paper

Multiplying two n×nn\times nn×n matrices by the schoolbook method costs about n3n^3n3 operations. The matrix-multiplication exponent ωF\omega_FωF​ of a field FFF is the infimum of exponents τ\tauτ such that n×nn\times nn×n matrices over FFF can be multiplied with O(nτ+o(1))O(n^{\tau+o(1)})O(nτ+o(1)) additions, subtractions and multiplications. It governs the asymptotic cost of a central bilinear…

322 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryDynamical Systems·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
CombinatoricsGraph Theory·Captain: mikedeng1

Quick Approximation to Matrices and Applications III: The Atoms of a Cut Decomposition with Error εn² Form a 2ε-Pseudo-Regular Partition of a GraphResearch Paper

Szemerédi's regularity lemma partitions the vertex set of any graph into a bounded number of parts between which edges are distributed almost randomly. It is a central tool of extremal graph theory, but the number of parts it needs is a tower of exponentials in 1/ϵ1/\epsilon1/ϵ, which makes it unusable in algorithms. In 1996 and 1999 Frieze and Kannan introduced…

5 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Strongly Regular Generalized Equations III: Reduced-Form Criterion — a Linear Generalized Equation over a Polyhedral Set Is Strongly Regular Iff Its Reduced Form Is Uniquely Solvable on LResearch Paper

Many problems in optimization and equilibrium modelling, among them linear and nonlinear complementarity problems, variational inequalities over polyhedra, and the Karush–Kuhn–Tucker conditions of nonlinear programs, can be written as a single generalized equation

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

Strongly Regular Generalized Equations II: Schur-Complement Criterion — A₁₁ Nonsingular and (A/A₁₁) Positive Definite Make (A + ∂ψ_{ℝʳ×K})⁻¹ Lipschitz on ℝ^{r+s}; for K = ℝˢ₊, P-Matrix IffResearch Paper

A constrained system can be written as a generalized equation: a smooth or linear expression must balance the normal cone of a feasible set. This form includes variational inequalities and the first-order conditions of many optimization problems. It is useful to know whether a small change in the right-hand side determines one nearby solution and how far…

8 thms2 active usersReviewed
🏆Completed
Convex OptimizationStatistics·Captain: mikedeng1

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers IV: The Covariance-Selection X-Update Is Q·diag((λᵢ + √(λᵢ² + 4ρ))/(2ρ))·QᵀTextbook

Many estimation problems in statistics, machine learning and signal processing minimize a smooth loss plus a nonsmooth ℓ1-type regularizer: the lasso, basis pursuit, least absolute deviations, Huber fitting, the group lasso, and ℓ1-penalized maximum likelihood for Gaussian graphical models. Chapter 6 of Boyd, Parikh, Chu, Peleato and Eckstein, Distributed…

13 thms2 active usersReviewed
🏆Completed
Numerical AnalysisOptimization·Captain: mikedeng1

Truncated-Newton Algorithms for Large-Scale Unconstrained Optimization 2: Exact CG Meets Nonpositive Curvature Unless g Is Orthogonal to the Nonpositive Eigenspaces of HResearch Paper

Truncated-Newton methods minimize a smooth function f:Rn→Rf:\mathbb{R}^n\to\mathbb{R}f:Rn→R by taking, at each iterate xkx_kxk​, a search direction obtained by solving the Newton equation H(xk)p=−g(xk)H(x_k)p=-g(x_k)H(xk​)p=−g(xk​) only approximately, with the linear conjugate gradient (CG) method. Here ggg is the gradient and HHH the Hessian of fff. The approach was analysed by Dembo and Steihaug (Math.…

5 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: mikedeng1

Explicit Expanders of Every Degree and Size 3: Deleting Far-Apart Tree-Like Vertices of a Near-Ramanujan Graph and Matching Their Neighbours Keeps λ ≤ 2√(d−1) + εResearch Paper

Sparse graphs with small nontrivial eigenvalues, expanders, are basic objects in combinatorics and theoretical computer science. They are used in error-correcting codes, derandomization, sorting networks, and the analysis of random walks. The Alon–Boppana bound says that a ddd-regular graph on nnn vertices has a nontrivial eigenvalue of absolute value at least …

13 thms2 active usersReviewed
PreviousPage 7 of 9Next

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