poset_hypomorphic_refl
Every ordered set is hypomorphic to itself.
Statement
theorem poset_hypomorphic_refl (P : Type*) [PartialOrder P] : poset_hypomorphic P P
- Source
- Sanity lemma for poset_hypomorphic (arXiv:2610.12690).
- Verified
- 13 Oct 2026
- Axioms
Quot.sound- Built on 1
- poset_hypomorphicTwo ordered sets P and Q are hypomorphic (have the same deck) when there is a bijection σ : P → Q such that for every x the…
The proof, explained
To show that a partially ordered set P is hypomorphic to itself, we must exhibit a bijection σ : P ≃ P such that for every x ∈ P, the subposet obtained by removing x is order-isomorphic to the subposet obtained by removing σ(x). We choose σ to be the identity bijection on P. Since σ(x) = x, removing x from both sides yields the exact same subposet, and the identity order isomorphism witnesses their isomorphism.
The poset P is hypomorphic to itself.
By definition, two posets are hypomorphic if there exists a bijection between them such that deleting any element yields an order-isomorphic subposet to deleting its image. Choosing the identity bijection on P (given by Equiv.refl), each element x maps to itself, so the subposets obtained by deleting x from both copies of P are identical. The identity order isomorphism on {y : P // y ≠ x} (given by OrderIso.refl) witnesses that these subposets are order-isomorphic.
uses
Equiv.refl,OrderIso.refl⟨Equiv.refl P, fun _ => ⟨OrderIso.refl _⟩⟩
Equiv.refl- The identity bijection from any type to itself.
OrderIso.refl- The identity order isomorphism from any ordered type to itself.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
theorem poset_hypomorphic_refl (P : Type*) [PartialOrder P] : poset_hypomorphic P P := ⟨Equiv.refl P, fun _ => ⟨OrderIso.refl _⟩⟩