meet(F, G)
F ^ G
In the geometric lattice of flats, the meet (also known as the infimum or greatest lower bound) is the intersection of the flats. Equivalently, identifying flats with subspaces, this operation is the Minkowski sum of the subspaces.
The meet operation is commutative, associative, and idempotent.
|
|
|
|
|
|
|
|
|
|
|
The rank function is also semimodular.
|
|
|
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/HyperplaneArrangements.m2:2565:0.