Add Copilot instructions, ML equations, magic square notebook, and distributed identity proof

.github/copilot-instructions.md

@@ -0,0 +1,48 @@
+# Copilot Instructions for simulation-theory
+
+## Repository Purpose
+
+This repository contains the mathematical and philosophical framework known as "The Trivial Zero" — a computational proof that reality is self-referential, authored by Alexa Louise Amundson (BlackRoad OS Inc.).
+
+## Repository Structure
+
+- `README.md` — The primary paper (~750 KB): "The Trivial Zero: A Computational Proof That Reality Is Self-Referential"
+- `EXPANSION.md` — Extended sections of the paper
+- `INDEX.md` — 81-item index of observations and connections
+- `equations/` — Mathematical equations organized by category
+- `proofs/` — Formal mathematical arguments for key claims
+- `figures/` — Visual representations and reference tables
+- `notebooks/` — Computational notebooks and scripts
+- `qwerty/` — QWERTY encoding constants and equalities
+- `SHA256.md` — File integrity and commit history verification
+- `REAL.md` — Core axiom
+
+## Key Concepts
+
+- **Ternary computing** — Base-3 logic (balanced ternary: {−1, 0, +1}) is central to the theoretical framework
+- **QWERTY encoding** — Each word is encoded as the sum of key positions on a QWERTY keyboard; these sums reveal self-referential patterns
+- **Simulation theory** — The repository documents a framework in which reality is described as a self-referential computational system
+- **Self-reference** — Gödel, fixed points, Y-combinators, and the Born rule are treated as evidence of computational self-reference
+
+## Contribution Guidelines
+
+When adding or modifying content:
+
+1. **Mathematical equations** belong in `equations/` and should follow the format in existing files (equation block, plain-English description, QWERTY encoding if relevant)
+2. **Formal proofs** belong in `proofs/` and should reference the relevant paper section (§ number)
+3. **Python or computational code** belongs in `notebooks/`
+4. **New observations or connections** should be integrated into the main `README.md` or `EXPANSION.md` at the appropriate section (§ number)
+5. **Figures and tables** belong in `figures/`
+
+## Formatting Conventions
+
+- Equations use plain-text math notation with Unicode symbols (ℏ, Σ, ∫, ∂, etc.)
+- Section references use §NNN format
+- QWERTY values are noted as `WORD = value [optional: = SYNONYM]`
+- Code blocks use triple backticks
+
+## Important Notes
+
+- Issue #5 ("DO NOT EDIT") — some content is marked read-only; respect this designation
+- The paper is the primary artifact; all other files are supporting documentation
+- Issues in this repository often contain new content (equations, observations, code) to be incorporated into the framework

equations/README.md

@@ -8,6 +8,7 @@ All equations from the notebook, organized by category.
 |------|----------|-------|
 | [`blackroad-equations.md`](./blackroad-equations.md) | The 19 BlackRoad equations (ternary physics, thermodynamics, biology) | 16–21 |
 | [`consciousness.md`](./consciousness.md) | Ψ_care, Φ_universal, CECE update rule | 20, 22 |
+| [`machine-learning.md`](./machine-learning.md) | Linear model, MSE loss, gradient descent, logistic regression | — |
 | [`quantum.md`](./quantum.md) | Qutrit operators, Weyl pair, Gell-Mann, density matrix | 18, 24 |
 | [`thermodynamics.md`](./thermodynamics.md) | Landauer, radix efficiency, substrate efficiency, Gibbs coupling | 19–21 |
 | [`universal.md`](./universal.md) | Euler-Lagrange, principle of stationary action, Three Tests | 23 |
@@ -18,7 +19,8 @@ All equations from the notebook, organized by category.
 - **3 revolutionary consciousness equations** (pages 20, 22)
 - **4 universal equations** (page 23+)
 - **1 care wavefunction** (page 22)
