6. Mac Lane, Lawvere, and Foundational Mappings

Categorical Semantics: Moving Beyond Elements

To formalize our NF Ontology computationally, we must transition from defining mathematical entities by their internal elements (standard set theory) to defining entities by their external structural relationships (morphisms). This is the domain of Category Theory.

Suggested Reading: Category Theory Foundations
  • Lawvere, F. W. (1964). The Category of Categories as a Foundation for Mathematics. Proceedings of the National Academy of Sciences, 52(6), pp. 1506–1512.
  • Mac Lane, S. (1998). Categories for the Working Mathematician. Ch. I (§1–§4, §8), Ch. III (§1), Ch. IV (§1, §9).

Introspective Sets vs. Behavioral Morphisms

Classical set theory is fundamentally Introspective: to understand a set, you must unpack its contents, inspecting every individual element \(x \in A\).

Category Theory, pioneered by Saunders Mac Lane and Samuel Eilenberg, replaces this internal inspection with a Behavioral Ontology. An object \(A\) possesses no internal spatial reality. It is characterized entirely by the totality of morphisms flowing into it and out of it across the network.

Set-Theoretic (Introspective):
  A = { x1, x2, x3, ... }    ──►  Look inside container

Categorical (Behavioral):
  f: A ──► B,  g: C ──► A    ──►  Inspect external interactions

Core Categorical Machinery (Mac Lane)

A category \(\mathcal{C}\) is defined by objects, arrows (morphisms), identity morphisms, and composition (\(g \circ f\)), satisfying associativity and the identity laws:

  • Functors (\(F: \mathcal{C} \to \mathcal{D}\)): Structure-preserving mappings between categories that map objects to objects and arrows to arrows, preserving composition and identities.
  • Natural Transformations (\(\alpha: F \Rightarrow G\)): Morphisms between functors that ensure all localized transformation squares commute.
  • Universal Properties & Limits: Structures defined through unique factorization pathways (e.g., products, pullbacks, equalizers, and terminal objects).
  • Adjunctions (\(F \dashv G\)): Natural bijections between Hom-sets \(\text{Hom}_{\mathcal{D}}(F(A), B) \cong \text{Hom}_{\mathcal{C}}(A, G(B))\), establishing the fundamental duality between free constructions (left adjoint) and underlying constraints (right adjoint).

F. William Lawvere: The Category of Categories (ETAC)

In 1964, F. William Lawvere published The Category of Categories as a Foundation for Mathematics, eliminating set membership (\(\in\)) entirely as a foundational primitive.

Lawvere’s Elementary Theory of Abstract Categories (ETAC) builds mathematics upon a first-order language using only:

  1. Unary domain and codomain operations (\(\Delta_0(f) = A, \Delta_1(f) = B\)).
  2. A ternary composition relation (\(\Gamma(f, g, h) \iff h = g \circ f\)).

By abandoning element membership as the bedrock of reason, Lawvere demonstrated that mathematics can be formulated directly as a flat web of compositional arrows.

The Pivot to JSON: Modeling Flat Categorical Adjacency

Up until now, you have analyzed how First-Order Logic uses Stratification to authorize set formation syntactically. We must now serialize this logic into a machine-readable format to build our NF Categorical Ontology.

Set-Theoretic Class Hierarchy:    Nested V_alpha sets
              │
              ▼
Categorical Arrow Network:        Objects & Morphisms
              │
              ▼
Flat JSON Adjacency Matrix:       Key-Value Object Arrays

Why JSON Models Category Theory Natively

  1. Non-Spatial Flat Addressing: In a physical filesystem, putting a folder inside itself creates an infinite recursive loop. A JSON document is a flat hash map of key-value pairs. Nodes reference other nodes through string identifiers ("source": "NodeA"), establishing operational links without spatial nesting.
  2. Native Morphism Representation: A JSON object with source, target, and id properties is an exact computational instantiation of a category theory arrow \(f: A \to B\).
  3. Graph Traversal without Stack Overflows: Because references are flat string lookups, self-referential structures (such as Quine’s Universal Set \(V \in V\) or endofunctors \(T: \mathcal{C} \to \mathcal{C}\)) evaluate as directed graph cycles in constant memory.

The JSON Ontology Blueprint

Before solving the following problems, review the core schema format we will use to model Categorical objects and morphisms. Note the specific keys (id, type, source, target):

{
  "id": "Morphism_f",
  "type": "morphism",
  "source": "NodeA",
  "target": "NodeB",
  "constraints": ["associative"]
}
  • type: Identifies the mathematical entity (object, morphism, functor).
  • source / target: The domains and codomains (can be single strings or arrays of strings for products).
  • constraints: A list of rules ensuring this entity obeys specific axioms.

Guided Example: JSON Morphism Anatomy

If you want to represent the morphism \(f: A \to B\) in JSON, you need to specify its domain and codomain explicitly.

{
  "id": "Morphism_f",
  "type": "morphism",
  "source": "_____",
  "target": "_____"
}

(Hint: What are the ID strings for the objects representing the domain and codomain in \(f: A \to B\)?)

Problem Set: JSON Relational Morphisms

Problem 6.1: Morphisms vs Elements

In your NF JSON ontology, you cannot rely on looking “inside” a set to determine its properties. You must define it externally via morphisms. Write the JSON morphism structure that defines an abstract Universal Cone (Limit) connecting a vertex object LimitVertex to a target functor BaseFunctor.

Your definition of Syntactic Authorization (Chapter 1):

Problem 6.2: The Subobject Classifier

How will you represent the Subobject Classifier (\(\Omega\)) in your JSON ontology? Will it map to standard Boolean values, or will you use a multi-valued logic structure to represent subobjects via key-value syntactic authorization?

Next: Higher-Order Logic: Lambek and Scott ➔