diff --git a/docs/research/SIDON_SOFA_COLORING.md b/docs/research/SIDON_SOFA_COLORING.md new file mode 100644 index 00000000..f6682ddf --- /dev/null +++ b/docs/research/SIDON_SOFA_COLORING.md @@ -0,0 +1,425 @@ +# Sidon-Sofa Coloring: A Unified Problem + +**Status:** CONCEPTUAL — problem formulation, no measurements yet +**Date:** 2026-07-03 +**Depends on:** `INVARIANT_COMPUTATION_GEOMETRY.md`, `sidon_preservation_creation.md`, +`braid_group_action.md`, `OCTAGON_PRINCIPLE.md` + +**One-sentence statement:** A shape with Sidon-structured boundary navigates +an L-corridor while the induced unit-distance conflict graph on its +configuration-space trajectory has bounded chromatic number. + +--- + +## 1. The Two Parent Problems + +### 1A. Moving Sofa (Moser 1966) + +What planar shape of maximum area can be moved around a right-angle +hallway of unit width? + +| Quantity | Value | +|----------|-------| +| Best known shape | Gerver's sofa (1992) | +| Best known area | ≈ 2.2195 | +| Optimality proved? | **No** | +| Configuration space | SE(2) = ℝ² × S¹ | +| Constraint type | Rigid-body motion through constrained geometry | + +The problem is an optimization over continuous paths in SE(2): + + γ: [0,1] → SE(2), γ(t)S ⊂ H ∀t + +where H is the L-shaped hallway and S is the shape. + +### 1B. Hadwiger–Nelson (1950) + +What is the minimum number of colors needed to color the plane so that +no two points at distance 1 share a color? + +| Quantity | Value | +|----------|-------| +| Classical bounds | 4 ≤ χ(ℝ²) ≤ 7 | +| de Grey (2018) | 5 ≤ χ(ℝ²) ≤ 7 | +| Answer known? | **No** | +| Constraint type | Unit-distance graph coloring | + +Both problems are open. Both involve geometry under constraint. Neither +has been studied through the lens of Sidon structure. + +--- + +## 2. The Bridge: Sidon Structure as Invariant Geometry + +The SilverSight framework already identifies Sidon sets as a key +invariant — the collision-free property where all pairwise sums are +distinct: + + aᵢ + aⱼ = aₖ + aₗ ⟹ {i,j} = {k,l} + +In the language of `INVARIANT_COMPUTATION_GEOMETRY.md`: + + Sidon property = equivalence class under the Φ-metric + (nonlinear → spectral: pairwise sums → eigenvalue degeneracy) + +The Sidon property is **observer-independent**: it survives change of +basis, change of representation, change of coordinate system. Every pair +of elements has a **unique signature** (its sum). This is exactly the +"observerless observer" protocol from `OCTAGON_PRINCIPLE.md`. + +**Key insight:** If we require the boundary of the sofa to form a Sidon +set, then every geometric interaction between boundary points carries a +unique, intrinsically identifiable signature. The conflict graph becomes +**rigid enough** for nontrivial chromatic analysis while remaining +**expressive enough** for geometric optimization. + +--- + +## 3. The Unified Problem: Formal Statement + +### 3.1 Setup + +Let H ⊂ ℝ² be an L-shaped hallway of unit width. +Let S ⊂ ℝ² be a compact connected shape. +Let P = {p₁, …, pₙ} ⊂ ∂S be a finite boundary point set. + +### 3.2 Three Constraint Layers + +**Layer 1 — Sidon Constraint (structural bridge):** + +P is a Sidon set in ℝ²: + + pᵢ + pⱼ = pₖ + pₗ ⟹ {i,j} = {k,l} + +All pairwise sums (midpoints × 2) are distinct. Every pair of boundary +points has a unique "center of mass" signature. This means every +geometric interaction is intrinsically identifiable — no ambiguity +about which pair caused a conflict. + +**Layer 2 — Motion Constraint (sofa):** + +∃ continuous path γ: [0,1] → SE(2) such that: +- γ(0)S is in the horizontal corridor +- γ(1)S is in the vertical corridor +- γ(t)S ⊂ H ∀t ∈ [0,1] + +**Layer 3 — Configuration-Space Coloring (Hadwiger–Nelson lifted to SE(2)):** + +Define the conflict graph Γ_γ on the motion: + + V(Γ_γ) = [0,1] (time instances) + + {t, t'} ∈ E(Γ_γ) ⟺ ∃ pᵢ, pⱼ ∈ P: ‖γ(t)pᵢ − γ(t')pⱼ‖ = 1 + +Two time-instances conflict if some boundary point at time t and some +boundary point at time t' are at exactly unit distance. The chromatic +number χ(Γ_γ) measures how many "phases" the motion decomposes into. + +### 3.3 The Optimization + + A*(χ) = sup { Area(S) : P ⊂ ∂S is Sidon, + S navigates H via γ, + χ(Γ_γ) ≤ χ } + +**Central question:** What is A*(χ) as a function of χ? + +--- + +## 4. The Interpolation Spectrum + +The function A*(χ) creates a family of problems interpolating between +known regimes: + +| χ | Interpretation | Expected behavior | +|---|---------------|-------------------| +| 1 | No two boundary points ever at distance 1 | Extremely restrictive; A*(1) very small | +| 2 | Motion splits into two non-conflicting phases | First nontrivial regime | +| 5 | Matches de Grey's lower bound for ℝ² | Critical threshold? | +| 7 | Matches the upper bound for ℝ² | Possibly sufficient for any Sidon sofa | +| ∞ | No coloring constraint | Recovers classical moving sofa (≈ 2.2195) | + +A*(χ) is a **staircase function** encoding the trade-off between +geometric freedom (area) and constraint complexity (colors needed). + +**Research questions:** +- Is A*(χ) monotone? (almost certainly yes) +- Where are the phase transitions? (does A*(5) > A*(4)?) +- Does A*(χ) plateau at some finite χ? (what is the saturation color?) +- For Gerver's sofa discretized as Sidon, what is χ(Γ_γ)? + +--- + +## 5. Connection to SilverSight Concepts + +### 5.1 Braid Trees (from `braid_group_action.md`) + +As S moves through the corner, the worldlines of boundary points +{γ(t)pᵢ} trace curves in ℝ² × [0,1]. These worldlines **braid** around +each other and around the inner corner vertex. + +The Sidon constraint guarantees every **crossing** in the braid tree +is **canonically labeled**: when worldlines of pᵢ and pⱼ come within +unit distance, the pair (i,j) is uniquely determined by the midpoint +(pᵢ + pⱼ)/2. No two crossings can share the same midpoint signature. + +This gives the braid tree a **Sidon labeling** — a combinatorial +invariant of the motion that is independent of coordinate choices. + +In the dual-model framework of `braid_group_action.md`: +- The **axis-swap model** describes the topology (which strands cross) +- The **modulus-adjustment model** describes the physics (which distances + trigger conflicts) +- The Sidon labeling bridges both: topology determines crossing order, + Sidon determines unique identification at each crossing + +### 5.2 CRT Torus Embedding (from `sidon_preservation_creation.md`) + +Construct P using a CRT-based Sidon set. Choose pairwise coprime moduli +(L₁, …, Lₖ) and encode each boundary point by its residue vector: + + pᵢ ↦ (pᵢ mod L₁, pᵢ mod L₂, …, pᵢ mod Lₖ) + +Each modulus encodes a different geometric constraint: + +| Axis | Geometric meaning | +|------|-------------------| +| L₁ | Distance to inner wall of hallway | +| L₂ | Distance to outer wall | +| L₃ | Angular position relative to corner | +| L₄ | Arc length along ∂S | + +By the CRT Sidon Creation Theorem (`sidon_preservation_creation.md`, +§6.3), the Sidon property holds iff: + + (a) Wrapping criterion: existing collisions break (r₁ ≠ r₂) + (b) M-difference condition: no new collisions form (|T₁−T₂| ≠ M) + +For the sofa problem, this gives an **algorithmic design procedure**: + +1. Choose boundary points P₀ (initial guess) +2. Compute all pairwise sums and differences +3. Select moduli (L₁, …, Lₖ) satisfying the creation theorem +4. CRT-lift P₀ → P (guaranteed Sidon) +5. Optimize Area(S) subject to P = ∂S and CRT constraints + +The M-difference condition (M ∉ D_A) becomes a **design constraint** on +the hallway geometry: the product M = ∏ Lᵢ must avoid the set of +pairwise sum differences of the boundary points. + +### 5.3 Octagon Principle (from `OCTAGON_PRINCIPLE.md`) + +The sofa coloring problem is a **matter problem** (nonlinear geometric +constraint: does the shape fit?). The octagon principle says: convert +matter → light. + +The conversion: + +``` +matter: shape S navigates hallway H (geometric collision detection) + ↓ Φ-metric embedding (Sidon boundary → adjacency matrix) +operator: conflict graph Γ_γ on SE(2) (unit-distance adjacency) + ↓ spectral decomposition +light: chromatic polynomial P(Γ_γ, k) (spectral coloring bound) +``` + +The Sidon boundary condition IS the Φ-metric: it converts the nonlinear +shape-fitting problem into a spectral problem on the conflict graph. +The nonlinear property (shape fits hallway) manifests as a spectral +signature (chromatic number of Γ_γ). + +The octagon is RICHER than either original shape: the conflict graph +encodes BOTH the geometry of S and the topology of its motion. Neither +alone is sufficient. + +### 5.4 Observer-Independence + +The Sidon labeling of the conflict graph is **frame-independent**: + +- Translate S → all pairwise sums shift by 2Δ (Sidon preserved) +- Rotate S → all pairwise sums rotate (Sidon preserved) +- Reparameterize time → graph Γ_γ is isomorphic (chromatic number + invariant) + +The coloring χ(Γ_γ) is an **intrinsic property** of the shape and +motion, not an artifact of coordinate system. This matches the +"observerless observer" from `INVARIANT_COMPUTATION_GEOMETRY.md`: +the invariant (chromatic number) survives all representations. + +### 5.5 Conservation Law + +The measured conservation law states: + + program_size + residual_size ≥ K(data) + +In the sofa coloring context: + + log(Area(S)) + log(χ(Γ_γ)) ≥ K(P) + +where K(P) is the Kolmogorov complexity of the Sidon boundary set. +You cannot simultaneously minimize area and chromatic number below +the information content of the boundary structure. The trade-off is +bounded by information conservation. + +--- + +## 6. The Dual Formulation + +Instead of fixing the shape and coloring configuration space, **fix the +coloring and optimize the shape**: + +**Dual Problem:** Given a coloring c: SE(2) → {1, …, χ} (a "chromatic +schedule"), find the Sidon-structured shape S of maximum area whose +motion γ satisfies: + + ‖γ(t)pᵢ − γ(t')pⱼ‖ = 1 ⟹ c(γ(t)) ≠ c(γ(t')) + +This makes the constraint propagation explicit: the coloring is a +pre-assigned schedule of "safe" and "unsafe" phases, and the shape +must be designed to respect it. + +In the light/matter language: +- Primal: matter (shape) determines light (coloring) +- Dual: light (coloring schedule) constrains matter (shape) + +This is the same duality structure as the octagon principle: the +matter→light and light→matter directions are complementary projections +of the same invariant geometry. + +--- + +## 7. Concrete Research Directions + +### Direction A: Finite Sidon Sofas (computational) + +Take n boundary points forming a Sidon set. Compute A*(n, χ) for small +n and χ. Study convergence as n → ∞. + + Parameters: n ∈ {5, 8, 13, 21, 34} (Fibonacci, for Sidon density) + Method: numerical optimization over polygon vertices + + CRT Sidon creation theorem for guarantee + Output: A*(n, χ) table, phase transition locations + +### Direction B: Chromatic Number of Gerver's Sofa (analytical) + +Discretize Gerver's sofa boundary into a Sidon set (using CRT lift). +Compute χ(Γ_γ) for the standard motion through the L-corridor. + + Question: Does Gerver's sofa require 5, 6, or 7 colors? + Significance: Gives a LOWER BOUND on the chromatic number of + the SE(2) unit-distance graph induced by optimal sofa motion. + +### Direction C: Sidon-Restricted Upper Bounds (theoretical) + +The Sidon constraint reduces degrees of freedom in the shape. Can you +prove a tighter upper bound on sofa area when ∂S must be Sidon? + + Current upper bound (no Sidon): ≈ 2.37 (Khan, Pitt, et al.) + Conjecture: Sidon constraint → tighter bound, possibly < 2.2 + Method: Use the unique midpoint property to bound contact geometry + +### Direction D: SE(2) Unit-Distance Chromatic Number + +The conflict graph Γ_γ is a unit-distance graph embedded in SE(2) +rather than ℝ². Generalize Hadwiger-Nelson: + + Question: Is 5 ≤ χ(SE(2)) ≤ 7? + Or does the SE(2) structure (3D, non-commutative) allow different + bounds? + + Method: Construct finite unit-distance graphs in SE(2) requiring + ≥ 5 colors (analogous to de Grey's construction in ℝ²) + +### Direction E: Braid-Coloring Correspondence + +Study the relationship between the braid word of the motion (topology) +and the chromatic number of Γ_γ (combinatorics). + + Question: Does a longer braid word → higher chromatic number? + Is there a braid invariant that bounds χ from below? + +--- + +## 8. Why This Problem Is Structurally Rich + +The unified problem sits at the intersection of **five** SilverSight +research threads: + +``` + Moving Sofa (continuous optimization) + ↗ ↘ + Sidon Structure ←→ Unit-Distance Coloring + (algebraic) (combinatorial) + ↘ ↗ + Braid Topology ←→ CRT Embedding + (topological) (arithmetic) +``` + +Each thread provides a different lens: + +| Thread | What it contributes | +|--------|-------------------| +| Sidon structure | Unique identification of interactions | +| Sofa optimization | Continuous geometric degrees of freedom | +| Hadwiger-Nelson coloring | Discrete constraint propagation | +| Braid topology | Topological invariants of motion | +| CRT embedding | Arithmetic construction of Sidon sets | + +The Sidon constraint is not arbitrary — it is the **structural keystone** +that makes the unified problem well-posed. Without it, the conflict +graph has too much ambiguity (which pair caused the conflict?). With it, +every interaction is uniquely identified, the braid tree is canonically +labeled, and the CRT provides an algorithmic construction. + +--- + +## 9. Connection to Session Measurements + +| Existing measurement | Role in the unified problem | +|---------------------|----------------------------| +| Sidon 4/4 (octagon) | Boundary structure is the Φ-metric embedding | +| CRT lift O(1) | Algorithmic construction of Sidon boundaries | +| Braid group action | Topology of boundary worldlines through corner | +| Conservation law | Bound: log(Area) + log(χ) ≥ K(P) | +| Cospectral failure | Symmetry of hallway may cause degenerate conflict graphs | +| Merged O(1) transform | Physics of motion does invariant extraction | +| Reaction primes | Prime decomposition of Sidon boundary moduli | + +--- + +## claim_boundary + +``` +sidon-sofa-coloring:problem-formulation:unified-optimization +``` + +This document formulates a new problem combining the Moving Sofa Problem, +the Hadwiger-Nelson coloring problem, and Sidon structure into a single +optimization A*(χ). No measurements have been performed. All connections +to SilverSight concepts (octagon, CRT, braid, conservation law) are +structural analogies awaiting empirical verification. The problem is +well-posed (finite Sidon sets exist, motions exist, conflict graphs are +finite for discretized boundaries), but A*(χ) is unknown for all finite χ. + +--- + +## What's Measured vs. What's Speculative + +**STRUCTURAL (well-defined):** +- The problem formulation is mathematically precise +- Sidon sets in ℝ² exist at all finite sizes +- The conflict graph Γ_γ is well-defined for any discretized motion +- The CRT construction algorithm exists (from sidon_preservation_creation) + +**SPECULATIVE (unverified):** +- That A*(χ) has nontrivial phase transitions +- That Gerver's sofa discretized as Sidon requires 5+ colors +- That the SE(2) unit-distance chromatic number differs from ℝ² +- That the conservation law applies in the stated form +- That the octagon principle applies to this specific matter→light + conversion + +**OPEN QUESTIONS:** +- What is A*(1)? (the maximally constrained case) +- At what χ does A*(χ) saturate? +- Does the Sidon constraint change the asymptotic sofa area? +- Is there a braid invariant bounding χ from below?