Completely distributive lattice¶

A complete lattice in which arbitrary meets distribute over arbitrary joins according to the choice-function identity, equivalently satisfying the self-dual complete distributivity law.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3797
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Order Theory, Complete Lattices → Mathematics

Core Idea¶

A completely distributive lattice satisfies that the meet over j of the join over k in K_j of x_jk equals the join over all choice functions f of the meet over j of x_j,f(j). Every way of selecting one term from each join contributes a meet; joining across all selections exactly reconstructs the original meet of joins. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

No faithful explanation at this level. Two of three generators judge that any child-level picture only shows small, finite 'pick one from each group' mixing, which is ordinary finite distributivity, the weaker property the concept is explicitly stronger than; the essential infinitary law over arbitrary index families is lost.

Pick-One-From-Each Rule

In a lattice, 'join' is like 'or' (combining things upward) and 'meet' is like 'and' (taking what they share). You probably know that (a or b) and (c or d) is the same as: (a and c) or (a and d) or (b and c) or (b and d) — you pick one from each group every possible way, 'and' them, then 'or' all the results. A completely distributive lattice is one where this trick always works, no matter how many groups you have and no matter how many things are in each group, even infinitely many. Lots of lattices only follow the rule for small, finite groups, and that isn't enough.

Fully Infinitary Distributive Lattice

A lattice has meets (greatest lower bounds, like 'and') and joins (least upper bounds, like 'or'). A complete lattice has these for every family of elements, and a distributive lattice satisfies the finite law a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c). A completely distributive lattice satisfies a far stronger, infinite version: the meet over a family of joins equals the join, over every possible way of choosing one term from each join, of the meet of the chosen terms. Each such way of choosing is called a choice function. The law must hold for every indexed family, including infinite ones. So complete distributivity is strictly stronger than being complete plus finitely distributive.

A completely distributive lattice is a complete lattice satisfying, for every indexed family x_{jk} with j in J and k in K_j, the identity ⋀_j ⋁_{k∈K_j} x_{jk} = ⋁_f ⋀_j x_{j,f(j)}, where f ranges over all choice functions selecting one index f(j) ∈ K_j for each j. Each choice of one term from every join contributes a meet, and joining over all such selections exactly reconstructs the original meet of joins. The law must hold for arbitrary, including infinite, index sets, and the use of choice functions depends on the foundational choice convention in force. This full infinitary distributivity is strictly stronger than completeness and than finite distributivity, so a lattice with those weaker properties may fail it.

Scope of Application¶

Completely distributive lattice belongs to order theory and is useful where the analyst can specify a complete lattice, doubly indexed element families, arbitrary joins and meets, choice functions, order duality, and homomorphism properties, then evaluate the identity holds for every indexed family, including arbitrary infinite index sets under the foundational choice convention. The scope is broad within that domain but bounded by the need for the identity holds for every indexed family, including arbitrary infinite index sets under the foundational choice convention. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the identity holds for every indexed family, including arbitrary infinite index sets under the foundational choice convention the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Completely distributive lattice can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Completely distributive lattice. Completely distributive lattice compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: a complete lattice, doubly indexed element families, arbitrary joins and meets, choice functions, order duality, and homomorphism properties. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the identity holds for every indexed family, including arbitrary infinite index sets under the foundational choice convention independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of order theory because they reuse a complete lattice, doubly indexed element families, arbitrary joins and meets, choice functions, order duality, and homomorphism properties, Every way of selecting one term from each join contributes a meet; joining across all selections exactly reconstructs the original meet of joins., and type the carrier, state every parameter and convention in the definition, test that the identity holds for every indexed family, including arbitrary infinite index sets under the foundational choice convention, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Completely distributive lattice Domain-specific

Parents (1) — outgoing typed relations

Completely distributive lattice is a kind of Order Prime

The structure is a complete order with a strong interaction law between infima and suprema.

Hierarchy paths (3) — routes to 3 parentless roots

Completely distributive lattice → is a kind of Order → presupposes Comparison

Show alternative paths (2)

Neighborhood in Abstraction Space¶

Completely distributive lattice sits in a crowded region of the domain-specific corpus (5^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Set-Theoretic & Order Structures (54 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25