Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 6.8 — tree-incidence transport: Q=T−1DˉTRˉQ=T^{-1}\bar D_{\mathscr T}\bar RQ=T−1DˉT​Rˉ integral with det⁡Q=±det⁡Redge\det Q=\pm\det R_{\mathrm{edge}}detQ=±detRedge​

Proved
InfoLossLAR.WorstCase.corollary_6_8

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

determinantincidence-matrixlatticesp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let qqq be an odd prime, d≥qd\ge qd≥q and TTT the matrix of Definition 6.3. Let T\mathscr TT be any oriented spanning tree on {1,…,d}\{1,\dots,d\}{1,…,d}, Redge∈Z(d−1)×(d−1)R_{\mathrm{edge}}\in\mathbb Z^{(d-1)\times(d-1)}Redge​∈Z(d−1)×(d−1), and v∈Zdv\in\mathbb Z^dv∈Zd with 1⊤v=q\mathbf 1^\top v=q1⊤v=q. Define

DˉT=[DT∣v],Rˉ=diag⁡(Redge,1),DT=DˉTRˉ∈Zd×d.\bar D_{\mathscr T}=[D_{\mathscr T}\mid v],\qquad \bar R=\operatorname{diag}(R_{\mathrm{edge}},1),\qquad D_{\mathbf T}=\bar D_{\mathscr T}\bar R\in\mathbb Z^{d\times d}.DˉT​=[DT​∣v],Rˉ=diag(Redge​,1),DT​=DˉT​Rˉ∈Zd×d.

Let z0∈Zdz_0\in\mathbb Z^dz0​∈Zd with 1⊤z0≡0(modq)\mathbf 1^\top z_0\equiv0\pmod q1⊤z0​≡0(modq), and set Q=T−1DTQ=T^{-1}D_{\mathbf T}Q=T−1DT​, β=T−1z0\beta=T^{-1}z_0β=T−1z0​. Then ∣det⁡DˉT∣=q|\det\bar D_{\mathscr T}|=q∣detDˉT​∣=q, DTZd⊆L(T)D_{\mathbf T}\mathbb Z^d\subseteq\mathcal L(T)DT​Zd⊆L(T) and z0∈L(T)z_0\in\mathcal L(T)z0​∈L(T); consequently Q∈Zd×dQ\in\mathbb Z^{d\times d}Q∈Zd×d and β∈Zd\beta\in\mathbb Z^dβ∈Zd, with

det⁡DT=±qdet⁡Redge,det⁡Q=det⁡DˉTdet⁡Rˉdet⁡T=±det⁡Redge.\det D_{\mathbf T}=\pm q\det R_{\mathrm{edge}},\qquad \det Q=\frac{\det\bar D_{\mathscr T}\det\bar R}{\det T}=\pm\det R_{\mathrm{edge}} .detDT​=±qdetRedge​,detQ=detTdetDˉT​detRˉ​=±detRedge​.

Every x∈Zdx\in\mathbb Z^dx∈Zd gives w=DˉTRˉx+z0∈L(T)w=\bar D_{\mathscr T}\bar Rx+z_0\in\mathcal L(T)w=DˉT​Rˉx+z0​∈L(T) and w mod q∈H0w\bmod q\in H_0wmodq∈H0​. If det⁡Redge≢0(modq)\det R_{\mathrm{edge}}\not\equiv0\pmod qdetRedge​≡0(modq), then Q mod q∈GLd(Fq)Q\bmod q\in\mathrm{GL}_d(\mathbb F_q)Qmodq∈GLd​(Fq​).

Differences from the source:

  • encoding: the column order of DˉT\bar D_{\mathscr T}DˉT​ (edges, then vvv) → an arbitrary bijection σ\sigmaσ from (edges ⊔\sqcup⊔ one extra column) to {1,…,d}\{1,\dots,d\}{1,…,d}, with Rˉ\bar RRˉ reindexed by the same σ\sigmaσ on rows and columns; reason: the paper does not order the edges; DTD_{\mathbf T}DT​ is the paper's matrix with columns permuted, and every clause is invariant
  • encoding: Redge∈Z(d−1)×(d−1)R_{\mathrm{edge}}\in\mathbb Z^{(d-1)\times(d-1)}Redge​∈Z(d−1)×(d−1) → indexed by the edge set; reason: its rows and columns are the edge coordinates
  • encoding: "Q∈Zd×dQ\in\mathbb Z^{d\times d}Q∈Zd×d, β∈Zd\beta\in\mathbb Z^dβ∈Zd" → there are integer QZ,βZQ_{\mathbb Z},\beta_{\mathbb Z}QZ​,βZ​ whose casts are the rational Q,βQ,\betaQ,β, and invertibility mod qqq is stated for QZQ_{\mathbb Z}QZ​; reason: T−1T^{-1}T−1 is taken over Q\mathbb QQ
