This is similar to a question I asked a few months ago. It is possible to define maximum elements in reflexive partial orders $\leq$, without using equality: $(\forall x)x \leq c$. I wonder if it is possible to do so in strict partial orders. To make my question precise, suppose we are given a strict partial order $<$, and a constant $c$. Is it possible to define a first-order formula that does not mention equality, that holds precisely when $c$ is the maximum element? My intuition tells me it is not.
2026-04-19 17:23:35.1776619415
Is it possible to define maximum elements in strict partial orders without using equality?
122 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LOGIC
- Theorems in MK would imply theorems in ZFC
- What is (mathematically) minimal computer architecture to run any software
- What formula proved in MK or Godel Incompleteness theorem
- Determine the truth value and validity of the propositions given
- Is this a commonly known paradox?
- Help with Propositional Logic Proof
- Symbol for assignment of a truth-value?
- Find the truth value of... empty set?
- Do I need the axiom of choice to prove this statement?
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
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
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?
As a quick point of clarification: I'll write "the greatest" instead of "the maximal" since maximality usually refers to the weaker notion of having nothing strictly greater. That notion is of course trivially $\mathsf{FOL_{w/o=}}(<)$-definable.
Your intuition is correct (but see below). We can prove this using a technique which has been used to answer other questions of yours, including the one linked to in the OP: namely, that in $\mathsf{FOL_{w/o=}}$ surjections which preserve and reflect atomic formulas preserve arbitrary-complexity formulas.$^*$
Specifically, let $D_1,D_2$ be the $1$- and $2$-element discrete strict partial orders respectively, and let $f$ be the unique map $D_2\rightarrow D_1$. In the sense of $\mathsf{FOL_{w/o=}}(<)$, the map $f$ is a surjection which preserves and reflects all atomic formulas, so for every $\overline{a}\in D_2$ and every $\mathsf{FOL_{w/o=}}(<)$-formula $\varphi$ we have $$D_2\models\varphi(\overline{a})\quad\iff\quad D_1\models\varphi(f(\overline{a})).$$ Since $D_1$ has a greatest element but $D_2$ doesn't, this means that the property of being a greatest element cannot be expressed by a $\mathsf{FOL_{w/o=}}(<)$-formula.
OK, what if we restrict attention to strict partial orders which do have a greatest element; can we now find that greatest element in $\mathsf{FOL_{w/o=}}$?
It turns out the answer is yes. Consider the formula $$\gamma(x)\equiv\forall y,z(y<z\rightarrow y<x).$$ It's easy to see that if $D$ is a strict partial order with a greatest element $a$ then $\gamma^D=\{a\}$.
However, note that this $\gamma$ behaves weirdly in strict partial orders without greatest elements. For example, let $L_{1,2}$ be the partial order with three elements $a,b,c$ such that $b<c$ and no other comparison holds. Then $\gamma^{L_{1,2}}=\{c\}$ even though $c$ is not the greatest element of $L_{1,2}$. Basically, in an arbitrary strict partial order $\gamma$ merely pins down the set of elements which are strictly above all non-maximal elements!
So the more nuanced answer is:
$^*$Actually, the "right" statement of this fact is a bit different.
Suppose $\mathcal{A},\mathcal{B}$ are structures in the same language with domains $A,B$, and $\mathbb{F}\subseteq A\times B$ is such that:
$\mathbb{F}$ is total: for all $a\in A$ there is some $b\in B$ such that $a\mathbb{F}b$.
$\mathbb{F}$ is surjective: for all $b\in B$ there is some $a\in A$ such that $a\mathbb{F}b$.
$\mathbb{F}$ preserves and reflects atomic formulas: for every atomic formula $\varphi(x_1,...,x_n)$ and every $a_1,...,a_n\in A$ and $b_1,...,b_n\in B$ with $a_i\mathbb{F}b_i$ for all $1\le i\le n$, we have $$\mathcal{A}\models\varphi(a_1,...,a_n)\quad\iff\quad\mathcal{B}\models\varphi(b_1,...,b_n).$$
Then $\mathbb{F}$ preserves and reflects all $\mathsf{FOL_{w/o=}}$-formulas: if $\psi(x_1,...,x_n)$ is an arbitrary $\mathsf{FOL_{w/o=}}$-formula, $a_1,...,a_n\in A$, and $b_1,...,b_n\in B$ with $a_i\mathbb{F}b_i$ for all $1\le i\le n$, we have $$\mathcal{A}\models\psi(a_1,...,a_n)\quad\iff\quad\mathcal{B}\models\psi(b_1,...,b_n).$$ In particular, if such an $\mathbb{F}$ exists then $\mathcal{A}\equiv_\mathsf{w/o=}\mathcal{B}$.
Note that this version of the statement is symmetric and compositional, and arguably such relations give the right notion of "equality-free isomorphism"; that said, it's a bit harder to think about at first.