Math 2.0

statement proposition

Absorption law

Statement

Let LL be a lattice with join ∨\vee and meet ∧\wedge. Then a∨(a∧b)=aa \vee (a \wedge b) = a and a∧(a∨b)=aa \wedge (a \vee b) = a for all a,b∈La, b \in L.

Remarks

In a lattice defined as a partially ordered set, the proof is short. Since a∧b≤aa \wedge b \le a, the join of aa and a∧ba \wedge b is aa. The second law is dual. In the algebraic definition of a lattice, the two absorption laws are axioms, together with associativity and commutativity. The absorption laws imply idempotence: a∨a=a∨(a∧(a∨a))=aa \vee a = a \vee (a \wedge (a \vee a)) = a.

Explanations

L1 human

Absorption says that combining aa with something made from aa gives back aa. For sets: A∪(A∩B)=AA \cup (A \cap B) = A, because A∩BA \cap B is already inside AA.

What this node needs for W1
  • edge uses out: each definition that the statement needs (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/Absorption_law, lead section