Documentation

LeanPool.TrilinearHilbertTransform.Auto.Sec145bExportedSideEstimate.Setup

Section 14.5b: The exported side estimate #

This file was automatically generated by Claude.

Formalization of blueprint Section 14, "The two-side estimate" (sec:sides), subsection 5, "Common cuts, hull maxima, and summation" (lines 2425-2459), from the paragraph "Exported side estimate" (side-estimate, lines 2454-2456) of blueprint/formalization_blueprint.tex: the assembly, on the main columns, of the transfer identity, the pair-small and far terms, the frozen near bands, the freeze and flag errors and the critical near-band bound into the side estimate of a localization leaf. Split from Sec14_5CommonCutsHullMaximaSummation (which has 6936 lines) at this numbered item of the blueprint.

The restored form at one cell on the main columns (blueprint lines 2241-2263) #

theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.restored_boundM {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (cat : Fin 4 → List (CatCol bf.Vtx)) (mbs : (l : Fin 4) → bf.MainBudget (cat l)) {a b c d : Fin 4} (hab : a ≠ b) (hac : a ≠ c) (had : a ≠ d) (hbc' : b ≠ c) (hbd : b ≠ d) (hcd : c ≠ d) (Lf : SearchLeaf) (G : bf.Grp) {I : ℤ × ℤ} (hI : I ∈ A.cells) (x xg : Fin 4 → ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) (hxb : (columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (xg b) = (columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (x b)) (xa : ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) (hxa : x a = (columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) xa) :
‖(fp.Λc I) (Function.update (Function.update x c ((fp.ballFilt c (cat c) I G (Lf.role c)) ((layerOp (fun (m : ℕ) => fp.cumFilt c (cat c) I m) (Lf.layers c)) (bf.basicIn fp.Mc c I)))) d ((fp.ballFilt d (cat d) I G (Lf.role d)) ((layerOp (fun (m : ℕ) => fp.cumFilt d (cat d) I m) (Lf.layers d)) (bf.basicIn fp.Mc d I))))‖ ≤ (List.map (fun (t' : ℤ × List ℕ) => (List.map (fun (t : ℤ × List ℕ) => ‖(fp.Λc I) (Function.update (Function.update (Function.update x a (chainSide fp.P (fp.mergeStepsM cat a c d (fp.Lc + 5) I (fp.slotFiltM G (Lf.role c) I t.2) (fp.slotFiltM G (Lf.role d) I t'.2)) (x a))) c (bf.basicIn fp.Mc c I + bf.Ucol fp.Mc c I)) d (bf.basicIn fp.Mc d I + bf.Ucol fp.Mc d I))‖ + (‖(fp.Λc I) (Function.update (Function.update (Function.update x a (chainSide fp.P (fp.mergeStepsM cat a c d (fp.Lc + 5) I (fp.slotFiltM G (Lf.role c) I t.2) (fp.slotFiltM G (Lf.role d) I t'.2)) (x a))) c (bf.Ucol fp.Mc c I)) d (bf.basicIn fp.Mc d I))‖ + ‖(fp.Λc I) (Function.update (Function.update (Function.update x a (chainSide fp.P (fp.mergeStepsM cat a c d (fp.Lc + 5) I (fp.slotFiltM G (Lf.role c) I t.2) (fp.slotFiltM G (Lf.role d) I t'.2)) (x a))) c (bf.basicIn fp.Mc c I)) d (bf.Ucol fp.Mc d I))‖ + ‖(fp.Λc I) (Function.update (Function.update (Function.update x a (chainSide fp.P (fp.mergeStepsM cat a c d (fp.Lc + 5) I (fp.slotFiltM G (Lf.role c) I t.2) (fp.slotFiltM G (Lf.role d) I t'.2)) (x a))) c (bf.Ucol fp.Mc c I)) d (bf.Ucol fp.Mc d I))‖) + ‖chainDefectSel (fp.Λc I) fp.P a c d x (bf.basicIn fp.Mc c I) (bf.basicIn fp.Mc d I) (fun (p q : ℕ) => q + 2 < p ∨ p + 2 < q) (fp.mergeStepsM cat a c d (fp.Lc + 5) I (fp.slotFiltM G (Lf.role c) I t.2) (fp.slotFiltM G (Lf.role d) I t'.2)) (x a)‖ + ∑ j ∈ Finset.range (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2).length, ∑ o ∈ Finset.range 5, 2 / ↑fp.P * ‖fp.nearTermGM cat mbs (fp.Lc + 5) a c d G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2) I I.1 xg xa j o‖) (posExpand (Lf.layers c).reverse)).sum) (posExpand (Lf.layers d).reverse)).sum

Blueprint lines 2241-2263 at one cell and group of a leaf on the main columns: the form of the sides and the whole leaf outputs in the complement slots is at most the sum over the pairs of positive chains of the transferred main term with the full arguments Y_c, Y_d, the three restoration corrections (each with a basic side U), the far band defects, and 2/P times the near band sums of the global steps at the depth of the cell, over the steps and the five offsets.

Flags on the main columns (blueprint line 2393) #

noncomputable def TrilinearHT.Auto.ActiveSetup.blkStart {κ' : LocalKernelClass} {c₀ : ℕ} (A : ActiveSetup κ' c₀) (K : ℕ) (h : ℤ) :

The start of the depth block of length K (counted from the root) containing the depth h.

