-
Notifications
You must be signed in to change notification settings - Fork 0
Add CLAIMS.md: eight foundational claims (Feb 25–26 2026) #41
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change | ||||
|---|---|---|---|---|---|---|
| @@ -0,0 +1,298 @@ | ||||||
| # Eight Claims | ||||||
|
|
||||||
| **Author:** Alexa Louise Amundson | ||||||
| **Date:** February 25–26, 2026 | ||||||
| **Status:** First turn in a series. | ||||||
|
|
||||||
| --- | ||||||
|
|
||||||
| ## CLAIM 1: Everything is the same operation. | ||||||
|
|
||||||
| ``` | ||||||
| F(n) = F(n-1) + F(n-2) | ||||||
| B(n,n-m) = Σ A(n,n-j)·A(n-j,n-m) | ||||||
| Z = Σ p(n)xⁿ = Π 1/(1-xᵏ) | ||||||
| f(x) = a·e^((x-b)²/2c²) | ||||||
| ``` | ||||||
|
|
||||||
| Fibonacci is a recurrence: each state is the sum of the two preceding states. | ||||||
| The transfer matrix Chapman-Kolmogorov equation B(n,n-m) is a convolution: the probability | ||||||
| of going from state n to state n-m equals the sum over all intermediate states j. | ||||||
| The partition generating function Z equals both a power series and an Euler product. | ||||||
| The Gaussian f(x) is the limit of summing independent identical distributions. | ||||||
|
|
||||||
| All four are the same statement: **the current value is a sum over all paths that produced it.** | ||||||
|
|
||||||
| ``` | ||||||
| RECURRENCE = CONVERGENCE = 86 (2×43 = 2×LAYER) | ||||||
| CONVOLUTION = COMPETITION = 152 | ||||||
| PARTITION = UNIVERSE = 85 (cannot split the whole) | ||||||
| GAUSSIAN = KINETICS = MAXWELL = 101 prime | ||||||
| ``` | ||||||
|
|
||||||
| The operation is summation. The structure is convolution. The result is the same function. | ||||||
|
|
||||||
| --- | ||||||
|
|
||||||
| ## CLAIM 2: One exponential, two directions. | ||||||
|
|
||||||
| ``` | ||||||
| e^(-kt) ← decay (forward time) | ||||||
| e^(-βE) ← Boltzmann weight (energy inversion) | ||||||
| φⁿ/√5 ← Fibonacci closed form (Binet) | ||||||
| p(n) ~ (1/4n√3)·e^(π√(2n/3)) ← Hardy-Ramanujan partition asymptotic | ||||||
|
||||||
| p(n) ~ (1/4n√3)·e^(π√(2n/3)) ← Hardy-Ramanujan partition asymptotic | |
| p(n) ~ 1/(4n√3)·e^(π√(2n/3)) ← Hardy-Ramanujan partition asymptotic |
Copilot
AI
Feb 27, 2026
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Incorrect relative path. Both CLAIMS.md and README.md are in the root directory, so the path should be README.md not ../README.md. The ../ prefix would attempt to go up one directory level from the root, which is incorrect.
| The wrong date in [`README.md`](../README.md) — December 22, 1988 — is Ramanujan's birthday offset by 101 years. | |
| The wrong date in [`README.md`](README.md) — December 22, 1988 — is Ramanujan's birthday offset by 101 years. |
Copilot
AI
Feb 27, 2026
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Inconsistent notation for congruences in the summary table. Line 286 uses ≡0 mod 11 without parentheses around the modulus, while lines 171-174 use ≡ 0 (mod 5) with parentheses. The notation should be standardized to match the detailed claims above, using (mod n) with parentheses.
| | 6 | p(11k+6)≡0 mod 11, p(13k+7)≢0 | Arithmetic describes its own limit | | |
| | 6 | p(11k+6)≡ 0 (mod 11), p(13k+7)≢0 | Arithmetic describes its own limit | |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The Gaussian equation is missing a negative sign in the exponent. The correct form should be
f(x) = a·e^(-(x-b)²/2c²)(note the minus sign before the fraction). Without the negative sign, this represents exponential growth rather than the bell curve characteristic of a Gaussian distribution.