standard_example_partial_order
instance
The standard example of order k is a partial order under standard_example_le.
Statement
instance standard_example_partial_order (k : ℕ) : PartialOrder (StandardExample k)- Defined in
- arXiv:2610.24774 Section 1
- Verified
- 20 Oct 2026
- Axioms
- none listed
- Built on 2
- standard_example_leIn the standard example S_k, min i ≤ max j if and only if i ≠ j, with no relations between two minimal or two maximal elements.
- StandardExampleThe standard example S_k of order k is a type with k minimal elements and k maximal elements.
- Used by 2
- 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…
- is_standard_example_freeA poset P is S_k-free when it does not contain the standard example S_k of order k as an induced subposet.
Read back from the Lean
For every natural number k, the type StandardExample k is equipped with a PartialOrder instance whose ordering relation ≤ is standard_example_le.
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
/-- PartialOrder instance on the standard example of order k. -/ instance standard_example_partial_order (k : ℕ) : PartialOrder (StandardExample k) where le := standard_example_le le_refl x := by cases x <;> simp [standard_example_le] le_trans x y z := by cases x <;> cases y <;> cases z <;> simp [standard_example_le] · rintro rfl; exact id · rintro rfl; exact id · rintro h rfl; exact h · rintro rfl; exact id le_antisymm x y := by cases x <;> cases y <;> simp [standard_example_le] · rintro rfl _; rfl · rintro rfl _; rfl