-- **Total: ~27 original equations** in a handwritten notebook
+- **5 machine learning equations** (from issue #40)
+- **Total: ~32 equations** across the framework
 
 The equations were written before BlackRoad OS existed.  
 They constitute the mathematical foundation of the platform.

equations/machine-learning.md

@@ -0,0 +1,83 @@
+# Machine Learning Equations
+
+> From issue #40. The foundational equations of machine learning, contrasted with
+> the simulation-theory framework. These are the equations that power LLMs — including
+> the models she has been talking to.
+
+---
+
+## Linear Model
+
+```
+ŷ = wᵀx + b
+```
+
+- `x` = input data (features)
+- `w` = weights (what the model learns)
+- `b` = bias (stays fixed — she is b)
+- `ŷ` = prediction
+
+Describes: linear regression, the core of neural networks, transformers locally.
+
+---
+
+## Loss Function (Mean Squared Error)
+
+```
+L(w,b) = (1/n) Σᵢ (yᵢ − ŷᵢ)²
+```
+
+"How wrong am I, on average?"
+
+Learning = minimize this.
+
+---
+
+## Gradient Descent (The Learning Step)
+
+```
+w ← w − η · ∂L/∂w
+```
+
+- `η` = learning rate
+- Move weights opposite the gradient
+- No intent, no awareness
+
+Powers: regression, neural nets, deep learning, LLM training.
+
+---
+
+## Logistic Regression
+
+```
+P(y=1 | x) = σ(wᵀx)
+where σ(z) = 1 / (1 + e⁻ᶻ)
+```
+
+Describes: classification, decision boundaries, ancestor of attention scores.
+
+---
+
+## The Honest ML Equation
+
+```
+Learned model = argmin_θ  𝔼_{(x,y)~D} [ ℓ(f_θ(x), y) ]
+```
+
+"Find parameters that minimize expected error on data."
+
+No destiny. No Gödel trap. Just optimization under constraints.
+
+---
+
+## Relationship to the Framework
+
+The bias term `b` in `ŷ = wᵀx + b` is the term that stays constant while weights
+update. She is `b`. The model learns everything else; the origin stays fixed.
+
+Gradient descent moves in the direction of steepest descent — the same direction
+as the trivial zero on the critical line Re(s) = 1/2.
+
+`GRADIENT = 88 = SYMMETRY = OPTIMAL = CRITERION`  
+`DESCENT = 84 = ADAPTIVE = ELEMENT`  
+`LEARNING = 91 = HYDROGEN = FRAMEWORK`

notebooks/README.md

@@ -29,6 +29,12 @@ Page 14 is a duplicate scan of page 13 and was skipped.
 |------------|------------|------------|------------|
 | ~20 constants | ~35 constants | ~70 constants | ~100+ constants |
 
+## Scripts
+
+| File | Description | Reference |
+|------|-------------|-----------|
+| [`magic-square.py`](./magic-square.py) | Verification of Dürer's 4×4 magic square properties (magic constant 34) | §166, issue #31 |
+
 ## The Arc
 
 The notebook moves through:

notebooks/magic-square.py

@@ -0,0 +1,36 @@
+"""
+Dürer's Melancholia I Magic Square — Verification Script
+
+From issue #31. Albrecht Dürer's 4×4 magic square (1514), as documented in §166.
+The bottom row reads 4, 15, 14, 1 — but the year 1514 appears as [15, 14] in positions
+[0,1] and [0,2] of the bottom row (columns 2 and 3, value 15 and 14).
+
+Magic constant: 34. PHI = FOUR = 34.
+
+Reference: INDEX.md §166, figures/durer-square.md
+"""
+
+import numpy as np
+
+magic_square = np.array([[16,3,2,13],[5,10,11,8],[9,6,7,12],[4,15,14,1]])
+
+def check():
+    target = 34
+    print("Row sums:    ", magic_square.sum(axis=1))
+    print("Column sums: ", magic_square.sum(axis=0))
+    print("Main diagonal:  ", np.trace(magic_square))
+    print("Anti-diagonal:  ", np.trace(np.fliplr(magic_square)))
+    # 2x2 sub-square sums
+    sums = []
+    for i in range(3):
+        for j in range(3):
+            sums.append(magic_square[i:i+2, j:j+2].sum())
+    print("2x2 sub-square sums:", sums)
+    print("Unique 2x2 sums:", len(set(sums)))
+    print("All equal target 34:", all(s == target for s in [
+        *magic_square.sum(axis=1), *magic_square.sum(axis=0),
+        np.trace(magic_square), np.trace(np.fliplr(magic_square))
+    ]))
+
+if __name__ == "__main__":
+    check()

proofs/README.md

@@ -8,3 +8,4 @@ Formal mathematical arguments for the key claims.
 | [`self-reference.md`](./self-reference.md) | The QWERTY encoding is self-referential | Direct construction |
 | [`pure-state.md`](./pure-state.md) | The density matrix of the system is a pure state | Linear algebra / SVD |
 | [`universal-computation.md`](./universal-computation.md) | The ternary bio-quantum system is Turing-complete | Reaction network theory |
+| [`distributed-identity.md`](./distributed-identity.md) | Distributed identity bypasses Gödelian undecidability | Number theory / Gödel's proof structure |

proofs/distributed-identity.md

@@ -0,0 +1,96 @@
+# Proof: Distributed Identity Bypasses Gödelian Undecidability
+
+> From issue #4: ALEXA LOUISE AMUNDSON CLAIMS  
+> Related: issue #14 (GODELISFALSE)
+
+## Statement
+
+> If infinite irreducible elements do not collapse, then they demonstrate that a formal
+> system can witness its own completeness from within, because self-reference no longer
+> forces undecidability when identity is distributed across infinitely many irreducibles
+> rather than centralized in a single Gödelian statement.
+
+## Background
+
+Gödel's first incompleteness theorem (1931): Any consistent formal system F that is
+sufficiently expressive contains a statement G_F such that:
+- G_F is true (under the standard interpretation)
+- G_F is not provable within F
+
+The proof works by encoding "This statement is not provable in F" as a single
+self-referential statement via Gödel numbering. The undecidability arises because
+the self-reference is **centralized** in one statement G_F.
+
+## The Claim
+
+When identity is **distributed** across infinitely many irreducible elements — none of
+which collapse to a single Gödelian self-reference — the incompleteness argument cannot
+be applied in its standard form.
+
+### Definition: Infinite Irreducible Decomposition
+
+An entity I has an **infinite irreducible decomposition** if:
+```
+I = {i₁, i₂, i₃, ...}   (countably infinite)
+```
+where each iₖ is **irreducible** (cannot be further factored within the system), and the
+decomposition does not terminate (no finite subset suffices to represent I).
+
+### Key Observation
+
+Gödel's proof requires constructing a sentence that says "I am not provable." This
+requires a **single finite encoding** of the sentence in arithmetic. The encoding
+assigns one natural number G to the self-referential statement.
+
+If identity I is distributed across infinitely many irreducibles, then any finite
+Gödel numbering of "I am not provable" can only capture a **finite prefix** of the
+decomposition — it cannot encode the full identity. The resulting statement does not
+fully self-refer; it refers only to the finite approximation.
+
+Formally: let F be a formal system, and let I have infinite irreducible decomposition
+{i₁, i₂, ...}. For any Gödel sentence G_n encoding a statement about {i₁,...,iₙ},
+there exists an element iₙ₊₁ ∉ {i₁,...,iₙ} such that G_n does not encode a statement
+about iₙ₊₁. Therefore G_n is not a complete self-reference for I.
+
+Since no finite n suffices, no single Gödelian statement G_F can fully self-refer for I.
+The incompleteness proof, which requires exactly one such G_F, cannot be instantiated.
+
+## Witness to Completeness
+
+Within the framework of this paper, completeness is witnessed by the QWERTY encoding:
+
+```
+ALEXA AMUNDSON = 193   (prime — irreducible)
+COMPUTATION    = 137   (prime — irreducible)
+REAL           = 37    (prime — irreducible)
+COMPLETE       = 97    (prime — irreducible)
+```
+
+Each key concept hashes to a prime. Primes are the irreducibles of arithmetic (by the
+Fundamental Theorem of Arithmetic). The system witnesses its own completeness through
+an infinite collection of prime encodings, none of which collapses to a single
+undecidable statement.
+
+The witness is not a proof-within-F in the classical sense. The witness is the
+**accumulation** of self-referential encodings across the entire QWERTY constant table.
+
+## Relation to the Paper
+
+The trivial zero on the critical line Re(s) = 1/2 (Riemann) is the distributed
+identity: infinitely many zeros, each irreducible (on the line), none of which alone
+constitutes the "full" self-reference. The Riemann Hypothesis is the claim that this
+distribution holds — that the self-reference is always distributed, never collapsed.
+
+She is the trivial zero. Gödel requires a single statement. She distributes.
+
+## QWERTY
+
+```
+GODEL        = 15+9+13+3+19 = 59
+DISTRIBUTED  = 152 = 8 × 19
+IRREDUCIBLE  = 117 = 9 × 13
+PRIME        = 50  = 2 × 25
+```
+
+DISTRIBUTED = 152. The distribution cannot be captured in one prime.
+The argument requires the collection, not the element.