poset_aut
def
The automorphism group of a partially ordered set P is the subgroup of permutations σ of P preserving the partial order in both directions.
Statement
def poset_aut (P : Type*) [PartialOrder P] : Subgroup (Equiv.Perm P)
- Defined in
- arXiv:2611.15540 Section 1
- Verified
- 13 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given a type P with a partial order ([PartialOrder P]), poset_aut P is defined as the subgroup of the permutation group of P (Equiv.Perm P) consisting of all permutations σ of P such that for all x, y : P, x ≤ y ↔ σ x ≤ σ y (i.e., the order automorphisms of 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
/-- The automorphism group Aut(P) of a partially ordered set P as a subgroup of Equiv.Perm P. -/ def poset_aut (P : Type*) [PartialOrder P] : Subgroup (Equiv.Perm P) where carrier := { σ : Equiv.Perm P | ∀ x y : P, x ≤ y ↔ σ x ≤ σ y } mul_mem' := by intro a b ha hb x y exact (hb x y).trans (ha (b x) (b y)) one_mem' := by intro x y rfl inv_mem' := by intro a ha x y dsimp at ha ⊢ have h := (ha (a.symm x) (a.symm y)).symm rw [Equiv.apply_symm_apply, Equiv.apply_symm_apply] at h exact h