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
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: mikedeng1

Explicit Expanders of Every Degree and Size 2: Attaching New Vertices to a (p+1)-Regular Ramanujan Graph and Adding Loops Keeps Every Nontrivial Eigenvalue at Most √(2(p+1)) + √p + o(1)Research Paper

Sparse graphs whose adjacency spectrum is concentrated near zero, expanders, are used throughout theoretical computer science: in error-correcting codes, derandomization, sorting and routing networks, and the construction of pseudorandom objects (Hoory, Linial and Wigderson, survey). The best possible spectral expansion for a ddd-regular graph is governed by…

9 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationReinforcement Learning·Captain: mikedeng1

Reinforcement Learning: An Introduction X: Off-policy Divergence and the Gradient of the Projected Bellman ErrorTextbook

Off-policy learning estimates the value function of a target policy π\piπ from data generated by a different behavior policy bbb. It is how an agent learns about a greedy policy while exploring, and how many policies can be evaluated from one stream of experience. Combined with linear function approximation and bootstrapping (updating an estimate toward other…

14 thms4 active usersReviewed
🏆Completed
AnalysisDynamical Systems·Captain: mikedeng1

Ordinary Differential Equations and Dynamical Systems II: Linear Systems and Floquet TheoryTextbook

Linear systems of ordinary differential equations x˙=A(t)x\dot x = A(t)xx˙=A(t)x are the first case of the general theory in which solutions can be described structurally rather than merely shown to exist. They arise directly (circuits, mechanical vibrations, Hill's equation for the stability of periodic motions, the Mathieu equation for parametric resonance) and…

9 thms4 active usersReviewed
🏆Completed
Convex OptimizationGraph TheoryOperations Research+1·Captain: mikedeng1

Lifts of Convex Sets and Cone Factorizations III: Stable Set Polytopes Have No Small Semidefinite LiftsResearch Paper

Many polytopes of combinatorial optimization have exponentially many facets, yet linear optimization over them is tractable because they are projections of simpler convex sets: affine slices of a nonnegative orthant (linear programming) or of the cone of positive semidefinite matrices (semidefinite programming). The size of such a representation, the number…

19 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Robust Solutions to Uncertain Semidefinite Programs III: Quadratic Growth and Uniqueness of the Robust SDP SolutionResearch Paper

A semidefinite program (SDP) minimizes a linear objective cTxc^TxcTx subject to a linear matrix inequality F(x)=F0+∑ixiFi⪰0F(x) = F_0 + \sum_i x_i F_i \succeq 0F(x)=F0​+∑i​xi​Fi​⪰0. When the data FiF_iFi​ are uncertain, El Ghaoui, Oustry and Lebret (SIAM J. Optim. 9(1), 1998) proposed to optimize against the worst case over a norm-bounded family of perturbations: the robust SDP. Their Theorem 3.1 shows…

10 thms4 active usersReviewed
🏆Completed
Convex OptimizationNumerical AnalysisOperations Research+1·Captain: mikedeng1

Robust Solutions to Least-Squares Problems with Uncertain Data III: Structured Robust Least Squares Is Solved Exactly by a Semidefinite ProgramResearch Paper

Least squares fits a model Ax≈bAx \approx bAx≈b as if the data (A,b)(A, b)(A,b) were exact. In practice they are measured, rounded or estimated, and the least-squares solution can be very sensitive to such errors. El Ghaoui and Lebret (SIAM J. Matrix Anal. Appl. 18(4), 1997) proposed to treat the errors as deterministic, unknown but bounded, and to choose xxx minimizing the wor…

14 thms4 active users
🏆Completed
Quantum Information·Captain: Mrnaiq

The Theory of Quantum Information II: Extreme Quantum Channels and the Choi–Kraus CriterionTextbook

A quantum device can be represented by a rule that takes an input matrix to an output matrix. Noise introduces randomness into that rule. Convex combinations describe a device that first makes a classical random choice and then applies the selected operation. An extreme quantum channel is one that cannot be obtained as a nontrivial mixture of two different…

7 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: Shuze Chen

A Sharp Rigidity Law for Effective ResistanceResearch Paper

Effective resistances summarize a weighted graph as an electrical network: the resistance RuvR_{uv}Ruv​ between two vertices is the voltage needed to send one unit of current from uuu to vvv. They govern commute times and are the sampling probabilities of spectral sparsification (Spielman–Srivastava 2011), and they form a metric on the vertices.

10 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Low-Rank Denoising for Predict-then-OptimizeResearch Paper

A predict-then-optimize pipeline estimates unknown costs and passes the estimate to an optimizer. In shortest-path problems, edge costs can come from noisy measurements or simulation replications. Averaging more replications reduces noise, but costs across different instances may also share structure: several edges can vary together. A projection estimator k…

6 thms3 active usersReviewed
🏆Completed
Functional AnalysisQuantum Information·Captain: iris

From Simple Sources to Quantum Advantage: Homomorphic Polynomial Transduction via Relative DecodingResearch Paper

Decoded quantum interferometry (DQI) and its Hamiltonian variant (HDQI) prepare quantum states whose amplitudes are a polynomial of a target problem: a polynomial of a code's parity checks, or a polynomial p(HB)p(H_B)p(HB​) of a Hamiltonian HBH_BHB​. Such states are used to bias measurements toward high-scoring or low-energy sectors, and their preparation rests on a…

15 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: iris

On Brouwer's Laplacian conjectureResearch Paper

The Laplacian L=D−AL=D-AL=D−A of a graph records its degrees on the diagonal and its edges off it. Its spectrum controls connectivity, expansion, random walks, cuts and spanning trees, and sums of its largest eigenvalues appear in graph partitioning and in the energy of quadratic forms over a graph. A natural question is how large the top of the spectrum can be in…

19 thms3 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: iris

Incentive-Aware Models of Financial Networks: A Stable Network of Contracts and Prices Exists iff a Linear System in the Prices Is Solvable, and Is Unique When Its Matrix Has Full RankResearch Paper

Financial institutions are linked by bilateral contracts: loans, interest rate swaps, insurance, derivative trades. The resulting network of exposures determines how shocks propagate, and most of the literature on systemic risk (for example the clearing model of Eisenberg and Noe) takes this network as given. Jalan, Chakrabarti and Sarkar (arXiv:2212.06808,…

10 thms3 active usersReviewed
🏆Completed
Quantum InformationRepresentation Theory·Captain: iris

Decoherence, Control, and Symmetry in Quantum Computers VI: Hamiltonians in the commutant of the OSR algebra act only on the degeneracy of each irrepTextbook

Noise on a quantum register is described by the operators through which the register couples to its environment. These operators, together with the identity, generate an algebra AAA of operators on the register, which D. M. Bacon's thesis calls the OSR algebra (operator-sum representation; for Markovian noise the analogous SME algebra). Information stored…

12 thms3 active usersReviewed
🏆Completed
Mathematical PhysicsQuantum Information·Captain: iris

Decoherence, Control, and Symmetry in Quantum Computers I: an operator-sum evolution is unitary iff every OSR operator is a scalar multiple of the unitaryTextbook

A quantum system that is not perfectly isolated evolves, from its own point of view, by an operator-sum representation (OSR): its density matrix ρ\rhoρ is mapped to ∑iAiρAi†\sum_i A_i\rho A_i^\dagger∑i​Ai​ρAi†​ for a family of OSR operators AiA_iAi​ obtained by tracing out the environment. Generic OSRs describe decoherence, the loss of quantum information to the environment. Unitary…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: iris

Processing Networks XVII: A Relative-Entropy Lower Bound for the Traffic Equations of a Transient Routing MatrixTextbook

In a multiclass processing network, jobs of class iii arrive from outside at rate λi\lambda_iλi​ and, after service, move to class jjj with probability PijP_{ij}Pij​ or leave the network. The traffic equations α=λ+P′α\alpha=\lambda+P'\alphaα=λ+P′α give the total arrival rate αi\alpha_iαi​ into each class. Chapter 10 of Dai and Harrison's Processing Networks: Fluid Models and Stability proves…

15 thms3 active usersReviewed
🏆Completed
CombinatoricsLinear Optimization·Captain: iris

Combinatorial Optimization (Cook et al.) IX: The Hoffman–Kruskal Theorem: {x≥0:Ax≤b}\{x \ge 0 : Ax \le b\}{x≥0:Ax≤b} Is Integral for All Integral bbb Iff AAA Is Totally UnimodularTextbook

Many combinatorial optimization problems (bipartite matching, maximum flow, shortest paths, transportation and assignment problems) can be written as integer programs

10 thms3 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: mikedeng1

SYN-DIGITS: A Synthetic Control Framework for Calibrated Digital Twin Simulation: Error Bound for Ridge Fit-and-Transfer on a New QuestionResearch Paper

Large language models are increasingly used as digital twins of survey respondents: a model is prompted with a persona and asked to answer the same questionnaire a human would. The appeal is cost and speed, since a new question can be "fielded" to thousands of simulated respondents in minutes. The obstacle is fidelity. Large language models exhibit…

8 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Technical Note—Global Robust Stability in a General Price and Assortment Competition Model: Robust Best-Response Price Dynamics Contract Geometrically to the Special Equilibrium from Any StartResearch Paper

Retailers that sell many products set prices against one another, and the demand for each product depends on the prices of all of them. Affine demand models, q(p)=a−Rpq(p)=a-Rpq(p)=a−Rp, are the standard starting point for this kind of multi-product price competition in operations management and industrial organization. Two questions follow once an equilibrium is known to…

15 thms3 active usersReviewed
🏆Completed
AlgebraCategory Theory·Captain: mikedeng1

Higher-Dimensional Algebra VI: Lie 2-Algebras: The Category of Semistrict Lie 2-Algebras Is Equivalent to the Category of 2-Term L∞-AlgebrasResearch Paper

An ordinary Lie algebra has a vector space and an antisymmetric bracket satisfying the Jacobi identity. In a Lie 2-algebra, the vectors become the objects of a linear category, and the Jacobi identity is witnessed by a morphism called the Jacobiator. This lets the Jacobi identity hold coherently rather than as a strict equation. Baez and Crans developed…

12 thms3 active usersReviewed
🏆Completed
Differential GeometryMathematical Physics·Captain: mikedeng1

Geometrization of Quantum Mechanics: The Unitary Momentum Map Pulls Back the Lie and Jordan Tensors of the Observables to the Kähler Structure of Hilbert SpaceResearch Paper

Quantum mechanics is usually written in linear-algebraic terms: states are vectors of a complex Hilbert space, observables are Hermitian operators, and expectation values pair the two. Classical mechanics is written geometrically: states form a symplectic manifold, observables are functions on it, and dynamics is a Hamiltonian flow. A line of work starting…

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

Geometric Deep Learning III: An n × n Matrix Commutes with the Cyclic Shift S if and only if It Is Circulant, So Convolution Is Shift EquivarianceTextbook

Convolutional neural networks process images, audio and time series with layers whose weights are shared across positions. The Geometric Deep Learning programme of Bronstein, Bruna, Cohen and Veličković (arXiv:2104.13478v2) explains this architecture by symmetry: on a grid the relevant symmetry is translation, and a linear layer that respects translations…

9 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Shapley–Snow Kernels, Multiparameter Eigenvalue Problems, and Stochastic Games: Every Discounted Value Is a Rank-Drop Root of a Kernel-Reduced Pencil, Algebraic of Degree at Most Its RankResearch Paper

Zero-sum stochastic games model two opponents who interact over a finite set of states, each state being a matrix game whose outcome also decides the next state. Since Shapley (1953), every such game with discount factor λ∈(0,1]\lambda\in(0,1]λ∈(0,1] has a value vλkv_\lambda^kvλk​ at each initial state kkk, characterised as the fixed point of a contraction. The value is the basic…

19 thms3 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Revenue Volatility Under Uncertain Network Effects: The Worst-Case Relative Revenue Change over ε-Perturbed Networks Equals αλmax·ε/(1 − αλmax(1 + ε))Research Paper

A seller of a good with network externalities (a social app, a telecom plan, a game console) gains from knowing how strongly each consumer's demand depends on the consumption of others. Candogan, Bimpikis and Ozdaglar (Operations Research, 2012) showed that, on a known network, the optimal price vector of a monopolist and the resulting revenue have closed…

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Lectures on Modern Convex Optimization V: Semidefinite Representability of Symmetric Functions of EigenvaluesTextbook

A convex optimization problem can be handed to a semidefinite programming solver only after its constraints and objective have been written as linear matrix inequalities (LMIs): conditions of the form A(x,u)⪰0\mathcal A(x,u) \succeq 0A(x,u)⪰0, where A\mathcal AA is affine in the decision variables xxx and in auxiliary variables uuu, and ⪰0\succeq 0⪰0 means positive semidefinite. A…

9 thms3 active usersReviewed
🏆Completed
Information TheoryQuantum Error CorrectionQuantum Information·Captain: mikedeng1

Reversing quantum dynamics with near-optimal quantum and classical fidelity I: The Reversal Operation Attains at Least the Square of the Optimal Average Entanglement FidelityResearch Paper

Quantum error correction and quantum communication both ask the same question: after a known noise process A\mathcal AA has acted on a quantum system, how well can its effect be undone? For a given noise model the best recovery is the solution of a semidefinite program, which gives a number but no structure and no formula. Barnum and Knill showed in 2000 that…

7 thms3 active usersReviewed
PreviousPage 3 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