Confinement as a Closure Constraint

The Question

Why don’t isolated quarks appear as free particles? In the Standard Model, the answer is SU(3) colour confinement: the coupling constant grows at long range, making it energetically impossible to isolate a single colour charge.

This paper offers a different structural account. Within the closure framework developed in Papers V–VII, confinement is not imposed by a force law or a running coupling — it emerges as a connectivity constraint on composite shell supports. States whose shell-support graph is disconnected are excluded from the closed state set. Confinement is constraint exclusion.

---

Composite States

A composite state is a multi-node configuration Ψ = (ψ₁, …, ψ_n), where each component occupies one or more shells of the 600-cell geometry. The composite shell support is the union of component supports:

S_Ψ = S(ψ₁) ∪ … ∪ S(ψ_n)

The shell-support graph G(S_Ψ) has occupied shells as vertices and edges between adjacent shells. The connectivity properties of this graph determine whether the composite satisfies the closure constraints.

---

The Connectivity Constraint

The central definition: G(S_Ψ) must be connected. To quantify violations, the gap penalty is introduced:

A connected support has no gaps between occupied shells — the gap penalty vanishes. Any disconnection introduces a positive penalty, which feeds directly into the composite closure functional.

---

Composite Closure Functional

The closure functional from Paper VII is extended with a fourth term to handle composite states:

The gap-penalty term w₄Ξ(Ψ) ensures that any composite with disconnected shell support has F_comp > 0, and therefore cannot belong to the closed state set S_cl.

---

Confinement as Constraint Exclusion

---

Worked Examples

Quark-like {2, 4}: disconnected

Shell support {2, 4} has a gap at shell 3. The shell-support graph G({2, 4}) is disconnected. Gap penalty: Ξ = (4 − 2 − 1) = 1. Since Ξ > 0, F_comp > 0, and the state is not closure-stable. It cannot exist as a free composite.

Proton {2, 3, 4}: connected

Shell support {2, 3, 4} has no gaps. The shell-support graph G({2, 3, 4}) is connected. Gap penalty: Ξ = 0. Closure invariant ΔC = 15, within the admissible range. The composite is closure-stable:

---

Emergent Composite Classes

The connectivity constraint naturally partitions composite states into distinct structural classes:

Class	Support	Connectivity	Physical Parallel
Single-node	|S| = 1	Trivially connected	Leptons
Two-node connected	|S| = 2, consecutive	Connected	Mesons
Three-node connected	|S| = 3, consecutive	Connected	Baryons
Disconnected	Any S with gaps	Disconnected (Ξ > 0)	Excluded from Scl

---

Structural Parallel to Colour

Baryons on {2, 3, 4} involve three distinct shells — a threefold composite admissibility condition. This is structurally reminiscent of the colour-singlet requirement in QCD, where exactly three colour charges must combine to form an observable hadron.

The parallel is suggestive: three shells, three colours; connectivity constraint, colour neutrality. But the analogy has limits.

---

Stated Limitations

• SU(3) colour symmetry is not derived — the framework produces a structural parallel, not the gauge group
• No dynamics — the mechanism by which disconnected states bind into connected composites is not modelled
• No running coupling — no analogue of asymptotic freedom or infrared slavery
• No lattice comparison — no contact with lattice QCD results or Wilson loops
• Constraint weights w₁–w₄ are not uniquely fixed from first principles
• The gap penalty is a modelling choice — motivated by graph-theoretic structure but not derived

---