The tag has no wiki summary.

learn more… | top users | synonyms

1
vote
1answer
15 views

Reducing join-incomplete lattice homomorphisms to homomorphisms with co-domain ${\bf 2}$

Let $L$ be an complete lattice. A lattice homomorphism $f: L\to L$ is said to be join-incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) > \bigvee_L f(S).$ Is it true ...
0
votes
0answers
54 views

An equality for the trace of the join of a non-degenerate indecomposable system of projections in a finite factor

Let $M \subset B(H)$ be a finite factor (see for example here p2, or there) with a trace $tr$. The subset of projections of $M$ is naturally a lattice, noted $(\mathcal{P}(M), \wedge, \vee)$. A ...
1
vote
0answers
44 views

An equality for the dimension of the sum of subspaces (in the non-degenerate case) [migrated]

This post is a sequel of An inequality for the dimension of the sum of subspaces, inspired by this famous answer on $\dim(U+V+W)$. The inequality $$\dim(\sum_{i = 1}^{n} U_i) \le \sum_{r=1}^{n} ...
2
votes
1answer
120 views

Is the top interval of a finite distributive lattice an hypercube lattice?

Let $(L,\wedge,\vee)$ be a finite distributive lattice. Let $M$ be the (unique) maximum element. An element $a \in L$ is called maximal if $a \le a' < M$ implies $a = a'$. Let $b = ...
3
votes
0answers
21 views

Characterization of complete lattices with join-incomplete lattice endomorphisms

Let $L$ be an complete lattice. A lattice homomorphism $f: L\to L$ is said to be join-incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) > \bigvee_L f(S).$ How can ...
3
votes
1answer
52 views

Contracting join-incomplete lattice endomorphisms

Let $L$ be an complete lattice. A lattice homomorphism $f: L\to L$ is said to be join-incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) \neq \bigvee_L f(S).$ If $f:L\to ...
3
votes
1answer
43 views

Simplyfing join-incomplete lattice endomorphisms

Let $L$ be an complete lattice. A lattice homomorphism $f: L\to L$ is said to be join-incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) \neq \bigvee_L f(S).$ Is the ...
2
votes
1answer
92 views

Lattices without prime ideals

If $\kappa$ is an infinite cardinal, is there a lattice $L$ of cardinality $\kappa$ such that $L$ contains no prime ideals?
1
vote
1answer
45 views

Lattice homomorphism from ${\cal Id}(L)$ onto $L$

For any lattice $L$ we denote the complete lattice of the ideals of $L$ by ${\cal Id}(L)$. If $L$ is complete, is there a lattice homomorphism from ${\cal Id}(L)$ onto $L$?
2
votes
2answers
102 views

Join-incomplete lattice endomorphisms

Let $L$ be an complete lattice. A lattice homomorphism $f: L\to L$ is said to be join-incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) \neq \bigvee_L f(S).$ Suppose ...
5
votes
1answer
76 views

Incomplete lattice homomorphisms between complete lattices (2)

Let $L, K$ be complete lattices. A lattice homomorphism $f: L\to K$ is said to be incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) \neq \bigvee_K f(S).$ Consider the ...
2
votes
1answer
89 views

Incomplete lattice homomorphisms between complete lattices

Let $L, K$ be complete lattices. A lattice homomorphism $f: L\to K$ is said to be incomplete if there is an infinite set $S \subseteq L$ such that $f(\bigvee_L S) \neq \bigvee_K f(S).$ Suppose that ...
2
votes
2answers
113 views

Embedding finite lattices into the lattice of partitions of a finite set

For any set $X$ we denote by $\text{Part}(X)$ the set of all partitions of $X$, ordered by the refinement ordering. It is well known that this is a complete lattice for all sets $X$. Let $L$ be a ...
4
votes
1answer
146 views

The groups with symmetric subgroups lattice

Let $G$ be a group and $\mathfrak{L}(G)$ be set of all subgroups of $G$. Clearly, $\mathfrak{L} (G)$ is a lattice. If we know that $\mathfrak{L} (G)$ is symmetric then what can be said about the ...
2
votes
1answer
61 views

Set of ideals of the set of finite subsets of $\mathbb{N}$

In any lattice $L$, an ideal is a subset $I\subseteq L$ that is downward closed, and moreover $a,b\in I$ implies $a\vee b\in I$. We denote by ${\cal I}(L)$ the set of ideals of $L$, ordered by set ...
2
votes
1answer
70 views

Dedekind-MacNeille completion of the strictly increasing members of $\omega^\omega$

