Searcharxiv⌕ Search

arXiv subjects

Friedrich Wehrung

Publications and source records attributed to Friedrich Wehrung.

68 records · Page 4Linked to original sources
arXiv2005

Join-semilattices with two-dimensional congruence amalgamation

We say that a (∨,0)-semilattice S is conditionally co-Brouwerian, if (1) for all nonempty subsets X and Y of S such that X $\leq$ Y (i.e., x $\leq$ y for all (x, y) $\in$ X x Y), there exists z $\in$ S such that X $\leq$ z $\leq$ Y, and (2) for every subset Z of S and all a, b $\in$ S, if a $\leq$ b ∨ z for all z $\in$ Z, then there exists c $\in$ S such that a $\leq$ b ∨ c and c $\leq$ Z. By restricting this definition to subsets X, Y, and Z of less than $κ$ elements, for an infinite cardinal $κ$, we obtain the definition of a conditionally $κ$- co-Brouwerian (∨, 0)-semilattice. We prove that for every conditionally co-Brouwerian lattice S and every partial lattice P, every (∨, 0)-homomorphism $ϕ$: Conc P $\to$ S can be lifted to a lattice homomorphism f : P $\to$ L, for some relatively complemented lattice L. Here, Conc P denotes the (∨, 0)-semilattice of compact congruences of P. We also prove a two-dimensional version of this result, and we establish partial converses of our results and various of their consequences in terms of congruence lattice representation problems. Among those consequences, for every infinite regular cardinal $κ$ and every conditionally $κ$-co-Brouwerian S of size $κ$, there exists a relatively complemented lattice L with zero such that Conc L is isomorphic to S.

math.GM↗
arXiv2005

Direct decompositions of non-algebraic complete lattices

For a given complete lattice L, we investigate whether L can be decomposed as a direct product of directly indecomposable lattices. We prove that this is the case if every element of L is a join of join-irreducible elements and dually, thus extending to non-algebraic lattices a result of L. Libkin. We illustrate this by various examples and counterexamples.

math.GM↗
arXiv2005

Liftings of diagrams of semilattices by diagrams of dimension groups

