SearcharxivSearch

arXiv subjects

Friedrich Wehrung

Publications and source records attributed to Friedrich Wehrung.

At least 19 recordsLinked to original sources

Is addition definable from multiplication and successor?

A map $f\colon R\to S$ between (associative, unital, but not necessarily commutative) rings is a\emph{brachymorphism} if $f(1+x)=1+f(x)$ and $f(xy)=f(x)f(y)$ whenever $x,y\in R$. We tackle the problem whether every brachymorphism is additive (i.e., $f(x+y)=f(x)+f(y)$), showing that in many contexts, including the following, the answer is positive: $R$ is finite (or, more generally, $R$ is left or right Artinian); $R$ is any ring of $2\times2$ matrices over a commutative ring; $R$ is Engelian; every element of $R$ is a sum of $π$-regular and central elements (this applies to $π$-regular rings, Banach algebras, and power series rings); $R$ is the full matrix ring of order greater than $1$ over any ring; $R$ is the monoid ring $K[M]$ for a commutative ring $K$ and a $π$-regular monoid $M$; $R$ is the Weyl algebra $A_1(K)$ over a commutative ring $K$ with positive characteristic; $f$ is the power function $x\mapsto x^n$ over any ring; $f$ is the determinant function over any ring $R$ of $n\times n$ matrices, with $n\geq3$, over a commutative ring, such that if $n>3$ then $R$ contains $n$ scalar matrices with non zero divisor differences.

math.RA

Monotone-Cevian and finitely separable lattices

A distributive lattice with zero is completely normal if its prime ideals form a root system under set inclusion.Every such lattice admits a binary operation (x,y) \mapsto x-y satisfying the rules x \leq y\vee (x-y) and (x-y) \wedge (y-x)=0 -- in short a deviation.In this paper we study the following additional properties of deviations: monotone (i.e., isotone in x and antitone in y) and Cevian (i.e., x-z \leq (x-y) \vee (y-z)).We relate those matters to finite separability as defined by Freese and Nation.We prove that every finitely separable completely normal lattice has a monotone deviation.We pay special attention to lattices of principal l-ideals of Abelian l-groups (which are always completely normal).We prove that for free Abelian l-groups (and also free vectorlattices) those lattices admit monotone Cevian deviations.On the other hand, we construct an Archimedean l-group with strong unit whose principal l-ideal lattice does not have a monotone deviation.

math.LO

A solution to the MV-spectrum Problem in size aleph one

