bpe_partial_step
def
A partial merge replaces an arbitrary nonoverlapping subset of one pair by a fresh symbol, with an unchanged step allowed.
Statement
def bpe_partial_step (s t : List ℕ) : Prop
- Source
- Definitions for OP-1288, following arXiv:2611.08671, Section 2.
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 1
- bpe_partial_mergeThe relation between input and output strings obtained by replacing an arbitrary subset of pairwise nonoverlapping occurrences of the…
- Used by 2
- bpe_worst_case_ratio_three_upper_boundThe worst-case ratio of greedy Byte-Pair Encoding to optimal partial-merge utility for three merges is at most 7/12.
- bpe_optimal_utilityThe supremum, over strings reachable in k partial-merge steps, of the reduction in length of the input string.
Lean source view module on GitHub
def bpe_partial_step (s t : List ℕ) : Prop := s = t ∨ ∃ a b z, z ∉ s ∧ bpe_partial_merge a b z s t