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
- lexical_degree_seventeen_class_a_counterexampleThe lexical sequences a = (3,1,1,3,3,2,2,1) and b = (3,1,1,2,1,3,2,2,1) both have degree 16, are adjacent in the source lexical order…
- alpha_prime_lexical_meet_nondvd_of_neFor any distinct lexical sequences of the same prime degree, the meet degree is a proper nontrivial value and does not divide the ambient…
- alpha_lexical_meet_sum_lt_of_ne_of_sum_eqThe common lexical meet of two distinct positive integer sequences of equal sum has strictly smaller sum than either input.
- alpha_lexical_meet_is_lexicalThe source common-prefix meet of two nonempty positive lexical sequences is lexical, even if their sums differ.
- alpha_lexical_even_split_prime_obstructionAt degree parameter 13 there are two ordered lexical sequences of degree 12 with lexical meet (3,1). Splitting the later sequence at its…
- alpha_prime_elementary_meet_nondvdFor a lexical elementary negative-cell step of prime degree, the meet degree cannot divide the ambient prime degree.
- alpha_elementary_lexical_meetProposed helper discharging the lexical common-prefix hypothesis in the published adjacency criterion for a valid negative-cell elementary…
- alpha_lexical_terminal_predecessor_simple_star_obstructionThe two displayed lexical sequences are adjacent among sequences of degree 19 and have meet f=(2,1,1). The later sequence has a lexical…
- alpha_lexical_example_elevenKernel-checked encoding of the length-eleven example in arXiv:0810.5205, Example 3.2, including its one-bit completed words and the…
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] | _, _ => []