Skip to main content

All Questions

0 votes
1 answer
37 views

Galois connections give rise to complete lattices

I am reading Introduction to Lattices and Order, second edition, by Davey and Priestly. On page 161, it says Every Galois connection $(^\rhd,^\lhd)$ gives rise to a pair of closure operators, $^{\rhd\...
Delong's user avatar
  • 1,889
0 votes
0 answers
22 views

If sub-universe $S$ of lattice has congruence $\theta$, does the lattice have a congruence $\lambda = \theta \cap S^2$? [duplicate]

Let $(L, \lor , \land )$ be a lattice and $S$ a sub-universe of the lattice. A sub-universe of a lattice will be any subset of the lattice set that is non-empty and closed under $\land$ and $\lor$. ...
lafinur's user avatar
  • 3,468
1 vote
0 answers
65 views

simplicial category is generated by cofaces and codegeracies

As the title says, I'd like to understand whether the following proof of the well known fact that give $f \in \Delta([m],[n])$ weakly increasing is uniquely determined by being $f = \delta^{i_1}\circ \...
jacopoburelli's user avatar
0 votes
1 answer
44 views

Countability of a partially ordered set

First of all, thank you in advance to everyone who will look at my question, I saw a question yesterday and I thought of such a solution to the question, but I was not sure if it was my mistake or not,...
Hacemat's user avatar
  • 63
0 votes
1 answer
31 views

How to define a linear order on the set of $m$-ary operations on an $n$-element set?

Let $m$ and $n$ be positive integers, let $S$ be a linearly ordered $n$-element set, and consider the set of all $m$-ary operations on $S$. What is the most "natural" way to linearly order ...
user107952's user avatar
  • 21.5k
0 votes
0 answers
23 views

Listing the elements in a poset in "non-decreasing" order

In my problem, I have a specific poset which is also a lattice, but I think the result holds for any finite poset, so let $(P,\preceq)$ be a finite poset with $\#P=n$ and maximal element $M$ and ...
Snildt's user avatar
  • 376
3 votes
0 answers
52 views

Subsets Whose Translates Under Group Action Are $\subseteq$-Ordered

Suppose $X$ is a space, and $G$ a topological group acting continuously upon it. I'm interested in those closed sets $A \subseteq X$ whose translates under each $g \in G$, up to equivalence, are ...
Pete Caradonna's user avatar
0 votes
0 answers
51 views

$\mathcal E$ is an algebra. Then, a set must be either partly E-dense or in $\mathcal E$?

$\mathcal E$ is an algebra on $[0,1]$. $E$ is in $\mathcal E$. A set $D$ is $\mathcal E$-dense if $D\cap E$ is nonempty for all positive measure $E$. We use notation $D$ for E-dense set. $D$ is not in ...
High GPA's user avatar
  • 3,824
2 votes
0 answers
75 views

How many affine prime-quotient ultrafilters does a rational semiring have?

I know ultrafilters are considered powerful by more-learned mathematicians than I. I cannot profess to understand the reasons how and why although I can see the power of Zorn's Lemma and the axiom of ...
it's a hire car baby's user avatar
1 vote
1 answer
66 views

The natural partial order on the set of idempotents in the semigroup of Boolean relation matrices.

Let $\mathcal{E}_n$ be the set of idempotents in the semigroup $\mathcal{B}_n$ of $n \times n$ Boolean relation matrices. The relation $E \leq F$ iff $EF=FE=E$ is called the natural partial order on $...
geoffrey's user avatar
1 vote
1 answer
1k views

Minimal and maximal elements of a partially ordered set

I've been trying to comprehend the concept of minimal and maximal elements of a partially ordered set, but the explanations I find often involve the use of Hasse diagrams. Can someone please explain ...
Abdulrahman's user avatar
5 votes
1 answer
94 views

How to describe all semigroups $(S, \, \cdot)$ based on a choice operation?

Let $S$ be a non-empty set. We say that a binary operation $f \, \colon S \times S \to S$ is a choice operation if it always returns one of its arguments. In other words, $\forall \, a \in S \, \colon ...
John McClane's user avatar
  • 1,815
2 votes
1 answer
48 views

If $⊥$ is an operation on $X$ inversely compatibile at $x$ in $X$ with the order $\mathcal O$ on $X$ then is it directly compatible at $x$ too?

If $\bot$ is an operation on a set $X$ then we say that it is directly compatibile on the left with an order $\mathcal O$ on $X$ at any $x$ in $X$ if the inequality $$ x_1\prec_\mathcal Ox_2 $$ with $...
Antonio Maria Di Mauro's user avatar
5 votes
1 answer
100 views

The successor of 0 in an ordered ring

The Setup I am investigating properties of the following definition of ordered rings: Let $R$ be a ring. We say $R$ is an ordered ring under the total order relation $\leq$ if, for all $a,b,c \in R$, ...
Nick F's user avatar
  • 1,249
1 vote
0 answers
100 views

Multiplicative lattice with $(a \land b)\ast(a\lor b)=a \ast b$

The natural numbers $\mathbb{N}$ carry two (order-theoretic) lattice structures: One, say $L_1$, is the division lattice (where the join is the least common multiple and the meet is the greatest ...
Margaret's user avatar
  • 1,769

15 30 50 per page
1
2 3 4 5
17