Level-two boundary match from profile data and alignment
Provedmme_entropy_regional_boundary_match_level_twoLevel-two boundary-match packaging lemma. Given an integer entropy step at level , a level-two boundary profile of dimension , and a proof that the profile grade and usefulness conditions imply the step output, there is boundary data over the step output with matrix dimensions multiplying to . The construction packs the profile into a single-cell, single-part boundary end; the alignment hypothesis becomes exactly the required inside proof, and the dimension identity is the profile dimension. This separates routine packaging (proved once, here as the accompanying proof) from the analytic copy bound and the profile alignment, which remain open. Formalization Note Lean fixes canonical conventions (, one cell, profile mode ); the dimension product collapses to the profile dimension.
import Definitions.Def_mme_integer_regional_CW_recipe import Definitions.Def_mme_regional_entropy_copy_bound import Definitions.Def_mme_recursive_profiled_CW_data import Definitions.Def_mme_recursive_yz_boundary_data import Definitions.Def_mme_recursive_yz_CW_cells import Definitions.Def_mme_recursive_yz_compatibility import Definitions.Def_mme_recursive_yz_cell_partition set_option autoImplicit false
theorem mme_entropy_regional_boundary_match_level_two
(S : MME.RegionRealization.IntegerStep 2 2 (fun _ _ => True))
(prof : MME.RecursiveYZ.Boundary.Profile 2 1)
(hDim : prof.dim = 25)
(halign : (forall (i : Fin 3) (x : MME.ProfiledCW.FineWord 2),
((forall _p : Fin 1,
MME.RecursiveYZ.CWCells.grade
(@MME.ProfiledCW.split (Fin 1) 2 1 2 (Equiv.refl (Fin 1))
(by decide : 1 * 2 ^ (2 - 1) = 2) x _p) =
(prof.shape 0) i) /\
MME.RecursiveYZ.Useful (fun _ : Fin 1 => (0 : Fin 1))
(fun _ : Fin 1 => prof.mu 0 i)
(@MME.ProfiledCW.split (Fin 1) 2 1 2 (Equiv.refl (Fin 1))
(by decide : 1 * 2 ^ (2 - 1) = 2) x)) ->
S.output i x)) :
exists (B : MME.ProfiledCW.BoundaryEnd 2 2 S.output),
B.a * B.b * B.c = 25 /\ Nat.le 1 (B.a * B.b * B.c) := by sorry