Skip to main content

Questions tagged [lattice-theory]

The theory of lattices in the sense of order theory. For the number-theoretic notion, use the tag "lattices" instead.

Filter by
Sorted by
Tagged with
0 votes
0 answers
18 views

A block of an orthomodular lattice $L$ is a maximal Boolean subalgebra of $L$. In a complete orthomodular lattice, every block is complete. I suspect the converse does not hold, but don't know a ...
Gumby's user avatar
  • 271
2 votes
1 answer
232 views

Starting point. I was toying around with the following question: If $A, B\subseteq [0,1]$ with $A\cup B = [0,1]$, does $[0,1]$ order-embed into at least one of $A, B$? Quickly I focused on $A = [0,1]\...
Dominic van der Zypen's user avatar
3 votes
1 answer
301 views

Assume $\Gamma$ is an infinite set composed of formulas (of finite length), and $A$ is a formula (of finite length). For example, $\Gamma=\{x,y\sqcup z,x_1,x_2,x_3,\cdots\}$, $A=(x\sqcap y)\sqcup(x\...
Florian's user avatar
  • 39
1 vote
1 answer
206 views

Please show (using arithmetic) that, for $r,s,t\in\mathbb N$, $$ \prod_{i=1}^r\prod_{j=1}^s\prod_{k=1}^t\,\frac{i+j+k-1}{i+j+k-2} $$ equals $$ \prod_{i=1}^r\,\frac{\binom{s+t+i-1}{s}}{\binom{s+i-1}{s}}...
Tri's user avatar
  • 1,979
8 votes
1 answer
215 views

Are there some general theorems which govern global structure of posets arising as posets of epimorphisms out of a (unital, associative) ring? One may note that it is always a lattice — it is ...
Denis T's user avatar
  • 6,030
3 votes
0 answers
208 views

The background for my question is somewhat related to this; there a very interesting paper is provided, but the setting and examples are somewhat different. I can add any necessary background or ...
Rodrigo Nicolau Almeida's user avatar
2 votes
0 answers
120 views

Let $\mathcal{F} = \{A_1, \ldots, A_n\}$ be a union-closed family of sets with universe $\bigcup_{i=1}^n A_i = [q] = \{1, \ldots, q\}$. Let $M = [m_{ij}]$ be the $n \times n$ matrix with $m_{ij} = \...
Fabius Wiesner's user avatar
0 votes
1 answer
184 views

I am looking for examples of additively idempotent semirings (which are always join semilattices) that do not have an underlying lattice structure, i.e. either meets do not exist or exist outside the ...
Unshi's user avatar
  • 1
0 votes
2 answers
88 views

On a lattice $\mathcal{L}$, I have a submodular, monotone, real-valued function $\rho$. Submodularity means it satisfies the inequality $$\rho(x)+\rho(y)\ge \rho(x\wedge y)+\rho(x\vee y)$$ for all $x, ...
Bumblebee's user avatar
  • 1,203
2 votes
1 answer
144 views

Consider any finite commutative semigroup $S$. Say that $x \leq y$ iff $x = y$ or $xy = y$. This is a partial order on $S$: the only nontrivial property to check is that $x \leq y$ and $y \leq z$ ...
Fabius Wiesner's user avatar
3 votes
1 answer
166 views

An antichain in $\mathcal P(\omega)$ is a set $\mathcal A\subseteq \mathcal P(\omega)$ such that for all $A, B\in \mathcal A$ with $A\neq B$ we have $(A\setminus B)\neq \emptyset$ and $(B \setminus A)\...
Dominic van der Zypen's user avatar
1 vote
1 answer
86 views

For a space $X$, consider the complete lattice $\text{CL}(X)$ of closed sets of $X$. The $\text{CL}(X)$-filters will be called $\text{CL}$-filters. Similarly consider the lattice $Z(X)$ of zero-sets ...
Jakobian's user avatar
  • 2,389
1 vote
0 answers
55 views

I was reading "Stone Spaces" by Peter Johnstone. It turns out the continuous locales are exactly the ones corresponding to topologies of sober locally compact spaces. For a Hausdorff locally ...
Nik Bren's user avatar
  • 813
7 votes
0 answers
178 views

Let $(R, +, 0, \cdot, 1)$ be a (unital) semiring equipped with a unary operation $f$ and a binary operation $\land$ such that $f(0) = 1$ $f(x + y) = f(x) f(y)$ $x \land y = y \land x$ $x \land (y \...
Keith J. Bauer's user avatar
3 votes
1 answer
110 views

Given two finite abelian $p$-groups $H\subseteq G$. Given $n$, what is the number of subgroups $N\subseteq G$ such that $N\cap H=0$ and $\lvert N\rvert = p^n$? In particular, does it depend only on ...
Yifeng Huang's user avatar
3 votes
2 answers
322 views

There are many great algorithms for enumeration of vectors in a lattice such as Fincke-Pohst-Kannan, extreme pruning etc, not to mention great implementations such as fplll. Let $L$ be high density (...
Oisin Robinson's user avatar
5 votes
1 answer
261 views

According to https://en.wikipedia.org/wiki/Absorption_law (lets stick to finite) lattices are exactly the sets with two commutative semigroup operations satisfying the absorption law. Question: Is ...
Mare's user avatar
  • 28.2k
0 votes
0 answers
155 views

I'm currently studying some classes of distributive lattices, which I've recently found to be Noether lattices as well. I'm fairly unfamiliar with Noether lattices, beyond the definition and a theorem ...
Elsa F.'s user avatar
  • 11
4 votes
1 answer
251 views

Let $L_n$ denote the free distributive lattice on $n$ elments, which is for example defined as the lattice of order ideals of the Boolean lattice of an $n$-set. Question: Is it true that the poset of ...
Mare's user avatar
  • 28.2k
2 votes
0 answers
127 views

First of all, I should confess that this is not my field of study. Recently, I encountered a situation where I had a (meet) semilattice $\mathcal{L}$ and a compatible valuation (positive semidefinite ...
Bumblebee's user avatar
  • 1,203
1 vote
0 answers
112 views

A closure algebra is a Boolean algebra $B$ with a $\vee$-preserving closure operator $\bf C$ that sends $0$ to $0$. A Heyting algebra is a lattice $H$ with a $0$ and a binary operation $\rightarrow$ ...
Tri's user avatar
  • 1,979
3 votes
1 answer
234 views

Preliminaries A Stone space is defined to be a compact Hausdorff space with a basis consisting of clopen sets. Let $X$ be a Stone space with a binary relation $R$ that is reflexive and transitive. A ...
Tri's user avatar
  • 1,979
3 votes
1 answer
164 views

$\def\Pfin{{\cal P}(\omega)/{\text{(fin)}}}$The projection $\pi:{\cal P}(\omega)\to \Pfin$ is clearly surjective and order-preserving. (The quotient $\Pfin$ is defined here.) Is there a surjective ...
Dominic van der Zypen's user avatar
0 votes
0 answers
103 views

Partial frames are generalizations of frames, which are complete lattices where finite meets distribute over arbitrary joins. In partial frames however, only selected (distinguished) joins are allowed ...
Abel's user avatar
  • 51
0 votes
1 answer
92 views

I’ve been studying the optimal transport problem and I understand that in one dimension it can be solved quite easily: because $\mathbb{R}$ is totally ordered, the cumulative distribution function ...
Jose de Frutos's user avatar
3 votes
0 answers
82 views

Let $\mathcal{L}$ be a supersolvable geometric lattice and let $F$ be a modular element of $\mathcal{L}$. Does $\mathcal{L}$ necessarily admit a maximal chain of modular elements with $F$ in it ? If $...
Basile C's user avatar
  • 111
8 votes
1 answer
435 views

A multiplicative lattice is a complete lattice $(L, \leq)$ that is endowed with an associative, commutative multiplication that distributes over arbitrary joins and has $1$, the top element of $L$, as ...
Dominic van der Zypen's user avatar
8 votes
1 answer
319 views

Let $E$ be an equational theory (in the sense of universal algebra) in the language of lattices. Given a cardinal $\kappa$, say that $E$ is $\kappa$-cheap iff there is a set-sized complete lattice $L$ ...
Noah Schweber's user avatar
2 votes
1 answer
382 views

I feel the need to explain my background before diving into this soft question, for you to understand my position. During my undergraduate years, a Theoretical Computer Science professor asked me to ...
Melanzio's user avatar
  • 448
1 vote
0 answers
179 views

Given a (finite) poset $(P,\leq)$, we can construct the poset $(\mathcal{D}, \subseteq)$ isomorphic to $P$ simply by letting $\mathcal{D}$ be the collection of all "descendant sets" i.e. $\...
Anna Lindeberg's user avatar
3 votes
1 answer
228 views

I would like to find an example of a lattice $L$ with the following properties: it has $q$ coatoms $x_i$, $1 \le i \le q$; for each coatom $x_i$ let $Y_i = \{y \in L :y \le x_i\} = (x_i]$: it is ...
Fabius Wiesner's user avatar
6 votes
1 answer
320 views

The formulation of the Frankl's conjecture (union-closed conjecture) on lattices is : For any finite lattice $L$ of cardinality $n\geq 2$, there exists a join-irreducible $j$ (called an abundant ...
Adrien Segovia's user avatar
2 votes
1 answer
251 views

Consider a finite lattice $L$ such that each atom has at least $|L|/2$ elements greater than or equal to it. It can be for example a boolean lattice or the following lattice: In the boolean lattice ...
Fabius Wiesner's user avatar
1 vote
1 answer
182 views

Has this been studied? Can we prove that the definition is not equivalent to a first-order statement? Let us say $f\le^b g$ if for any set $S$, if $g$ is bounded on $S$ then so is $f$. (Assume these ...
Bjørn Kjos-Hanssen's user avatar
2 votes
0 answers
175 views

Let $m$ be a natural number with prime factorisation $m=p_1^{a_1}\dots p_r^{a_r}$. I'm interested in a special name for the lattice of divisors of $m$, when all exponents are equal: $a_1=a_2=\dots=a_r$...
Mare's user avatar
  • 28.2k
0 votes
1 answer
146 views

Let $\kappa \geq \aleph_0$ be a cardinal, and let $\newcommand{\Top}{\text{Top}}\Top(\kappa)$ be the complete lattice of all topologies on $\kappa$. For all $\tau\in \Top(\kappa)$ we have $\...
Dominic van der Zypen's user avatar
3 votes
2 answers
249 views

A Girard semilattice is an algebra $\langle A, \wedge, \to, 1\rangle$ of type $\langle2,2,0\rangle$ such that $\langle A, \wedge, 1\rangle$ is a bounded semilattice and the following six conditions ...
Somebody's user avatar
4 votes
3 answers
464 views

Michio Suzuki's monograph "Structure of a Group and the Structure of Its Lattice of Subgroups" discusses the relationship between a group and the lattice of its subgroups. My question is: Is ...
Naif's user avatar
  • 243
1 vote
0 answers
114 views

I am working with a product lattice and trying to show that $$ O(\Sigma L_1) \times O(\Sigma L_2) $$ is a sublattice of $L_3$. I already know that $$ O(\Sigma L_1 \times \Sigma L_2) $$ is a sublattice ...
BTZww's user avatar
  • 141
3 votes
1 answer
188 views

Priestley duality provides an equivalence between the category of bounded distributive lattices $\mathbf{DL}$ and the category of Priestley spaces $\mathbf{Priestley}$, which are compact, totally ...
BTZww's user avatar
  • 141
6 votes
2 answers
448 views

The symmetric group is the automorphism group of the Boolean lattice of an $n$-set. Question: Is there also a "canonical" nice lattice whose automorphism group is equal to the Coxeter group ...
Mare's user avatar
  • 28.2k
10 votes
1 answer
435 views

Recall from model theory that two structures are called elementarily equivalent if they satisfy the same first-order sentences. In other words, two structures $\frak A$ and $\frak B$ of the language $\...
Akiva Weinberger's user avatar
2 votes
0 answers
127 views

It is a well known fact that the sublocales of the locale $L$ are defined by idempoten $\wedge$-semilattice endomorphisms, known as nuclei. Each nucleus $j$ of a locale $L$ also defines a filter $\...
Nik Bren's user avatar
  • 813
0 votes
0 answers
101 views

The vector space $\mathbb{R}^{n}$ has a natural lattice structure: for $\mathbf{a} = (a_1, \dots, a_n)$ and $\mathbf{b} = (b_1, \dots, b_n)$ $\mathbf{a} \wedge \mathbf{b} = (\min(a_1,b_1), \dots, \min(...
Adam Přenosil's user avatar
0 votes
1 answer
189 views

I am basing some of my thesis on Introduction to Boolean Algebras by Givant and Halmos. My current goal is to leverage the countable chain condition to define conditional probability measures. In ...
P. Quinton's user avatar
1 vote
1 answer
132 views

Let $(M, e_1, \times_1, e_2, \times_2)$ be an algebraic structure such that $(M, e_1, \times_1)$ and $(M, e_2, \times_2)$ are monoids $x \times_1 (y \times_2 z) = (x \times_1 y) \times_2 (x \times_1 ...
Keith J. Bauer's user avatar
4 votes
1 answer
245 views

If $(P,\leq)$ is a poset and $x\in X$, we let $\downarrow x = \{p\in P: p \leq x\}$, and $\uparrow x$ is defined dually. The collection $$\Big\{P\setminus (\downarrow x): x\in P\Big\} \cup \Big\{P\...
Dominic van der Zypen's user avatar
13 votes
2 answers
1k views

The notion of Boolean algebras, and the corresponding classical propositional logic, is very standard, and it is easy to find information about them (for example, among many other such works, there is ...
Gro-Tsen's user avatar
  • 38.8k
12 votes
0 answers
598 views

Let $\mathcal F$ be a union-closed family of subsets of $[n]=\{1,2,...n\}$ and $n$ real numbers $x_1,x_2,...,x_n\geq 1$. Conjecture: There exists $k\in [n]$ such that: $$\sum_{k\in A,A\in \mathcal F}\...
Veronica Phan's user avatar
3 votes
0 answers
128 views

In the theory of outer measures, Carathéodory's criterion constructs from an outer measure $\mu^*$ on $X$ a $\sigma$-algebra $\Sigma$ of subsets of $X$, on which the restriction of $\mu^*$ is a ...
Olius's user avatar
  • 203

1
2 3 4 5
11