Course fact wiki

An operad encodes families of n-ary operations together with composition along trees, a unit 1-ary operation, and (for symmetric operads) permutation actions compatible with composition.

J. Peter May coined the term operad (operations + monad) in The Geometry of Iterated Loop Spaces (1972); Boardman and Vogt introduced equivalent structure earlier as categories of operators in standard form (1968–1973).

Operadic composition is associative (parenthesization does not matter) and unital: θ ∘ (1,…,1) = θ = 1 ∘ θ.

David Spivak showed that hierarchical wiring diagrams form morphisms of an operad T, providing a graphical language for databases, recursion, and plug-and-play circuits.

The algebra Rel of mathematical relations on the wiring-diagram operad lets wiring diagrams structure relational database queries; circuit diagrams appear as a special case.

Compositionality requires that the meaning of a composite system is determined by the meanings of its parts and the way they are composed — formalized when semantics is an algebra over a composition operad.

An open system exposes a typed boundary (ports/interfaces); composition glues boundaries rather than treating systems as closed black boxes.

Classical applications of operads include characterizing iterated loop spaces and encoding algebraic structures (e.g. algebras over the Lie operad are Lie algebras).

Applied category theory (Fong & Spivak, Seven Sketches in Compositionality) develops compositionality via monoidal categories, wiring diagrams, and graphical calculi for open systems.