Math 2.0

definition

Distributive lattice

Definition

A lattice (L,∨,∧)(L, \vee, \wedge) is distributive if x∧(y∨z)=(x∧y)∨(x∧z)x \wedge (y \vee z) = (x \wedge y) \vee (x \wedge z) for all x,y,z∈Lx, y, z \in L.

Remarks

The condition is equivalent to its dual: x∨(y∧z)=(x∨y)∧(x∨z)x \vee (y \wedge z) = (x \vee y) \wedge (x \vee z) for all x,y,zx, y, z. Every totally ordered set is a distributive lattice, with max⁡\max as join and min⁡\min as meet. Every Boolean algebra is a distributive lattice. The diamond lattice M3M_3 and the pentagon lattice N5N_5 are the basic lattices that are not distributive.

Explanations

L1 human

A lattice is distributive when meet distributes over join, like intersection over union for sets. Then join also distributes over meet.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Distributive_lattice, Definition