Definitionv1

Lattice: a directed acyclic graph where every node can have

Lattice: a directed acyclic graph where every node can have multiple parents and every pair of elements has both a unique least upper bound (join) and a unique greatest lower bound (meet), representing the multidimensional nature of knowledge where concepts genuinely belong to multiple categories simultaneously

Why This Is a Definition

This definition precisely establishes the semantic boundary of 'lattice' by identifying its genus (directed acyclic graph) and differentia (multiple parents, join and meet operations). It distinguishes lattices from trees and DAGs, explains how they represent multidimensional knowledge, and connects the mathematical concept to knowledge organization. The definition is self-contained and explains what makes a lattice fundamentally different from a tree structure.

Source Lessons

L-0265

Hierarchies are not trees they are lattices

Real knowledge often has items that belong to multiple parent categories. When you force every concept into a single branch of a tree, you destroy information. Lattice structures — where a node can have multiple parents — preserve the multidimensional nature of knowledge. The tree is a special case. The lattice is the general case.

Connections

Defines (1)

AxiomHuman existence has four permanent structural features:

Back to Concepts