Hashed construction as a level-3 stage and a level-2 continuation
Provedmme_released_global_graded_hashed_level3_stage_level2_continuationThis is the hashed construction at a chosen reference, in the form of a level-3 stage followed by a level-2 continuation, with the rate budget split between them.
Fix the released global data, with and ; write . For a scale and a family of released global references at scale , let be the number of hashed (positive) positions, and let be the hashed source predicate QPos with tolerance for all six owners.
Claim. For every with there is such that for every there is with the following property. If , then there are a reference family at scale and
- a partition of the positions into six parts of sizes ,
- part predicates on words of length and a predicate on words of length , such that the six sources jointly imply and implies every target (each on its part's positions),
- graded part stages from to with lower level ,
- a graded logarithmic joint recipe of level with source ,
satisfying
- for each ;
- ;
- and ;
- ;
- .
Role. This is the level-3/level-2 split of refthe hashed construction with an explicit dimension target, following the plan in the mission comments: part is the band-part stage (or the square-scale tolerance stage) for orientation/region , and is the level-2 continuation (zero-half boundary, the single-type level-2 step, level-1 boundary). The stage's rate share is below per , the sum of the six proved region rate margins (with per ). The continuation's share is below the level-2 margin per . The two shares add to exactly the required . All dimensions come from the continuation, since a stage does not change dimensions.
Formalization Note. The parts are given by positions : ((j : Fin 6) × Fin (size j)) ≃ Fin (partSize (k^2) a 1), the stages are LogPartStageG (size j) 2 (S j) (T j), and the continuation is LogJointRecipeG (partSize (k^2) a 1) 2 Q. The degree is chosen after and before ; the reference family and all stage data are chosen after .
import Definitions.Def_mme_released_global_two_part_split_data import Definitions.Def_mme_graded_integer_regional_step_data open BigOperators MME MME.ProfiledCW MME.GlobalCW MME.RecursiveYZ MME.CompleteSplit MME.ReleasedGlobal MME.RegionRealization MME.ReleasedRecursive.Asm open scoped Classical set_option autoImplicit false
theorem mme_released_global_graded_hashed_level3_stage_level2_continuation :
∀ e : ℝ, 0 < e → e ≤ 1 → ∃ C : ℕ,
∀ k0 : ℕ, ∃ k : ℕ, k0 ≤ k ∧
∀ (hk : 0 < k^2), ∃ a : ∀ o : Fin 6, Reference o (k^2),
∃ (size : Fin 6 → ℕ)
(positions : ((j : Fin 6) × Fin (size j)) ≃ Fin (partSize (k^2) a 1))
(S T : ∀ j, Predicate (size j))
(Q : Predicate (partSize (k^2) a 1)),
(∀ i x, (∀ j, S j i (fun r ↦ x (positions ⟨j, r⟩))) →
QPos (k^2) a (fun _ ↦ e) i x) ∧
(∀ i x, Q i x → ∀ j, T j i (fun r ↦ x (positions ⟨j, r⟩))) ∧
∃ (steps : ∀ j, LogPartStageG (size j) 2 (S j) (T j))
(next : LogJointRecipeG (partSize (k^2) a 1) 2 Q),
(∀ j, 1 ≤ (steps j).types ∧ (steps j).types ≤ (k + 1) ^ C) ∧
(6 * blocks (k^2) : ℝ) * ((7363871 : ℝ)/10000000) ≤ ∑ j, (steps j).rate ∧
1 ≤ next.inputs ∧
next.inputs ≤ (k + 1) ^ C ∧
1 ≤ next.a * next.b * next.c ∧
(6 * blocks (k^2) : ℝ) * ((5859676 : ℝ)/10000000) ≤ next.logOutputs ∧
(6 * blocks (k^2) : ℝ) * ((583785872051 : ℝ)/100000000000) ≤
Real.log ((next.a * next.b * next.c : ℕ) : ℝ) := by sorry