Let $\omega^\omega$ denote the set of all functions $f:\omega\to\omega$ ordered by $f\leq g$ iff $f(n) \leq g(n)$ for all $n\in \omega$. Set $K = \{f\in \omega^\omega: m<n\in \omega \implies ...
4
votes
1answer
120 views

Is the product of two supermodular functions supermodular?

The definition of Supermodularity is that for every $x′>x$ and $y′>y$, we have \begin{equation*} f(x′,y′)+f(x,y)>f(x′,y)+f(x,y′). \end{equation*} Suppose $f$ and $g$ are supermodular, ...
5
votes
1answer
331 views

Generalization of the fundamental theorem of cyclic groups

Let $G$ be a finite group then the fundamental theorem of cyclic groups can be formulated as follows: Theorem: $G$ is cyclic iff it admits no two different subgroups with the same order. proof: see ...
4
votes
0answers
295 views

Order theory as a foundation of mathematics?

I know the followings kinds of formalization of mathematics: based on set theory (e.g. ZFC) based on type theory (e.g. the formalism of Coq proof assistant, as an advanced example) based on category ...
3
votes
0answers
125 views

A Result of Anders Bjorner: Matchings in countably infinite geometric lattices of finite height

Let $L$ be a countably infinite geometric lattice of finite height $r\ge3$. (A geometric lattice of height $r$ is an atomistic semimodular lattice such that every maximal chain has $r+1$ elements.) ...
4
votes
2answers
211 views

Counterexample on completely distributive lattices

I would like to see an example of a complete lattice $C$ which is both a frame and a dual-frame, i.e. finite meets distribute over arbitrary joins and finite joins distribute over arbitrary meets ...
-3
votes
2answers
82 views

does a lattice have a minimal item [closed]

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 ...
4
votes
0answers
114 views

Are all monomorphisms in the category of bounded lattices regular?

Let $\mathbf{Lat}_{01}$ be the category of bounded lattices with lattice homomorphisms that respect the smallest and the largest element. Is there a monomorphism in $\mathbf{Lat}_{01}$ that is not ...
2
votes
0answers
76 views

About some distributive laws in the Bousfield lattice

It is know that for any $\alpha$-well generated tensor triangulated category $\mathcal{T}$ the collection of Bousfield classes forms a set, furthermore this set is a complete lattice, denoted by ...
4
votes
0answers
79 views

How many subspaces are generated by three or more subspaces in a Hilbert space?

In the book of G. D. Birkhoff "lattice theory", it is mentioned that there are 28 subspaces that can be obtained from three subspaces in general position in a Hilbert space (using intersections and ...
1
vote
3answers
112 views

Finite distributive lattices not contained in $\omega^\omega$

If we consider $\omega^\omega$ as a lattice with component-wise join and meet, is there a finite distributive lattice $L$ so that there is no injective lattice homomorphism $f:L\to\omega^\omega$?
3
votes
1answer
58 views

Is $[0,1]^\kappa$ an affine complete lattice?

A $k$-ary function $f$ on a bounded distributive lattice $L$ is called compatible if for any congruence relation $\theta$ on $L$ and $(a_i, b_i)\in \theta$ for $i=1,\ldots,k$ we always have ...
1
vote
1answer
76 views

What is the smallest partition lattice PART(M) containing the lattice P(N) of subsets of a finite set of N elements

It's been known for 35 years that every finite lattice can be embedded in a finite partition lattice (Pudlak and Tuma, Algebra Universalis 1980, Volume 10, Issue 1, pp. 74--95). I don't follow the ...
2
votes
2answers
104 views

Continuous image relation on topological spaces

Let $\kappa$ be a cardinal, and let $\text{Top}(\kappa)$ be the set of topological spaces $(X,\tau)$ such that $X\subseteq \kappa$. We pre-order $\text{Top}(\kappa)$ by for $X, Y \in ...
7
votes
0answers
139 views

Decidabilty of the Hilbert lattice and quantum logic

What is known about the decidability of (first-order formulas in) the structure $(\mathcal{L}(H),\leq)$, where $\mathcal{L}(H)$ is the collection of all closed linear subspaces of a (separable) ...
2
votes
0answers
47 views

Lattice of subobjects of a particular coproduct

I have the following situation: $\mathcal C$ is a (good enough, say Grothendieck) Abelian category and $F:\mathcal C\to \mathcal C$ is self-equivalence. Given an object $C$ in $\mathcal C$, what can I ...
1
vote
0answers
82 views

Lattice: Join of orthogonal elements is set union?

I am studying a lattice of closed sets generated by an orthogonality relation $\perp$ with set inclusion as ordering relation and meet and join defined as $(A \land B)=A \cap B$ and $(A \lor B) = (A ...
9
votes
2answers
461 views

Can any finite lattice be realized as an intermediate subgroups lattice?

Let $G$ be a finite group and $H$ a subgroup. Let $\mathcal{L}(H \subset G )$ be the lattice of all the intermediate subgroups between $H$ and $G$. Question: Can any finite lattice be realized as ...
0
votes
0answers
47 views

Is the core of an atom in lattice of group topologies a coatom?

Let $(G,\mathcal T)$ be an abelian topological group such that for any nontrivial group topology $\mathcal S$ on $G$ with $\mathcal S\subseteq \mathcal T$ we have $\mathcal S = \mathcal T$. Let ...
1
vote
2answers
94 views

Order-preserving image of a complete lattice

If $L$ is a complete lattice and $P$ is a poset and $f: L\to P$ is an order preserving surjective map, does this imply that $P$ is a (complete) lattice?
-1
votes
1answer
168 views

How to recognize if a lattice is distributive? [closed]

I know that a Boolean lattice must be distributive. But what with these lattices? Are these distributive? $\hskip0.7in$ How to recognize which lattices are distributive or not only by looking on ...
8
votes
0answers
209 views

Is there a notion analogous to separability but requiring definable rather than countable sets?

Among models of $\lambda$-calculus, some like the Bohm tree model have the property that every element is a directed sup of definable elements, whereas others like the $D_\infty$ and $P(\omega)$ ...
0
votes
1answer
61 views

Lower bounds on the rank of a unimodular lattice, given the binlinear pairing of a subset of basis vectors

I have some questions on lower bounds on the rank of unimodular lattices given the bilinear pairing of a subset of its basis is known. Let $\Lambda$ be an odd, unimodular matrix of signature ...
8
votes
1answer
214 views

For any two noncrossing partitions $p, q$ of $n$, is the graph of geodesics from $p$ to $q$ in $NC(n)$ connected?

Let $NC(n)$ denote the lattice of noncrossing partitions of $n$, and let $G$ denote the Hasse diagram of $NC(n)$ with respect to covering relations, viewed as an undirected graph. I'm interested in ...
3
votes
1answer
243 views

When is the homomorphism poset between posets a lattice?

Let $P,Q$ be partially ordered sets (posets). We consider the set $\text{Hom}(P,Q)$ of order-preserving functions $f:P\to Q$. There is a natural ordering relation on $\text{Hom}(P,Q)$ given by $f\leq ...
5
votes
0answers
36 views

Unique representability of bounded distributive lattices

Priestley Duality assigns to every bounded distributive lattice $L$ a compact totally order-disconnected topological space $P(L)$, also called a Priestley space. A poset $(P,\leq)$ is called ...
5
votes
1answer
67 views

Minor ordering for finite graphs

Let $\mathcal{G}_{<\omega}$ be the set of graphs $G = (V,E)$ such that $V = \{0,\ldots,n\}$ for some $n \geq 0$ and $E \subseteq \mathcal{P}_2(V) = \{\{a,b\} : a,b \in V \textrm{ and } a\neq b\}$. ...
1
vote
1answer
58 views

What properties of lattice are preserved in a weak lattice structure [closed]

A lattice structure requires that every two elements have a join and a meet. Suppose we consider instead posets in which for every two elements $x,y$, if there exists an element greater than both of ...
4
votes
2answers
143 views

About a construction of Borel $\sigma$-algebra associated to a lattice

Let $(\mathcal{A}, \cup, \cap)$ a lattice (with minimum and maximum elements $\bot$ and $\top$). Let $X\subset \mathcal{A}$ a generator set (a set of minimal cardinality that generate $\mathcal{A}$ ...
3
votes
1answer
160 views

Uniformizing a relation on ordered sets

Suppose $A$ and $B$ are (complete) ordered sets. Suppose $R\subseteq A\times B$, and $f(a)=\inf\{b : (a,b)\in R\}$ $g(b)=\inf\{a : (a,b)\in R\}$ then what can we call $f$ and $g$? Perhaps there is ...
4
votes
1answer
267 views

Normal subgroup lattice of the group $U_{6n}$

I need to find the normal subgroup lattice of the group $U_{6n} = \langle a,b | a^{2n} = b^ 3= 1, a^{-1}ba = b^{-1}\rangle$. To the best of my knowledge this group was introduced at first by GORDON ...
1
vote
1answer
45 views

When does an orthomodular projection lattice have a non-trivial centre?

When does an orthomodular lattice $L$ of projections onto a given Hilbert space have a non-trivial centre $Z(L)$ and what can we generally say about the cardinality of $Z(L)$?
2
votes
1answer
186 views

Relative Compactness vs Way Below in Locally Compact Hausdorff Spaces

Let $Y$ be a subset of a locally compact Hausdorff topological space $X$ and consider the following properties. $\overline{Y}$ is compact. Every open cover of $X$ has a finite subcover of $Y$. ...
3
votes
1answer
195 views

Cancellative semigroup on a distributive lattice

Let $(S,\le)$ be a distributive lattice. Is there a semigroup structure on $S$ such that $S$ is cancellative and always $(x\wedge y)(x\vee y)=xy$?
1
vote
1answer
90 views

Which Hyperspace Topologies Yield Topological Lattices?

At least on a continuum, the binary operations of intersection and union are Vietoris-continuous. But the Vietoris topology only applies the the collection of NONEMPTY closed subsets, and this means ...