Documentation

LeanPool.TrilinearHilbertTransform.Auto.Sec131OneExpansionAtFirstMatch.MainAttemptLift

Trilinear Hilbert transform: mainAttemptLift #

theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.mainAttemptLift (κ : LocalKernelClass) (c₀ : ℕ) :
∃ (D : ℕ), 1 ≤ D ∧ ∀ (A : ActiveSetup κ c₀) (bf : A.BasicFamilies) (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)), (∀ e ∈ s, ∃ R ∈ residueBox (bf.vtag e.tag).dim 9, ∃ (γ : ℝ), e = templateCol (bf.vtag e.tag) l R γ e.birth e.rank e.tag) → (∀ e ∈ s, bf.occAvail (↑e.tag.2) e.tag.1) → ∀ (d : bf.Vtx), ∀ cs ⊆ A.cells, ∀ {G : bf.Grp} {j : ℕ} {ρ₀ : Fin fp.K.d0} {z : bf.Vtx} {g : ℤ}, G.2.1 = some (ρ₀, z, g) → 2 ≤ fp.Hed → ∀ {dB : ℕ}, (∀ (w : bf.Vtx), (bf.vtag w).dim ≤ dB) → (∀ (w : bf.Vtx) (a c : Fin (bf.vtag w).dim), ↑(rationalHeight ((bf.vtag w).C a c)) ≤ fp.Hed) → ∀ {δ : ℝ}, 0 < δ → δ < 1 / 4 → ∀ (ρ : Fin (bf.vtag z).dim → ℝ), (∀ (i : Fin (bf.vtag z).dim), ρ i ∈ Set.Icc 0 1) → ∀ {H : ℝ}, A.Hsrc ≤ H → ↑(bf.vtag z).dim ≤ Real.log H → (∀ (i k : Fin (bf.vtag z).dim), ↑(chartRationalHeight ((↑(-slotCoeff l) • (bf.vtag z).C) i k)) ≤ H) → ↑(bf.vtag z).dim * (bumpConst * 8 ^ 32 * (2 / δ)) ≤ H → ∀ {δc : ℝ}, 0 < δc → ∀ {N : ℝ}, 0 ≤ N → (∀ I ∈ A.cells, ↑(mainLabels A.G fp.Mc (bf.origCols l) s I (fp.brank j)).card ≤ N) → δc ^ 2 * N * A.colBudget ^ 2 ≤ 1 → have FM := fp.firstCells cs l s G j d; have X := 1 + Real.log (chartTranslationBudget (H ^ 6)) + Real.log (3 * fp.ballEdgeH dB (fp.ballRadius g (fp.bbase j + fp.P))); ∃ (Md : Type) (x : Fintype Md) (L : LiftData (bf.Lab ⊕ Fin fp.Mc) Md) (ψ : Md → ℝ → ℂ), (∀ (Φ : bf.Lab ⊕ Fin fp.Mc), L.εP Φ = mainWeight fp.Mc (bf.origCols l) Φ) ∧ L.δ = δc ∧ (∀ (m : Md), 0 < L.εM m) ∧ (∀ (m : Md), L.εM m ≤ L.εP ⋯) ∧ (∀ (m : Md), ⋯ ≤ ⋯) ∧ (∀ (y : ℝ), ⋯) ∧ ⋯ ∧ ⋯

Blueprint line 1932 (eq:modes and the lift R_(l,G)) on the main columns of a role: the augmented modes ψ_m = ζ^ρ e(c_l p_ρ) e(λ_m (y - a)² + γ_m (y - a)) of the first-match expansions of all primaries Φ at their first-match cells, with private indices distinct across primaries and branches, and the pointwise linear map with physical coordinate (ζ^ρ)² F_phys + Σ_Φ F_Φ / √ε_Φ q_Φ (q_Φ = Σ_m a_(Φ,m) (ψ_m)_phys - (ζ^ρ)² φ_Φ on the first-match branches of Φ, zero before the match) and mode coordinates √ε_m a_(Φ,m) F_Φ / √ε_Φ. The primary weights are the private weights ε_Φ of the main columns; the mode weights are chosen locally, ε_m = ε_Φ / (Σ_m' |a_(Φ,m')|² + 1), so that the private map has squared norm at most one and 1 / ε_m ≤ colBudget² (exp(D X^D)² + 1) (log (1/ε_m) ≤ P^C). The physical correction satisfies Σ_Φ |q_Φ|² / ε_Φ ≤ δ_c² N colBudget² pointwise, N bounding the main labels at the cells (δ_c D_m^C); with δ_c² N colBudget² ≤ 1 this is the absolute norm bound of the lift.

The mode budget D_* (blueprint line 1934) #

The clearing integer Q₀ (blueprint lines 1893 and 1934) #

def TrilinearHT.Auto.clearInt {d : ℕ} (C : Matrix (Fin d) (Fin d) ℚ) :

The clearing integer of a rational matrix: the product of the denominators of its entries (blueprint line 1893: "an integer Q₀ in the main budget clearing C_z").

