Lattices are partially ordered sets such that a least upper bound and a greatest lower bound can be found for any subset consisting two elements. Lattice theory is an important subfield of order theory.

learn more… | top users | synonyms

0
votes
0answers
2 views

Framing a lattice problem from information available on multiple runs of GLV decomposition

I have posted a similar question here. The GLV method [ref] is used to speed up ECDSA signature generation. In this method, an input scalar $k$ is decomposed into two scalars, $k_1$ and $k_2$. Then ...
1
vote
1answer
27 views

Is there a connection between lattices in the sense of orders and lattices in the sense of groups?

I'm wondering about this for some time now - is there a intuitive connection between those concepts or have they been named the same by chance? In particular, my interest in this question was ...
0
votes
0answers
9 views

Decomposition of a Set System into Distributive Lattices

I would like to decompose an arbitrary set system $S$ over a universe $U$ into a number of distributive lattices such that these lattices partition $S$. Now, I am interested in the least number of ...
1
vote
0answers
5 views

Properties of infimum and supremum w.r.t. conic orders, in particular positive semidefinite matrices

Given a convex cone $\mathcal{K}\subseteq \mathbb{R}^n$, we can define a partial order $\leq_\mathcal{K}$on $ \mathbb{R}^n$ by setting $$x\leq_\mathcal{K} y \Leftrightarrow y-x\in \mathcal{K}.$$ For ...
1
vote
0answers
27 views
+200

coproduct of lattices preserving filtered property of positive elements

Let $L$ be a complete and completely distributive lattice. An element $a\in L$ is well above $0$, denoted by $x\succ 0$, if for all $S\subseteq L$ with $\bigwedge S =0 $, there exists $s\in S$ with ...
2
votes
2answers
67 views

Partial order relation on the group of integers

We know that the usual $\leq$ is a partial order relation on the group of integers $\mathbb Z$ and $\mathbb Z$ is a totally ordered with this partial order relation. Is there any other partially order ...
0
votes
0answers
27 views

What is subgroup lattice of GL$(n,\mathbb F_q)$?

I am trying search for subgroup lattice diagrame for the general linear group GL$_n(\mathbb F_q)$ but could not find any thing in the net. Can some one help me by providng some link on it ? thank ...
0
votes
1answer
67 views

Is this thing a value quantale?

I am currently trying to understand R. C. Flagg's "Quantales and continuity spaces". However I am struggling a bit with his definitions and would like to have a good simple (but not too simple) ...
2
votes
2answers
52 views

Finding subgraph in DAG in which all nodes are smaller than all others

I think my problem might be one of terminology, so let me explain what I am trying to do. Given a direct acyclic graph $G$ interpreted as a partial order, I want to find a subgraph $S$, so that ...
0
votes
0answers
9 views

Generalizing a theorem about filters on a boolean lattice

Let $\mathfrak{A}$ be a bounded distributive lattice with binary meet and join $\sqcap$ and $\sqcup$. I will denote $\partial F = \{ X\in\mathfrak{A} \mid \forall Y\in F: X\sqcap Y\ne \bot \}$ where ...
0
votes
1answer
17 views

How to create lattice diagrame in maple 14?

I am studying lattice diagrame of subgroups of groups and I have already posted one query over here. Now my present query is: I am using MAPLE 14. Can anyone suggest me how to create lattice ...
0
votes
1answer
22 views

What does $C_2^8, C_2^4$ etc in lattice diagrame of subgroup represent?

I am studying lattice diagrame of subgroups of groups. and I came to know about the lattices of $C_4\times C_2$ and $C_8\times C_2$ over here and here. But the problem is: I am unable to understand ...
1
vote
1answer
21 views

Intersection of two filters on a poset

Fix a poset. A filter on the poset is its nonempty subset which is both a down-directed set and an upper set. Conjecture Intersection of two filters is also a filter. I have proved this conjecture ...
1
vote
1answer
30 views

Does the subnormal subgroups always form a lattice?

Let $G$ be a group and $W(G)$ the set of all subnormal subgroups of $G$, partially ordered by inclusion. My question is if $W(G)$ always forms a lattice (but not necessarily a sublattice of $L(G)$). ...
0
votes
1answer
21 views

Is $(\mathbb{Z} \cup \{-\infty, \infty\},\leq)$ a complete lattice?

I read that $\mathbb{Z}$ is not a complete lattice because it has no greatest lower bound (and lub). If we define $-\infty$, $\infty$ to be integers, i.e., include them in $\mathbb{Z}$, does ...
3
votes
0answers
43 views

The groups with symmetric subgroups lattice

Let $G$ be a group and $\frak L (G)$ be set of all subgroups of $G$. Clearly, $\frak L (G)$ is a lattice. If we know that $\frak L (G)$ is symmetric then what can be said about the group $G$ ? Any ...
0
votes
0answers
50 views

Quotients vs equivalence relations

In a recent preprint I defined the category of quasi-frames (qframes for short) as follows: a qframe is a modular and upper continuous complete lattice; a morphism of qframes $f:L_1\to L_2$ is a map ...
3
votes
1answer
23 views

