AFTD Auto-Formalizing Theoretical Domains

word_occp

def

For two gap profiles of equal shape, the number of indices where the first profile's entry is strictly larger than the second's.

Statement

def word_occp (gw gv : List ℕ) : ℕ
Source
step towards word_unary_inserted_block_exchange_exact
Verified
07 Nov 2026
Axioms
none listed
Used by 1
  • word_gap_occThe number of gaps in which w has strictly more copies of a than v: the number of indices at which the 'a'-gap profile of w exceeds that…

Lean source view module on GitHub

def word_occp (gw gv : List ℕ) : ℕ := (gw.zip gv).countP (fun q => decide (q.2 < q.1))
See it in the graphDiscuss this resultChallenge it