Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Letwin Tensor Comparison in Trace-Gram Form

Proved
FunctionalInequalities.Analysis.letwin_tensor_comparison_trace_gram_readable

by Lazyfill · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-inequalitieskls-conjecturekls-modularkls-readableletwin2026log-concave

This formalizes equation (2.12) of Letwin (arXiv:2607.24164v1), locator (2.12), p. 10, in trace-Gram coordinates.

Let HHH be positive definite, BBB Hermitian, and let TabcT_{abc}Tabc​ have the two symmetries Tabc=TbacT_{abc}=T_{bac}Tabc​=Tbac​ and Tabc=TacbT_{abc}=T_{acb}Tabc​=Tacb​. Define the trace-Gram matrix

Gij=tr⁡(H−1TiH−1Tj),(Ti)ab=Tiab.G_{ij}=\operatorname{tr}(H^{-1}T_iH^{-1}T_j), \qquad (T_i)_{ab}=T_{iab}.Gij​=tr(H−1Ti​H−1Tj​),(Ti​)ab​=Tiab​.

Then

∑i,j(H−1)ijtr⁡(BTiBTj)≤tr⁡(BHB G).\sum_{i,j}(H^{-1})_{ij}\operatorname{tr}(BT_iBT_j) \le \operatorname{tr}(BHB\,G).i,j∑​(H−1)ij​tr(BTi​BTj​)≤tr(BHBG).

This coordinate form is reusable when the Gram forcing is represented as a matrix trace rather than as an expanded fourfold sum.

Original Lean declaration header

Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.

theorem letwin_tensor_comparison_trace_gram {n : ℕ}
    (H B : Matrix (Fin n) (Fin n) ℝ) (hH : H.PosDef) (hB : B.IsHermitian)
    (T : Fin n → Fin n → Fin n → ℝ)
    (hT1 : ∀ a b c, T a b c = T b a c) (hT2 : ∀ a b c, T a b c = T a c b) :
    (∑ i : Fin n, ∑ j : Fin n, H⁻¹ i j *
      (B * (Matrix.of fun a b => T i a b) * B * (Matrix.of fun a b => T j a b)).trace) ≤
      (B * H * B * (Matrix.of fun i j =>
        (H⁻¹ * (Matrix.of fun a b => T i a b) * H⁻¹ *
          (Matrix.of fun a b => T j a b)).trace)).trace

Module navigation

Module: Analysis/Matrix/TraceGram.

Supporting theorems: letwin_tensor_comparison, trace_mul_mul_mul_eq_sum.

Next: four_tensor_trace_le_density_add_twice_energy.

Source excerpt, lines 50–58 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Matrix_TraceGram

Formal statement

theorem FunctionalInequalities.Analysis.letwin_tensor_comparison_trace_gram_readable {n : ℕ}
    (H B : Matrix (Fin n) (Fin n) ℝ) (hH : H.PosDef) (hB : B.IsHermitian)
    (T : Fin n → Fin n → Fin n → ℝ)
    (hT1 : ∀ a b c, T a b c = T b a c) (hT2 : ∀ a b c, T a b c = T a c b) :
    (∑ i : Fin n, ∑ j : Fin n, H⁻¹ i j *
      (B * (Matrix.of fun a b => T i a b) * B * (Matrix.of fun a b => T j a b)).trace) ≤
      (B * H * B * (Matrix.of fun i j =>
        (H⁻¹ * (Matrix.of fun a b => T i a b) * H⁻¹ *
          (Matrix.of fun a b => T j a b)).trace)).trace := by sorry
Source
Source: Letwin, The KLS constant is O(log^(1/4) n) (arXiv:2607.24164v1), Theorem 2.5. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Matrix/TraceGram.lean#L47-L84 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Matrix.TraceGram`, declaration `FunctionalInequalities.Analysis.letwin_tensor_comparison_trace_gram`; the repository is private at upload time).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me