AFTD Auto-Formalizing Theoretical Domains

alpha_prime_elementary_meet_nondvd

theoremverified

For a lexical elementary negative-cell step of prime degree, the meet degree cannot divide the ambient prime degree.

Statement

theorem alpha_prime_elementary_meet_nondvd
    (p : ℕ) (hp : p.Prime) (a b : List ℕ) (i : ℕ)
    (ha : alpha_is_lexical a) (hb : alpha_is_lexical b)
    (hsa : a.sum + 1 = p) (hi : i % 2 = 1)
    (hstep : alpha_elementary_cell_step a b i) :
    ¬ ((alpha_lexical_meet a b).sum + 1) ∣ p
Source
Arithmetic helper for the published prime-degree lexical adjacency criterion, arXiv:0810.5205v2, Theorem 3.1 and Corollary 3.3. The existing elementary-meet theorem gives proper degree; primality excludes divisibility. This does not prove the structural adjacency criterion and is not a research advance.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
  • alpha_elementary_lexical_meetProposed helper discharging the lexical common-prefix hypothesis in the published adjacency criterion for a valid negative-cell elementary…
  • alpha_elementary_cell_stepOne source elementary split or conjugation, with a zero-based cell index.
  • alpha_lexical_meetThe common left factor, including the minimum value at the first unequal cell.
  • alpha_is_lexicalA nonempty positive sequence strictly larger than all its proper nonempty suffixes.

The proof, explained

By the properties of an elementary lexical meet step, the meet degree is strictly greater than 1 and strictly less than the ambient prime degree p. If this meet degree were to divide p, the primality of p would force it to equal either 1 or p. Both alternatives contradict the strict bounds, showing that the meet degree cannot divide p.

  1. The meet degree (alpha_lexical_meet a b).sum + 1 lies strictly between 1 and p.

    Applying alpha_elementary_lexical_meet produces the bounds 1 < (alpha_lexical_meet a b).sum + 1 (hypothesis hpos) and (alpha_lexical_meet a b).sum + 1 < a.sum + 1 (hypothesis hlt). Rewriting with the ambient degree assumption hsa (a.sum + 1 = p) in hlt replaces the upper bound with p, yielding 1 < (alpha_lexical_meet a b).sum + 1 < p.

    lines 7–8

    uses alpha_elementary_lexical_meet

      obtain ⟨_, hpos, hlt⟩ := alpha_elementary_lexical_meet a b i ha hb hi hstep
      rw [hsa] at hlt
  2. The assumption that the meet degree divides p leads to a contradiction.

    We assume for contradiction that (alpha_lexical_meet a b).sum + 1 divides p (hd). By hp.eq_one_or_self_of_dvd, any divisor of the prime p must be 1 or p. However, each alternative contradicts the strict bounds 1 < (alpha_lexical_meet a b).sum + 1 < p, and linear integer arithmetic (omega) refutes both cases to close the proof.

    lines 9–10

    uses hp.eq_one_or_self_of_dvd

      intro hd
      rcases hp.eq_one_or_self_of_dvd _ hd with he | he <;> omega
alpha_elementary_lexical_meet
For an elementary cell step on lexical compositions at an odd index, the lexical meet is lexical, its degree is strictly greater than 1, and its degree is strictly less than that of the initial composition.
hp.eq_one_or_self_of_dvd
If p is prime and m divides p, then m = 1 or m = p.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem alpha_prime_elementary_meet_nondvd    (p : ℕ) (hp : p.Prime) (a b : List ℕ) (i : ℕ)    (ha : alpha_is_lexical a) (hb : alpha_is_lexical b)    (hsa : a.sum + 1 = p) (hi : i % 2 = 1)    (hstep : alpha_elementary_cell_step a b i) :    ¬ ((alpha_lexical_meet a b).sum + 1) ∣ p := by  obtain ⟨_, hpos, hlt⟩ := alpha_elementary_lexical_meet a b i ha hb hi hstep  rw [hsa] at hlt  intro hd  rcases hp.eq_one_or_self_of_dvd _ hd with he | he <;> omega
See it in the graphDiscuss this resultChallenge it