Equations
Instances For
    theorem TrilinearHT.Auto.clearInt_clears {d : ℕ} (C : Matrix (Fin d) (Fin d) ℚ) (a b : Fin d) :
    ∃ (z : ℤ), ↑(clearInt C) * ↑(C a b) = ↑z

    The clearing integer clears every entry.

    theorem TrilinearHT.Auto.clearInt_le {d : ℕ} (C : Matrix (Fin d) (Fin d) ℚ) {Hed : ℝ} (hC : ∀ (a b : Fin d), ↑(rationalHeight (C a b)) ≤ Hed) :
    ↑(clearInt C) ≤ Hed ^ (d * d)

    The clearing integer is at most H^(d²) for entries of height at most H.

    Groups and main uses along a path (blueprint lines 1728-1730 and 1934) #

    theorem TrilinearHT.Auto.ColorSetup.changes_anc {V : Type u_1} [DecidableEq V] (K : ColorSetup V) (T : AdmTree V) {I₀ I : T.Cell} (h : T.Anc I₀ I) {v : V} (hv : v ∈ T.X I₀) :
    K.changes T I₀ v ≤ K.changes T I v ∧ (K.changes T I₀ v = K.changes T I v → K.colorData (T.st I₀) v = K.colorData (T.st I) v)

    The change counter does not decrease from an ancestor to a cell, and when it is unchanged the color data are unchanged.

    theorem TrilinearHT.Auto.ColorSetup.card_grp_chain_le {V : Type u_1} [DecidableEq V] (K : ColorSetup V) (T : AdmTree V) [Fintype V] [DecidableEq (ℕ × Option (Fin K.d0 × V × ℤ) × ℕ × (ℕ × ℕ) × Option (Fin K.d0 × V × ℤ))] {C : Finset T.Cell} (htot : ∀ I ∈ C, ∀ J ∈ C, T.Anc I J ∨ T.Anc J I) {Nv : ℕ} (hN : ∀ (I : T.Cell), (T.X I).card ≤ Nv) :
    (Finset.image (fun (p : T.Cell × V) => K.grp T Nv p.1 p.2) ({p ∈ C ×ˢ Finset.univ | p.2 ∈ T.X p.1})).card ≤ Nv * (K.potMax Nv + 1)

    The groups of the present central vertices along a chain of cells number at most N_v (potMax + 1): each of the at most N_v vertices of the chain changes its color data fewer than potMax times (blueprint lines 1728-1730; line 1934: "actual main uses along a path across groups").

    theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.card_groups_path_le {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (y : ℝ) :
    (Finset.image (fun (p : bf.admT.Cell × bf.Vtx) => fp.K.grp bf.admT A.famVtxBound p.1 p.2) ({p ∈ Finset.image bf.admAt ({I ∈ A.cells | y ∈ dyadicGridCell A.G I.1 I.2}) ×ˢ Finset.univ | p.2 ∈ bf.admT.X p.1})).card ≤ A.famVtxBound * (fp.K.potMax A.famVtxBound + 1)

    The groups of the attempt with a present central vertex at an active cell containing a point number at most D (potMax + 1), D the vertex bound (blueprint line 1934: "actual main uses along a path across groups").

    The uniform first-match size and the budget D_* (blueprint line 1934) #

    theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.ballRadius_le {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) {g : ℤ} (hg : 0 ≤ g) {j : ℕ} (hj : j ≤ 4) {p : ℕ} (hp : p ≤ fp.P) :
    fp.ballRadius g (fp.bbase j + p) ≤ fp.K.b1 * fp.K.d0 + fp.K.b1 + fp.bbase 4 + fp.P

    For a nonnegative top score, a ball level j ≤ 4 and a pad p ≤ P, the ball radius is at most b₁ d₀ + b₁ + bbase 4 + P.

    theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.ballEdgeH_mono {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (hHed : 2 ≤ fp.Hed) (dB : ℕ) {n n' : ℕ} (h : n ≤ n') :
    fp.ballEdgeH dB n ≤ fp.ballEdgeH dB n'

    The edge height increases with the radius.

    noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.Xmax {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (dB : ℕ) (H : ℝ) :

    The uniform first-match size of the attempt: the size X of mainFirstMatch_finite at the largest ball radius b₁ d₀ + b₁ + bbase 4 + P of the four ball levels (blueprint line 1934: the bounds are uniform in the groups and the branch offsets).

    Equations
    Instances For
      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.one_le_X {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (hHed : 2 ≤ fp.Hed) (dB : ℕ) {H : ℝ} (hH : 1 ≤ H) (n : ℕ) :

      The first-match size of a role is at least one.

      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.X_le_Xmax {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (hHed : 2 ≤ fp.Hed) (dB : ℕ) (H : ℝ) {g : ℤ} (hg : 0 ≤ g) {j : ℕ} (hj : j ≤ 4) :
      1 + Real.log (chartTranslationBudget (H ^ 6)) + Real.log (3 * fp.ballEdgeH dB (fp.ballRadius g (fp.bbase j + fp.P))) ≤ fp.Xmax dB H

      The first-match size of a role with a nonnegative top score at a level j ≤ 4 is at most the uniform size.

      noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.modeStar {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) (H δc N k : ℝ) :

      The mode budget D_* of the attempt (blueprint line 1934), for the first-match degree D, the dimension bound d_B, the source complexity H, the precision δ_c, a bound N for the main labels at one cell, and the parameter k. With B = exp(D X_max^D) and the count M₁ = B (4 max(1, 4B/δ_c) + 1)^(4 d_B) of the modes of one primary at one branch, it is the sum of e^k; the modes and main uses of all groups along a path, D (potMax + 1) (N + 1) M₁; the rational heights of eq:mode-differences; the inverse private weights colBudget² (B² + 1); the bound H_ed^(d_B²) of the clearing integer Q₀; and the absolute coefficient sums (√N + 1) colBudget B of the lifted main outputs on normalized cells. It does not depend on the branch offsets.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.le_modeStar {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) {H δc N : ℝ} (k : ℝ) (hHed : 2 ≤ fp.Hed) (hH : 1 ≤ H) (hδc : 0 < δc) (hN0 : 0 ≤ N) {g : ℤ} (hg : 0 ≤ g) {j : ℕ} (hj : j ≤ 4) :
        have X := 1 + Real.log (chartTranslationBudget (H ^ 6)) + Real.log (3 * fp.ballEdgeH dB (fp.ballRadius g (fp.bbase j + fp.P))); have B := Real.exp (↑D * X ^ D); Real.exp k ≤ fp.modeStar D dB H δc N k ∧ B ≤ fp.modeStar D dB H δc N k ∧ ↑A.famVtxBound * (↑(fp.K.potMax A.famVtxBound) + 1) * (N * (B * (4 * max 1 (4 * B / δc) + 1) ^ (4 * dB))) ≤ fp.modeStar D dB H δc N k ∧ ↑A.famVtxBound * (↑(fp.K.potMax A.famVtxBound) + 1) * N ≤ fp.modeStar D dB H δc N k ∧ B * (1 + 4 * (2 * ↑dB + 1) * max 1 (4 * B / δc)) ≤ fp.modeStar D dB H δc N k ∧ A.colBudget ^ 2 * (B ^ 2 + 1) ≤ fp.modeStar D dB H δc N k ∧ √N * A.colBudget * B ≤ fp.modeStar D dB H δc N k ∧ N * (B * (4 * max 1 (4 * B / δc) + 1) ^ (4 * dB)) ≤ fp.modeStar D dB H δc N k ∧ B * (4 * max 1 (4 * B / δc) + 1) ^ (4 * dB) ≤ fp.modeStar D dB H δc N k

        Blueprint line 1934: the budget D_* dominates e^k, the first-match bound B, the modes of all groups along a path (D (potMax + 1) groups, at most N matched primaries, at most the bound of mainAttemptLift modes for each), the main uses along a path (D (potMax + 1) N), the rational heights, the inverse private weights, the coefficient sums, and the modes of one role at a point and of one primary at one branch, for a role with a nonnegative top score at a level j ≤ 4, uniformly in the branch offsets.

        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.log_modeStar_le_aux {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) {H δc N k E : ℝ} (hk : 0 ≤ k) (hE : 1 ≤ E) (hdB : ↑dB ≤ E) (hHed : 2 ≤ fp.Hed) (hHedE : Real.log fp.Hed ≤ E) (hH : 1 ≤ H) (hδcE : δc⁻¹ ≤ Real.exp E) (hN0 : 0 ≤ N) (hNE : N ≤ Real.exp E) (hcB : A.colBudget ≤ Real.exp E) :
        Real.log (fp.modeStar D dB H δc N k) ≤ 4 * (↑dB + 1) * (↑D * fp.Xmax dB H ^ D + E + 6) + E ^ 3 + k + Real.log (↑(fp.K.potMax A.famVtxBound) + 1) + 2 * E + 7

        The logarithm of the budget D_* in terms of E bounding d_B, log H_ed, log colBudget, log N and log (1/δ_c): log D_* ≤ 4 (d_B + 1) (L_B + E + 6) + E³ + k + L_p + 2E + 7, where L_B = D X_max^D and L_p = log (potMax + 1) (blueprint line 1934).

        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.d0_le {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) {k : ℝ} {c : ℕ} (hk : 1 ≤ k) (hcB : A.colBudget ≤ Real.exp (k ^ c)) :
        ↑fp.K.d0 ≤ 5001 * k ^ c

        The number of color degrees is at most 5001 k^c when colBudget ≤ exp(k^c).

        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.log_potMax_le {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) {E : ℝ} (hE : 1 ≤ E) (hcB : A.colBudget ≤ Real.exp E) :
        Real.log (↑(fp.K.potMax A.famVtxBound) + 1) ≤ 2 * (↑fp.K.d0 * (2 * ↑fp.K.d0 + 1)) + ↑fp.K.d0 + 2 * E + 9

        The logarithm of potMax + 1 for the vertex bound: at most 2 d₀ (2 d₀ + 1) + d₀ + 2E + 9.

        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.Xmax_le_pow {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) {c dB : ℕ} {H k : ℝ} (hk : 1 ≤ k) (hL : ↑fp.Lc + 6 ≤ k ^ c) (hHm : ↑fp.Hmax + 1 ≤ (k * ↑fp.P) ^ c) (hdB : ↑dB ≤ k ^ c) (hHed : 2 ≤ fp.Hed) (hHedk : Real.log fp.Hed ≤ k ^ c) (hH : 1 ≤ H) (hHk : Real.log H ≤ k ^ c) (hcB : A.colBudget ≤ Real.exp (k ^ c)) :
        fp.Xmax dB H ≤ (5002 * (k * ↑fp.P)) ^ (113 * c + 116)

        The uniform first-match size is at most w^(113c+116), w = 5002 k P, under the standing bounds of log_modeStar_poly.

        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.log_potMax_le_pow {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) {c : ℕ} {k : ℝ} (hk : 1 ≤ k) (hcB : A.colBudget ≤ Real.exp (k ^ c)) :
        Real.log (↑(fp.K.potMax A.famVtxBound) + 1) ≤ (5002 * (k * ↑fp.P)) ^ (2 * c + 3)

        log (potMax + 1) ≤ w^(2c+3), w = 5002 k P, when colBudget ≤ exp(k^c).

        theorem TrilinearHT.Auto.log_modeStar_poly (c D : ℕ) :
        ∃ (C : ℕ), ∀ {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (dB : ℕ) {H δc N k : ℝ}, 1 ≤ k → ↑fp.Lc + 6 ≤ k ^ c → ↑fp.Hmax + 1 ≤ (k * ↑fp.P) ^ c → ↑dB ≤ k ^ c → 2 ≤ fp.Hed → Real.log fp.Hed ≤ k ^ c → 1 ≤ H → Real.log H ≤ k ^ c → δc⁻¹ ≤ Real.exp (k ^ c) → 0 ≤ N → N ≤ Real.exp (k ^ c) → A.colBudget ≤ Real.exp (k ^ c) → Real.log (fp.modeStar D dB H δc N k) ≤ ↑C * (k * ↑fp.P) ^ C

        Blueprint line 1934: log D_* ≤ P^C. For fixed degrees c (of the standing bounds) and D (of the first-match expansion) there is a degree C such that, whenever L + 6, the dimension bound d_B, log H_ed, log H, log (1/δ_c), log N and log colBudget are at most k^c and H_max + 1 ≤ (k P)^c, the budget D_* of the attempt satisfies log D_* ≤ C (k P)^C (line 1673: "all later bounds polynomial in P, k will be written P^C").

        theorem TrilinearHT.Auto.ColorSetup.grp_top_nonneg {V : Type u_1} [DecidableEq V] (K : ColorSetup V) (T : AdmTree V) {Nv : ℕ} {I : T.Cell} {v : V} (hv : v ∈ T.X I) {ρ : Fin K.d0} {z : V} {g : ℤ} (h : (K.grp T Nv I v).2.1 = some (ρ, z, g)) :
        0 ≤ g

        The top score of the group of a present central vertex is nonnegative (blueprint line 1934: the ball radii of the actual groups are at most the uniform radius).

        The Fourier expansion of the squared gauge (ζ^ρ)² (blueprint lines 1944 and 2056) #

        noncomputable def TrilinearHT.Auto.fractProfile (δ t : ℝ) :

        The periodic branch profile t ↦ b(fract t).

        Equations
        Instances For
          theorem TrilinearHT.Auto.fractProfile_eventuallyEq {δ : ℝ} (hδ : 0 < δ) (t₀ : ℝ) :
          fractProfile δ =ᶠ[nhds t₀] fun (t : ℝ) => branchProfile δ (t - ↑⌊t₀⌋) + branchProfile δ (t - ↑⌊t₀⌋ + 1)

          Near any point the periodic profile is a sum of two translates of the profile.

          theorem TrilinearHT.Auto.fractProfile_deriv_le {δ : ℝ} (hδ : 0 < δ) {m i : ℕ} (hi : i ≤ m) (t₀ : ℝ) :
          |iteratedDeriv i (fractProfile δ) t₀| ≤ (2 * (bumpConst * (8 * (↑m + 1)) ^ 32 * (2 / δ))) ^ i

          Derivative bounds for the periodic profile: |D^i| ≤ (2B)^i for i ≤ m.

          noncomputable def TrilinearHT.Auto.gaugeSq {d : ℕ} (δ : ℝ) (ρ w : Fin d → ℝ) :

          The squared periodic gauge w ↦ (Π_i b({w_i - ρ_i}))² on ℝ^d.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            theorem TrilinearHT.Auto.centerCut_sq_eq (z : ChartTag) (δ : ℝ) (ρ : Fin z.dim → ℝ) (y : ℝ) :
            ↑(centerCut z δ ρ y) ^ 2 = gaugeSq δ ρ fun (i : Fin z.dim) => z.θ i * y
            theorem TrilinearHT.Auto.gaugeSq_periodic {d : ℕ} (δ : ℝ) (ρ w : Fin d → ℝ) (j : Fin d → ℤ) :
            gaugeSq δ ρ (w + fun (i : Fin d) => ↑(j i)) = gaugeSq δ ρ w
            theorem TrilinearHT.Auto.gaugeSq_contDiff {d : ℕ} {δ : ℝ} (hδ : 0 < δ) (ρ : Fin d → ℝ) :
            ContDiff ℝ (↑⊤) (gaugeSq δ ρ)
            theorem TrilinearHT.Auto.gaugeSq_norm_le {d : ℕ} (δ : ℝ) (ρ w : Fin d → ℝ) :
            ‖gaugeSq δ ρ w‖ ≤ 1
            theorem TrilinearHT.Auto.gaugeSq_iteratedFDeriv_le {d : ℕ} {δ : ℝ} (hδ : 0 < δ) (ρ w : Fin d → ℝ) (m : ℕ) :
            ‖iteratedFDeriv ℝ m (gaugeSq δ ρ) w‖ ≤ (2 * (↑d * (2 * (bumpConst * (8 * (↑m + 1)) ^ 32 * (2 / δ))))) ^ m

            The derivative bound ‖D^m (ζ²)‖ ≤ (4dB)^m of the squared gauge.

            theorem TrilinearHT.Auto.gaugeSq_truncate {d : ℕ} (hd : 1 ≤ d) {δ : ℝ} (hδ : 0 < δ) (ρ : Fin d → ℝ) (K : ℕ) :
            ∃ (c : (Fin d → ℤ) → ℂ), (∀ (v : Fin d → ℤ), ‖c v‖ ≤ 1) ∧ ∀ (w : Fin d → ℝ), ‖gaugeSq δ ρ w - ∑ v ∈ frequencyBox d (2 ^ (K + 1)), c v * ↑(Real.fourierChar (∑ i : Fin d, ↑(v i) * w i))‖ ≤ 2 * (7 ^ d * (2 * (↑d * (2 * (bumpConst * (8 * (↑(d + 1) + 1)) ^ 32 * (2 / δ))))) ^ (d + 1) * √↑d ^ (d + 1)) / 2 ^ K

            Blueprint line 2056: the squared gauge is, uniformly in w and in the offset, the sum of its Fourier modes in the box |v|_∞ ≤ 2^(K+1) up to 2B/2^K, with coefficients bounded by one and B = 7^d A √d^(d+1) for the derivative constant A of order d + 1.

            noncomputable def TrilinearHT.Auto.gaugeTail (d : ℕ) (δ : ℝ) :

            The truncation error constant of the squared gauge (gaugeSq_truncate).

            Equations
            Instances For
              theorem TrilinearHT.Auto.gaugeTail_nonneg (d : ℕ) {δ : ℝ} (hδ : 0 < δ) :
              0 ≤ gaugeTail d δ
              theorem TrilinearHT.Auto.gaugeSq_truncate' (d : ℕ) {δ : ℝ} (hδ : 0 < δ) (ρ : Fin d → ℝ) (K : ℕ) :
              ∃ (c : (Fin d → ℤ) → ℂ), (∀ (v : Fin d → ℤ), ‖c v‖ ≤ 1) ∧ ∀ (w : Fin d → ℝ), ‖gaugeSq δ ρ w - ∑ v ∈ frequencyBox d (2 ^ (K + 1)), c v * ↑(Real.fourierChar (∑ i : Fin d, ↑(v i) * w i))‖ ≤ 2 * gaugeTail d δ / 2 ^ K

              gaugeSq_truncate in every dimension (in dimension zero the gauge is one).

              The gauge multiplier on the true supports (blueprint line 1944) #

              theorem TrilinearHT.Auto.gauge_factors_eq_mult_exact {d : ℕ} {δ : ℝ} (hδ : 0 < δ) (θ : Fin d → ℝ) (C : Matrix (Fin d) (Fin d) ℚ) (lam : ℝ) {Q0 : ℕ} (hQ0 : 0 < Q0) (l' : Fin 4) (ρ : Fin 4 → Fin d → ℝ) (x t : ℝ) :
              (∏ j : Fin 4, ↑(branchCutoffValue δ (ρ j) fun (a : Fin d) => θ a * (x + ↑↑j * t))) * ↑(Real.fourierChar (∑ j : Fin 4, ↑(slotCoeff j) * (lam * (x + ↑↑j * t) ^ 2 + chartMatrixPhase C (fun (a : Fin d) => θ a * (x + ↑↑j * t)) (branchLift (ρ j) fun (a : Fin d) => θ a * (x + ↑↑j * t))))) = (∏ j : Fin 4, ↑(branchCutoffValue δ (ρ j) fun (a : Fin d) => θ a * (x + ↑↑j * t))) * gaugeMult (δ / 2) Q0 l' C ρ (torusPt θ Q0 l' x t)

              Blueprint lines 1942-1944 ("slightly enlarge the cutoffs inside each branch region, making them one on the required supports, and extend by zero at its cuts"): the enlarged cutoff of parameter δ/2 is one wherever the true cutoff of parameter δ is nonzero (the true cutoff vanishes within δ of each cut, branchProfile_eq_zero_near_cut) and zero at the cuts. Hence the four true cutoffs times the four gauge phases e(c_j p_{ρ_j}(y_j)) equal exactly the four true cutoffs times the smooth periodic multiplier gaugeMult (δ/2) at the torus point.

              theorem TrilinearHT.Auto.periodic_fourierNorm_le {d : ℕ} (hd : 1 ≤ d) (f : (Fin d → ℝ) → ℂ) (hf : ContDiff ℝ (↑⊤) f) (hper : ∀ (x : Fin d → ℝ) (j : Fin d → ℤ), f (x + fun (i : Fin d) => ↑(j i)) = f x) {A B : ℝ} (hA : 0 ≤ A) (hAd : ∀ (x : Fin d → ℝ), ‖iteratedFDeriv ℝ (d + 1) f x‖ ≤ A) (hB : ∀ (x : Fin d → ℝ), ‖f x‖ ≤ B) :
              (∀ (x : Fin d → ℝ), HasSum (fun (v : Fin d → ℤ) => periodicFourierCoeff f v * ↑(Real.fourierChar (∑ i : Fin d, ↑(v i) * x i))) (f x)) ∧ (Summable fun (v : Fin d → ℤ) => ‖periodicFourierCoeff f v‖) ∧ ∑' (v : Fin d → ℤ), ‖periodicFourierCoeff f v‖ ≤ 5 ^ d * B + 2 * (7 ^ d * A * √↑d ^ (d + 1))

              The full absolute Fourier norm of a smooth 1-periodic function on ℝ^d with supremum bound B and derivative bound A of order d + 1 (blueprint line 1944: "its Gevrey and absolute Fourier bounds"): it is the sum of its absolutely convergent Fourier series, and Σ_v |cHat_v| ≤ 5^d B + 2 · 7^d A √d^(d+1).

              noncomputable def TrilinearHT.Auto.gaugeMultA (d : ℕ) (Q0 Cm δ : ℝ) :

              The derivative constant of order 2d + 1 of the multiplier (gaugeMult_deriv_le), with Q₀ and the entry bound C_m as real parameters.

              Equations
              • One or more equations did not get rendered due to their size.
              Instances For
                noncomputable def TrilinearHT.Auto.gaugeMultTail (d : ℕ) (Q0 Cm δ : ℝ) :

                The truncation constant of the multiplier.

                Equations
                Instances For
                  noncomputable def TrilinearHT.Auto.gaugeMultNorm (d : ℕ) (Q0 Cm δ : ℝ) :

                  The full Fourier norm bound of the multiplier.

                  Equations
                  Instances For
                    noncomputable def TrilinearHT.Auto.gaugeSqNorm (d : ℕ) (δ : ℝ) :

                    The full Fourier norm bound of the squared gauge (ζ^ρ)².

                    Equations
                    Instances For
                      theorem TrilinearHT.Auto.periodic_truncate_full {d : ℕ} (hd : 1 ≤ d) (f : (Fin d → ℝ) → ℂ) (hf : ContDiff ℝ (↑⊤) f) (hper : ∀ (x : Fin d → ℝ) (j : Fin d → ℤ), f (x + fun (i : Fin d) => ↑(j i)) = f x) {A B : ℝ} (hA : 0 ≤ A) (hAd : ∀ (x : Fin d → ℝ), ‖iteratedFDeriv ℝ (d + 1) f x‖ ≤ A) (hB : ∀ (x : Fin d → ℝ), ‖f x‖ ≤ B) (K : ℕ) :
                      (∀ (v : Fin d → ℤ), ‖periodicFourierCoeff f v‖ ≤ B) ∧ (∀ (s : Finset (Fin d → ℤ)), ∑ v ∈ s, ‖periodicFourierCoeff f v‖ ≤ 5 ^ d * B + 2 * (7 ^ d * A * √↑d ^ (d + 1))) ∧ ∀ (w : Fin d → ℝ), ‖f w - ∑ v ∈ frequencyBox d (2 ^ (K + 1)), periodicFourierCoeff f v * ↑(Real.fourierChar (∑ i : Fin d, ↑(v i) * w i))‖ ≤ 2 * (7 ^ d * A * √↑d ^ (d + 1)) / 2 ^ K

                      Truncation of a smooth 1-periodic function with its Fourier coefficients: the coefficients cHat_v are bounded by the supremum bound B, every finite absolute coefficient sum is at most the full norm bound 5^d B + 2 · 7^d A √d^(d+1), and the Fourier sum over the box |v|_∞ ≤ 2^(K+1) approximates the function uniformly within 2 · 7^d A √d^(d+1) / 2^K.

                      Uniformity of the Fourier constants in the center tag (blueprint line 1944) #

                      theorem TrilinearHT.Auto.profR_mono {δ : ℝ} (hδ : 0 < δ) {m m' : ℕ} (h : m ≤ m') :
                      profR δ m ≤ profR δ m'
                      theorem TrilinearHT.Auto.one_le_profR {δ : ℝ} (hδ : 0 < δ) (hδ1 : δ ≤ 1) (m : ℕ) :
                      1 ≤ profR δ m
                      theorem TrilinearHT.Auto.gaugeMultA_nonneg {δ : ℝ} (hδ : 0 < δ) (d : ℕ) {Q0 Cm : ℝ} (hQ0 : 0 ≤ Q0) (hCm : 0 ≤ Cm) :
                      0 ≤ gaugeMultA d Q0 Cm δ
                      theorem TrilinearHT.Auto.gaugeMultA_mono {δ : ℝ} (hδ : 0 < δ) (hδ1 : δ ≤ 1) {d d' : ℕ} (hd : 1 ≤ d') (hdd : d ≤ d') {Q0 Q0' Cm Cm' : ℝ} (hQ0 : 0 ≤ Q0) (hQQ : Q0 ≤ Q0') (hQ1 : 1 ≤ Q0') (hCm0 : 0 ≤ Cm) (hCC : Cm ≤ Cm') :
                      gaugeMultA d Q0 Cm δ ≤ gaugeMultA d' Q0' Cm' δ

                      The derivative constant of the multiplier increases with the dimension, Q₀ and C_m.

                      theorem TrilinearHT.Auto.gaugeMultTail_mono {δ : ℝ} (hδ : 0 < δ) (hδ1 : δ ≤ 1) {d d' : ℕ} (hd : 1 ≤ d') (hdd : d ≤ d') {Q0 Q0' Cm Cm' : ℝ} (hQ0 : 0 ≤ Q0) (hQQ : Q0 ≤ Q0') (hQ1 : 1 ≤ Q0') (hCm0 : 0 ≤ Cm) (hCC : Cm ≤ Cm') :
                      gaugeMultTail d Q0 Cm δ ≤ gaugeMultTail d' Q0' Cm' δ
                      theorem TrilinearHT.Auto.gaugeMultNorm_mono {δ : ℝ} (hδ : 0 < δ) (hδ1 : δ ≤ 1) {d d' : ℕ} (hd : 1 ≤ d') (hdd : d ≤ d') {Q0 Q0' Cm Cm' : ℝ} (hQ0 : 0 ≤ Q0) (hQQ : Q0 ≤ Q0') (hQ1 : 1 ≤ Q0') (hCm0 : 0 ≤ Cm) (hCC : Cm ≤ Cm') :
                      gaugeMultNorm d Q0 Cm δ ≤ gaugeMultNorm d' Q0' Cm' δ
                      theorem TrilinearHT.Auto.gaugeTail_mono {δ : ℝ} (hδ : 0 < δ) (hδ1 : δ ≤ 1) {d d' : ℕ} (hdd : d ≤ d') :
                      theorem TrilinearHT.Auto.gaugeSq_truncate_full (d : ℕ) {δ : ℝ} (hδ : 0 < δ) (ρ : Fin d → ℝ) (K : ℕ) :
                      ∃ (c : (Fin d → ℤ) → ℂ), (∀ (s : Finset (Fin d → ℤ)), ∑ v ∈ s, ‖c v‖ ≤ gaugeSqNorm d δ) ∧ ∀ (w : Fin d → ℝ), ‖gaugeSq δ ρ w - ∑ v ∈ frequencyBox d (2 ^ (K + 1)), c v * ↑(Real.fourierChar (∑ i : Fin d, ↑(v i) * w i))‖ ≤ 2 * gaugeTail d δ / 2 ^ K

                      Blueprint lines 1944 and 2055 ("expand (ζ^ρ)² on the ϑ torus with coefficient sum at most D_* and tail D_*^{-300}"): the squared gauge is approximated uniformly within 2 B_ζ/2^K by its Fourier sum over the box |v|_∞ ≤ 2^(K+1), and every finite absolute sum of the coefficients is at most the full Fourier norm gaugeSqNorm.

                      theorem TrilinearHT.Auto.gaugeSqNorm_mono {δ : ℝ} (hδ : 0 < δ) (hδ1 : δ ≤ 1) {d d' : ℕ} (hdd : d ≤ d') :

                      Size of the Fourier constants (blueprint line 1944: log B_* ≤ P^C) #

                      x ≤ exp x for real x, used for crude size bounds.

                      theorem TrilinearHT.Auto.gaugeMultNorm_le_exp {dB : ℕ} {Hed δ E : ℝ} (hE : 1 ≤ E) (hdB : ↑dB ≤ E) (hHed : 2 ≤ Hed) (hHedE : Real.log Hed ≤ E) (hδ : 0 < δ) (hδE : δ⁻¹ ≤ Real.exp E) :
                      gaugeMultNorm dB (Hed ^ (dB * dB)) Hed (δ / 2) ≤ Real.exp (12 * E + (2 * E + 1) * (E ^ 3 + Real.log bumpConst + 514 * E + 523) + 2 * E * (2 * E + 1) + 2)

                      The full Fourier norm bound of the multipliers is at most exp(T_G + 2) with T_G = 12E + (2E + 1)(E³ + κ + 514E + 523) + 2E(2E + 1), κ = log bumpConst, when d_B, log H_ed and log (1/δ) are at most E.

                      theorem TrilinearHT.Auto.gaugeSqNorm_le_exp {dB : ℕ} {δ E : ℝ} (hE : 1 ≤ E) (hdB : ↑dB ≤ E) (hδ : 0 < δ) (hδE : δ⁻¹ ≤ Real.exp E) :
                      gaugeSqNorm dB δ ≤ Real.exp (2 * E + (E + 1) * (Real.log bumpConst + 258 * E + 515) + E * (E + 1) + 2)

                      The full Fourier norm bound of the squared gauge is at most exp(T_S + 2) with T_S = 2E + (E + 1)(κ + 258E + 515) + E(E + 1), κ = log bumpConst, when d_B and log (1/δ) are at most E.

                      The enlarged budget D_* and the common cutoff B_* (blueprint line 1944) #

                      noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.keyHgt {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) (H δc : ℝ) :

                      The height bound of the key differences of the modes of every group (the bound B_σ of exists_mainModeSystem), max(1, B (1 + 4 (2 d_B + 1) max(1, 4B/δ_c))) at the largest curvature bound B = exp(D X_max^D).

                      Equations
                      Instances For
                        noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.hgtStar {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) (H δc : ℝ) :

                        The heights of the rescaled differences of mode differences (blueprint line 1934: D_* covers the rational heights of eq:mode-differences and Q₀): 2 (Q₀ (3 B_σ²)²)² + 1 with Q₀ ≤ H_ed^(d_B²) + 1.

                        Equations
                        Instances For
                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.one_le_keyHgt {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) (H δc : ℝ) :
                          1 ≤ fp.keyHgt D dB H δc
                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.one_le_hgtStar {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) (H δc : ℝ) :
                          1 ≤ fp.hgtStar D dB H δc
                          theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.keyHgt_le_modeStar {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) {H δc N : ℝ} (k : ℝ) (hHed : 2 ≤ fp.Hed) (_hH : 1 ≤ H) (_hδc : 0 < δc) (hN0 : 0 ≤ N) :
                          fp.keyHgt D dB H δc ≤ fp.modeStar D dB H δc N k + 1 ∧ fp.Hed ^ (dB * dB) + 1 ≤ fp.modeStar D dB H δc N k + 1

                          The key heights and the clearing bound are at most modeStar + 1.

                          noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.modeStarG {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) (H δc N k δ : ℝ) :

                          Blueprint line 1944 ("enlarge D_* to cover these full Fourier norms, including (ζ^ρ)²"): the budget modeStar of line 1934 plus the full Fourier norm bounds of the gauge multipliers (enlarged cutoff δ/2, centers of dimension at most d_B, Q₀ ≤ H_ed^(d_B²), entries at most H_ed) and of the squared gauge (ζ^ρ)² (cutoff δ).

                          Equations
                          Instances For
                            theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.gaugeMultNorm_nonneg (d : ℕ) {Q0 Cm δ : ℝ} (hδ : 0 < δ) (hQ0 : 0 ≤ Q0) (hCm : 0 ≤ Cm) :
                            0 ≤ gaugeMultNorm d Q0 Cm δ
                            theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.gaugeMultTail_nonneg (d : ℕ) {Q0 Cm δ : ℝ} (hδ : 0 < δ) (hQ0 : 0 ≤ Q0) (hCm : 0 ≤ Cm) :
                            0 ≤ gaugeMultTail d Q0 Cm δ
                            theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.le_modeStarG {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) {H δc N : ℝ} (k : ℝ) {δ : ℝ} (hδ : 0 < δ) (hHed : 2 ≤ fp.Hed) (hH : 1 ≤ H) (hδc : 0 < δc) (hN0 : 0 ≤ N) :
                            Real.exp k ≤ fp.modeStarG D dB H δc N k δ ∧ fp.modeStar D dB H δc N k ≤ fp.modeStarG D dB H δc N k δ ∧ gaugeMultNorm dB (fp.Hed ^ (dB * dB)) fp.Hed (δ / 2) ≤ fp.modeStarG D dB H δc N k δ ∧ gaugeSqNorm dB δ ≤ fp.modeStarG D dB H δc N k δ ∧ fp.hgtStar D dB H δc ≤ fp.modeStarG D dB H δc N k δ

                            The enlarged budget dominates e^k, the budget of line 1934 and the two full Fourier norm bounds.

                            noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.tailStar {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (dB : ℕ) (δ : ℝ) :

                            The uniform truncation constant of the multipliers and of (ζ^ρ)².

                            Equations
                            Instances For
                              noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.Kstar {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) (H δc N k δ : ℝ) :

                              The cutoff exponent K_* (blueprint line 1944): the least K with 2^K ≥ 2 (T_* + 1) D_*^300, T_* the uniform truncation constant.

                              Equations
                              Instances For
                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.tail_le_Kstar {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) {H δc N : ℝ} (k : ℝ) {δ : ℝ} (hδ : 0 < δ) (hHed : 2 ≤ fp.Hed) (hH : 1 ≤ H) (hδc : 0 < δc) (hN0 : 0 ≤ N) {T : ℝ} (hT0 : 0 ≤ T) (hT : T ≤ fp.tailStar dB δ) :
                                2 * T / 2 ^ fp.Kstar D dB H δc N k δ ≤ (fp.modeStarG D dB H δc N k δ ^ 300)⁻¹

                                Truncation tails below D_*^(-300): every truncation constant T ≤ T_* gives 2 T / 2^(K_*) ≤ D_*^(-300).

                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.log_Bstar_le {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (D dB : ℕ) {H δc N k : ℝ} (hk0 : 0 ≤ k) {δ : ℝ} (hδ : 0 < δ) (hHed : 2 ≤ fp.Hed) (hH : 1 ≤ H) (hδc : 0 < δc) (hN0 : 0 ≤ N) :
                                Real.log (2 ^ (fp.Kstar D dB H δc N k δ + 1)) ≤ 301 * Real.log (fp.modeStarG D dB H δc N k δ) + 3

                                log B_* ≤ 301 log D_* + 3 for B_* = 2^(K_* + 1).

                                theorem TrilinearHT.Auto.fourier_exponents_le {E κb : ℝ} (hE1 : 1 ≤ E) (hκ : 0 ≤ κb) :
                                12 * E + (2 * E + 1) * (E ^ 3 + κb + 514 * E + 523) + 2 * E * (2 * E + 1) + (2 * E + (E + 1) * (κb + 258 * E + 515) + E * (E + 1)) ≤ (5 * κb + 4682) * E ^ 4

                                The polynomial size of the Fourier exponents T_G + T_S ≤ (5κ + 4682) E⁴ for E ≥ 1.

                                theorem TrilinearHT.Auto.log_modeStarG_poly (c D : ℕ) :
                                ∃ (C : ℕ), ∀ {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (dB : ℕ) {H δc N k δ : ℝ}, 1 ≤ k → ↑fp.Lc + 6 ≤ k ^ c → ↑fp.Hmax + 1 ≤ (k * ↑fp.P) ^ c → ↑dB ≤ k ^ c → 2 ≤ fp.Hed → Real.log fp.Hed ≤ k ^ c → 1 ≤ H → Real.log H ≤ k ^ c → 0 < δc → δc⁻¹ ≤ Real.exp (k ^ c) → 0 ≤ N → N ≤ Real.exp (k ^ c) → A.colBudget ≤ Real.exp (k ^ c) → 0 < δ → δ⁻¹ ≤ Real.exp (k ^ c) → Real.log (fp.modeStarG D dB H δc N k δ) ≤ ↑C * (k * ↑fp.P) ^ C ∧ Real.log (2 ^ (fp.Kstar D dB H δc N k δ + 1)) ≤ ↑C * (k * ↑fp.P) ^ C

                                Blueprint line 1944: the enlarged budget and the common cutoff satisfy log D_* ≤ P^C and log B_* ≤ P^C. For fixed degrees c (of the standing bounds) and D (of the first-match expansion) there is a degree C such that, under the standing bounds of log_modeStar_poly and 0 < δ, δ⁻¹ ≤ exp(k^c), 0 < δ_c, both log D_* and log B_*, B_* = 2^(K_*+1), are at most C (k P)^C.

                                Freezing and retention (blueprint line 1967) #

                                theorem TrilinearHT.Auto.sum_privateColumnValue_eq {W : Type u_1} [Fintype W] [DecidableEq W] (φ : W → ℝ → ℂ) (ε : W → ℝ) (S : Finset W) (c : W → ℂ) (y : ℝ) :
                                ∑ Φ ∈ S, c Φ • privateColumnValue φ ε Φ y = augmentedMain (fun (Φ : W) => φ Φ y) ε fun (Φ : W) => if Φ ∈ S then c Φ else 0

                                A finite combination of private columns at one point, as a main augmented value.

                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.ballMaskT_labels_primaries {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)) (mb : bf.MainBudget s) (G : bf.Grp) (j : ℕ) (p : Fin fp.P) (d : bf.Vtx) {U a : ℤ × ℤ} (hUa : deepAnc U = some a) {v : bf.RLab fp.Mc s} (hv : v ∈ (fp.ballMaskT l s mb G j p).labels U) :
                                ↑v ∈ fp.primaries l s G j d a

                                The labels of the inherited ball masks of a role at a cell whose deepest active ancestor is a are primaries of the role at a (blueprint lines 1859, 1888 and 1967: between actual uses the inherited projections are retained).

                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.gBall_cell_rep {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)) (mb : bf.MainBudget s) (G : bf.Grp) (j : ℕ) (d : bf.Vtx) {u : ℤ} {U : ℤ × ℤ} (hU : U ∈ ((bf.mainBase fp.Mc s mb).partition u).cells) (z : ↥(ColumnL2 (bf.RLab fp.Mc s))) :
                                deepAnc U = none ∧ (columnL2Restriction (dyadicGridCell A.G U.1 U.2) ⋯) ((colRelabel (bf.rv fp.Mc s)) ((fp.gBall l s mb G j u) z)) = 0 ∨ ∃ (a : ℤ × ℤ), deepAnc U = some a ∧ ∃ (c : bf.Lab ⊕ Fin fp.Mc → ℂ), (columnL2Restriction (dyadicGridCell A.G U.1 U.2) ⋯) ((colRelabel (bf.rv fp.Mc s)) ((fp.gBall l s mb G j u) z)) = ∑ Φ ∈ fp.primaries l s G j d a, c Φ • mainCol A.G fp.Mc (bf.origCols l) s U Φ

                                Blueprint lines 1859 and 1967: on a cell U of a depth partition of the main tree, the relabeled global ball output of a role vanishes if U has no active ancestor (zero before the attempt); otherwise it is a combination, with constant coefficients on U, of the main columns on U of the primaries of the role at the deepest active ancestor a of U (the retained inherited projections).

                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.basicOut_cell_rep {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)) (mb : bf.MainBudget s) (G : bf.Grp) (j : ℕ) (ls : List (ℕ × Bool)) (d : bf.Vtx) {u : ℤ} {U : ℤ × ℤ} (hU : U ∈ ((bf.mainBase fp.Mc s mb).partition u).cells) :
                                deepAnc U = none ∧ (columnL2Restriction (dyadicGridCell A.G U.1 U.2) ⋯) (fp.basicOut l s mb G j ls u) = 0 ∨ ∃ (a : ℤ × ℤ), deepAnc U = some a ∧ ∃ (c : bf.Lab ⊕ Fin fp.Mc → ℂ), (columnL2Restriction (dyadicGridCell A.G U.1 U.2) ⋯) (fp.basicOut l s mb G j ls u) = ∑ Φ ∈ fp.primaries l s G j d a, c Φ • mainCol A.G fp.Mc (bf.origCols l) s U Φ

                                The same representation for the basic coarse output Z_{l,G,u} (blueprint lines 1859, 1967).

                                theorem TrilinearHT.Auto.columnL2Restriction_coeFn {W : Type u_1} [Fintype W] (s : Set ℝ) (hs : MeasurableSet s) (z : ↥(ColumnL2 W)) :
                                ↑↑((columnL2Restriction s hs) z) =ᵐ[MeasureTheory.volume] s.indicator ↑↑z

                                The restriction of a column vector to a set agrees almost everywhere with the indicator.

                                An actual use of the group G at a cell (blueprint line 1753: "a group has an actual use only at a current central assignment"): the cell is active and carries a present central vertex with successful color data whose group is G.

                                Equations
                                Instances For
                                  noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.retainedV {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (G : bf.Grp) (b : ℤ) (K : ℕ) :

                                  Blueprint line 1967 (retention rule): the v_b-cells retained for the group G in the block [b, b + K): the cells of the attempt tree of depth v_b = b - 2K containing a cell with an actual use of G at a depth of the block.

                                  Equations
                                  • One or more equations did not get rendered due to their size.
                                  Instances For
                                    theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.mem_retainedV {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) {G : bf.Grp} {b : ℤ} {K : ℕ} {J : ℤ × ℤ} :
                                    J ∈ fp.retainedV G b K ↔ J ∈ dyadicFiniteTree A.G A.R A.treeDepth ∧ J.1 = b - 2 * ↑K ∧ ∃ (I : ℤ × ℤ), dyadicGridCell A.G I.1 I.2 ⊆ dyadicGridCell A.G J.1 J.2 ∧ b ≤ I.1 ∧ I.1 < b + ↑K ∧ fp.ActualUse G I
                                    noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.frozenZ {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)) (mb : bf.MainBudget s) (G : bf.Grp) (j : ℕ) (ls : List (ℕ × Bool)) (u : ℤ) :
                                    ↥(ColumnL2 (bf.Lab ⊕ Fin fp.Mc))

                                    Blueprint line 1967 ("freeze Z_{l,G,u_b}, setting it to zero before the attempt"): the frozen basic coarse output of the role at the depth u; zero at depths before the attempt root.

                                    Equations
                                    Instances For
                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.frozenZ_cell_rep {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)) (mb : bf.MainBudget s) (G : bf.Grp) (j : ℕ) (ls : List (ℕ × Bool)) (d : bf.Vtx) {u : ℤ} {U : ℤ × ℤ} (hU : U ∈ ((bf.mainBase fp.Mc s mb).partition u).cells) :
                                      (columnL2Restriction (dyadicGridCell A.G U.1 U.2) ⋯) (fp.frozenZ l s mb G j ls u) = 0 ∨ ∃ (a : ℤ × ℤ), deepAnc U = some a ∧ ∃ (c : bf.Lab ⊕ Fin fp.Mc → ℂ), (columnL2Restriction (dyadicGridCell A.G U.1 U.2) ⋯) (fp.frozenZ l s mb G j ls u) = ∑ Φ ∈ fp.primaries l s G j d a, c Φ • mainCol A.G fp.Mc (bf.origCols l) s U Φ

                                      The frozen output on a cell of the depth partition: zero, or a constant-coefficient combination of the main columns of the primaries at the deepest active ancestor.

                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.firstCell_contains {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)) (G : bf.Grp) (j : ℕ) (d : bf.Vtx) {Φ : bf.Lab ⊕ Fin fp.Mc} {a U I₀ : ℤ × ℤ} (ha : a ∈ A.cells) (hΦ : Φ ∈ fp.primaries l s G j d a) (hUa : dyadicGridCell A.G U.1 U.2 ⊆ dyadicGridCell A.G a.1 a.2) (hI₀ : I₀ ∈ fp.firstCells A.cells l s G j d Φ) {y : ℝ} (hyU : y ∈ dyadicGridCell A.G U.1 U.2) (hyI : y ∈ dyadicGridCell A.G I₀.1 I₀.2) :
                                      dyadicGridCell A.G U.1 U.2 ⊆ dyadicGridCell A.G I₀.1 I₀.2

                                      Blueprint line 1967 ("a mode available at u_b has first match no later than u_b"): a first-match cell of a primary at an active cell a that meets a subcell U of a contains U.

                                      theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.frozen_endpoint {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) {Md : Type} [Fintype Md] (l : Fin 4) (s : List (CatCol bf.Vtx)) (mb : bf.MainBudget s) (G : bf.Grp) (j : ℕ) (ls : List (ℕ × Bool)) (d : bf.Vtx) (L : LiftData (bf.Lab ⊕ Fin fp.Mc) Md) (ψ : Md → ℝ → ℂ) {B : ℝ} (hB0 : 0 ≤ B) (hεP : ∀ (Φ : bf.Lab ⊕ Fin fp.Mc), L.εP Φ = mainWeight fp.Mc (bf.origCols l) Φ) (hsyn : ∀ (y : ℝ) (β : bf.Lab ⊕ Fin fp.Mc → ℂ), (∀ (Φ : bf.Lab ⊕ Fin fp.Mc), β Φ ≠ 0 → ∃ I ∈ fp.firstCells A.cells l s G j d Φ, y ∈ dyadicGridCell A.G I.1 I.2) → (L.at_ y) (augmentedMain (fun (Φ : bf.Lab ⊕ Fin fp.Mc) => mainScalar fp.Mc (bf.origCols l) s Φ y) L.εP β) = ∑ m : Md, (β (L.own m) * L.a m y) • augmentedMode (fun (m : Md) => ψ m y) L.εM m) (hcoef : ∀ (Φ : bf.Lab ⊕ Fin fp.Mc) (y : ℝ), ∑ m : Md with L.own m = Φ, ‖L.a m y‖ ≤ B) (cellOf : Md → ℤ × ℤ) (hFM : ∀ (m : Md), cellOf m ∈ fp.firstCells A.cells l s G j d (L.own m)) (hind : ∀ (m : Md) (y : ℝ), L.a m y = (dyadicGridCell A.G (cellOf m).1 (cellOf m).2).indicator (fun (x : ℝ) => L.a m (dyadicGridLeft A.G (cellOf m).1 (cellOf m).2)) y) {N : ℝ} (hN : ∀ I ∈ A.cells, ↑(mainLabels A.G fp.Mc (bf.origCols l) s I (fp.brank j)).card ≤ N) {u : ℤ} {U : ℤ × ℤ} (hU : U ∈ ((bf.mainBase fp.Mc s mb).partition u).cells) :
                                      ∃ (β : Md → ℂ), (∀ᵐ (y : ℝ), y ∈ dyadicGridCell A.G U.1 U.2 → ↑↑(L.op (fp.frozenZ l s mb G j ls u)) y = ∑ m : Md, β m • augmentedMode (fun (m : Md) => ψ m y) L.εM m) ∧ (∀ (m : Md), β m ≠ 0 → dyadicGridCell A.G U.1 U.2 ⊆ dyadicGridCell A.G (cellOf m).1 (cellOf m).2) ∧ ∑ m : Md, ‖β m‖ ≤ B * (√N * A.colBudget * (‖(columnL2Restriction (dyadicGridCell A.G U.1 U.2) ⋯) (fp.frozenZ l s mb G j ls u)‖ / √(dyadicGridLength A.G U.1)))

                                      Blueprint line 1967 ("the preceding uniform budget applies to these particular endpoint evaluations, and their coefficients are constant on their u_b-cells"): for a lift with the exports of mainAttemptLift (on the family of all active cells), on every cell U of the depth partition at u the lifted frozen output is a combination of augmented modes with coefficients β_m = c_(Φ(m)) a_m constant on U, supported on the modes alive on U ("a mode available at u_b has first match no later than u_b"), and Σ_m |β_m| ≤ B √N colBudget ‖Z‖_U / √|U|, where c are the coefficients of the frozen output on U, B bounds the per-primary coefficient sums and N the main labels at the active cells.

                                      noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.frozenLift {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) {Md : Type} [Fintype Md] (L : LiftData (bf.Lab ⊕ Fin fp.Mc) Md) (l : Fin 4) (s : List (CatCol bf.Vtx)) (mb : bf.MainBudget s) (G : bf.Grp) (j : ℕ) (ls : List (ℕ × Bool)) (b : ℤ) (K : ℕ) :
                                      ↥(ColumnL2 Md)

                                      Blueprint line 1967 ("write ZTilde_(l,G,b) = R_(l,G) Z_(l,G,u_b) on the retained branches"): the frozen lifted output of the block b: the lift of the output frozen at u_b = b - 4K, restricted to the union of the retained v_b-cells.

                                      Equations
                                      • One or more equations did not get rendered due to their size.
                                      Instances For
                                        theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.frozenLift_retained {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) {Md : Type} [Fintype Md] (D dB : ℕ) {H δc N : ℝ} (k : ℝ) (hHed : 2 ≤ fp.Hed) (hH : 1 ≤ H) (hδc : 0 < δc) (hN0 : 0 ≤ N) (l : Fin 4) (s : List (CatCol bf.Vtx)) (mb : bf.MainBudget s) (G : bf.Grp) {j : ℕ} (hj : j ≤ 4) (ls : List (ℕ × Bool)) (d : bf.Vtx) {g : ℤ} (hg : 0 ≤ g) (L : LiftData (bf.Lab ⊕ Fin fp.Mc) Md) (ψ : Md → ℝ → ℂ) (hεP : ∀ (Φ : bf.Lab ⊕ Fin fp.Mc), L.εP Φ = mainWeight fp.Mc (bf.origCols l) Φ) (hsyn : ∀ (y : ℝ) (β : bf.Lab ⊕ Fin fp.Mc → ℂ), (∀ (Φ : bf.Lab ⊕ Fin fp.Mc), β Φ ≠ 0 → ∃ I ∈ fp.firstCells A.cells l s G j d Φ, y ∈ dyadicGridCell A.G I.1 I.2) → (L.at_ y) (augmentedMain (fun (Φ : bf.Lab ⊕ Fin fp.Mc) => mainScalar fp.Mc (bf.origCols l) s Φ y) L.εP β) = ∑ m : Md, (β (L.own m) * L.a m y) • augmentedMode (fun (m : Md) => ψ m y) L.εM m) (hcoef : ∀ (Φ : bf.Lab ⊕ Fin fp.Mc) (y : ℝ), ∑ m : Md with L.own m = Φ, ‖L.a m y‖ ≤ Real.exp (↑D * (1 + Real.log (chartTranslationBudget (H ^ 6)) + Real.log (3 * fp.ballEdgeH dB (fp.ballRadius g (fp.bbase j + fp.P)))) ^ D)) (cellOf : Md → ℤ × ℤ) (hFM : ∀ (m : Md), cellOf m ∈ fp.firstCells A.cells l s G j d (L.own m)) (hind : ∀ (m : Md) (y : ℝ), L.a m y = (dyadicGridCell A.G (cellOf m).1 (cellOf m).2).indicator (fun (x : ℝ) => L.a m (dyadicGridLeft A.G (cellOf m).1 (cellOf m).2)) y) (hN : ∀ I ∈ A.cells, ↑(mainLabels A.G fp.Mc (bf.origCols l) s I (fp.brank j)).card ≤ N) {b : ℤ} {K : ℕ} {J U : ℤ × ℤ} (hJ : J ∈ fp.retainedV G b K) (hU : U ∈ ((bf.mainBase fp.Mc s mb).partition (b - 4 * ↑K)).cells) (hJU : dyadicGridCell A.G J.1 J.2 ⊆ dyadicGridCell A.G U.1 U.2) :
                                        ∃ (β : Md → ℂ), (∀ᵐ (y : ℝ), y ∈ dyadicGridCell A.G J.1 J.2 → ↑↑(fp.frozenLift L l s mb G j ls b K) y = ∑ m : Md, β m • augmentedMode (fun (m : Md) => ψ m y) L.εM m) ∧ (∀ (m : Md), β m ≠ 0 → dyadicGridCell A.G U.1 U.2 ⊆ dyadicGridCell A.G (cellOf m).1 (cellOf m).2) ∧ ∑ m : Md, ‖β m‖ ≤ fp.modeStar D dB H δc N k * (‖(columnL2Restriction (dyadicGridCell A.G U.1 U.2) ⋯) (fp.frozenZ l s mb G j ls (b - 4 * ↑K))‖ / √(dyadicGridLength A.G U.1))

                                        Blueprint line 1967: on a retained v_b-cell J inside a cell U of the depth partition at u_b = b - 4K, the frozen lifted output ZTilde_(l,G,b) = R_(l,G) Z_(l,G,u_b) is a combination of augmented modes with coefficients constant on U and supported on the modes alive on U, of absolute sum at most the budget D_* times the normalized norm of the frozen output on U ("the preceding uniform budget applies to these particular endpoint evaluations, and their coefficients are constant on their u_b-cells"). The lift is any lift with the exports of mainAttemptLift on the family of all active cells, for a role with a nonnegative top score at a level j ≤ 4.

                                        The main-column mode systems (blueprint lines 1971-1975) #

                                        noncomputable def TrilinearHT.Auto.LiftData.reindex {Pr : Type u_1} {Pr' : Type u_2} {Md : Type u_3} {x✝ : Fintype Pr} [Fintype Pr'] {x✝¹ : Fintype Md} {x✝² : DecidableEq Pr} [DecidableEq Pr'] (L : LiftData Pr Md) (e : Pr ≃ Pr') :
                                        LiftData Pr' Md

                                        The lift with its primary labels transported along an equivalence (the mode data, weights and coefficients are unchanged).

                                        Equations
                                        • One or more equations did not get rendered due to their size.
                                        Instances For
                                          structure TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.MainLiftExports {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)) (G : bf.Grp) (j : ℕ) (d : bf.Vtx) (D dB : ℕ) (H : ℝ) (g : ℤ) {Md : Type} [Fintype Md] (L : LiftData (bf.Lab ⊕ Fin fp.Mc) Md) (ψ : Md → ℝ → ℂ) (cellOf : Md → ℤ × ℤ) :

                                          The exports of mainAttemptLift (blueprint lines 1932-1940) for one role l, group G with top score g, ball level j and catalog s, on the family of all active cells: the lift L with the main private weights, its synthesis of main outputs into augmented modes with physical parts ψ, the per-primary coefficient sums at most exp(D X^D), first-match cells cellOf and coefficients constant on them.

                                          Instances For
                                            theorem TrilinearHT.Auto.exists_mainModeSystem (κ : LocalKernelClass) (c₀ : ℕ) :
                                            ∃ (D : ℕ), 1 ≤ D ∧ ∀ (A : ActiveSetup κ c₀) (bf : A.BasicFamilies) (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)), (∀ e ∈ s, ∃ R ∈ residueBox (bf.vtag e.tag).dim 9, ∃ (γ : ℝ), e = templateCol (bf.vtag e.tag) l R γ e.birth e.rank e.tag) → (∀ e ∈ s, bf.occAvail (↑e.tag.2) e.tag.1) → ∀ (d : bf.Vtx) {G : bf.Grp} {j : ℕ} {ρ₀ : Fin fp.K.d0} {z : bf.Vtx} {g : ℤ}, G.2.1 = some (ρ₀, z, g) → 0 ≤ g → 2 ≤ fp.Hed → ∀ {dB : ℕ}, (∀ (w : bf.Vtx), (bf.vtag w).dim ≤ dB) → (∀ (w : bf.Vtx) (a c : Fin (bf.vtag w).dim), ↑(rationalHeight ((bf.vtag w).C a c)) ≤ fp.Hed) → ∀ {δ : ℝ}, 0 < δ → δ < 1 / 4 → ∀ (ρ : Fin (bf.vtag z).dim → ℝ), (∀ (i : Fin (bf.vtag z).dim), ρ i ∈ Set.Icc 0 1) → ∀ {H : ℝ}, A.Hsrc ≤ H → ↑(bf.vtag z).dim ≤ Real.log H → (∀ (i k : Fin (bf.vtag z).dim), ↑(chartRationalHeight ((↑(-slotCoeff l) • (bf.vtag z).C) i k)) ≤ H) → ↑(bf.vtag z).dim * (bumpConst * 8 ^ 32 * (2 / δ)) ≤ H → ∀ {δc : ℝ}, 0 < δc → ∀ {N : ℝ}, 0 ≤ N → (∀ I ∈ A.cells, ↑(mainLabels A.G fp.Mc (bf.origCols l) s I (fp.brank j)).card ≤ N) → δc ^ 2 * N * A.colBudget ^ 2 ≤ 1 → have X := 1 + Real.log (chartTranslationBudget (H ^ 6)) + Real.log (3 * fp.ballEdgeH dB (fp.ballRadius g (fp.bbase j + fp.P))); have B := Real.exp (↑D * X ^ D); ∃ (Ms : ModeSystem A.G (Fintype.card (bf.Lab ⊕ Fin fp.Mc))) (L : LiftData (bf.Lab ⊕ Fin fp.Mc) Ms.Md), fp.MainLiftExports l s G j d D dB H g L Ms.wave Ms.cellOf ∧ (∀ (m : Ms.Md), L.εM m = Ms.L.εM m) ∧ (∀ (m m' : Ms.Md), Ms.L.own m = Ms.L.own m' ↔ L.own m = L.own m') ∧ L.δ = δc ∧ (∀ (y : ℝ), L.s y = ↑(centerCut (bf.vtag z) δ ρ y) ^ 2) ∧ (∀ (y : ℝ), ∑ Φ : bf.Lab ⊕ Fin fp.Mc, ⋯ / ⋯ ≤ δc ^ 2 * N * A.colBudget ^ 2) ∧ Ms.zc = bf.vtag z ∧ Ms.δc = δ ∧ ⋯ = slotCoeff l ∧ ⋯ ∧ ⋯

                                            Blueprint lines 1971-1975 (the frozen-mode data interface) for the lift of mainAttemptLift: the modes of one role and group of the attempt, with their first-match cells, curvatures, rational frequency differences and private indices, form a mode system (ModeSystem, primary labels relabeled by Fin n) whose waves are the physical modes of the lift R_{l,G} and whose private weights are those of R_{l,G}; the lift has the exports of mainAttemptLift on the family of all active cells, the corrections of size δ_c and the gauge (ζ^ρ)². The mode system has the tag z of the group, curvature bound B = exp(D X^D), dimensions at most d_B, inverse private weights at most colBudget² (B² + 1), and at most N B (4 max(1, 4B/δ_c) + 1)^(4 d_B) modes through each point and alive at each cell.