Denote by Id$_c G$ the lattice of all principal $\ell$-ideals of an Abelian $\ell$-group $G$. Our main result is the following. Theorem. For every countable Abelian $\ell$-group $G$, every countable completely normal distributive 0-lattice $L,$ and every closed 0-lattice homomorphism $φ: {\rm Id}_c G \to L$, there are a countable Abelian $\ell$-group $H$, an $\ell$-homomorphism $f: G \to H$, and a lattice isomorphism $ι: {\rm Id}_c H \to L$ such that $φ= ι\circ {\rm Id}_c f$. We record the following consequences of that result: (1) A 0-lattice homomorphism $φ: K \to L$, between countable completely normal distributive 0-lattices, can be represented, with respect to the functor Id$_c$, by an $\ell$-homomorphism of Abelian $\ell$-groups iff it is closed. (2) A distributive 0-lattice $D$ of cardinality at most $\aleph_1$ is isomorphic to some Id$_c G$ iff $D$ is completely normal and for all $a,b \in D$ the set $\{x\in D | a \leq b \vee x$ has a countable coinitial subset. This solves Mundici's MV-spectrum Problem for cardinalities up to $\aleph_1$. The bound $\aleph_1$ is sharp. Item (1) is extended to commutative diagrams indexed by forests in which every node has countable height.All our results are stated in terms of vector lattices over any countable totally ordered division ring.

math.LO

Spectral subspaces of spectra of Abelian lattice-ordered groups in size aleph one

It is well known that the lattice Idc G of all principal {\ell}-ideals of any Abelian {\ell}-group G is a completely normal distributive 0-lattice, and that not every completely normal distributive 0-lattice is a homomorphic image of some Idc G, via a counterexample of cardinality $\aleph 2. We prove that every completely normal distributive 0-lattice with at most $\aleph 1 elements is a homomorphic image of some Idc G. By Stone duality, this means that every completely normal generalized spectral space, with at most $\aleph 1 compact open sets, is homeomorphic to a spectral subspace of the {\ell}-spectrum of some Abelian {\ell}-group.

math.LO

From non-commutative diagrams to anti-elementary classes

Anti-elementarity is a strong way of ensuring that a class of structures , in a given first-order language, is not closed under elementary equivalence with respect to any infinitary language of the form L $\infty$$λ$. We prove that many naturally defined classes are anti-elementary, including the following: $\bullet$ the class of all lattices of finitely generated convex {\ell}-subgroups of members of any class of {\ell}-groups containing all Archimedean {\ell}-groups; $\bullet$ the class of all semilattices of finitely generated {\ell}-ideals of members of any nontrivial quasivariety of {\ell}-groups; $\bullet$ the class of all Stone duals of spectra of MV-algebras-this yields a negative solution for the MV-spectrum Problem; $\bullet$ the class of all semilattices of finitely generated two-sided ideals of rings; $\bullet$ the class of all semilattices of finitely generated submodules of modules; $\bullet$ the class of all monoids encoding the nonstable $K_0$-theory of von Neumann regular rings, respectively C*-algebras of real rank zero; $\bullet$ (assuming arbitrarily large Erd"os cardinals) the class of all coordinatizable sectionally complemented modular lattices with a large 4-frame. The main underlying principle is that under quite general conditions, for a functor $Φ$ : A $\rightarrow$ B, if there exists a non-commutative diagram D of A, indexed by a common sort of poset called an almost join-semilattice, such that $\bullet$ $Φ$ D^I is a commutative diagram for every set I, $\bullet$ $Φ$ D is not isomorphic to $Φ$ X for any commutative diagram X in A, then the range of $Φ$ is anti-elementary.

math.CT

Cevian operations on distributive lattices

We construct a completely normal bounded distributive lattice D in which for every pair (a, b) of elements, the set {x $\in$ D | a $\le$ b $\lor$ x} has a countable coinitial subset, such that D does not carry any binary operation - satisfying the identities x $\le$ y $\lor$(x-y),(x-y)$\land$(y-x) = 0, and x-z $\le$ (x-y)$\lor$(y-z). In particular, D is not a homomorphic image of the lattice of all finitely generated convex {\ell}-subgroups of any (not necessarily Abelian) {\ell}-group. It has $\aleph 2 elements. This solves negatively a few problems stated by Iberkleid, Mart{í}nez, and McGovern in 2011 and recently by the author. This work also serves as preparation for a forthcoming paper in which we prove that for any infinite cardinal $λ$, the class of Stone duals of spectra of all Abelian {\ell}-groups with order-unit is not closed under L $\infty$$λ$-elementary equivalence.

math.RA

Gcd-monoids arising from homotopy groupoids

The interval monoid $Υ$(P) of a poset P is defined by generators [x, y], where x $\le$ y in P , and relations [x, x] = 1, [x, z] = [x, y] $\times$ [y, z] for x $\le$ y $\le$ z. It embeds into its universal group $Υ$ $\pm$ (P), the interval group of P , which is also the universal group of the homotopy groupoid of the chain complex of P. We prove the following results: $\bullet$ The monoid $Υ$(P) has finite left and right greatest common divisors of pairs (we say that it is a gcd-monoid) iff every principal ideal (resp., filter) of P is a join-semilattice (resp., a meet-semilattice). $\bullet$ For every group G, there is a poset P of length 2 such that $Υ$(P) is a gcd-monoid and G is a free factor of $Υ$ $\pm$ (P) by a free group. Moreover, P can be taken finite iff G is finitely presented. $\bullet$ For every finite poset P , the monoid $Υ$(P) can be embedded into a free monoid. $\bullet$ Some of the results above, and many related ones, can be extended from interval monoids to the universal monoid Umon(S) of any category S. This enables us, in particular, to characterize the embeddability of Umon(S) into a group, by stating that it holds at the hom-set level. We thus obtain new easily verified sufficient conditions for embeddability of a monoid into a group. We illustrate our results by various examples and counterexamples.

math.GR

Spectral spaces of countable abelian lattice-ordered groups

A compact topological space X is spectral if it is sober (i.e., every irreducible closed set is the closure of a unique singleton) and the compact open subsets of X form a basis of the topology of X, closed under finite intersections. Theorem. A topological space X is homeomorphic to the spectrum of some countable Abelian {\ell}-group with unit (resp., MV-algebra) iff X is spectral, has a countable basis of open sets, and for any points x and y in the closure of a singleton {z}, either x is in the closure of {y} or y is in the closure of {x}. We establish this result by proving that a countable distributive lattice D with zero is isomorphic to the lattice of all principal ideals of an Abelian {\ell}-group (we say that D is {\ell}-representable) iff for all a, b $\in$ D there are x, y $\in$ D such that a $\lor$ b = a $\lor$ y = b $\lor$ x and x $\land$ y = 0. On the other hand, we construct a non-{\ell}-representable bounded distributive lattice, of cardinality $\aleph$ 1 , with an {\ell}-representable countable L$\infty, ω$-elementary sublattice. In particular, there is no characterization, of the class of all {\ell}-representable distributive lattices, in arbitrary cardinality, by any class of L$\infty, ω$ sentences.

math.RA

Real spectrum versus $\ell$-spectrum via Brumfiel spectrum

It is well known that the real spectrum of any commutative unital ring, and the ${\ell}$-spectrum of any Abelian lattice-ordered group with order-unit, are all completely normal spectral spaces. We prove the following results: (1) Every real spectrum can be embedded, as a spectral subspace, into some ${\ell}$-spectrum. (2) Not every real spectrum is an ${\ell}$-spectrum. (3) A spectral subspace of a real spectrum may not be a real spectrum. (4) Not every ${\ell}$-spectrum can be embedded, as a spectral subspace, into a real spectrum. (5) There exists a completely normal spectral space which cannot be embedded , as a spectral subspace, into any ${\ell}$-spectrum. The commutative unital rings and Abelian lattice-ordered groups in (2), (3), (4) all have cardinality $\aleph 1 $, while the spectral space of (5) has a basis of cardinality $\aleph 2$. Moreover, (3) solves a problem by Mellor and Tressl.

math.RA

Multifraction reduction III: The case of interval monoids

We investigate gcd-monoids, which are cancellative monoids in which any two elements admit a left and a right gcd, and the associated reduction of multifractions (arXiv:1606.08991 and 1606.08995), a general approach to the word problem for the enveloping group. Here we consider the particular case of interval monoids associated with finite posets. In this way, we construct gcd-monoids, in which reduction of multifractions has prescribed properties not yet known to be compatible: semi-convergence of reduction without convergence, semi-convergence up to some level but not beyond, non-embeddability into the enveloping group (a strong negation of semi-convergence).

math.GR

Relative projectivity and transferability for partial lattices

A partial lattice P is ideal-projective, with respect to a class C of lattices, if for every K $\in$ C and every homomorphism $ϕ$ of partial lattices from P to the ideal lattice of K, there are arbitrarily large choice functions f : P $\rightarrow$ K for $ϕ$ that are also homomorphisms of partial lattices. This extends the traditional concept of (sharp) transferability of a lattice with respect to C. We prove the following: (1) A finite lattice P, belonging to a variety V, is sharply transferable with respect to V iff it is projective with respect to V and weakly distributive lattice homomorphisms, iff it is ideal-projective with respect to V. (2) Every finite distributive lattice is sharply transferable with respect to the class R mod of all relatively complemented modular lattices. (3) The gluing D 4 of two squares, the top of one being identified with the bottom of the other one, is sharply transferable with respect to a variety V iff V is contained in the variety M$ω$ generated by all lattices of length 2. (4) D 4 is projective, but not ideal-projective, with respect to R mod. (5) D 4 is transferable, but not sharply transferable, with respect to the variety M of all modular lattices. This solves a 1978 problem of G. Grätzer. (6) We construct a modular lattice whose canonical embedding into its ideal lattice is not pure. This solves a 1974 problem of E. Nelson.

math.CO

Varieties of Boolean inverse semigroups

In an earlier work, the author observed that Boolean inverse semi-groups, with semigroup homomorphisms preserving finite orthogonal joins, form a congruence-permutable variety of algebras, called biases. We give a full description of varieties of biases in terms of varieties of groups: (1) Every free bias is residually finite. In particular, the word problem for free biases is decidable. (2) Every proper variety of biases contains a largest finite symmetric inverse semigroup, and it is generated by its members that are generalized rook matrices over groups with zero. (3) There is an order-preserving, one-to-one correspondence between proper varieties of biases and certain finite sequences of varieties of groups, descending in a strong sense defined in terms of wreath products by finite symmetric groups.

math.GR

Lattices of regular closed subsets of closure spaces

For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex geometry, then Reg(P,f) is pseudocomplemented. The Dedekind-MacNeille completion of the poset of regions of any central hyperplane arrangement can be obtained in this way, hence it is pseudocomplemented. The lattice Reg(P,f) carries a particularly interesting structure for special types of convex geometries, that we call closure spaces of semilattice type. For finite such closure spaces, (1) Reg(P,f) satisfies an infinite collection of stronger and stronger quasi-identities, weaker than both meet- and join-semidistributivity. Nevertheless it may fail semidistributivity. (2) If Reg(P,f) is semidistributive, then it is a bounded homomorphic image of a free lattice. (3) Clop(P,f) is a lattice iff every regular closed set is clopen. The extended permutohedron R(G) on a graph G, and the extended permutohedron Reg(S) on a join-semilattice S, are both defined as lattices of regular closed sets of suitable closure spaces. While the lattice of regular closed sets is, in the semilattice context, always the Dedekind Mac-Neille completion of the poset of clopen sets, this does not always hold in the graph context, although it always does so for finite block graphs and for cycles. Furthermore, both R(G) and Reg(S) are bounded homomorphic images of free lattices.

math.CO

Sublattices of associahedra and permutohedra

Grätzer asked in 1971 for a characterization of sublattices of Tamari lattices (associahedra). A natural candidate was coined by McKenzie in 1972 with the notion of a bounded homomorphic image of a free lattice---in short, bounded lattice. Urquhart proved in 1978 that every associahedron is bounded (thus so are its sublattices). Geyer conjectured in 1994 that every finite bounded lattice embeds into some associahedron. We disprove Geyer's conjecture, by introducing an infinite collection of lattice-theoretical identities that hold in every associahedron, but not in every finite bounded lattice. Among those finite counterexamples, there are the permutohedron on four letters P(4), and in fact two of its subdirectly irreducible retracts, which are Cambrian lattices of type A. For natural numbers m and n, we denote by B(m,n) the (bounded) lattice obtained by doubling a join of m atoms in an (m+n)-atom Boolean lattice. We prove that B(m,n) embeds into an associahedron iff min(m,n) is less than or equal to 1, and that B(m,n) embeds into a permutohedron iff min(m,n) is less than or equal to 2. In particular, B(3,3) cannot be embedded into any permutohedron. Nevertheless we prove that B(3,3) is a homomorphic image of a sublattice of the permutohedron on 12 letters.

math.CO

The extended permutohedron on a transitive binary relation

For a given transitive binary relation e on a set E, the transitive closures of open (i.e., co-transitive in e) sets, called the regular closed subsets, form an ortholattice Reg(e), the extended permutohedron on e. This construction, which contains the poset Clop(e) of all clopen sets, is a common generalization of known notions such as the generalized permutohedron on a partially ordered set on the one hand, and the bipartition lattice on a set on the other hand. We obtain a precise description of the completely join-irreducible (resp., completely meet-irreducible) elements of Reg(e) and the arrow relations between them. In particular, we prove that (1) Reg(e) is the Dedekind-MacNeille completion of the poset Clop(e); (2) Every open subset of e is a set-theoretic union of completely join-irreducible clopen subsets of e; (3) Clop(e) is a lattice iiff every regular closed subset of e is clopen, iff e contains no "square" configuration, iff Reg(e)=Clop(e); (4) If e is finite, then Reg(e) is pseudocomplemented iff it is semidistributive, iff it is a bounded homomorphic image of a free lattice, iff e is a disjoint sum of antisymmetric transitive relations and two-element full relations. We illustrate the strength of our results by proving that, for n greater than or equal to 3, the congruence lattice of the lattice Bip(n) of all bipartitions of an n-element set is obtained by adding a new top element to a Boolean lattice with n2^{n-1} atoms. We also determine the factors of the minimal subdirect decomposition of Bip(n).

math.CO

Lifting defects for nonstable K_0-theory of exchange rings and C*-algebras

The assignment (nonstable K_0-theory), that to a ring R associates the monoid V(R) of Murray-von Neumann equivalence classes of idempotent infinite matrices with only finitely nonzero entries over R, extends naturally to a functor. We prove the following lifting properties of that functor: (1) There is no functor F, from simplicial monoids with order-unit with normalized positive homomorphisms to exchange rings, such that VF is equivalent to the identity. (2) There is no functor F, from simplicial monoids with order-unit with normalized positive embeddings to C*-algebras of real rank 0 (resp., von Neumann regular rings), such that VF is equivalent to the identity. (3) There is a {0,1}^3-indexed commutative diagram D of simplicial monoids that can be lifted, with respect to the functor V, by exchange rings and by C*-algebras of real rank 1, but not by semiprimitive exchange rings, thus neither by regular rings nor by C*-algebras of real rank 0. By using categorical tools from an earlier paper (larders, lifters, CLL), we deduce that there exists a unital exchange ring of cardinality aleph three (resp., an aleph three-separable unital C*-algebra of real rank 1) R, with stable rank 1 and index of nilpotence 2, such that V(R) is the positive cone of a dimension group and V(R) is not isomorphic to V(B) for any ring B which is either a C*-algebra of real rank 0 or a regular ring.

math.OA

Varieties of lattices with geometric descriptions

A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved. Herrmann, Pickering, and Roddy proved in 1994 that every modular lattice can be embedded, within its variety, into an algebraic and spatial lattice. We extend this result to n-distributive lattices, for fixed n. We deduce that the variety of all n-distributive lattices is generated by its finite members, thus it has a decidable word problem. This solves two problems stated by Huhn in 1985. We prove that every modular (resp., n-distributive) lattice embeds within its variety into some strongly spatial lattice. Every lattice which is either algebraic modular spatial or bi-algebraic is strongly spatial. We also construct a lattice that cannot be embedded, within its variety, into any algebraic and spatial lattice. This lattice has a least and a largest element, and it generates a locally finite, join-semidistributive variety.

math.RA

From objects to diagrams for ranges of functors

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to transfer this statement to diagrams of A. These diagrams are all indexed by posets in which every principal ideal is a join-semilattice and the set of all upper bounds of any finite subset is a finitely generated upper subset. Various consequences follow, in particular: (1) The Grätzer-Schmidt Theorem, which states that every algebraic lattice is isomorphic to the congruence lattice of some algebra, can be extended to finite poset-indexed diagrams of algebraic lattices and compactness-preserving complete join-homomorphisms (and no finiteness restriction if there are large enough cardinals). (2) In a host of situations, the relative critical point between two locally finite quasivarieties is either less than aleph omega or equal to infinity. (3) A lattice of cardinality aleph 1 may not have any congruence-permutable, congruence-preserving extension.

math.CT