Preamble
import Mathlib
import Definitions.Def_InfoLossLAR_WorstCase_Rounding
import Definitions.Def_InfoLossLAR_WorstCase_FixedT

set_option autoImplicit false
Formal statement
namespace InfoLossLAR.WorstCase

/-- Corollary 6.8 (General tree-incidence transport), p. 29. `q` an odd prime, `d ≥ q`, `T` of
Definition 6.3, `𝒯` any oriented spanning tree on `Fin d`, `R_edge ∈ ℤ^{(d−1)×(d−1)}` (indexed
by the edges), `v ∈ ℤ^d` with `1ᵀv = q`, `z_0 ∈ ℤ^d` with `1ᵀz_0 ≡ 0 (mod q)`; the `d` columns
are ordered by `σ` (edges, then the extra column). With `D̄_𝒯 = [D_𝒯 | v]`,
`R̄ = diag(R_edge, 1)`, `D_T = D̄_𝒯 R̄`, `Q = T^{-1} D_T` and `β = T^{-1} z_0` (over `ℚ`):
`|det D̄_𝒯| = q`, `D_T ℤ^d ⊆ L(T)`, `z_0 ∈ L(T)`, `Q` and `β` are integral,
`det D_T = ±q det R_edge`, `det Q = det D̄_𝒯 det R̄ / det T = ±det R_edge`, every `x ∈ ℤ^d`
gives `w = D̄_𝒯 R̄ x + z_0 ∈ L(T)` with `w mod q ∈ H_0`, and if `det R_edge ≢ 0 (mod q)` then
`Q mod q ∈ GL_d(𝔽_q)`. -/
theorem corollary_6_8 (q d : ℕ) (hq : q.Prime) (hq2 : q ≠ 2) (hdq : q ≤ d)
    (𝒯 : OrientedTree d) (Redge : Matrix 𝒯.G.edgeSet 𝒯.G.edgeSet ℤ)
    (v : Fin d → ℤ) (hv : ∑ i, v i = (q : ℤ))
    (z₀ : Fin d → ℤ) (hz₀ : (q : ℤ) ∣ ∑ i, z₀ i)
    (σ : 𝒯.G.edgeSet ⊕ Unit ≃ Fin d) :
    let Dbar : Matrix (Fin d) (Fin d) ℤ := (𝒯.extended v).submatrix id σ.symm
    let Rbar : Matrix (Fin d) (Fin d) ℤ :=
      (Matrix.fromBlocks Redge 0 0 (1 : Matrix Unit Unit ℤ)).submatrix σ.symm σ.symm
    let DT : Matrix (Fin d) (Fin d) ℤ := Dbar * Rbar
    let Q : Matrix (Fin d) (Fin d) ℚ := TinvQ q d * DT.map (Int.cast : ℤ → ℚ)
    let β : Fin d → ℚ := (TinvQ q d).mulVec (fun i => (z₀ i : ℚ))
    |Dbar.det| = (q : ℤ) ∧
    (∀ x : Fin d → ℤ, DT.mulVec x ∈ imageLattice (TDef63 q d)) ∧
    z₀ ∈ imageLattice (TDef63 q d) ∧
    (DT.det = (q : ℤ) * Redge.det ∨ DT.det = -((q : ℤ) * Redge.det)) ∧
    Q.det = ((Dbar.det * Rbar.det : ℤ) : ℚ) / (((TDef63 q d).det : ℤ) : ℚ) ∧
    (Q.det = (Redge.det : ℚ) ∨ Q.det = -(Redge.det : ℚ)) ∧
    (∃ Qz : Matrix (Fin d) (Fin d) ℤ, Qz.map (Int.cast : ℤ → ℚ) = Q ∧
      (¬ (q : ℤ) ∣ Redge.det → IsUnit (matModq q Qz).det)) ∧
    (∃ βz : Fin d → ℤ, (fun i => (βz i : ℚ)) = β) ∧
    (∀ x : Fin d → ℤ, DT.mulVec x + z₀ ∈ imageLattice (TDef63 q d) ∧
      modq q (DT.mulVec x + z₀) ∈ H0 q d) := 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. 29, Corollary 6.8
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