Is the group of automorphisms of a lattice of partitions of the set $X$, where $|X| = n$, isomorphic to $S_n$? I think it is (for sure it's not 'smaller' than $S_n$), but i can't find any proof of it in papers or books. I did try to prove it myself but it's not that easy, can't think of a counterexample either.
2026-03-27 18:09:24.1774634964
Automorphisms of a finite partition lattice
66 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ORDER-THEORY
- Some doubt about minimal antichain cover of poset.
- Partially ordered sets that has maximal element but no last element
- Ordered set and minimal element
- Order relation proof ...
- Lexicographical covering of boolean poset
- Every linearly-ordered real-parametrized family of asymptotic classes is nowhere dense?
- Is there a name for this property on a binary relation?
- Is the forgetful functor from $\mathbf{Poset}$ to $\mathbf{Set}$ represented by the object 2?
- Comparing orders induced by euclidean function and divisibility in euclidean domain
- Embedding from Rational Numbers to Ordered Field is Order Preserving
Related Questions in LATTICE-ORDERS
- When a lattice is a lattice of open sets of some topological space?
- How to identify if a given Hasse diagram is a lattice
- How to find the smallest cardinal of a minimal generating set of a lattice
- Finding a poset with a homogeneity property
- Why is the "distributive lattice" structure of domino tilings significant?
- Two lattice identities
- Quickly determining whether given lattice is a distributive lattice from a given Hasse diagram
- Characteristic of a lattice that subsets contain their meets and joins
- Equalities in Heyting algebras
- Show that $(\operatorname{Up}(P),\subset)$ is a distributive lattice
Related Questions in SET-PARTITION
- Existence of a denumerble partition.
- Given N sets of partitions, find a partition such that it satisfies a criterion
- Given a decreasing family of sets and partitions with a refinement condition, is there a monotonous choice function from the partitions?
- Partition of an $n$-element set such that the smallest component has at least $k$ elements?
- Number of equivalence relations on a set with $kn$ elements with the condition that each equivalence class has n elements
- Is there a similar notion of cycle type commonly in use for finite partitions, where instead of cycle sizes one counts the block sizes?
- Is it possible to construct two subsequences of a sequence X with specific properties such that the two subsequence sums are the same?
- Coloring $\mathbb{R}^2$ and single-colored paths
- A homework problem about set theory
- Canonical name for the partition that a partition of a set induces on its subsets
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Is the group of automorphisms of a lattice of partitions of the set $X$, where $|X|=n$, isomorphic to $S_n$?
Yes, if $n\neq 2$.
Assume that $X = \{1,2,\ldots,n\}$. Let $\Pi(X)$ be the lattice of partitions of $X$. For each $i\in X$, let $\widehat{i}$ ($i$ hat) be the partition $\{\{i\}, X\setminus\{i\}\}$ of $X$ that has two cells where one is the singleton $\{i\}$ and the other is the complement $X\setminus \{i\}$. Let $\widehat{X} = \{\widehat{1},\widehat{2},\ldots,\widehat{n}\}$, which is a subset of $\Pi(X)$. I will indicate why $\widehat{X}$ is an $\textrm{Aut}(\Pi(X))$-orbit and why the restriction map $\rho\colon \alpha\mapsto \alpha|_{\widehat{X}}$ is an isomorphism of $\textrm{Aut}(\Pi(X))$ onto $\textrm{Sym}(\widehat{X})$.
(This says that $\widehat{X}$ is a union of $\textrm{Aut}(\Pi(X))$-orbits, which is enough to guarantee that the restriction map $\rho$ is a homomorphism from $\textrm{Aut}(\Pi(X))$ to $\textrm{Sym}(\widehat{X})$.)
The reason the first claim is true when $n>2$ is that $\widehat{X}$ is definable as the set of partitions of $X$ that are coatoms of $\Pi(X)$ that have exactly $|X|-1$ complementary atoms. (Then we use the fact that lattice automorphisms must map 'coatoms with $|X|-1$ complementary atoms' to other 'coatoms with $|X|-1$ complementary atoms'.) To see that $\widehat{X}$ is exactly the set of partitions of $X$ that are coatoms that have exactly $|X|-1$ complementary atoms, note that the coatoms of $\Pi(X)$ are the partitions of $X$ with $2$ cells, say $\{I,J\}$, while the atoms of $\Pi(X)$ are the partitions that have exactly one nonsingleton cell and that nonsingleton cell has $2$ elements. The number of atoms that are complementary to the coatom $\{I,J\}$ is $|I|\cdot |J|$, since the nonsingleton cell of a complementary atom will have the form $\{i,j\}$ where $i\in I$ and $j\in J$. Now, if $|I|+|J|=|X|$ and $|I|\cdot |J|=|X|-1$, then $|I|$ and $J$ are the roots of the polynomial $f(t)=t^2-|X|\cdot t + (|X|-1)$, hence $|I|$ and $|J|$ are the numbers $1$ and $|X|-1$ in some order. This is enough to show that a coatom of $\Pi(X)$ has exactly $|X|-1$ complementary atoms iff the coatom is a member of $\widehat{X}$.
The reason the second claim is true when $n>2$ is that $\widehat{X}$ is a lattice-theoretic generating set for $\Pi(X)$. (Every atom in $\Pi(X)$ is a meet of elements of $\widehat{X}$, and every element of $\Pi(X)$ is a join of atoms. Thus $\bigvee \bigwedge \widehat{X} = \Pi(X)$.) Since two lattice automorphisms that agree on a lattice-theoretic generating set are equal, distinct automorphisms of $\Pi(X)$ will have distinct restrictions to $\widehat{X}$
The reason the third claim is true when $n>2$ is that any permutation $\pi$ of the set $X$ induces an automorphism $\bar{\pi}$ on $\Pi(X)$ whose action on $\widehat{X}$ mirrors the action of $\pi$ on $X$: $\bar{\pi}(\widehat{i})=\widehat{\pi(i)}$. For example, if $X=\{1,2,3,4\}$ and $\pi=(1\;2)(3\;4)\in \textrm{Sym}(X)$, then $\bar{\pi}$ is the automorphism of $\Pi(X)$ that maps a partition $\{I,J,K\}$ to $\{\pi(I),\pi(J),\pi(K)\}$ and in particular it maps $\widehat{i} = \{\{i\},X\setminus \{i\}\}$ to $\{\{\pi(i)\},X\setminus \{\pi(i)\}\}$. Thus $\bar{\pi}|_{\widehat{X}}=(\widehat{1}\;\widehat{2})(\widehat{3}\;\widehat{4})$.