Trace bound for fixed marks in a signed sweep step
ProvedOAI.SignedSweeps.occupied_sweep_trace_boundThis is the bound at a fixed assignment of marks in one step of the signed sweep moment induction.
Throughout, acts on the word space , with two-coloured into even and odd letters, by the signed action , where is the sign of the permutation induces between the odd positions of . For and partitions , , the operator is the sum, over the placements of even sites among the sites, of the tensor product of the orthogonal projections onto the -isotypic part of the even sites and the -isotypic part of the odd sites. Its entropy is , and a local type on sites is such a pair of total size . For an enumeration of the sites by blocks with sites each and local types , is the corresponding tensor product of local type projections, with . For a coefficient function on a finite group and a representation , .
Let , identified with the rectangle through the binary coordinates, let , let be an injection of marks into the positions and an enumeration of the other positions, and let , , , , . Write for the weighted moment of the -coordinate sweep , and
Assume that for and every signed occurrence of in one has . Let be the coefficients on of the -th powers of the positive squares of the products of column sweeps and of row sweeps, and let be their restrictions to along . Then for , , with at most rows,
Here, with marks in column and marks in row , is the product of inverse falling factorials, , and
where .
The bound is what remains to be summed over mark assignments in the induction step.
Formalization Note The upstream statement is reproduced verbatim from OccupiedSweep.lean; columns are indexed by and rows by through sweepBoard.
import Mathlib import Definitions.Def_SignedSweepMoment import Definitions.Def_OAISignedSweepsProofDefs open scoped BigOperators Classical
theorem OAI.SignedSweeps.occupied_sweep_trace_bound {a b j q R p l : ℕ} (hq : 0 < q)
(hn : p+l=2^(a+b)) (z : MarkedAssignment l (2^(a+b)))
{η τ : ℝ} (hη : 0 ≤ η) (hη' : η ≤ 1)
(HA : ∀ (lam : Partition (2^a)) (u v l : ℕ) (h : u+v+l=2^a)
(α : Partition u) (β : Partition v) (γ : Partition l),
SignedOccurrence h α β γ lam → weightedMoment lam (2^j) ≤
Real.exp (η*signedEntropy α β+clippedBudget τ (2^a) l))
(HB : ∀ (lam : Partition (2^b)) (u v l : ℕ) (h : u+v+l=2^b)
(α : Partition u) (β : Partition v) (γ : Partition l),
SignedOccurrence h α β γ lam → weightedMoment lam (2^j) ≤
Real.exp (η*signedEntropy α β+clippedBudget τ (2^b) l))
(hR : 2*max (2^a) (2^b)+2*q+1 ≤ R)
{u v : ℕ} (h : u+v=p) (α : Partition u) (β : Partition v)
(hα : α.1.colLen 0 ≤ q) (hβ : β.1.colLen 0 ≤ q) :
(LinearMap.trace ℂ (WordSpace p (Fin q ⊕ Fin q))
(pairTypeProjection h α β (Fin q) *
coefficientAction (signedWordRepresentation p (Fin q))
(fun g => columnPowerCoefficient a b (2^j) (g.viaEmbedding (markedInjection hn z))) *
coefficientAction (signedWordRepresentation p (Fin q))
(fun g => rowPowerCoefficient a b (2^j) (g.viaEmbedding (markedInjection hn z))))).re ≤
holePrefactor (markedBoardPlacement (sweepBoard a b) z) *
Real.exp (holeBudget τ (markedBoardPlacement (sweepBoard a b) z).1+
(η-1)*signedEntropy α β+l+(2^b : ℕ)*typedLineError (2^a) q R+
(2^a : ℕ)*typedLineError (2^b) q R) := by sorry