BinaryLowerBound.lean`

1 declarations, 0 contain sorry, 0 declared as axioms

theorem OAI.TreeEdit.binary_lower_bound line 12
Source documentation
Introduction, thm:binary: actual equal-length binary witnesses for every sufficiently large cap, from the finite-tree family and quadratic block code.
Distinct definitions of this name: ComparatorChallenges/BinaryEditLower.lean:51 (same statement text; different proof or body). Qualify references as OAI.TreeEdit.binary_lower_bound@path.
```
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
…
```
Mentions: OAI.TreeEdit.Word