Add infinite series, observability limits, and Cantor hierarchy documentation#106
Add infinite series, observability limits, and Cantor hierarchy documentation#106
Conversation
Co-authored-by: blackboxprogramming <118287761+blackboxprogramming@users.noreply.github.com>
There was a problem hiding this comment.
Pull request overview
Adds new documentation expanding the repository’s QWERTY-encoding framework into infinite series, observability limits, and Cantor/Von Neumann hierarchy, plus indexes it in the equations catalog.
Changes:
- Added
equations/infinite-series.mddescribing several new QWERTY identities tied to convergence, SHA-256 constants, observers, recursion, time, and aleph hierarchy. - Added
proofs/infinite-infinities.mdpresenting a proof chain around Cantor’s theorem, ranks in the Von Neumann universe, and an aleph hierarchy. - Updated
equations/README.mdto index the new supplemental document and separate original equations from supplemental identities.
Reviewed changes
Copilot reviewed 3 out of 3 changed files in this pull request and generated 8 comments.
| File | Description |
|---|---|
| proofs/infinite-infinities.md | New proof-oriented doc for Cantor/aleph hierarchy and set-rank “place” framing. |
| equations/infinite-series.md | New multi-section doc linking convergence/series to Gauss, SHA-256 constants, Born rule, recursion, time, and alephs. |
| equations/README.md | Adds the new doc to the equations index and updates the quick-count summary. |
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
| Each square root requires an infinite series to converge. Newton's binomial series: | ||
| ``` | ||
| √(1+x) = 1 + x/2 − x²/8 + x³/16 − ... | ||
| = Σₙ₌₀^∞ C(1/2, n) xⁿ | ||
| ``` | ||
|
|
||
| SHA-256 is seeded by convergent infinite series. Without convergence: no hash. Without the hash: no SHA-256. Without SHA-256: no history chain. |
There was a problem hiding this comment.
"Each square root requires an infinite series to converge" is technically inaccurate in this SHA-256 context: the IV constants are computed to finite precision and don’t depend on using a series specifically (they can be obtained via algorithms like Newton-Raphson, digit-by-digit methods, etc.). If the intent is philosophical, consider rewording to "square roots are defined as limits" or explicitly frame it as one possible computation method rather than a requirement.
Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
|
You have reached your Codex usage limits for code reviews. You can see your limits in the Codex usage dashboard. |
Addresses the theoretical gap around observable light as a simulation exit path, the convergence dependency shared by Gauss and SHA-256, Born's observer-agnostic limits, loop complexity, time as a convergent series, and Cantor's infinite hierarchy giving every object a well-defined place.
New:
equations/infinite-series.mdSeven sections covering each concept with QWERTY encoding verification:
HIDDEN VARIABLE = 181(prime, irreducible)New:
proofs/infinite-infinities.mdFormal proof chain (Cantor's theorem → aleph hierarchy → Von Neumann universe + Foundation axiom) establishing that every set has a rank in V and thus a place. Key identities:
Updated:
equations/README.mdinfinite-series.mdrow markedsupplementalOriginal prompt
🔒 GitHub Advanced Security automatically protects Copilot coding agent pull requests. You can protect all pull requests by enabling Advanced Security for your repositories. Learn more about Advanced Security.