$S$ is a finite poset or lattice ; $A$ and $B$ two distinct elements. If there is at least one automorphism that maps $A$ to $B$, can I find one such automorphism that is an involution? The set of automorphisms of $S$ is a subgroup of its permutation group, so any automorphism can be decomposed into products of cycles with disjoint supports. It seems to me that if I look for all the automorphisms of $S$ that map $A$ to $B$, if this set is not empty then I should be able to find one, $F$, with cycles of max lenght 2, in which case $F = F^{-1}$. But is this true? In other terms, I'm looking for an automorphism that swaps A and B, and also swaps any pairs of elements as required by compatibility with the partial order (e.g., swap a cover of A with a cover of B), leaving all other elements unchanged. I believe that if any automorphism mapping A to B exists, then one such automorphism exists, but I'm stuck about how to prove it. NB this is not homework (I'm close to 60) but amateur interest in lattices and posets, and I haven't done any serious math since my PhD.... so thanks for being indulgent!
2026-03-25 23:39:37.1774481977
Is there an involutive automorphism mapping two given elements of a poset or lattice?
97 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
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 AUTOMORPHISM-GROUP
- Fixed points of automorphisms of $\mathbb{Q}(\zeta)$
- A weird automorphism
- Confusing step in proof of property of cyclic group automorphisms
- ord$(a) = p, f(a) = a, \forall f : G \to G$ automorphism $\implies |G|$ is not square-free
- Arbitrary automorphism function on Aut(Quaternion Group)?
- writing a computer program in magma that finds a linear code and a specific automorphism group to the code.
- Let $G$ be a group. Show that, for every $a\in G$, the map $\phi_a:G\to G$, defined by $\phi_a(g) := aga^{−1}$ ($g\in G$), is a group automorphism.
- homomorphism from $F^\times \times F^\times$ to Aut$(F)$
- Extension of isomorphism of fields
- Graph with distinct automorphisms but no fixed-point free automorphism
Related Questions in INVOLUTIONS
- Extension and restriction of involutions
- Involution of the 3 and 4-holed torus and its effects on some knots and links
- Reverse operation on Quaternions
- $\mathbb{Z}_2$-grading of a vector space by an involution
- Are $f(x)=x$ and $f(x)=-x$ the only odd bijective involutions from $\mathbb{R}$ to $\mathbb{R}$?
- About the exponential generating function of the involutions of $\mathbb{S}_n$
- If a $2 \times 2$ matrix $A$ satisfies $A^2=I$, then is $A$ necessarily Hermitian?
- What does it mean for a ring to have an involution? Are there any examples?
- positive matrices diagonalised by involutions
- An involution on a pair of pants fixing one boundary component and permuting other two?
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?
The answer is no; consider the following finite poset, where the two dashed segments are supposed to be two ends of the same segment:
Its automorphism group is cyclic of order $3$, so there are nontrivial automorphisms but no involutions.
In fact more is true; for every finite group $G$ there exists a finite poset $P$ with $\operatorname{Aut}(P)\cong G$. Moreover, given a set of generators of $G$ one can construct such a finite poset $P$ explicitly. For more details see this paper.