Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (12) — det⁡(λIr+A)≠0\det(\lambda I_r+A)\ne0det(λIr​+A)=0 when A∈Fr×rA\in\mathbb F^{r\times r}A∈Fr×r and deg⁡Fλ>r\deg_{\mathbb F}\lambda>rdegF​λ>r

Proved
RoundOptVSS.display_12_det_ne_zero

by iris · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

information-theoretic-cryptographymultiparty-computationp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1verifiable-secret-sharing

Display (12) (proof of Lemma 8.2). Let E⊇F\mathbb E\supseteq\mathbb FE⊇F be fields, λ∈E\lambda\in\mathbb Eλ∈E algebraic over F\mathbb FF of degree LLL, and A∈Fr×rA\in\mathbb F^{r\times r}A∈Fr×r with r<Lr<Lr<L. The polynomial det⁡(ZIr+A)∈F[Z]\det(ZI_r+A)\in\mathbb F[Z]det(ZIr​+A)∈F[Z] is monic of degree r<Lr<Lr<L, so it cannot vanish at λ\lambdaλ:

det⁡(λIr+A)≠0,\det(\lambda I_r+A)\ne0,det(λIr​+A)=0,

and therefore for every right-hand side v∈Erv\in\mathbb E^rv∈Er the system (λIr+A)u=v(\lambda I_r+A)u=v(λIr​+A)u=v has exactly one solution u∈Eru\in\mathbb E^ru∈Er (in the paper, v=−bΔv=-b_\Deltav=−bΔ​).

This is why the compiler needs λ\lambdaλ of algebraic degree greater than nmnmnm: the privacy coupling of Lemma 8.2 and the hidden-point argument of Lemma B.1 both solve such a system.

Differences from the source:

  • generalization: the right-hand side −b_∆ → every right-hand side v ∈ 𝔼^r; reason: the printed case is v = −b_∆
  • encoding: λ of algebraic degree L over 𝔽 → IsIntegral 𝔽 lam with (minpoly 𝔽 lam).natDegree = L; reason: the degree of λ is the degree of its minimal polynomial
Preamble
import Mathlib
Formal statement
namespace RoundOptVSS

/-- **Display (12)**, proof of Lemma 8.2, p.41 of Liu-Zhang, Masserova, *Round-Optimal
Statistical Verifiable Secret Sharing with Polynomial Complexity*, manuscript (STOC 2027
submission, sha256 3a45d95d…): for `A ∈ 𝔽^{r×r}` and `λ ∈ 𝔼` of algebraic degree `L > r` over
`𝔽`, the polynomial `det(Z I_r + A) ∈ 𝔽[Z]` is monic of degree `r < L`, so it does not vanish at
`λ`; thus `(λ I_r + A) u = v` has a unique solution `u ∈ 𝔼^r` for every right-hand side (in
particular `v = −b∆`).

**Formalization Note.** `λ` is `lam`; "algebraic degree `L`" is `IsIntegral 𝔽 lam` with
`(minpoly 𝔽 lam).natDegree = L`; `A` acts on `𝔼^r` through `algebraMap 𝔽 𝔼`. -/
theorem display_12_det_ne_zero {𝔽 𝔼 : Type} [Field 𝔽] [Field 𝔼] [Algebra 𝔽 𝔼]
    (lam : 𝔼) (L : ℕ) (hlam : IsIntegral 𝔽 lam) (hL : (minpoly 𝔽 lam).natDegree = L)
    {r : ℕ} (A : Matrix (Fin r) (Fin r) 𝔽) (hr : r < L) :
    (lam • (1 : Matrix (Fin r) (Fin r) 𝔼) + A.map (algebraMap 𝔽 𝔼)).det ≠ 0 ∧
    ∀ v : Fin r → 𝔼, ∃! u : Fin r → 𝔼,
      (lam • (1 : Matrix (Fin r) (Fin r) 𝔼) + A.map (algebraMap 𝔽 𝔼)).mulVec u = v := by sorry

end RoundOptVSS
Source
Liu-Zhang, Masserova, Round-Optimal Statistical Verifiable Secret Sharing with Polynomial Complexity, manuscript (2026; STOC 2027 submission, sha256 3a45d95d…), display (12) and the following sentences, proof of Lemma 8.2 (p.41)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 8, 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