We investigate categorical and amalgamation properties of the functor Idc assigning to every partially ordered abelian group G its semilattice of compact ideals Idc G. Our main result is the following. Theorem 1. Every diagram of finite Boolean semilattices indexed by a finite dismantlable partially ordered set can be lifted, with respect to the Idc functor, by a diagram of pseudo-simplicial vector spaces. Pseudo-simplicial vector spaces are a special kind of finite-dimensional partially ordered vector spaces (over the rationals) with interpolation. The methods introduced make it also possible to prove the following ring-theoretical result. Theorem 2. For any countable distributive join-semilattices S and T and any field K, any (v,0)-homomorphism $f: S\to T$ can be lifted, with respect to the Idc functor on rings, by a homomorphism $f: A\to B$ of K-algebras, for countably dimensional locally matricial algebras A and B over K. We also state a lattice-theoretical analogue of Theorem 2 (with respect to the Conc functor, and we provide counterexamples to various related statements. In particular, we prove that the result of Theorem 1 cannot be achieved with simplicial vector spaces alone.

math.GM↗
arXiv2005

Unsolvable one-dimensional lifting problems for congruence lattices of lattices

Let S be a distributive {∨, 0}-semilattice. In a previous paper, the second author proved the following result: Suppose that S is a lattice. Let K be a lattice, let $ϕ$: Con K $\to$ S be a {∨, 0}-homomorphism. Then $ϕ$ is, up to isomorphism, of the form Conc f, for a lattice L and a lattice homomorphism f : K $\to$ L. In the statement above, Conc K denotes as usual the {∨, 0}-semilattice of all finitely generated congruences of K. We prove here that this statement characterizes S being a lattice.

math.GM↗
arXiv2005

Forcing extensions of partial lattices

We prove the following result: Let K be a lattice, let D be a distributive lattice with zero, and let $ϕ$: Con K $\to$ D be a {∨, 0}-homomorphism, where Conc K denotes the {∨, 0}-semilattice of all finitely generated congruences of K. Then there are a lattice L, a lattice homomorphism f : K $\to$ L, and an isomorphism $\ga$: Conc L $\to$ D such that $\ga$ Conc f = $ϕ$. Furthermore, L and f satisfy many additional properties, for example: (i) L is relatively complemented. (ii) L has definable principal congruences. (iii) If the range of $ϕ$ is cofinal in D, then the convex sublattice of L generated by f[K] equals L. We mention the following corollaries, that extend many results obtained in the last decades in that area: -- Every lattice K such that Conc K is a lattice admits a congruence-preserving extension into a relatively complemented lattice. -- Every {∨, 0}-direct limit of a countable sequence of distributive lattices with zero is isomorphic to the semilattice of compact congruences of a relatively complemented lattice with zero.

math.GM↗
arXiv2005

Sublattices of lattices of order-convex sets, III. The case of totally ordered sets

For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a positive integer n, we denote by SUB(LO) (resp., SUB(n)) the class of all lattices that can be embedded into a product of lattices of convex subsets of chains (resp., chains with at most n elements). We prove the following results: (1) Both classes SUB(LO) and SUB(n), for any positive integer n, are locally finite, finitely based varieties of lattices, and we find finite equational bases of these varieties. (2) The variety SUB(LO) is the quasivariety join of all the varieties SUB(n), for 1 ≤ n < ω, and it has only countably many subvarieties. We classify these varieties, together with all the finite subdirectly irreducible members of SUB(LO). (3) Every finite subdirectly irreducible member of SUB(LO) is projective within SUB(LO), and every subquasivariety of SUB(LO) is a variety.

math.GM↗
arXiv2005

Sublattices of lattices of order-convex sets, II. Posets of finite length

For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following results: (1) SUBn is a finitely based variety, for any n ≥ 1. (2) SUB2 is locally finite. (3) A finite atomistic lattice L without D-cycles belongs to SUB iff it belongs to SUB2; this result does not extend to the nonatomistic case. (4) SUBn is not locally finite for n ≥ 3.

math.GM↗
arXiv2005

Sublattices of lattices of order-convex sets, I. The main representation theorem

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some lattice of the form Co(P) iff L satisfies (S), (U), and (B). Furthermore, if L has an embedding into some Co(P), then it has such an embedding that preserves the existing bounds. If L is finite, then one can take P finite, of cardinality at most $2n^2-5n+4$, where n is the number of join-irreducible elements of L. On the other hand, the partially ordered set P can be chosen in such a way that there are no infinite bounded chains in P and the undirected graph of the predecessor relation of P is a tree.

math.GM↗
arXiv2005

Sublattices of lattices of convex subsets of vector spaces

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite lower bounded, then V can be taken finite-dimensional, and L embeds into a finite lower bounded lattice of the form $Co(V,Z)=\{X\cap Z | X\in Co(V)\}$, for some finite subset $Z$ of $V$. In particular, we obtain a new universal class for finite lower bounded lattices.

math.GM↗
arXiv2005

Sublattices of complete lattices with continuity conditions

Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice IdS of S is both algebraic and dually algebraic. Furthermore, if there are no infinite D-sequences in J(S), then IdS can be embedded into a direct product of finite lower bounded lattices. We also find a system of infinitary identities that characterize sublattices of complete, lower continuous, and join-semidistributive lattices. These conditions are satisfied by any (not necessarily finitely generated) lower bounded lattice and by any locally finite, join-semidistributive lattice. Furthermore, they imply M. Erné's dual staircase distributivity. On the other hand, we prove that the subspace lattice of any infinite-dimensional vector space cannot be embedded into any countably complete, countably upper continuous, and countably lower continuous lattice. A similar result holds for the lattice of all order-convex subsets of any infinite chain.

math.GM↗
arXiv2005

Semilattices of finitely generated ideals of exchange rings with finite stable rank

We find a distributive (v, 0, 1)-semilattice S of size $ aleph\_1$ that is not isomorphic to the maximal semilattice quotient of any Riesz monoid endowed with an order-unit of finite stable rank. We thus obtain solutions to various open problems in ring theory and in lattice theory. In particular: - There is no exchange ring (thus, no von Neumann regular ring and no C*-algebra of real rank zero) with finite stable rank whose semilattice of finitely generated, idempotent-generated two-sided ideals is isomorphic to S. - There is no locally finite, modular lattice whose semilattice of finitely generated congruences is isomorphic to S. These results are established by constructing an infinitary statement, denoted here by URPsr, that holds in the maximal semilattice quotient of every Riesz monoid endowed with an order-unit of finite stable rank, but not in the semilattice S.

math.GM↗
arXiv2004

Congruence lifting of diagrams of finite Boolean semilattices requires large congruence varieties

We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice $2^4$, such that for any variety V of algebras, if D has a lifting, with respect to the congruence lattice functor, by algebras and homomorphisms in V, then there exists an algebra $U$ in V such that the congruence lattice of $U$ contains, as a 0,1-sublattice, the five-element modular nondistributive lattice $M_3$. In particular, V has an algebra whose congruence lattice is neither join- nor meet-semidistributive. Using earlier work of K.A. Kearnes and A.Szendrei, we also deduce that V has no nontrivial congruence lattice identity. In particular, there is no functor F from finite Boolean semilattices and (v,0,1)-embeddings to lattices and lattice embeddings such that the composition Con F is equivalent to the identity (where Con denotes the congruence lattice functor), thus solving negatively a problem raised by P. Pudlak in 1985 about the existence of a functorial solution of the Congruence Lattice Problem.

math.RA↗
arXiv2004

Lifting retracted diagrams with respect to projectable functors

We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by a lattice, of finite Boolean (v,0)-semilattices with (v,0)-embeddings, can be lifted with respect to the $\Conc$ functor on lattices, then so can every diagram, indexed by a lattice, of finite distributive (v,0)-semilattices with (v,0-embeddings. If the premise of this statement held, this would solve in turn the (still open) problem whether every distributive algebraic lattice is isomorphic to the congruence lattice of a lattice. We also outline potential applications of the method to other functors, such as the $R\mapsto V(R)$ functor on von Neumann regular rings.

math.GM↗