The notion of (set) monoid can be generalised to that of monoid object in a monoidal category. Can the notion of poset be generalised in a similar fashion? How?
2026-04-05 01:41:46.1775353306
Generalisation of posets
181 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SOFT-QUESTION
- Reciprocal-totient function, in term of the totient function?
- Ordinals and cardinals in ETCS set axiomatic
- Does approximation usually exclude equality?
- Transition from theory of PDEs to applied analysis and industrial problems and models with PDEs
- Online resources for networking and creating new mathematical collaborations
- Random variables in integrals, how to analyze?
- Could anyone give an **example** that a problem that can be solved by creating a new group?
- How do you prevent being lead astray when you're working on a problem that takes months/years?
- Is it impossible to grasp Multivariable Calculus with poor prerequisite from Single variable calculus?
- A definite integral of a rational function: How can this be transformed from trivial to obvious by a change in viewpoint?
Related Questions in CATEGORY-THEORY
- (From Awodey)$\sf C \cong D$ be equivalent categories then $\sf C$ has binary products if and only if $\sf D$ does.
- Continuous functor for a Grothendieck topology
- Showing that initial object is also terminal in preadditive category
- Is $ X \to \mathrm{CH}^i (X) $ covariant or contravariant?
- What concept does a natural transformation between two functors between two monoids viewed as categories correspond to?
- Please explain Mac Lane notation on page 48
- How do you prove that category of representations of $G_m$ is equivalent to the category of finite dimensional graded vector spaces?
- Terminal object for Prin(X,G) (principal $G$-bundles)
- Show that a functor which preserves colimits has a right adjoint
- Show that a certain functor preserves colimits and finite limits by verifying it on the stalks of sheaves
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?
The internalization of preorders are internal binary relations which are reflexive and transitive.
An internal relation $(d_0,d_1 : R \to X)$ is called reflexive if there is a morphism $\Delta : X \to R$ such that $d_0 \Delta = \mathrm{id}_X = d_1 \Delta$. Since $(d_0,d_1)$ are jointly monic, $\Delta$ is unique, if it exists.
An internal relation $(d_0,d_1 : R \to X)$ is called transitive if for all morphisms $u : T \to R$, $v : T \to R$ with $d_1 u = d_0 v$ there is some morphism $w : T \to R$ with $d_0 w = d_0 u$ and $d_1 w = d_1 v$. Again, $w$ is unique, if it exists.
This describes internal preorders. We get internal posets by adding antisymmetry:
An internal relation $(d_0,d_1 : R \to X)$ is called antisymmetric if for all morphisms $u : T \to R$, $v : T \to R$ with $d_1 u = d_0 v$ and $d_0 u = d_1 v$ we have $d_0 u = d_1 u$.