Filtered-sum forms of the paper weights #
The paper-facing statements package side conditions into if-weighted
summands. Internal permutation-sum proofs instead use paperSumFiltered.
This file supplies the exact conversion and nonnegativity lemmas at that
boundary.
theorem
Anderson4D.heppChainWeightExcept_nonneg
{t : PlaneTree}
{m : ℕ}
(z : HeppLeaf t → Fin 4 → ℤ)
(O : Finset (AdjacentIndex m))
(w : Fin m → HeppLeaf t)
:
theorem
Anderson4D.singleScaleChainWeight_nonneg
{t : PlaneTree}
{m : ℕ}
(z : HeppLeaf t → Fin 4 → ℤ)
(O : Finset (AdjacentIndex m))
(w : Fin m → HeppLeaf t)
:
theorem
Anderson4D.paperSum_primitiveChainWeight
{t : PlaneTree}
{m : ℕ}
(mu : t.Multiplicities)
(z : HeppLeaf t → Fin 4 → ℤ)
:
The left side of Proposition 5.7 as a filtered paperSum.
theorem
Anderson4D.paperSum_primitiveSeparatedChainWeight
{t : PlaneTree}
{m : ℕ}
(mu : t.Multiplicities)
(z : HeppLeaf t → Fin 4 → ℤ)
:
paperSum (leafMultiplicity mu) (primitiveSeparatedChainWeight z) = paperSumFiltered (leafMultiplicity mu) (fun (w : Fin m → HeppLeaf t) => NoProperLeafBlock w ∧ NoAdjacentEqual w)
(heppChainWeight z)
The left side of Proposition 5.9 as a doubly filtered paperSum.
theorem
Anderson4D.paperSum_singleScaleChainWeight
{t : PlaneTree}
{m : ℕ}
(mu : t.Multiplicities)
(z : HeppLeaf t → Fin 4 → ℤ)
(O : Finset (AdjacentIndex m))
:
paperSum (leafMultiplicity mu) (singleScaleChainWeight z O) = paperSumFiltered (leafMultiplicity mu) (NoAdjacentOutside O) (heppChainWeightExcept z O)
The left side of Proposition 5.10 as a filtered paperSum.