Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2 — the incidence matrix of an oriented tree is an integral basis of Ad−1A_{d-1}Ad−1​

Proved
InfoLossLAR.WorstCase.lemma_6_2

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

graph-theoryincidence-matrixlatticesp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let T\mathscr TT be a tree on the vertex set {1,…,d}\{1,\dots,d\}{1,…,d} with an arbitrary orientation and signed incidence matrix DTD_{\mathscr T}DT​ (+1+1+1 at the tail, −1-1−1 at the head of each edge column). Then T\mathscr TT has d−1d-1d−1 edges, and the columns of DTD_{\mathscr T}DT​ form an integral basis of the zero-sum lattice Ad−1={z∈Zd:1⊤z=0}A_{d-1}=\{z\in\mathbb Z^d:\mathbf 1^\top z=0\}Ad−1​={z∈Zd:1⊤z=0}: they are linearly independent over Z\mathbb ZZ and span Ad−1A_{d-1}Ad−1​. In particular

DTZd−1=Ad−1,rank⁡R(DT)=d−1.D_{\mathscr T}\mathbb Z^{d-1}=A_{d-1},\qquad\operatorname{rank}_{\mathbb R}(D_{\mathscr T})=d-1.DT​Zd−1=Ad−1​,rankR​(DT​)=d−1.

Differences from the source:

  • encoding: "a tree on ddd vertices with an arbitrary orientation" → a SimpleGraph on Fin d with IsTree and a tail/head choice for each edge; reason: same objects
  • encoding: "integral basis" → Z\mathbb ZZ-linear independence plus span equal to Ad−1A_{d-1}Ad−1​; reason: definition of a basis
  • encoding: columns indexed 1,…,d−11,\dots,d-11,…,d−1 → columns indexed by the edge set; reason: the paper's order of edges is arbitrary
Preamble
import Mathlib
import Definitions.Def_InfoLossLAR_WorstCase_Rounding
import Definitions.Def_InfoLossLAR_WorstCase_FixedT

set_option autoImplicit false
Formal statement
namespace InfoLossLAR.WorstCase

/-- Lemma 6.2 (Tree incidence basis), p. 26: an oriented tree `𝒯` on the `d` vertices `Fin d`
has `d − 1` edges, and the columns of its signed incidence matrix `D_𝒯` form an integral basis
of `A_{d−1} = {z ∈ ℤ^d : 1ᵀz = 0}`: they are `ℤ`-linearly independent and span `A_{d−1}`; in
particular `D_𝒯 ℤ^{d−1} = A_{d−1}` and `rank_ℝ(D_𝒯) = d − 1`. -/
theorem lemma_6_2 (d : ℕ) (𝒯 : OrientedTree d) :
    Fintype.card 𝒯.G.edgeSet = d - 1 ∧
    LinearIndependent ℤ (fun e : 𝒯.G.edgeSet => fun i : Fin d => 𝒯.incidence i e) ∧
    Submodule.span ℤ (Set.range fun e : 𝒯.G.edgeSet => fun i : Fin d => 𝒯.incidence i e) =
      zeroSumLattice d ∧
    LinearMap.range (Matrix.mulVecLin 𝒯.incidence) = zeroSumLattice d ∧
    (𝒯.incidence.map (Int.cast : ℤ → ℝ)).rank = d - 1 := 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. 26, Lemma 6.2
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