Download data/lean/ComparatorChallenges/BinaryEditLower.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.29 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/ComparatorChallenges/BinaryEditLower.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/ComparatorChallenges/BinaryEditLower.lean
-
curl -L -o BinaryEditLower.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/ComparatorChallenges/BinaryEditLower.lean
2.29 kB
| import Mathlib | |
| namespace OAI | |
| namespace TreeEdit | |
| universe u | |
| /-- A single unit-cost insertion, deletion, or substitution at any position. -/ | |
| inductive EditStep {Ξ± : Type u} : List Ξ± β List Ξ± β Prop | |
| | insert (p q : List Ξ±) (a : Ξ±) : EditStep (p ++ q) (p ++ a :: q) | |
| | delete (p q : List Ξ±) (a : Ξ±) : EditStep (p ++ a :: q) (p ++ q) | |
| | substitute (p q : List Ξ±) (a b : Ξ±) : EditStep (p ++ a :: q) (p ++ b :: q) | |
| /-- An edit script with no restriction on intermediate word lengths. -/ | |
| inductive EditScript {Ξ± : Type u} : List Ξ± β List Ξ± β β β Prop | |
| | nil (x : List Ξ±) : EditScript x x 0 | |
| | cons {x y z : List Ξ±} {n : β} : | |
| EditStep x y β EditScript y z n β EditScript x z (n + 1) | |
| noncomputable def ed {Ξ± : Type u} (x y : List Ξ±) : β := | |
| sInf {n | EditScript x y n} | |
| abbrev RealL1 := lp (fun _ : β => β) 1 | |
| abbrev Word (Ξ± : Type u) (n : β) := {x : List Ξ± // x.length = n} | |
| namespace BinaryLower | |
| /-- The product of the two maximal pairwise distance ratios. -/ | |
| noncomputable def distortion {X : Type u} (Ο : X β X β β) (f : X β RealL1) : β := | |
| sSup {r : β | β x y : X, x β y β§ r = βf x - f yβ / Ο x y} * | |
| sSup {r : β | β x y : X, x β y β§ r = Ο x y / βf x - f yβ} | |
| /-- The infimum over every injective map into the full real sequence space ββ. -/ | |
| noncomputable def c1 (X : Type u) (Ο : X β X β β) : β := | |
| sInf {D : β | β f : X β RealL1, Function.Injective f β§ D = distortion Ο f} | |
| noncomputable def binarySetDistortion {n : β} (W : Finset (Word Bool n)) : β := | |
| c1 {x : Word Bool n // x β W} | |
| (fun x y => (ed x.val.val y.val.val : β)) | |
| noncomputable def growth (c : β) (d : β) : β := | |
| Real.exp (c * Real.sqrt (Real.log (d : β) * Real.log (Real.log (d : β)))) | |
| end BinaryLower | |
| open BinaryLower | |
| /-- The binary lower-bound theorem of OpenAI's September 27, 2026 tree-constructions | |
| manuscript: finite equal-length witnesses for every sufficiently large length cap. -/ | |
| theorem binary_lower_bound : | |
| β c : β, 0 < c β§ β dβ : β, β d : β, dβ β€ d β | |
| β n : β, 1 β€ n β§ n β€ d β§ | |
| β W : Finset (Word Bool n), 2 β€ W.card β§ | |
| growth c d β€ binarySetDistortion W := by | |
| sorry | |
| end TreeEdit | |
| end OAI | |