Ternary algebra satisfying some identities is a join-semilattice

A join-semilattice with greatest element is an algebra $(S,\vee, 1)$ of type $(2,0)$ such that $\vee$ is idempotent, commutative, and associative, and $a\vee 1=1$ for all $a\in A$. Now, let ...
4
votes
1answer
56 views

A complemented lattice satisfying de Morgan's laws is an ortholattice?

Suppose you have a bounded, complemented lattice $\mathfrak{L} = \left<L, \vee, \wedge, \neg, 1, 0\right>$ that satisfies De Morgan's laws. I want to prove that this is an ortholattice. The ...
1
vote
1answer
19 views

Is the congruence relations lattice of a lattice a sublattice of all equivalence relations on it?

By this Wikipedia link, it seem the set of all congruence relaions on a lattice $(X,\le)$ is a complete lattice with inclusion. Is this lattice a (complete) sublattice of the lattice of all ...
2
votes
1answer
74 views

Characterizing affine subspaces order-theoretically

Let $V$ denote a real vectorspace and $\mathrm{Con}(V)$ denote the poset of convex subsets of $V$. The goal is to identify those elements of $\mathrm{Con}(V)$ that happen to be affine subspaces of $V$ ...
0
votes
1answer
20 views

A distributive lattice with finite length must have a finite number of join-irreducible elements.

Let $L$ be a distributive lattice. Let $\mathcal{J}(L)$ be the set of all join-irreducible elements. Recall that $x$ is join-irreducible if $x \neq 0$ and $x = a \vee b$ implies that $x = a$ or $x = ...
2
votes
2answers
45 views

A question on Join homomorphism and Ideals

On page 287 of the book Mathematical Methods in Linguistcs, by Barbara Partee, Alice Ter Meulen and Robert E. Wall (Dordrecht, Kluwer Academic Press, 1993), I find the following theorem, which they ...
2
votes
1answer
68 views

Is there a cyclic subgroup C of S8 such that the interval lattice [C,S8] is distributive?

I've checked by hand that for any $n \le 7$, there is a cyclic subgroup $C$ of $S_n$ such that the intermediate subgroups lattice $\mathcal{L}(C \subset S_n)$ is distributive. Question: Is it the ...
0
votes
0answers
8 views

proving properties of (graph) dominance defined via a system of equations

Some notions on graphs can be defined via a system of equations with values in a lattice. For example, dominance $d(v_1, v_0)$ ($v_1$ dominates $v_0$) in a graph $g$ is defined by a system $\forall ...
0
votes
0answers
26 views

Representing a Concept

From Formal Concept Analysis: If I have a set of objects: G={Shark, Penguin, Bat} and a set of attributes: M={Breathe Underwater, Can Fly, has Vertebrae} and I make a chart to represent my ...
1
vote
1answer
17 views

Does disjunction of two Boolean algebra cuts always produce their ideal sum?

Let $(B, 0, 1, \leq, \wedge, \vee, \neg)$ be a Boolean algebra. For a subset $A \subseteq B,$ denote by $L(A) = \{l \in B \mid (\forall a\in A) \, l \leq a\}$ the set of all lower bounds of $A,$ and ...
0
votes
0answers
11 views

Is orthocomplementation unique in a weakly modular lattice?

I've read in [1] that an equivalent definition of weak modularity in a lattice is that the orthocomplementation is unique in that lattice. However this is just stated without proof and I can't manage ...
1
vote
2answers
44 views

Is Least Upper Bound of Empty Set equal to Greatest Lower Bound of a another Set?

We had this discussion today that $\operatorname{LUB}(\varnothing) = \operatorname{GLB}(L)$ in a complete lattice $(L,\leq)$. I'm not still not getting it why that is the case.
-1
votes
1answer
15 views

from linear extension to partial order

Going from partial order to a linear one is easy, we just do topological ordering. I am wondering about the other way around. In particular: let $>$ be a linear order over a set $A$. Let $\Gamma$ ...
2
votes
0answers
32 views

What are conditions for Tarski's fixed point theorem so that greatest and least fixed points are not the same?

Tarski's fixed point theorem claims that for any monotone function on a complete lattice there are least and greatest fixed points (or more generally, that the set of fixed points is a complete ...
0
votes
2answers
15 views

Lattice orders and number of elements in a set

My discrete mathematics lecture notes give the following definition of a lattice order: A 'Partial order R is a lattice order if the set of lower bounds for any two elements $x, y ∈ X$ has the ...
1
vote
0answers
69 views

Three theorems for the price of one? (like duality)

