is_standard_example_free
def
A poset P is S_k-free when it does not contain the standard example S_k of order k as an induced subposet.
Statement
def is_standard_example_free (P : Type*) [PartialOrder P] (k : ℕ) : Prop
- Defined in
- arXiv:2610.24774 Section 1
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Built on 2
- standard_example_partial_orderThe standard example of order k is a partial order under standard_example_le.
- StandardExampleThe standard example S_k of order k is a type with k minimal elements and k maximal elements.
- Used by 1
- standard_example_reduction_min_max_subposetLet P be a finite poset of height 2 and let (u, v) be a min-max incomparable pair in P. If d ≥ 3 and P is S_d-free, then the subposet…
Read back from the Lean
Given a type P equipped with a partial order [PartialOrder P] and a natural number k : ℕ, is_standard_example_free P k asserts that the type of order embeddings from StandardExample k into P is empty (i.e., there exists no order embedding from StandardExample k into P).
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
/-- A poset P is S_k-free if it contains no induced subposet isomorphic to the standard example of order k. -/ def is_standard_example_free (P : Type*) [PartialOrder P] (k : ℕ) : Prop := IsEmpty (StandardExample k ↪o P)