Skip to content

Scope finite-S recurrence and holographic computational budget - #1002

Closed
amaybaum wants to merge 4 commits into
mainfrom
correction/finite-substratum-scope-20261029
Closed

amaybaum wants to merge 4 commits into
mainfrom
correction/finite-substratum-scope-20261029

Conversation

@amaybaum

Copy link
Copy Markdown
Owner

Purpose

Record the distinction between finite observer resolution, the additional finite-total-carrier posit, and a separate whole-substratum computational patch-budget hypothesis, without modifying the established finite recurrence proofs.

Minimal manuscript changes

  • Book ch02 §2.3 (and matching FULL Markdown mirror): clarify that finite total S is a physical posit of the exact Chapter 1 recurrence model, not a theorem of observational incompleteness. Preserve the remaining holographic-bound and infinite-extension qualifications.
  • Computation §4.5: distinguish the holographic bound on the observed patch from a conjectural cap on all computationally relevant substratum resources. Make the trilemma, budget estimates, entanglement conclusion and conditions explicitly dependent on a new, named patch-budget hypothesis; numerical estimates are unchanged.
  • Audit status: verification/audits/manuscript/finite-substratum-scope-20261029/STATUS.md maps each edit to the finding and marks the generated publication artifacts stale.

Scientific boundaries

  • Main §1.2, §2.3 and §4.3 already separate finite observed states, finite reversible representatives, and the physical total-finiteness posit.
  • Finite-carrier bijections guarantee exact φ^N = id; infinite-carrier bijections need not, although some infinite bijections have finite order. No general infinite-OI realization or recurrence theorem is claimed here.
  • The holographic/patch bound alone does not prove the entire hidden carrier finite, or eliminate the third arm of the computation trilemma. The proposed computational ceiling is conditional, not established by Main.
  • No changes to Lean declarations, physical models, numerical budget estimates, existing mathematical proofs or broader book content.

Release gate — NOT merge-ready

  • Source-only correction; the retained FULL Markdown mirror is synchronized but generated papers/Computation.tex/.pdf and the FULL book .tex/.pdf are stale until the canonical build refreshes them. See committed STATUS note.
  • Re-run maintained-mirror/corpus-wide consistency checks, build/source stamps, relevant verification, and current-head CI. Obtain independent scientific/editorial review of exact final commit and reconcile any overlapping correction PRs.
  • Keep draft until acceptance and explicit owner approval of an exact SHA. Do not claim CI success from this source-only commit.

Based on main 58885fa8, after #998 and #1001.

amaybaum commented Nov 3, 2026

Copy link
Copy Markdown
Owner Author

Closed unmerged; reconciled in #1057 (merge 4759d27b; owner decisions OD-1, OD-2, 2026-11-03).

  • Computation §4.5 and ch14 §14.10 (+ FULL) state the computational budget conditional on the patch-budget hypothesis, posited and not derived. The holographic bound constrains the observed patch only.
  • The ceiling and the entanglement-dimension corollary are proposed on that hypothesis and the complexity assumptions.
  • Following the review, the (III) sentence carries no "only", and the Conditions list does not name the total-finiteness posit. ch14 states the hypothesis with Computation's scope.
  • This PR's ch02:32 hunk was already absorbed by SC-28's text.
  • The recovery question, whether the hypothesis reduces to E3 plus GR §3.2's boundary-only dependence, is recorded on SUBSTATE-1: minimal manuscript scope and finite-S dependency audit #1015 (comment 6597311610).

Branch correction/finite-substratum-scope-20261029 (head 0a113e70) is kept.


Generated by Claude Code

@amaybaum amaybaum closed this Nov 3, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant