Documentation

LeanPool.TrilinearHilbertTransform.Auto.Sec135RepresentativesComponentSizesFirstTops

Section 13.5: Representatives, component sizes, and first tops #

This file was automatically generated by Claude.

Formalization of blueprint Section 13, "Fixed modes, the linear side, and hereditary representatives" (sec:modes), subsection 5, "Representatives, component sizes, and first tops" (lines 2171-2235) of blueprint/formalization_blueprint.tex.

Representatives, component sizes, and first tops (blueprint lines 2171-2231) #

theorem TrilinearHT.Auto.early_late_good_common {P : Type u_1} [DecidableEq P] (Fs A B G : Finset P) (hA : A ⊆ Fs) (hB : B ⊆ Fs) (hG : G ⊆ Fs) (hBF : 9 * Fs.card ≤ 10 * B.card) (hAB : B.card < 2 * A.card) (hGF : 9 * Fs.card ≤ 10 * G.card) :
(A ∩ B ∩ G).Nonempty

Blueprint lines 2176-2180: with F = π(F_late), the later predecessor labels B carrying nine tenths of F, the earlier ones A more than half of B, and good primaries G nine tenths of F, the three label sets share a primary (more than 7|F|/20 of A ∩ B, minus the bad ones).

theorem TrilinearHT.Auto.early_predecessor_nested {Mode : Type u_1} {P : Type u_2} [DecidableEq P] (π : Mode → P) (Fl El Ee : Finset Mode) (goodP : P → Prop) [DecidablePred goodP] (hEe : Ee ⊆ Fl) (hEl : El ⊆ Fl) (hBF : 9 * (Finset.image π Fl).card ≤ 10 * (Finset.image π El).card) (hAB : (Finset.image π El).card < 2 * (Finset.image π Ee).card) (hGF : 9 * (Finset.image π Fl).card ≤ 10 * (Finset.filter goodP (Finset.image π Fl)).card) (hjoin : ∀ x ∈ Ee, ∀ x' ∈ El, π x = π x' → goodP (π x) → Ee ⊆ El) :
Ee ⊆ El

Blueprint lines 2180-2181: by stabilization, the joined witnesses of a common later nonexceptional height-good primary nest the earlier PRE predecessor inside the later one.

theorem TrilinearHT.Auto.majority_subsets_inter {α : Type u_1} [DecidableEq α] (A B C : Finset α) (hA : A ⊆ C) (hB : B ⊆ C) (hAC : C.card < 2 * A.card) (hBC : C.card < 2 * B.card) :

Blueprint lines 2181-2182: two subsets of C, each with more than half of its elements, intersect.

theorem TrilinearHT.Auto.affine_separation_on_cell {lam γ a r θ x₀ : ℝ} (hx₀ : x₀ ∈ Set.Icc a (a + r)) (hlarge : θ < |2 * lam * x₀ + γ|) (hvar : 2 * |lam| * r ≤ θ / 2) (x : ℝ) :
x ∈ Set.Icc a (a + r) → θ / 2 < |2 * lam * x + γ|

Blueprint eq:representative-separation (lines 2184-2190): if the affine frequency difference 2λx + γ exceeds θ at one point of a cell of length r and 2|λ| r ≤ θ/2, it exceeds θ/2 everywhere on the cell.

theorem TrilinearHT.Auto.component_size_comparison {ι : Type u_1} (s : Finset ι) (a y : ι → ℝ) {c η T V PZ : ℝ} (hc : 0 ≤ c) (ha : ∑ D ∈ s, a D ^ 2 ≤ c * T ^ 2) (hy : ∑ D ∈ s, y D ^ 2 ≤ η) {ε : ℝ} (hT : |T| ≤ PZ + ε + V) (hPZ : 0 ≤ PZ) (hε : 0 ≤ ε) (hV : 0 ≤ V) :
∑ D ∈ s, (a D + y D) ^ 2 ≤ 6 * c * (PZ ^ 2 + ε ^ 2 + V ^ 2) + 2 * η

Blueprint eq:size-comparison (lines 2196-2209): with σ² = Σ_D (‖A_D‖ + y_D)², Σ_D ‖A_D‖² ≤ c ‖T_F - V_F‖², coefficient floors Σ_D y_D² ≤ η, and ‖P_F ZTilde - T_F‖ ≤ ε, one has σ² ≤ 6c (‖P_F ZTilde‖² + ε² + ‖V_F‖²) + 2η.

Hereditary representatives (blueprint lines 2172-2191) #

@[irreducible]
noncomputable def TrilinearHT.Auto.hereditaryRep {ι : Type u_3} {α : Type u_4} (E : ι → Finset α) (lt : ι → ι → Prop) (d : ι → ℕ) (hd : ∀ (c c' : ι), lt c c' → d c < d c') (dflt : α) (c' : ι) :
α

Blueprint lines 2181-2182 ("process pre-cells chronologically: inherit an earlier representative when its predecessor is contained, otherwise pick any mode"): the representative of c' is that of some earlier c with E c ⊆ E c', if there is one, and otherwise a fixed element of E c'.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    theorem TrilinearHT.Auto.hereditaryRep_eq {ι : Type u_1} {α : Type u_2} (E : ι → Finset α) (lt : ι → ι → Prop) (d : ι → ℕ) (hd : ∀ (c c' : ι), lt c c' → d c < d c') (dflt : α) (c' : ι) :
    hereditaryRep E lt d hd dflt c' = if h : ∃ (c : ι), lt c c' ∧ E c ⊆ E c' then hereditaryRep E lt d hd dflt (Classical.choose h) else if hne : (E c').Nonempty then Classical.choose hne else dflt
    theorem TrilinearHT.Auto.hereditaryRep_mem {ι : Type u_1} {α : Type u_2} (E : ι → Finset α) (lt : ι → ι → Prop) (d : ι → ℕ) (hd : ∀ (c c' : ι), lt c c' → d c < d c') (dflt : α) (hne : ∀ (c : ι), (E c).Nonempty) (c : ι) :
    hereditaryRep E lt d hd dflt c ∈ E c

    Representatives lie in their predecessor sets.

    theorem TrilinearHT.Auto.ModeComponents.predecessor_nesting {Mode : Type u_1} {Mode' : Type u_2} {P : Type u_3} [DecidableEq Mode] [DecidableEq Mode'] [DecidableEq P] (C : ModeComponents Mode P) (C' : ModeComponents Mode' P) (f : Mode → Mode') (hπ : ∀ (x : Mode), C'.π (f x) = C.π x) (hE : ∀ (h : ℕ) (x y : Mode), y ∈ C.E h x → f y ∈ C'.E h (f x)) (hF : ∀ (h : ℕ) (x y : Mode), y ∈ C.F h x → f y ∈ C'.F h (f x)) (Δ : ℕ) (goodP : ℕ → P → Prop) [(h : ℕ) → DecidablePred (goodP h)] {h : ℕ} (hstab : ∀ (z z' : Mode'), goodP h (C'.π z) → C'.π z' = C'.π z → z' ∈ C'.F h z → z' ∈ C'.E (h - Δ) z) {m : Mode} {m' : Mode'} (hm' : C'.Good Δ goodP h m') (hlink : f m ∈ C'.F h m') (htype : (C'.labels (C'.E (h - Δ) m')).card < 2 * (C.labels (C.E (h - Δ) m)).card) :
    Finset.image f (C.E (h - Δ) m) ⊆ C'.E (h - Δ) m'

    Blueprint lines 2176-2181 (nesting of predecessors along a link): let f transport an earlier component system C into a later one C' on a descendant pre-cell, preserving primaries, PRE components and CURRENT components. If m is good at h in C, m' is good at h in C', f m lies in the later CURRENT component of m', the later system stabilizes good primaries, and the later predecessor has fewer than twice the primaries of the earlier one (equal first type coordinates), then the earlier PRE predecessor is transported into the later one.

    theorem TrilinearHT.Auto.ModeComponents.card_lt_two_mul_of_log2_eq {a b : ℕ} (ha : 0 < a) (hlog : Nat.log 2 a = Nat.log 2 b) :
    b < 2 * a

    The type coordinates (blueprint line 2174): sizes with equal ⌊log₂ ·⌋ differ by less than a factor two.

    theorem TrilinearHT.Auto.ModeSystem.ancAt_block_subset {Gd : RealDyadicGrid} (S : ModeSchedule) {b b' : ℤ} {J J' : ℤ × ℤ} (hJ : J.1 = b - 2 * ↑S.K) (hbb : b ≤ b') (hsub : dyadicGridCell Gd J'.1 J'.2 ⊆ dyadicGridCell Gd J.1 J.2) :
    dyadicGridCell Gd (ancAt Gd J' (b' - 4 * ↑S.K)).1 (ancAt Gd J' (b' - 4 * ↑S.K)).2 ⊆ dyadicGridCell Gd (ancAt Gd J (b - 4 * ↑S.K)).1 (ancAt Gd J (b - 4 * ↑S.K)).2
    theorem TrilinearHT.Auto.ModeSystem.blockComps_π {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (b : ℤ) (J : ℤ × ℤ) (x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))) :
    (Ms.blockComps S hA b J).π x = Ms.keyOf ↑x

    Separation of representative frequencies (eq:representative-separation, 2184-2192) #

    theorem TrilinearHT.Auto.ModeComponents.ofEdges_F_of_cur {Mode : Type u_1} {P : Type u_2} [Fintype Mode] [DecidableEq Mode] [DecidableEq P] (pre cur : ℕ → Mode → Mode → Prop) (π : Mode → P) (hle : ∀ (h : ℕ) (m m' : Mode), pre h m m' → cur h m m') (hpre : ∀ (h h' : ℕ) (m m' : Mode), h ≤ h' → pre h m m' → pre h' m m') (hcur : ∀ (h h' : ℕ) (m m' : Mode), h ≤ h' → cur h m m' → cur h' m m') {h : ℕ} {m m' : Mode} (hmm' : cur h m m') :
    m' ∈ (ofEdges pre cur π hle hpre hcur).F h m
    theorem TrilinearHT.Auto.ModeSchedule.sep_of_not_gapEdge (S : ModeSchedule) {Mode : Type u_1} {dz : ℕ} (ω : Mode → ℝ → ℝ) (ϑ : Fin dz → ℝ) (a r θr : ℝ) {h : ℕ} {m m' : Mode} (hne : ¬S.gapEdge ω ϑ a r θr h m m') {lam γ : ℝ} (haff : ∀ (x : ℝ), ω m x - ω m' x = 2 * lam * x + γ) (hvar : 2 * |lam| * r ≤ θr / 2) (n : Fin dz → ℤ) (hn : ∀ (i : Fin dz), |↑(n i)| ≤ S.Eh h) (x : ℝ) :
    x ∈ Set.Icc a (a + r) → θr / 2 < |ω m x - ω m' x + (∑ i : Fin dz, ↑(n i) * ϑ i) / Lh h|

    Blueprint line 2192: without a gap edge at height h, every allowed shift leaves the affine frequency difference above θ at some point, hence above θ/2 on the whole cell when its variation over the cell is at most θ/2 (eq:slope-variation).

    theorem TrilinearHT.Auto.ModeSystem.representative_separation {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) {b' : ℤ} {J' : ℤ × ℤ} (hJ' : J'.1 = b' - 2 * ↑S.K) {h : ℕ} {z z' : ↥(Ms.alive (ancAt Gd J' (b' - 4 * ↑S.K)))} (hzF : z ∉ (Ms.blockComps S hA b' J').F h z') (hvar : 2 * |Ms.lamOf ↑z' - Ms.lamOf ↑z| * dyadicGridLength Gd J'.1 ≤ S.Ξ / dyadicGridLength Gd (b' + ↑S.K) / 2) (n : Fin Ms.zc.dim → ℤ) (hn : ∀ (i : Fin Ms.zc.dim), |↑(n i)| ≤ S.Eh h) {rI rI' : ℝ} (hrI : dyadicGridLength Gd (b' + ↑S.K) ≤ rI) (hrI' : dyadicGridLength Gd (b' + ↑S.K) ≤ rI') (x : ℝ) :
    x ∈ Set.Icc (dyadicGridLeft Gd J'.1 J'.2) (dyadicGridLeft Gd J'.1 J'.2 + dyadicGridLength Gd J'.1) → S.Ξ / 2 * max rI⁻¹ rI'⁻¹ < |Ms.slope (↑z') x - Ms.slope (↑z) x + (∑ i : Fin Ms.zc.dim, ↑(n i) * (Ms.zc.θ i / ↑S.Q0)) / ModeSchedule.Lh h|

    Blueprint eq:representative-separation (lines 2184-2192): two modes alive on the pre-cell J' of block b' that lie in different CURRENT components at height h have, for every allowed shift n, frequency difference above Ξ / (2 r_{t_{b'}}) on the whole pre-cell, when the curvature difference obeys eq:slope-variation; on actual cells I, I' of length at least r_{t_{b'}} this is at least (Ξ/2) max(|I|⁻¹, |I'|⁻¹).

    Component sizes (blueprint lines 2193-2209, eq:size-comparison) #

    theorem TrilinearHT.Auto.almost_orthogonal_synthesis_lower {H : Type u_1} [NormedAddCommGroup H] [InnerProductSpace ℂ H] {κ : Type u_2} (s : Finset κ) (v : κ → H) (b ℓ : κ → ℝ) (w : κ → κ → ℝ) {D η : ℝ} (hη : 0 ≤ η) (hD : 0 ≤ D) (hw0 : ∀ (e e' : κ), 0 ≤ w e e') (hws : ∀ (e e' : κ), w e e' = w e' e) (hcross : ∀ e ∈ s, ∀ e' ∈ s, e ≠ e' → ‖inner ℂ (v e) (v e')‖ ≤ η * w e e' * b e * b e') (hmult : ∀ e ∈ s, ∑ e' ∈ s, w e e' ≤ D * ℓ e) (hdiag : ∀ e ∈ s, ℓ e * b e ^ 2 ≤ D ^ 2 * ‖v e‖ ^ 2) :
    (1 - η * D ^ 3) * ∑ e ∈ s, ‖v e‖ ^ 2 ≤ ‖∑ e ∈ s, v e‖ ^ 2

    The lower half of almost_orthogonal_synthesis (blueprint line 2201, "two-sided almost orthogonality"): (1 - η D³) Σ ‖v_e‖² ≤ ‖Σ v_e‖².

    theorem TrilinearHT.Auto.subtotals_almost_orthogonal_lower {H : Type u_1} [NormedAddCommGroup H] [InnerProductSpace ℂ H] {μ : Type u_2} {ι : Type u_3} (s : Finset ι) (E : ι → Finset μ) (Ψ : μ → H) (β : μ → ℂ) {η L ε D : ℝ} (hη : 0 ≤ η) (hL : 0 ≤ L) (hε : 0 < ε) (hD : 0 ≤ D) (hpair : ∀ i ∈ s, ∀ j ∈ s, i ≠ j → ∀ m ∈ E i, ∀ m' ∈ E j, ‖inner ℂ (Ψ m) (Ψ m')‖ ≤ η * L) (hpriv : ∀ i ∈ s, ε * L * ∑ m ∈ E i, ‖β m‖ ^ 2 ≤ ‖∑ m ∈ E i, β m • Ψ m‖ ^ 2) (hnum : ↑s.card ≤ D) (hcard : ∀ i ∈ s, ↑(E i).card ≤ ε * D ^ 2) :
    (1 - η * D ^ 3) * ∑ i ∈ s, ‖∑ m ∈ E i, β m • Ψ m‖ ^ 2 ≤ ‖∑ i ∈ s, ∑ m ∈ E i, β m • Ψ m‖ ^ 2

    The lower half of subtotals_almost_orthogonal: subtotals over disjoint components with small mutual pairings satisfy (1 - η D³) Σ_j ‖T_j‖² ≤ ‖Σ_j T_j‖².

    theorem TrilinearHT.Auto.component_sizes {H : Type u_1} [NormedAddCommGroup H] [InnerProductSpace ℂ H] {μ : Type u_2} {ι : Type u_3} (s : Finset ι) (Dc : ι → Finset μ) (Ψ : μ → H) (α : μ → ℂ) {η L ε D : ℝ} (hη : 0 ≤ η) (hL : 0 ≤ L) (hε : 0 < ε) (hD : 0 ≤ D) (hpair : ∀ i ∈ s, ∀ j ∈ s, i ≠ j → ∀ m ∈ Dc i, ∀ m' ∈ Dc j, ‖inner ℂ (Ψ m) (Ψ m')‖ ≤ η * L) (hpriv : ∀ i ∈ s, ε * L * ∑ m ∈ Dc i, ‖α m‖ ^ 2 ≤ ‖∑ m ∈ Dc i, α m • Ψ m‖ ^ 2) (hnum : ↑s.card ≤ D) (hcard : ∀ i ∈ s, ↑(Dc i).card ≤ ε * D ^ 2) (hηD : η * D ^ 3 ≤ 1 / 2) (y : ι → ℝ) {ηf : ℝ} (hy : ∑ i ∈ s, y i ^ 2 ≤ ηf) {TF VF PZ : H} {εc : ℝ} (hεc : 0 ≤ εc) (hT : TF - VF = ∑ i ∈ s, ∑ m ∈ Dc i, α m • Ψ m) (hclose : ‖PZ - TF‖ ≤ εc) :
    ∑ i ∈ s, (‖∑ m ∈ Dc i, α m • Ψ m‖ + y i) ^ 2 ≤ 12 * (‖PZ‖ ^ 2 + εc ^ 2 + ‖VF‖ ^ 2) + 2 * ηf

    Blueprint eq:size-comparison (lines 2196-2209), first assertion, at one actual cell: the core subtotals A_D = Σ_{m core in D} α_m Ψ_m of the minimal CURRENT components D ⊆ F (pairwise almost orthogonal, η D³ ≤ 1/2) with coefficient floors y_D (Σ y_D² ≤ η_f) satisfy σ_F² = Σ_D (‖A_D‖ + y_D)² ≤ 12 (‖P_F ZTilde‖² + ε² + ‖V_F‖²) + 2 η_f, when the full subtotal is T_F = V_F + Σ_D A_D and ‖P_F ZTilde - T_F‖ ≤ ε.

    theorem TrilinearHT.Auto.side_subtotals_le {H : Type u_1} [NormedAddCommGroup H] [InnerProductSpace ℂ H] {μ : Type u_2} {ι : Type u_3} (s : Finset ι) (Dc : ι → Finset μ) (Ψ : μ → H) (α : μ → ℂ) {η L ε D : ℝ} (hη : 0 ≤ η) (hL : 0 ≤ L) (hε : 0 < ε) (hD : 0 ≤ D) (hpair : ∀ i ∈ s, ∀ j ∈ s, i ≠ j → ∀ m ∈ Dc i, ∀ m' ∈ Dc j, ‖inner ℂ (Ψ m) (Ψ m')‖ ≤ η * L) (hpriv : ∀ i ∈ s, ε * L * ∑ m ∈ Dc i, ‖α m‖ ^ 2 ≤ ‖∑ m ∈ Dc i, α m • Ψ m‖ ^ 2) (hnum : ↑s.card ≤ D) (hcard : ∀ i ∈ s, ↑(Dc i).card ≤ ε * D ^ 2) (hηD : η * D ^ 3 ≤ 1 / 2) :
    ∑ i ∈ s, ‖∑ m ∈ Dc i, α m • Ψ m‖ ^ 2 ≤ 2 * ‖∑ i ∈ s, ∑ m ∈ Dc i, α m • Ψ m‖ ^ 2

    Blueprint eq:size-comparison, second assertion: the side subtotals V_F of distinct CURRENT components of a linear side V = Σ_F V_F satisfy Σ_F ‖V_F‖² ≤ 2 ‖V‖² (η D³ ≤ 1/2).

    First tops and their count (prop:tops, blueprint lines 2211-2231) #

    theorem TrilinearHT.Auto.reps_card_le_tops {α : Type u_1} {ι : Type u_2} (A : Finset α) (tops : Finset ι) (top : α → ι) (htop : ∀ a ∈ A, top a ∈ tops) (hinj : Set.InjOn top ↑A) :
    A.card ≤ tops.card

    Blueprint lines 2227-2229 (eq:top-count, second bound): if every used representative a ∈ A at a point y has a retained first top containing y, distinct representatives having distinct tops, then |A| is at most the number of retained tops containing y.

    theorem TrilinearHT.Auto.tops_count_cut (G : RealDyadicGrid) (S : Finset (ℤ × ℤ)) {ι : Type u_1} (T : Finset ι) (cell : ι → ℤ × ℤ) (hT : ∀ t ∈ T, cell t ∈ S) (root : ℤ × ℤ) (hroot : ∀ c ∈ S, dyadicGridCell G c.1 c.2 ⊆ dyadicGridCell G root.1 root.2) {M ρ : ℝ} (hρ : 0 < ρ) (hρ1 : ρ < 1) (hM : ∑ t ∈ T, dyadicGridLength G (cell t).1 ≤ M * dyadicGridLength G root.1) :
    dyadicRootLength G (dyadicFirstCrossings G S (fun (I : ℤ × ℤ) => ↑{t ∈ T | cell t = I}.card) (M / ρ)) ≤ ρ * dyadicGridLength G root.1 ∧ ∀ (x : ℝ), ↑{t ∈ T | cell t ∈ dyadicRetainedCells G S (fun (I : ℤ × ℤ) => ↑{t ∈ T | cell t = I}.card) (M / ρ) ∧ x ∈ dyadicGridCell G (cell t).1 (cell t).2}.card ≤ M / ρ

    Blueprint lines 2226-2227 ("Markov's inequality and first crossings of their partial top counts"): tops t ∈ T on cells cell t ∈ S with total length Σ_t |cell t| ≤ M |R| are cut at the first crossings of M/ρ, at cost ρ|R|, after which every point lies in at most M/ρ retained tops.

    theorem TrilinearHT.Auto.ModeSystem.alive_curvature_gap {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) {b' : ℤ} {J' : ℤ × ℤ} (hJ' : J'.1 = b' - 2 * ↑S.K) (hΛ : 8 * Ms.Λ ≤ S.Ξ) (z z' : ↥(Ms.alive (ancAt Gd J' (b' - 4 * ↑S.K)))) :
    2 * |Ms.lamOf ↑z' - Ms.lamOf ↑z| * dyadicGridLength Gd J'.1 ≤ S.Ξ / dyadicGridLength Gd (b' + ↑S.K) / 2

    Blueprint line 2192 (eq:slope-variation on the later pre-cell): two modes alive at the decision cell of a pre-cell J' of block b' have curvature difference with 2 |λ' - λ| r_{J'} ≤ Ξ / (2 r_{t_{b'}}) once 8 Λ ≤ Ξ.

    theorem TrilinearHT.Auto.ModeSystem.alive_representative_separation {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) {b' : ℤ} {J' : ℤ × ℤ} (hJ' : J'.1 = b' - 2 * ↑S.K) (hΛ : 8 * Ms.Λ ≤ S.Ξ) {h : ℕ} {z z' : ↥(Ms.alive (ancAt Gd J' (b' - 4 * ↑S.K)))} (hzF : z ∉ (Ms.blockComps S hA b' J').F h z') (n : Fin Ms.zc.dim → ℤ) (hn : ∀ (i : Fin Ms.zc.dim), |↑(n i)| ≤ S.Eh h) {rI rI' : ℝ} (hrI : dyadicGridLength Gd (b' + ↑S.K) ≤ rI) (hrI' : dyadicGridLength Gd (b' + ↑S.K) ≤ rI') (x : ℝ) :
    x ∈ Set.Icc (dyadicGridLeft Gd J'.1 J'.2) (dyadicGridLeft Gd J'.1 J'.2 + dyadicGridLength Gd J'.1) → S.Ξ / 2 * max rI⁻¹ rI'⁻¹ < |Ms.slope (↑z') x - Ms.slope (↑z) x + (∑ i : Fin Ms.zc.dim, ↑(n i) * (Ms.zc.θ i / ↑S.Q0)) / ModeSchedule.Lh h|

    Blueprint eq:representative-separation (lines 2184-2192) for modes alive at a decision cell: two modes in different later CURRENT components are separated by (Ξ/2) max(|I|⁻¹, |I'|⁻¹) on the whole pre-cell, for every allowed shift.

    theorem TrilinearHT.Auto.ModeSystem.cellMode_synthesis_ge {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (J : ℤ × ℤ) (E : Finset Ms.Md) (α : Ms.Md → ℂ) {ε : ℝ} (hε : 0 ≤ ε) (hεw : ∀ (m : Ms.Md), ε ≤ Ms.L.εM m) :
    ε * dyadicGridLength Gd J.1 * ∑ m ∈ E, ‖α m‖ ^ 2 ≤ ‖∑ m ∈ E, α m • Ms.cellMode J m‖ ^ 2

    The private lower bound of a synthesis of cell modes: ε |J| Σ |α|² ≤ ‖Σ α_m Ψ_{J,m}‖².

    def TrilinearHT.Auto.ModeSystem.compGood {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) (K : Finset Ms.Md) :

    The goodness at height h of a component of the block b on the pre-cell J: the goodness of a mode whose minimal PRE component it is.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      theorem TrilinearHT.Auto.hereditaryRep_inherit' {ι : Type u_1} {α : Type u_2} (E : ι → Finset α) (lt : ι → ι → Prop) (d : ι → ℕ) (hd : ∀ (c c' : ι), lt c c' → d c < d c') (dflt : α) [DecidableEq α] (hpath : ∀ (a b c : ι), lt a c → lt b c → (E a ∩ E b).Nonempty → a = b ∨ lt a b ∨ lt b a) (hnest : ∀ (c c' : ι), lt c c' → (E c ∩ E c').Nonempty → E c ⊆ E c') (hmaj : ∀ (c c' : ι), lt c c' → E c ⊆ E c' → (E c').card < 2 * (E c).card) (c c' : ι) :
      lt c c' → E c ⊆ E c' → hereditaryRep E lt d hd dflt c' = hereditaryRep E lt d hd dflt c

      hereditaryRep_inherit when only earlier cells with meeting predecessors need to be comparable (several components per pre-cell, blueprint lines 2181-2183: "two earlier predecessors contained in the current one ... intersect and, lying on one path, are linked").

      theorem TrilinearHT.Auto.hereditaryRep_disjoint' {ι : Type u_1} {α : Type u_2} (E : ι → Finset α) (lt : ι → ι → Prop) (d : ι → ℕ) (hd : ∀ (c c' : ι), lt c c' → d c < d c') (dflt : α) [DecidableEq α] (hpath : ∀ (a b c : ι), lt a c → lt b c → (E a ∩ E b).Nonempty → a = b ∨ lt a b ∨ lt b a) (hnest : ∀ (c c' : ι), lt c c' → (E c ∩ E c').Nonempty → E c ⊆ E c') (hmaj : ∀ (c c' : ι), lt c c' → E c ⊆ E c' → (E c').card < 2 * (E c).card) {c c' : ι} (hcc' : lt c c') (hne : hereditaryRep E lt d hd dflt c ≠ hereditaryRep E lt d hd dflt c') :
      Disjoint (E c) (E c')

      Stabilization of the frozen mode graphs at the schedule (blueprint lines 2179-2181) #

      theorem TrilinearHT.Auto.ModeSystem.blockComps_stab {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) {Cj CA CT CK : ℕ} {δs W : ℝ} (hV : S.Valid Cj CA CT CK δs W) (hCA : 5 ≤ CA) (hCT : 4 ≤ CT) (hd2 : 2 ≤ S.dmax) (hD : 2 ≤ S.Dstar) (hB : 2 ≤ S.Bstar) (hQ : 1 ≤ S.Q0) (hA : 6 ≤ S.A0) (hdim : ∀ (p : Ms.Key), Ms.dvOf p + Ms.zc.dim ≤ S.dmax) (hBσ : 2 * (↑S.Q0 * (3 * (Ms.Bσ * Ms.Bσ) ^ 2)) ^ 2 ≤ ↑⌊S.Dstar⌋₊) {b : ℤ} {J : ℤ × ℤ} (hJ : J.1 = b - 2 * ↑S.K) (hcard : ↑(Ms.alive (ancAt Gd J (b - 4 * ↑S.K))).card ≤ S.Dstar) {h : ℕ} (hJh : h ≤ S.Jstar) (z z' : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))) (hg : Ms.goodP S (S.sideParams δs) b h ((Ms.blockComps S hA b J).π z)) (hπ : (Ms.blockComps S hA b J).π z' = (Ms.blockComps S hA b J).π z) (hF : z' ∈ (Ms.blockComps S hA b J).F h z) :
      z' ∈ (Ms.blockComps S hA b J).E (h - 10) z

      Blueprint lem:stabilize (lines 2002-2028) for the frozen mode graphs at the chosen schedule, as used at lines 2179-2181 ("stabilization joins its two witnessing modes in later PRE"): on a pre-cell J of depth v_b = b - 2K, two alive modes of one key that is good at a height h ≤ J_* (goodP with the side parameters of the schedule) and lie in one CURRENT component at h are PRE-joined at h - Δ, Δ = 10. The alive modes number at most D_*, the dimensions are at most d_max, and D_* covers the heights of the mode differences (2 (Q₀ (3 B_σ²)²)² ≤ ⌊D_*⌋, line 1934).

      noncomputable def TrilinearHT.Auto.ModeSystem.predOfMode {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (Δ h : ℕ) (c : ℤ × (ℤ × ℤ) × Ms.Md) :

      The PRE predecessor at h - Δ of the component of the mode c.2.2 at the node (c.1, c.2.1) (the singleton of the mode if it is not alive there).

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        def TrilinearHT.Auto.ModeSystem.nodeLt3 {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (Nd : Finset (ℤ × (ℤ × ℤ) × Ms.Md)) (c c' : ℤ × (ℤ × ℤ) × Ms.Md) :

        Comparability of mode nodes: a later block on a descendant pre-cell.

        Equations
        Instances For
          theorem TrilinearHT.Auto.ModeSystem.predOfMode_eq {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (Δ h : ℕ) {c : ℤ × (ℤ × ℤ) × Ms.Md} (hm : c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) :
          Ms.predOfMode S hA Δ h c = Finset.map { toFun := Subtype.val, inj' := ⋯ } ((Ms.blockComps S hA c.1 c.2.1).E (h - Δ) ⟨c.2.2, hm⟩)
          theorem TrilinearHT.Auto.ModeSystem.attempt_representatives3 {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (Nd : Finset (ℤ × (ℤ × ℤ) × Ms.Md)) (hNd : ∀ c ∈ Nd, c.2.1.1 = c.1 - 2 * ↑S.K) {Bmin : ℤ} (hBmin : ∀ c ∈ Nd, Bmin ≤ c.1) (Δ h : ℕ) (halive : ∀ c ∈ Nd, c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) (hgood : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd), (Ms.blockComps S hA c.1 c.2.1).Good Δ (Ms.goodP S SP c.1) h ⟨c.2.2, ⋯⟩) (hstab : ∀ c ∈ Nd, ∀ (z z' : ↥(Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K)))), Ms.goodP S SP c.1 h ((Ms.blockComps S hA c.1 c.2.1).π z) → (Ms.blockComps S hA c.1 c.2.1).π z' = (Ms.blockComps S hA c.1 c.2.1).π z → z' ∈ (Ms.blockComps S hA c.1 c.2.1).F h z → z' ∈ (Ms.blockComps S hA c.1 c.2.1).E (h - Δ) z) (hdist : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd) (c' : ℤ × (ℤ × ℤ) × Ms.Md) (hc' : c' ∈ Nd) (h1 : c.1 = c'.1) (h2 : c.2.1 = c'.2.1), c ≠ c' → ⟨c'.2.2, ⋯⟩ ∉ (Ms.blockComps S hA c.1 c.2.1).F h ⟨c.2.2, ⋯⟩) {k1 k2 : ℕ} (htype1 : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd), Nat.log 2 ((Ms.blockComps S hA c.1 c.2.1).labels ((Ms.blockComps S hA c.1 c.2.1).E (h - Δ) ⟨c.2.2, ⋯⟩)).card = k1) (htype2 : ∀ c ∈ Nd, Nat.log 2 (Ms.predOfMode S hA Δ h c).card = k2) (dflt : Ms.Md) :
          ∃ (rep : ℤ × (ℤ × ℤ) × Ms.Md → Ms.Md), (∀ (c : ℤ × (ℤ × ℤ) × Ms.Md), rep c ∈ Ms.predOfMode S hA Δ h c) ∧ (∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nd c c' → Ms.predOfMode S hA Δ h c ⊆ Ms.predOfMode S hA Δ h c' → rep c' = rep c) ∧ (∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nd c c' → rep c ≠ rep c' → Disjoint (Ms.predOfMode S hA Δ h c) (Ms.predOfMode S hA Δ h c')) ∧ ∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nd c c' → rep c ≠ rep c' → ∀ (z z' : ↥(Ms.alive (ancAt Gd c'.2.1 (c'.1 - 4 * ↑S.K)))), ↑z ∈ Ms.predOfMode S hA Δ h c → ↑z' ∈ Ms.predOfMode S hA Δ h c' → z ∉ (Ms.blockComps S hA c'.1 c'.2.1).F h z'

          Blueprint lines 2172-2191 (THT.Modes.hereditaryRepresentatives) for all successful components at once: the nodes are triples (b, J, m) with one good mode m per CURRENT component at each pre-cell. The chronological representatives lie in their predecessors, are inherited under predecessor inclusion, and different representatives on comparable nodes have disjoint predecessors in different later CURRENT components.

          noncomputable def TrilinearHT.Auto.ModeSystem.nodeType1 {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (Δ h : ℕ) (c : ℤ × (ℤ × ℤ) × Ms.Md) :

          The first role type of a mode node: the dyadic size class of the number of primaries of its PRE predecessor (blueprint line 2708, "fix ... all role types").

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            noncomputable def TrilinearHT.Auto.ModeSystem.nodeType2 {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (Δ h : ℕ) (c : ℤ × (ℤ × ℤ) × Ms.Md) :

            The second role type of a mode node: the dyadic size class of its predecessor.

            Equations
            Instances For
              theorem TrilinearHT.Auto.ModeSystem.typed_representatives {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (Nd : Finset (ℤ × (ℤ × ℤ) × Ms.Md)) (hNd : ∀ c ∈ Nd, c.2.1.1 = c.1 - 2 * ↑S.K) {Bmin : ℤ} (hBmin : ∀ c ∈ Nd, Bmin ≤ c.1) (Δ h : ℕ) (halive : ∀ c ∈ Nd, c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) (hgood : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd), (Ms.blockComps S hA c.1 c.2.1).Good Δ (Ms.goodP S SP c.1) h ⟨c.2.2, ⋯⟩) (hstab : ∀ c ∈ Nd, ∀ (z z' : ↥(Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K)))), Ms.goodP S SP c.1 h ((Ms.blockComps S hA c.1 c.2.1).π z) → (Ms.blockComps S hA c.1 c.2.1).π z' = (Ms.blockComps S hA c.1 c.2.1).π z → z' ∈ (Ms.blockComps S hA c.1 c.2.1).F h z → z' ∈ (Ms.blockComps S hA c.1 c.2.1).E (h - Δ) z) (hdist : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd) (c' : ℤ × (ℤ × ℤ) × Ms.Md) (hc' : c' ∈ Nd) (h1 : c.1 = c'.1) (h2 : c.2.1 = c'.2.1), c ≠ c' → ⟨c'.2.2, ⋯⟩ ∉ (Ms.blockComps S hA c.1 c.2.1).F h ⟨c.2.2, ⋯⟩) (dflt : Ms.Md) :
              ∃ (rep : ℕ → ℕ → ℤ × (ℤ × ℤ) × Ms.Md → Ms.Md), ∀ (k₁ k₂ : ℕ), have Nk := {c ∈ Nd | Ms.nodeType1 S hA Δ h c = k₁ ∧ Ms.nodeType2 S hA Δ h c = k₂}; (∀ (c : ℤ × (ℤ × ℤ) × Ms.Md), rep k₁ k₂ c ∈ Ms.predOfMode S hA Δ h c) ∧ (∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nk c c' → Ms.predOfMode S hA Δ h c ⊆ Ms.predOfMode S hA Δ h c' → rep k₁ k₂ c' = rep k₁ k₂ c) ∧ (∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nk c c' → rep k₁ k₂ c ≠ rep k₁ k₂ c' → Disjoint (Ms.predOfMode S hA Δ h c) (Ms.predOfMode S hA Δ h c')) ∧ ∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nk c c' → rep k₁ k₂ c ≠ rep k₁ k₂ c' → ∀ (z z' : ↥(Ms.alive (ancAt Gd c'.2.1 (c'.1 - 4 * ↑S.K)))), ↑z ∈ Ms.predOfMode S hA Δ h c → ↑z' ∈ Ms.predOfMode S hA Δ h c' → z ∉ (Ms.blockComps S hA c'.1 c'.2.1).F h z'

              Blueprint lines 2172-2191 with the role types fixed (attempt_representatives3 on each type class of nodes): there are representatives rep k₁ k₂ for every type class, in the predecessors of the nodes, inherited and separated along comparable nodes of the class.

              theorem TrilinearHT.Auto.ModeSystem.typed_representatives_sched {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) {Cj CA CT CK : ℕ} {δs W : ℝ} (hV : S.Valid Cj CA CT CK δs W) (hCA : 5 ≤ CA) (hCT : 4 ≤ CT) (hd2 : 2 ≤ S.dmax) (hD : 2 ≤ S.Dstar) (hB : 2 ≤ S.Bstar) (hQ : 1 ≤ S.Q0) (hdim : ∀ (p : Ms.Key), Ms.dvOf p + Ms.zc.dim ≤ S.dmax) (hBσ : 2 * (↑S.Q0 * (3 * (Ms.Bσ * Ms.Bσ) ^ 2)) ^ 2 ≤ ↑⌊S.Dstar⌋₊) (Nd : Finset (ℤ × (ℤ × ℤ) × Ms.Md)) (hNd : ∀ c ∈ Nd, c.2.1.1 = c.1 - 2 * ↑S.K) {Bmin : ℤ} (hBmin : ∀ c ∈ Nd, Bmin ≤ c.1) (hcard : ∀ c ∈ Nd, ↑(Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))).card ≤ S.Dstar) {h : ℕ} (hJh : h ≤ S.Jstar) (halive : ∀ c ∈ Nd, c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) (hgood : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd), (Ms.blockComps S hA c.1 c.2.1).Good 10 (Ms.goodP S (S.sideParams δs) c.1) h ⟨c.2.2, ⋯⟩) (hdist : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd) (c' : ℤ × (ℤ × ℤ) × Ms.Md) (hc' : c' ∈ Nd) (h1 : c.1 = c'.1) (h2 : c.2.1 = c'.2.1), c ≠ c' → ⟨c'.2.2, ⋯⟩ ∉ (Ms.blockComps S hA c.1 c.2.1).F h ⟨c.2.2, ⋯⟩) (dflt : Ms.Md) :
              ∃ (rep : ℕ → ℕ → ℤ × (ℤ × ℤ) × Ms.Md → Ms.Md), ∀ (k₁ k₂ : ℕ), have Nk := {c ∈ Nd | Ms.nodeType1 S hA 10 h c = k₁ ∧ Ms.nodeType2 S hA 10 h c = k₂}; (∀ (c : ℤ × (ℤ × ℤ) × Ms.Md), rep k₁ k₂ c ∈ Ms.predOfMode S hA 10 h c) ∧ (∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nk c c' → Ms.predOfMode S hA 10 h c ⊆ Ms.predOfMode S hA 10 h c' → rep k₁ k₂ c' = rep k₁ k₂ c) ∧ (∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nk c c' → rep k₁ k₂ c ≠ rep k₁ k₂ c' → Disjoint (Ms.predOfMode S hA 10 h c) (Ms.predOfMode S hA 10 h c')) ∧ ∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nk c c' → rep k₁ k₂ c ≠ rep k₁ k₂ c' → ∀ (z z' : ↥(Ms.alive (ancAt Gd c'.2.1 (c'.1 - 4 * ↑S.K)))), ↑z ∈ Ms.predOfMode S hA 10 h c → ↑z' ∈ Ms.predOfMode S hA 10 h c' → z ∉ (Ms.blockComps S hA c'.1 c'.2.1).F h z'

              Blueprint lines 2172-2185 (THT.Modes.hereditaryRepresentatives) at the chosen schedule: with the side parameters of the schedule (Δ = 10) at a height h ≤ J_* (the upper end of H_up, line 2041), the stabilization step ("stabilization joins its two witnessing modes in later PRE") is lem:stabilize for the frozen mode graphs (blockComps_stab). Hence, for fixed height and types, representatives in the PRE predecessors exist, are inherited under predecessor inclusion along comparable nodes, and different representatives on comparable nodes have disjoint predecessors with no shared or CURRENT-adjacent modes in the later graph. The alive modes at each decision cell number at most D_* and D_* covers the heights of the mode differences (the choices of D_*, lines 1932-1934).

              theorem TrilinearHT.Auto.ModeSystem.mem_alive_of_mem_predOfMode {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (Δ h : ℕ) {c : ℤ × (ℤ × ℤ) × Ms.Md} (hm : c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) {y : Ms.Md} (hy : y ∈ Ms.predOfMode S hA Δ h c) :
              y ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))

              Elements of the predecessor of a mode node are alive at its decision cell.

              theorem TrilinearHT.Auto.ModeSystem.role_label_separation3 {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (Nd : Finset (ℤ × (ℤ × ℤ) × Ms.Md)) (hNd : ∀ c ∈ Nd, c.2.1.1 = c.1 - 2 * ↑S.K) (Δ h : ℕ) (halive : ∀ c ∈ Nd, c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) (hdist : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd) (c' : ℤ × (ℤ × ℤ) × Ms.Md) (hc' : c' ∈ Nd) (h1 : c.1 = c'.1) (h2 : c.2.1 = c'.2.1), c ≠ c' → ⟨c'.2.2, ⋯⟩ ∉ (Ms.blockComps S hA c.1 c.2.1).F h ⟨c.2.2, ⋯⟩) (rep : ℤ × (ℤ × ℤ) × Ms.Md → Ms.Md) (hrep : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md), rep c ∈ Ms.predOfMode S hA Δ h c) (hsepF : ∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nd c c' → rep c ≠ rep c' → ∀ (z z' : ↥(Ms.alive (ancAt Gd c'.2.1 (c'.1 - 4 * ↑S.K)))), ↑z ∈ Ms.predOfMode S hA Δ h c → ↑z' ∈ Ms.predOfMode S hA Δ h c' → z ∉ (Ms.blockComps S hA c'.1 c'.2.1).F h z') (hΛ : 8 * Ms.Λ ≤ S.Ξ) {xs : ℝ} (hxs : ∀ c ∈ Nd, xs ∈ dyadicGridCell Gd c.2.1.1 c.2.1.2) {c c' : ℤ × (ℤ × ℤ) × Ms.Md} (hc : c ∈ Nd) (hc' : c' ∈ Nd) (hne : rep c ≠ rep c') (n : Fin Ms.zc.dim → ℤ) (hn : ∀ (i : Fin Ms.zc.dim), |↑(n i)| ≤ S.Eh h) {rI rI' : ℝ} (hrI : dyadicGridLength Gd (max c.1 c'.1 + ↑S.K) ≤ rI) (hrI' : dyadicGridLength Gd (max c.1 c'.1 + ↑S.K) ≤ rI') :
              S.Ξ / 2 * max rI⁻¹ rI'⁻¹ < |Ms.slope (rep c) xs - Ms.slope (rep c') xs + (∑ i : Fin Ms.zc.dim, ↑(n i) * (Ms.zc.θ i / ↑S.Q0)) / ModeSchedule.Lh h|

              Blueprint eq:representative-separation at a path point for the representatives of attempt_representatives3: different representatives on mode nodes whose pre-cells contain x* have labels ω_a(x*) separated by (Ξ/2) max(r_I⁻¹, r_{I'}⁻¹) against every shift n·θ/(Q₀ L_h), |n| ≤ E_h.

              Component sizes at an actual cell (blueprint lines 2196-2209, eq:size-comparison) #

              theorem TrilinearHT.Auto.pairConst_half_le (d : ℕ) {δ Ξ : ℝ} (hδ : 0 < δ) (hΞ : 0 < Ξ) (Kf : ℕ) :
              pairConst d δ (Ξ / 2) Kf ≤ 2 * pairConst d δ Ξ Kf

              Halving the threshold at most doubles the pairing constant.

              theorem TrilinearHT.Auto.ModeSchedule.pairConst_half_mul_le (S : ModeSchedule) (hD : 2 ≤ S.Dstar) {d : ℕ} {δ : ℝ} (hδ : 0 < δ) {Kf : ℕ} (hDg : gaugeSqNorm d δ ≤ S.Dstar) (hKf : 2 * gaugeTail d δ / 2 ^ Kf * S.Dstar ^ 300 ≤ 1) :
              pairConst d δ (S.Ξ / 2) Kf * S.Dstar ^ 200 ≤ 2

              Blueprint line 2055 at threshold Ξ/2: the pairing constant is at most 2 D_*^{-200}.

              theorem TrilinearHT.Auto.ModeSystem.cellMode_inner_le_of_sep {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) {Ξ' : ℝ} (hδ : 0 < Ms.δc) (hΛ : 8 * Ms.Λ ≤ Ξ') (hΞ : 0 < Ξ') (hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) {J : ℤ × ℤ} {m m' : Ms.Md} (hm : dyadicGridCell Gd J.1 J.2 ⊆ dyadicGridCell Gd (Ms.cellOf m).1 (Ms.cellOf m).2) (hm' : dyadicGridCell Gd J.1 J.2 ⊆ dyadicGridCell Gd (Ms.cellOf m').1 (Ms.cellOf m').2) (hne : m ≠ m') (hsep : ∀ (n : Fin Ms.zc.dim → ℤ), (∀ (i : Fin Ms.zc.dim), |↑(n i)| ≤ S.Eh 0) → ∃ x ∈ Set.Icc (dyadicGridLeft Gd J.1 J.2) (dyadicGridLeft Gd J.1 J.2 + dyadicGridLength Gd J.1), Ξ' / dyadicGridLength Gd J.1 ≤ |Ms.slope m x - Ms.slope m' x + ∑ i : Fin Ms.zc.dim, ↑(n i) * (Ms.zc.θ i / ↑S.Q0)|) :
              ‖inner ℂ (Ms.cellMode J m) (Ms.cellMode J m')‖ ≤ pairConst Ms.zc.dim Ms.δc Ξ' Kf * dyadicGridLength Gd J.1

              cellMode_inner_le with the height-zero separation given directly at threshold Ξ'/|J| on the cell (the form of lem:mode-rows on the smaller cell).

              theorem TrilinearHT.Auto.ModeSystem.cellMode_restrict {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) {I J : ℤ × ℤ} (hIJ : dyadicGridCell Gd I.1 I.2 ⊆ dyadicGridCell Gd J.1 J.2) (m : Ms.Md) :
              (columnL2Restriction (dyadicGridCell Gd I.1 I.2) ⋯) (Ms.cellMode J m) = Ms.cellMode I m

              A cell mode restricts on a subcell to the cell mode of the subcell.

              theorem TrilinearHT.Auto.ModeSystem.actualCell_inner_le {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) {b : ℤ} {J I : ℤ × ℤ} (hJ : J.1 = b - 2 * ↑S.K) (hIJ : dyadicGridCell Gd I.1 I.2 ⊆ dyadicGridCell Gd J.1 J.2) (hIt : I.1 ≤ b + ↑S.K) (hδ : 0 < Ms.δc) (hΛ : 16 * Ms.Λ ≤ S.Ξ) (hΞ : 0 < S.Ξ) (hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) {z z' : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))} (hzF : z ∉ (Ms.blockComps S hA b J).F 0 z') :
              ‖inner ℂ (Ms.cellMode I ↑z') (Ms.cellMode I ↑z)‖ ≤ pairConst Ms.zc.dim Ms.δc (S.Ξ / 2) Kf * dyadicGridLength Gd I.1

              Blueprint lines 2202-2203 ("two-sided almost orthogonality for arbitrary subtotals in distinct minimal CURRENT components"), one pair: two modes alive at the decision cell of the pre-cell J of the block b that lie in different minimal CURRENT components pair on an actual cell I ⊆ J of length at least r_{t_b} by at most η |I|, with η the pairing constant at threshold Ξ/2 (eq:slope-variation halves the CURRENT threshold on the whole pre-cell).

              noncomputable def TrilinearHT.Auto.ModeSystem.compModes {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) (x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))) :

              The modes of the CURRENT component F_h(x) of the block b on the pre-cell J.

              Equations
              Instances For
                noncomputable def TrilinearHT.Auto.ModeSystem.minComps {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) (x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))) :

                The minimal (height zero) CURRENT components inside F_h(x), as mode sets.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For
                  theorem TrilinearHT.Auto.ModeSystem.mem_compModes {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) {b : ℤ} {J : ℤ × ℤ} {h : ℕ} {x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))} {m : Ms.Md} :
                  m ∈ Ms.compModes S hA b J h x ↔ ∃ y ∈ (Ms.blockComps S hA b J).F h x, ↑y = m
                  theorem TrilinearHT.Auto.ModeSystem.compModes_subset_alive {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) (x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))) :
                  Ms.compModes S hA b J h x ⊆ Ms.alive (ancAt Gd J (b - 4 * ↑S.K))
                  theorem TrilinearHT.Auto.ModeSystem.comp_eq_or_disjoint {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) (y y' : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))) :
                  Finset.map { toFun := Subtype.val, inj' := ⋯ } ((Ms.blockComps S hA b J).F h y) = Finset.map { toFun := Subtype.val, inj' := ⋯ } ((Ms.blockComps S hA b J).F h y') ∨ Disjoint (Finset.map { toFun := Subtype.val, inj' := ⋯ } ((Ms.blockComps S hA b J).F h y)) (Finset.map { toFun := Subtype.val, inj' := ⋯ } ((Ms.blockComps S hA b J).F h y'))

                  Two CURRENT components at one height are equal or disjoint.

                  theorem TrilinearHT.Auto.ModeSystem.not_mem_F_of_ne {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) {y y' a a' : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))} (hne : Finset.map { toFun := Subtype.val, inj' := ⋯ } ((Ms.blockComps S hA b J).F h y) ≠ Finset.map { toFun := Subtype.val, inj' := ⋯ } ((Ms.blockComps S hA b J).F h y')) (ha : a ∈ (Ms.blockComps S hA b J).F h y) (ha' : a' ∈ (Ms.blockComps S hA b J).F h y') :
                  a' ∉ (Ms.blockComps S hA b J).F h a

                  Modes of different CURRENT components at a height are not CURRENT-joined there.

                  theorem TrilinearHT.Auto.ModeSystem.mem_minComps {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) {b : ℤ} {J : ℤ × ℤ} {h : ℕ} {x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))} {D : Finset Ms.Md} :
                  D ∈ Ms.minComps S hA b J h x ↔ ∃ y ∈ (Ms.blockComps S hA b J).F h x, Finset.map { toFun := Subtype.val, inj' := ⋯ } ((Ms.blockComps S hA b J).F 0 y) = D
                  theorem TrilinearHT.Auto.ModeSystem.biUnion_minComps {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) (x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))) :
                  (Ms.minComps S hA b J h x).biUnion id = Ms.compModes S hA b J h x

                  The minimal CURRENT components inside F_h(x) cover its modes.

                  theorem TrilinearHT.Auto.ModeSystem.card_minComps_le {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) (x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))) :
                  (Ms.minComps S hA b J h x).card ≤ (Ms.alive (ancAt Gd J (b - 4 * ↑S.K))).card
                  theorem TrilinearHT.Auto.ModeSystem.minComps_subset_alive {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) {b : ℤ} {J : ℤ × ℤ} {h : ℕ} {x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))} {D : Finset Ms.Md} (hD : D ∈ Ms.minComps S hA b J h x) :
                  D ⊆ Ms.alive (ancAt Gd J (b - 4 * ↑S.K))
                  theorem TrilinearHT.Auto.sum_filter_disjoint_family {μ : Type u_1} {M : Type u_2} [DecidableEq μ] [AddCommMonoid M] (s : Finset (Finset μ)) (hdis : ∀ D ∈ s, ∀ D' ∈ s, D ≠ D' → Disjoint D D') (p : μ → Prop) [DecidablePred p] (f : μ → M) :
                  ∑ D ∈ s, ∑ m ∈ D with p m, f m = ∑ m ∈ s.biUnion id with p m, f m

                  Sums over the filtered members of pairwise disjoint finite sets are sums over the filtered union.

                  theorem TrilinearHT.Auto.eta_sched_bounds {η Dst Bc : ℝ} (hD : 2 ≤ Dst) (hη0 : 0 ≤ η) (hη200 : η * Dst ^ 200 ≤ 2) (hBc : 0 ≤ Bc) :
                  η * Dst ^ 3 ≤ 1 / 2 ∧ 12 * (η ^ 2 * Dst ^ 3 * Bc) ≤ Bc / Dst ^ 59

                  The numerical side conditions at the schedule: from η D_*^{200} ≤ 2, η D_*³ ≤ 1/2 and 12 η² D_*³ B ≤ B D_*^{-59}.

                  theorem TrilinearHT.Auto.sq_div_sqrt_add_mul (a q : ℝ) {r : ℝ} (hr : 0 < r) :
                  (a / √r + q) ^ 2 * r = (a + q * √r) ^ 2

                  (a/√r + q)² r = (a + q √r)².

                  theorem TrilinearHT.Auto.size_final_arith {σ P2 V2 e2 r Bc D : ℝ} (hr : 0 < r) (hcs : σ * r ≤ 12 * (P2 + e2 + V2) + 2 * (Bc * r / D)) (he : 12 * e2 ≤ Bc / D * r) :
                  σ ≤ 12 * ((P2 + V2) / r) + 3 * Bc / D

                  The normalization step of size_comparison.

                  def TrilinearHT.Auto.ModeSystem.IsCoreAt {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (b : ℤ) (J : ℤ × ℤ) (m : Ms.Md) :

                  A core mode of the block b on the pre-cell J: alive at the decision cell and with at most δ_* (J_* + 1) bad heights (line 2037).

                  Equations
                  Instances For
                    noncomputable def TrilinearHT.Auto.ModeSystem.compSizeSq {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (I : ℤ × ℤ) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) (x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))) (c : Ms.Md → ℂ) :

                    Blueprint eq:component-size (lines 2196-2201) on the actual cell I: σ_F² = Σ_{D ⊆ F} (‖A_D‖_{2,I} + D_*^{-30} Σ_{m core in D} |α_m|)² over the minimal CURRENT components D of F = F_h(x), with the full core subtotals A_D = Σ_{m core in D} α_m Ψ_{I,m} and the normalized norm ‖f‖_{2,I} = |I|^{-1/2} ‖1_I f‖₂.

                    Equations
                    • One or more equations did not get rendered due to their size.
                    Instances For
                      theorem TrilinearHT.Auto.ModeSystem.sixteen_Λ_le {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hD : 2 ≤ S.Dstar) (hΛ : Ms.Λ ≤ S.Dstar) :
                      16 * Ms.Λ ≤ S.Ξ

                      At the schedule, Ξ = D_*^{1000} dominates 16 Λ when Λ ≤ D_*.

                      theorem TrilinearHT.Auto.ModeSystem.size_comparison {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) {b : ℤ} {J I : ℤ × ℤ} (hJ : J.1 = b - 2 * ↑S.K) (hIJ : dyadicGridCell Gd I.1 I.2 ⊆ dyadicGridCell Gd J.1 J.2) (hIt : I.1 ≤ b + ↑S.K) (hD : 2 ≤ S.Dstar) (hδ : 0 < Ms.δc) (hΛ : Ms.Λ ≤ S.Dstar) (hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) (hDg : gaugeSqNorm Ms.zc.dim Ms.δc ≤ S.Dstar) (hKf : 2 * gaugeTail Ms.zc.dim Ms.δc / 2 ^ Kf * S.Dstar ^ 300 ≤ 1) (hεw : ∀ (m : Ms.Md), S.Dstar⁻¹ ≤ Ms.L.εM m) (halive : ↑(Ms.alive (ancAt Gd J (b - 4 * ↑S.K))).card ≤ S.Dstar) (c : Ms.Md → ℂ) {Bc : ℝ} (hc : ∑ m ∈ Ms.alive (ancAt Gd J (b - 4 * ↑S.K)), ‖c m‖ ^ 2 ≤ Bc) (h : ℕ) (x : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))) [(Submodule.span ℂ (Ms.cellMode I '' ↑(Ms.compModes S hA b J h x))).HasOrthogonalProjection] :
                      Ms.compSizeSq S hA SP I b J h x c ≤ 12 * ((‖(Submodule.span ℂ (Ms.cellMode I '' ↑(Ms.compModes S hA b J h x))).starProjection (Ms.frozenEval S b J c)‖ ^ 2 + ‖∑ m ∈ Ms.compModes S hA b J h x with ¬Ms.IsCoreAt S hA SP b J m, c m • Ms.cellMode I m‖ ^ 2) / dyadicGridLength Gd I.1) + 3 * Bc / S.Dstar ^ 59

                      Blueprint eq:size-comparison (lines 2202-2209), first assertion, at an actual cell I of length at least r_{t_b} inside the pre-cell J of the block b, for the CURRENT component F = F_h(x): with the frozen coefficients c of ZTilde_{l,G,b} on J (square sum at most B_c over the alive modes; B_c = 4 D_*² C_F by frozen_coeffs), σ_F² ≤ 12 (‖P_{F,I} ZTilde‖²_{2,I} + ‖V_F‖²_{2,I}) + 3 B_c D_*^{-59}, where P_{F,I} projects onto the modes of F on I and V_F is the exact linear-side subtotal of F on I.

                      Proof as in the blueprint: the core subtotals of distinct minimal CURRENT components are almost orthogonal (actualCell_inner_le, cross pairings ≤ 2 D_*^{-200} |I|), so Σ_D ‖A_D‖² ≤ 2 ‖T_F - V_F‖²; the coefficient floors cost at most D_*^{-59} B_c; and pairing the complementary modes against the range of P_{F,I} gives ‖P_{F,I} ZTilde - T_F‖² ≤ 4 D_*^{-397} B_c |I| (projection_subtotal_close). The schedule enters through Ξ = D_*^{1000}, Λ ≤ D_*, the Fourier norm and tail of the squared gauge, the inverse private weights at most D_* and at most D_* alive modes (line 2055).

                      noncomputable def TrilinearHT.Auto.ModeSystem.curComps {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) :

                      The CURRENT components at height h of the block b on the pre-cell J, as mode sets.

                      Equations
                      • One or more equations did not get rendered due to their size.
                      Instances For
                        theorem TrilinearHT.Auto.ModeSystem.side_comparison {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) {b : ℤ} {J I : ℤ × ℤ} (hJ : J.1 = b - 2 * ↑S.K) (hIJ : dyadicGridCell Gd I.1 I.2 ⊆ dyadicGridCell Gd J.1 J.2) (hIt : I.1 ≤ b + ↑S.K) (hD : 2 ≤ S.Dstar) (hδ : 0 < Ms.δc) (hΛ : Ms.Λ ≤ S.Dstar) (hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) (hDg : gaugeSqNorm Ms.zc.dim Ms.δc ≤ S.Dstar) (hKf : 2 * gaugeTail Ms.zc.dim Ms.δc / 2 ^ Kf * S.Dstar ^ 300 ≤ 1) (hεw : ∀ (m : Ms.Md), S.Dstar⁻¹ ≤ Ms.L.εM m) (halive : ↑(Ms.alive (ancAt Gd J (b - 4 * ↑S.K))).card ≤ S.Dstar) (c : Ms.Md → ℂ) (h : ℕ) {Fs : Finset (Finset Ms.Md)} (hFs : Fs ⊆ Ms.curComps S hA b J h) :
                        ∑ F ∈ Fs, ‖∑ m ∈ F with ¬Ms.IsCoreAt S hA SP b J m, c m • Ms.cellMode I m‖ ^ 2 ≤ 2 * ‖∑ m ∈ Ms.alive (ancAt Gd J (b - 4 * ↑S.K)) with ¬Ms.IsCoreAt S hA SP b J m, c m • Ms.cellMode I m‖ ^ 2

                        Blueprint eq:size-comparison (lines 2202-2209), second assertion ("decomposing V into all height-h CURRENT components and discarding unsuccessful ones"): on an actual cell I of length at least r_{t_b} inside the pre-cell J of the block b, for any family Fs of CURRENT components at height h, the exact side subtotals satisfy Σ_{F ∈ Fs} ‖V_F‖² ≤ 2 ‖V‖², where V = Σ_{m alive, side} α_m Ψ_{I,m} is the linear side on I.

                        theorem TrilinearHT.Auto.ModeSystem.sum_sideEvents_eq {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) {b : ℤ} {J : ℤ × ℤ} (hJ : J.1 ≤ b + ↑S.K) {M : Type u_1} [AddCommMonoid M] (f : Ms.Md → M) :
                        ∑ E ∈ Ms.sideEvents S hA SP b J, ∑ m ∈ E, f m = ∑ m ∈ Ms.alive (ancAt Gd J (b - 4 * ↑S.K)) with ¬Ms.IsCoreAt S hA SP b J m, f m

                        The side events of a pre-cell partition its side modes (blueprint line 2084, "it is entirely side by the predicate coherence", core_iff_of_minimal_pre).

                        theorem TrilinearHT.Auto.ModeSystem.restrict_blockSide_actual {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) {b : ℤ} {cells : Finset (ℤ × ℤ)} (hdepth : ∀ J ∈ cells, J.1 = b - 2 * ↑S.K) (c : ℤ × ℤ → Ms.Md → ℂ) {J I : ℤ × ℤ} (hJ : J ∈ cells) (hIJ : dyadicGridCell Gd I.1 I.2 ⊆ dyadicGridCell Gd J.1 J.2) :
                        (columnL2Restriction (dyadicGridCell Gd I.1 I.2) ⋯) (Ms.blockSide S hA SP b cells c) = ∑ m ∈ Ms.alive (ancAt Gd J (b - 4 * ↑S.K)) with ¬Ms.IsCoreAt S hA SP b J m, c J m • Ms.cellMode I m

                        The block side subtotal V_{l,G,b} restricted to an actual cell I inside one of its pre-cells J is the side synthesis on I with the frozen coefficients of J.

                        theorem TrilinearHT.Auto.ModeSystem.side_comparison_block {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) {b : ℤ} {cells : Finset (ℤ × ℤ)} (hdepth : ∀ J ∈ cells, J.1 = b - 2 * ↑S.K) (c : ℤ × ℤ → Ms.Md → ℂ) {J I : ℤ × ℤ} (hJ : J ∈ cells) (hIJ : dyadicGridCell Gd I.1 I.2 ⊆ dyadicGridCell Gd J.1 J.2) (hIt : I.1 ≤ b + ↑S.K) (hD : 2 ≤ S.Dstar) (hδ : 0 < Ms.δc) (hΛ : Ms.Λ ≤ S.Dstar) (hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) (hDg : gaugeSqNorm Ms.zc.dim Ms.δc ≤ S.Dstar) (hKf : 2 * gaugeTail Ms.zc.dim Ms.δc / 2 ^ Kf * S.Dstar ^ 300 ≤ 1) (hεw : ∀ (m : Ms.Md), S.Dstar⁻¹ ≤ Ms.L.εM m) (halive : ↑(Ms.alive (ancAt Gd J (b - 4 * ↑S.K))).card ≤ S.Dstar) (h : ℕ) {Fs : Finset (Finset Ms.Md)} (hFs : Fs ⊆ Ms.curComps S hA b J h) :
                        ∑ F ∈ Fs, ‖∑ m ∈ F with ¬Ms.IsCoreAt S hA SP b J m, c J m • Ms.cellMode I m‖ ^ 2 ≤ 2 * ‖(columnL2Restriction (dyadicGridCell Gd I.1 I.2) ⋯) (Ms.blockSide S hA SP b cells c)‖ ^ 2

                        Blueprint eq:size-comparison (lines 2202-2209), second assertion, with V = V_{l,G,b}: on an actual cell I of length at least r_{t_b} inside a pre-cell J of the block, for any family Fs of CURRENT components at height h, Σ_{F ∈ Fs} ‖V_F‖²_{2,I} ≤ 2 ‖V_{l,G,b}‖²_{2,I}.

                        Cross-mode separation of components with different representatives (lines 2183-2185) #

                        theorem TrilinearHT.Auto.ModeSystem.comp_cross_sep {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (Nd : Finset (ℤ × (ℤ × ℤ) × Ms.Md)) (hNd : ∀ c ∈ Nd, c.2.1.1 = c.1 - 2 * ↑S.K) (Δ h : ℕ) (halive : ∀ c ∈ Nd, c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) (hgood : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd), (Ms.blockComps S hA c.1 c.2.1).Good Δ (Ms.goodP S SP c.1) h ⟨c.2.2, ⋯⟩) (hstab : ∀ c ∈ Nd, ∀ (z z' : ↥(Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K)))), Ms.goodP S SP c.1 h ((Ms.blockComps S hA c.1 c.2.1).π z) → (Ms.blockComps S hA c.1 c.2.1).π z' = (Ms.blockComps S hA c.1 c.2.1).π z → z' ∈ (Ms.blockComps S hA c.1 c.2.1).F h z → z' ∈ (Ms.blockComps S hA c.1 c.2.1).E (h - Δ) z) {k1 : ℕ} (htype1 : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd), Nat.log 2 ((Ms.blockComps S hA c.1 c.2.1).labels ((Ms.blockComps S hA c.1 c.2.1).E (h - Δ) ⟨c.2.2, ⋯⟩)).card = k1) (rep : ℤ × (ℤ × ℤ) × Ms.Md → Ms.Md) (hinh : ∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nd c c' → Ms.predOfMode S hA Δ h c ⊆ Ms.predOfMode S hA Δ h c' → rep c' = rep c) {c c' : ℤ × (ℤ × ℤ) × Ms.Md} (hcc' : Ms.nodeLt3 Nd c c') (hne : rep c ≠ rep c') (z z' : ↥(Ms.alive (ancAt Gd c'.2.1 (c'.1 - 4 * ↑S.K)))) (hz : ↑z ∈ Finset.map { toFun := Subtype.val, inj' := ⋯ } ((Ms.blockComps S hA c.1 c.2.1).F h ⟨c.2.2, ⋯⟩)) (hz' : z' ∈ (Ms.blockComps S hA c'.1 c'.2.1).F h ⟨c'.2.2, ⋯⟩) :
                        z ∉ (Ms.blockComps S hA c'.1 c'.2.1).F h z'

                        Blueprint lines 2183-2185 ("different representatives on comparable actual-use cells have no shared or adjacent cross modes in the later CURRENT graph"), at the level of whole components: for representatives inherited under predecessor inclusion, if two comparable nodes of one type class have different representatives, no mode of the earlier CURRENT component is equal or CURRENT-adjacent (in one later CURRENT component at h) to a mode of the later component.

                        Rows on the first tops with path counts (prop:tops, lines 2221-2222) #

                        theorem TrilinearHT.Auto.ModeSystem.tops_rows_path {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) {s : Finset Ms.Event} (hδ : 0 < Ms.δc) (h1 : ∀ e ∈ s, e.2.2.Nonempty) (h2 : ∀ e ∈ s, ∀ m ∈ e.2.2, Ms.evCell e ⊆ dyadicGridCell Gd (Ms.cellOf m).1 (Ms.cellOf m).2) {Ξ' : ℝ} (htop : ∀ e ∈ s, ∀ e' ∈ s, e ≠ e' → (Ms.evCell e ∩ Ms.evCell e').Nonempty → ∃ (c : ℤ × ℤ), Ms.evCell e ∩ Ms.evCell e' = dyadicGridCell Gd c.1 c.2 ∧ Disjoint e.2.2 e'.2.2 ∧ ∀ m ∈ e.2.2, ∀ m' ∈ e'.2.2, ∀ (n : Fin Ms.zc.dim → ℤ), (∀ (i : Fin Ms.zc.dim), |↑(n i)| ≤ S.Eh 0) → ∃ x ∈ Set.Icc (dyadicGridLeft Gd c.1 c.2) (dyadicGridLeft Gd c.1 c.2 + dyadicGridLength Gd c.1), Ξ' / dyadicGridLength Gd c.1 ≤ |Ms.slope m x - Ms.slope m' x + ∑ i : Fin Ms.zc.dim, ↑(n i) * (Ms.zc.θ i / ↑S.Q0)|) (hΛ : 8 * Ms.Λ ≤ Ξ') (hΞ : 0 < Ξ') (hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) {ε D : ℝ} (hε : 0 < ε) (hεw : ∀ (m : Ms.Md), ε ≤ Ms.L.εM m) (hD0 : 0 ≤ D) (hD1 : ∀ (y : ℝ), ↑(Ms.ptSet y).card ≤ D) (hD2 : ∀ (y : ℝ), ↑(Ms.ptSet y).card ≤ ε * D ^ 2) [inst : ∀ (e : Ms.Event), (Submodule.span ℂ (Ms.evMode e '' ↑e.2.2)).HasOrthogonalProjection] (F : ↥(ColumnL2 Ms.Md)) :
                        ∑ e ∈ s, ‖(Submodule.span ℂ (Ms.evMode e '' ↑e.2.2)).starProjection F‖ ^ 2 ≤ (1 + pairConst Ms.zc.dim Ms.δc Ξ' Kf * D ^ 3) * ‖F‖ ^ 2

                        Blueprint prop:tops, lines 2221-2222 (lem:mode-rows on the rows P_{F,I} of the tops), with the path counts of the blueprint: rows on cells with nonempty mode sets alive on their cells, such that overlapping distinct rows meet in one of their cells, have disjoint mode sets and are separated there at threshold Ξ' for every allowed shift, are Bessel with constant 1 + η D³ when at most D modes (and at most ε D²) are alive at every point.

                        First tops of the representatives (prop:tops, lines 2221-2222) #

                        noncomputable def TrilinearHT.Auto.ModeSystem.nodeComp {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (h : ℕ) (c : ℤ × (ℤ × ℤ) × Ms.Md) :

                        The modes of the CURRENT component at height h of a node (b, J, m) (the mode alone if it is not alive at the decision cell).

                        Equations
                        • One or more equations did not get rendered due to their size.
                        Instances For
                          theorem TrilinearHT.Auto.ModeSystem.nodeComp_eq {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (h : ℕ) {c : ℤ × (ℤ × ℤ) × Ms.Md} (hm : c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) :
                          Ms.nodeComp S hA h c = Finset.map { toFun := Subtype.val, inj' := ⋯ } ((Ms.blockComps S hA c.1 c.2.1).F h ⟨c.2.2, hm⟩)
                          theorem TrilinearHT.Auto.ModeSystem.predOfMode_subset_nodeComp {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (Δ h : ℕ) {c : ℤ × (ℤ × ℤ) × Ms.Md} (hm : c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) :
                          Ms.predOfMode S hA Δ h c ⊆ Ms.nodeComp S hA h c

                          The predecessor of a node lies in its CURRENT component.

                          noncomputable def TrilinearHT.Auto.ModeSystem.firstTops {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (X : Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md)) (rep : ℤ × (ℤ × ℤ) × Ms.Md → Ms.Md) (σ : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md → ℝ) (σ₀ : ℝ) :

                          Blueprint line 2221 ("take the first actual-use cells on each branch where a given representative has σ_F ≥ σ"): among the instances (I, c) (a use cell I and the node c of a component used there) with size at least σ₀, those whose cell is maximal among the instances of the same representative with size at least σ₀.

                          Equations
                          • One or more equations did not get rendered due to their size.
                          Instances For
                            noncomputable def TrilinearHT.Auto.ModeSystem.topRow {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (h : ℕ) (p : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md) :

                            The row of a top: its block, its cell and the modes of its component.

                            Equations
                            Instances For
                              theorem TrilinearHT.Auto.ModeSystem.alive_sep_at_cell {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) {b : ℤ} {J I : ℤ × ℤ} (hJ : J.1 = b - 2 * ↑S.K) (hIJ : dyadicGridCell Gd I.1 I.2 ⊆ dyadicGridCell Gd J.1 J.2) (hIt : I.1 ≤ b + ↑S.K) (hΛ : 8 * Ms.Λ ≤ S.Ξ) {z z' : ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))} (hzF : z ∉ (Ms.blockComps S hA b J).F 0 z') (n : Fin Ms.zc.dim → ℤ) (hn : ∀ (i : Fin Ms.zc.dim), |↑(n i)| ≤ S.Eh 0) :
                              S.Ξ / 2 / dyadicGridLength Gd I.1 < |Ms.slope (↑z') (dyadicGridLeft Gd I.1 I.2) - Ms.slope (↑z) (dyadicGridLeft Gd I.1 I.2) + ∑ i : Fin Ms.zc.dim, ↑(n i) * (Ms.zc.θ i / ↑S.Q0)|

                              eq:representative-separation at the left endpoint of an actual cell I ⊆ J of length at least r_{t_b}, at height zero.

                              theorem TrilinearHT.Auto.ModeSystem.firstTops_pair_sep {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (Nd : Finset (ℤ × (ℤ × ℤ) × Ms.Md)) (hNd : ∀ c ∈ Nd, c.2.1.1 = c.1 - 2 * ↑S.K) (Δ h : ℕ) (halive : ∀ c ∈ Nd, c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) (hgood : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd), (Ms.blockComps S hA c.1 c.2.1).Good Δ (Ms.goodP S SP c.1) h ⟨c.2.2, ⋯⟩) (hstab : ∀ c ∈ Nd, ∀ (z z' : ↥(Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K)))), Ms.goodP S SP c.1 h ((Ms.blockComps S hA c.1 c.2.1).π z) → (Ms.blockComps S hA c.1 c.2.1).π z' = (Ms.blockComps S hA c.1 c.2.1).π z → z' ∈ (Ms.blockComps S hA c.1 c.2.1).F h z → z' ∈ (Ms.blockComps S hA c.1 c.2.1).E (h - Δ) z) {k1 : ℕ} (htype1 : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd), Nat.log 2 ((Ms.blockComps S hA c.1 c.2.1).labels ((Ms.blockComps S hA c.1 c.2.1).E (h - Δ) ⟨c.2.2, ⋯⟩)).card = k1) (hdist : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd) (c' : ℤ × (ℤ × ℤ) × Ms.Md) (hc' : c' ∈ Nd) (h1 : c.1 = c'.1) (h2 : c.2.1 = c'.2.1), c ≠ c' → ⟨c'.2.2, ⋯⟩ ∉ (Ms.blockComps S hA c.1 c.2.1).F h ⟨c.2.2, ⋯⟩) (rep : ℤ × (ℤ × ℤ) × Ms.Md → Ms.Md) (hrep : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md), rep c ∈ Ms.predOfMode S hA Δ h c) (hinh : ∀ (c c' : ℤ × (ℤ × ℤ) × Ms.Md), Ms.nodeLt3 Nd c c' → Ms.predOfMode S hA Δ h c ⊆ Ms.predOfMode S hA Δ h c' → rep c' = rep c) (hsp : ∀ c ∈ Nd, ∀ c' ∈ Nd, c.1 ≠ c'.1 → c.1 + ↑S.K ≤ c'.1 ∨ c'.1 + ↑S.K ≤ c.1) (X : Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md)) (hX : ∀ p ∈ X, p.2 ∈ Nd ∧ dyadicGridCell Gd p.1.1 p.1.2 ⊆ dyadicGridCell Gd p.2.2.1.1 p.2.2.1.2 ∧ p.2.1 ≤ p.1.1 ∧ p.1.1 < p.2.1 + ↑S.K) (σ : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md → ℝ) (σ₀ : ℝ) (hΛ : 8 * Ms.Λ ≤ S.Ξ) {p p' : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md} (hp : p ∈ Ms.firstTops X rep σ σ₀) (hp' : p' ∈ Ms.firstTops X rep σ σ₀) (hsub : dyadicGridCell Gd p.1.1 p.1.2 ⊆ dyadicGridCell Gd p'.1.1 p'.1.2) (hne : Ms.topRow S hA h p ≠ Ms.topRow S hA h p') :
                              Disjoint (Ms.nodeComp S hA h p.2) (Ms.nodeComp S hA h p'.2) ∧ ∀ m ∈ Ms.nodeComp S hA h p.2, ∀ m' ∈ Ms.nodeComp S hA h p'.2, ∀ (n : Fin Ms.zc.dim → ℤ), (∀ (i : Fin Ms.zc.dim), |↑(n i)| ≤ S.Eh 0) → S.Ξ / 2 / dyadicGridLength Gd p.1.1 < |Ms.slope m (dyadicGridLeft Gd p.1.1 p.1.2) - Ms.slope m' (dyadicGridLeft Gd p.1.1 p.1.2) + ∑ i : Fin Ms.zc.dim, ↑(n i) * (Ms.zc.θ i / ↑S.Q0)|

                              Blueprint lines 2221-2222 ("tops for that representative do not overlap; different representatives on overlapping tops have component-mode nonadjacency ... their sets are disjoint on a path"): for two first tops with nested cells I ⊆ I' and different rows, the component modes are disjoint and every pair (inner, outer) is separated at threshold (Ξ/2)/|I| at the left endpoint of I, for every allowed shift at height zero. Hypotheses: the nodes, representatives and type-class conclusions of typed_representatives, blocks K-spaced, and instances (I, c) with I inside the pre-cell of c at a depth of its block.

                              structure TrilinearHT.Auto.ModeSystem.RepClass {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (Δ h : ℕ) :

                              Hereditary representatives of one type class at height h (blueprint lines 2172-2185): the nodes (b, J, m) (one good mode per successful CURRENT component of a pre-cell) with the hypotheses and conclusions of typed_representatives, the blocks being K-spaced.

                              Instances For
                                def TrilinearHT.Auto.ModeSystem.RepClass.Inst {Gd : RealDyadicGrid} {Mc : ℕ} {Ms : ModeSystem Gd Mc} {S : ModeSchedule} {hA : 6 ≤ S.A0} {SP : SideParams} {Δ h : ℕ} (R : Ms.RepClass S hA SP Δ h) (X : Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md)) :

                                The instances of a type class: use cells I inside the pre-cell of a node c, at a depth of its block.

                                Equations
                                Instances For
                                  theorem TrilinearHT.Auto.ModeSystem.RepClass.pair_sep {Gd : RealDyadicGrid} {Mc : ℕ} {Ms : ModeSystem Gd Mc} {S : ModeSchedule} {hA : 6 ≤ S.A0} {SP : SideParams} {Δ h : ℕ} (R : Ms.RepClass S hA SP Δ h) {X : Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md)} (hX : R.Inst X) (σ : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md → ℝ) (σ₀ : ℝ) (hΛ : 8 * Ms.Λ ≤ S.Ξ) {p p' : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md} (hp : p ∈ Ms.firstTops X R.rep σ σ₀) (hp' : p' ∈ Ms.firstTops X R.rep σ σ₀) (hsub : dyadicGridCell Gd p.1.1 p.1.2 ⊆ dyadicGridCell Gd p'.1.1 p'.1.2) (hne : Ms.topRow S hA h p ≠ Ms.topRow S hA h p') :
                                  Disjoint (Ms.nodeComp S hA h p.2) (Ms.nodeComp S hA h p'.2) ∧ ∀ m ∈ Ms.nodeComp S hA h p.2, ∀ m' ∈ Ms.nodeComp S hA h p'.2, ∀ (n : Fin Ms.zc.dim → ℤ), (∀ (i : Fin Ms.zc.dim), |↑(n i)| ≤ S.Eh 0) → S.Ξ / 2 / dyadicGridLength Gd p.1.1 < |Ms.slope m (dyadicGridLeft Gd p.1.1 p.1.2) - Ms.slope m' (dyadicGridLeft Gd p.1.1 p.1.2) + ∑ i : Fin Ms.zc.dim, ↑(n i) * (Ms.zc.θ i / ↑S.Q0)|
                                  theorem TrilinearHT.Auto.ModeSystem.RepClass.topRow_injOn {Gd : RealDyadicGrid} {Mc : ℕ} {Ms : ModeSystem Gd Mc} {S : ModeSchedule} {hA : 6 ≤ S.A0} {SP : SideParams} {Δ h : ℕ} (R : Ms.RepClass S hA SP Δ h) {X : Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md)} (hX : R.Inst X) (σ : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md → ℝ) (σ₀ : ℝ) :
                                  Set.InjOn (Ms.topRow S hA h) ↑(Ms.firstTops X R.rep σ σ₀)

                                  Distinct first tops have distinct rows.

                                  theorem TrilinearHT.Auto.ModeSystem.abs_slope_flip {dz : ℕ} (u v : ℝ) (θ : Fin dz → ℝ) (n : Fin dz → ℤ) :
                                  |v - u + ∑ i : Fin dz, ↑(-n i) * θ i| = |u - v + ∑ i : Fin dz, ↑(n i) * θ i|

                                  The sign flip of the shift in the frequency difference.

                                  theorem TrilinearHT.Auto.ModeSystem.RepClass.firstTops_rows {Gd : RealDyadicGrid} {Mc : ℕ} {Ms : ModeSystem Gd Mc} {S : ModeSchedule} {hA : 6 ≤ S.A0} {SP : SideParams} {Δ h : ℕ} (R : Ms.RepClass S hA SP Δ h) {X : Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md)} (hX : R.Inst X) (σ : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md → ℝ) (σ₀ : ℝ) (hD : 2 ≤ S.Dstar) (hδ : 0 < Ms.δc) (hΛ : Ms.Λ ≤ S.Dstar) (hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) (hDg : gaugeSqNorm Ms.zc.dim Ms.δc ≤ S.Dstar) (hKf : 2 * gaugeTail Ms.zc.dim Ms.δc / 2 ^ Kf * S.Dstar ^ 300 ≤ 1) (hεw : ∀ (m : Ms.Md), S.Dstar⁻¹ ≤ Ms.L.εM m) (hpt : ∀ (y : ℝ), ↑(Ms.ptSet y).card ≤ S.Dstar) [inst : ∀ (e : Ms.Event), (Submodule.span ℂ (Ms.evMode e '' ↑e.2.2)).HasOrthogonalProjection] (F : ↥(ColumnL2 Ms.Md)) :
                                  ∑ e ∈ Finset.image (Ms.topRow S hA h) (Ms.firstTops X R.rep σ σ₀), ‖(Submodule.span ℂ (Ms.evMode e '' ↑e.2.2)).starProjection F‖ ^ 2 ≤ 2 * ‖F‖ ^ 2

                                  Blueprint prop:tops, lines 2221-2222 (lem:mode-rows on the rows P_{F,I} of the first tops of one type class at height h and threshold σ₀), at the schedule: the rows of the first tops are Bessel with constant 2, when Λ ≤ D_*, D_* covers the Fourier norm and tail of the squared gauge, the inverse private weights are at most D_* and at most D_* modes are alive at every point.

                                  theorem TrilinearHT.Auto.ModeSystem.sum_pairs_le_card_mul {BD : Finset (ℤ × ℤ)} {Bs : Finset ℤ} {K : ℕ} (w : ℤ → ℝ) (hw : ∀ (b : ℤ), 0 ≤ w b) (hBD : ∀ bd ∈ BD, bd.1 ∈ Bs ∧ bd.1 ≤ bd.2 ∧ bd.2 < bd.1 + ↑K) :
                                  ∑ bd ∈ BD, w bd.1 ≤ ↑K * ∑ b ∈ Bs, w b

                                  Grouping a sum over a finite set of pairs (b, d) by the first coordinate, when at most K second coordinates occur with each first coordinate (they lie in [b, b + K)).

                                  theorem TrilinearHT.Auto.ModeSystem.RepClass.tops_side {Gd : RealDyadicGrid} {Mc : ℕ} {Ms : ModeSystem Gd Mc} {S : ModeSchedule} {hA : 6 ≤ S.A0} {SP : SideParams} {Δ h : ℕ} (R : Ms.RepClass S hA SP Δ h) {X : Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md)} (hX : R.Inst X) (σ : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md → ℝ) (σ₀ : ℝ) (cells : ℤ → Finset (ℤ × ℤ)) (hdepth : ∀ (b : ℤ), ∀ J ∈ cells b, J.1 = b - 2 * ↑S.K) (hXc : ∀ p ∈ X, p.2.2.1 ∈ cells p.2.1) (Bs : Finset ℤ) (hXB : ∀ p ∈ X, p.2.1 ∈ Bs) (c : ℤ → ℤ × ℤ → Ms.Md → ℂ) (hD : 2 ≤ S.Dstar) (hδ : 0 < Ms.δc) (hΛ : Ms.Λ ≤ S.Dstar) (hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) (hDg : gaugeSqNorm Ms.zc.dim Ms.δc ≤ S.Dstar) (hKf : 2 * gaugeTail Ms.zc.dim Ms.δc / 2 ^ Kf * S.Dstar ^ 300 ≤ 1) (hεw : ∀ (m : Ms.Md), S.Dstar⁻¹ ≤ Ms.L.εM m) (hal : ∀ (b : ℤ), ∀ J ∈ cells b, ↑(Ms.alive (ancAt Gd J (b - 4 * ↑S.K))).card ≤ S.Dstar) :
                                  ∑ p ∈ Ms.firstTops X R.rep σ σ₀, ‖∑ m ∈ Ms.nodeComp S hA h p.2 with ¬Ms.IsCoreAt S hA SP p.2.1 p.2.2.1 m, c p.2.1 p.2.2.1 m • Ms.cellMode p.1 m‖ ^ 2 ≤ 2 * ↑S.K * ∑ b ∈ Bs, ‖Ms.blockSide S hA SP b (cells b) (c b)‖ ^ 2

                                  Blueprint prop:tops, lines 2224-2225 (the side part of eq:size-comparison on the tops): "sum first at a fixed depth of a block: cells are disjoint and component subtotals sum in square to C ‖V_{l,G,b}‖²; summing the at most K depths" gives Σ_tops ‖V_F‖²_{2,I} ≤ 2 K Σ_b ‖V_{l,G,b}‖² for the first tops of one type class, with V_F the exact side subtotal of the top's component on its cell (frozen coefficients c b J).

                                  noncomputable def TrilinearHT.Auto.ModeSystem.nodeSize {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (c : ℤ → ℤ × ℤ → Ms.Md → ℂ) (h : ℕ) (p : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md) :

                                  The component size σ_F² (eq:component-size) of the node of an instance (I, c) on its cell, with the frozen coefficients c b J of its block and pre-cell (zero off the alive modes).

                                  Equations
                                  • One or more equations did not get rendered due to their size.
                                  Instances For
                                    theorem TrilinearHT.Auto.ModeSystem.nodeSize_eq {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (c : ℤ → ℤ × ℤ → Ms.Md → ℂ) (h : ℕ) {p : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md} (hm : p.2.2.2 ∈ Ms.alive (ancAt Gd p.2.2.1 (p.2.1 - 4 * ↑S.K))) :
                                    Ms.nodeSize S hA SP c h p = Ms.compSizeSq S hA SP p.1 p.2.1 p.2.2.1 h ⟨p.2.2.2, hm⟩ (c p.2.1 p.2.2.1)
                                    theorem TrilinearHT.Auto.ModeSystem.nodeComp_eq_compModes {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (h : ℕ) {c : ℤ × (ℤ × ℤ) × Ms.Md} (hm : c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) :
                                    Ms.nodeComp S hA h c = Ms.compModes S hA c.1 c.2.1 h ⟨c.2.2, hm⟩

                                    The modes of the component of a node are its compModes.

                                    theorem TrilinearHT.Auto.ModeSystem.RepClass.tops_absorb {Gd : RealDyadicGrid} {Mc : ℕ} {Ms : ModeSystem Gd Mc} {S : ModeSchedule} {hA : 6 ≤ S.A0} {SP : SideParams} {Δ h : ℕ} (R : Ms.RepClass S hA SP Δ h) {X : Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md)} (hX : R.Inst X) (c : ℤ → ℤ × ℤ → Ms.Md → ℂ) {σ₀ Bc : ℝ} (hD : 2 ≤ S.Dstar) (hδ : 0 < Ms.δc) (hΛ : Ms.Λ ≤ S.Dstar) (hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) (hDg : gaugeSqNorm Ms.zc.dim Ms.δc ≤ S.Dstar) (hKf : 2 * gaugeTail Ms.zc.dim Ms.δc / 2 ^ Kf * S.Dstar ^ 300 ≤ 1) (hεw : ∀ (m : Ms.Md), S.Dstar⁻¹ ≤ Ms.L.εM m) (hal : ∀ p ∈ X, ↑(Ms.alive (ancAt Gd p.2.2.1 (p.2.1 - 4 * ↑S.K))).card ≤ S.Dstar) (hc : ∀ p ∈ X, ∑ m ∈ Ms.alive (ancAt Gd p.2.2.1 (p.2.1 - 4 * ↑S.K)), ‖c p.2.1 p.2.2.1 m‖ ^ 2 ≤ Bc) (hab : 6 * Bc / S.Dstar ^ 59 ≤ σ₀) [inst : ∀ (e : Ms.Event), (Submodule.span ℂ (Ms.evMode e '' ↑e.2.2)).HasOrthogonalProjection] :
                                    σ₀ * ∑ p ∈ Ms.firstTops X R.rep (Ms.nodeSize S hA SP c h) σ₀, dyadicGridLength Gd p.1.1 ≤ 24 * (∑ p ∈ Ms.firstTops X R.rep (Ms.nodeSize S hA SP c h) σ₀, ‖(Submodule.span ℂ (Ms.evMode (Ms.topRow S hA h p) '' ↑(Ms.topRow S hA h p).2.2)).starProjection (Ms.frozenEval S p.2.1 p.2.2.1 (c p.2.1 p.2.2.1))‖ ^ 2 + ∑ p ∈ Ms.firstTops X R.rep (Ms.nodeSize S hA SP c h) σ₀, ‖∑ m ∈ Ms.nodeComp S hA h p.2 with ¬Ms.IsCoreAt S hA SP p.2.1 p.2.2.1 m, c p.2.1 p.2.2.1 m • Ms.cellMode p.1 m‖ ^ 2)

                                    Blueprint prop:tops, lines 2226-2229 (before the cut): on the first tops of one type class at threshold σ₀ (sizes σ_F² ≥ σ₀), eq:size-comparison and the absorption of its error (6 B_c D_*^{-59} ≤ σ₀, from σ² ≥ D_*^{-2}) give σ₀ Σ_tops |I| ≤ 24 (Σ_tops ‖P_{F,I} ZTilde‖² + Σ_tops ‖V_F‖²), with ZTilde the frozen evaluation on the top's pre-cell.

                                    theorem TrilinearHT.Auto.ancAt_eq_ancAt_of_subset {G : RealDyadicGrid} {I J : ℤ × ℤ} (hIJ : dyadicGridCell G I.1 I.2 ⊆ dyadicGridCell G J.1 J.2) {d : ℤ} (hd : d ≤ J.1) :
                                    ancAt G I d = ancAt G J d

                                    The ancestor at a depth above a containing cell is the ancestor of that cell.

                                    theorem TrilinearHT.Auto.ModeSystem.evProj_restrict {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (e : Ms.Event) [(Submodule.span ℂ (Ms.evMode e '' ↑e.2.2)).HasOrthogonalProjection] {t : Set ℝ} (ht : MeasurableSet t) (hJt : dyadicGridCell Gd e.2.1.1 e.2.1.2 ⊆ t) (w : ↥(ColumnL2 Ms.Md)) :

                                    The row projection of an event is local to every set containing its cell.

                                    theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.tops_energy {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)) (hT : ∀ e ∈ s, ∃ R ∈ residueBox (bf.vtag e.tag).dim 9, ∃ (γ : ℝ), e = templateCol (bf.vtag e.tag) l R γ e.birth e.rank e.tag) (htag : ∀ e ∈ s, bf.occAvail (↑e.tag.2) e.tag.1) (d : bf.Vtx) (mb : bf.MainBudget s) (hne : A.cells.Nonempty) (hanc : A.AncClosed) {ι : Type u_1} [Fintype ι] (grp : ι → bf.Grp) (hgrp : Function.Injective grp) (k : ℕ) (hcol : ∀ (G : ι), (grp G).1 = k) (j : ℕ) (hPH : fp.bbase j + fp.P ≤ fp.Hmax) (ls : List (ℕ × Bool)) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) {n : ℕ} (Ms : ι → ModeSystem A.G n) (q : ι → ℕ) (hq : ∀ (G : ι), 1 ≤ q G ∧ q G ≤ S.Q0) (L : (G : ι) → LiftData (bf.Lab ⊕ Fin fp.Mc) (Ms G).Md) (Bs : Finset ℤ) (c : (G : ι) → ℤ → ℤ × ℤ → (Ms G).Md → ℂ) (hcrep : ∀ (G : ι), ∀ b ∈ Bs, ∀ J ∈ fp.retainedV (grp G) b S.K, (Ms G).frozenEval (S.withQ0 (q G)) b J (c G b J) = (columnL2Restriction (dyadicGridCell A.G J.1 J.2) ⋯) ((L G).op (fp.frozenZ l s mb (grp G) j ls (b - 4 * ↑S.K)))) {Bc VE : ℝ} (hcB : ∀ (G : ι), ∀ b ∈ Bs, ∀ J ∈ fp.retainedV (grp G) b S.K, ∑ m ∈ (Ms G).alive (ancAt A.G J (b - 4 * ↑S.K)), ‖c G b J m‖ ^ 2 ≤ Bc) (hVE : ∑ G : ι, ∑ b ∈ Bs, ‖(Ms G).blockSide (S.withQ0 (q G)) hA SP b (fp.retainedV (grp G) b S.K) (c G b)‖ ^ 2 ≤ VE) {Δ h : ℕ} (R : (G : ι) → (Ms G).RepClass (S.withQ0 (q G)) hA SP Δ h) (X : (G : ι) → Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × (Ms G).Md)) (hX : ∀ (G : ι), (R G).Inst (X G)) (hXr : ∀ (G : ι), ∀ p ∈ X G, p.2.1 ∈ Bs ∧ p.2.2.1 ∈ fp.retainedV (grp G) p.2.1 S.K) (hD : 2 ≤ S.Dstar) (hδ : ∀ (G : ι), 0 < (Ms G).δc) (hΛ : ∀ (G : ι), (Ms G).Λ ≤ S.Dstar) (_hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) (hDg : ∀ (G : ι), gaugeSqNorm (Ms G).zc.dim (Ms G).δc ≤ S.Dstar) (hKf : ∀ (G : ι), 2 * gaugeTail (Ms G).zc.dim (Ms G).δc / 2 ^ Kf * S.Dstar ^ 300 ≤ 1) (hεw : ∀ (G : ι) (m : (Ms G).Md), S.Dstar⁻¹ ≤ (Ms G).L.εM m) (halive : ∀ (G : ι) (U : ℤ × ℤ), ↑((Ms G).alive U).card ≤ S.Dstar) (hpt : ∀ (G : ι) (y : ℝ), ↑((Ms G).ptSet y).card ≤ S.Dstar) {ra rb : ℝ} (hroot : ∀ I ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ Set.Icc ra rb) {τ : ℝ} (hτ : 0 < τ) (hτ1 : τ ≤ 1) (hHτ : Real.exp (↑A.Dg * (1 + Real.log A.Hsrc + Real.log τ⁻¹) ^ A.Dg) ≤ fp.Hed) {Nq : ℕ} (hNq : ∀ (y : ℝ), {q : ι × (bf.Lab ⊕ Fin fp.Mc) | ∃ I ∈ A.cells, (∃ (k' : ℕ), fp.Cert k' (grp q.1) I) ∧ ∃ (p : Fin fp.P), y ∈ dyadicGridCell A.G I.1 I.2 ∧ q.2 ∈ mainLabelsM A.G fp.Mc (bf.origCols l) s I (fp.brank j) (fp.bmask I (grp q.1) j (↑p + 1)) d}.card ≤ Nq) (hτN : τ * ↑Nq * A.colBudget ^ 2 ≤ 1) (cc : ℕ) (hcc : 1 ≤ cc) {kq : ℝ} (hkq : 1 ≤ kq) (hDmq : Real.log (2 * mb.B) ≤ kq ^ cc) (hDb : Real.log (2 * A.colBudget) ≤ kq ^ cc) (hn : ↑ls.length ≤ ↑cc * (Real.log kq + 1)) {σ₀ : ℝ} (hab : 6 * Bc / S.Dstar ^ 59 ≤ σ₀) :
                                    σ₀ * ∑ G : ι, ∑ p ∈ (Ms G).firstTops (X G) (R G).rep ((Ms G).nodeSize (S.withQ0 (q G)) hA SP (c G) h) σ₀, dyadicGridLength A.G p.1.1 ≤ 24 * (2 * Real.exp ((6144 * (↑cc + 1) * (1024 * (↑cc + 1) + ↑cc + 7) + 4) * (1 + Real.log (2 * kq)) ^ 2) * dyadicGridLength A.G A.R.1 + 2 * ↑S.K * VE)

                                    Blueprint prop:tops, lines 2221-2227, for one height, one type class (representatives R G of each group) and one threshold σ₀: on the first tops of the actual uses, σ₀ Σ_G Σ_tops |I| ≤ 24 (2 G₀ |R| + 2 K V_E).

                                    • lem:mode-rows on the rows P_{F,I} of the tops (RepClass.firstTops_rows, Bessel constant 2); their decision cells are the containing u_b-cells, active and certified by the tops (retained_decision), so lem:lift-composition (lift_composition_dep, liftConst_le_G0) gives Σ_tops ‖P_{F,I} ZTilde_{l,G,b}‖² ≤ 2 G₀ |R|;
                                    • the side part: Σ_tops ‖V_F‖² ≤ 2 K Σ_{G,b} ‖V_{l,G,b}‖² ≤ 2 K V_E (RepClass.tops_side, with V_E the linear-side energy of eq:linear-energy);
                                    • eq:size-comparison and absorption on each top (RepClass.tops_absorb, 6 B_c D_*^{-59} ≤ σ₀).

                                    The frozen coefficients c represent ZTilde_{l,G,b} = R_{l,G} Z_{l,G,u_b} on the retained pre-cells with square sums at most B_c (frozen_coeffs, linear_energy); the instances are use cells inside retained pre-cells of blocks in Bs.

                                    Counting the used representatives by first tops (prop:tops, line 2229) #

                                    theorem TrilinearHT.Auto.ModeSystem.exists_firstTop_above {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (X : Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md)) (rep : ℤ × (ℤ × ℤ) × Ms.Md → Ms.Md) (σ : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md → ℝ) (σ₀ : ℝ) {p : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md} (hp : p ∈ X) (hσ : σ₀ ≤ σ p) :
                                    ∃ q ∈ Ms.firstTops X rep σ σ₀, rep q.2 = rep p.2 ∧ dyadicGridCell Gd p.1.1 p.1.2 ⊆ dyadicGridCell Gd q.1.1 q.1.2

                                    Blueprint line 2229 ("each representative used in the bin has a ... first σ-top above that use"): an instance of size at least σ₀ lies below a first top of its representative.

                                    theorem TrilinearHT.Auto.ModeSystem.card_reps_le_firstTops_of {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (X : Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md)) (rep : ℤ × (ℤ × ℤ) × Ms.Md → Ms.Md) (σ : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md → ℝ) (σ₀ y : ℝ) (P : ℤ × ℤ → Prop) [DecidablePred P] (hP : ∀ (I J : ℤ × ℤ), dyadicGridCell Gd I.1 I.2 ⊆ dyadicGridCell Gd J.1 J.2 → P I → P J) :
                                    (Finset.image (fun (p : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × Ms.Md) => rep p.2) ({p ∈ X | P p.1 ∧ y ∈ dyadicGridCell Gd p.1.1 p.1.2 ∧ σ₀ ≤ σ p})).card ≤ {q ∈ Ms.firstTops X rep σ σ₀ | P q.1 ∧ y ∈ dyadicGridCell Gd q.1.1 q.1.2}.card

                                    card_reps_le_firstTops restricted to the cells of an upward closed family (for instance the cells not inside any cut cell): the distinct representatives of the instances of size at least σ₀ used at y on such cells are at most the first tops containing y on such cells.

                                    theorem TrilinearHT.Auto.tops_cut_many (G : RealDyadicGrid) (S : Finset (ℤ × ℤ)) {ι : Type u_1} {κ : Type u_2} (CH : Finset κ) (T : κ → Finset ι) (cell : ι → ℤ × ℤ) (hT : ∀ ch ∈ CH, ∀ t ∈ T ch, cell t ∈ S) (root : ℤ × ℤ) (hroot : ∀ c ∈ S, dyadicGridCell G c.1 c.2 ⊆ dyadicGridCell G root.1 root.2) {M : κ → ℝ} {ρ : ℝ} (hρ : 0 < ρ) (hρ1 : ρ < 1) (hCH : CH.Nonempty) (hM : ∀ ch ∈ CH, ∑ t ∈ T ch, dyadicGridLength G (cell t).1 ≤ M ch * dyadicGridLength G root.1) :
                                    ∃ (Cut : Finset (ℤ × ℤ)), dyadicRootLength G Cut ≤ ρ * dyadicGridLength G root.1 ∧ ∀ (x : ℝ), ∀ ch ∈ CH, ↑{t ∈ T ch | (∀ d ∈ Cut, ¬dyadicGridCell G (cell t).1 (cell t).2 ⊆ dyadicGridCell G d.1 d.2) ∧ x ∈ dyadicGridCell G (cell t).1 (cell t).2}.card ≤ M ch * ↑CH.card / ρ

                                    Blueprint line 2229 ("there are polynomially many choices ... Markov's inequality and first crossings of their partial top counts give simultaneously Σ_tops 1_I(y) ≤ P^C σ^{-2} outside a small root fraction, after increasing the fixed power for their number"): for finitely many choices ch with tops of total length Σ_t |I_t| ≤ M_ch |R|, the first crossings of the partial top counts at the thresholds M_ch N/ρ (N choices) remove root length at most ρ |R|, and every point lies in at most M_ch N/ρ tops of every choice on cells not inside a removed cell (the retained paths).

                                    theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.first_top_count {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)) (hT : ∀ e ∈ s, ∃ R ∈ residueBox (bf.vtag e.tag).dim 9, ∃ (γ : ℝ), e = templateCol (bf.vtag e.tag) l R γ e.birth e.rank e.tag) (htag : ∀ e ∈ s, bf.occAvail (↑e.tag.2) e.tag.1) (d : bf.Vtx) (mb : bf.MainBudget s) (hne : A.cells.Nonempty) (hanc : A.AncClosed) {ι : Type u_1} [Fintype ι] (grp : ι → bf.Grp) (hgrp : Function.Injective grp) (k : ℕ) (hcol : ∀ (G : ι), (grp G).1 = k) (j : ℕ) (hPH : fp.bbase j + fp.P ≤ fp.Hmax) (ls : List (ℕ × Bool)) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) {n : ℕ} (Ms : ι → ModeSystem A.G n) (q : ι → ℕ) (hq : ∀ (G : ι), 1 ≤ q G ∧ q G ≤ S.Q0) (L : (G : ι) → LiftData (bf.Lab ⊕ Fin fp.Mc) (Ms G).Md) (Bs : Finset ℤ) (c : (G : ι) → ℤ → ℤ × ℤ → (Ms G).Md → ℂ) (hcrep : ∀ (G : ι), ∀ b ∈ Bs, ∀ J ∈ fp.retainedV (grp G) b S.K, (Ms G).frozenEval (S.withQ0 (q G)) b J (c G b J) = (columnL2Restriction (dyadicGridCell A.G J.1 J.2) ⋯) ((L G).op (fp.frozenZ l s mb (grp G) j ls (b - 4 * ↑S.K)))) {Bc V₀ : ℝ} (hcB : ∀ (G : ι), ∀ b ∈ Bs, ∀ J ∈ fp.retainedV (grp G) b S.K, ∑ m ∈ (Ms G).alive (ancAt A.G J (b - 4 * ↑S.K)), ‖c G b J m‖ ^ 2 ≤ Bc) (hVE : ∑ G : ι, ∑ b ∈ Bs, ‖(Ms G).blockSide (S.withQ0 (q G)) hA SP b (fp.retainedV (grp G) b S.K) (c G b)‖ ^ 2 ≤ V₀ * dyadicGridLength A.G A.R.1) (Hs : Finset ℕ) (Ts : Finset (ℕ × ℕ)) (Thr : Finset ℝ) (hThr : ∀ σ ∈ Thr, S.Dstar⁻¹ ≤ σ) (hCH : (Hs ×ˢ Ts ×ˢ Thr).Nonempty) {Δ : ℕ} (R : (h : ℕ) → ℕ × ℕ → (G : ι) → (Ms G).RepClass (S.withQ0 (q G)) hA SP Δ h) (X : ℕ → ℕ × ℕ → (G : ι) → Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × (Ms G).Md)) (hX : ∀ (h : ℕ) (τ : ℕ × ℕ) (G : ι), (R h τ G).Inst (X h τ G)) (hXr : ∀ (h : ℕ) (τ : ℕ × ℕ) (G : ι), ∀ p ∈ X h τ G, p.2.1 ∈ Bs ∧ p.2.2.1 ∈ fp.retainedV (grp G) p.2.1 S.K) (hD : 2 ≤ S.Dstar) (hδ : ∀ (G : ι), 0 < (Ms G).δc) (hΛ : ∀ (G : ι), (Ms G).Λ ≤ S.Dstar) (hQ0 : 0 < S.Q0) (Kf : ℕ) (hbox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Eh 0) (hDg : ∀ (G : ι), gaugeSqNorm (Ms G).zc.dim (Ms G).δc ≤ S.Dstar) (hKf : ∀ (G : ι), 2 * gaugeTail (Ms G).zc.dim (Ms G).δc / 2 ^ Kf * S.Dstar ^ 300 ≤ 1) (hεw : ∀ (G : ι) (m : (Ms G).Md), S.Dstar⁻¹ ≤ (Ms G).L.εM m) (halive : ∀ (G : ι) (U : ℤ × ℤ), ↑((Ms G).alive U).card ≤ S.Dstar) (hpath : ∀ (y : ℝ), ∑ G : ι, ↑((Ms G).ptSet y).card ≤ S.Dstar) {ra rb : ℝ} (hroot : ∀ I ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ Set.Icc ra rb) {τ : ℝ} (hτ : 0 < τ) (hτ1 : τ ≤ 1) (hHτ : Real.exp (↑A.Dg * (1 + Real.log A.Hsrc + Real.log τ⁻¹) ^ A.Dg) ≤ fp.Hed) {Nq : ℕ} (hNq : ∀ (y : ℝ), {q : ι × (bf.Lab ⊕ Fin fp.Mc) | ∃ I ∈ A.cells, (∃ (k' : ℕ), fp.Cert k' (grp q.1) I) ∧ ∃ (p : Fin fp.P), y ∈ dyadicGridCell A.G I.1 I.2 ∧ q.2 ∈ mainLabelsM A.G fp.Mc (bf.origCols l) s I (fp.brank j) (fp.bmask I (grp q.1) j (↑p + 1)) d}.card ≤ Nq) (hτN : τ * ↑Nq * A.colBudget ^ 2 ≤ 1) (cc : ℕ) (hcc : 1 ≤ cc) {kq : ℝ} (hkq : 1 ≤ kq) (hDmq : Real.log (2 * mb.B) ≤ kq ^ cc) (hDb : Real.log (2 * A.colBudget) ≤ kq ^ cc) (hn : ↑ls.length ≤ ↑cc * (Real.log kq + 1)) (hab : 6 * Bc / S.Dstar ^ 59 ≤ S.Dstar⁻¹ ^ 2) {ρ : ℝ} (hρ : 0 < ρ) (hρ1 : ρ < 1) :
                                    ∃ (Cut : Finset (ℤ × ℤ)), dyadicRootLength A.G Cut ≤ ρ * dyadicGridLength A.G A.R.1 ∧ ∀ (y : ℝ), ∀ h ∈ Hs, ∀ t ∈ Ts, ∀ σ ∈ Thr, ∑ G : ι, ↑(Finset.image (fun (p : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × (Ms G).Md) => (R h t G).rep p.2) ({p ∈ X h t G | (∀ e ∈ Cut, ¬dyadicGridCell A.G p.1.1 p.1.2 ⊆ dyadicGridCell A.G e.1 e.2) ∧ y ∈ dyadicGridCell A.G p.1.1 p.1.2 ∧ σ ^ 2 ≤ (Ms G).nodeSize (S.withQ0 (q G)) hA SP (c G) h p})).card ≤ min S.Dstar (24 * (2 * Real.exp ((6144 * (↑cc + 1) * (1024 * (↑cc + 1) + ↑cc + 7) + 4) * (1 + Real.log (2 * kq)) ^ 2) + 2 * ↑S.K * V₀) * ↑(Hs ×ˢ Ts ×ˢ Thr).card / (ρ * σ ^ 2))

                                    Blueprint prop:tops, eq:top-count (lines 2212-2229), for given type classes of hereditary representatives: after first-crossing cuts of total root length at most ρ |R|, at every point y outside the cuts, for every height h ∈ Hs, type τ ∈ Ts and threshold σ ∈ Thr (σ ≥ D_*^{-1}), the distinct representatives A_G of the components used at y with size σ_F ≥ σ satisfy Σ_G |A_G| ≤ min(D_*, M N / (ρ σ²)), with M = 24 (2 G₀ + 2 K V₀) and N the number of choices (V₀ |R| bounds the linear-side energy eq:linear-energy). The first bound is the full mode budget along the path; the second comes from tops_energy for each choice and the first crossings of the partial top counts (tops_cut_many), each used representative having a retained first top above its use (card_reps_le_firstTops).

                                    def TrilinearHT.Auto.ModeSystem.RepClass.trivial {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (Δ h : ℕ) :
                                    Ms.RepClass S hA SP Δ h

                                    The empty representative class (no nodes; every mode represents itself).

                                    Equations
                                    • One or more equations did not get rendered due to their size.
                                    Instances For
                                      theorem TrilinearHT.Auto.ModeSystem.exists_repClass {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) {Cj CA CT CK : ℕ} {δs W : ℝ} (hV : S.Valid Cj CA CT CK δs W) (hCA : 5 ≤ CA) (hCT : 4 ≤ CT) (hd2 : 2 ≤ S.dmax) (hD : 2 ≤ S.Dstar) (hB : 2 ≤ S.Bstar) (hQ : 1 ≤ S.Q0) (hdim : ∀ (p : Ms.Key), Ms.dvOf p + Ms.zc.dim ≤ S.dmax) (hBσ : 2 * (↑S.Q0 * (3 * (Ms.Bσ * Ms.Bσ) ^ 2)) ^ 2 ≤ ↑⌊S.Dstar⌋₊) (Nd : Finset (ℤ × (ℤ × ℤ) × Ms.Md)) (hNd : ∀ c ∈ Nd, c.2.1.1 = c.1 - 2 * ↑S.K) (halive : ∀ c ∈ Nd, c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))) {h : ℕ} (hJh : h ≤ S.Jstar) (hgood : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd), (Ms.blockComps S hA c.1 c.2.1).Good 10 (Ms.goodP S (S.sideParams δs) c.1) h ⟨c.2.2, ⋯⟩) (hdist : ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Nd) (c' : ℤ × (ℤ × ℤ) × Ms.Md) (hc' : c' ∈ Nd) (h1 : c.1 = c'.1) (h2 : c.2.1 = c'.2.1), c ≠ c' → ⟨c'.2.2, ⋯⟩ ∉ (Ms.blockComps S hA c.1 c.2.1).F h ⟨c.2.2, ⋯⟩) (R₀ : ℤ) (hblk : ∀ c ∈ Nd, ↑S.K ∣ c.1 - R₀) (hcard : ∀ c ∈ Nd, ↑(Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))).card ≤ S.Dstar) (k1 k2 : ℕ) :
                                      ∃ (R : Ms.RepClass S hA (S.sideParams δs) 10 h), R.Nd = {c ∈ Nd | Ms.nodeType1 S hA 10 h c = k1 ∧ Ms.nodeType2 S hA 10 h c = k2}

                                      Blueprint lines 2172-2185 at the schedule, for one height h ≤ J_* and one type (k₁, k₂): nodes (b, J, m) (one good mode per successful CURRENT component of a pre-cell of depth v_b, nodes on one pre-cell lying in different components) of this type, with their hereditary representatives (typed_representatives_sched), form a RepClass (Δ = 10, the side parameters of the schedule). The blocks are K-spaced (K ∣ b - R₀), at most D_* modes are alive at each decision cell and D_* covers the heights of mode differences.

                                      noncomputable def TrilinearHT.Auto.ModeSystem.modeIdx {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (m : Ms.Md) :

                                      A fixed enumeration of the modes.

                                      Equations
                                      Instances For
                                        noncomputable def TrilinearHT.Auto.ModeSystem.succModes {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (b : ℤ) (J : ℤ × ℤ) (h : ℕ) :
                                        Finset ↥(Ms.alive (ancAt Gd J (b - 4 * ↑S.K)))

                                        Blueprint lines 2172-2174 (successful components and their good modes): the modes alive at the decision cell of the pre-cell J of the block b that are good at height h, lie in a CURRENT component containing a core mode good at h (a successful component), and have the least index among the good modes of their component: one good mode for each successful component.

                                        Equations
                                        • One or more equations did not get rendered due to their size.
                                        Instances For
                                          noncomputable def TrilinearHT.Auto.ModeSystem.succNodes {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (P : Finset (ℤ × ℤ × ℤ)) (h : ℕ) :

                                          The nodes (b, J, m) of the successful components over a set P of pairs (block, pre-cell).

                                          Equations
                                          • One or more equations did not get rendered due to their size.
                                          Instances For
                                            theorem TrilinearHT.Auto.ModeSystem.mem_succNodes {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) {SP : SideParams} {P : Finset (ℤ × ℤ × ℤ)} {h : ℕ} {c : ℤ × (ℤ × ℤ) × Ms.Md} :
                                            c ∈ Ms.succNodes S hA SP P h ↔ ∃ bJ ∈ P, ∃ x ∈ Ms.succModes S hA SP bJ.1 bJ.2 h, c = (bJ.1, bJ.2, ↑x)
                                            theorem TrilinearHT.Auto.ModeSystem.succNodes_props {Gd : RealDyadicGrid} {Mc : ℕ} (Ms : ModeSystem Gd Mc) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (P : Finset (ℤ × ℤ × ℤ)) (hP : ∀ bJ ∈ P, bJ.2.1 = bJ.1 - 2 * ↑S.K) (h : ℕ) :
                                            ∃ (halive : ∀ c ∈ Ms.succNodes S hA SP P h, c.2.2 ∈ Ms.alive (ancAt Gd c.2.1 (c.1 - 4 * ↑S.K))), (∀ c ∈ Ms.succNodes S hA SP P h, c.2.1.1 = c.1 - 2 * ↑S.K) ∧ (∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Ms.succNodes S hA SP P h), (Ms.blockComps S hA c.1 c.2.1).Good SP.Δ (Ms.goodP S SP c.1) h ⟨c.2.2, ⋯⟩) ∧ ∀ (c : ℤ × (ℤ × ℤ) × Ms.Md) (hc : c ∈ Ms.succNodes S hA SP P h) (c' : ℤ × (ℤ × ℤ) × Ms.Md) (hc' : c' ∈ Ms.succNodes S hA SP P h) (h1 : c.1 = c'.1) (h2 : c.2.1 = c'.2.1), c ≠ c' → ⟨c'.2.2, ⋯⟩ ∉ (Ms.blockComps S hA c.1 c.2.1).F h ⟨c.2.2, ⋯⟩

                                            The successful nodes are alive, of depth v_b, good, and distinct nodes on one pre-cell lie in different CURRENT components (the node hypotheses of exists_repClass).

                                            noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.useInst {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (G : bf.Grp) (K : ℕ) {Md : Type} (Nd : Finset (ℤ × (ℤ × ℤ) × Md)) :

                                            The used instances of a group (blueprint line 2214, "used representatives"): an actual-use cell I of the group inside the pre-cell of a node (b, J, m), at a depth of its block [b, b + K).

                                            Equations
                                            • One or more equations did not get rendered due to their size.
                                            Instances For
                                              noncomputable def TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.retainedPairs {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (G : bf.Grp) (Bs : Finset ℤ) (K : ℕ) :

                                              The retained pairs (b, J) of a group: blocks b ∈ Bs and retained v_b-cells J.

                                              Equations
                                              Instances For
                                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.mem_retainedPairs {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) {G : bf.Grp} {Bs : Finset ℤ} {K : ℕ} {bJ : ℤ × ℤ × ℤ} :
                                                bJ ∈ fp.retainedPairs G Bs K ↔ bJ.1 ∈ Bs ∧ bJ.2 ∈ fp.retainedV G bJ.1 K
                                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.usedReps_le_Dstar {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {ι : Type u_1} [Fintype ι] {n : ℕ} (Ms : ι → ModeSystem A.G n) (S : ModeSchedule) (hA : 6 ≤ S.A0) (SP : SideParams) (q : ι → ℕ) {Δ h : ℕ} (R : (G : ι) → (Ms G).RepClass (S.withQ0 (q G)) hA SP Δ h) (X : (G : ι) → Finset ((ℤ × ℤ) × ℤ × (ℤ × ℤ) × (Ms G).Md)) (hX : ∀ (G : ι), (R G).Inst (X G)) (hpath : ∀ (y : ℝ), ∑ G : ι, ↑((Ms G).ptSet y).card ≤ S.Dstar) (sz : (G : ι) → (ℤ × ℤ) × ℤ × (ℤ × ℤ) × (Ms G).Md → ℝ) (σ y : ℝ) :
                                                ∑ G : ι, ↑(Finset.image (fun (p : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × (Ms G).Md) => (R G).rep p.2) ({p ∈ X G | y ∈ dyadicGridCell A.G p.1.1 p.1.2 ∧ σ ^ 2 ≤ sz G p})).card ≤ S.Dstar

                                                Blueprint line 2229 ("the full mode budget proves the first [bound]; for σ < D_*^{-1} the full budget already implies the minimum"): at every point and for every threshold, the distinct representatives used at y over all groups number at most D_*, since they are modes alive at y and at most D_* modes are alive along a path across groups.

                                                theorem TrilinearHT.Auto.ActiveSetup.BasicFamilies.FamParams.first_top_count_main {κ : LocalKernelClass} {c₀ : ℕ} {A : ActiveSetup κ c₀} {bf : A.BasicFamilies} (fp : bf.FamParams) (l : Fin 4) (s : List (CatCol bf.Vtx)) (hT : ∀ e ∈ s, ∃ R ∈ residueBox (bf.vtag e.tag).dim 9, ∃ (γ : ℝ), e = templateCol (bf.vtag e.tag) l R γ e.birth e.rank e.tag) (htag : ∀ e ∈ s, bf.occAvail (↑e.tag.2) e.tag.1) (d : bf.Vtx) (mb : bf.MainBudget s) (hne : A.cells.Nonempty) (hanc : A.AncClosed) {ι : Type u_1} [Fintype ι] (grp : ι → bf.Grp) (hgrp : Function.Injective grp) (k : ℕ) (hcol : ∀ (G : ι), (grp G).1 = k) {j : ℕ} (hj : j ≤ 4) (hPH : fp.bbase j + fp.P ≤ fp.Hmax) (ls : List (ℕ × Bool)) (S : ModeSchedule) {Cj CA CT CK : ℕ} {δs W : ℝ} (hV : S.Valid Cj CA CT CK δs W) (hA : 6 ≤ S.A0) (hCj : 340 ≤ Cj) (hCA : 5 ≤ CA) (hCT : 4 ≤ CT) (hδs : 0 < δs) (hδ1 : δs ≤ 1) (hd2 : 2 ≤ S.dmax) (hD : 2 ≤ S.Dstar) (hB : 2 ≤ S.Bstar) (hQ : 1 ≤ S.Q0) (hDm : 2 ≤ S.Dm) (hW : 8 * (↑S.dmax + 1) ^ 3 * Real.log (2 * S.H) / Real.log 2 ≤ W) (D dB : ℕ) {H δc N kk : ℝ} (hHed : 2 ≤ fp.Hed) (hH : 1 ≤ H) (hδc : 0 < δc) (hN0 : 0 ≤ N) (hNl : ∀ I ∈ A.cells, ↑(mainLabels A.G fp.Mc (bf.origCols l) s I (fp.brank j)).card ≤ N) {n : ℕ} (Ms : ι → ModeSystem A.G n) (q : ι → ℕ) (hq : ∀ (G : ι), 1 ≤ q G ∧ q G ≤ S.Q0) (L : (G : ι) → LiftData (bf.Lab ⊕ Fin fp.Mc) (Ms G).Md) (gs : ι → ℤ) (hex : ∀ (G : ι), fp.MainLiftExports l s (grp G) j d D dB H (gs G) (L G) (Ms G).wave (Ms G).cellOf) (hεM : ∀ (G : ι) (m : (Ms G).Md), (L G).εM m = (Ms G).L.εM m) (hdim : ∀ (G : ι) (p : (Ms G).Key), (Ms G).dvOf p + (Ms G).zc.dim ≤ S.dmax) {M : ℕ} (hM1 : 1 ≤ M) (hMD : ↑M ≤ 2 * S.Dm) (hM : ∀ (G : ι) (U : ℤ × ℤ), (Finset.image (Ms G).keyOf ((Ms G).alive U)).card ≤ M) (hδ : ∀ (G : ι), 0 < (Ms G).δc) (hΛ : ∀ (G : ι), (Ms G).Λ ≤ S.Dstar) (Kf : ℕ) (hDg : ∀ (G : ι), gaugeSqNorm (Ms G).zc.dim (Ms G).δc ≤ S.Dstar) (hKf : ∀ (G : ι), 2 * gaugeTail (Ms G).zc.dim (Ms G).δc / 2 ^ Kf * S.Dstar ^ 300 ≤ 1) (hBox : ↑S.Q0 * 2 ^ (Kf + 1) ≤ S.Bstar) (hεw : ∀ (G : ι) (m : (Ms G).Md), S.Dstar⁻¹ ≤ (Ms G).L.εM m) (halive : ∀ (G : ι) (U : ℤ × ℤ), ↑((Ms G).alive U).card ≤ S.Dstar) (hpath : ∀ (y : ℝ), ∑ G : ι, ↑((Ms G).ptSet y).card ≤ S.Dstar) (hBσ : ∀ (G : ι), 2 * (↑S.Q0 * (3 * ((Ms G).Bσ * (Ms G).Bσ) ^ 2)) ^ 2 ≤ ↑⌊S.Dstar⌋₊) (hstar : fp.modeStar D dB H δc N kk ≤ S.Dstar) {CF : ℝ} (hCF : 0 ≤ CF) (hCFD : 24 * CF ≤ S.Dstar ^ 55) (hnorm : ∀ (jb : Fin 2), ∀ U ∈ A.cells, ‖(columnL2Restriction (dyadicGridCell A.G U.1 U.2) ⋯) (bf.P l jb).Z‖ ^ 2 ≤ CF * dyadicGridLength A.G U.1) (R₀ : ℤ) (Bs : Finset ℤ) (hgrid : ∀ b ∈ Bs, ↑S.K ∣ b - R₀) {ra rb : ℝ} (hroot : ∀ I ∈ A.cells, dyadicGridCell A.G I.1 I.2 ⊆ Set.Icc ra rb) {τ : ℝ} (hτ : 0 < τ) (hτ1 : τ ≤ 1) (hHτ : Real.exp (↑A.Dg * (1 + Real.log A.Hsrc + Real.log τ⁻¹) ^ A.Dg) ≤ fp.Hed) {Nq : ℕ} (hNq : ∀ (y : ℝ), {q : ι × (bf.Lab ⊕ Fin fp.Mc) | ∃ I ∈ A.cells, (∃ (k' : ℕ), fp.Cert k' (grp q.1) I) ∧ ∃ (p : Fin fp.P), y ∈ dyadicGridCell A.G I.1 I.2 ∧ q.2 ∈ mainLabelsM A.G fp.Mc (bf.origCols l) s I (fp.brank j) (fp.bmask I (grp q.1) j (↑p + 1)) d}.card ≤ Nq) (hτN : τ * ↑Nq * A.colBudget ^ 2 ≤ 1) (cc : ℕ) (hcc : 1 ≤ cc) {kq : ℝ} (hkq : 1 ≤ kq) (hDmq : Real.log (2 * mb.B) ≤ kq ^ cc) (hDb : Real.log (2 * A.colBudget) ≤ kq ^ cc) (hn : ↑ls.length ≤ ↑cc * (Real.log kq + 1)) (Ts : Finset (ℕ × ℕ)) (Thr : Finset ℝ) (hThr : ∀ σ ∈ Thr, S.Dstar⁻¹ ≤ σ) (hTs : Ts.Nonempty) (hThr0 : Thr.Nonempty) {ρ : ℝ} (hρ : 0 < ρ) (hρ1 : ρ < 1) :
                                                ∃ (c : (G : ι) → ℤ → ℤ × ℤ → (Ms G).Md → ℂ), (∀ (G : ι), ∀ b ∈ Bs, ∀ J ∈ fp.retainedV (grp G) b S.K, (Ms G).frozenEval (S.withQ0 (q G)) b J (c G b J) = (columnL2Restriction (dyadicGridCell A.G J.1 J.2) ⋯) ((L G).op (fp.frozenZ l s mb (grp G) j ls (b - 4 * ↑S.K)))) ∧ (∀ (G : ι), ∀ b ∈ Bs, ∀ J ∈ fp.retainedV (grp G) b S.K, ∑ m ∈ (Ms G).alive (ancAt A.G J (b - 4 * ↑S.K)), ‖c G b J m‖ ^ 2 ≤ 4 * S.Dstar ^ 2 * CF) ∧ ∑ G : ι, ∑ b ∈ Bs, ‖(Ms G).blockSide (S.withQ0 (q G)) hA (S.sideParams δs) b (fp.retainedV (grp G) b S.K) (c G b)‖ ^ 2 ≤ 24 * (↑⌊180 * ↑S.dmax * Real.log (2 * S.Dm) / δs⌋₊ + 1) * (Real.exp ((6144 * (↑cc + 1) * (1024 * (↑cc + 1) + ↑cc + 7) + 4) * (1 + Real.log (2 * kq)) ^ 2) + 2 * CF / S.Dstar ^ 394) * dyadicGridLength A.G A.R.1 ∧ ∃ (R : (h : ℕ) → ℕ × ℕ → (G : ι) → (Ms G).RepClass (S.withQ0 (q G)) hA (S.sideParams δs) 10 h), (∀ h ≤ S.Jstar, ∀ (t : ℕ × ℕ) (G : ι), (R h t G).Nd = {c ∈ (Ms G).succNodes (S.withQ0 (q G)) hA (S.sideParams δs) (fp.retainedPairs (grp G) Bs S.K) h | (Ms G).nodeType1 (S.withQ0 (q G)) hA 10 h c = t.1 ∧ (Ms G).nodeType2 (S.withQ0 (q G)) hA 10 h c = t.2}) ∧ ∃ (Cut : Finset (ℤ × ℤ)), dyadicRootLength A.G Cut ≤ ρ * dyadicGridLength A.G A.R.1 ∧ ∀ (y : ℝ), ∀ h ∈ Finset.range (S.Jstar + 1), ∀ t ∈ Ts, ∀ σ ∈ Thr, ∑ G : ι, ↑(Finset.image (fun (p : (ℤ × ℤ) × ℤ × (ℤ × ℤ) × (Ms G).Md) => (R h t G).rep p.2) ({p ∈ fp.useInst (grp G) S.K (R h t G).Nd | (∀ e ∈ Cut, ¬dyadicGridCell A.G p.1.1 p.1.2 ⊆ dyadicGridCell A.G e.1 e.2) ∧ y ∈ dyadicGridCell A.G p.1.1 p.1.2 ∧ σ ^ 2 ≤ (Ms G).nodeSize (S.withQ0 (q G)) hA (S.sideParams δs) (c G) h p})).card ≤ min S.Dstar (24 * (2 * Real.exp ((6144 * (↑cc + 1) * (1024 * (↑cc + 1) + ↑cc + 7) + 4) * (1 + Real.log (2 * kq)) ^ 2) + 2 * ↑S.K * (24 * (↑⌊180 * ↑S.dmax * Real.log (2 * S.Dm) / δs⌋₊ + 1) * (Real.exp ((6144 * (↑cc + 1) * (1024 * (↑cc + 1) + ↑cc + 7) + 4) * (1 + Real.log (2 * kq)) ^ 2) + 2 * CF / S.Dstar ^ 394))) * ↑(Finset.range (S.Jstar + 1) ×ˢ Ts ×ˢ Thr).card / (ρ * σ ^ 2))

                                                Blueprint prop:tops (eq:top-count, lines 2212-2229) for one basic role l, color k and ball level j, with the hypotheses of eq:linear-energy (linear_energy): there are frozen coefficients c of ZTilde_{l,G,b} on the retained pre-cells (with the linear-side energy bound), and for every height h ≤ J_* and type τ the hereditary representatives of the successful components (RepClass on the successful nodes succNodes of the retained pre-cells, of type τ), such that after first-crossing cuts of total root length at most ρ |R|, at every point y outside the cuts, for every height h ≤ J_*, type τ ∈ Ts and threshold σ ∈ Thr (σ ≥ D_*^{-1}), the distinct representatives A_G of the successful components used at actual-use cells of G containing y with size σ_F ≥ σ satisfy Σ_G |A_G| ≤ min(D_*, M N / (ρ σ²)), where M = 24 (2 G₀ + 2 K V₀) (V₀ |R| the linear-side energy bound) and N is the number of choices of height, type and threshold. The schedule hypotheses are those of linear_energy and of typed_representatives_sched, and D_* covers the normalization constant (24 C_F ≤ D_*^{55}).