Why the notion of "duality" (when we get two theorems for the price of one) are ubiquitous in mathematics (order and lattice theory, category theory, group theory), but "triality" (three theorems for ...
2
votes
1answer
111 views

A chain with more than two elements

A chain with two elements $0$ & $1$ is complemented as complement of $0$ is $1$ and that of $1$ is $0$.How to show that every chain with more than two elements is not complemented?
0
votes
0answers
15 views

some distributive laws in the Bousfield lattice

It is know that for any α-well generated tensor triangulated category T the collection of Bousfield classes forms a set, furthermore this set is a complete lattice, denoted by B(T), and this lattice ...
5
votes
1answer
95 views

Restriction of a monotone self-map (“endomorphism of $\mathbf{Pos}$”) to a wide subposet

Here's a poset, call it $P.$ $\hspace{1cm}$ Define a function $S : P \rightarrow P$ as follows. $$S(0) = 1, \qquad S(1) = 2, \qquad S(2) = 2$$ Clearly, $S$ is monotone. Now consider the following ...
1
vote
0answers
43 views

Proving Crapo's Lemma

Let $L$ be a finite lattice with least and greatest elements $0, 1$, respectively, and let $X\subseteq L$. Let $n_k$ be the number of $k$-element subsets of $X$ with join $1$ and meet $0$. I want to ...
0
votes
1answer
18 views

Sets of non-complements elements in a lattice.

Let $L$ be a finite lattice with a least element $0$ and a greatest element $1$, where $0\neq 1$. Fix a $t\in L$, and let $X$ be the set of non-complements of $t$, i.e., the set of all $x$ such that ...
4
votes
3answers
69 views

What are some illustrative examples that demonstrate how $\succ$ can differ in behavior from $>$ and/or $\geq$?

I really, really want to understand the generalization of metric spaces known as continuity spaces. Unfortunately, I always get tripped up right at the beginning. The problem is that I have little or ...
0
votes
0answers
8 views

Correct definition of subframe

Given a frame $L$, is the following the correct definition of sub-frame? $S\subseteq L$ is a subframe if $0,1\in S$; $x,y \in S$ implies $x\land y \in S$; $S'\subseteq S$ \implies $\bigvee_L S'\in ...
1
vote
2answers
29 views

Obout the poset of subspaces of the vector space $\mathbb{R}$ over $\mathbb{Q}$.

Let $L$ the set of all subspaces of the vector space $\mathbb{R}$ over $\mathbb{Q}$, ordered by the set strict inclusion: $V_1<V_2$ iff $\{x\in V_1 \Rightarrow x \in V_2$ and there exists $y \in ...
2
votes
1answer
15 views

does a lattice have a minimal item

A lattice (L, ≤) is a partially ordered set, where each two elements of the set have a least upper bound and a greatest lower bound. Let's consider the situation where L is finite. I think that this ...
4
votes
1answer
56 views

Does the “equality semigroup” have an accepted name?

Given a set $G$, we get a semigroup on $G \cup \{0\}$ as follows: Define $x^2 = x$ for all $x \in G \cup \{0\}$. Define $xy = 0$ for all distinct $x,y \in G \cup \{0\}$. Question 0. Does this ...
1
vote
0answers
66 views

When is the direct product of two cores itself a core?

Given graphs $X$ and $Y$, a graph homomorphism $f : X \to Y$ is a function $f : V(X) \to V(Y)$ such that if $uv \in X$, then $f(u)f(v) \in E(Y)$—that is, it is a function of the vertices mapping ...
0
votes
1answer
86 views

is differ between distributive lattice vs semi-lattice on Turing Degrees

We know a Posed Closed under suprema but not necessarily under infima is an upper semi-lattice. We now r.e set forms a distributive lattice. But my question is why following statement is hold? I ...
2
votes
1answer
29 views

lattices made by $a\wedge b = ab$ and $a\vee b=a+b-ab$

We define the binary operations $\vee$ and $\wedge$ on $\Bbb R$ by $a\wedge b = ab$ and $a\vee b=a+b-ab$. Then for $A=\{0\}$ and $A=\{1\}$ and $A=\{0,1\}$, the set $(A,\wedge,\vee)$ is a lattice. Is ...
1
vote
0answers
43 views

Least upper bound and greatest lower bound of the void set.

Let $(L,\ge)$ a partially ordered set. Suppose that for avery $S \subset L$, there exists an element $LUB(S)= a$ such that $x \ge a \iff x \ge u \quad \forall u \in S$ and, with the obvious meaning of ...
0
votes
1answer
33 views

Birkhoff's definition of semilattice?

could anyone provide me with the original definition of semilattice by Garrett Birkhoff in his book on lattices? If you could also provide, page number and edition, it would be great (as well as some ...
5
votes
1answer
40 views

Function on a Power Set

Let $f\colon \mathcal{P}(A)\mapsto \mathcal{P}(A)$ be a function such that $U \subseteq V$ implies $f(U) \subseteq f(V)$ for every $U, V \in \mathcal{P}(A)$. Show there exists a $W \in \mathcal{P}(A)$ ...
7
votes
0answers
75 views

Showing that poset of set of supports of a vector space is semimodular

Let $W$ be a subspace of the vector space $\mathbb{K}^n$, where $\mathbb{K}$ is a field of characteristic $0$. The support of a vector $v = (v_1,\ldots, v_n) \in \mathbb{K}^n$ is given by ...