Remove transform_series.md

This commit is contained in:
Allaun Silverfox 2026-07-02 03:41:42 +02:00
parent d804df83f2
commit 46acba8dbf

View file

@ -1,99 +0,0 @@
# Transform Series: Sidon → Cartan → Spectral Gap
**Discovery:** June 30, 2026
**Key insight:** The character group Z₂⁴ of the 4 crossing pairs is the transform that preserves Sidon geometry across domains.
## The Series
```
Layer 0: Sidon labels {1, 2, 4, 8, 16, 32, 64, 128}
│ Binary expansion: label = 2^i ↔ bit position i
Layer 1: ℤ₂⁸ configuration space (8 strands × Q16_16 phases)
│ Discrete Euler-Lagrange: Lagrangian = T V
│ where T (kinetic) = discrete Laplacian on φ[i]
│ and V (potential) = Cartan weight matrix C[i][j]
Layer 2: Cartan holonomy (block-diagonal, 4×2×2 coupling)
│ Eigenvalues of each 2×2 block: {529, 17}
│ Character inner products: ⟨χ_i, χ_j⟩
Layer 3: Spectral gap
│ λ_min = 17 = ⟨χ_i, χ_i⟩ ⟨χ_i, χ_{i+1}⟩ = 273 256
│ λ_max = 529 = ⟨χ_i, χ_i⟩ + ⟨χ_i, χ_{i+1}⟩ = 273 + 256
Layer 4: Combinatorial coupling graph
│ C(8,2) = 28 edges
│ n(n1)/2 = 8×7/2 = 28
Complete classification of crossing configurations
```
## The Character Matrix (Z₂⁴)
The 8 strands decompose into 4 independent crossing pairs. Each pair is a Z₂ character (even/odd parity ±1). The character matrix:
```
pair0 pair1 pair2 pair3
strand 0: +1 0 0 0
strand 1: -1 0 0 0
strand 2: 0 +1 0 0
strand 3: 0 -1 0 0
strand 4: 0 0 +1 0
strand 5: 0 0 -1 0
strand 6: 0 0 0 +1
strand 7: 0 0 0 -1
```
This is the fundamental transform. It maps strands to characters, and the character inner products recover the Cartan weights:
```
self-inner: ⟨χ_i, χ_i⟩ = 1+1+1+1 = 4 → normalized to 273 (= 4 × 68.25)
adj-inner: ⟨χ_i, χ_j⟩ = 0+0+1+1 = 2 → normalized to 256 (= 2 × 128)
```
The ratio 273/256 = 1.06640625 encodes the asymmetry between self-crossing and pair-crossing energy.
## Why This Preserves Sidon Geometry
The Sidon property (all pairwise sums unique) is equivalent to the **character orthogonality condition** on Z₂⁴:
```
Theorem: The set {2^i | i = 0..7} is Sidon
The character vectors χ(i) are orthogonal in pairs:
⟨χ(i), χ(j)⟩ = 0 for |i - j| > 1 (different pairs)
⟨χ(i), χ(j)⟩ = 2 for |i - j| = 1 and same pair (adjacent)
⟨χ(i), χ(i)⟩ = 4 (self)
```
Proof: For Sidon labels {2^i}, the sum 2^i + 2^j is unique because binary expansion has no carries when i ≠ j. The character matrix encodes this "no carry" property as diagonal dominance of the Gram matrix.
The same structure appears in:
- **DNA base pairing** — each nucleotide pair is a Z₂ character (A=T: -1/+1, G≡C: -1/+1)
- **Braid crossing** — each crossing pair is a Z₂ character (over/under crossing)
- **Cartan decomposition** — the root system of A₁×A₁×A₁×A₁ decomposes as Z₂⁴
## What This Does NOT Claim
- The character matrix is NOT derived from a Lagrangian on S⁷ (retracted)
- The Z₂⁴ group does NOT require exotic diffeomorphisms (retracted)
- The 28 = C(8,2) is combinatorial, not topological
- The transform preserves Sidon geometry BECAUSE both structures are product decompositions of Z₂
## Implementation
The character matrix computes the Cartan weights without eigendecomposition:
```python
chi = character_matrix(n=8, pairs=4)
C = chi @ chi.T # Gram matrix of characters
# C = diag(4) with block structure: 2×2 blocks with 1 on diagonal, 0.5 on off-diag
# Scaled: diag(4) × 68.25 = 273, off-diag(0.5) × 512 = 256
# Ratio: 273/256 = C[diag] / C[adj] = 4 / 2 × (68.25/128) = 2 × 0.5332 ≈ 1.0664
```