Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.7 — ∣det⁡[DT∣v]∣=∣1⊤v∣|\det[D_{\mathscr T}\mid v]|=|\mathbf 1^\top v|∣det[DT​∣v]∣=∣1⊤v∣ for an oriented tree

Proved
InfoLossLAR.WorstCase.lemma_6_7

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

determinantgraph-theoryincidence-matrixp2o-gran-per-chapterp2o-plan-bookp2o-v1

For every oriented tree T\mathscr TT on ddd vertices with signed incidence matrix DT∈Zd×(d−1)D_{\mathscr T}\in\mathbb Z^{d\times(d-1)}DT​∈Zd×(d−1) and every integer column v∈Zdv\in\mathbb Z^dv∈Zd,

∣det⁡[DT∣v]∣=∣1⊤v∣.|\det[D_{\mathscr T}\mid v]|=|\mathbf 1^\top v| .∣det[DT​∣v]∣=∣1⊤v∣.

Differences from the source:

  • encoding: the ddd columns of [DT∣v][D_{\mathscr T}\mid v][DT​∣v] in the paper's order → in an arbitrary order given by a bijection σ\sigmaσ from (edges ⊔\sqcup⊔ one extra column) to {1,…,d}\{1,\dots,d\}{1,…,d}; reason: ∣det⁡∣|\det|∣det∣ does not depend on the column order, and the paper does not fix one
Preamble
import Mathlib
import Definitions.Def_InfoLossLAR_WorstCase_FixedT

set_option autoImplicit false
Formal statement
namespace InfoLossLAR.WorstCase

/-- Lemma 6.7 (Determinant of an extended tree incidence matrix), p. 28: for every oriented
tree `𝒯` on the `d` vertices `Fin d` and every `v ∈ ℤ^d`, `|det[D_𝒯 | v]| = |1ᵀv|`. The `d`
columns (the `d − 1` edge columns and `v`) are put in an arbitrary order `σ`; the absolute value
of the determinant does not depend on it. -/
theorem lemma_6_7 (d : ℕ) (𝒯 : OrientedTree d) (v : Fin d → ℤ)
    (σ : 𝒯.G.edgeSet ⊕ Unit ≃ Fin d) :
    |((𝒯.extended v).submatrix id σ.symm).det| = |∑ i, v i| := by sorry

end InfoLossLAR.WorstCase
Source
Chen Qian, Information Loss Is All You Need: TC⁰ Pseudorandomness from Worst-Case Lattices, arXiv:2611.05136 (held version, sha256 2ebdfbf3…), p. 28, Lemma 6.7
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 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