AFTD Auto-Formalizing Theoretical Domains

iid_bpe_sharp_factor

def

The conjectured sharp uniform i.i.d. greedy Byte-Pair Encoding merge factor c = (2 + √2) / 4.

Statement

noncomputable def iid_bpe_sharp_factor : ℝ
Defined in
scout/2611-08671-greedy-byte-pair-encoding-achieves-at-least-0-361-of-the-op.md
Verified
13 Nov 2026
Axioms
none listed
Used by 3
  • iid_greedy_bpe_approx_probGiven alphabet size q, weights p : Fin q → ℝ, merge budget k, length N, and tolerance ε : ℝ, iid_greedy_bpe_approx_prob q p k N ε is the…
  • iid_bpe_sharp_factor_boundsThe i.i.d. BPE sharp approximation constant c = (2 + √2)/4 lies strictly in the open unit interval (0, 1).
  • op_1604_iid_greedy_bpe_budget_oneOpen Problem OP-1604 (budget k = 1 case): For a merge budget of k = 1, every alphabet size q ≥ 2, every strictly positive probability…

Read back from the Lean

The definition of iid_bpe_sharp_factor as the real number (2 + Real.sqrt 2) / 4.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The conjectured sharp uniform i.i.d. greedy Byte-Pair Encoding merge factor (2 + √2) / 4. -/
noncomputable def iid_bpe_sharp_factor : ℝ := (2 + Real.sqrt 2) / 4
See it in the graphDiscuss this resultChallenge it