Truncated Type Sum Recurrence
ProvedLIDT.MIPStarRE.LDT.Pasting.truncatedTypeSumRecurrenceHermitian bounded recurrence for truncated type sums. Let be a positive semidefinite operator with , let d and prefixLen be natural numbers, and let tauTail be a Boolean type pattern of any finite tail length. Write for truncatedTypeSums G d prefixLen tau. Then the truncated sum is Hermitian, positive semidefinite, bounded above by the identity, and obeys the one-step recurrence obtained by prepending a Boolean bit.
The sum keeps exactly those prefix type patterns whose combined Hamming weight can reach the threshold d + 1; each type contributes the monomial . The recurrence is the structural step used by fromHToGAdjacentStage_paperMoveChain, fromHToG_SUS_context_avg_le_one, and fromHToG_ofGHatFactsAndHalfSandwich.
Formalization credit: Sirui Lu, Ruixuan Deng, Yanqiao Zhu, and Zhengfeng Ji (arXiv:2609.19814). Mathematical source: Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen (arXiv:2009.12982).
Formalization Note. The source declaration is MIPStarRE.LDT.Pasting.truncatedTypeSumRecurrence; its Lean statement gives the exact quantifier order and all boundary hypotheses.
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DiagonalLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_Distribution
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LinePolynomials
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OpFamily
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OperatorExpectations
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersBase
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersFiniteAnswers
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_QuantumState
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_SubMeasurementCore
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_SubMeasurementFamilies
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_TensorPlacement
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Tuples
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_BlockDiagonal
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_NormalizedTrace
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Order
import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_TracePairing
import Mathlib
open scoped _root_.Matrix
namespace LIDT.MIPStarRE.LDT.Pasting
end LIDT.MIPStarRE.LDT.Pasting
open LIDT
/-!
# Section 12 pasting: Bernoulli truncated sums
Truncated type sums and their one-step recurrence.
-/
@[expose] public section
open LIDT.MIPStarRE.LDT.Pasting
open MIPStarRE.LDT
open scoped BigOperators MatrixOrder _root_.Matrix ComplexOrder
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
/-! ### Bernoulli recurrence weights -/theorem LIDT.MIPStarRE.LDT.Pasting.truncatedTypeSumRecurrence
(G : _root_.LIDT.MIPStarRE.Quantum.Op ι)
(hGpsd : 0 ≤ G)
(hGleOne : G ≤ 1)
(d prefixLen : ℕ)
{tailLen : ℕ} (τtail : _root_.LIDT.MIPStarRE.LDT.Pasting.GHatType tailLen) :
(_root_.LIDT.MIPStarRE.LDT.Pasting.truncatedTypeSums G d prefixLen τtail)ᴴ = _root_.LIDT.MIPStarRE.LDT.Pasting.truncatedTypeSums G d prefixLen τtail ∧
0 ≤ _root_.LIDT.MIPStarRE.LDT.Pasting.truncatedTypeSums G d prefixLen τtail ∧
_root_.LIDT.MIPStarRE.LDT.Pasting.truncatedTypeSums G d prefixLen τtail ≤ 1 ∧
_root_.LIDT.MIPStarRE.LDT.Pasting.truncatedTypeSums G d (prefixLen + 1) τtail =
_root_.LIDT.MIPStarRE.LDT.Pasting.truncatedTypeSums G d prefixLen (_root_.LIDT.MIPStarRE.LDT.Pasting.prependTypeBit true τtail) * G +
_root_.LIDT.MIPStarRE.LDT.Pasting.truncatedTypeSums G d prefixLen (_root_.LIDT.MIPStarRE.LDT.Pasting.prependTypeBit false τtail) * (1 - G) := by sorry