• Aucun résultat trouvé

Projective Lattices

N/A
N/A
Protected

Academic year: 2022

Partager "Projective Lattices"

Copied!
1
0
0

Texte intégral

(1)

Projective Lattices

Ralph Freese

Department of Mathematics, University of Hawaii Honolulu, HI 96822, USA

ralph@math.hawaii.edu

A latticeL isprojective in a varietyVof lattices if whenever

f :KL (1)

is an epimorphism, there is a homomorphism

g:L→K (2)

such thatf(g(a)) =afor alla∈L.

Projective lattices are characterized in [3] by four conditions. This talk will discuss two of them that are of current interest.

If g in (2) is only required to be order-preserving, it is called an isotone section of the epimorphism (1). We will characterize which lattices L have an isotope section for every epimorphism (1). We will use this to characterize when the ordinal (linear) sum of two projective lattices in V will be projective and give some surprising examples.

The second of the four conditions characterizing projectivity we will discuss is join refinement and the dependency relation; the so-called D-relation. This condition and some closely related concepts are used in many parts of lattice theory. Besides free lattice, projective lattices and finitely presented lattices, it has applications to transferable lattices, congruence lattices of lattices, repre- senting finite lattices as congruence lattices of finite algebras, and ordered direct bases in database theory [1, 2].

References

1. K. Adaricheva, J.B. Nation, and R. Rand. rdered direct implicational basis of a finite closure system. Discrete Applied Math., 161:707–723, 2013.

2. K. Bertet and B. Monjardet. The multiple facets of the canonical direct unit impli- cational basis. Theoret. Comput. Sci., 411(22-24):2155–2166, 2010.

3. Ralph Freese and J. B. Nation. Projective lattices. Pacific J. Math., 75:93–106, 1978.

Références

Documents relatifs

It originates in the observation that the construction of the Boolean algebra of the proof of Theorem A does not rely on the Axiom of Choice (but it has size the continuum), while

Every finite, atomistic, join-semidistributive (resp., lower bounded) lattice L admits a h∨, ∧, 0, 1, at i-embedding with the congruence extension property into some finite,

(ii) We find a large class of lattices, the ω -congruence-finite lattices, that contains all locally finite countable lattices, in which every lattice has a relatively

Proof. This raises the question whether Theorem 2 can be strengthened by requiring that L be an ideal in K. Every lattice L with more than one element has a proper

The Strong Independence Theorem for automorphism groups and congruence lattices of arbitrary lattices.. George Grätzer,

Most known partial neg- ative solutions to CLP are obtained via certain infinitary sentences of the theory of semilattices that hold in all semilattices of the form Con c L, for L

The ℵ 1 bound is optimal, as we find a distributive algebraic lattice D with ℵ 2 compact elements that is not isomorphic to the congruence lattice of any algebra with almost

In this paper we give a strong negative solution to this problem, by proving (Corollary 4.2) that in any non-distributive variety of lattices, if F is any (bounded or not) free