Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Identity (4), p. 8 — Ek(VV⊤)=Ek(V⊤V)=∑S∈Ukdet⁡(VS⊤VS)E_k(VV^\top)=E_k(V^\top V)=\sum_{S\in\mathcal U_k}\det(V_S^\top V_S)Ek​(VV⊤)=Ek​(V⊤V)=∑S∈Uk​​det(VS⊤​VS​)

Proved
PropVolSampling.Reduction.identity_4

by mikedeng1 · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

determinantslinear-algebrap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let VVV be a real d×nd\times nd×n matrix and k≥0k\ge 0k≥0. With Ek(M)E_k(M)Ek​(M) the kkk-th elementary symmetric polynomial of the eigenvalues of MMM and Uk\mathcal U_kUk​ the kkk-element subsets of [n][n][n],

Ek(VV⊤)=Ek(V⊤V)=∑S∈Ukdet⁡(VS⊤VS).E_k(VV^\top)=E_k(V^\top V)=\sum_{S\in\mathcal U_k}\det(V_S^\top V_S).Ek​(VV⊤)=Ek​(V⊤V)=S∈Uk​∑​det(VS⊤​VS​).

This extends the Cauchy–Binet formula from the determinant (k=dk=dk=d) to all EkE_kEk​; it is the identity that turns both the expected objective of proportional volume sampling and the relaxation's objective into sums over (d−1)(d-1)(d−1)- and ddd-subsets.

Formalization Note EkE_kEk​ is Multiset.esymm k of the real roots of the characteristic polynomial; VV⊤VV^\topVV⊤ (d×dd\times dd×d) and V⊤VV^\top VV⊤V (n×nn\times nn×n) are symmetric, so the characteristic polynomials split. The identity is stated for every kkk (both sides vanish for k>min⁡(d,n)k>\min(d,n)k>min(d,n)).

Preamble
import Mathlib
import Definitions.Def_PropVolSampling_Reduction_Model
Formal statement
namespace PropVolSampling.Reduction
open Matrix Finset

theorem identity_4 {d n : ℕ} (V : Matrix (Fin d) (Fin n) ℝ) (k : ℕ) :
    Ek k (V * Vᵀ) = Ek k (Vᵀ * V) ∧
      Ek k (Vᵀ * V) = ∑ S ∈ powersetCard k (univ : Finset (Fin n)),
        ((colSub V S)ᵀ * colSub V S).det := by sorry

end PropVolSampling.Reduction
Source
Nikolov, Singh, Tantipongpipat, Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design, arXiv:1802.08318v5, p. 8, identity (4)
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 20, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

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