AFTD Auto-Formalizing Theoretical Domains

is_M_pattern

def

A list of natural numbers β is an M-pattern if β is nonempty, some element of β is strictly greater than its head, and some element of β is strictly greater than its last element.

Statement

def is_M_pattern (β : List ℕ) : Prop
Defined in
arXiv:2610.37940 Section 6.3
Verified
31 Oct 2026
Axioms
none listed

Read back from the Lean

A list of natural numbers β is non-empty, contains at least one element strictly greater than its first element, and contains at least one element strictly greater than its last element.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- An M-pattern is a nonempty list of natural numbers whose maximum entry is at an interior position. -/
def is_M_pattern (β : List ℕ) : Prop := ∃ h : β ≠ [], (∃ x ∈ β, β.head h < x) ∧ (∃ x ∈ β, β.getLast h < x)
See it in the graphDiscuss this resultChallenge it