FOUNDATION #1proven

Unique Grounding Theorem

Every well-formed UL expression has a unique decomposition into the five primitives. There is no ambiguity in decomposition — meanings are always traceable to concrete geometric operations.
Eop₁op₂∃! decompositionEvery expression has exactly one primitive decomposition
Visual diagram for the proof of unique grounding

Intuition

The Unique Grounding Theorem is the bedrock of Universal Language. It says that when you write any UL expression — no matter how complex — you can always “take it apart” into the five geometric primitives in exactly one way. There is no ambiguity. Every meaning traces back to a concrete geometric mark.

Think of it like factoring integers: just as 60 = 2² × 3 × 5 is the unique prime factorisation, every UL expression has a unique “primitive factorisation” into Point (•), Line (—), Angle (∠), Curve (⌒), and Enclosure (◯).

Formal Statement

Let Σ_UL be the Universal Language signature consisting of the five primitive sorts and eleven operations. For every well-formed expression E in UL, there exists a unique finite sequence of primitive applications and operations such that E decomposes into that sequence. Formally:

∀ E ∈ WFF(Σ_UL), ∃! D = (p₁, op₁, p₂, op₂, …, pₙ) such that:

  1. Each pᵢ ∈ { •, —, ∠, ⌒, ◯ }
  2. Each opⱼ ∈ Σ_UL (the 11 operations)
  3. Reconstruction from D yields E, and no other D' does the same

Proof

Step 1 of 5Setup
Let E be any well-formed UL expression. By the constructive definition of UL, E is built from the five primitives (Point •, Line —, Angle ∠, Curve ⌒, Enclosure ◯) via the 11 operations of Σ_UL.
Justification: Definition of well-formedness (Syntax §2). Every expression is either a primitive or the result of applying an operation to well-formed sub-expressions.

Significance

This theorem has far-reaching consequences for the entire UL system:

  • No ambiguity: Two different meanings can never produce the same expression. If you can write it, you can unambiguously read it.
  • Geometric semantics: Every UL expression is a sequence of concrete geometric actions — not arbitrary symbols. Meaning is literally built from shape.
  • Machine verifiable: An algorithm can decompose any expression and verify its well-formedness by checking each step.
  • Enables all later theorems: Without unique decomposition, none of the structural or advanced theorems could be stated precisely. This is Theorem 1 for a reason.

Connections

The Unique Grounding Theorem directly enables two other foundation theorems:

Consequences

Related Sections