This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details.(November 2011) (Learn how and when to remove this message)
A congruence θ of a join-semilattice S is monomial, if the θ-equivalence class of any element of S has a largest element. We say that θ is distributive, if it is a join, in the congruence lattice Con S of S, of monomial join-congruences of S.
The following definition originates in Schmidt's 1968 work and was subsequently adjusted by Wehrung.
Definition (weakly distributive homomorphisms). A homomorphism
μ : S → T between join-semilattices S and T is weakly distributive, if for all a, b in S and all c in T such that μ(c) ≤ a ∨ b, there are elements x and y of S such that c ≤ x ∨ y, μ(x) ≤ a, and μ(y) ≤ b.
Examples:
(1) For an algebra B and a reductA of B (that is, an algebra with same underlying set as B but whose set of operations is a subset of the one of B), the canonical (∨, 0)-homomorphism from ConcA to ConcB is weakly distributive. Here, ConcA denotes the (∨, 0)-semilattice of all compact congruences of A.
(2) For a convex sublattice K of a lattice L, the canonical (∨, 0)-homomorphism from ConcK to ConcL is weakly distributive.
and 20 Related for: Distributive homomorphism information
Definition (weakly distributivehomomorphisms). A homomorphism μ : S → T between join-semilattices S and T is weakly distributive, if for all a, b in...
Then, for a homomorphism f : G → H, (f(u),f(v)) is an arc (directed edge) of H whenever (u,v) is an arc of G. There is an injective homomorphism from G to...
operations left distributivity and right distributivity are not equivalent, and require separate proofs. Given K-algebras A and B, a homomorphism of K-algebras...
can be found in the article Distributivity (order theory). A morphism of distributive lattices is just a lattice homomorphism as given in the article on...
and (T, ∨), a homomorphism of (join-) semilattices is a function f: S → T such that f(x ∨ y) = f(x) ∨ f(y). Hence f is just a homomorphism of the two semigroups...
homomorphic image under a weakly distributivehomomorphism (which is also easy), and (3) that there exists a distributive (∨,0)-semilattice of cardinality...
duality theory for distributive lattices provides three different (but closely related) representations of bounded distributive lattices via Priestley...
all elements x of P and all subsets S of P, the following infinite distributivity law holds: x ∧ ⋁ s ∈ S s = ⋁ s ∈ S ( x ∧ s ) . {\displaystyle x\land...
completely distributive lattice M and monotonic function f : C → M {\displaystyle f:C\rightarrow M} , there is a unique complete homomorphism f ϕ ∗ : L...
Distributivity An operation ∗ {\displaystyle *} is distributive with respect to another operation + {\displaystyle +} if it is both left distributive...
word, was coined), in a 1982 paper by Sergei Matveev (under the name distributive groupoids) and in a 1986 conference paper by Egbert Brieskorn (where...
function f: L→M between two complete lattices L and M is a complete homomorphism if f ( ⋀ A ) = ⋀ { f ( a ) ∣ a ∈ A } {\displaystyle f\left(\bigwedge...
of a frame, a complete lattice satisfying the general distributive law above. Frame homomorphisms are maps between frames that respect all joins (in particular...
commutativity is crucial here; it ensures that the sum of two group homomorphisms is again a homomorphism. In contrast, the category of all groups is not closed....
{\displaystyle P\mapsto P(a)} defines an algebra homomorphism from K[X] to R, which is the unique homomorphism from K[X] to R that fixes K, and maps X to a...
universal among all monoid homomorphisms from M to a (∨,0)-semilattice, that is, for any (∨,0)-semilattice S and any monoid homomorphism f: M→ S, there exists...
homomorphisms between them. There exists a unique homomorphism from the two-element Boolean algebra 2 to every Boolean algebra, since homomorphisms must...
defines an injective homomorphism of normed algebras from C {\displaystyle \mathbb {C} } into the quaternions. Under this homomorphism, q is the image of...
\alpha n\rfloor } is an almost homomorphism for every α ∈ R {\displaystyle \alpha \in \mathbb {R} } .) Almost homomorphisms form an abelian group under pointwise...
using the language of algebra: A completely multiplicative function is a homomorphism from the monoid ( Z + , ⋅ ) {\displaystyle (\mathbb {Z} ^{+},\cdot )}...
Global Information