poset_hypomorphic
def
Two ordered sets P and Q are hypomorphic (have the same deck) when there is a bijection σ : P → Q such that for every x the one-element-deleted suborder P − x is isomorphic to Q − σ(x); equivalently, the multisets of isomorphism types of one-element deletions coincide.
Statement
def poset_hypomorphic (P Q : Type*) [PartialOrder P] [PartialOrder Q] : Prop
- Defined in
- arXiv:2610.12690 (Reconstruction of Finite Posets of Width Three), Sec. 1–2 (deck of an ordered set, reconstructibility).
- Verified
- 13 Oct 2026
- Axioms
- none listed
- Used by 5
- poset_hypomorphic_isolated_iffLet finite ordered sets P, Q have |P| ≥ 3 and the same deck, witnessed by the bijection σ with P − x ≅ Q − σ(x) for all x. Then for every…
- poset_hypomorphic_card_reconstructibleHypomorphic finite ordered sets have the same cardinality.
- poset_hypomorphic_card_lt_pairs_eqThe number of comparable pairs is reconstructible: if finite ordered sets P and Q with |P| ≥ 3 have the same deck, they have the same…
- poset_hypomorphic_reflEvery ordered set is hypomorphic to itself.
- poset_iso_of_iso_delete_of_isolatedIf x ∈ P and y ∈ Q are each incomparable with every other element and the complements P − x and Q − y are order-isomorphic, then P ≅ Q.
Lean source view module on GitHub
/-- Two orders are hypomorphic when some bijection `σ` matches every one-element-deleted suborder `P - x` with an isomorphic one `Q - σ x`: they have the same deck. -/ def poset_hypomorphic (P Q : Type*) [PartialOrder P] [PartialOrder Q] : Prop := ∃ σ : P ≃ Q, ∀ x : P, Nonempty ({y : P // y ≠ x} ≃o {y : Q // y ≠ σ x})