Equations
Instances For
    theorem TrilinearHT.Auto.ActiveSetup.blkStart_bounds {κ' : LocalKernelClass} {c₀ : ℕ} (A : ActiveSetup κ' c₀) {K : ℕ} (hK1 : 1 ≤ K) (h : ℤ) :
    A.blkStart K h ≤ h ∧ h < A.blkStart K h + ↑K

    The block start lies in (h - K, h].

    theorem TrilinearHT.Auto.ActiveSetup.blkStart_dvd {κ' : LocalKernelClass} {c₀ : ℕ} (A : ActiveSetup κ' c₀) (K : ℕ) (h : ℤ) :
    ↑K ∣ A.blkStart K h - A.R.1
    def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.unflM {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (cat : Fin 4 → List (CatCol bf.Vtx)) (mbs : (l : Fin 4) → bf.MainBudget (cat l)) (a c d : Fin 4) (G : bf.Grp) (jc jd : ℕ) (Dl : List (Bool × ℕ × Option ℕ)) (j o K : ℕ) (C₀ : ℝ) (I : ℤ × ℤ) :

    The unflagged uses (blueprint line 2393), on the main columns: both frozen complements of the step j at the offset o at the block start have normalized squares at most (2 C₀)² on every active ancestor of the use within its block.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      The bound of one slot tuple at one cell on the main columns (blueprint lines 2241-2394) #

      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.tuple_boundM {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (cat : Fin 4 → List (CatCol bf.Vtx)) (mbs : (l : Fin 4) → bf.MainBudget (cat l)) {a b c d : Fin 4} (hab : a ≠ b) (hac : a ≠ c) (had : a ≠ d) (hbc : b ≠ c) (hbd : b ≠ d) (hcd : c ≠ d) (Lf : SearchLeaf) (G : bf.Grp) {I : ℤ × ℤ} (hI : I ∈ A.cells) (x : Fin 4 → ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) (xa : ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) (hxa : x a = (columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) xa) (hxar : xa ∈ (↑(colRelabel (bf.rv fp.Mc (cat a)))).range) {τ : ℝ} (hτ : 0 ≤ τ) (hpair : PairSmall (dyadicGridLeft A.G I.1 I.2) (dyadicGridLength A.G I.1) (A.w I) c d (A.Y I c) (A.Y I d) τ) {cF : ℝ} (hfar : ∀ t ∈ posExpand (Lf.layers c).reverse, ∀ t' ∈ posExpand (Lf.layers d).reverse, ‖chainDefectSel (fp.Λc I) fp.P a c d x (bf.basicIn fp.Mc c I) (bf.basicIn fp.Mc d I) (fun (p q : ℕ) => q + 2 < p ∨ p + 2 < q) (fp.mergeStepsM cat a c d (fp.Lc + 5) I (fp.slotFiltM G (Lf.role c) I t.2) (fp.slotFiltM G (Lf.role d) I t'.2)) (x a)‖ ≤ cF * (‖x a‖ / √(dyadicGridLength A.G I.1)) * (‖x b‖ / √(dyadicGridLength A.G I.1))) (z : Fin 4 → ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) (Yb : List ℕ → List ℕ → ℕ → ℕ → ℕ → ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) (Fb : List ℕ → List ℕ → ℕ → ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) (Unfl : List ℕ → List ℕ → ℕ → ℕ → Prop) {C₀ : ℝ} (hC₀ : 0 ≤ C₀) (hFc : ∀ (t t' : List ℕ) (j : ℕ), ‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (fp.FfrM cat mbs a c d (fp.Lc + 5) G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t t') j I.1)‖ / √(dyadicGridLength A.G I.1) ≤ C₀) (hYcur : ∀ (t t' : List ℕ) (j o : ℕ), √(∑ p ∈ fp.uoM o, ‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (fp.YfrM cat mbs a c d (fp.Lc + 5) G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t t') j o I.1 p)‖ ^ 2) / √(dyadicGridLength A.G I.1) ≤ C₀) (hFb : ∀ (t t' : List ℕ) (j o : ℕ), Unfl t t' j o → ‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (Fb t t' j)‖ / √(dyadicGridLength A.G I.1) ≤ 2 * C₀) :
      ‖(fp.Λc I) (Function.update (Function.update x c ((fp.ballFilt c (cat c) I G (Lf.role c)) ((layerOp (fun (m : ℕ) => fp.cumFilt c (cat c) I m) (Lf.layers c)) (bf.basicIn fp.Mc c I)))) d ((fp.ballFilt d (cat d) I G (Lf.role d)) ((layerOp (fun (m : ℕ) => fp.cumFilt d (cat d) I m) (Lf.layers d)) (bf.basicIn fp.Mc d I))))‖ ≤ (List.map (fun (t' : ℤ × List ℕ) => (List.map (fun (t : ℤ × List ℕ) => τ * (‖x a‖ / √(dyadicGridLength A.G I.1)) * (‖x b‖ / √(dyadicGridLength A.G I.1)) + localFormUniformConstant κ' * (‖x a‖ / √(dyadicGridLength A.G I.1) * (‖x b‖ / √(dyadicGridLength A.G I.1)) * (‖bf.Ucol fp.Mc c I‖ / √(dyadicGridLength A.G I.1) * (‖bf.basicIn fp.Mc d I‖ / √(dyadicGridLength A.G I.1)) + ‖bf.basicIn fp.Mc c I‖ / √(dyadicGridLength A.G I.1) * (‖bf.Ucol fp.Mc d I‖ / √(dyadicGridLength A.G I.1)) + ‖bf.Ucol fp.Mc c I‖ / √(dyadicGridLength A.G I.1) * (‖bf.Ucol fp.Mc d I‖ / √(dyadicGridLength A.G I.1)))) + cF * (‖x a‖ / √(dyadicGridLength A.G I.1)) * (‖x b‖ / √(dyadicGridLength A.G I.1)) + ∑ j ∈ Finset.range (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2).length, ∑ o ∈ Finset.range 5, 2 / ↑fp.P * ((if Unfl t.2 t'.2 j o then ‖fp.nearFormM I a b (if (fp.gStM cat mbs a c d (fp.Lc + 5) G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2) j I.1).1 = true then c else d) (if (fp.gStM cat mbs a c d (fp.Lc + 5) G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2) j I.1).1 = true then d else c) z (fp.uoM o) (fun (p : ℕ) => ((fp.gStM cat mbs a c d (fp.Lc + 5) G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2) j I.1).2.1 (p + 1)) (helpPre fp.P (fp.gPreM cat mbs a c d (fp.Lc + 5) G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2) j I.1) xa) - ((fp.gStM cat mbs a c d (fp.Lc + 5) G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2) j I.1).2.1 p) (helpPre fp.P (fp.gPreM cat mbs a c d (fp.Lc + 5) G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2) j I.1) xa)) (Yb t.2 t'.2 j o) (x b) (Fb t.2 t'.2 j)‖ else 0) + localFormUniformConstant κ' * (‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (x b)‖ / √(dyadicGridLength A.G I.1) * (‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) xa‖ / √(dyadicGridLength A.G I.1)) * (4 * C₀ * (√(∑ p ∈ fp.uoM o, ‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (fp.YfrM cat mbs a c d (fp.Lc + 5) G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2) j o I.1 p - Yb t.2 t'.2 j o p)‖ ^ 2) / √(dyadicGridLength A.G I.1)) + C₀ * (‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (fp.FfrM cat mbs a c d (fp.Lc + 5) G (Lf.role c) (Lf.role d) (fp.mergeDescM (Lf.role c) (Lf.role d) t.2 t'.2) j I.1 - Fb t.2 t'.2 j)‖ / √(dyadicGridLength A.G I.1)) + if Unfl t.2 t'.2 j o then 0 else C₀ ^ 2)))) (posExpand (Lf.layers c).reverse)).sum) (posExpand (Lf.layers d).reverse)).sum

      Blueprint lines 2241-2262 and 2384-2394 at one cell and group of a leaf on the main columns, for basic complements: the restored form (sides x in the slots a, b, whole leaf outputs in the complement slots c, d) is at most the sum over the pairs of positive chains of the pair-small main bound τ S_a S_b, the three restoration corrections C_κ S_a S_b S_u S_v with a basic side U, the far bound c_F S_a S_b and, over the steps and offsets, 2/P times the frozen near band forms of unflagged uses plus the freeze and flag errors (near_useM). Here the side of a is the restriction of a global side x_a in the range of the relabeling of its catalog.

      The two-side leaf data on the main columns (blueprint lines 2241-2456) #

      The data of the two-side estimate of one localization leaf on the main columns: the slot catalogs with their main budgets, the search leaf, the slot u of the basic U argument (none for the all-basic pattern), the block length K, the slot inputs, the cell side values (the whole output for the slot u) and the global sides of the basic slots, restricting to the cell sides, in the range of the relabeling of their catalogs, and of the rolling form S_h = Z_h - Z_b + W_b within the depth block starting at b (blueprint eq:sides, line 2125, with W_b = Z_b - Z_{u_b} + V_b).

      Instances For
        noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.out {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (l : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :
        ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))

        The whole leaf output of the slot l and group G at a cell.

        Equations
        Instances For
          noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.ns {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (l : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

          The normalized size of the side of the slot l and group G at a cell.

          Equations
          Instances For
            theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.ns_nonneg {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (l : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :
            0 ≤ T.ns l G I
            noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.s2 {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (G : bf.Grp) (I : ℤ × ℤ) :

            The sum over the slots of the squared normalized side sizes.

            Equations
            Instances For
              theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.s2_nonneg {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (G : bf.Grp) (I : ℤ × ℤ) :
              0 ≤ T.s2 G I
              noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.pe {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (l : Fin 4) :

              The positive chains of the slot l of the leaf.

              Equations
              Instances For

                The merged descriptors of a pair of positive chains of the complement slots c, d.

                Equations
                Instances For

                  The admissible slot tuples of the 2+2 estimate: distinct slots, transferred side a ≠ u.

                  Equations
                  Instances For

                    A complement slot is the basic U slot (its core vanishes).

                    Equations
                    Instances For
                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.two_two_cellM {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (I : ℤ × ℤ) (gs : Finset bf.Grp) (Bnd : Fin 4 → Fin 4 → Fin 4 → Fin 4 → bf.Grp → ℝ) (hB0 : ∀ (a b c d : Fin 4) (G : bf.Grp), 0 ≤ Bnd a b c d G) (hB : ∀ (a b c d : Fin 4), T.Val a b c d → ∀ G ∈ gs, ‖(fp.Λc I) (Function.update (Function.update (fun (l : Fin 4) => T.sv l G I) c (T.out c G I)) d (T.out d G I))‖ ≤ Bnd a b c d G) :
                      ‖∑ σ : Fin 4 → Fin 3 with (∀ (l : Fin 4), σ l ≠ 2) ∧ {l : Fin 4 | σ l = 0}.card = 2 ∧ {l : Fin 4 | σ l = 1}.card = 2, ∑ G ∈ gs, (fp.Λc I) fun (l : Fin 4) => if σ l = 0 then T.out l G I else T.sv l G I‖ ≤ 6 * ∑ G ∈ gs, ∑ a : Fin 4, ∑ b : Fin 4, ∑ c : Fin 4, ∑ d : Fin 4, Bnd a b c d G

                      Blueprint lines 2446-2456 at one cell, on the main columns: the restored 2+2 patterns (whole outputs in the two core slots, sides in the two side slots) are at most six times the sum over the groups and slot tuples of bounds of the restored forms with the transferred side a not the slot u.

                      Absolute and strong parts of one slot tuple at one cell (blueprint lines 2384-2394) #

                      noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.Ybk {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j o : ℕ) (I : ℤ × ℤ) (p : ℕ) :
                      ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))

                      The frozen complement band family of a step and offset at the block start of a cell.

                      Equations
                      Instances For
                        noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.Fbk {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) :
                        ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))

                        The frozen other complement of a step at the block start of a cell.

                        Equations
                        Instances For
                          def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.unfl {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j o : ℕ) (I : ℤ × ℤ) :

                          The unflagged uses of a step and offset.

                          Equations
                          Instances For
                            noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.Xb {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) (p : ℕ) :
                            ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))

                            The helper bands of the global side of a after the global helper prefix of the step j.

                            Equations
                            • One or more equations did not get rendered due to their size.
                            Instances For
                              noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.nf {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a b c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j o : ℕ) (I : ℤ × ℤ) :

                              The frozen near band form of a step and offset at a use.

                              Equations
                              • One or more equations did not get rendered due to their size.
                              Instances For
                                noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.absPart {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ τ cF : ℝ) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

                                The absolute part of a slot tuple at a cell and group: the pair-small and far parts and the frozen near band forms of the unflagged uses, with the transfer coefficients 2/P.

                                Equations
                                • One or more equations did not get rendered due to their size.
                                Instances For
                                  noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.strPart {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

                                  The strong part of a slot tuple at a cell and group: the restoration corrections with a basic side U, and the freeze differences and flags of the near band forms.

                                  Equations
                                  • One or more equations did not get rendered due to their size.
                                  Instances For
                                    theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.list_sum_map_add {α : Type u_1} (L : List α) (f g : α → ℝ) :
                                    (List.map (fun (x : α) => f x + g x) L).sum = (List.map f L).sum + (List.map g L).sum
                                    theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.cell_boundM {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {a b c d : Fin 4} (hV : T.Val a b c d) (hU : ¬T.Ucase c d) (G : bf.Grp) {I : ℤ × ℤ} (hI : I ∈ A.cells) {τ : ℝ} (hτ : 0 ≤ τ) (hpair : PairSmall (dyadicGridLeft A.G I.1 I.2) (dyadicGridLength A.G I.1) (A.w I) c d (A.Y I c) (A.Y I d) τ) {cF : ℝ} (hfar : ∀ t ∈ T.pe c, ∀ t' ∈ T.pe d, ‖chainDefectSel (fp.Λc I) fp.P a c d (fun (l : Fin 4) => T.sv l G I) (bf.basicIn fp.Mc c I) (bf.basicIn fp.Mc d I) (fun (p q : ℕ) => q + 2 < p ∨ p + 2 < q) (fp.mergeStepsM T.cat a c d (fp.Lc + 5) I (fp.slotFiltM G (T.Lf.role c) I t.2) (fp.slotFiltM G (T.Lf.role d) I t'.2)) (T.sv a G I)‖ ≤ cF * T.ns a G I * T.ns b G I) {C₀ : ℝ} (hC₀ : 0 ≤ C₀) (hsc : ‖bf.basicIn fp.Mc c I‖ ≤ C₀ * √(dyadicGridLength A.G I.1)) (hsd : ‖bf.basicIn fp.Mc d I‖ ≤ C₀ * √(dyadicGridLength A.G I.1)) :
                                    ‖(fp.Λc I) (Function.update (Function.update (fun (l : Fin 4) => T.sv l G I) c (T.out c G I)) d (T.out d G I))‖ ≤ T.absPart C₀ τ cF a b c d G I + T.strPart C₀ a b c d G I

                                    Blueprint lines 2241-2262 and 2384-2394 at one cell and group of the leaf, for a valid slot tuple with basic complements: the restored form is at most the absolute part plus the strong part.

                                    Blocks and near band uses of the leaf (blueprint lines 2425-2443) #

                                    noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.bk {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (I : ℤ × ℤ) :

                                    The block index of a cell: (I.1 - R.1) / K.

                                    Equations
                                    Instances For
                                      noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.offI {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (I : ℤ × ℤ) :

                                      The offset of a cell in its block: (I.1 - R.1) mod K.

                                      Equations
                                      Instances For
                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.bk_offI {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {I : ℤ × ℤ} (hI : A.R.1 ≤ I.1) :
                                        I.1 = A.R.1 + ↑(T.K * T.bk I + T.offI I) ∧ T.offI I < T.K ∧ A.blkStart T.K I.1 = A.R.1 + ↑(T.K * T.bk I)

                                        Below the root, a cell depth is its block start plus its offset, the offset is less than K and the block start is blkStart.

                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.offI_eq {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (J : ℤ × ℤ) (β m : ℕ) (hm : m < T.K) (hJ : J.1 = A.R.1 + ↑(T.K * β + m)) :
                                        T.offI J = m

                                        The offset of a cell at depth R.1 + K β + m with m < K is m.

                                        noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.tOf {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (l : Fin 4) (i : ℕ) :

                                        The chain of index i of the positive chains of slot l.

                                        Equations
                                        Instances For

                                          The complement slot of the step j of descriptors D.

                                          Equations
                                          Instances For

                                            The other complement slot of the step j of descriptors D.

                                            Equations
                                            Instances For
                                              noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.nU {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (S : Finset (ℤ × ℤ)) (gs : ℤ × ℤ → Finset bf.Grp) (C₀ : ℝ) (a b e : Fin 4) (m : (Fin 4 × Fin 4 × ℕ × ℕ × ℕ × ℕ) × bf.Grp × ℕ) :

                                              The uses of an index ((c, d, i, i', j, o), G, β) for the slots a, b and the banded complement slot e: the cells of S of block β carrying the group, with a valid slot tuple with basic complements, step j banding e, and unflagged.

                                              Equations
                                              • One or more equations did not get rendered due to their size.
                                              Instances For

                                                The near band applications of the leaf (blueprint lines 2425-2443) #

                                                noncomputable def TrilinearHT.Auto.nbCM (κ : LocalKernelClass) {q : ℝ} (hq2 : 2 < q) (hq3 : q < 3) :

                                                The constant of near_band_criticalM.

                                                Equations
                                                Instances For
                                                  theorem TrilinearHT.Auto.nbCM_nonneg (κ : LocalKernelClass) {q : ℝ} (hq2 : 2 < q) (hq3 : q < 3) :
                                                  0 ≤ nbCM κ hq2 hq3

                                                  The step descriptors before the step j of an outer index.

                                                  Equations
                                                  Instances For

                                                    The step descriptor j of an outer index.

                                                    Equations
                                                    Instances For
                                                      noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.nearSpectators {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a : Fin 4) :
                                                      (Fin 4 × Fin 4 × ℕ × ℕ × ℕ × ℕ) × bf.Grp × ℕ → Fin 4 → ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))

                                                      Frozen spectator inputs indexed by the common near-band use data.

                                                      Equations
                                                      • One or more equations did not get rendered due to their size.
                                                      Instances For
                                                        noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.nearBands {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a : Fin 4) :
                                                        (Fin 4 × Fin 4 × ℕ × ℕ × ℕ × ℕ) × bf.Grp × ℕ → ℕ → ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))

                                                        Frozen helper bands indexed by the same near-band use data.

                                                        Equations
                                                        • One or more equations did not get rendered due to their size.
                                                        Instances For
                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.near_use_averages {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {S : Finset (ℤ × ℤ)} {gs : ℤ × ℤ → Finset bf.Grp} {C₀ : ℝ} {a b e : Fin 4} {m : (Fin 4 × Fin 4 × ℕ × ℕ × ℕ × ℕ) × bf.Grp × ℕ} {I : ℤ × ℤ} (hI : I ∈ T.nU S gs C₀ a b e m) (hblock : A.blkStart T.K I.1 = A.R.1 + ↑(T.K * m.2.2)) (J : ℤ × ℤ) (hJ : J ∈ A.cells) (hsub : dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2) (hbJ : A.R.1 + ↑(T.K * m.2.2) ≤ J.1) :
                                                          dyadicEnergyAverage A.G (fun (r : ℝ) => ENNReal.ofReal (∑ p ∈ fp.uoM m.1.2.2.2.2.2, ‖augPhys (T.nearBands a m p) r‖ ^ 2)) J ≤ ENNReal.ofReal ((2 * C₀) ^ 2) ∧ ∀ (j' : Fin 4), dyadicEnergyAverage A.G (fun (r : ℝ) => ‖augPhys (T.nearSpectators a m j') r‖ₑ ^ 2) J ≤ ENNReal.ofReal ((2 * C₀) ^ 2)

                                                          An unflagged near-band use supplies both normalized energy side conditions. This includes the zero spectator slots, so both near-band variants use the same proof.

                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.Xb_eq_gBandC {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) (hau : T.u ≠ some a) (hj : j < (T.desc c d t t').length) (p : ℕ) :
                                                          T.Xb a c d G t t' j I p = (fp.gBandC a (T.cat a) (T.mbs a) G (T.Lf.role c) (T.Lf.role d) ((T.desc c d t t').getD j (true, 0, none)) (List.take j (T.desc c d t t')) (p + 1) I.1 - fp.gBandC a (T.cat a) (T.mbs a) G (T.Lf.role c) (T.Lf.role d) ((T.desc c d t t').getD j (true, 0, none)) (List.take j (T.desc c d t t')) p I.1) (T.gside a G I.1)

                                                          Transport a leaf helper band to the global band operator on its physical side.

                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.near_tripleM {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {q : ℝ} (hq2 : 2 < q) (hq3 : q < 3) {a b e : Fin 4} (hab : a ≠ b) (hae : a ≠ e) (hbe : b ≠ e) (hau : T.u ≠ some a) (hbu : T.u ≠ some b) (hanc : A.AncClosed) {Nd N : ℕ} (hKNd : A.DepthWin Nd) (hKN : T.K ≤ 2 ^ N) (S : Finset (ℤ × ℤ)) (hS : S ⊆ A.cells) (gs : ℤ × ℤ → Finset bf.Grp) (gset : Finset bf.Grp) (Lp Jm Bn k : ℕ) (Act : Finset (ℤ × ℤ)) (hact : ∀ I ∈ S, I ∈ Act ∧ ∀ G ∈ gs I, G ∈ fp.groupsAt I k) {Mp : ℝ} (hMp : ∀ (y : ℝ), ↑{c ∈ Act | y ∈ dyadicGridCell A.G c.1 c.2}.card ≤ Mp) {okA okB : bf.Grp → ℤ × ℤ → Prop} {BA BB : ℝ} (hcapA : A.VarCap gset (T.Z a) okA BA) (hcapB : A.VarCap gset (T.Z b) okB BB) (hok : ∀ I ∈ S, ∀ G ∈ gs I, ∀ J ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2 → okA G J ∧ okB G J) {EWa EWb : ℝ} (hEWa : ∑ G ∈ gset, ∑ β ∈ Finset.range Bn, ‖(columnL2Restriction (⋃ J ∈ Finset.image (fun (I : ℤ × ℤ) => ancAt A.G I (A.R.1 + ↑(T.K * β))) ({I ∈ S | G ∈ gs I ∧ T.bk I = β}), dyadicGridCell A.G J.1 J.2) ⋯) (T.Wb a G (A.R.1 + ↑(T.K * β)))‖ ^ 2 ≤ EWa) (hEWb : ∑ G ∈ gset, ∑ β ∈ Finset.range Bn, ‖(columnL2Restriction (⋃ J ∈ Finset.image (fun (I : ℤ × ℤ) => ancAt A.G I (A.R.1 + ↑(T.K * β))) ({I ∈ S | G ∈ gs I ∧ T.bk I = β}), dyadicGridCell A.G J.1 J.2) ⋯) (T.Wb b G (A.R.1 + ↑(T.K * β)))‖ ^ 2 ≤ EWb) {C₀ : ℝ} (hC₀ : 0 ≤ C₀) {ρ : ℝ} (hρ : 0 < ρ) (hρ1 : ρ < 1) (hP : 1 ≤ fp.P) {Γa Γb : ℝ} (hΓa : fp.stackEA (nOs Lp Jm) (T.cat a) (T.mbs a) T.Dpre N BA EWa ≤ (↑fp.P + 2) * Γa * dyadicGridLength A.G A.R.1) (hΓb : ↑(nOs Lp Jm).card * (↑N * BB + EWb) ≤ Γb * dyadicGridLength A.G A.R.1) :
                                                          ∃ C ⊆ A.cells, dyadicRootLength A.G (maximalDyadicCells A.G C) ≤ ρ * dyadicGridLength A.G A.R.1 ∧ ∑ m ∈ nOs Lp Jm ×ˢ gset ×ˢ Finset.range Bn, ∑ I ∈ T.nU S gs C₀ a b e m with ¬∃ e' ∈ C, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G e'.1 e'.2, dyadicGridLength A.G I.1 * ‖↑2 / ↑fp.P * T.nf a b m.1.1 m.1.2.1 m.2.1 (T.tOf m.1.1 m.1.2.2.1) (T.tOf m.1.2.1 m.1.2.2.2.1) m.1.2.2.2.2.1 m.1.2.2.2.2.2 I‖ ≤ 4 * (nbCM κ' hq2 hq3 * (1 + finiteDepthConstant κ' q Nd) * (1 + Real.log (↑T.K + 2)) * (↑T.K + 2) ^ (2 * (q - 2) / (q - 1)) * (64 * (2 * C₀) * (2 * C₀))) * (hullCutConstant (ρ / 2) * ↑(N + 1) * (1 + Real.log (2 + ↑(N + 1) * ↑(N + 1) * (↑(nOs Lp Jm).card * Mp * ↑A.famVtxBound)))) * √(Γa * Γb) / √↑fp.P * dyadicGridLength A.G A.R.1

                                                          Blueprint lines 2425-2443 (eq:near-band) for the slots a, b (basic, a, b ≠ u) and the banded complement slot e on the main columns: off one cut family of root fraction ρ, the frozen near band forms of the unflagged uses, with the transfer coefficient 2/P, are at most the critical bound of near_band_criticalM for the actual stacks of the leaf (the rolling sides S_h = Z_h - Z_b + W_b and the global helper bands of the steps).

                                                          The near bands with a basic U side (blueprint lines 2409, 2425-2443) #

                                                          theorem TrilinearHT.Auto.near_band_critical_UM (κ : LocalKernelClass) {q : ℝ} (hq2 : 2 < q) (hq3 : q < 3) :
                                                          ∃ (Cq : ℝ), 0 ≤ Cq ∧ ∀ {c₀ : ℕ} (A : ActiveSetup κ c₀) (bf : A.BasicFamilies) (fp : bf.FamParams) (K Nd N : ℕ), A.DepthWin Nd → 1 ≤ K → K ≤ 2 ^ N → A.AncClosed → ∀ {Ω : Type} (Os : Finset Ω) (Gs : Finset bf.Grp) (Bs : Finset ℕ) (k : ℕ) (Act : Finset (ℤ × ℤ)) (U : bf.Grp → ℕ → Finset (ℤ × ℤ)) (off : ℤ × ℤ → ℕ), (∀ (J : ℤ × ℤ) (β m : ℕ), m < K → J.1 = A.R.1 + ↑(K * β + m) → off J = m) → (∀ (g : bf.Grp) (β : ℕ), ∀ I ∈ U g β, I ∈ A.cells ∧ I.1 = A.R.1 + ↑(K * β + off I) ∧ off I < K) → (∀ (g : bf.Grp) (β : ℕ), ∀ I ∈ U g β, I ∈ Act ∧ g ∈ fp.groupsAt I k) → ∀ {Mp : ℝ}, (∀ (y : ℝ), ↑{c ∈ Act | y ∈ dyadicGridCell A.G c.1 c.2}.card ≤ Mp) → ∀ {a b c : Fin 4}, a ≠ b → a ≠ c → b ≠ c → ∀ (sA : List (CatCol bf.Vtx)) (mbA : bf.MainBudget sA) (jc jd : Ω → ℕ) (e : Ω → Bool × ℕ × Option ℕ) (D : Ω → List (Bool × ℕ × Option ℕ)) (Za : bf.Grp → ℤ → ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) (okA : bf.Grp → ℤ × ℤ → Prop) {BA : ℝ}, A.VarCap Gs Za okA BA → (∀ g ∈ Gs, ∀ (β : ℕ), ∀ I ∈ U g β, ∀ J ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2 → okA g J) → ∀ (Wa : bf.Grp → ℕ → ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) {EWa : ℝ}, ∑ g ∈ Gs, ∑ β ∈ Bs, ‖(columnL2Restriction (⋃ J ∈ ⋯, dyadicGridCell A.G J.1 J.2) ⋯) (Wa g β)‖ ^ 2 ≤ EWa → ∀ (Sa : bf.Grp → ℕ → ℤ → ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))), (∀ (g : bf.Grp) (β : ℕ) (h : ℤ), Sa g β h = Za g h - Za g (A.R.1 + ↑(K * β)) + Wa g β) → ∀ Ms ⊆ Os ×ˢ Gs ×ˢ Bs, ∀ (Um : Ω × bf.Grp × ℕ → Finset (ℤ × ℤ)), (∀ m ∈ Ms, Um m ⊆ U m.2.1 m.2.2) → ∀ (u : Ω × bf.Grp × ℕ → Finset ℕ), (∀ (m : Ω × bf.Grp × ℕ), ⋯ → u m ⊆ Finset.range (fp.P + 1)) → ∀ (Wv : Ω × bf.Grp × ℕ → ⋯) {EU : ℝ}, ⋯

                                                          Blueprint eq:near-band (lines 2409 and 2425-2443) when the untouched side is a basic U side ("for a basic U side use each depth directly as a position"), on the main columns: with the actual banded stacks of near_band_actualM (global helper bands of the steps on the rolling side S_a) and the local values W_m(I) of the U side of total square E_U ≤ Γ_b |R| over the uses, the transfer coefficient o/P (|o| ≤ 2) times the near-band sums has, off one cut family of root fraction ρ, the critical absolute bound 4 C_q (1 + C_N) log K (K+2)^{2(q-2)/(q-1)} (64 B_c B_d) G₀ P^{-1/2} |R|.

                                                          noncomputable def TrilinearHT.Auto.nbCUM (κ : LocalKernelClass) {q : ℝ} (hq2 : 2 < q) (hq3 : q < 3) :

                                                          The constant of near_band_critical_UM.

                                                          Equations
                                                          Instances For
                                                            theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.near_triple_UM {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {q : ℝ} (hq2 : 2 < q) (hq3 : q < 3) {a b e : Fin 4} (hab : a ≠ b) (hae : a ≠ e) (hbe : b ≠ e) (hau : T.u ≠ some a) (hbu : T.u = some b) (hanc : A.AncClosed) {Nd N : ℕ} (hKNd : A.DepthWin Nd) (hKN : T.K ≤ 2 ^ N) (S : Finset (ℤ × ℤ)) (hS : S ⊆ A.cells) (gs : ℤ × ℤ → Finset bf.Grp) (gset : Finset bf.Grp) (Lp Jm Bn k : ℕ) (Act : Finset (ℤ × ℤ)) (hact : ∀ I ∈ S, I ∈ Act ∧ ∀ G ∈ gs I, G ∈ fp.groupsAt I k) {Mp : ℝ} (hMp : ∀ (y : ℝ), ↑{c ∈ Act | y ∈ dyadicGridCell A.G c.1 c.2}.card ≤ Mp) {okA : bf.Grp → ℤ × ℤ → Prop} {BA : ℝ} (hcapA : A.VarCap gset (T.Z a) okA BA) (hok : ∀ I ∈ S, ∀ G ∈ gs I, ∀ J ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2 → okA G J) {EWa EU : ℝ} (hEWa : ∑ G ∈ gset, ∑ β ∈ Finset.range Bn, ‖(columnL2Restriction (⋃ J ∈ Finset.image (fun (I : ℤ × ℤ) => ancAt A.G I (A.R.1 + ↑(T.K * β))) ({I ∈ S | G ∈ gs I ∧ T.bk I = β}), dyadicGridCell A.G J.1 J.2) ⋯) (T.Wb a G (A.R.1 + ↑(T.K * β)))‖ ^ 2 ≤ EWa) (hEU : ∑ I ∈ S, ∑ G ∈ gs I, ‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (T.sv b G I)‖ ^ 2 ≤ EU) {C₀ : ℝ} (hC₀ : 0 ≤ C₀) {ρ : ℝ} (hρ : 0 < ρ) (hρ1 : ρ < 1) (hP : 1 ≤ fp.P) {Γa Γb : ℝ} (hΓa : fp.stackEA (nOs Lp Jm) (T.cat a) (T.mbs a) T.Dpre N BA EWa ≤ (↑fp.P + 2) * Γa * dyadicGridLength A.G A.R.1) (hΓb : ↑(nOs Lp Jm).card * EU ≤ Γb * dyadicGridLength A.G A.R.1) :
                                                            ∃ C ⊆ A.cells, dyadicRootLength A.G (maximalDyadicCells A.G C) ≤ ρ * dyadicGridLength A.G A.R.1 ∧ ∑ m ∈ nOs Lp Jm ×ˢ gset ×ˢ Finset.range Bn, ∑ I ∈ T.nU S gs C₀ a b e m with ¬∃ e' ∈ C, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G e'.1 e'.2, dyadicGridLength A.G I.1 * ‖↑2 / ↑fp.P * T.nf a b m.1.1 m.1.2.1 m.2.1 (T.tOf m.1.1 m.1.2.2.1) (T.tOf m.1.2.1 m.1.2.2.2.1) m.1.2.2.2.2.1 m.1.2.2.2.2.2 I‖ ≤ 4 * (nbCUM κ' hq2 hq3 * (1 + finiteDepthConstant κ' q Nd) * (1 + Real.log (↑T.K + 2)) * (↑T.K + 2) ^ (2 * (q - 2) / (q - 1)) * (64 * (2 * C₀) * (2 * C₀))) * (hullCutConstant (ρ / 2) * ↑(N + 1) * (1 + Real.log (2 + ↑(N + 1) * ↑1 * (↑(nOs Lp Jm).card * Mp * ↑A.famVtxBound)))) * √(Γa * Γb) / √↑fp.P * dyadicGridLength A.G A.R.1

                                                            Blueprint lines 2409 and 2425-2443 (eq:near-band) for the slots a (basic, a ≠ u), b = u (the basic U side, its local values used directly as positions) and the banded complement slot e on the main columns: off one cut family of root fraction ρ, the frozen near band forms of the unflagged uses, with the transfer coefficient 2/P, are at most the critical bound of near_band_critical_UM, with the U energy |outer indices| E_U.

                                                            The near parts of the cells as sums over the near band uses (blueprint lines 2425-2443) #

                                                            theorem TrilinearHT.Auto.sum_range_ite_ltM {M : Type u_1} [AddCommMonoid M] {n L : ℕ} (hnL : n ≤ L) (f : ℕ → M) :
                                                            (∑ i ∈ Finset.range L, if i < n then f i else 0) = ∑ i ∈ Finset.range n, f i

                                                            Summing over the range L the terms with index below n ≤ L.

                                                            noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.nearAbs {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

                                                            The frozen near band forms of the unflagged uses of a slot tuple at a cell, summed over the pairs of positive chains, the steps and the offsets with the transfer coefficients 2/P.

                                                            Equations
                                                            • One or more equations did not get rendered due to their size.
                                                            Instances For
                                                              theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.absPart_eq {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ τ cF : ℝ) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :
                                                              T.absPart C₀ τ cF a b c d G I = ↑(T.pe d).length * ↑(T.pe c).length * ((τ + cF) * T.ns a G I * T.ns b G I) + T.nearAbs C₀ a b c d G I

                                                              The absolute part is the pair-small and far part plus the near part.

                                                              theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.sum_e_nU {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (S : Finset (ℤ × ℤ)) (gs : ℤ × ℤ → Finset bf.Grp) (C₀ : ℝ) (a b : Fin 4) (Ms : Finset ((Fin 4 × Fin 4 × ℕ × ℕ × ℕ × ℕ) × bf.Grp × ℕ)) (I : ℤ × ℤ) (g : (Fin 4 × Fin 4 × ℕ × ℕ × ℕ × ℕ) × bf.Grp × ℕ → ℝ) :
                                                              (∑ e : Fin 4, ∑ m ∈ Ms, if I ∈ T.nU S gs C₀ a b e m then g m else 0) = ∑ m ∈ Ms, if I ∈ S ∧ m.2.1 ∈ gs I ∧ T.bk I = m.2.2 ∧ T.Val a b m.1.1 m.1.2.1 ∧ ¬T.Ucase m.1.1 m.1.2.1 ∧ m.1.2.2.1 < (T.pe m.1.1).length ∧ m.1.2.2.2.1 < (T.pe m.1.2.1).length ∧ m.1.2.2.2.2.1 < (T.desc m.1.1 m.1.2.1 (T.tOf m.1.1 m.1.2.2.1) (T.tOf m.1.2.1 m.1.2.2.2.1)).length ∧ T.unfl C₀ a m.1.1 m.1.2.1 m.2.1 (T.tOf m.1.1 m.1.2.2.1) (T.tOf m.1.2.1 m.1.2.2.2.1) m.1.2.2.2.2.1 m.1.2.2.2.2.2 I then g m else 0
                                                              theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.sum_Ms_collapse {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (S : Finset (ℤ × ℤ)) (gs : ℤ × ℤ → Finset bf.Grp) (gset : Finset bf.Grp) (Lp Jm Bn : ℕ) (C₀ : ℝ) (a b : Fin 4) {I : ℤ × ℤ} (hI : I ∈ S) (hgs : gs I ⊆ gset) (hBn : T.bk I < Bn) (g : (Fin 4 × Fin 4 × ℕ × ℕ × ℕ × ℕ) × bf.Grp × ℕ → ℝ) :
                                                              (∑ m ∈ nOs Lp Jm ×ˢ gset ×ˢ Finset.range Bn, if I ∈ S ∧ m.2.1 ∈ gs I ∧ T.bk I = m.2.2 ∧ T.Val a b m.1.1 m.1.2.1 ∧ ¬T.Ucase m.1.1 m.1.2.1 ∧ m.1.2.2.1 < (T.pe m.1.1).length ∧ m.1.2.2.2.1 < (T.pe m.1.2.1).length ∧ m.1.2.2.2.2.1 < (T.desc m.1.1 m.1.2.1 (T.tOf m.1.1 m.1.2.2.1) (T.tOf m.1.2.1 m.1.2.2.2.1)).length ∧ T.unfl C₀ a m.1.1 m.1.2.1 m.2.1 (T.tOf m.1.1 m.1.2.2.1) (T.tOf m.1.2.1 m.1.2.2.2.1) m.1.2.2.2.2.1 m.1.2.2.2.2.2 I then g m else 0) = ∑ G ∈ gs I, ∑ ω ∈ nOs Lp Jm, if T.Val a b ω.1 ω.2.1 ∧ ¬T.Ucase ω.1 ω.2.1 ∧ ω.2.2.1 < (T.pe ω.1).length ∧ ω.2.2.2.1 < (T.pe ω.2.1).length ∧ ω.2.2.2.2.1 < (T.desc ω.1 ω.2.1 (T.tOf ω.1 ω.2.2.1) (T.tOf ω.2.1 ω.2.2.2.1)).length ∧ T.unfl C₀ a ω.1 ω.2.1 G (T.tOf ω.1 ω.2.2.1) (T.tOf ω.2.1 ω.2.2.2.1) ω.2.2.2.2.1 ω.2.2.2.2.2 I then g (ω, G, T.bk I) else 0

                                                              Collapsing the block and group indices of the uses of a cell.

                                                              theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.sum_nOs_expand {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (Lp Jm : ℕ) (C₀ : ℝ) (a b : Fin 4) (I : ℤ × ℤ) (G : bf.Grp) (hLp : ∀ (l : Fin 4), (T.pe l).length ≤ Lp) (hJm : ∀ (c d : Fin 4) (i i' : ℕ), (T.desc c d (T.tOf c i) (T.tOf d i')).length ≤ Jm) (g : Fin 4 × Fin 4 × ℕ × ℕ × ℕ × ℕ → ℝ) :
                                                              (∑ ω ∈ nOs Lp Jm, if T.Val a b ω.1 ω.2.1 ∧ ¬T.Ucase ω.1 ω.2.1 ∧ ω.2.2.1 < (T.pe ω.1).length ∧ ω.2.2.2.1 < (T.pe ω.2.1).length ∧ ω.2.2.2.2.1 < (T.desc ω.1 ω.2.1 (T.tOf ω.1 ω.2.2.1) (T.tOf ω.2.1 ω.2.2.2.1)).length ∧ T.unfl C₀ a ω.1 ω.2.1 G (T.tOf ω.1 ω.2.2.1) (T.tOf ω.2.1 ω.2.2.2.1) ω.2.2.2.2.1 ω.2.2.2.2.2 I then g ω else 0) = ∑ c : Fin 4, ∑ d : Fin 4, if T.Val a b c d ∧ ¬T.Ucase c d then ∑ i' ∈ Finset.range (T.pe d).length, ∑ i ∈ Finset.range (T.pe c).length, ∑ j ∈ Finset.range (T.desc c d (T.tOf c i) (T.tOf d i')).length, ∑ o ∈ Finset.range 5, if T.unfl C₀ a c d G (T.tOf c i) (T.tOf d i') j o I then g (c, d, i, i', j, o) else 0 else 0

                                                              Expanding the outer indices of the uses of a cell and group into the slot, chain, step and offset sums.

                                                              theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.near_cell_eq {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (S : Finset (ℤ × ℤ)) (gs : ℤ × ℤ → Finset bf.Grp) (gset : Finset bf.Grp) (Lp Jm Bn : ℕ) (C₀ : ℝ) {I : ℤ × ℤ} (hI : I ∈ S) (hgs : gs I ⊆ gset) (hBn : T.bk I < Bn) (hLp : ∀ (l : Fin 4), (T.pe l).length ≤ Lp) (hJm : ∀ (c d : Fin 4) (i i' : ℕ), (T.desc c d (T.tOf c i) (T.tOf d i')).length ≤ Jm) :
                                                              (∑ G ∈ gs I, ∑ a : Fin 4, ∑ b : Fin 4, ∑ c : Fin 4, ∑ d : Fin 4, if T.Val a b c d ∧ ¬T.Ucase c d then T.nearAbs C₀ a b c d G I else 0) = 2 / ↑fp.P * ∑ a : Fin 4, ∑ b : Fin 4, ∑ e : Fin 4, ∑ m ∈ nOs Lp Jm ×ˢ gset ×ˢ Finset.range Bn, if I ∈ T.nU S gs C₀ a b e m then ‖T.nf a b m.1.1 m.1.2.1 m.2.1 (T.tOf m.1.1 m.1.2.2.1) (T.tOf m.1.2.1 m.1.2.2.2.1) m.1.2.2.2.2.1 m.1.2.2.2.2.2 I‖ else 0

                                                              The near parts of a cell, summed over its groups and slot tuples, are 2/P times the use indicator sums of the near band applications over the slot triples (a, b, e).

                                                              The near parts of a leaf (blueprint eq:near-band, lines 2425-2443) #

                                                              theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.nU_slots {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {S : Finset (ℤ × ℤ)} {gs : ℤ × ℤ → Finset bf.Grp} {C₀ : ℝ} {a b e : Fin 4} {m : (Fin 4 × Fin 4 × ℕ × ℕ × ℕ × ℕ) × bf.Grp × ℕ} {I : ℤ × ℤ} (hI : I ∈ T.nU S gs C₀ a b e m) :
                                                              a ≠ b ∧ a ≠ e ∧ b ≠ e ∧ T.u ≠ some a

                                                              The uses of a near band application have distinct slots a, b, e and a ≠ u.

                                                              noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.nearBnd {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {q : ℝ} (hq2 : 2 < q) (hq3 : q < 3) (Nd N Lp Jm : ℕ) (Mp C₀ ρ : ℝ) (Γa Γb : Fin 4 → ℝ) (ΓU : ℝ) (a b e : Fin 4) :

                                                              The critical bound of one near band application of the leaf (near_tripleM for a basic untouched side, near_triple_UM for the U side).

                                                              Equations
                                                              • One or more equations did not get rendered due to their size.
                                                              Instances For
                                                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.near_sumM {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {q : ℝ} (hq2 : 2 < q) (hq3 : q < 3) (hanc : A.AncClosed) {Nd N : ℕ} (hKNd : A.DepthWin Nd) (hKN : T.K ≤ 2 ^ N) (S : Finset (ℤ × ℤ)) (hS : S ⊆ A.cells) (gs : ℤ × ℤ → Finset bf.Grp) (gset : Finset bf.Grp) (hgs : ∀ I ∈ S, gs I ⊆ gset) (Lp Jm Bn k : ℕ) (hBn : ∀ I ∈ S, T.bk I < Bn) (hLp : ∀ (l : Fin 4), (T.pe l).length ≤ Lp) (hJm : ∀ (c d : Fin 4) (i i' : ℕ), (T.desc c d (T.tOf c i) (T.tOf d i')).length ≤ Jm) (Act : Finset (ℤ × ℤ)) (hact : ∀ I ∈ S, I ∈ Act ∧ ∀ G ∈ gs I, G ∈ fp.groupsAt I k) {Mp : ℝ} (hMp : ∀ (y : ℝ), ↑{c ∈ Act | y ∈ dyadicGridCell A.G c.1 c.2}.card ≤ Mp) (okZ : Fin 4 → bf.Grp → ℤ × ℤ → Prop) (BZ EW : Fin 4 → ℝ) (hcap : ∀ (l : Fin 4), T.u ≠ some l → A.VarCap gset (T.Z l) (okZ l) (BZ l)) (hok : ∀ (l : Fin 4), T.u ≠ some l → ∀ I ∈ S, ∀ G ∈ gs I, ∀ J ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2 → okZ l G J) (hEW : ∀ (l : Fin 4), T.u ≠ some l → ∑ G ∈ gset, ∑ β ∈ Finset.range Bn, ‖(columnL2Restriction (⋃ J ∈ Finset.image (fun (I : ℤ × ℤ) => ancAt A.G I (A.R.1 + ↑(T.K * β))) ({I ∈ S | G ∈ gs I ∧ T.bk I = β}), dyadicGridCell A.G J.1 J.2) ⋯) (T.Wb l G (A.R.1 + ↑(T.K * β)))‖ ^ 2 ≤ EW l) {EU : ℝ} (hEU : ∀ (l : Fin 4), T.u = some l → ∑ I ∈ S, ∑ G ∈ gs I, ‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (T.sv l G I)‖ ^ 2 ≤ EU) {C₀ : ℝ} (hC₀ : 0 ≤ C₀) {ρ : ℝ} (hρ : 0 < ρ) (hρ1 : ρ < 1) (hP : 1 ≤ fp.P) (Γa Γb : Fin 4 → ℝ) (ΓU : ℝ) (hΓa : ∀ (a : Fin 4), T.u ≠ some a → fp.stackEA (nOs Lp Jm) (T.cat a) (T.mbs a) T.Dpre N (BZ a) (EW a) ≤ (↑fp.P + 2) * Γa a * dyadicGridLength A.G A.R.1) (hΓb : ∀ (b : Fin 4), T.u ≠ some b → ↑(nOs Lp Jm).card * (↑N * BZ b + EW b) ≤ Γb b * dyadicGridLength A.G A.R.1) (hΓU : ↑(nOs Lp Jm).card * EU ≤ ΓU * dyadicGridLength A.G A.R.1) :
                                                                ∃ Cn ⊆ A.cells, dyadicRootLength A.G (maximalDyadicCells A.G Cn) ≤ ρ * dyadicGridLength A.G A.R.1 ∧ (∑ I ∈ S with ¬∃ e' ∈ Cn, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G e'.1 e'.2, dyadicGridLength A.G I.1 * ∑ G ∈ gs I, ∑ a : Fin 4, ∑ b : Fin 4, ∑ c : Fin 4, ∑ d : Fin 4, if T.Val a b c d ∧ ¬T.Ucase c d then T.nearAbs C₀ a b c d G I else 0) ≤ ∑ a : Fin 4, ∑ b : Fin 4, ∑ e : Fin 4, T.nearBnd hq2 hq3 Nd N Lp Jm Mp C₀ (ρ / 64) Γa Γb ΓU a b e

                                                                Blueprint eq:near-band (lines 2425-2443) on one leaf, on the main columns: one cut family of root fraction ρ (the union of the cut families of the near band applications of all slot triples, each of root fraction ρ/64) such that the near parts of the retained cells, weighted by length and summed over the groups and slot tuples, are at most the sum over the slot triples of the critical near-band bounds nearBnd.

                                                                The third strong factor of a slot tuple (blueprint lines 2372-2394) #

                                                                noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.strTh {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

                                                                The third strong factor of a slot tuple with basic complements: the restoration corrections with a basic side U, and the freeze differences and flags of the near band forms.

                                                                Equations
                                                                • One or more equations did not get rendered due to their size.
                                                                Instances For
                                                                  noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.third {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ B₀ : ℝ) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

                                                                  The third strong factor of a slot tuple at a cell and group: strTh for basic complements, C_κ B₀ (S_c + S_d) when a complement slot is the U slot (three sides), zero for invalid tuples.

                                                                  Equations
                                                                  Instances For
                                                                    noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.absPart' {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ τ cF : ℝ) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

                                                                    The absolute part of a slot tuple at a cell and group, zero for invalid tuples and tuples with a U complement.

                                                                    Equations
                                                                    Instances For
                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.list_sum_map_nonneg {α : Type u_1} (L : List α) (f : α → ℝ) (hf : ∀ x ∈ L, 0 ≤ f x) :
                                                                      0 ≤ (List.map f L).sum
                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.strTh_nonneg {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (hC₀ : 0 ≤ C₀) (a c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :
                                                                      0 ≤ T.strTh C₀ a c d G I
                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.third_nonneg {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ B₀ : ℝ) (hC₀ : 0 ≤ C₀) (hB₀ : 0 ≤ B₀) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :
                                                                      0 ≤ T.third C₀ B₀ a b c d G I
                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.str_aux {na nb nRb C uc k : ℝ} (s t : Finset ℕ) (Q : ℕ → ℕ → ℝ) (hk : 0 ≤ k) (hC : 0 ≤ C) (hQ : ∀ (j o : ℕ), 0 ≤ Q j o) (hn : nRb ≤ nb) (hna : 0 ≤ na) :
                                                                      C * (na * nb * uc) + ∑ j ∈ s, ∑ o ∈ t, k * (C * (nRb * na * Q j o)) ≤ na * nb * (C * uc + ∑ j ∈ s, ∑ o ∈ t, k * (C * Q j o))

                                                                      The algebra of the strong part: moving the side sizes out of the near band errors.

                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.strPart_le {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (hC₀ : 0 ≤ C₀) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :
                                                                      T.strPart C₀ a b c d G I ≤ T.ns a G I * T.ns b G I * T.strTh C₀ a c d G I

                                                                      The strong part of a slot tuple with basic complements is at most S_a S_b times the third strong factor.

                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.cell_bound2 {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {a b c d : Fin 4} (hV : T.Val a b c d) (G : bf.Grp) {I : ℤ × ℤ} (hI : I ∈ A.cells) {τ : ℝ} (hτ : 0 ≤ τ) (hpair : ¬T.Ucase c d → PairSmall (dyadicGridLeft A.G I.1 I.2) (dyadicGridLength A.G I.1) (A.w I) c d (A.Y I c) (A.Y I d) τ) {cF : ℝ} (hfar : ¬T.Ucase c d → ∀ t ∈ T.pe c, ∀ t' ∈ T.pe d, ‖chainDefectSel (fp.Λc I) fp.P a c d (fun (l : Fin 4) => T.sv l G I) (bf.basicIn fp.Mc c I) (bf.basicIn fp.Mc d I) (fun (p q : ℕ) => q + 2 < p ∨ p + 2 < q) (fp.mergeStepsM T.cat a c d (fp.Lc + 5) I (fp.slotFiltM G (T.Lf.role c) I t.2) (fp.slotFiltM G (T.Lf.role d) I t'.2)) (T.sv a G I)‖ ≤ cF * T.ns a G I * T.ns b G I) {C₀ B₀ : ℝ} (hC₀ : 0 ≤ C₀) (hB₀ : 0 ≤ B₀) (hsc : ∀ (l : Fin 4), T.u ≠ some l → ‖bf.basicIn fp.Mc l I‖ ≤ C₀ * √(dyadicGridLength A.G I.1)) (hout : ∀ (l : Fin 4), ‖T.out l G I‖ ≤ B₀ * √(dyadicGridLength A.G I.1)) :
                                                                      ‖(fp.Λc I) (Function.update (Function.update (fun (l : Fin 4) => T.sv l G I) c (T.out c G I)) d (T.out d G I))‖ ≤ T.absPart' C₀ τ cF a b c d G I + T.ns a G I * T.ns b G I * T.third C₀ B₀ a b c d G I

                                                                      Blueprint lines 2241-2262 and 2372-2394 at one cell and group, for every valid slot tuple: the restored form is at most the absolute part plus S_a S_b times the third strong factor. For a complement in the U slot the form has three sides and is at most C_κ S_a S_b S_u B₀.

                                                                      The integrated budget of the third strong factors (blueprint lines 2384-2394) #

                                                                      theorem TrilinearHT.Auto.rstM_sq_le {L Cκ u v x' y' Cy : ℝ} (hL : 0 < L) (hx' : 0 ≤ x') (hx'C : x' ≤ Cy) (hy' : 0 ≤ y') (hy'C : y' ≤ Cy) (hu : 0 ≤ u) (hv : 0 ≤ v) (hvC : v / √L ≤ Cy) :
                                                                      L * (Cκ * (u / √L * y' + x' * (v / √L) + u / √L * (v / √L))) ^ 2 ≤ Cκ ^ 2 * (8 * Cy ^ 2 * (u ^ 2 + v ^ 2))

                                                                      The square of the restoration correction factor with basic sides U, times the cell length: L (C (x y' + x' y + x y))² ≤ 8 C² C_y² (u² + v²) with x = u/√L, y = v/√L and x', y', y ≤ C_y.

                                                                      Freeze budgets on the main columns (blueprint lines 2386-2394) #

                                                                      theorem TrilinearHT.Auto.ActiveSetup.blkStart_eq_anc {κ' : LocalKernelClass} {c₀ : ℕ} (A : ActiveSetup κ' c₀) {K : ℕ} (hK1 : 1 ≤ K) {I J : ℤ × ℤ} (hsub : dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2) (hbl : A.blkStart K I.1 ≤ J.1) :
                                                                      A.blkStart K J.1 = A.blkStart K I.1

                                                                      An ancestor at or below the block start of a cell lies in the same block.

                                                                      A block flag of a cell for the energies E at the threshold c: some active ancestor of the cell in its block has energy above c times its length.

                                                                      Equations
                                                                      • One or more equations did not get rendered due to their size.
                                                                      Instances For
                                                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.flag_prop {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (S Sc : Finset (ℤ × ℤ)) (E : ℤ × ℤ → ℝ) (hE : ∀ (J : ℤ × ℤ), 0 ≤ E J) {c : ℝ} (hc : 0 < c) (hSc : ∀ I ∈ S, ∀ J ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2 → A.blkStart T.K I.1 ≤ J.1 → J ∈ Sc) :
                                                                        (∑ I ∈ S, if T.blkFlag E c I then dyadicGridLength A.G I.1 else 0) ≤ ↑T.K / c * ∑ J ∈ Sc, E J

                                                                        Blueprint line 2393 ("propagating the event through its block costs at most K in integrated square energy"): the flagged cells have total length at most K / c times the energies on the ancestors in their blocks.

                                                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frz_varcap {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {γ : Type u_1} {V : Type u_2} [Fintype V] (Gs : Finset γ) (Z : γ → ℤ → ↥(ColumnL2 V)) (ok : γ → ℤ × ℤ → Prop) {B : ℝ} (hcap : A.VarCap Gs Z ok B) (Sc : γ → Finset (ℤ × ℤ)) (hSc : ∀ g ∈ Gs, ∀ J ∈ Sc g, J ∈ A.cells ∧ ok g J) :
                                                                        ∑ g ∈ Gs, ∑ J ∈ Sc g, ‖(columnL2Restriction (dyadicGridCell A.G J.1 J.2) ⋯) (Z g J.1 - Z g (A.blkStart T.K J.1))‖ ^ 2 ≤ ↑T.K * B

                                                                        Blueprint lines 2389-2390 ("differences from their values at b have integrated square budgets ... by Lemma variation, paying ... the O(K) overlap"): for outputs Z_g with certified variation capacity B, the differences from the block starts over certified active cells have total square at most K B (one variation application per block offset, on the disjoint block intervals).

                                                                        Shared and group-indexed frozen complements (blueprint lines 2263, 2386-2394) #

                                                                        theorem TrilinearHT.Auto.slot_after_mem {α : Type u_1} (L : List (Bool × α)) (v : Bool) (x₀ : α) (xs : List α) (hL : List.map Prod.snd (List.filter (fun (e : Bool × α) => decide (e.1 = v)) L) = x₀ :: xs) {j : ℕ} (hj : j < L.length) (hv : L[j].1 = v) {e : Bool × α} (he : e ∈ List.drop (j + 1) L) (hev : e.1 = v) :
                                                                        e.2 ∈ xs

                                                                        If the entries of slot v of a list in order are x₀ :: xs, then the entries of slot v strictly after an entry of slot v lie in xs.

                                                                        theorem TrilinearHT.Auto.chainVal_cons {E : Type u_1} [NormedAddCommGroup E] [InnerProductSpace ℂ E] (P : ℕ) (v : Bool) (st : TransferStep E) (rest : List (TransferStep E)) (y : E) :
                                                                        chainVal P v (st :: rest) y = if st.1 = v then (filterAvg P st.2.2) (chainVal P v rest y) else chainVal P v rest y

                                                                        One step of a complement value.

                                                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.stepMaskM_cum {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (G G' : bf.Grp) (j m : ℕ) (p : Fin fp.P) :
                                                                        (fun (c' : ℤ × ℤ) => fp.stepMaskM G j (some m) p c') = fun (c' : ℤ × ℤ) => fp.stepMaskM G' j (some m) p c'

                                                                        The cumulative pad masks do not depend on the group.

                                                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.gStepM_cum {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (cat : Fin 4 → List (CatCol bf.Vtx)) (mbs : (l : Fin 4) → bf.MainBudget (cat l)) (a c d : Fin 4) (rH : ℕ) (G G' : bf.Grp) (jc jd : ℕ) (b : Bool) (r m : ℕ) (h : ℤ) :
                                                                        fp.gStepM cat mbs a c d rH G jc jd (b, r, some m) h = fp.gStepM cat mbs a c d rH G' jc jd (b, r, some m) h

                                                                        Blueprint line 2263 ("its complementary band history is shared across groups"): a global step of a cumulative descriptor does not depend on the group.

                                                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.gStepM_fst {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (cat : Fin 4 → List (CatCol bf.Vtx)) (mbs : (l : Fin 4) → bf.MainBudget (cat l)) (a c d : Fin 4) (rH : ℕ) (G : bf.Grp) (jc jd : ℕ) (e : Bool × ℕ × Option ℕ) (h : ℤ) :
                                                                        (padStep (fp.gStepM cat mbs a c d rH G jc jd e h)).1 = e.1

                                                                        The slot of a global step is its descriptor slot.

                                                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.chainVal_gStepM_cum {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (cat : Fin 4 → List (CatCol bf.Vtx)) (mbs : (l : Fin 4) → bf.MainBudget (cat l)) (a c d : Fin 4) (rH : ℕ) (G G' : bf.Grp) (jc jd : ℕ) (v : Bool) (h : ℤ) (x : ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) (es : List (Bool × ℕ × Option ℕ)) (hes : ∀ e ∈ es, e.1 = v → e.2.2 ≠ none) :
                                                                        chainVal fp.P v (List.map padStep (List.map (fun (e : Bool × ℕ × Option ℕ) => fp.gStepM cat mbs a c d rH G jc jd e h) es)) x = chainVal fp.P v (List.map padStep (List.map (fun (e : Bool × ℕ × Option ℕ) => fp.gStepM cat mbs a c d rH G' jc jd e h) es)) x

                                                                        A complement value after global steps whose descriptors of its slot are cumulative does not depend on the group.

                                                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.mergeDescM_after {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (jc jd : ℕ) (t t' : List ℕ) {j : ℕ} (hj : j < (fp.mergeDescM jc jd t t').length) {e : Bool × ℕ × Option ℕ} (he : e ∈ List.drop (j + 1) (fp.mergeDescM jc jd t t')) (hev : e.1 = ((fp.mergeDescM jc jd t t').getD j (true, 0, none)).1) :
                                                                        e.2.2 ≠ none

                                                                        Blueprint line 2263 ("if the outgoing filter is cumulative, its outer ball has already been removed"): in the merged descriptors of a chain pair, the descriptors of the slot of a step that come after it are cumulative.

                                                                        noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.Xo {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j n : ℕ) (h : ℤ) :
                                                                        ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))

                                                                        The pad output n of the step j of a chain pair at the depth h (pad family Q_0 = 0, Q_n for 1 ≤ n ≤ P, Q_{P+1} = 1), after the later complement history of its slot, on the global basic input.

                                                                        Equations
                                                                        • One or more equations did not get rendered due to their size.
                                                                        Instances For
                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.Yfr_eq_Xo {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j o : ℕ) (h : ℤ) (p : ℕ) :
                                                                          fp.YfrM T.cat T.mbs a c d (fp.Lc + 5) G (T.Lf.role c) (T.Lf.role d) (T.desc c d t t') j o h p = T.Xo a c d G t t' j (p + o - 2 + 1) h - T.Xo a c d G t t' j (p + o - 2) h

                                                                          The complement bands are differences of consecutive pad outputs.

                                                                          noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.dXo {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j n : ℕ) (J : ℤ × ℤ) :

                                                                          The squared freeze difference of the pad output n at a cell (from its block start).

                                                                          Equations
                                                                          • One or more equations did not get rendered due to their size.
                                                                          Instances For
                                                                            noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.pYe {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (J : ℤ × ℤ) :

                                                                            The freeze energy of the pads 1, …, P of a step at a cell.

                                                                            Equations
                                                                            Instances For
                                                                              noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.iYe {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (J : ℤ × ℤ) :

                                                                              The freeze energy of the identity output (the terminal band endpoint Q_{P+1} = 1).

                                                                              Equations
                                                                              • T.iYe a c d G t t' j J = T.dXo a c d G t t' j (fp.P + 1) J
                                                                              Instances For
                                                                                noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.dFe {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (J : ℤ × ℤ) :

                                                                                The freeze energy of the other complement of a step at a cell.

                                                                                Equations
                                                                                • One or more equations did not get rendered due to their size.
                                                                                Instances For
                                                                                  theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.pYe_nonneg {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (J : ℤ × ℤ) :
                                                                                  0 ≤ T.pYe a c d G t t' j J
                                                                                  theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.iYe_nonneg {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (J : ℤ × ℤ) :
                                                                                  0 ≤ T.iYe a c d G t t' j J
                                                                                  theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.dFe_nonneg {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (J : ℤ × ℤ) :
                                                                                  0 ≤ T.dFe a c d G t t' j J
                                                                                  theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.band_split {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j o : ℕ) (I : ℤ × ℤ) :
                                                                                  ∑ p ∈ fp.uoM o, ‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (fp.YfrM T.cat T.mbs a c d (fp.Lc + 5) G (T.Lf.role c) (T.Lf.role d) (T.desc c d t t') j o I.1 p - T.Ybk a c d G t t' j o I p)‖ ^ 2 ≤ 4 * (T.pYe a c d G t t' j I + T.iYe a c d G t t' j I)

                                                                                  Blueprint lines 2389-2390 ("paying the polynomial number of bands"): the freeze differences of the complement bands of one offset are at most four times the freeze energies of the pads and of the identity output.

                                                                                  The square of a vector is at most twice the square of its difference from a second vector plus twice the square of the second one.

                                                                                  theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.unfl_of_noflag {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {C₀ : ℝ} (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j o : ℕ) (hcur : ∀ J ∈ A.cells, ∑ p ∈ fp.uoM o, ‖(columnL2Restriction (dyadicGridCell A.G J.1 J.2) ⋯) (fp.YfrM T.cat T.mbs a c d (fp.Lc + 5) G (T.Lf.role c) (T.Lf.role d) (T.desc c d t t') j o J.1 p)‖ ^ 2 ≤ C₀ ^ 2 * dyadicGridLength A.G J.1 ∧ ‖(columnL2Restriction (dyadicGridCell A.G J.1 J.2) ⋯) (fp.FfrM T.cat T.mbs a c d (fp.Lc + 5) G (T.Lf.role c) (T.Lf.role d) (T.desc c d t t') j J.1)‖ ^ 2 ≤ C₀ ^ 2 * dyadicGridLength A.G J.1) {I : ℤ × ℤ} (h1 : ¬T.blkFlag (T.pYe a c d G t t' j) (C₀ ^ 2 / 8) I) (h2 : ¬T.blkFlag (T.iYe a c d G t t' j) (C₀ ^ 2 / 8) I) (h3 : ¬T.blkFlag (T.dFe a c d G t t' j) (C₀ ^ 2) I) :
                                                                                  T.unfl C₀ a c d G t t' j o I

                                                                                  Blueprint line 2393 ("on unflagged uses both frozen complements have bounded local sizes on their entire ancestor hull within the block"): if the current complements are bounded by C₀ on the active cells, a use without block flags of the pad, identity and other complement freeze energies (at the thresholds C₀²/8, C₀²/8, C₀²) is unflagged.

                                                                                  theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.unfl_ind_le {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {C₀ : ℝ} (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j o : ℕ) (hcur : ∀ J ∈ A.cells, ∑ p ∈ fp.uoM o, ‖(columnL2Restriction (dyadicGridCell A.G J.1 J.2) ⋯) (fp.YfrM T.cat T.mbs a c d (fp.Lc + 5) G (T.Lf.role c) (T.Lf.role d) (T.desc c d t t') j o J.1 p)‖ ^ 2 ≤ C₀ ^ 2 * dyadicGridLength A.G J.1 ∧ ‖(columnL2Restriction (dyadicGridCell A.G J.1 J.2) ⋯) (fp.FfrM T.cat T.mbs a c d (fp.Lc + 5) G (T.Lf.role c) (T.Lf.role d) (T.desc c d t t') j J.1)‖ ^ 2 ≤ C₀ ^ 2 * dyadicGridLength A.G J.1) (I : ℤ × ℤ) :
                                                                                  (if T.unfl C₀ a c d G t t' j o I then 0 else 1) ≤ ((if T.blkFlag (T.pYe a c d G t t' j) (C₀ ^ 2 / 8) I then 1 else 0) + if T.blkFlag (T.iYe a c d G t t' j) (C₀ ^ 2 / 8) I then 1 else 0) + if T.blkFlag (T.dFe a c d G t t' j) (C₀ ^ 2) I then 1 else 0

                                                                                  The flag indicator of a use is at most the sum of the three block flag indicators.

                                                                                  theorem TrilinearHT.Auto.sqrt_add_le_sqrt {x y : ℝ} (hx : 0 ≤ x) (hy : 0 ≤ y) :
                                                                                  √(x + y) ≤ √x + √y

                                                                                  √(x + y) ≤ √x + √y for nonnegative x, y.

                                                                                  theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.gStM_fst {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (cat : Fin 4 → List (CatCol bf.Vtx)) (mbs : (l : Fin 4) → bf.MainBudget (cat l)) (a c d : Fin 4) (rH : ℕ) (G : bf.Grp) (jc jd : ℕ) (D : List (Bool × ℕ × Option ℕ)) (j : ℕ) (h : ℤ) :
                                                                                  (fp.gStM cat mbs a c d rH G jc jd D j h).1 = (D.getD j (true, 0, none)).1
                                                                                  theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.gStM_top {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (cat : Fin 4 → List (CatCol bf.Vtx)) (mbs : (l : Fin 4) → bf.MainBudget (cat l)) (a c d : Fin 4) (rH : ℕ) (G : bf.Grp) (jc jd : ℕ) (D : List (Bool × ℕ × Option ℕ)) (j : ℕ) (h : ℤ) (z : ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) :
                                                                                  ((fp.gStM cat mbs a c d rH G jc jd D j h).2.2 (fp.P + 1)) z = z

                                                                                  The terminal pad of a step is the identity.

                                                                                  theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.gStM_cum {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (cat : Fin 4 → List (CatCol bf.Vtx)) (mbs : (l : Fin 4) → bf.MainBudget (cat l)) (a c d : Fin 4) (rH : ℕ) (G G' : bf.Grp) (jc jd : ℕ) (D : List (Bool × ℕ × Option ℕ)) (j : ℕ) (h : ℤ) (hc : (D.getD j (true, 0, none)).2.2 ≠ none) :
                                                                                  fp.gStM cat mbs a c d rH G jc jd D j h = fp.gStM cat mbs a c d rH G' jc jd D j h

                                                                                  A cumulative step does not depend on the group.

                                                                                  theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.gRestM_cum {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (cat : Fin 4 → List (CatCol bf.Vtx)) (mbs : (l : Fin 4) → bf.MainBudget (cat l)) (a c d : Fin 4) (rH : ℕ) (G G' : bf.Grp) (jc jd : ℕ) (D : List (Bool × ℕ × Option ℕ)) (j : ℕ) (h : ℤ) (v : Bool) (hes : ∀ e ∈ List.drop (j + 1) D, e.1 = v → e.2.2 ≠ none) (z : ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))) :
                                                                                  chainVal fp.P v (fp.gRestM cat mbs a c d rH G jc jd D j h) z = chainVal fp.P v (fp.gRestM cat mbs a c d rH G' jc jd D j h) z

                                                                                  The later history of a slot whose descriptors are cumulative does not depend on the group.

                                                                                  def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.cumY {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (c d : Fin 4) (t t' : List ℕ) (j : ℕ) :

                                                                                  The step j of a chain pair is cumulative: its pads are shared across groups.

                                                                                  Equations
                                                                                  Instances For
                                                                                    def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.cumF {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (c d : Fin 4) (t t' : List ℕ) (j : ℕ) :

                                                                                    The later history of the other complement of the step j is cumulative: the other complement is shared across groups.

                                                                                    Equations
                                                                                    Instances For
                                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.slot_after_cum {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (c d : Fin 4) (t t' : List ℕ) (j : ℕ) (e : Bool × ℕ × Option ℕ) :
                                                                                      e ∈ List.drop (j + 1) (T.desc c d t t') → e.1 = ((T.desc c d t t').getD j (true, 0, none)).1 → e.2.2 ≠ none

                                                                                      The later history of the slot of the step j is cumulative.

                                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.Xo_indep {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G G' : bf.Grp) (t t' : List ℕ) (j n : ℕ) (h : ℤ) (hn : n = fp.P + 1 ∨ T.cumY c d t t' j) :
                                                                                      T.Xo a c d G t t' j n h = T.Xo a c d G' t t' j n h

                                                                                      Blueprint line 2263 ("the terminal complementary band ... shared identity"; "its complementary band history is shared across groups"): the identity output of a step, and every pad output of a cumulative step, do not depend on the group.

                                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.iYe_indep {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G G' : bf.Grp) (t t' : List ℕ) (j : ℕ) :
                                                                                      T.iYe a c d G t t' j = T.iYe a c d G' t t' j
                                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.pYe_indep {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G G' : bf.Grp) (t t' : List ℕ) (j : ℕ) (hc : T.cumY c d t t' j) :
                                                                                      T.pYe a c d G t t' j = T.pYe a c d G' t t' j
                                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.dFe_indep {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (a c d : Fin 4) (G G' : bf.Grp) (t t' : List ℕ) (j : ℕ) (hc : T.cumF c d t t' j) :
                                                                                      T.dFe a c d G t t' j = T.dFe a c d G' t t' j
                                                                                      noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.fI {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (E : ℤ × ℤ → ℝ) (c : ℝ) (I : ℤ × ℤ) :

                                                                                      The indicator of a block flag.

                                                                                      Equations
                                                                                      Instances For
                                                                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.fI_nonneg {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (E : ℤ × ℤ → ℝ) (c : ℝ) (I : ℤ × ℤ) :
                                                                                        0 ≤ T.fI E c I
                                                                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.fI_sq {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (E : ℤ × ℤ → ℝ) (c : ℝ) (I : ℤ × ℤ) :
                                                                                        T.fI E c I ^ 2 = T.fI E c I
                                                                                        noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frzSh {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) :

                                                                                        The shared part of the freeze and flag factor of a step at a cell: the identity output always, the pads of a cumulative step, the other complement with a cumulative history.

                                                                                        Equations
                                                                                        • One or more equations did not get rendered due to their size.
                                                                                        Instances For
                                                                                          noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frzGr {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) :

                                                                                          The group-indexed part of the freeze and flag factor of a step at a cell: the pads of a ball step and the other complement with a ball in its history.

                                                                                          Equations
                                                                                          • One or more equations did not get rendered due to their size.
                                                                                          Instances For
                                                                                            theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frzSh_indep {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G G' : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) :
                                                                                            T.frzSh C₀ a c d G t t' j I = T.frzSh C₀ a c d G' t t' j I
                                                                                            theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frz_le {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {C₀ : ℝ} (hC₀ : 0 ≤ C₀) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j o : ℕ) (hcur : ∀ J ∈ A.cells, ∑ p ∈ fp.uoM o, ‖(columnL2Restriction (dyadicGridCell A.G J.1 J.2) ⋯) (fp.YfrM T.cat T.mbs a c d (fp.Lc + 5) G (T.Lf.role c) (T.Lf.role d) (T.desc c d t t') j o J.1 p)‖ ^ 2 ≤ C₀ ^ 2 * dyadicGridLength A.G J.1 ∧ ‖(columnL2Restriction (dyadicGridCell A.G J.1 J.2) ⋯) (fp.FfrM T.cat T.mbs a c d (fp.Lc + 5) G (T.Lf.role c) (T.Lf.role d) (T.desc c d t t') j J.1)‖ ^ 2 ≤ C₀ ^ 2 * dyadicGridLength A.G J.1) (I : ℤ × ℤ) :
                                                                                            (4 * C₀ * (√(∑ p ∈ fp.uoM o, ‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (fp.YfrM T.cat T.mbs a c d (fp.Lc + 5) G (T.Lf.role c) (T.Lf.role d) (T.desc c d t t') j o I.1 p - T.Ybk a c d G t t' j o I p)‖ ^ 2) / √(dyadicGridLength A.G I.1)) + C₀ * (‖(columnL2Restriction (dyadicGridCell A.G I.1 I.2) ⋯) (fp.FfrM T.cat T.mbs a c d (fp.Lc + 5) G (T.Lf.role c) (T.Lf.role d) (T.desc c d t t') j I.1 - T.Fbk a c d G t t' j I)‖ / √(dyadicGridLength A.G I.1)) + if T.unfl C₀ a c d G t t' j o I then 0 else C₀ ^ 2) ≤ T.frzSh C₀ a c d G t t' j I + T.frzGr C₀ a c d G t t' j I

                                                                                            Blueprint lines 2386-2394 at one step and offset: with current complements bounded by C₀, the freeze differences and the flag of a use are at most the shared part plus the group-indexed part (pads, identity output and other complement, each with its block flag).

                                                                                            noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.thS {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

                                                                                            The shared part of the third strong factor of a slot tuple with basic complements: the restoration corrections with a basic side U and the shared freeze and flag factors.

                                                                                            Equations
                                                                                            • One or more equations did not get rendered due to their size.
                                                                                            Instances For
                                                                                              noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.thG {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

                                                                                              The group-indexed part of the third strong factor of a slot tuple with basic complements: the group-indexed freeze and flag factors.

                                                                                              Equations
                                                                                              • One or more equations did not get rendered due to their size.
                                                                                              Instances For
                                                                                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.thS_indep {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G G' : bf.Grp) (I : ℤ × ℤ) :
                                                                                                T.thS C₀ a c d G I = T.thS C₀ a c d G' I
                                                                                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.strTh_le_SG {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {C₀ : ℝ} (hC₀ : 0 ≤ C₀) (a c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) (hbas : ∀ J ∈ A.cells, ‖bf.basicIn fp.Mc c J‖ ≤ C₀ * √(dyadicGridLength A.G J.1) ∧ ‖bf.basicIn fp.Mc d J‖ ≤ C₀ * √(dyadicGridLength A.G J.1)) :
                                                                                                T.strTh C₀ a c d G I ≤ T.thS C₀ a c d G I + T.thG C₀ a c d G I

                                                                                                Blueprint lines 2263 and 2386-2394: with basic inputs of the complement slots bounded by C₀ on the active cells, the third strong factor of a basic tuple is at most its shared part plus its group-indexed part.

                                                                                                noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.thirdS {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

                                                                                                The shared part of the third strong factor of a slot tuple.

                                                                                                Equations
                                                                                                Instances For
                                                                                                  noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.thirdG {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ B₀ : ℝ) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) :

                                                                                                  The group-indexed part of the third strong factor of a slot tuple: the group-indexed freeze factors for basic complements, C_κ B₀ (S_c + S_d) when a complement slot is the U slot.

                                                                                                  Equations
                                                                                                  Instances For
                                                                                                    theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.thirdS_indep {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a b c d : Fin 4) (G G' : bf.Grp) (I : ℤ × ℤ) :
                                                                                                    T.thirdS C₀ a b c d G I = T.thirdS C₀ a b c d G' I
                                                                                                    theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.third_le_SG {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {C₀ : ℝ} (hC₀ : 0 ≤ C₀) (B₀ : ℝ) (a b c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) (hbas : ∀ J ∈ A.cells, ∀ (l : Fin 4), T.u ≠ some l → ‖bf.basicIn fp.Mc l J‖ ≤ C₀ * √(dyadicGridLength A.G J.1)) :
                                                                                                    T.third C₀ B₀ a b c d G I ≤ T.thirdS C₀ a b c d G I + T.thirdG C₀ B₀ a b c d G I
                                                                                                    noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.C3v {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ B₀ : ℝ) (G₀ : bf.Grp) (gs : ℤ × ℤ → Finset bf.Grp) (I : ℤ × ℤ) :

                                                                                                    The cell value of the third strong factors (blueprint line 2375: "a third factor is shared or bounded by its group square sum"): the shared parts (evaluated at any fixed group, being independent of it) plus the root of the group square sum of the group-indexed parts.

                                                                                                    Equations
                                                                                                    • One or more equations did not get rendered due to their size.
                                                                                                    Instances For
                                                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.third_le_C3v {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {C₀ : ℝ} (hC₀ : 0 ≤ C₀) (B₀ : ℝ) (G₀ : bf.Grp) (gs : ℤ × ℤ → Finset bf.Grp) (I : ℤ × ℤ) (hbas : ∀ J ∈ A.cells, ∀ (l : Fin 4), T.u ≠ some l → ‖bf.basicIn fp.Mc l J‖ ≤ C₀ * √(dyadicGridLength A.G J.1)) {G : bf.Grp} (hG : G ∈ gs I) :
                                                                                                      6 * ∑ a : Fin 4, ∑ b : Fin 4, ∑ c : Fin 4, ∑ d : Fin 4, T.third C₀ B₀ a b c d G I ≤ T.C3v C₀ B₀ G₀ gs I

                                                                                                      Blueprint lines 2375-2382: the third strong factors of every group at a cell are bounded by the cell value.

                                                                                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.C3v_sq_le {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ B₀ : ℝ) (G₀ : bf.Grp) (gs : ℤ × ℤ → Finset bf.Grp) (S : Finset (ℤ × ℤ)) :
                                                                                                      ∑ I ∈ S, dyadicGridLength A.G I.1 * T.C3v C₀ B₀ G₀ gs I ^ 2 ≤ 2 * ∑ I ∈ S, dyadicGridLength A.G I.1 * (6 * ∑ a : Fin 4, ∑ b : Fin 4, ∑ c : Fin 4, ∑ d : Fin 4, T.thirdS C₀ a b c d G₀ I) ^ 2 + 2 * ∑ I ∈ S, dyadicGridLength A.G I.1 * ∑ G ∈ gs I, (6 * ∑ a : Fin 4, ∑ b : Fin 4, ∑ c : Fin 4, ∑ d : Fin 4, T.thirdG C₀ B₀ a b c d G I) ^ 2

                                                                                                      The integrated square of the cell values is at most twice the shared and twice the group-summed integrated squares.

                                                                                                      theorem TrilinearHT.Auto.sq6_le (x₁ x₂ x₃ x₄ x₅ x₆ : ℝ) :
                                                                                                      (x₁ + x₂ + x₃ + x₄ + x₅ + x₆) ^ 2 ≤ 6 * (x₁ ^ 2 + x₂ ^ 2 + x₃ ^ 2 + x₄ ^ 2 + x₅ ^ 2 + x₆ ^ 2)

                                                                                                      (x₁ + ⋯ + x₆)² ≤ 6 (x₁² + ⋯ + x₆²).

                                                                                                      theorem TrilinearHT.Auto.len_sq_root {L C E : ℝ} (hL : 0 < L) (hE : 0 ≤ E) :
                                                                                                      L * (C * (√E / √L)) ^ 2 = C ^ 2 * E

                                                                                                      A length times a squared normalized root: L (C √E / √L)² = C² E.

                                                                                                      noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frzShE {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) :

                                                                                                      The energy of the shared freeze and flag factor.

                                                                                                      Equations
                                                                                                      • One or more equations did not get rendered due to their size.
                                                                                                      Instances For
                                                                                                        noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frzGrE {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) :

                                                                                                        The energy of the group-indexed freeze and flag factor.

                                                                                                        Equations
                                                                                                        • One or more equations did not get rendered due to their size.
                                                                                                        Instances For
                                                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frzShE_nonneg {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) :
                                                                                                          0 ≤ T.frzShE C₀ a c d G t t' j I
                                                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frzGrE_nonneg {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) :
                                                                                                          0 ≤ T.frzGrE C₀ a c d G t t' j I
                                                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frzSh_sq {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) :
                                                                                                          dyadicGridLength A.G I.1 * T.frzSh C₀ a c d G t t' j I ^ 2 ≤ 6 * T.frzShE C₀ a c d G t t' j I

                                                                                                          The length times the square of the shared freeze factor is at most six times its energy.

                                                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frzGr_sq {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (t t' : List ℕ) (j : ℕ) (I : ℤ × ℤ) :
                                                                                                          dyadicGridLength A.G I.1 * T.frzGr C₀ a c d G t t' j I ^ 2 ≤ 6 * T.frzGrE C₀ a c d G t t' j I

                                                                                                          The length times the square of the group-indexed freeze factor is at most six times its energy.

                                                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.thS_sq {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) {Cy : ℝ} {Lp Jm : ℕ} (hLp : ∀ (l : Fin 4), (T.pe l).length ≤ Lp) (hJm : ∀ (i i' : ℕ), (T.desc c d (T.tOf c i) (T.tOf d i')).length ≤ Jm) (hbc : ‖bf.basicIn fp.Mc c I‖ / √(dyadicGridLength A.G I.1) ≤ Cy) (hbd : ‖bf.basicIn fp.Mc d I‖ / √(dyadicGridLength A.G I.1) ≤ Cy) (hud : ‖bf.Ucol fp.Mc d I‖ / √(dyadicGridLength A.G I.1) ≤ Cy) :
                                                                                                          dyadicGridLength A.G I.1 * T.thS C₀ a c d G I ^ 2 ≤ ↑Lp ^ 2 * (2 * (1 + 5 * ↑Jm)) * (↑Lp ^ 2 * (localFormUniformConstant κ' ^ 2 * (8 * Cy ^ 2 * (‖bf.Ucol fp.Mc c I‖ ^ 2 + ‖bf.Ucol fp.Mc d I‖ ^ 2))) + (2 / ↑fp.P * localFormUniformConstant κ') ^ 2 * 6 * ∑ i' ∈ Finset.range (T.pe d).length, ∑ i ∈ Finset.range (T.pe c).length, ∑ j ∈ Finset.range (T.desc c d (T.tOf c i) (T.tOf d i')).length, ∑ _o ∈ Finset.range 5, T.frzShE C₀ a c d G (T.tOf c i) (T.tOf d i') j I)

                                                                                                          The length times the square of the shared part of the third factor of a basic tuple.

                                                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.thG_sq {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ : ℝ) (a c d : Fin 4) (G : bf.Grp) (I : ℤ × ℤ) {Lp Jm : ℕ} (hLp : ∀ (l : Fin 4), (T.pe l).length ≤ Lp) (hJm : ∀ (i i' : ℕ), (T.desc c d (T.tOf c i) (T.tOf d i')).length ≤ Jm) :
                                                                                                          dyadicGridLength A.G I.1 * T.thG C₀ a c d G I ^ 2 ≤ ↑Lp ^ 2 * (2 * (1 + 5 * ↑Jm)) * ((2 / ↑fp.P * localFormUniformConstant κ') ^ 2 * 6 * ∑ i' ∈ Finset.range (T.pe d).length, ∑ i ∈ Finset.range (T.pe c).length, ∑ j ∈ Finset.range (T.desc c d (T.tOf c i) (T.tOf d i')).length, ∑ _o ∈ Finset.range 5, T.frzGrE C₀ a c d G (T.tOf c i) (T.tOf d i') j I)

                                                                                                          The length times the square of the group-indexed part of the third factor of a basic tuple.

                                                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.flag_len_le {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (S Sc : Finset (ℤ × ℤ)) (hSc : ∀ I ∈ S, ∀ J ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2 → A.blkStart T.K I.1 ≤ J.1 → J ∈ Sc) (E : ℤ × ℤ → ℝ) (hE : ∀ (J : ℤ × ℤ), 0 ≤ E J) {c : ℝ} (hc : 0 < c) :
                                                                                                          ∑ I ∈ S, dyadicGridLength A.G I.1 * T.fI E c I ≤ ↑T.K / c * ∑ J ∈ Sc, E J

                                                                                                          The flagged length of the uses is at most K / c times the energies on their ancestors.

                                                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.sum_le_anc {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (S Sc : Finset (ℤ × ℤ)) (hS : S ⊆ A.cells) (hSc : ∀ I ∈ S, ∀ J ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2 → A.blkStart T.K I.1 ≤ J.1 → J ∈ Sc) (E : ℤ × ℤ → ℝ) (hE : ∀ (J : ℤ × ℤ), 0 ≤ E J) :
                                                                                                          ∑ I ∈ S, E I ≤ ∑ J ∈ Sc, E J

                                                                                                          The uses lie among their ancestors.

                                                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.shE_sum {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {C₀ : ℝ} (hC₀ : 0 < C₀) (a c d : Fin 4) (G₀ : bf.Grp) (t t' : List ℕ) (j : ℕ) (S Sc : Finset (ℤ × ℤ)) (hS : S ⊆ A.cells) (hSc : ∀ I ∈ S, ∀ J ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2 → A.blkStart T.K I.1 ≤ J.1 → J ∈ Sc) {Ei Ep EF : ℝ} (hEp0 : 0 ≤ Ep) (hEF0 : 0 ≤ EF) (hEi : ∑ J ∈ Sc, T.iYe a c d G₀ t t' j J ≤ Ei) (hEp : T.cumY c d t t' j → ∑ J ∈ Sc, T.pYe a c d G₀ t t' j J ≤ Ep) (hEF : T.cumF c d t t' j → ∑ J ∈ Sc, T.dFe a c d G₀ t t' j J ≤ EF) :
                                                                                                          ∑ I ∈ S, T.frzShE C₀ a c d G₀ t t' j I ≤ C₀ ^ 2 * ((64 + 8 * ↑T.K) * (Ei + Ep) + (1 + ↑T.K) * EF)

                                                                                                          Blueprint lines 2389-2393 for the shared freeze factors of one step: their energies over the uses are at most C₀² ((64 + 8K)(E_i + E_p) + (1 + K) E_F) in terms of the freeze energies of the identity output, the pads and the other complement over the ancestors in the blocks.

                                                                                                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.grE_sum {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) {C₀ : ℝ} (hC₀ : 0 < C₀) (a c d : Fin 4) (t t' : List ℕ) (j : ℕ) (S : Finset (ℤ × ℤ)) (hS : S ⊆ A.cells) (gs : ℤ × ℤ → Finset bf.Grp) (gset : Finset bf.Grp) (hgs : ∀ I ∈ S, gs I ⊆ gset) (ScG : bf.Grp → Finset (ℤ × ℤ)) (hScG : ∀ I ∈ S, ∀ G ∈ gs I, ∀ J ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2 → A.blkStart T.K I.1 ≤ J.1 → J ∈ ScG G) {Ep EF : ℝ} (hEp0 : 0 ≤ Ep) (hEF0 : 0 ≤ EF) (hEp : ¬T.cumY c d t t' j → ∑ G ∈ gset, ∑ J ∈ ScG G, T.pYe a c d G t t' j J ≤ Ep) (hEF : ¬T.cumF c d t t' j → ∑ G ∈ gset, ∑ J ∈ ScG G, T.dFe a c d G t t' j J ≤ EF) :
                                                                                                          ∑ I ∈ S, ∑ G ∈ gs I, T.frzGrE C₀ a c d G t t' j I ≤ C₀ ^ 2 * ((64 + 8 * ↑T.K) * Ep + (1 + ↑T.K) * EF)

                                                                                                          Blueprint lines 2389-2393 for the group-indexed freeze factors of one step ("joint group budgets for positive ball ranges"): their energies over the uses and groups are at most C₀² ((64 + 8K) E_p + (1 + K) E_F) in terms of the joint freeze energies of the pads and of the other complement over the ancestors of the uses of each group.

                                                                                                          theorem TrilinearHT.Auto.sum_swap4 {α : Type u_1} (S : Finset α) (A B : Finset ℕ) (C : ℕ → ℕ → Finset ℕ) (O : Finset ℕ) (f : α → ℕ → ℕ → ℕ → ℕ → ℝ) :
                                                                                                          ∑ I ∈ S, ∑ i' ∈ A, ∑ i ∈ B, ∑ j ∈ C i i', ∑ o ∈ O, f I i' i j o = ∑ i' ∈ A, ∑ i ∈ B, ∑ j ∈ C i i', ∑ o ∈ O, ∑ I ∈ S, f I i' i j o

                                                                                                          Moving an outer sum inside four nested index sums.

                                                                                                          theorem TrilinearHT.Auto.sum_comm_out {α : Type u_1} {β : Type u_2} {γ : Type u_3} (S : Finset α) (T : α → Finset β) (U : Finset γ) (f : α → β → γ → ℝ) :
                                                                                                          ∑ I ∈ S, ∑ G ∈ T I, ∑ u ∈ U, f I G u = ∑ u ∈ U, ∑ I ∈ S, ∑ G ∈ T I, f I G u

                                                                                                          Moving an inner sum outside a sum over cells and groups.

                                                                                                          theorem TrilinearHT.Auto.sum4_bound (A B : Finset ℕ) (C : ℕ → ℕ → Finset ℕ) (g : ℕ → ℕ → ℕ → ℝ) {F : ℝ} (hF : 0 ≤ F) {Lp Jm : ℕ} (hA : A.card ≤ Lp) (hB : B.card ≤ Lp) (hC : ∀ (i i' : ℕ), (C i i').card ≤ Jm) (hg : ∀ i' ∈ A, ∀ i ∈ B, ∀ j ∈ C i i', g i' i j ≤ F) :
                                                                                                          ∑ i' ∈ A, ∑ i ∈ B, ∑ j ∈ C i i', ∑ _o ∈ Finset.range 5, g i' i j ≤ ↑Lp * ↑Lp * (↑Jm * 5) * F

                                                                                                          Four nested index sums of terms bounded by F.

                                                                                                          noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.SideLeafM.frzB {κ' : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ' c₀} {bf : A.BasicFamilies} {fp : bf.FamParams} (T : fp.SideLeafM) (C₀ Eb : ℝ) :

                                                                                                          The freeze budget of one step (both for its shared and its group-indexed factors).

                                                                                                          Equations
                                                                                                          Instances For