AFTD Auto-Formalizing Theoretical Domains

alpha_lexical_meet

def

The common left factor, including the minimum value at the first unequal cell.

Statement

def alpha_lexical_meet : List ℕ → List ℕ → List ℕ
Defined in
Run-length helpers for OP-392, arXiv:2610.24758, Conjecture 1; lexical sequences and elementary operations from arXiv:0810.5205, Definitions 1.1, Section 2, Theorem 3.1 and Corollary 3.3. No new research advance is claimed for these supporting statements.
Verified
24 Oct 2026
Axioms
none listed
Used by 9

Lean source view module on GitHub

def alpha_lexical_meet : List ℕ → List ℕ → List ℕ
  | a :: as, b :: bs => if a = b then a :: alpha_lexical_meet as bs else [min a b]
  | _, _ => []
See it in the graphDiscuss this resultChallenge it