From f20cc54d4d136e854608853372249882eb4c949f Mon Sep 17 00:00:00 2001 From: Dylan Roy <8n96mrd5d4@privaterelay.appleid.com> Date: Thu, 29 Oct 2026 17:00:46 +0000 Subject: [PATCH 1/6] fix: preserve exact source identities in freshness and reading lists --- docs/site/library-discovery.mjs | 4 +- docs/site/research-desk.mjs | 26 +- docs/site/workspace.html | 2 +- .../plans/2026-10-29-source-workflows.md | 61 +++++ .../2026-10-29-source-workflows-design.md | 74 +++++ tests/test_node_status_refresh.py | 200 +++++++++++++- tools/excerpt_source_save_browser_check.py | 258 ++++++++++++++++++ tools/node_status_refresh.py | 120 ++++++-- 8 files changed, 708 insertions(+), 37 deletions(-) create mode 100644 docs/superpowers/plans/2026-10-29-source-workflows.md create mode 100644 docs/superpowers/specs/2026-10-29-source-workflows-design.md create mode 100644 tools/excerpt_source_save_browser_check.py diff --git a/docs/site/library-discovery.mjs b/docs/site/library-discovery.mjs index 98687d04f..74543bd90 100644 --- a/docs/site/library-discovery.mjs +++ b/docs/site/library-discovery.mjs @@ -16,7 +16,7 @@ export function excerptSourceHref(excerpt) { return url+(first===last?`#L${first}`:`#L${first}-L${last}`); } -export function startLibraryDiscovery(doc,win,data,refreshLink=()=>{}) { +export function startLibraryDiscovery(doc,win,data,refreshLink=()=>{},options={}) { if(!doc.getElementById('research-desk')||doc.getElementById('library-collection')||!Array.isArray(data?.equations))return null; const section=doc.getElementById('current-research'),input=section?.querySelector('.current-search'); const search=input?.closest('details'),label=input?.closest('label'); @@ -59,9 +59,11 @@ export function startLibraryDiscovery(doc,win,data,refreshLink=()=>{}) { const preview=make('pre',excerpt.text.length>280?excerpt.text.slice(0,280)+'…':excerpt.text);row.append(preview); const identity=make('details');identity.append(make('summary','Excerpt identity')); identity.append(make('p','Commit: '+excerpt.commit),make('p','Excerpt SHA-256: '+excerpt.sha256));row.append(identity); + options.decorateSource?.(row,excerpt); return row; }); if(append)list.append(...rows);else list.replaceChildren(...rows); + options.onResults?.(); renderedQuery=input.value;renderedCount=offset+found.equations.length; count.textContent=`${found.matches} matching excerpts of ${found.total} acquired excerpts · ${renderedCount} shown. ${found.matches?'':'No acquired excerpt matches this query.'}`; more.hidden=renderedCount>=found.matches; diff --git a/docs/site/research-desk.mjs b/docs/site/research-desk.mjs index d47801ff0..ee4c7e83f 100644 --- a/docs/site/research-desk.mjs +++ b/docs/site/research-desk.mjs @@ -3,7 +3,7 @@ import {currentSnapshot} from './current.mjs?site-release=27f990a4758c48ff2f4aa5 import {SCHEMA,MAX_FILE_BYTES,validateEntry,entryKey,parseReadingList,mergeEntries,sourceHref,searchHref,readingListJSON} from './research-desk-store.mjs?site-release=547418ff3547b671266d1e46bf8d33f1f3eedf83571f6a0bb69ca9d7786ffaf3'; import {readingListCitationHref} from './reading-list-citation.mjs?site-release=02153e8e3acb70abca98685f5b274c0472eea6450ed2e9c3fc3125a7b0196968'; import {startLibrarySourceSearch} from './library-source-search.mjs?site-release=0f7fa4196362a427e070fc49f58f8a2935840e9d797358cb9d325e5db44ee612'; -import {startLibraryDiscovery} from './library-discovery.mjs?site-release=d3923565256aa274b8540ca2f7d6094e2d488fe5cdf15bbba13c74315dd3643f'; +import {startLibraryDiscovery} from './library-discovery.mjs?site-release=20c1e1d7a4c3f2b5a511ab83bf593b239ba5eaea428d1a4beb0ad9d4287b4e09'; export function sourceLinkKey(href) { try{ @@ -216,12 +216,30 @@ export function startResearchDesk(doc=document,win=window,snapshot=currentSnapsh attachCatalog(); snapshot.then(data=>{ if(!data)return; - const sourceTools=startLibrarySourceSearch(doc,win); - startLibraryDiscovery(doc,win,data,()=>sourceTools?.update()); currentData=data; for(const source of data.sources){ - try{const entry=validateEntry({kind:'source',collection:'current',repository:source.repository,commit:source.commit,path:source.path,blob:source.blob,bytes:source.bytes,observedAt:data.observed_at,savedAt:now()});currentSources.set(sourceLinkKey(sourceHref(entry)),entry);}catch{} + const pin={kind:'source',collection:'current',repository:source.repository,commit:source.commit,path:source.path,savedAt:now()}; + let key;try{key=sourceLinkKey(sourceHref(pin));}catch{continue;} + if(!key)continue; + // Count every safe pin before whole-file validation. Null keeps any + // duplicate ineligible, even identical rows or rejected whole metadata. + if(currentSources.has(key)){currentSources.set(key,null);continue;} + currentSources.set(key,null); + try{currentSources.set(key,validateEntry({...pin,blob:source.blob,bytes:source.bytes,observedAt:data.observed_at}));}catch{} } + const sourceTools=startLibrarySourceSearch(doc,win); + startLibraryDiscovery(doc,win,data,()=>sourceTools?.update(),{ + decorateSource(row,excerpt) { + // Match only the whole-file identity already validated above. Excerpt + // hashes describe the preview and never enter the saved source entry. + try{ + const href=sourceHref({kind:'source',collection:'current',repository:excerpt.repository,commit:excerpt.commit,path:excerpt.path,savedAt:now()}); + const source=currentSources.get(sourceLinkKey(href)); + if(source)addSourceButton(row,source); + }catch{} // Unmatched or invalid excerpts have no fabricated save identity. + }, + onResults:render + }); currentButton.disabled=false;attachCurrent(); }).catch(()=>{}); diff --git a/docs/site/workspace.html b/docs/site/workspace.html index 9743fdbf1..dd378801f 100644 --- a/docs/site/workspace.html +++ b/docs/site/workspace.html @@ -14,7 +14,7 @@ - + diff --git a/docs/superpowers/plans/2026-10-29-source-workflows.md b/docs/superpowers/plans/2026-10-29-source-workflows.md new file mode 100644 index 000000000..460da9def --- /dev/null +++ b/docs/superpowers/plans/2026-10-29-source-workflows.md @@ -0,0 +1,61 @@ +# Reliable Source Workflows Implementation Plan + +> **For agentic workers:** Use superpowers:executing-plans for the inline freshness repair; the independent UI task may be delegated with its own TDD gate. Record decisions and original execution evidence in the task ledger. + +**Goal:** Make operational source freshness and excerpt-to-source reuse accurate. +**Architecture:** Transient typed Git object observations feed the existing +refresher; narrow renderer callbacks feed the existing reading-list controller. +**Tech stack:** Python standard library, existing browser JavaScript, installed +optional Playwright/Chromium for bounded engineering verification. +**Spec:** docs/superpowers/specs/2026-10-29-source-workflows-design.md + +## Global constraints + +No record/schema/math/workflow/protection changes; pins never advance implicitly. +Unknown evidence stays unknown; excerpt hashes never become whole-file hashes. +Reuse current storage/citation and source-admission logic. Preserve original +failed runs and unique output directories. No new dependency or scientific review. + +## Review focus + +- Tree or blob changes and different current types must never falsely be fresh. +- Missing, truncated, duplicate-path, symlink/submodule or malformed responses must fail closed. +- Snapshot pins after last path edits must retain fresh identity and original pins. +- Unmatched/ambiguous excerpt identities must not enter saved-source storage. +- Append/history/cross-tab/removal/undo must synchronize all duplicate save controls without losing reading context. + +## Task 1 — Operational object freshness (Root inline) + +Files: tools/node_status_refresh.py; tests/test_node_status_refresh.py. +Interface: github_fetch returns a URL-bound typed GitSourceState for pinned +sources, existing discussion timestamps otherwise. refresh_record consumes it +strictly while retaining existing injected scalar/tuple compatibility. + +- [ ] Add independent offline API-boundary regressions for unchanged snapshot pins, + changed blob/tree, missing/malformed data, fixed-tip traversal and identity mismatch. +- [ ] Run them against unchanged product and preserve the expected failing output. +- [ ] Implement minimal fixed-commit nonrecursive Git-tree comparison and strict validation. +- [ ] Run all existing refresher tests and optimized interpreter controls. +- [ ] Compare the real unchanged public proof source report without writing records. + +## Task 2 — Save a whole source from an excerpt (disjoint UI implementer) + +Files: docs/site/library-discovery.mjs; research-desk.mjs initialization only; +tests/test_library_discovery.mjs or a focused companion; new bounded browser check. +Interface: source decorator receives (row, excerpt); post-render callback updates +existing save states. Desk validates exact source lookup and uses its one controller. + +- [ ] Add a real-browser failure for text query → source save → list/citation. +- [ ] Implement exact admitted-source decoration after populating the source map. +- [ ] Verify duplicate/append/remove/undo/reload behavior and unmatched-source refusal, + retaining whole-file versus excerpt identity separation at phone/desktop sizes. +- [ ] Run relevant discovery/desk/store/citation tests and existing18-case discovery checks. + +## Task 3 — Frozen review, integration and delivery + +- [ ] Stage new site/test files, regenerate/check canonical asset keys once inputs stabilize. +- [ ] Run one final applicable complete local verification with source-qualified originals. +- [ ] Obtain fresh nonauthor whole-branch engineering review; fix reproduced findings. +- [ ] Create/Ready one ordinary PR, qualify actual hosted gates and integrate with expected-head guard through a separate integrator. +- [ ] Verify actual published source/native bytes and fresh downloaded offline copy. +- [ ] Deliver additive source/working/evidence/HANDOFF archives and one existing-register delivery; preserve prior Drive items and personally release own scope. diff --git a/docs/superpowers/specs/2026-10-29-source-workflows-design.md b/docs/superpowers/specs/2026-10-29-source-workflows-design.md new file mode 100644 index 000000000..8d88b32b8 --- /dev/null +++ b/docs/superpowers/specs/2026-10-29-source-workflows-design.md @@ -0,0 +1,74 @@ +# Reliable source freshness and reuse + +The owner requests useful project-wide improvement, peer assistance and continued +implementation without repeated permission questions. These engineering repairs +close two reproduced gaps on Main `4ef1867175dbe1072a54a02e95f80c4e2c70a4ff`. +Implementation choices below are the agents' calls under that delegation. + +## Operational freshness + +The refresher compares a URL's snapshot commit to the latest commit that changed +its path. An unchanged file last modified at A and pinned at a later snapshot B +is consequently marked stale. The public SIDE24 proof has identical pinned and +current blob `44b66f04f89fcd87383b3603fa69f1feb64cdddd`, despite different last-change +and snapshot commits. The preserved pre-fix reproduction returns stale. + +Compare pinned/current Git object type and SHA instead. Resolve the current +default-branch commit once per source observation, then walk its fixed Git tree +and the pinned commit's tree nonrecursively. Reject malformed, truncated, +ambiguous, missing or unsupported object responses; these remain unknown. +A typed transient observation binds the URL, pin, current commit and object +identities. Keep existing injected scalar/tuple fetchers compatible. Never write +the moving commit into source_rev, change schemas or reinterpret scientific +validity. Discussion timestamp and owner-release behavior remain as before. + +Alternatives considered: retaining the commit comparison perpetuates the false +warning; ancestry-based inference complicates renamed/reverted paths without +answering whether the referenced object changed. Git object comparison answers +the actual path-content question directly. HTTPS GitHub metadata is operational +identity evidence, not a new mathematical source-custody certificate. + +## Acquired excerpt to source reference + +The admitted acquired-text result currently provides a source link, preview and +excerpt hash, but no path into the existing reading-list/citation flow. Add the +existing Save source control only when the excerpt's exact repository, commit +and path match a validated source entry in that same admitted observation. +Delegate storage, deduplication, export, removal/undo and citation to the existing +research desk. Its source identity contains the whole-file Git blob/byte count; +the excerpt SHA stays in the excerpt disclosure and is never a whole-file hash. + +The discovery renderer gets narrow source-decoration and post-render callbacks. +Populate the desk's validated source map before initializing discovery. Refresh +save-button states after replacement/appending and existing list mutations. An +unmatched excerpt has no fabricated save identity. Existing query collection, +paging, URL/history, focus, source admission and hidden text-search saving rules +remain. No new storage schema or semantic/equation-to-theorem join is introduced. + +Alternatives considered: a second storage/controller creates competing ownership +and data semantics; requiring a manual file-path search leaves the broken reader +journey. Reusing the one existing controller is the smallest coherent repair. + +## Scope and evidence + +Semantic paths: tools/node_status_refresh.py, tests/test_node_status_refresh.py, +docs/site/library-discovery.mjs, the research-desk initialization callback and +focused logic/browser regressions. Open PR501 changes only a canonical import +key in research-desk.mjs; its collector/publication-transition work is untouched. +The complete 42-PR path inventory and actual browser/source observations are +retained in the private execution evidence. Canonical asset rewrites follow the +site guide; a fresh nonauthor engineering review checks the frozen whole branch. + +Acceptance: snapshot B with unchanged blob/tree is fresh; changed object is +stale; unavailable/malformed evidence is unknown; source pins and record content +are preserved in report-only mode. On desktop/phone, text query → save source → +reading list → exact pinned citation works, duplicate excerpts share save state, +and appended/history-restored rows remain usable. Missing/mismatched source +identities cannot be saved. Existing focused controls and required hosted checks +must pass before ordinary guarded integration and actual public/offline replay. + +No mathematical statement, review, acceptance, import applicability, certificate, +status record, workflow, protection or existing Drive item is changed. Same-family +separate engineering review is allowed; scientific effect NONE, organizational +independence credit0. Remaining literature, scientific review, physical-device/AT +and large-graph performance gaps are not declared solved by this repair. diff --git a/tests/test_node_status_refresh.py b/tests/test_node_status_refresh.py index 765b5ea08..b8fb50148 100644 --- a/tests/test_node_status_refresh.py +++ b/tests/test_node_status_refresh.py @@ -1,5 +1,6 @@ """Offline tests for tools/node_status_refresh.py (LANES-20261022 Lane 3). No network.""" import copy +import io import json import shutil import sys @@ -407,23 +408,15 @@ def fetch(url): self.assertEqual(path.read_bytes(), before) self.assertEqual(calls, []) - def test_github_fetch_uses_moving_ref_for_pinned_url(self): + def test_github_fetch_preserves_discussion_timestamp_endpoints(self): seen = [] def fake(path): seen.append(path) - if "/commits?" in path: - return [{"sha": "ab" * 20, "commit": {"committer": {"date": "2026-10-22T18:00:00+00:00"}}}] return {"updated_at": "2026-10-22T17:30:25+00:00"} nsr._api_get = fake pin = "1" * 40 - url = "https://github.com/d6g8k5htny-coder/Math-/blob/" + pin + "/frontiers/downstream_gate_20260925/GRAPH.json" - self.assertEqual(nsr.github_fetch(url), "ab" * 20) - self.assertEqual(len(seen), 1) - self.assertIn("/repos/d6g8k5htny-coder/Math-/commits?", seen[0]) - self.assertNotIn("sha=", seen[0]) - self.assertNotIn(pin, seen[0]) self.assertEqual(nsr.github_fetch("https://github.com/d6g8k5htny-coder/main/issues/475"), "2026-10-22T17:30:25Z") self.assertIn("/repos/d6g8k5htny-coder/main/issues/475", seen[-1]) self.assertEqual(nsr.github_fetch("https://github.com/d6g8k5htny-coder/main/pull/495"), "2026-10-22T17:30:25Z") @@ -438,6 +431,195 @@ def fake(path): nsr.github_fetch("https://github.com/example/repo/blob/" + pin + "/a.md") +class GitObjectFreshnessTests(unittest.TestCase): + """Exercise the real refresher with fixed, hand-derived GitHub API objects.""" + + pin, tip, older = "1" * 40, "2" * 40, "9" * 40 + pin_tree, tip_tree = "3" * 40, "4" * 40 + pin_dir, tip_dir = "5" * 40, "6" * 40 + blob, other_blob = "7" * 40, "8" * 40 + + def source_record(self, kind="blob", path="docs/proof.md"): + url = f"https://github.com/d6g8k5htny-coder/Math-/{kind}/{self.pin}/{path}" + rec = load("fresh.json") + rec["sources"] = [{"url": url, "rev": self.pin}] + rec["source_rev"] = self.pin + return rec + + def api(self, changed=False): + base = "/repos/d6g8k5htny-coder/Math-" + def tree(sha, rows): + return {"sha": sha, "tree": rows, "truncated": False} + def entry(path, kind, sha, mode): + return {"path": path, "type": kind, "sha": sha, "mode": mode} + directory = self.tip_dir if changed else self.pin_dir + responses = { + base + "/commits?per_page=1": [{"sha": self.tip, "commit": {"tree": {"sha": self.tip_tree}}}], + base + "/git/commits/" + self.pin: {"sha": self.pin, "tree": {"sha": self.pin_tree}}, + base + "/git/trees/" + self.pin_tree: tree(self.pin_tree, [entry("docs", "tree", self.pin_dir, "040000")]), + base + "/git/trees/" + self.tip_tree: tree(self.tip_tree, [entry("docs", "tree", directory, "040000")]), + base + "/git/trees/" + self.pin_dir: tree(self.pin_dir, [entry("proof.md", "blob", self.blob, "100644")]), + base + "/git/trees/" + self.tip_dir: tree(self.tip_dir, [entry("proof.md", "blob", self.other_blob, "100644")]), + # What the old implementation asks: older path-modification commit, + # even though the referenced object is identical at pin and tip. + base + "/commits?path=docs/proof.md&per_page=1": [{"sha": self.older}], + base + "/commits?path=docs&per_page=1": [{"sha": self.older}], + } + seen = [] + def fetch(path): + seen.append(path) + if path not in responses: + raise nsr.SourceError("unexpected or unavailable API path: " + path) + return copy.deepcopy(responses[path]) + return base, responses, seen, fetch + + def refresh(self, rec, api): + original = copy.deepcopy(rec) + with patch.object(nsr, "_api_get", api): + result = nsr.refresh_record(rec, nsr.github_fetch, NOW) + self.assertEqual(rec, original) + self.assertEqual(result["source_rev"], self.pin) + self.assertEqual(result["sources"], original["sources"]) + self.assertEqual(result["scientific_effect"], "NONE") + return result + + def test_snapshot_after_last_path_edit_is_fresh_for_same_blob(self): + _, _, seen, api = self.api() + out = self.refresh(self.source_record(), api) + self.assertEqual(out["status"], "fresh") + self.assertIsNone(out["refresh_error"]) + self.assertNotIn(self.tip, json.dumps(out)) + self.assertEqual(sum(path.endswith("/commits?per_page=1") for path in seen), 1) + + def test_unchanged_directory_uses_tree_identity(self): + _, _, _, api = self.api() + self.assertEqual(self.refresh(self.source_record("tree", "docs"), api)["status"], "fresh") + + def test_changed_blob_or_directory_is_stale(self): + for kind, path in [("blob", "docs/proof.md"), ("tree", "docs")]: + with self.subTest(kind=kind): + _, _, _, api = self.api(changed=True) + self.assertEqual(self.refresh(self.source_record(kind, path), api)["status"], "stale") + + def test_unavailable_or_untrustworthy_object_is_unknown(self): + base = "/repos/d6g8k5htny-coder/Math-" + tip_tree_path = base + "/git/trees/" + self.tip_tree + cases = [ + (tip_tree_path, None), + (tip_tree_path, {"sha": self.tip_tree, "tree": [], "truncated": True}), + (tip_tree_path, {"sha": self.tip_tree, "tree": [], "truncated": False}), + (base + "/git/commits/" + self.pin, {"sha": self.tip, "tree": {"sha": self.pin_tree}}), + (base + "/commits?per_page=1", [{"sha": "bad", "commit": {"tree": {"sha": self.tip_tree}}}]), + ] + for key, value in cases: + with self.subTest(key=key, value=value): + _, responses, _, api = self.api() + responses[key] = value + out = self.refresh(self.source_record(), api) + self.assertEqual(out["status"], "unknown") + self.assertTrue(out["refresh_error"]) + + def test_duplicate_or_unsupported_target_is_unknown(self): + for mode, kind, duplicate in [("040000", "tree", True), ("160000", "commit", False), ("120000", "blob", False)]: + with self.subTest(mode=mode, duplicate=duplicate): + base, responses, _, api = self.api() + row = responses[base + "/git/trees/" + self.tip_tree]["tree"][0] + row.update(mode=mode, type=kind) + if duplicate: + responses[base + "/git/trees/" + self.tip_tree]["tree"].append(copy.deepcopy(row)) + out = self.refresh(self.source_record(), api) + self.assertEqual(out["status"], "unknown") + self.assertTrue(out["refresh_error"]) + + def test_object_type_change_is_stale_even_when_sha_text_matches(self): + base, responses, _, api = self.api(changed=True) + target = responses[base + "/git/trees/" + self.tip_dir]["tree"][0] + target.update(type="tree", mode="040000", sha=self.blob) + self.assertEqual(self.refresh(self.source_record(), api)["status"], "stale") + + def test_observation_must_bind_exact_url_pin_type_and_valid_hashes(self): + rec = self.source_record() + _, _, _, api = self.api() + with patch.object(nsr, "_api_get", api): + observation = nsr.github_fetch(rec["sources"][0]["url"]) + self.assertEqual(observation.current_revision, self.tip) + for mutation in [ + {"url": rec["sources"][0]["url"] + "-other"}, + {"pinned_revision": self.tip}, {"pinned_type": "tree"}, + {"current_revision": "bad"}, {"pinned_sha": "bad"}, + {"current_sha": "bad"}, {"current_type": "commit"}, + ]: + with self.subTest(mutation=mutation): + changed = observation._replace(**mutation) + out = nsr.refresh_record(rec, lambda url: changed, NOW) + self.assertEqual(out["status"], "unknown") + self.assertTrue(out["refresh_error"]) + + def test_url_kind_must_match_the_pinned_object(self): + _, _, _, api = self.api() + out = self.refresh(self.source_record("tree", "docs/proof.md"), api) + self.assertEqual(out["status"], "unknown") + + def test_source_path_cannot_cross_a_file_or_use_dot_segments(self): + for path in ["docs/proof.md/nested", "docs/../proof.md", "docs//proof.md"]: + with self.subTest(path=path): + _, _, _, api = self.api() + self.assertEqual(self.refresh(self.source_record(path=path), api)["status"], "unknown") + + def test_report_only_keeps_entire_original_record_bytes(self): + _, _, _, api = self.api() + with tempfile.TemporaryDirectory() as tmp: + path = Path(tmp) / "source.json" + path.write_text(json.dumps(self.source_record()) + "\n") + before = path.read_bytes() + with patch.object(nsr, "_api_get", api): + report = nsr.refresh_dir(Path(tmp), nsr.github_fetch, False, NOW) + self.assertEqual(report[0]["status"], "fresh") + self.assertEqual(path.read_bytes(), before) + + def test_raw_api_duplicate_object_keys_are_unknown(self): + base, responses, _, _ = self.api() + current = base + "/git/trees/" + self.tip_tree + raw = json.dumps(responses[current]) + rows = json.dumps(responses[current]["tree"]) + variants = [ + '{"sha":"' + self.tip_tree + '","tree":[],"tree":' + rows + ',"truncated":false}', + raw.replace('"sha": "' + self.pin_dir + '"', + '"sha":"' + self.tip_dir + '","sha":"' + self.pin_dir + '"'), + raw.replace('"truncated": false', '"truncated": true,"truncated": false'), + ] + for ambiguous in variants: + with self.subTest(response=ambiguous): + wires = {path: json.dumps(value).encode() for path, value in responses.items()} + wires[current] = ambiguous.encode() + def opening(request, timeout): + return io.BytesIO(wires[request.full_url.removeprefix(nsr.API)]) + with patch.object(nsr.urllib.request, "urlopen", opening): + out = nsr.refresh_record(self.source_record(), nsr.github_fetch, NOW) + self.assertEqual(out["status"], "unknown") + self.assertIn("duplicate JSON key", out["refresh_error"]) + + def test_raw_api_valid_object_controls(self): + for changed, expected in [(False, "fresh"), (True, "stale")]: + with self.subTest(changed=changed): + _, responses, _, _ = self.api(changed=changed) + wires = {path: json.dumps(value).encode() for path, value in responses.items()} + def opening(request, timeout): + return io.BytesIO(wires[request.full_url.removeprefix(nsr.API)]) + with patch.object(nsr.urllib.request, "urlopen", opening): + out = nsr.refresh_record(self.source_record(), nsr.github_fetch, NOW) + self.assertEqual(out["status"], expected) + self.assertIsNone(out["refresh_error"]) + + def test_raw_discussion_duplicate_timestamp_is_unknown(self): + rec = load("issue.json") + raw = b'{"updated_at":"2026-10-23T17:00:00Z","updated_at":"2026-10-22T17:00:00Z"}' + with patch.object(nsr.urllib.request, "urlopen", lambda request, timeout: io.BytesIO(raw)): + out = nsr.refresh_record(rec, nsr.github_fetch, NOW) + self.assertEqual(out["status"], "unknown") + self.assertIn("duplicate JSON key", out["refresh_error"]) + + # FU-3: bounded complete comment listings, using only synthetic API pages. M = nsr PREFIX = "https://github.com/d6g8k5htny-coder/main/issues/419#issuecomment-" diff --git a/tools/excerpt_source_save_browser_check.py b/tools/excerpt_source_save_browser_check.py new file mode 100644 index 000000000..010a60cb8 --- /dev/null +++ b/tools/excerpt_source_save_browser_check.py @@ -0,0 +1,258 @@ +#!/usr/bin/env python3 +"""Source-bound acquired-excerpt save/citation regression; engineering only.""" +import argparse +from contextlib import contextmanager +from datetime import datetime, timezone +from functools import partial +from hashlib import sha256 +from http.server import SimpleHTTPRequestHandler, ThreadingHTTPServer +import json +from pathlib import Path +import shutil +import threading +import traceback +from urllib.parse import quote, urlsplit + +ROOT = Path(__file__).resolve().parents[1] +SCHEMA = 'universal-law-reading-list/v1' + +@contextmanager +def serve(site): + class Quiet(SimpleHTTPRequestHandler): + def log_message(self, *_): pass + server = ThreadingHTTPServer(('127.0.0.1', 0), partial(Quiet, directory=str(site))) + worker = threading.Thread(target=server.serve_forever, daemon=True) + worker.start() + try: yield f'http://127.0.0.1:{server.server_port}/' + finally: server.shutdown(); server.server_close(); worker.join() + +def main(): + ap = argparse.ArgumentParser(description=__doc__) + ap.add_argument('--site', type=Path, default=ROOT/'docs/site') + ap.add_argument('--origin') + ap.add_argument('--browser', default=shutil.which('chromium')) + ap.add_argument('--output', required=True, type=Path) + args = ap.parse_args(); args.output.mkdir(parents=True, exist_ok=False) + report = {'started_utc': datetime.now(timezone.utc).isoformat(), 'cases': [], 'page_errors': [], + 'driver_sha256': sha256(Path(__file__).read_bytes()).hexdigest(), 'scientific_effect': 'NONE', + 'scope': 'Actual admitted observation; local driver hash alone does not establish public served bytes.'} + def run(origin, browser): + from playwright.sync_api import expect + report['origin'] = origin + # Bind replay to the expected served implementation, including admission + # and the one storage/citation controller. Hash decoded UTF-8 file bytes. + paths=['workspace.html','library-discovery.mjs','research-desk.mjs','current.mjs', + 'current-model.mjs','current.json','current-meta.json','research-desk-store.mjs', + 'reading-list-citation.mjs','library-source-search.mjs'] + binding_context=browser.new_context() + binding_context.route('**/*', lambda route: route.continue_() if route.request.url.startswith(origin) else route.abort()) + binding_page=binding_context.new_page() + binding={'case':'served-source-binding','files':{}};report['cases'].append(binding) + try: + binding_page.goto(origin+'index.html') + fetched=binding_page.evaluate('''async(paths)=>await Promise.all(paths.map(async path=>{ + const response=await fetch(path,{cache:'no-store'}); + if(!response.ok)throw Error(path+': '+response.status); + return [path,await response.text()]; + }))''',paths) + for path,body in fetched: + actual=body.encode('utf-8');expected=(args.site/path).read_bytes() + identity={'bytes':len(actual),'sha256':sha256(actual).hexdigest()} + binding['files'][path]=identity + assert actual==expected, 'Served bytes differ from --site: '+path + binding['passed']=True + except Exception:binding['passed']=False;binding['error']=traceback.format_exc() + finally:binding_context.close() + for width, height, theme in [(390,844,'dark'), (1440,1000,'light')]: + context = browser.new_context(viewport={'width':width,'height':height}, color_scheme=theme) + context.route('**/*', lambda route: route.continue_() if route.request.url.startswith(origin) else route.abort()) + page = context.new_page(); page.set_default_timeout(8000) + page.on('pageerror', lambda error: report['page_errors'].append(str(error))) + row = {'case':'excerpt-source-save-'+str(width),'width':width,'theme':theme}; report['cases'].append(row) + try: + page.goto(origin+'workspace.html#library-current') + field=page.locator('#current-research .current-search'); select=page.locator('#library-collection') + expect(field).to_be_enabled(); expect(select).to_be_visible() + raw, meta=page.evaluate("async()=>await Promise.all([fetch('current.json').then(r=>r.text()),fetch('current-meta.json').then(r=>r.json())])") + assert len(raw.encode())==meta['bytes'] and sha256(raw.encode()).hexdigest()==meta['sha256'] + data=json.loads(raw) + # Literal text query returns two excerpts of the same actual source. + query='hess' + excerpts=[e for e in data['equations'] if query in (e['text']+' '+e['repository']+' '+e['path']).lower()] + assert len(excerpts)==2 and len({(e['repository'],e['commit'],e['path']) for e in excerpts})==1 + excerpt=excerpts[0] + source=next(s for s in data['sources'] if all(s[k]==excerpt[k] for k in ['repository','commit','path'])) + row['observation']={'bytes':meta['bytes'],'sha256':meta['sha256'],'source':source,'excerpt_sha256':[e['sha256'] for e in excerpts]} + field.fill(query);select.select_option('text') + results=page.locator('#library-text-results > li');expect(results).to_have_count(2) + assert page.locator('#desk-save-current').is_hidden() + buttons=results.locator('.desk-save-source') + expect(buttons, 'Matched acquired excerpts must offer the existing source-save control').to_have_count(2) + for i,e in enumerate(excerpts): + assert sha256(e['text'].encode()).hexdigest()==e['sha256'] + assert e['sha256'] in results.nth(i).locator('details').text_content() + buttons.first.focus();page.keyboard.press('Enter') + expect(page.locator('#desk-count')).to_have_text('1 saved item') + expect(buttons.first).to_be_disabled();expect(buttons.last).to_be_disabled() + saved=json.loads(page.evaluate('(key)=>localStorage.getItem(key)',SCHEMA))['entries'] + assert len(saved)==1;entry=saved[0] + for key in ['repository','commit','path','blob','bytes']:assert entry[key]==source[key],(key,entry,source) + assert 'sha256' not in entry and entry['blob'] not in [e['sha256'] for e in excerpts] + reading=page.locator('#reading-list');reading.evaluate('(e)=>e.open=true') + saved_row=page.locator('#desk-entries > li');expect(saved_row).to_have_count(1) + href='https://github.com/'+source['repository']+'/blob/'+source['commit']+'/'+quote(source['path'],safe="/~!*'()") + expect(saved_row.locator(':scope > div > a').first).to_have_attribute('href',href) + saved_row.locator('.desk-remove').click() + expect(page.locator('#desk-count')).to_have_text('0 saved items') + expect(buttons.first).to_be_enabled();expect(buttons.last).to_be_enabled() + page.locator('#desk-undo').click() + expect(page.locator('#desk-count')).to_have_text('1 saved item') + expect(buttons.first).to_be_disabled();expect(buttons.last).to_be_disabled() + # Cross-tab updates use the same pre-existing storage controller. + other=context.new_page();other.goto(page.url) + expect(other.locator('#desk-count')).to_have_text('1 saved item') + other.locator('#reading-list').evaluate('(e)=>e.open=true') + other.locator('.desk-remove').click() + expect(page.locator('#desk-count')).to_have_text('0 saved items');expect(buttons.first).to_be_enabled() + other.locator('#desk-undo').click() + expect(page.locator('#desk-count')).to_have_text('1 saved item');expect(buttons.last).to_be_disabled();other.close() + # Existing whole-file identity is exported, never the excerpt digest. + with page.expect_download() as download: + page.locator('#desk-export').click() + exported=json.loads(Path(download.value.path()).read_text()) + assert exported['entries']==json.loads(page.evaluate('(key)=>localStorage.getItem(key)',SCHEMA))['entries'] + row['export_entry']=exported['entries'][0] + # Source reference receives the exact whole-file source identity. + page.locator('.desk-cite-source').click() + expect(page.locator('#reference-repository')).to_have_value(source['repository'].split('/')[1]) + expect(page.locator('#reference-commit')).to_have_value(source['commit']) + expect(page.locator('#reference-path')).to_have_value(source['path']) + expect(page.locator('#reference-sha256')).to_have_value('') + assert json.loads(page.locator('#reference-json').text_content())['verification']=='not_performed' + page.go_back();expect(select).to_have_value('text');expect(field).to_have_value(query) + expect(results.locator('.desk-save-source').first).to_be_disabled() + page.reload();expect(select).to_have_value('text');expect(field).to_have_value(query) + expect(results.locator('.desk-save-source').last).to_be_disabled() + # Appended excerpts of this source immediately share saved state. + field.fill(source['path']);expect(results).to_have_count(10) + initial=results.first.locator(':scope > a').get_attribute('href') + page.locator('#library-text-more').focus();page.keyboard.press('Enter') + expect(results).to_have_count(20);expect(results.nth(10).locator(':scope > a')).to_be_focused() + expect(results.nth(10).locator('.desk-save-source')).to_be_disabled() + assert results.first.locator(':scope > a').get_attribute('href')==initial + # Collection changes retain the existing Files save/citation flow. + select.select_option('files');expect(page.locator('.current-results > li')).to_have_count(1) + expect(page.locator('.current-results .desk-save-source')).to_be_disabled() + select.select_option('text');expect(results).to_have_count(10) + expect(results.locator('.desk-save-source').first).to_be_disabled() + page.screenshot(path=str(args.output/(row['case']+'.png'))) + row['passed']=True + except Exception: + row['passed']=False;row['error']=traceback.format_exc() + page.screenshot(path=str(args.output/(row['case']+'-failed.png'))) + finally:context.close() + context=browser.new_context() + page=context.new_page();page.set_default_timeout(8000) + page.on('pageerror', lambda error: report['page_errors'].append(str(error))) + fixture={'case':'exact-match-controller-negative-controls', + 'scope':'Isolated engineering controller inputs based on actual source; no admission/acquisition claim.'} + report['cases'].append(fixture) + try: + page.goto(origin+'index.html') + fixture['results']=page.evaluate("""async()=>{ + const {startResearchDesk}=await import('./research-desk.mjs'); + const data=await fetch('current.json').then(r=>r.json()); + const e=data.equations[0],source=data.sources.find(s=>['repository','commit','path'].every(k=>s[k]===e[k])); + if(!source)throw Error('Actual excerpt source missing'); + const changed=[e,{...e,commit:'a'.repeat(40)},{...e,path:e.path+'.unmatched'},{...e,repository:'d6g8k5htny-coder/Math-'}]; + const doc=document.implementation.createHTMLDocument('Isolated controller negative controls'); + doc.body.innerHTML='

Reading list

Sources

    '; + startResearchDesk(doc,window,Promise.resolve({...data,sources:[source],equations:changed})); + await new Promise(resolve=>setTimeout(resolve,30)); + const select=doc.getElementById('library-collection');select.value='text';select.dispatchEvent(new Event('change')); + const rows=[...doc.querySelectorAll('#library-text-results > li')]; + return rows.map((row,i)=>({index:i,buttons:row.querySelectorAll('.desk-save-source').length,href:row.querySelector(':scope > a').href})); + }""") + assert [r['buttons'] for r in fixture['results']]==[1,0,0,0],fixture['results'] + fixture['passed']=True + except Exception:fixture['passed']=False;fixture['error']=traceback.format_exc() + finally:context.close() + # Exercise duplicate inventory through the unchanged hash-bound production + # admission path. These are synthetic engineering inputs, never sources. + for variant in ['conflicting', 'identical', 'unsafe-byte-count']: + context=browser.new_context(viewport={'width':1440,'height':1000}) + page=context.new_page();page.set_default_timeout(8000) + page.on('pageerror',lambda error:report['page_errors'].append(str(error))) + duplicate_case={'case':'duplicate-source-'+variant, + 'scope':'Synthetic inventory through unchanged production hash-bound admission; engineering only.'} + report['cases'].append(duplicate_case) + try: + raw=(args.site/'current.json').read_bytes();data=json.loads(raw) + excerpt=next(e for e in data['equations'] if 'hess' in (e['text']+' '+e['repository']+' '+e['path']).lower()) + source=next(s for s in data['sources'] if all(s[k]==excerpt[k] for k in ['repository','commit','path'])) + duplicate=dict(source) + if variant=='conflicting':duplicate.update(blob='a'*40,bytes=source['bytes']+1) + elif variant=='unsafe-byte-count':duplicate['bytes']=9007199254740992 + data['sources'].append(duplicate) + mutated=json.dumps(data,ensure_ascii=False,separators=(',',':')).encode('utf-8') + html=(args.site/'workspace.html').read_bytes().replace(sha256(raw).hexdigest().encode(),sha256(mutated).hexdigest().encode()).replace(str(len(raw)).encode(),str(len(mutated)).encode()) + duplicate_case.update(original_source=source,duplicate_source=duplicate, + original_payload_sha256=sha256(raw).hexdigest(),synthetic_payload_sha256=sha256(mutated).hexdigest()) + base_path=urlsplit(origin).path + def synthetic(route): + if not route.request.url.startswith(origin):route.abort();return + path=urlsplit(route.request.url).path + if path==base_path+'workspace.html':route.fulfill(status=200,content_type='text/html',body=html) + elif path==base_path+'current.json':route.fulfill(status=200,content_type='application/json',body=mutated) + else:route.continue_() + context.route('**/*',synthetic) + page.goto(origin+'workspace.html?source-q=hess&library-collection=text#library-current') + select=page.locator('#library-collection');field=page.locator('#current-research .current-search') + expect(select).to_have_value('text');expect(field).to_be_enabled() + expect(page.locator('.current-state')).to_contain_text('Verified source observation:') + notice=page.locator('.current-acquisition-notice') + expect(notice).to_contain_text('invalid_acquisition_identity' if variant=='unsafe-byte-count' else 'duplicate_inventory_identity') + duplicate_case['acquisition_notice']=notice.text_content() + expect(page.locator('#library-text-results > li')).to_have_count(2) + duplicate_case['text_save_controls']=page.locator('#library-text-results .desk-save-source').count() + expect(page.locator('#library-text-results .desk-save-source'), + 'Ambiguous whole-source identity must never be offered for saving').to_have_count(0) + field.fill(source['path']);expect(page.locator('#library-text-results > li')).to_have_count(10) + page.locator('#library-text-more').click();expect(page.locator('#library-text-results > li')).to_have_count(20) + expect(page.locator('#library-text-results .desk-save-source')).to_have_count(0) + select.select_option('files');expect(page.locator('.current-results > li')).to_have_count(2) + expect(page.locator('.current-results .desk-save-source')).to_have_count(0) + duplicate_case['files_save_controls']=page.locator('.current-results .desk-save-source').count() + expect(page.locator('#desk-count')).to_have_text('0 saved items') + # Ambiguity blocks only this key; a different unique source keeps + # the existing save/storage identity and remains usable. + unique=next(s for s in data['sources'] if s['path']!=source['path']) + field.fill(unique['repository']+' '+unique['path']);expect(page.locator('.current-results > li')).to_have_count(1) + expect(page.locator('.current-results .desk-save-source')).to_have_count(1) + page.locator('.current-results .desk-save-source').click() + expect(page.locator('#desk-count')).to_have_text('1 saved item') + saved=json.loads(page.evaluate('(key)=>localStorage.getItem(key)',SCHEMA))['entries'] + assert len(saved)==1 and all(saved[0][key]==unique[key] for key in ['repository','commit','path','blob','bytes']) + duplicate_case['unique_saved_entry']=saved[0] + duplicate_case['passed']=True + page.screenshot(path=str(args.output/(duplicate_case['case']+'.png'))) + except Exception: + duplicate_case['passed']=False;duplicate_case['error']=traceback.format_exc() + page.screenshot(path=str(args.output/(duplicate_case['case']+'-failed.png'))) + finally:context.close() + from playwright.sync_api import sync_playwright + with sync_playwright() as pw: + browser=pw.chromium.launch(executable_path=args.browser,chromium_sandbox=True) + report['browser']=browser.version + try: + if args.origin:run(args.origin.rstrip('/')+'/',browser) + else: + with serve(args.site) as origin:run(origin,browser) + finally:browser.close() + report['passed']=sum(c['passed'] for c in report['cases']);report['failed']=len(report['cases'])-report['passed'] + report['finished_utc']=datetime.now(timezone.utc).isoformat() + (args.output/'report.json').write_text(json.dumps(report,indent=2)+'\n') + print(json.dumps({k:report[k] for k in ['browser','passed','failed','page_errors']})) + return int(bool(report['failed'] or report['page_errors'])) + +if __name__=='__main__':raise SystemExit(main()) diff --git a/tools/node_status_refresh.py b/tools/node_status_refresh.py index 8e649827a..1b482daa5 100644 --- a/tools/node_status_refresh.py +++ b/tools/node_status_refresh.py @@ -3,9 +3,13 @@ Settled rule: source_rev is sources[0].rev, the primary source. For a pinned blob or tree on d6g8k5htny-coder/main or Math-, that rev is the 40-hex sha in -the URL. The moving-ref sha is never written into the record. If that moving -ref has moved past source_rev, status is stale. If it cannot be resolved, -status is unknown and refresh_error says why. +the URL. The moving-ref sha is never written into the record. Compare the +pinned and current Git object identities at that path, resolving the current +default-branch commit before reading its tree. An unchanged blob or directory +stays fresh even if its snapshot pin is later than its last path-changing +commit. If either object cannot be resolved, status is unknown and refresh_error +says why. This is operational GitHub metadata comparison, not proof review or +authenticated custody of complete mathematical source bytes. #495 is adding the other three forms this tool already accepts: an updated_at rev (UTC Z string) for an issue, pull, or comment URL on main or Math-; an @@ -19,8 +23,8 @@ is never inferred. Rules: - - no source moved past its recorded rev -> "fresh" - - any source moved past its recorded rev -> "stale" + - unchanged Git objects / no newer discussion -> "fresh" + - changed Git object / newer discussion -> "stale" - any source unreachable / not a valid rev -> "unknown" (never "fresh") Precedence: unknown > stale > fresh. @@ -38,8 +42,7 @@ import sys import urllib.request from pathlib import Path -from typing import Callable -from urllib.parse import quote +from typing import Callable, NamedTuple SCHEMA_VERSION = 0 STATUSES = ("fresh", "stale", "unknown") @@ -69,6 +72,18 @@ class SourceError(Exception): """A source could not be resolved to a current revision.""" +class GitSourceState(NamedTuple): + """One transient, URL-bound comparison; it never replaces a recorded pin.""" + + url: str + pinned_revision: str + current_revision: str + pinned_type: str + pinned_sha: str + current_type: str + current_sha: str + + def _utc_now() -> str: return _dt.datetime.now(_dt.timezone.utc).replace(microsecond=0).strftime("%Y-%m-%dT%H:%M:%SZ") @@ -89,7 +104,7 @@ def _api_get(path: str) -> object: req.add_header("Authorization", "Bearer " + token) try: with urllib.request.urlopen(req, timeout=20) as resp: - return json.load(resp) + return json.load(resp, object_pairs_hook=_unique_pairs) except Exception as exc: # network, HTTP, JSON raise SourceError(f"{type(exc).__name__}: {exc}") from exc @@ -114,23 +129,70 @@ def _recorded_ok(kind: str | None, match: re.Match[str] | None, recorded: object return False -def github_fetch(url: str) -> str: - """Return the current moving-ref sha, or a discussion object's updated_at. +def _git_sha(value: object) -> str: + if not isinstance(value, str) or not _SHA.fullmatch(value): + raise SourceError("Git object or commit identity is not a 40-hex sha") + return value + - Neither value is written into the record. Callers compare it with the - recorded rev and keep sources[0].rev as source_rev. +def _git_object(repo: str, root: str, path: str, trees: dict) -> tuple[str, str]: + """Walk only the requested fixed tree path, never a moving branch alias.""" + parts = path.split("/") + if any(not part or part in (".", "..") for part in parts): + raise SourceError("source path is not a canonical relative Git path") + tree_sha = root + for index, part in enumerate(parts): + if tree_sha not in trees: + data = _api_get(f"/repos/d6g8k5htny-coder/{repo}/git/trees/{tree_sha}") + if (not isinstance(data, dict) or data.get("sha") != tree_sha + or data.get("truncated") is not False or not isinstance(data.get("tree"), list)): + raise SourceError("Git tree is missing, mismatched or truncated") + trees[tree_sha] = data["tree"] + rows = trees[tree_sha] + if any(not isinstance(row, dict) or not isinstance(row.get("path"), str) for row in rows): + raise SourceError("Git tree contains an invalid entry") + matches = [row for row in rows if row["path"] == part] + if len(matches) != 1: + raise SourceError("Git source path is absent or ambiguous") + entry = matches[0] + kind, mode, sha = entry.get("type"), entry.get("mode"), _git_sha(entry.get("sha")) + if (kind, mode) not in (("tree", "040000"), ("blob", "100644"), ("blob", "100755")): + raise SourceError("unsupported Git source type or mode") + if index == len(parts) - 1: + return kind, sha + if kind != "tree": + raise SourceError("Git source path crosses a non-directory") + tree_sha = sha + raise SourceError("empty Git source path") + + +def github_fetch(url: str) -> str | GitSourceState: + """Return pinned/current Git object evidence, or discussion updated_at. + + The current default-branch commit is resolved once per Git observation. + Neither it nor object identities replace sources[0].rev/source_rev. """ kind, match = _classify(url) if kind == "sha" and match is not None: - repo, path = match.group(1), match.group(4) - query = f"/repos/d6g8k5htny-coder/{repo}/commits?path={quote(path, safe='/')}&per_page=1" - commits = _api_get(query) - if not isinstance(commits, list) or not commits or not isinstance(commits[0], dict): - raise SourceError(f"no commits for path: {url}") - sha = commits[0].get("sha") - if not isinstance(sha, str) or not _SHA.fullmatch(sha): - raise SourceError(f"{url}: moving ref is not a 40-hex sha") - return sha + repo, pinned, path = match.group(1), match.group(3), match.group(4) + base = f"/repos/d6g8k5htny-coder/{repo}" + commits = _api_get(base + "/commits?per_page=1") + if not isinstance(commits, list) or len(commits) != 1 or not isinstance(commits[0], dict): + raise SourceError(f"no default-branch commit: {url}") + current = _git_sha(commits[0].get("sha")) + commit = commits[0].get("commit") + if not isinstance(commit, dict) or not isinstance(commit.get("tree"), dict): + raise SourceError("current commit has no Git tree") + current_root = _git_sha(commit["tree"].get("sha")) + original = _api_get(base + "/git/commits/" + pinned) + if (not isinstance(original, dict) or original.get("sha") != pinned + or not isinstance(original.get("tree"), dict)): + raise SourceError("pinned commit is absent or mismatched") + pinned_root = _git_sha(original["tree"].get("sha")) + trees: dict = {} + pinned_object = _git_object(repo, pinned_root, path, trees) + current_object = _git_object(repo, current_root, path, trees) + return GitSourceState(url, pinned, current, *pinned_object, *current_object) if kind == "time" and match is not None: repo, disc_kind, number, comment_id = match.group(1), match.group(2), match.group(3), match.group(4) if comment_id: @@ -279,14 +341,28 @@ def refresh_record(record: dict, fetch: Fetcher, now: str | None = None, except Exception as exc: # any fetch failure is unknown, never fresh errors.append(f"{url}: {exc}") continue - current = _current(fetched) if kind == "sha": + if isinstance(fetched, GitSourceState): + if (fetched.url != url or fetched.pinned_revision != recorded + or fetched.pinned_type != match.group(2) + or fetched.current_type not in ("blob", "tree") + or any(not isinstance(value, str) or not _SHA.fullmatch(value) + for value in (fetched.current_revision, fetched.pinned_sha, fetched.current_sha))): + errors.append(f"{url}: Git observation does not match its pinned source") + continue + if (fetched.pinned_type, fetched.pinned_sha) != (fetched.current_type, fetched.current_sha): + changed = True + continue + # Compatibility for existing injected revision-only fetchers. The + # production GitHub fetcher above uses bound object observations. + current = _current(fetched) if not isinstance(current, str) or not _SHA.fullmatch(current): errors.append(f"{url}: moving ref is not a 40-hex sha") continue if current != recorded: changed = True else: + current = _current(fetched) current_z = _as_z(current) if not _UTC.fullmatch(current_z): errors.append(f"{url}: updated_at is not a UTC Z timestamp") From 6fc021839072d8c34f41e18e77b0f618c53baa15 Mon Sep 17 00:00:00 2001 From: Dylan Roy <8n96mrd5d4@privaterelay.appleid.com> Date: Thu, 29 Oct 2026 18:00:24 +0000 Subject: [PATCH 2/6] Add scoped CBZ verification and recoverable cleanup tools --- tests/test_cbz_audit.py | 330 +++++++++++++++++++++++++ tests/test_cbz_baseline.py | 195 +++++++++++++++ tests/test_cbz_lean_check.py | 138 +++++++++++ tests/test_cbz_refs.py | 337 ++++++++++++++++++++++++++ tests/test_cbz_storage.py | 152 ++++++++++++ tools/CBZNonvacuity.lean | 57 +++++ tools/cbz_audit.py | 383 +++++++++++++++++++++++++++++ tools/cbz_baseline.py | 455 +++++++++++++++++++++++++++++++++++ tools/cbz_lean_check.py | 245 +++++++++++++++++++ tools/cbz_refs.py | 373 ++++++++++++++++++++++++++++ tools/cbz_storage.py | 249 +++++++++++++++++++ 11 files changed, 2914 insertions(+) create mode 100644 tests/test_cbz_audit.py create mode 100644 tests/test_cbz_baseline.py create mode 100644 tests/test_cbz_lean_check.py create mode 100644 tests/test_cbz_refs.py create mode 100644 tests/test_cbz_storage.py create mode 100644 tools/CBZNonvacuity.lean create mode 100644 tools/cbz_audit.py create mode 100644 tools/cbz_baseline.py create mode 100644 tools/cbz_lean_check.py create mode 100644 tools/cbz_refs.py create mode 100644 tools/cbz_storage.py diff --git a/tests/test_cbz_audit.py b/tests/test_cbz_audit.py new file mode 100644 index 000000000..1e95120fa --- /dev/null +++ b/tests/test_cbz_audit.py @@ -0,0 +1,330 @@ +"""Behavioral contract for the deliberately finite CBZ static auditor. + +The same tests run against source-mutated copies during `cbz_audit.py selftest`. +No fixture asserts total mathematical soundness from a lexical scan. +""" +from __future__ import annotations +import hashlib +import importlib.util +import json +import os +from pathlib import Path +import subprocess +import sys +import tempfile +import unittest + +TOOL = Path(os.environ.get('CBZ_AUDIT_UNDER_TEST', Path(__file__).resolve().parents[1] / 'tools/cbz_audit.py')) +spec = importlib.util.spec_from_file_location('cbz_audit_under_test', TOOL) +audit = importlib.util.module_from_spec(spec) +spec.loader.exec_module(audit) + + +def sha(data): + return hashlib.sha256(data).hexdigest() + + +class AuditContract(unittest.TestCase): + def setUp(self): + self.tmp = tempfile.TemporaryDirectory() + self.addCleanup(self.tmp.cleanup) + self.root = Path(self.tmp.name) + subprocess.run(['git', 'init', '-q', str(self.root)], check=True) + + def put(self, name, data, tracked=True): + path = self.root / name + path.parent.mkdir(parents=True, exist_ok=True) + raw = data.encode() if isinstance(data, str) else data + path.write_bytes(raw) + if tracked: + subprocess.run(['git', '-C', str(self.root), 'add', '--', name], check=True) + return raw + + def scan(self, **kwargs): + return audit.scan(self.root, **kwargs) + + def codes(self, result): + return {item['code'] for item in result['findings']} + + def gaps(self, result): + return {item['code'] for item in result['coverage_gaps']} + + def registry(self, name, raw, role='certification'): + return {'version': 1, 'files': [{'path': name, 'sha256': sha(raw), 'role': role}]} + + def test_each_real_placeholder_and_axiom_is_visible(self): + for token in ('sorry', 'admit', 'axiom', 'native_decide'): + with self.subTest(token=token): + self.put('Proof.lean', 'theorem x : True := by\n ' + token + '\n') + result = self.scan() + self.assertIn('lean.' + token, self.codes(result)) + self.assertEqual(result['result'], 'FAIL') + self.assertEqual(result['findings'][0]['line'], 2) + + def test_nested_comments_strings_and_quoted_identifiers_are_not_keywords(self): + self.put('Clean.lean', '/- sorry /- axiom -/ admit -/\n-- native_decide\ndef «sorry» := "admit \\" axiom"\ndef sorryish := 1\ndef x\' := \'a\'\n') + result = self.scan() + self.assertEqual(result['findings'], []) + self.assertEqual(result['coverage_gaps'], []) + self.assertEqual(result['static_result'], 'PASS') + + def test_comment_then_real_token_and_unicode_name(self): + self.put('A.lean', '/- nested /- sorry -/ -/\ndef αsorry := 0\ntheorem x := by sorry') + result = self.scan() + self.assertEqual([f['code'] for f in result['findings']], ['lean.sorry']) + self.assertEqual(result['findings'][0]['line'], 3) + + def test_trust_escape_hatches_and_quoted_trust_names(self): + self.put('A.lean', 'unsafe def x := sorryAx\n@[implemented_by other] opaque y : Nat\n@[extern "f"] opaque z : Nat\n#check «sorryAx»') + self.assertTrue({'lean.unsafe', 'lean.sorryAx', 'lean.implemented_by', 'lean.extern'} <= self.codes(self.scan())) + + def test_unterminated_lexemes_and_interpolation_are_gaps(self): + for text in ('/- nested /- x -/', 'def x := "unclosed', 'def «unclosed', 'def x := s!"{sorry}"'): + with self.subTest(text=text): + self.put('A.lean', text) + self.assertIn('lean.lexical_gap', self.gaps(self.scan())) + + def test_raw_lean_strings_hide_only_string_contents(self): + self.put('A.lean', 'def x := r#"sorry " axiom"#\ntheorem y := by admit') + self.assertEqual(self.codes(self.scan()), {'lean.admit'}) + + def test_complete_tracked_inventory_including_hidden_and_spaces(self): + self.put('normal.txt', 'ordinary') + self.put('.hidden/a b.lean', 'example : True := by sorry') + result = self.scan() + self.assertEqual({i['path'] for i in result['files']}, {'normal.txt', '.hidden/a b.lean'}) + self.assertIn('lean.sorry', self.codes(result)) + self.assertEqual(result['tracked_count'], 2) + self.assertEqual(result['read_count'], 2) + self.assertEqual(result['proof_candidates'], ['.hidden/a b.lean']) + + def test_tracked_worktree_deletion_is_never_skipped(self): + self.put('gone.lean', 'example := by sorry') + (self.root / 'gone.lean').unlink() + self.assertIn('file.unreadable', self.gaps(self.scan())) + + def test_invalid_utf8_in_lean_is_gap(self): + self.put('A.lean', b'\xffsorry') + self.assertIn('file.encoding', self.gaps(self.scan())) + + def test_archive_and_other_proof_format_are_explicit_gaps(self): + self.put('archive.zip', b'PK\x03\x04') + self.put('Proof.v', 'Admitted.') + self.put('paper.tex', r'\begin{proof}omitted\end{proof}') + result = self.scan() + self.assertTrue({'archive.unsupported', 'proof.unsupported'} <= self.gaps(result)) + self.assertEqual(set(result['proof_candidates']), {'Proof.v', 'paper.tex'}) + self.assertEqual(result['result'], 'INCOMPLETE') + + def test_archive_magic_without_extension_is_gap(self): + self.put('payload.bin', b'PK\x03\x04not parsed') + self.assertIn('archive.unsupported', self.gaps(self.scan())) + + def test_symlink_is_gap_and_never_followed(self): + self.put('target.txt', 'sorry') + (self.root / 'link.lean').symlink_to('target.txt') + subprocess.run(['git', '-C', str(self.root), 'add', 'link.lean'], check=True) + self.assertIn('file.symlink', self.gaps(self.scan())) + + def test_submodule_is_explicit_gap(self): + subprocess.run(['git', '-C', str(self.root), 'update-index', '--add', '--cacheinfo', '160000,' + 'a' * 40 + ',vendor'], check=True) + self.assertIn('file.submodule', self.gaps(self.scan())) + + def test_untracked_proof_is_visible_gap(self): + self.put('A.lean', 'example := by sorry', tracked=False) + result = self.scan() + self.assertIn('file.untracked_proof', self.gaps(result)) + self.assertEqual(result['untracked'], ['A.lean']) + + def test_ui_float_is_not_mathematical_certification_finding(self): + self.put('ui.py', 'opacity = 0.5\n') + self.assertNotIn('certification.float', self.codes(self.scan())) + self.assertIn('certification_scope', self.scan()['semantic_receipts_required']) + + def test_certified_python_float_literals_and_calls_are_findings(self): + for source in ('bound = 0.1', 'bound = float("1")', 'import builtins\nbound = builtins.float("1")'): + with self.subTest(source=source): + raw = self.put('bound.py', source) + self.assertIn('certification.float', self.codes(self.scan(registry=self.registry('bound.py', raw)))) + + def test_certified_python_exact_arithmetic_and_string_are_not_float_hits(self): + raw = self.put('bound.py', 'from fractions import Fraction\nbound = Fraction(1, 10)\nlabel = "float(0.1)"\n') + result = self.scan(registry=self.registry('bound.py', raw)) + self.assertEqual(result['findings'], []) + self.assertEqual(result['coverage_gaps'], []) + + def test_certified_lean_float_and_unsupported_certifier(self): + raw = self.put('Bound.lean', '#check Float\n') + self.assertIn('certification.float', self.codes(self.scan(registry=self.registry('Bound.lean', raw)))) + raw = self.put('bound.js', 'let bound = 0.1;') + self.assertIn('certification.unsupported', self.gaps(self.scan(registry=self.registry('bound.js', raw)))) + + def test_invalid_python_certifier_is_gap(self): + raw = self.put('bound.py', 'bound = (') + self.assertIn('certification.parse', self.gaps(self.scan(registry=self.registry('bound.py', raw)))) + + def test_registry_hash_and_unknown_file_refused(self): + raw = self.put('bound.py', 'bound = 1') + for registry in (self.registry('bound.py', b'wrong'), self.registry('missing.py', raw)): + self.assertIn('registry.invalid', self.gaps(self.scan(registry=registry))) + + def test_registry_bad_roles_duplicates_and_traversal_refused(self): + raw = self.put('bound.py', 'bound = 1') + bad = self.registry('bound.py', raw, 'whitelist') + duplicate = self.registry('bound.py', raw) + duplicate['files'] *= 2 + traversal = self.registry('../bound.py', raw) + for registry in (bad, duplicate, traversal, {'version': True, 'files': []}): + self.assertIn('registry.invalid', self.gaps(self.scan(registry=registry))) + + def test_quarantine_preserves_findings_and_requires_independent_isolation(self): + raw = self.put('Q.lean', 'example := by sorry') + quarantine = {'version': 1, 'entries': [{'path': 'Q.lean', 'sha256': sha(raw), 'statement': 'example', 'reason': 'unproved', 'attempts': ['kernel rejects'], 'owner': 'none'}]} + result = self.scan(quarantine=quarantine) + self.assertIn('lean.sorry', self.codes(result)) + self.assertTrue(result['findings'][0]['quarantine_requested']) + self.assertEqual(result['result'], 'FAIL') + self.assertIn('quarantine_isolation_and_closed_dependencies', result['semantic_receipts_required']) + quarantine['entries'][0]['sha256'] = '0' * 64 + self.assertIn('quarantine.invalid', self.gaps(self.scan(quarantine=quarantine))) + + def test_empty_tree_never_manufactures_layer_a_green(self): + result = self.scan() + self.assertEqual(result['result'], 'INCOMPLETE') + self.assertEqual(result['static_result'], 'PASS') + self.assertIn('kernel_and_declared_axioms', result['semantic_receipts_required']) + self.assertIn('status_index_and_nonvacuity', result['semantic_receipts_required']) + self.assertFalse(result['mathematical_soundness_certified']) + + def test_cli_json_and_failure_exit(self): + self.put('A.lean', 'example := by sorry') + proc = subprocess.run([sys.executable, '-B', str(TOOL), 'scan', '--root', str(self.root)], capture_output=True, text=True) + self.assertNotEqual(proc.returncode, 0) + self.assertEqual(json.loads(proc.stdout)['result'], 'FAIL') + + def test_cli_invalid_json_manifest_is_explicit_failure(self): + path = self.root / 'bad.json' + path.write_text('{"version":1,"version":1,"files":[]}') + proc = subprocess.run([sys.executable, '-B', str(TOOL), 'scan', '--root', str(self.root), '--registry', str(path)], capture_output=True, text=True) + self.assertNotEqual(proc.returncode, 0) + self.assertEqual(json.loads(proc.stdout)['result'], 'FAIL') + + def test_kernel_check_bypass_is_a_trust_finding(self): + self.put('A.lean', 'set_option debug.skipKernelTC true\n') + self.assertIn('lean.skipKernelTC', self.codes(self.scan())) + + def test_replaced_tracked_file_kind_is_gap(self): + self.put('A.lean', 'example := by sorry') + (self.root / 'A.lean').unlink() + (self.root / 'A.lean').mkdir() + self.assertIn('file.non_regular', self.gaps(self.scan())) + + def test_symlink_ancestor_is_gap_even_when_destination_is_readable(self): + self.put('formal/A.lean', 'example := by sorry') + (self.root / 'formal').rename(self.root / 'moved') + (self.root / 'formal').symlink_to('moved', target_is_directory=True) + result = self.scan() + self.assertIn('file.symlink', self.gaps(result)) + self.assertEqual(result['read_count'], 0) + + def test_python_complex_literals_are_floating_point(self): + raw = self.put('bound.py', 'bound = 1j') + self.assertIn('certification.float', self.codes(self.scan(registry=self.registry('bound.py', raw)))) + + def test_explicit_noncertifying_float_is_not_a_bound_finding(self): + raw = self.put('ui.py', 'opacity = 0.25') + result = self.scan(registry=self.registry('ui.py', raw, 'noncertifying')) + self.assertEqual(result['findings'], []) + self.assertEqual(result['files'][0]['classification'], 'noncertifying') + + def test_registry_extends_proof_candidate_inventory(self): + raw = self.put('custom.data', 'formal proof') + result = self.scan(registry=self.registry('custom.data', raw, 'proof-source')) + self.assertIn('custom.data', result['proof_candidates']) + self.assertIn('proof.unsupported', self.gaps(result)) + + def test_archive_declared_signatures_and_suffixes_and_negative(self): + for signature in (b'PK\x03\x04', b'PK\x05\x06', b'\x1f\x8b', b'BZh', b'\xfd7zXZ\x00', b'7z\xbc\xaf\x27\x1c', b'Rar!', b'\x28\xb5\x2f\xfd', b'_' * 257 + b'ustar'): + self.assertTrue(audit.is_archive('unknown.bin', signature)) + for suffix in audit.ARCHIVE_SUFFIXES: + self.assertTrue(audit.is_archive('file' + suffix)) + self.assertFalse(audit.is_archive('normal.txt', b'ordinary text')) + + def test_quarantine_missing_reason_owner_or_attempts_is_invalid(self): + raw = self.put('Q.lean', 'example := by sorry') + row = {'path': 'Q.lean', 'sha256': sha(raw), 'statement': 'example', 'reason': 'unproved', 'attempts': ['kernel rejects'], 'owner': 'none'} + for field, value in (('reason', ''), ('statement', ''), ('owner', 'someone'), ('attempts', [])): + bad = dict(row, **{field: value}) + result = self.scan(quarantine={'version': 1, 'entries': [bad]}) + self.assertIn('quarantine.invalid', self.gaps(result)) + self.assertIn('lean.sorry', self.codes(result)) + + def test_json_numbers_and_duplicate_keys_refused_valid_roundtrip(self): + path = self.root / 'input.json' + for raw in ('{"x":1.5}', '{"x":NaN}', '{"x":Infinity}', '{"x":1,"x":2}'): + path.write_text(raw) + with self.assertRaises(ValueError): + audit.load_json(path) + path.write_text('{"version":1,"files":[]}') + self.assertEqual(audit.load_json(path), {'version': 1, 'files': []}) + + def test_empty_scan_cli_is_incomplete_nonzero(self): + proc = subprocess.run([sys.executable, '-B', str(TOOL), 'scan', '--root', str(self.root)], capture_output=True, text=True) + self.assertEqual(proc.returncode, 2) + self.assertEqual(json.loads(proc.stdout)['result'], 'INCOMPLETE') + + def test_subdirectory_request_scans_repository_root(self): + self.put('outside.lean', 'example := by sorry') + self.put('inside/ok.txt', 'ordinary') + result = audit.scan(self.root / 'inside') + self.assertEqual(result['tracked_count'], 2) + self.assertEqual(result['root'], str(self.root)) + self.assertIn('lean.sorry', self.codes(result)) + + def test_lfs_pointer_is_not_mistaken_for_source(self): + self.put('A.lean', 'version https://git-lfs.github.com/spec/v1\noid sha256:' + 'a' * 64 + '\nsize 1024\n') + self.assertIn('file.lfs_pointer', self.gaps(self.scan())) + + def test_compiled_lean_artifacts_are_explicit_coverage_gaps(self): + self.put('A.olean', b'compiled bytes') + self.assertIn('proof.unsupported', self.gaps(self.scan())) + + def test_coverage_gap_binds_exact_bytes_and_tool_source(self): + raw = self.put('archive.zip', b'PK\x03\x04opaque') + result = self.scan() + self.assertEqual(len(result['coverage_gaps']), 1) + self.assertEqual(result['coverage_gaps'][0].get('sha256'), sha(raw)) + self.assertEqual(result.get('scanner_sha256'), sha(TOOL.read_bytes())) + self.assertEqual(result['coverage_gaps'][0].get('kind'), 'archive') + + def test_unmerged_index_stages_are_coverage_gaps(self): + self.put('A.lean', 'example := by sorry') + oid = subprocess.run(['git', '-C', str(self.root), 'rev-parse', ':A.lean'], capture_output=True, text=True, check=True).stdout.strip() + entries = '0 ' + '0' * 40 + '\tA.lean\n' + '100644 ' + oid + ' 1\tA.lean\n100644 ' + oid + ' 2\tA.lean\n' + subprocess.run(['git', '-C', str(self.root), 'update-index', '--index-info'], input=entries, text=True, check=True) + self.assertIn('git.conflict', self.gaps(self.scan())) + + def test_all_declared_trust_tokens_and_nonmatching_names(self): + values = ('sorryAx', 'unsafe', 'implemented_by', 'extern', 'ofReduceBool', 'ofReduceNat', 'trustCompiler', 'skipKernelTC') + self.put('A.lean', '\n'.join(values)) + self.assertEqual(self.codes(self.scan()), {'lean.' + value for value in values}) + self.put('A.lean', '\n'.join('prefix_' + value + '_suffix' for value in values)) + self.assertEqual(self.codes(self.scan()), set()) + + def test_all_declared_proof_suffixes_are_enumerated(self): + suffixes = ('.lean', '.olean', '.ilean', '.v', '.agda', '.thy', '.tex', '.typ', '.ipynb', '.smt2', '.pvs', '.dfy', '.fst', '.fsti', '.idr', '.lagda') + for suffix in suffixes: + self.put('proof' + suffix, '') + self.put('ordinary.txt', '') + result = self.scan() + self.assertEqual(set(result['proof_candidates']), {'proof' + suffix for suffix in suffixes}) + self.assertEqual(len(result['coverage_gaps']), len(suffixes) - 1) + + def test_non_git_root_is_explicit_gap(self): + with tempfile.TemporaryDirectory() as directory: + result = audit.scan(Path(directory)) + self.assertIn('git.enumeration', self.gaps(result)) + + +if __name__ == '__main__': + unittest.main() diff --git a/tests/test_cbz_baseline.py b/tests/test_cbz_baseline.py new file mode 100644 index 000000000..910570e4f --- /dev/null +++ b/tests/test_cbz_baseline.py @@ -0,0 +1,195 @@ +"""Portable baseline validator controls; local fixture inputs and processes only.""" +import hashlib +import importlib.util +import json +from pathlib import Path +import subprocess +import sys +import tempfile +import unittest + +TOOL = Path(__file__).resolve().parents[1] / 'tools/cbz_baseline.py' + + +def sha(path): + return hashlib.sha256(Path(path).read_bytes()).hexdigest() + + +def write(path, value): + path.parent.mkdir(parents=True, exist_ok=True) + path.write_text(json.dumps(value, sort_keys=True, indent=2) + '\n') + + +class BaselineTests(unittest.TestCase): + @classmethod + def setUpClass(cls): + cls.tool = None + if TOOL.exists(): + spec = importlib.util.spec_from_file_location('cbz_baseline', TOOL) + cls.tool = importlib.util.module_from_spec(spec) + spec.loader.exec_module(cls.tool) + + def setUp(self): + self.assertIsNotNone(self.tool, 'baseline validator is missing') + self.tmp = tempfile.TemporaryDirectory() + self.addCleanup(self.tmp.cleanup) + self.base = Path(self.tmp.name) + self.root = self.base / 'repo' + self.root.mkdir() + subprocess.run(['git', 'init', '-q', '-b', 'main', str(self.root)], check=True) + subprocess.run(['git', '-C', str(self.root), 'config', 'user.name', 'Fixture'], check=True) + subprocess.run(['git', '-C', str(self.root), 'config', 'user.email', 'fixture@invalid'], check=True) + (self.root / 'tools').mkdir() + self.gate = self.root / 'tools/check.py' + self.gate.write_text('print("observed fixture execution")\n') + proof = self.root / 'proof.lean' + proof.write_text('theorem fixture : True := True.intro\n') + self.proof = {'schema': 'cbz.proof-index.v1', 'records': [ + {'id': 'fixture', 'status': 'QUARANTINED', 'source_hashes': [{'path': 'proof.lean', 'sha256': sha(proof)}], + 'dependencies': [], 'exact_boundary': 'fixture declaration', 'scientific_closure_limits': 'No kernel claim', + 'reason': 'not kernel audited', 'attempts': ['fixture inspection'], 'isolation': 'No CLOSED dependents', 'owner': 'none'}]} + write(self.root / 'cbz/proof-index.json', self.proof) + write(self.root / 'cbz/tool-registry.json', {'schema': 'cbz.tools.v1', 'tools': [ + {'path': 'tools/check.py', 'self_test': [sys.executable, 'tools/check.py']}]}) + statuses = {f'G{i}': 'INCOMPLETE' for i in range(12)} + self.doc = '# Baseline state\n# Scientific boundaries\n# Cold-start commands\npython tools/check.py\n# Evidence and invariants\n# Unmet criteria\n' + self.doc += '\n' + (self.root / 'STATUS.md').write_text(self.doc) + self.config = {'schema': 'cbz.baseline.v1', 'proof_index': 'cbz/proof-index.json', + 'tool_registry': 'cbz/tool-registry.json', 'docs': ['STATUS.md'], + 'allowed_axioms': ['propext', 'Classical.choice', 'Quot.sound'], 'pins': [], + 'cold_start': {'status': 'STATUS.md', 'required_answers': [ + 'Baseline state', 'Scientific boundaries', 'Cold-start commands', + 'Evidence and invariants', 'Unmet criteria'], 'commands': [['python', 'tools/check.py']]}, + 'gates': [{'id': f'G{i}', 'argv': [sys.executable, 'tools/check.py'], + 'sources': ['tools/check.py'], 'timeout_seconds': 3} for i in range(12)]} + write(self.root / self.tool.DEFAULT_CONFIG, self.config) + self.commit() + self.out = self.base / 'receipts' + + def commit(self): + subprocess.run(['git', '-C', str(self.root), 'add', '.'], check=True) + subprocess.run(['git', '-C', str(self.root), 'commit', '-qm', 'fixture'], check=True) + + def inspect(self, receipts=None): + return self.tool.inspect(self.root, receipts=receipts) + + def test_missing_receipts_are_incomplete_never_green(self): + report = self.inspect() + self.assertEqual(report['status'], 'INCOMPLETE') + self.assertEqual(report['gate_statuses'], {f'G{i}': 'INCOMPLETE' for i in range(12)}) + self.assertFalse(report['certifies_cbz0']) + + def test_live_proof_tamper_fails(self): + (self.root / 'proof.lean').write_text('axiom injected : False\n') + self.assertEqual(self.inspect()['status'], 'FAIL') + + def test_closed_cannot_depend_transitively_on_quarantine(self): + record = dict(self.proof['records'][0], id='closed', status='CLOSED', dependencies=['fixture'], + axioms=[], kernel_evidence=[]) + self.proof['records'].append(record) + write(self.root / 'cbz/proof-index.json', self.proof) + report = self.inspect() + self.assertTrue(any('quarant' in x.lower() for x in report['failures'])) + + def test_custom_axiom_cannot_be_closed(self): + record = self.proof['records'][0] + record.update(status='CLOSED', axioms=['Custom.fake'], kernel_evidence=[]) + write(self.root / 'cbz/proof-index.json', self.proof) + self.assertTrue(any('axiom' in x.lower() for x in self.inspect()['failures'])) + + def test_unknown_proof_status_refused(self): + self.proof['records'][0]['status'] = 'PASS' + write(self.root / 'cbz/proof-index.json', self.proof) + self.assertEqual(self.inspect()['status'], 'FAIL') + + def test_unlisted_mission_tool_refused(self): + (self.root / 'tools/cbz_hidden.py').write_text('print("hidden")\n') + self.assertTrue(any('unlisted' in x.lower() for x in self.inspect()['failures'])) + + def test_receipts_bind_actual_execution_and_stale_source_is_refused(self): + run = self.tool.run(self.root, self.out) + self.assertTrue((self.out / 'receipts.json').exists()) + self.assertEqual([r['status'] for r in run['gates']], ['PASS'] * 12) + observed = self.inspect(self.out / 'receipts.json') + self.assertEqual(set(observed['gate_statuses'].values()), {'PASS'}) + self.assertEqual(observed['status'], 'FAIL') # docs still say INCOMPLETE + self.gate.write_text('print("changed source")\n') + stale = self.inspect(self.out / 'receipts.json') + self.assertEqual(set(stale['gate_statuses'].values()), {'INCOMPLETE'}) + self.assertTrue(any('stale' in x.lower() for x in stale['unmet'])) + + def test_forged_pass_without_process_logs_is_refused(self): + fake = self.base / 'forged.json' + write(fake, {'schema': 'cbz.receipts.v1', 'config_sha256': sha(self.root / self.tool.DEFAULT_CONFIG), + 'gates': [{'id': f'G{i}', 'status': 'PASS'} for i in range(12)]}) + report = self.inspect(fake) + self.assertEqual(set(report['gate_statuses'].values()), {'INCOMPLETE'}) + self.assertNotEqual(report['status'], 'PASS') + + def test_changed_command_invalidates_receipt(self): + self.tool.run(self.root, self.out) + self.config['gates'][0]['argv'].append('new-argument') + write(self.root / self.tool.DEFAULT_CONFIG, self.config) + self.assertEqual(set(self.inspect(self.out / 'receipts.json')['gate_statuses'].values()), {'INCOMPLETE'}) + + def test_output_inside_source_root_refused(self): + with self.assertRaises(self.tool.ValidationError): + self.tool.run(self.root, self.root / 'out') + + def test_timeout_is_recorded_incomplete(self): + self.gate.write_text('import time\ntime.sleep(10)\n') + self.config['gates'] = [dict(self.config['gates'][0], timeout_seconds=1)] + write(self.root / self.tool.DEFAULT_CONFIG, self.config) + result = self.tool.run(self.root, self.out) + self.assertEqual(result['gates'][0]['status'], 'INCOMPLETE') + self.assertTrue(result['gates'][0]['timed_out']) + + def test_offline_pin_object_and_manifest_checked(self): + head = subprocess.check_output(['git', '-C', str(self.root), 'rev-parse', 'HEAD'], text=True).strip() + write(self.root / 'lake-manifest.json', {'packages': [{'name': 'Math', 'rev': head}]}) + self.config['pins'] = [{'repo': '.', 'commit': head, 'object_path': 'proof.lean', + 'sha256': sha(self.root / 'proof.lean'), 'pin_file': 'lake-manifest.json', 'package': 'Math'}] + write(self.root / self.tool.DEFAULT_CONFIG, self.config) + report = self.inspect() + self.assertEqual(report['pins'][0]['status'], 'PASS') + write(self.root / 'lake-manifest.json', {'packages': [{'name': 'Math', 'rev': 'f' * 40}]}) + self.assertEqual(self.inspect()['pins'][0]['status'], 'FAIL') + + def test_missing_offline_dependency_is_incomplete(self): + self.config['pins'] = [{'repo': '../missing', 'commit': 'f' * 40, 'object_path': 'x', 'sha256': '0' * 64}] + write(self.root / self.tool.DEFAULT_CONFIG, self.config) + self.assertEqual(self.inspect()['pins'][0]['status'], 'INCOMPLETE') + + def test_cold_start_checks_executable_entrypoints_without_theorem_claim(self): + result = self.tool.cold_start(self.root) + self.assertEqual(result['status'], 'PASS') + self.assertFalse(result['certifies_theorems']) + (self.root / 'STATUS.md').write_text('PASS\n') + self.assertEqual(self.tool.cold_start(self.root)['status'], 'FAIL') + + def test_exit_two_is_incomplete_rather_than_an_observed_failure(self): + self.gate.write_text('import sys\nsys.exit(2)\n') + self.config['gates'] = [self.config['gates'][0]] + write(self.root / self.tool.DEFAULT_CONFIG, self.config) + self.assertEqual(self.tool.run(self.root, self.out)['gates'][0]['status'], 'INCOMPLETE') + + def test_receipt_log_tampering_is_refused(self): + self.tool.run(self.root, self.out) + (self.out / 'G0.stdout').write_text('forged PASS') + self.assertEqual(self.inspect(self.out / 'receipts.json')['gate_statuses']['G0'], 'INCOMPLETE') + + def test_declared_allowed_axioms_cannot_admit_custom_axioms(self): + self.config['allowed_axioms'].append('Custom.fake') + write(self.root / self.tool.DEFAULT_CONFIG, self.config) + with self.assertRaises(self.tool.ValidationError): + self.inspect() + + def test_duplicate_json_key_is_refused(self): + (self.root / self.tool.DEFAULT_CONFIG).write_text('{"schema":"cbz.baseline.v1","schema":"forged"}') + with self.assertRaises(self.tool.ValidationError): + self.inspect() + + +if __name__ == '__main__': + unittest.main() diff --git a/tests/test_cbz_lean_check.py b/tests/test_cbz_lean_check.py new file mode 100644 index 000000000..daf162b1b --- /dev/null +++ b/tests/test_cbz_lean_check.py @@ -0,0 +1,138 @@ +"""Adversarial protocol tests; actual Lean controls execute in cbz_lean_check.""" +import importlib.util +import json +from pathlib import Path +import unittest + +ROOT = Path(__file__).resolve().parents[1] +MODULE = ROOT / 'tools/cbz_lean_check.py' + + +class CensusProtocolTests(unittest.TestCase): + def gate(self): + self.assertTrue(MODULE.is_file(), 'portable Lean gate has not been implemented') + spec = importlib.util.spec_from_file_location('cbz_lean_check', MODULE) + module = importlib.util.module_from_spec(spec) + spec.loader.exec_module(module) + return module + + def row(self, **changes): + row = dict(name='Demo.honest', module='Demo', kind='theorem', axioms=[], + statement='True', prop_premises=[]) + row.update(changes) + return row + + def log(self, rows=None, count=None, modules=None): + rows = [self.row()] if rows is None else rows + return '\n'.join(['CBZ_RECORD ' + json.dumps(row) for row in rows] + + ['CBZ_END ' + json.dumps(dict(count=len(rows) if count is None else count, + modules=['Demo'] if modules is None else modules))]) + + def test_audit_generator_refuses_missing_or_duplicate_boundary(self): + gate = self.gate() + self.assertTrue(hasattr(gate, 'audit_program'), 'self-audit program generator is not implemented') + for source in ['', gate.MODULES_LINE + '\n' + gate.MODULES_LINE]: + with self.subTest(source=source), self.assertRaises(ValueError): + gate.audit_program(source, 'WitnessModule') + + def test_audit_generator_refuses_module_injection(self): + gate = self.gate() + self.assertTrue(hasattr(gate, 'audit_program'), 'self-audit program generator is not implemented') + with self.assertRaises(ValueError): + gate.audit_program('open Lean Meta Elab Command\n' + gate.MODULES_LINE, 'Bad\naxiom injected : False') + + def test_all_same_named_true_witnesses_rejected(self): + gate = self.gate() + rows = [self.row(name=name, statement='True') for name in gate.WITNESSES] + with self.assertRaises(ValueError): + gate.validate_census(self.log(rows), set(gate.WITNESSES), {'Demo'}) + + def test_each_weakened_witness_type_rejected(self): + gate = self.gate() + for name in gate.WITNESSES: + with self.subTest(name=name), self.assertRaises(ValueError): + gate.validate_census(self.log([self.row(name=name, statement='True')]), {name}, {'Demo'}) + + def test_exact_witness_types_accepted(self): + gate = self.gate() + self.assertTrue(hasattr(gate, 'WITNESS_TYPES'), 'exact witness type contract is missing') + rows = [self.row(name=name, statement=gate.WITNESS_TYPES[name]) for name in gate.WITNESSES] + result = gate.validate_census(self.log(rows), set(gate.WITNESSES), {'Demo'}) + self.assertEqual(len(result['proofs']), 4) + + def test_partial_membership_witness_rejected(self): + gate = self.gate() + name = 'CBZNonvacuity.pairing_all_seven' + with self.assertRaises(ValueError): + gate.validate_census(self.log([self.row(name=name, statement='0 ∈ [0, 1, 2, 3, 4, 5, 6]')]), {name}, {'Demo'}) + + def test_witness_contract_import_injection_rejected(self): + gate = self.gate() + self.assertTrue(hasattr(gate, 'witness_contract_program'), 'Lean witness type contract generator is missing') + with self.assertRaises(ValueError): + gate.witness_contract_program('Wrong\naxiom hidden : False') + + def test_honest_theorem_accepted(self): + result = self.gate().validate_census(self.log(), {'Demo.honest'}, {'Demo'}) + self.assertEqual([r['name'] for r in result['proofs']], ['Demo.honest']) + + def test_definition_not_promoted_to_proof(self): + rows = [self.row(), self.row(name='Demo.statement', kind='definition', statement='Prop')] + result = self.gate().validate_census(self.log(rows), {'Demo.honest'}, {'Demo'}) + self.assertEqual(len(result['proofs']), 1) + with self.assertRaises(ValueError): + self.gate().validate_census(self.log(rows), {'Demo.honest', 'Demo.statement'}, {'Demo'}) + + def test_unused_definition_with_custom_axiom_rejected(self): + rows = [self.row(), self.row(name='Demo.data', kind='definition', axioms=['Hidden.ax'])] + with self.assertRaises(ValueError): + self.gate().validate_census(self.log(rows), {'Demo.honest'}, {'Demo'}) + + def test_project_axiom_declaration_rejected(self): + rows = [self.row(), self.row(name='Demo.hidden', kind='axiom')] + with self.assertRaises(ValueError): + self.gate().validate_census(self.log(rows), {'Demo.honest'}, {'Demo'}) + + def test_false_premise_not_promoted(self): + row = self.row(prop_premises=[dict(name='h', type='False')]) + with self.assertRaises(ValueError): + self.gate().validate_census(self.log([row]), {'Demo.honest'}, {'Demo'}) + + def test_changed_known_finite_premise_rejected(self): + row = self.row(name='UniversalLaw.Side24.exponent_bounds', + prop_premises=[dict(name='h', type='False')]) + with self.assertRaises(ValueError): + self.gate().validate_census(self.log([row]), {row['name']}, {'Demo'}) + + def test_known_finite_premise_retained(self): + row = self.row(name='UniversalLaw.Side24.exponent_bounds', + prop_premises=[dict(name='h', type='d ∈ [2, 3]')]) + result = self.gate().validate_census(self.log([row]), {row['name']}, {'Demo'}) + self.assertEqual(len(result['proofs'][0]['prop_premises']), 1) + + def test_duplicate_declaration_rejected(self): + with self.assertRaises(ValueError): + self.gate().validate_census(self.log([self.row(), self.row()]), {'Demo.honest'}, {'Demo'}) + + def test_forged_count_and_missing_module_rejected(self): + for log in [self.log(count=2), self.log(modules=[]), self.log(modules=['Other'])]: + with self.subTest(log=log), self.assertRaises(ValueError): + self.gate().validate_census(log, {'Demo.honest'}, {'Demo'}) + + def test_missing_target_rejected(self): + with self.assertRaises(ValueError): + self.gate().validate_census(self.log(), {'Demo.missing'}, {'Demo'}) + + def test_duplicate_json_key_rejected(self): + log = self.log().replace('"kind": "theorem"', '"kind": "theorem", "kind": "definition"') + with self.assertRaises(ValueError): + self.gate().validate_census(log, {'Demo.honest'}, {'Demo'}) + + def test_missing_end_or_unknown_line_rejected(self): + for log in [self.log().split('\n')[0], self.log() + '\nCBZ_FORGED anything']: + with self.subTest(log=log), self.assertRaises(ValueError): + self.gate().validate_census(log, {'Demo.honest'}, {'Demo'}) + + +if __name__ == '__main__': + unittest.main() diff --git a/tests/test_cbz_refs.py b/tests/test_cbz_refs.py new file mode 100644 index 000000000..02cf220c9 --- /dev/null +++ b/tests/test_cbz_refs.py @@ -0,0 +1,337 @@ +"""Disposable local bare remotes only; no federation repositories are mutated.""" +import importlib.util +import json +import os +from pathlib import Path +import subprocess +import sys +import tempfile +import unittest +from unittest.mock import patch + +TOOL = Path(__file__).resolve().parents[1] / 'tools' / 'cbz_refs.py' + + +def git(repo, *args, input=None, check=True): + p = subprocess.run(['git', '-C', str(repo), *args], input=input, text=True, + capture_output=True, check=check) + return p.stdout.strip() + + +class RefSafetyTests(unittest.TestCase): + @classmethod + def setUpClass(cls): + if not TOOL.exists(): + cls.tool = None + return + spec = importlib.util.spec_from_file_location('cbz_refs', TOOL) + cls.tool = importlib.util.module_from_spec(spec) + spec.loader.exec_module(cls.tool) + + def setUp(self): + self.assertIsNotNone(self.tool, 'cbz_refs snapshot/prune tool is missing') + self.tmp = tempfile.TemporaryDirectory() + self.addCleanup(self.tmp.cleanup) + self.root = Path(self.tmp.name) + self.src, self.remote, self.out = [self.root / n for n in ('work', 'remote.git', 'snapshot')] + subprocess.run(['git', 'init', '-q', '-b', 'main', str(self.src)], check=True) + git(self.src, 'config', 'user.name', 'Fixture') + git(self.src, 'config', 'user.email', 'fixture@invalid') + (self.src / 'base').write_text('base\n') + git(self.src, 'add', 'base') + git(self.src, 'commit', '-qm', 'base') + self.base = git(self.src, 'rev-parse', 'HEAD') + git(self.src, 'checkout', '-qb', 'unmerged') + (self.src / 'valuable').write_text('unique unmerged work\n') + git(self.src, 'add', 'valuable') + git(self.src, 'commit', '-qm', 'valuable') + self.tip = git(self.src, 'rev-parse', 'HEAD') + git(self.src, 'branch', 'duplicate') + git(self.src, 'branch', 'protected') + git(self.src, 'branch', 'active') + git(self.src, 'tag', '-a', 'original-tag', '-m', 'keep exact tag object') + git(self.src, 'checkout', '-q', 'main') + subprocess.run(['git', 'clone', '-q', '--bare', str(self.src), str(self.remote)], check=True) + self.tag = 'pre-cbz-fixture' + + def snapshot(self): + return self.tool.snapshot(str(self.remote), self.out, self.tag, execute=True, + protected=['refs/heads/protected'], active=['refs/heads/active']) + + def test_default_is_read_only_machine_plan(self): + before = git(self.remote, 'show-ref') + result = self.tool.snapshot(str(self.remote), self.out, self.tag) + self.assertEqual(result['mode'], 'dry-run') + self.assertEqual(result['manifest']['default_ref'], 'refs/heads/main') + self.assertFalse(self.out.exists()) + self.assertEqual(git(self.remote, 'show-ref'), before) + + def test_archive_has_unique_parents_exact_manifest_and_recoverable_content(self): + result = self.snapshot() + archive = self.out / 'repository.git' + parents = git(archive, 'show', '-s', '--format=%P', self.tag).split() + self.assertCountEqual(parents, [self.base, self.tip]) + self.assertEqual(git(archive, 'show', f'{self.tip}:valuable'), 'unique unmerged work') + self.assertEqual(git(archive, 'show', f'{self.tag}:base'), 'base') + embedded = json.loads(git(archive, 'show', f'{self.tag}:.cbz/refs-manifest.json')) + self.assertEqual(embedded, result['manifest']) + self.assertEqual(embedded['refs']['refs/tags/original-tag'], + git(self.remote, 'rev-parse', 'refs/tags/original-tag')) + for tip in embedded['refs'].values(): + git(archive, 'cat-file', '-e', tip) + self.assertTrue(self.tool.verify_snapshot(self.out)['verified']) + + def test_finished_archive_retains_no_original_branch_refs(self): + result = self.snapshot() + archive = self.out / 'repository.git' + self.assertEqual(git(archive, 'for-each-ref', '--format=%(refname)', 'refs/heads'), '') + self.assertEqual(git(archive, 'rev-parse', 'HEAD'), result['archive_commit']) + self.assertEqual(git(archive, 'show', f'{self.tip}:valuable'), 'unique unmerged work') + + def test_missing_original_annotated_tag_ref_is_rejected_before_gc(self): + self.snapshot() + archive = self.out / 'repository.git' + original = git(archive, 'rev-parse', 'refs/tags/original-tag') + git(archive, 'update-ref', '-d', 'refs/tags/original-tag') + self.assertEqual(git(archive, 'cat-file', '-t', original), 'tag') + with self.assertRaisesRegex(self.tool.SafetyError, 'ref|tag'): + self.tool.verify_snapshot(self.out) + + def test_tag_only_blob_and_tree_refs_are_required_even_before_gc(self): + blob = git(self.remote, 'hash-object', '-w', '--stdin', input='tag-only valuable content\n') + tree = git(self.remote, 'mktree', input=f'100644 blob {blob}\tvaluable\n') + for name, oid in (('tag-only-blob', blob), ('tag-only-tree', tree)): + git(self.remote, 'update-ref', 'refs/tags/' + name, oid) + self.snapshot() + archive = self.out / 'repository.git' + for name, oid in (('tag-only-blob', blob), ('tag-only-tree', tree)): + with self.subTest(name=name): + git(archive, 'update-ref', '-d', 'refs/tags/' + name) + git(archive, 'cat-file', '-e', oid) + with self.assertRaises(self.tool.SafetyError): + self.tool.verify_snapshot(self.out) + git(archive, 'update-ref', 'refs/tags/' + name, oid) + self.assertTrue(self.tool.verify_snapshot(self.out)['verified']) + + def test_unexpected_archive_head_or_tag_is_rejected(self): + self.snapshot() + archive = self.out / 'repository.git' + for ref in ('refs/heads/extra', 'refs/tags/extra'): + git(archive, 'update-ref', ref, self.base) + with self.assertRaises(self.tool.SafetyError): + self.tool.verify_snapshot(self.out) + git(archive, 'update-ref', '-d', ref) + + def test_archive_head_must_be_detached_at_archive_commit(self): + self.snapshot() + archive = self.out / 'repository.git' + git(archive, 'update-ref', '--no-deref', 'HEAD', self.base) + with self.assertRaises(self.tool.SafetyError): + self.tool.verify_snapshot(self.out) + + def test_source_index_and_worktrees_untouched(self): + (self.src / 'base').write_text('staged unrelated work\n') + git(self.src, 'add', 'base') + (self.src / 'loose').write_text('untracked') + index = (self.src / '.git/index').read_bytes() + status = git(self.src, 'status', '--porcelain=v1') + # Snapshot the dirty worktree repository itself as the read-only source. + self.tool.snapshot(str(self.src), self.out, self.tag, execute=True) + self.assertEqual((self.src / '.git/index').read_bytes(), index) + self.assertEqual(git(self.src, 'status', '--porcelain=v1'), status) + self.assertEqual((self.src / 'loose').read_text(), 'untracked') + + def test_publish_then_atomic_prune_preserves_default_policy_and_tag(self): + self.snapshot() + self.assertEqual(self.tool.publish(self.out)['mode'], 'dry-run') + self.assertNotIn(f'refs/tags/{self.tag}', self.tool.remote_state(str(self.remote))['refs']) + self.tool.publish(self.out, execute=True) + plan = self.tool.prune(self.out) + self.assertEqual(set(plan['delete_refs']), {'refs/heads/duplicate', 'refs/heads/unmerged'}) + result = self.tool.prune(self.out, execute=True) + self.assertTrue(result['verified']) + state = self.tool.remote_state(str(self.remote)) + self.assertEqual(set(k for k in state['refs'] if k.startswith('refs/heads/')), + {'refs/heads/main', 'refs/heads/protected', 'refs/heads/active'}) + self.assertIn(f'refs/tags/{self.tag}', state['refs']) + # Force object collection after all original local heads were removed: archive tag alone retains tips. + archive = self.out / 'repository.git' + for name in ('active', 'duplicate', 'protected', 'unmerged'): + git(archive, 'update-ref', '-d', f'refs/heads/{name}') + git(archive, 'update-ref', '-d', 'refs/tags/original-tag') + git(archive, 'reflog', 'expire', '--expire=now', '--all') + git(archive, 'gc', '--prune=now') + self.assertEqual(git(archive, 'show', f'{self.tip}:valuable'), 'unique unmerged work') + + def test_prune_requires_actual_remote_archive_readback(self): + self.snapshot() + with self.assertRaisesRegex(self.tool.SafetyError, 'archive|remote'): + self.tool.prune(self.out, execute=True) + self.assertEqual(git(self.remote, 'rev-parse', 'unmerged'), self.tip) + + def test_moved_original_branch_refuses_all_deletions(self): + self.snapshot() + self.tool.publish(self.out, execute=True) + git(self.remote, 'update-ref', 'refs/heads/unmerged', self.base) + before = git(self.remote, 'show-ref') + with self.assertRaisesRegex(self.tool.SafetyError, 'changed|mismatch'): + self.tool.prune(self.out, execute=True) + self.assertEqual(git(self.remote, 'show-ref'), before) + + def test_unexpected_new_ref_refuses_all_deletions(self): + self.snapshot() + self.tool.publish(self.out, execute=True) + git(self.remote, 'update-ref', 'refs/heads/new-work', self.tip) + before = git(self.remote, 'show-ref') + with self.assertRaises(self.tool.SafetyError): + self.tool.prune(self.out, execute=True) + self.assertEqual(git(self.remote, 'show-ref'), before) + + def test_server_rejection_is_atomic_and_never_silent_success(self): + self.snapshot() + self.tool.publish(self.out, execute=True) + hook = self.remote / 'hooks/update' + hook.write_text('#!/bin/sh\ncase "$1" in refs/heads/unmerged) exit 1;; esac\nexit 0\n') + hook.chmod(0o755) + before = git(self.remote, 'show-ref') + with self.assertRaises(self.tool.SafetyError): + self.tool.prune(self.out, execute=True) + self.assertEqual(git(self.remote, 'show-ref'), before) + + def test_tampered_manifest_fails_before_remote_mutation(self): + self.snapshot() + path = self.out / 'manifest.json' + data = json.loads(path.read_text()) + data['refs']['refs/heads/main'] = self.tip + path.write_text(json.dumps(data)) + before = git(self.remote, 'show-ref') + with self.assertRaises(self.tool.SafetyError): + self.tool.publish(self.out, execute=True) + self.assertEqual(git(self.remote, 'show-ref'), before) + + def test_lease_rejects_branch_changed_after_final_preflight_atomically(self): + self.snapshot() + self.tool.publish(self.out, execute=True) + original_git = self.tool._git + raced = False + def racing_git(repo, *args, **kwargs): + nonlocal raced + if args and args[0] == 'push' and ':refs/heads/unmerged' in args: + raced = True + git(self.remote, 'update-ref', 'refs/heads/unmerged', self.base) + return original_git(repo, *args, **kwargs) + with patch.object(self.tool, '_git', racing_git): + with self.assertRaises(self.tool.SafetyError): + self.tool.prune(self.out, execute=True) + self.assertTrue(raced) + self.assertEqual(git(self.remote, 'rev-parse', 'refs/heads/duplicate'), self.tip) + self.assertEqual(git(self.remote, 'rev-parse', 'refs/heads/unmerged'), self.base) + + def test_actual_tag_fetch_rejects_forged_advertised_readback(self): + result = self.snapshot() + self.tool.publish(self.out, execute=True) + expected = self.tool.remote_state(str(self.remote)) + git(self.remote, 'update-ref', f'refs/tags/{self.tag}', self.base) + with patch.object(self.tool, 'remote_state', return_value=expected): + with self.assertRaisesRegex(self.tool.SafetyError, 'readback'): + self.tool.prune(self.out, execute=True) + self.assertEqual(git(self.remote, 'rev-parse', 'refs/heads/unmerged', check=False), self.tip) + + def test_fetch_race_removes_partial_output_and_keeps_remote_work(self): + original_git = self.tool._git + def racing_git(repo, *args, **kwargs): + result = original_git(repo, *args, **kwargs) + if args and args[0] == 'fetch': + git(self.remote, 'update-ref', 'refs/heads/unmerged', self.base) + return result + with patch.object(self.tool, '_git', racing_git): + with self.assertRaisesRegex(self.tool.SafetyError, 'changed|mismatch'): + self.snapshot() + self.assertFalse(self.out.exists()) + self.assertEqual(list(self.root.glob('.cbz-snapshot-*')), []) + self.assertEqual(git(self.remote, 'rev-parse', 'refs/heads/duplicate'), self.tip) + + def test_default_branch_change_refuses_prune(self): + self.snapshot() + self.tool.publish(self.out, execute=True) + git(self.remote, 'symbolic-ref', 'HEAD', 'refs/heads/duplicate') + before = git(self.remote, 'show-ref') + with self.assertRaises(self.tool.SafetyError): + self.tool.prune(self.out, execute=True) + self.assertEqual(git(self.remote, 'show-ref'), before) + + def test_existing_output_and_tag_are_never_overwritten(self): + self.snapshot() + manifest = (self.out / 'manifest.json').read_bytes() + with self.assertRaisesRegex(self.tool.SafetyError, 'exists'): + self.snapshot() + self.assertEqual((self.out / 'manifest.json').read_bytes(), manifest) + self.tool.publish(self.out, execute=True) + with self.assertRaisesRegex(self.tool.SafetyError, 'exists'): + self.tool.snapshot(str(self.remote), self.root / 'other', self.tag, execute=True) + + def test_local_archive_tree_tampering_is_detected(self): + self.snapshot() + archive = self.out / 'repository.git' + git(archive, 'update-ref', f'refs/tags/{self.tag}', self.base) + with self.assertRaises(self.tool.SafetyError): + self.tool.verify_snapshot(self.out) + + def test_credential_urls_rejected_without_echoing_secret(self): + secret = 'secret-token-abc' + with self.assertRaises(self.tool.SafetyError) as ctx: + self.tool.snapshot(f'https://user:{secret}@example.invalid/repo', self.out, self.tag) + self.assertNotIn(secret, str(ctx.exception)) + + def test_cli_default_json_does_not_create_snapshot(self): + result = subprocess.run([sys.executable, '-B', str(TOOL), 'snapshot', + '--remote', str(self.remote), '--output', str(self.out), + '--archive-tag', self.tag], capture_output=True, text=True) + self.assertEqual(result.returncode, 0, result.stderr) + self.assertEqual(json.loads(result.stdout)['mode'], 'dry-run') + self.assertFalse(self.out.exists()) + + def test_receipt_hash_tampering_is_detected(self): + self.snapshot() + path = self.out / 'receipt.json' + receipt = json.loads(path.read_text()) + receipt['manifest_sha256'] = '0' * 64 + path.write_text(json.dumps(receipt)) + with self.assertRaisesRegex(self.tool.SafetyError, 'manifest hash mismatch'): + self.tool.verify_snapshot(self.out) + + def test_remote_inventory_does_not_spawn_one_git_process_per_ref(self): + # Thousands of refs must not multiply remote-inventory subprocesses. + with patch.object(subprocess, 'run', wraps=subprocess.run) as called: + state = self.tool.remote_state(str(self.remote)) + self.assertEqual(state['refs']['refs/heads/unmerged'], self.tip) + self.assertLessEqual(called.call_count, 2) + + def test_invalid_ref_names_are_refused(self): + for name in ('refs/heads/a..b', 'refs/heads/.hidden', 'refs/heads/a.lock', + 'refs/heads/a b', 'refs/heads/a@{b', 'refs/heads/a\\b', + 'refs/heads/a//b', 'refs/heads/trailing.', 'refs/heads/foo\nbar', + 'refs/heads/a:b', 'refs/heads/a?b', 'refs/heads/a[b'): + with self.subTest(name=name): + with self.assertRaises(self.tool.SafetyError): + self.tool._ref(name) + + def test_final_readback_rejects_changes_instead_of_partial_success(self): + self.snapshot() + self.tool.publish(self.out, execute=True) + real = self.tool.remote_state + count = 0 + def changed(remote): + nonlocal count + count += 1 + state = real(remote) + if count >= 2: + state['refs']['refs/heads/concurrent'] = self.tip + return state + with patch.object(self.tool, 'remote_state', changed): + with self.assertRaisesRegex(self.tool.SafetyError, 'final|changed|mismatch'): + self.tool.prune(self.out, execute=True) + + +if __name__ == '__main__': + unittest.main() diff --git a/tests/test_cbz_storage.py b/tests/test_cbz_storage.py new file mode 100644 index 000000000..7242329c7 --- /dev/null +++ b/tests/test_cbz_storage.py @@ -0,0 +1,152 @@ +"""Real-filesystem adversarial tests for immutable byte sharing only.""" +import importlib.util +from pathlib import Path +import os +import tempfile +import subprocess +import sys +import unittest +from unittest import mock + +spec = importlib.util.spec_from_file_location('cbz_storage', Path(__file__).resolve().parents[1] / 'tools/cbz_storage.py') +s = importlib.util.module_from_spec(spec) +spec.loader.exec_module(s) + + +class StorageTests(unittest.TestCase): + def setUp(self): + self.tmp = tempfile.TemporaryDirectory() + self.addCleanup(self.tmp.cleanup) + self.roots = [Path(self.tmp.name) / name for name in ('a', 'b')] + for root in self.roots: + root.mkdir() + (root / 'file').write_bytes(b'immutable data' * 1024) + (root / 'file').chmod(0o644) + self.args = list(map(str, self.roots)) + + def test_real_apply_preserves_bytes_modes_and_idempotence(self): + plan = s.make_plan(self.args) + self.assertEqual(len(plan['operations']), 1) + report = s.apply_plan(plan) + self.assertEqual(report['applied'], 1) + self.assertTrue(report['content_paths_modes_verified']) + self.assertTrue(os.path.samefile(*(r / 'file' for r in self.roots))) + self.assertEqual(s.make_plan(self.args)['operations'], []) + self.assertEqual(s.apply_plan(s.make_plan(self.args))['applied'], 0) + + def test_changed_input_refused_before_link(self): + plan = s.make_plan(self.args) + (self.roots[1] / 'file').write_bytes(b'changed') + with self.assertRaises(s.Refusal): + s.apply_plan(plan) + self.assertFalse(os.path.samefile(*(r / 'file' for r in self.roots))) + + def test_mode_mismatch_excluded(self): + (self.roots[1] / 'file').chmod(0o600) + self.assertEqual(s.make_plan(self.args)['operations'], []) + + def test_symlinks_excluded_and_ancestor_refused(self): + (self.roots[0] / 'link').symlink_to(self.roots[1] / 'file') + plan = s.make_plan(self.args) + self.assertEqual(len(plan['operations']), 1) + s.apply_plan(plan) + self.assertTrue((self.roots[0] / 'link').is_symlink()) + alias = Path(self.tmp.name) / 'alias' + alias.symlink_to(self.roots[0]) + with self.assertRaises(s.Refusal): + s.make_plan([str(alias)]) + + def test_forged_escape_and_operations_refused(self): + plan = s.make_plan(self.args) + plan['entries'][0]['path'] = '../../outside' + with self.assertRaises(s.Refusal): + s.apply_plan(plan) + with self.assertRaises(s.Refusal): + s.safe_path(self.roots[0], '../outside') + plan = s.make_plan(self.args) + plan['operations'] = [] + with self.assertRaises(s.Refusal): + s.apply_plan(plan) + + def test_race_before_replace_refused_and_temp_removed(self): + plan = s.make_plan(self.args) + def mutate(src, dst): + dst.write_bytes(b'race') + with self.assertRaises(s.Refusal): + s.apply_plan(plan, before_replace=mutate) + self.assertEqual((self.roots[0] / 'file').read_bytes(), b'immutable data' * 1024) + self.assertFalse(any(Path(self.tmp.name).rglob('.cbz-hardlink-*'))) + + def test_race_symlink_refused(self): + plan = s.make_plan(self.args) + def mutate(src, dst): + dst.unlink() + dst.symlink_to(src) + with self.assertRaises(s.Refusal): + s.apply_plan(plan, before_replace=mutate) + self.assertFalse(any(Path(self.tmp.name).rglob('.cbz-hardlink-*'))) + + def test_distinct_xattr_same_bytes_modes_owners_refused(self): + a, b = (r / 'file' for r in self.roots) + self.assertEqual(a.read_bytes(), b.read_bytes()) + self.assertEqual(a.stat().st_mode, b.stat().st_mode) + self.assertEqual(a.stat().st_uid, b.stat().st_uid) + self.assertEqual(a.stat().st_gid, b.stat().st_gid) + os.setxattr(b, 'user.cbz_test', b'nonempty metadata') + with self.assertRaises(s.Refusal): + s.make_plan(self.args) + self.assertFalse(os.path.samefile(a, b)) + self.assertEqual(os.getxattr(b, 'user.cbz_test'), b'nonempty metadata') + + def test_xattr_enumeration_failure_refused(self): + with mock.patch.object(s.os, 'listxattr', side_effect=PermissionError('denied')): + with self.assertRaises(s.Refusal): + s.make_plan(self.args) + + def test_xattr_added_before_replace_refused(self): + plan = s.make_plan(self.args) + def mutate(src, dst): + os.setxattr(dst, 'user.cbz_race', b'new metadata') + with self.assertRaises(s.Refusal): + s.apply_plan(plan, before_replace=mutate) + self.assertFalse(os.path.samefile(*(r / 'file' for r in self.roots))) + self.assertFalse(any(Path(self.tmp.name).rglob('.cbz-hardlink-*'))) + + def test_archive_selection_excludes_mutable_small_symlink_and_caches(self): + payload = b'x' * (1024 * 1024 + 1) + for root in self.roots: + (root / 'kept.tar.gz').write_bytes(payload) + (root / 'mutable.lean').write_bytes(payload) + (root / 'small.zip').write_bytes(b'x') + (root / 'linked.zip').symlink_to(root / 'kept.tar.gz') + for dirname in ('.git', '.lake', 'active-cache'): + (root / dirname).mkdir() + (root / dirname / 'skip.zip').write_bytes(payload) + plan = s.make_plan(self.args, archives_only=True) + self.assertEqual(len(plan['entries']), 2) + self.assertEqual(len(plan['operations']), 1) + self.assertTrue(all(e['path'] == 'kept.tar.gz' for e in plan['entries'])) + self.assertEqual(s.apply_plan(plan)['applied'], 1) + self.assertEqual(s.make_plan(self.args, archives_only=True)['operations'], []) + + def test_cli_tampered_sha_refused_without_mutation(self): + plan_path = Path(self.tmp.name) / 'plan.json' + report_path = Path(self.tmp.name) / 'report.json' + plan_path.write_bytes(s.encoded(s.make_plan(self.args))) + result = subprocess.run([sys.executable, s.__file__, 'apply', + '--plan', str(plan_path), '--sha256', '0' * 64, + '--report', str(report_path)], capture_output=True) + self.assertNotEqual(result.returncode, 0) + self.assertIn(b'plan SHA mismatch', result.stderr) + self.assertFalse(report_path.exists()) + self.assertFalse(os.path.samefile(*(r / 'file' for r in self.roots))) + + def test_already_shared_inodes_not_planned(self): + a, b = (r / 'file' for r in self.roots) + b.unlink() + os.link(a, b) + self.assertEqual(s.make_plan(self.args)['operations'], []) + + +if __name__ == '__main__': + unittest.main() diff --git a/tools/CBZNonvacuity.lean b/tools/CBZNonvacuity.lean new file mode 100644 index 000000000..3efd43999 --- /dev/null +++ b/tools/CBZNonvacuity.lean @@ -0,0 +1,57 @@ +import Lean +import UniversalLaw + +/-! CBZ evidence only. The original 31 arithmetic statements are unchanged. +The four witnesses inhabit every admissible finite-domain premise. They do not +identify Gaussian moments, coefficients, persistence bars, or parent theorems. -/ +namespace CBZNonvacuity + +theorem pairing_domain_inhabited : ∃ q : Nat, q ∈ [0,1,2,3,4,5,6] := ⟨0, by decide⟩ +theorem pairing_all_seven : (0:Nat) ∈ [0,1,2,3,4,5,6] ∧ (1:Nat) ∈ [0,1,2,3,4,5,6] ∧ (2:Nat) ∈ [0,1,2,3,4,5,6] ∧ (3:Nat) ∈ [0,1,2,3,4,5,6] ∧ (4:Nat) ∈ [0,1,2,3,4,5,6] ∧ (5:Nat) ∈ [0,1,2,3,4,5,6] ∧ (6:Nat) ∈ [0,1,2,3,4,5,6] := by decide +theorem dimensions_inhabited : ∃ d : Nat, d ∈ [2,3] := ⟨2, by decide⟩ +theorem dimensions_both : (2:Nat) ∈ [2,3] ∧ (3:Nat) ∈ [2,3] := by decide + +#print axioms pairing_domain_inhabited +#print axioms pairing_all_seven +#print axioms dimensions_inhabited +#print axioms dimensions_both +end CBZNonvacuity + +open Lean Meta Elab Command +run_cmd do + let env ← getEnv + let modules : Array Name := #[`UniversalLaw, `UniversalLaw.Side24.Ledger, `UniversalLaw.Side24.ConeMoments, `UniversalLaw.Side24.Endpoints] + let allowed : Array Name := #[``propext, ``Classical.choice, ``Quot.sound] + let mut found : Array Name := #[] + let mut count : Nat := 0 + for (moduleName, data) in env.header.moduleNames.zip env.header.moduleData do + if modules.contains moduleName then + found := found.push moduleName + for ci in data.constants do + let axioms ← collectAxioms ci.name + let bad := axioms.filter (!allowed.contains ·) + unless bad.isEmpty do + throwError "CBZ_FORBIDDEN {ci.name} {bad}" + let kind := match ci with + | .thmInfo _ => "theorem" + | .axiomInfo _ => "axiom" + | .defnInfo _ => "definition" + | _ => "generated" + if kind == "axiom" then throwError "CBZ_FORBIDDEN project axiom {ci.name}" + let (statement, premises) ← liftTermElabM do + let statement := (← ppExpr ci.type).pretty + let premises ← forallTelescope ci.type fun xs _ => do + let mut ps : Array Json := #[] + for x in xs do + let decl ← x.fvarId!.getDecl + if ← isProp decl.type then + ps := ps.push <| Json.mkObj [("name",toJson decl.userName.toString),("type",toJson (← ppExpr decl.type).pretty)] + pure ps + pure (statement,premises) + let row := Json.mkObj [("name",toJson ci.name.toString),("module",toJson moduleName.toString),("kind",toJson kind),("axioms",toJson (axioms.map toString)),("statement",toJson statement),("prop_premises",Json.arr premises)] + logInfo m!"CBZ_RECORD {row.compress}" + count := count + 1 + unless found.size == modules.size do + throwError "CBZ_MISSING_MODULE {modules.filter (!found.contains ·)}" + let summary := Json.mkObj [("count",toJson count),("modules",toJson (found.map toString))] + logInfo m!"CBZ_END {summary.compress}" diff --git a/tools/cbz_audit.py b/tools/cbz_audit.py new file mode 100644 index 000000000..3af33f70a --- /dev/null +++ b/tools/cbz_audit.py @@ -0,0 +1,383 @@ +#!/usr/bin/env python3 +"""CBZ-0 finite static auditor (Python standard library only). + +Usage: + python -B tools/cbz_audit.py selftest + python -B tools/cbz_audit.py scan --root . [--registry FILE] [--quarantine FILE] + +Both commands print JSON. Scan exits 1 on findings, 2 on incomplete coverage or +missing semantic work. It NEVER certifies overall Layer A or mathematical +soundness. static_result=PASS means only the declared finite static checks pass. + +Registry schema: {"version":1,"files":[{"path":"bounds.py","sha256":"...", +"role":"certification"}]}. Roles: certification, noncertifying, proof-source, +other. Exact bytes must match; registry completeness is a separate semantic duty. +Certification detection currently supports Python float AST nodes/calls and Lean +Float tokens only. Aliasing, FFI, dependencies and dynamic code need semantic work. + +Quarantine schema: {"version":1,"entries":[{"path":"Q.lean","sha256":"...", +"statement":"...","reason":"...","attempts":["..."],"owner":"none"}]}. +A valid entry annotates findings; it NEVER suppresses them or proves isolation. + +Inventory is the entire Git tracked working tree, including missing files, stage +conflicts, symlinks and submodules. Archives are explicitly unsupported coverage +gaps; their contents are not claimed scanned. Untracked proof/archive candidates +are reported as gaps. No archive extraction or third-party execution occurs. +""" +from __future__ import annotations +import argparse +import ast +import hashlib +import json +import os +from pathlib import Path, PurePosixPath +import re +import stat +import subprocess +import sys +import tempfile +import unicodedata + +VERSION = 'cbz-static-1' +PROOF_SUFFIXES = {'.lean', '.olean', '.ilean', '.v', '.agda', '.thy', '.tex', '.typ', '.ipynb', '.smt2', '.pvs', '.dfy', '.fst', '.fsti', '.idr', '.lagda'} +ARCHIVE_SUFFIXES = ('.zip', '.tar', '.tgz', '.tar.gz', '.tar.bz2', '.tar.xz', '.gz', '.bz2', '.xz', '.7z', '.rar', '.zst') +LEAN_FORBIDDEN = {'sorry', 'admit', 'axiom', 'native_decide'} +LEAN_TRUST = {'sorryAx', 'unsafe', 'implemented_by', 'extern', 'ofReduceBool', 'ofReduceNat', 'trustCompiler', 'skipKernelTC'} +REQUIRED_SEMANTICS = ['kernel_and_declared_axioms', 'status_index_and_nonvacuity', 'statement_alignment_and_unweakened_bounds', 'test_preservation_and_regression', 'certification_scope', 'dependency_and_dynamic_syntax_review'] + + +def digest(raw): + return hashlib.sha256(raw).hexdigest() + + +def is_archive(path, raw=b''): + return (path.lower().endswith(ARCHIVE_SUFFIXES) or raw.startswith((b'PK\x03\x04', b'PK\x05\x06', b'\x1f\x8b', b'BZh', b'\xfd7zXZ\x00', b'7z\xbc\xaf\x27\x1c', b'Rar!', b'\x28\xb5\x2f\xfd')) or raw[257:262] == b'ustar') + + +def proof_candidate(path): + return PurePosixPath(path).suffix.lower() in PROOF_SUFFIXES + + +def ident_char(c): + return c in "_'" or c.isalnum() or unicodedata.category(c).startswith(('L', 'M')) + + +def lean_tokens(source): + """Return (kind, value, line) tokens and conservative lexical gaps. + + Nested comments, ordinary/raw strings and quoted identifiers are recognized. + Interpolated strings are gaps because embedded Lean expressions need parsing. + This is not a Lean parser or a semantic dependency/axiom checker. + """ + tokens, gaps = [], [] + i, line, size = 0, 1, len(source) + while i < size: + if source.startswith('--', i): + end = source.find('\n', i) + i = size if end < 0 else end + elif source.startswith('/-', i): + start, depth = line, 1 + i += 2 + while i < size and depth: + if source.startswith('/-', i): + depth += 1 + i += 2 + elif source.startswith('-/', i): + depth -= 1 + i += 2 + else: + line += source[i] == '\n' + i += 1 + if depth: + gaps.append((start, 'unterminated nested comment')) + elif source[i] == '«': + start = line + end = source.find('»', i + 1) + if end < 0: + gaps.append((start, 'unterminated quoted identifier')) + break + tokens.append(('quoted', source[i + 1:end], line)) + line += source[i:end + 1].count('\n') + i = end + 1 + elif source.startswith('s!"', i): + gaps.append((line, 'interpolated string requires Lean parser')) + i += 2 + elif source[i] == 'r' and (match := re.match(r'r(#+)?"', source[i:])): + start = line + marker = '"' + (match.group(1) or '') + end = source.find(marker, i + len(match.group())) + if end < 0: + gaps.append((start, 'unterminated raw string')) + break + line += source[i:end + len(marker)].count('\n') + i = end + len(marker) + elif source[i] == '"': + start = line + i += 1 + closed = False + while i < size: + if source[i] == '\\': + line += i + 1 < size and source[i + 1] == '\n' + i += 2 + elif source[i] == '"': + i += 1 + closed = True + break + else: + line += source[i] == '\n' + i += 1 + if not closed: + gaps.append((start, 'unterminated string')) + elif source[i] == "'" and (match := re.match(r"'(?:[^'\\\n]|\\(?:u[0-9a-fA-F]{4}|x[0-9a-fA-F]{2}|.))'", source[i:])): + i += len(match.group()) + elif ident_char(source[i]): + start = i + while i < size and ident_char(source[i]): + i += 1 + tokens.append(('identifier', source[start:i], line)) + else: + line += source[i] == '\n' + i += 1 + return tokens, gaps + + +def lean_findings(tokens): + return [('lean.' + value, line, 'lexical trust/placeholder token requires review') + for kind, value, line in tokens + if (kind == 'identifier' and value in LEAN_FORBIDDEN) or value in LEAN_TRUST] + + +def certification_findings(path, source, tokens): + suffix = PurePosixPath(path).suffix.lower() + if suffix == '.lean': + return ([('certification.float', line, 'Float token in explicitly classified certifier') + for _, value, line in tokens if value in {'Float', 'Float32', 'Float64'}], []) + if suffix != '.py': + return [], [('certification.unsupported', 0, 'certifier language is outside finite detector scope')] + try: + tree = ast.parse(source, filename=path) + except (SyntaxError, ValueError) as error: + return [], [('certification.parse', 0, str(error))] + findings = [] + for node in ast.walk(tree): + literal = isinstance(node, ast.Constant) and type(node.value) in {float, complex} + call = isinstance(node, ast.Call) and ((isinstance(node.func, ast.Name) and node.func.id == 'float') or (isinstance(node.func, ast.Attribute) and node.func.attr in {'float', 'float16', 'float32', 'float64'})) + if literal or call: + findings.append(('certification.float', node.lineno, 'floating point in explicitly classified certifier')) + return findings, [] + + +def validate_manifest(value, kind, files): + if value is None: + return {} + key = 'files' if kind == 'registry' else 'entries' + if type(value) is not dict or set(value) != {'version', key} or type(value['version']) is not int or value['version'] != 1 or type(value[key]) is not list: + raise ValueError('invalid manifest envelope') + entries = {} + for row in value[key]: + fields = {'path', 'sha256', 'role'} if kind == 'registry' else {'path', 'sha256', 'statement', 'reason', 'attempts', 'owner'} + if type(row) is not dict or set(row) != fields: + raise ValueError('invalid manifest row fields') + path = row['path'] + if type(path) is not str or not path or PurePosixPath(path).is_absolute() or '..' in PurePosixPath(path).parts or path in entries or path not in files: + raise ValueError('unknown, unsafe or duplicate manifest path') + if type(row['sha256']) is not str or not re.fullmatch('[0-9a-f]{64}', row['sha256']) or row['sha256'] != files[path].get('sha256'): + raise ValueError('manifest bytes do not match tracked working file') + if kind == 'registry': + if row['role'] not in {'certification', 'noncertifying', 'proof-source', 'other'}: + raise ValueError('invalid classification role') + elif row['owner'] != 'none' or any(type(row[k]) is not str or not row[k].strip() for k in ('statement', 'reason')) or type(row['attempts']) is not list or not row['attempts'] or any(type(a) is not str or not a.strip() for a in row['attempts']): + raise ValueError('quarantine requires statement, reason, attempts and owner:none') + entries[path] = row + return entries + + +def scan(root, registry=None, quarantine=None): + root = Path(root).resolve() + result = {'schema_version': 1, 'tool': VERSION, 'scanner_sha256': digest(Path(__file__).read_bytes()), 'root': str(root), 'scope': 'Git tracked working-tree bytes, not commit or kernel semantics', 'files': [], 'tracked_count': 0, 'read_count': 0, 'proof_candidates': [], 'untracked': [], 'findings': [], 'coverage_gaps': [], 'quarantine': [], 'semantic_receipts_required': list(REQUIRED_SEMANTICS), 'mathematical_soundness_certified': False} + def gap(code, path, detail, line=0): + result['coverage_gaps'].append({'code': code, 'path': path, 'line': line, 'detail': detail}) + raw_files, by_path = {}, {} + try: + top = subprocess.run(['git', '-C', str(root), 'rev-parse', '--show-toplevel'], check=True, capture_output=True) + root = Path(os.fsdecode(top.stdout.removesuffix(b'\n'))).resolve() + result['root'] = str(root) + proc = subprocess.run(['git', '-C', str(root), 'ls-files', '--stage', '-z'], check=True, capture_output=True) + records = proc.stdout.split(b'\0') + for record in records: + if not record: + continue + metadata, raw_path = record.split(b'\t', 1) + mode, oid, stage = metadata.decode('ascii').split() + path = raw_path.decode('utf-8', errors='surrogateescape') + if path in by_path: + gap('git.conflict', path, 'multiple index stages') + continue + entry = {'path': path, 'index_mode': mode, 'index_object': oid, 'index_stage': stage, 'read': False} + by_path[path] = entry + result['files'].append(entry) + if stage != '0': + gap('git.conflict', path, 'unmerged index entry') + if mode == '160000': + gap('file.submodule', path, 'submodule requires independent complete scan') + continue + if mode == '120000' or any((root / parent).is_symlink() for parent in (PurePosixPath(path), *PurePosixPath(path).parents) if str(parent) != '.'): + gap('file.symlink', path, 'symlink not followed') + continue + try: + if not stat.S_ISREG((root / path).stat().st_mode): + gap('file.non_regular', path, 'tracked file replaced by non-regular file') + continue + raw = (root / path).read_bytes() + except OSError as error: + gap('file.unreadable', path, type(error).__name__) + continue + entry.update(read=True, sha256=digest(raw), bytes=len(raw)) + raw_files[path] = raw + proc = subprocess.run(['git', '-C', str(root), 'ls-files', '--others', '--exclude-standard', '-z'], check=True, capture_output=True) + result['untracked'] = [p.decode('utf-8', errors='surrogateescape') for p in proc.stdout.split(b'\0') if p] + for path in result['untracked']: + if proof_candidate(path) or is_archive(path): + gap('file.untracked_proof', path, 'untracked proof/archive candidate is outside tracked scan') + except (OSError, ValueError, subprocess.CalledProcessError) as error: + gap('git.enumeration', '', type(error).__name__) + result['tracked_count'] = len(by_path) + result['read_count'] = len(raw_files) + manifests = {} + for kind, value in [('registry', registry), ('quarantine', quarantine)]: + try: + manifests[kind] = validate_manifest(value, kind, by_path) + except (ValueError, TypeError) as error: + gap(kind + '.invalid', '', str(error)) + manifests[kind] = {} + result['quarantine'] = list(manifests['quarantine'].values()) + if quarantine is not None: + result['semantic_receipts_required'].append('quarantine_isolation_and_closed_dependencies') + candidates = {p for p in by_path if proof_candidate(p)} + candidates.update(p for p, row in manifests['registry'].items() if row['role'] == 'proof-source') + result['proof_candidates'] = sorted(candidates) + for path, raw in raw_files.items(): + suffix = PurePosixPath(path).suffix.lower() + classified = manifests['registry'].get(path, {}).get('role') + by_path[path]['classification'] = classified or 'unclassified' + if raw.startswith(b'version https://git-lfs.github.com/spec/v1\n'): + gap('file.lfs_pointer', path, 'LFS pointer bytes do not include payload') + continue + if is_archive(path, raw): + gap('archive.unsupported', path, 'archive contents not scanned; independent extraction inventory required') + continue + if path in candidates and suffix != '.lean': + gap('proof.unsupported', path, 'proof/document language is outside Lean lexical scope') + if suffix != '.lean' and classified != 'certification': + continue + try: + source = raw.decode('utf-8') + except UnicodeDecodeError: + gap('file.encoding', path, 'source is not strict UTF-8') + continue + tokens = [] + findings = [] + if suffix == '.lean': + tokens, lex_gaps = lean_tokens(source) + for line, detail in lex_gaps: + gap('lean.lexical_gap', path, detail, line) + findings.extend(lean_findings(tokens)) + if classified == 'certification': + cert_findings, cert_gaps = certification_findings(path, source, tokens) + findings.extend(cert_findings) + for code, line, detail in cert_gaps: + gap(code, path, detail, line) + for code, line, detail in findings: + result['findings'].append({'code': code, 'path': path, 'line': line, 'detail': detail, 'sha256': by_path[path]['sha256'], 'quarantine_requested': path in manifests['quarantine']}) + for item in result['coverage_gaps']: + entry = by_path.get(item['path'], {}) + item.update(sha256=entry.get('sha256'), index_object=entry.get('index_object'), kind=item['code'].split('.', 1)[0]) + result['inventory_sha256'] = digest(json.dumps(result['files'], sort_keys=True, ensure_ascii=True, separators=(',', ':')).encode()) + result['static_result'] = 'FAIL' if result['findings'] else ('INCOMPLETE' if result['coverage_gaps'] else 'PASS') + result['result'] = 'FAIL' if result['findings'] else 'INCOMPLETE' + return result + + +# Each mutation changes the actual scanner source. A killed mutant must complete +# the whole test process with assertion failures, not syntax/import errors. +MUTATIONS = [ + ('disable_placeholder_detector', "LEAN_FORBIDDEN = {'sorry', 'admit', 'axiom', 'native_decide'}", 'LEAN_FORBIDDEN = set()'), + ('disable_trust_detector', "LEAN_TRUST = {'sorryAx', 'unsafe', 'implemented_by', 'extern', 'ofReduceBool', 'ofReduceNat', 'trustCompiler', 'skipKernelTC'}", 'LEAN_TRUST = set()'), + ('ignore_hidden_files', "if not record:\n continue", "if not record or b'\\t.' in record:\n continue"), + ('suppress_coverage_failures', "result['coverage_gaps'].append({'code': code, 'path': path, 'line': line, 'detail': detail})", 'pass'), + ('suppress_active_findings', "for code, line, detail in findings:", 'for code, line, detail in []:'), + ('disable_float_detector', 'if literal or call:', 'if False:'), + ('ignore_quarantine_hash', "or row['sha256'] != files[path].get('sha256')", ''), + ('accept_empty_semantic_closure', "result['result'] = 'FAIL' if result['findings'] else 'INCOMPLETE'", "result['result'] = 'FAIL' if result['findings'] else 'PASS'"), + ('disable_archive_detection', 'if is_archive(path, raw):', 'if False:'), + ('ignore_untracked_proofs', 'if proof_candidate(path) or is_archive(path):', 'if False:'), + ('misclassify_all_python_as_certification', "classified = manifests['registry'].get(path, {}).get('role')", "classified = 'certification' if suffix == '.py' else manifests['registry'].get(path, {}).get('role')"), + ('hide_quarantined_findings', 'for code, line, detail in findings:', "for code, line, detail in ([] if path in manifests['quarantine'] else findings):"), +] + + +def selftest(tests): + source_path = Path(__file__).resolve() + source = source_path.read_text() + def run(path): + env = dict(os.environ, CBZ_AUDIT_UNDER_TEST=str(path), PYTHONDONTWRITEBYTECODE='1') + proc = subprocess.run([sys.executable, '-B', str(tests)], capture_output=True, text=True, env=env) + return proc.returncode, proc.stdout + proc.stderr + code, output = run(source_path) + result = {'schema_version': 1, 'tool': VERSION, 'scope': 'finite behavioral and source-mutation suite; no mathematical soundness claim', 'scanner_sha256': digest(source.encode()), 'tests_sha256': digest(tests.read_bytes()), 'baseline': {'exit_code': code, 'output': output}, 'mutants': [], 'threshold': {'numerator': 1, 'denominator': 1}, 'result': 'FAIL'} + if code != 0 or not re.search(r'Ran [1-9][0-9]* tests? in ', output): + return result + with tempfile.TemporaryDirectory(prefix='cbz-audit-mutants-') as directory: + for name, before, after in MUTATIONS: + # Restrict replacement to production source before mutation definitions. + head, tail = source.split('\nMUTATIONS = [', 1) + if head.count(before) != 1: + result['mutants'].append({'name': name, 'killed': False, 'error': 'mutation target not unique'}) + continue + path = Path(directory) / (name + '.py') + path.write_text(head.replace(before, after, 1) + '\nMUTATIONS = [' + tail) + code, output = run(path) + killed = code != 0 and bool(re.search(r'FAILED \(failures=[1-9][0-9]*\)', output)) and 'ERROR:' not in output + result['mutants'].append({'name': name, 'killed': killed, 'exit_code': code, 'output': output}) + result['killed'] = sum(item['killed'] for item in result['mutants']) + result['total'] = len(MUTATIONS) + result['result'] = 'PASS' if result['total'] > 0 and result['killed'] * result['threshold']['denominator'] >= result['total'] * result['threshold']['numerator'] else 'FAIL' + return result + + +def load_json(path): + def pairs(items): + out = {} + for key, value in items: + if key in out: + raise ValueError('duplicate JSON key') + out[key] = value + return out + def bad_number(value): + raise ValueError('non-integer JSON number forbidden: ' + value) + return json.loads(path.read_text(), object_pairs_hook=pairs, parse_float=bad_number, parse_constant=bad_number) + + +def main(argv=None): + parser = argparse.ArgumentParser(description=__doc__, formatter_class=argparse.RawDescriptionHelpFormatter) + commands = parser.add_subparsers(dest='command', required=True) + scan_args = commands.add_parser('scan') + scan_args.add_argument('--root', type=Path, default=Path.cwd()) + scan_args.add_argument('--registry', type=Path) + scan_args.add_argument('--quarantine', type=Path) + self_args = commands.add_parser('selftest') + self_args.add_argument('--tests', type=Path, default=Path(__file__).resolve().parents[1] / 'tests/test_cbz_audit.py') + args = parser.parse_args(argv) + try: + if args.command == 'selftest': + result = selftest(args.tests.resolve()) + else: + result = scan(args.root, registry=load_json(args.registry) if args.registry else None, quarantine=load_json(args.quarantine) if args.quarantine else None) + except (OSError, ValueError, TypeError, subprocess.SubprocessError) as error: + result = {'result': 'FAIL', 'error': type(error).__name__ + ': ' + str(error), 'mathematical_soundness_certified': False} + print(json.dumps(result, sort_keys=True, indent=2, ensure_ascii=True, allow_nan=False)) + return 0 if result['result'] == 'PASS' else (2 if result['result'] == 'INCOMPLETE' else 1) + + +if __name__ == '__main__': + sys.exit(main()) diff --git a/tools/cbz_baseline.py b/tools/cbz_baseline.py new file mode 100644 index 000000000..28d9b0c46 --- /dev/null +++ b/tools/cbz_baseline.py @@ -0,0 +1,455 @@ +#!/usr/bin/env python3 +"""Bounded local CBZ evidence validator. No network or Git-ref writes. + +PASS means only that the explicitly reported mechanical checks passed. This tool +cannot certify mathematical closure, complete Layer A, remote hygiene or CBZ-0. +Gate PASS means an observed, source-bound registered command exited zero. +""" +from __future__ import annotations +import argparse +import hashlib +import json +import os +from pathlib import Path +import re +import shutil +import signal +import subprocess +import sys +import time + +DEFAULT_CONFIG = 'cbz/evidence/website-foundation-20261029/baseline-config.json' +GATES = tuple(f'G{i}' for i in range(12)) +STATES = {'PASS', 'FAIL', 'INCOMPLETE'} + + +class ValidationError(RuntimeError): + pass + + +def _pairs(items): + result = {} + for key, value in items: + if key in result: + raise ValidationError('duplicate JSON key: ' + key) + result[key] = value + return result + + +def _read(path): + try: + return json.loads(Path(path).read_text(), object_pairs_hook=_pairs) + except (OSError, ValueError) as error: + raise ValidationError('unreadable or invalid JSON: ' + str(path)) from error + + +def _sha(path): + return hashlib.sha256(Path(path).read_bytes()).hexdigest() + + +def _inside(root, relative): + if not isinstance(relative, str) or not relative or Path(relative).is_absolute(): + raise ValidationError('expected relative source path') + path = (root / relative).resolve() + if not path.is_relative_to(root) or '.git' in Path(relative).parts: + raise ValidationError('source path escapes root or enters Git internals') + return path + + +def _config(root, config_path=None): + selected = config_path or DEFAULT_CONFIG + path = _inside(root, selected) + config = _read(path) + if config.get('schema') != 'cbz.baseline.v1': + raise ValidationError('unsupported baseline config schema') + if not set(config.get('allowed_axioms', [])).issubset({'propext', 'Classical.choice', 'Quot.sound'}): + raise ValidationError('custom axioms cannot be admitted by config') + gates = config.get('gates', []) + if not isinstance(gates, list) or len({g.get('id') for g in gates}) != len(gates): + raise ValidationError('duplicate or invalid gate declarations') + for gate in gates: + if gate.get('id') not in GATES or not isinstance(gate.get('argv'), list) or not gate['argv']: + raise ValidationError('invalid registered gate') + if any(not isinstance(x, str) or not x or '\x00' in x for x in gate['argv']): + raise ValidationError('invalid gate argv') + if not isinstance(gate.get('sources'), list) or not gate['sources']: + raise ValidationError('gate requires exact source inputs') + for source in gate['sources']: + _inside(root, source) + timeout = gate.get('timeout_seconds', 60) + memory = gate.get('memory_mb', 1024) + if type(timeout) is not int or not 1 <= timeout <= 3600 or type(memory) is not int or not 64 <= memory <= 8192: + raise ValidationError('gate resource bounds invalid') + config['_config_path'] = selected + return config + + +def _status(failures, unmet): + return 'FAIL' if failures else ('INCOMPLETE' if unmet else 'PASS') + + +def _hash_entries(root, entries, label, failures, unmet): + if not isinstance(entries, list) or not entries: + unmet.append(label + ': no exact source/evidence hashes') + return + seen = set() + for entry in entries: + if not isinstance(entry, dict) or not re.fullmatch(r'[0-9a-f]{64}', str(entry.get('sha256', ''))): + failures.append(label + ': invalid SHA-256 entry') + continue + path = _inside(root, entry.get('path')) + if entry['path'] in seen: + failures.append(label + ': duplicate source path') + seen.add(entry['path']) + if not path.is_file(): + unmet.append(label + ': missing ' + entry['path']) + elif _sha(path) != entry['sha256']: + failures.append(label + ': source/evidence hash mismatch ' + entry['path']) + + +def _proofs(root, config, failures, unmet): + index = _read(_inside(root, config['proof_index'])) + records = index.get('records') + if index.get('schema') != 'cbz.proof-index.v1' or not isinstance(records, list) or not records: + failures.append('proof index schema/records invalid') + return + ids = [r.get('id') for r in records] + if any(not isinstance(x, str) or not x for x in ids) or len(set(ids)) != len(ids): + failures.append('proof index IDs missing or duplicated') + return + by_id = dict(zip(ids, records)) + allowed = set(config.get('allowed_axioms', [])) + for record in records: + label = 'proof ' + record['id'] + status = record.get('status') + if status not in ('CLOSED', 'QUARANTINED'): + failures.append(label + ': invalid status') + _hash_entries(root, record.get('source_hashes'), label, failures, unmet) + if not record.get('exact_boundary') or not record.get('scientific_closure_limits'): + unmet.append(label + ': missing exact boundary or scientific limits') + deps = record.get('dependencies') + if not isinstance(deps, list) or any(dep not in by_id for dep in deps): + failures.append(label + ': dependency list missing or unresolved') + continue + if status == 'QUARANTINED': + if record.get('owner') != 'none' or any(not record.get(x) for x in ('reason', 'attempts', 'isolation')): + failures.append(label + ': quarantine reason/attempts/isolation/owner incomplete') + if status == 'CLOSED': + axioms = record.get('axioms') + if not isinstance(axioms, list): + unmet.append(label + ': exact observed axiom list unavailable') + elif any(axiom not in allowed for axiom in axioms): + failures.append(label + ': custom or undeclared axiom in CLOSED record') + _hash_entries(root, record.get('kernel_evidence'), label + ' kernel evidence', failures, unmet) + todo, seen = list(deps), set() + while todo: + dep = todo.pop() + if dep in seen: + continue + seen.add(dep) + if by_id[dep].get('status') == 'QUARANTINED': + failures.append(label + ': transitively depends on quarantined ' + dep) + next_deps = by_id[dep].get('dependencies', []) + if isinstance(next_deps, list): + todo.extend(x for x in next_deps if x in by_id) + # Cycles cannot supply independent closure evidence. + visiting, done = set(), set() + def visit(name): + if name in visiting: + failures.append('proof dependency cycle: ' + name) + return + if name in done: + return + visiting.add(name) + for dep in by_id[name].get('dependencies', []): + if dep in by_id: + visit(dep) + visiting.remove(name) + done.add(name) + for name in ids: + visit(name) + + +def _tools(root, config, failures, unmet): + registry = _read(_inside(root, config['tool_registry'])) + if registry.get('schema') != 'cbz.tools.v1' or not isinstance(registry.get('tools'), list): + failures.append('tool registry schema invalid') + return + listed = set() + for tool in registry['tools']: + path = tool.get('path') + if path in listed: + failures.append('duplicate registered tool: ' + str(path)) + listed.add(path) + if not _inside(root, path).is_file(): + unmet.append('registered tool missing: ' + str(path)) + command = tool.get('self_test') + if not isinstance(command, list) or not command or any(not isinstance(x, str) for x in command): + unmet.append('registered tool has no executable self-test: ' + str(path)) + if 'source_hashes' in tool: + _hash_entries(root, tool['source_hashes'], 'tool ' + str(path), failures, unmet) + for path in (root / 'tools').glob('cbz_*.py'): + if path.relative_to(root).as_posix() not in listed: + failures.append('unlisted mission tool: ' + path.name) + + +def _git(root, *args): + env = {k: v for k, v in os.environ.items() if not k.startswith('GIT_')} + env.update(GIT_TERMINAL_PROMPT='0', GIT_NO_REPLACE_OBJECTS='1') + p = subprocess.run(['git', '-C', str(root), *args], capture_output=True, env=env, timeout=30) + if p.returncode: + raise ValidationError('local Git observation unavailable') + return p.stdout + + +def _pins(root, config, failures, unmet): + result = [] + pins = config.get('pins') + if not isinstance(pins, list) or not pins: + unmet.append('cross-repository pin inventory unavailable or empty') + return result + for pin in pins: + local_f, local_u = [], [] + try: + commit = pin['commit'] + if not re.fullmatch(r'[0-9a-f]{40}(?:[0-9a-f]{24})?', commit): + local_f.append('pin commit must be exact full object ID') + repo = (root / pin['repo']).resolve() + if not repo.is_dir(): + local_u.append('offline dependency repository unavailable') + elif not local_f: + _git(repo, 'cat-file', '-e', commit + '^{commit}') + objpath = pin['object_path'] + if not isinstance(objpath, str) or not objpath or objpath.startswith(('/', '-')) or '..' in Path(objpath).parts: + raise ValidationError('invalid pinned object path') + content = _git(repo, 'show', commit + ':' + objpath) + if hashlib.sha256(content).hexdigest() != pin['sha256']: + local_f.append('pinned object bytes mismatch') + if 'pin_file' in pin: + manifest = _read(_inside(root, pin['pin_file'])) + matches = [p for p in manifest.get('packages', []) if p.get('name') == pin.get('package')] + if len(matches) != 1 or matches[0].get('rev') != commit: + local_f.append('package manifest pinned commit mismatch') + else: + local_u.append('no consuming package manifest binding') + except (KeyError, TypeError, ValidationError, OSError, subprocess.TimeoutExpired): + local_u.append('offline pin object/config evidence incomplete') + failures.extend('pin: ' + x for x in local_f) + unmet.extend('pin: ' + x for x in local_u) + result.append({'repo': pin.get('repo'), 'status': _status(local_f, local_u), 'failures': local_f, 'unmet': local_u}) + return result + + +def _binding(root, config, gate): + paths = [config['_config_path'], config['proof_index'], config['tool_registry'], *gate['sources']] + return {name: _sha(_inside(root, name)) for name in sorted(set(paths))} + + +def _receipt_statuses(root, config, receipt_path, failures, unmet): + statuses = dict.fromkeys(GATES, 'INCOMPLETE') + declared = {gate['id']: gate for gate in config.get('gates', [])} + if receipt_path is None: + unmet.append('no observed source-bound gate receipts supplied') + return statuses + try: + receipt_path = Path(receipt_path).resolve() + receipts = _read(receipt_path) + if receipts.get('schema') != 'cbz.receipts.v1' or receipts.get('config_sha256') != _sha(_inside(root, config['_config_path'])): + raise ValidationError('stale or invalid receipt configuration binding') + rows = receipts.get('gates', []) + if not isinstance(rows, list) or len({r.get('id') for r in rows}) != len(rows): + raise ValidationError('duplicate gate receipts') + for row in rows: + name = row.get('id') + if name not in declared: + raise ValidationError('receipt for unregistered gate') + gate = declared[name] + if row.get('argv') != gate['argv'] or row.get('source_sha256') != _binding(root, config, gate): + unmet.append(name + ': stale receipt command/source identity') + continue + valid = True + for stream in ('stdout', 'stderr'): + relative = row.get(stream + '_path') + if not isinstance(relative, str): + valid = False + break + log = (receipt_path.parent / relative).resolve() + if not log.is_relative_to(receipt_path.parent) or not log.is_file() or _sha(log) != row.get(stream + '_sha256'): + valid = False + break + observed = 'INCOMPLETE' if row.get('timed_out') or row.get('source_changed') else ('PASS' if row.get('exit_code') == 0 else ('INCOMPLETE' if row.get('exit_code') == 2 else 'FAIL')) + if not valid or row.get('status') != observed or type(row.get('exit_code')) not in (int, type(None)) or not row.get('started_utc'): + unmet.append(name + ': unverified/forged receipt or process logs') + continue + statuses[name] = observed + except (ValidationError, OSError, TypeError, KeyError): + unmet.append('stale/invalid receipt or missing exact execution evidence') + return dict.fromkeys(GATES, 'INCOMPLETE') + for name, status in statuses.items(): + if status == 'INCOMPLETE': + unmet.append(name + ': not observed passing on current registered inputs') + elif status == 'FAIL': + failures.append(name + ': observed command failed') + return statuses + + +def cold_start(root, *, config_path=None): + root = Path(root).resolve() + config = _config(root, config_path) + cold = config.get('cold_start', {}) + failures, unmet = [], [] + try: + text = _inside(root, cold['status']).read_text() + for answer in cold.get('required_answers', []): + if answer not in text: + failures.append('STATUS missing required answer heading: ' + answer) + commands = cold.get('commands', []) + if not commands: + unmet.append('no cold-start commands registered') + for command in commands: + if not isinstance(command, list) or not command or not all(isinstance(x, str) for x in command): + failures.append('invalid cold-start command') + continue + if ' '.join(command) not in text: + failures.append('registered cold-start argv absent from STATUS') + if not shutil.which(command[0]) and not (root / command[0]).is_file(): + unmet.append('cold-start executable unavailable: ' + command[0]) + for arg in command[1:]: + if arg.startswith(('tools/', 'tests/')) and not _inside(root, arg).is_file(): + unmet.append('cold-start entrypoint missing: ' + arg) + except (KeyError, OSError): + unmet.append('STATUS cold-start entrypoint unavailable') + return {'schema': 'cbz.cold-start.v1', 'status': _status(failures, unmet), 'failures': failures, + 'unmet': unmet, 'certifies_theorems': False, + 'scope': 'required answer headings, documented argv, and executable entrypoint availability only'} + + +def inspect(root, *, receipts=None, config_path=None): + root = Path(root).resolve() + config = _config(root, config_path) + failures, unmet = [], [] + for operation in (_proofs, _tools): + try: + operation(root, config, failures, unmet) + except (ValidationError, OSError, TypeError, KeyError): + unmet.append(operation.__name__ + ': input schema/files incomplete') + pins = _pins(root, config, failures, unmet) + statuses = _receipt_statuses(root, config, receipts, failures, unmet) + for name in GATES: + if name not in {gate['id'] for gate in config.get('gates', [])}: + unmet.append(name + ': no registered gate command') + for doc in config.get('docs', []): + try: + text = _inside(root, doc).read_text() + markers = re.findall(r'', text, re.S) + if len(markers) != 1: + unmet.append(doc + ': missing/duplicate machine gate claims') + continue + claims = json.loads(markers[0], object_pairs_hook=_pairs) + if set(claims) != set(GATES) or any(value not in STATES for value in claims.values()): + failures.append(doc + ': invalid gate claims') + elif claims != statuses: + failures.append(doc + ': documented gate statuses disagree with observed current receipts') + except (OSError, ValidationError, ValueError): + unmet.append(doc + ': unavailable/invalid document claims') + cold = cold_start(root, config_path=config_path) + failures.extend(cold['failures']) + unmet.extend(cold['unmet']) + try: + dirty = _git(root, 'status', '--porcelain=v1', '--untracked-files=all').decode().splitlines() + stashes = _git(root, 'stash', 'list').decode().splitlines() + heads = _git(root, 'for-each-ref', '--format=%(refname)', 'refs/heads').decode().splitlines() + worktrees = _git(root, 'worktree', 'list', '--porcelain').decode().count('worktree ') + if dirty: + unmet.append('local Git worktree/index not clean') + if stashes: + unmet.append('local Git stashes remain') + if len(heads) != 1: + unmet.append('local Git branch disposition incomplete') + if worktrees != 1: + unmet.append('additional local Git worktrees require disposition') + git = {'dirty_paths': len(dirty), 'stashes': len(stashes), 'local_heads': heads, 'worktrees': worktrees} + except (ValidationError, subprocess.TimeoutExpired): + unmet.append('local Git hygiene unavailable') + git = {'status': 'INCOMPLETE'} + return {'schema': 'cbz.inspect.v1', 'status': _status(failures, unmet), 'gate_statuses': statuses, + 'failures': failures, 'unmet': unmet, 'pins': pins, 'local_git': git, + 'certifies_cbz0': False, 'baseline_state': 'Partial Baseline', + 'scope': 'mechanical local evidence consistency; command exits do not establish full Layer A or theorem acceptance'} + + +def run(root, output, *, config_path=None): + root, output = Path(root).resolve(), Path(output).resolve() + if output.is_relative_to(root) or output.exists(): + raise ValidationError('run output must be new and outside source root') + config = _config(root, config_path) + output.mkdir(parents=True) + result = {'schema': 'cbz.receipts.v1', 'config_sha256': _sha(_inside(root, config['_config_path'])), + 'scope': 'observed registered command exits with exact source/log binding; not scientific certification', 'gates': []} + for gate in sorted(config.get('gates', []), key=lambda g: int(g['id'][1:])): + name = gate['id'] + row = {'id': name, 'argv': gate['argv'], 'status': 'INCOMPLETE', 'exit_code': None, + 'timed_out': False, 'source_changed': False, 'started_utc': time.strftime('%Y-%m-%dT%H:%M:%SZ', time.gmtime()), + 'stdout_path': name + '.stdout', 'stderr_path': name + '.stderr'} + try: + row['source_sha256'] = _binding(root, config, gate) + timeout = gate.get('timeout_seconds', 60) + def limits(): + import resource + resource.setrlimit(resource.RLIMIT_CPU, (timeout + 1, timeout + 2)) + memory = gate.get('memory_mb', 1024) * 1024 * 1024 + resource.setrlimit(resource.RLIMIT_AS, (memory, memory)) + resource.setrlimit(resource.RLIMIT_FSIZE, (64 * 1024 * 1024, 64 * 1024 * 1024)) + with (output / row['stdout_path']).open('wb') as stdout, (output / row['stderr_path']).open('wb') as stderr: + process = subprocess.Popen(gate['argv'], cwd=root, stdout=stdout, stderr=stderr, + start_new_session=True, preexec_fn=limits) + try: + row['exit_code'] = process.wait(timeout=timeout) + except subprocess.TimeoutExpired: + row['timed_out'] = True + os.killpg(process.pid, signal.SIGKILL) + row['exit_code'] = process.wait() + row['source_changed'] = row['source_sha256'] != _binding(root, config, gate) + row['status'] = 'INCOMPLETE' if row['timed_out'] or row['source_changed'] else ('PASS' if row['exit_code'] == 0 else ('INCOMPLETE' if row['exit_code'] == 2 else 'FAIL')) + except (OSError, ValidationError, subprocess.SubprocessError): + row['status'] = 'INCOMPLETE' + row['error'] = 'command/input unavailable; no passing execution claimed' + for stream in ('stdout', 'stderr'): + path = output / row[stream + '_path'] + path.touch(exist_ok=True) + row[stream + '_sha256'] = _sha(path) + result['gates'].append(row) + temp = output / 'receipts.json.tmp' + temp.write_text(json.dumps(result, sort_keys=True, indent=2) + '\n') + temp.replace(output / 'receipts.json') + return result + + +def main(argv=None): + parser = argparse.ArgumentParser(description=__doc__) + sub = parser.add_subparsers(dest='command', required=True) + for name in ('inspect', 'cold-start', 'run'): + command = sub.add_parser(name) + command.add_argument('--root', default='.') + command.add_argument('--config', default=DEFAULT_CONFIG, help='root-relative namespaced config') + if name == 'inspect': + command.add_argument('--receipts') + if name == 'run': + command.add_argument('--output', required=True) + args = parser.parse_args(argv) + try: + if args.command == 'run': + result = run(args.root, args.output, config_path=args.config) + code = 0 if len(result['gates']) == 12 and all(r['status'] == 'PASS' for r in result['gates']) else 2 + else: + result = inspect(args.root, receipts=args.receipts, config_path=args.config) if args.command == 'inspect' else cold_start(args.root, config_path=args.config) + code = {'PASS': 0, 'FAIL': 1, 'INCOMPLETE': 2}[result['status']] + print(json.dumps(result, sort_keys=True, indent=2)) + return code + except (ValidationError, OSError, KeyError, TypeError) as error: + print(json.dumps({'status': 'INCOMPLETE', 'error': str(error), 'certifies_cbz0': False})) + return 2 + + +if __name__ == '__main__': + sys.exit(main()) diff --git a/tools/cbz_lean_check.py b/tools/cbz_lean_check.py new file mode 100644 index 000000000..9c8365024 --- /dev/null +++ b/tools/cbz_lean_check.py @@ -0,0 +1,245 @@ +#!/usr/bin/env python3 +"""Portable Main arithmetic CBZ gate. Run with pinned lake on PATH. + +python -B -S tools/cbz_lean_check.py + +Reuses formal_gate_check, then executes actual whole-module census controls, +theorem-kind/premise capture, finite-domain witnesses and full --fresh replay. +Receipt: formal/.lake/cbz-evidence/receipt.json. No paper/theorem alignment or +Math- closure is inferred. All failed phase logs remain available. +""" +import argparse +import hashlib +import importlib.util +import json +import os +import re +from pathlib import Path +import shutil +import subprocess +import sys + +ALLOWED = {'propext', 'Classical.choice', 'Quot.sound'} +PREMISES = { + 'UniversalLaw.Side24.pairing_sum_le_six': 'q ∈ [0,1,2,3,4,5,6]', + 'UniversalLaw.Side24.exponent_bounds': 'd ∈ [2,3]', +} +MODULES_LINE = 'let modules : Array Name := #[`UniversalLaw, `UniversalLaw.Side24.Ledger, `UniversalLaw.Side24.ConeMoments, `UniversalLaw.Side24.Endpoints]' +WITNESSES = ['CBZNonvacuity.' + n for n in ('pairing_domain_inhabited', 'pairing_all_seven', 'dimensions_inhabited', 'dimensions_both')] + + +# Independent semantic contracts: witness names and an allowed axiom list alone +# are insufficient. These expected propositions do not come from the witness file. +WITNESS_TYPES = { + 'CBZNonvacuity.pairing_domain_inhabited': '∃ q, q ∈ [0, 1, 2, 3, 4, 5, 6]', + 'CBZNonvacuity.pairing_all_seven': ' ∧ '.join(str(q) + ' ∈ [0, 1, 2, 3, 4, 5, 6]' for q in range(7)), + 'CBZNonvacuity.dimensions_inhabited': '∃ d, d ∈ [2, 3]', + 'CBZNonvacuity.dimensions_both': '2 ∈ [2, 3] ∧ 3 ∈ [2, 3]', +} +WITNESS_PROPOSITIONS = { + 'CBZNonvacuity.pairing_domain_inhabited': '∃ q : Nat, q ∈ [0,1,2,3,4,5,6]', + 'CBZNonvacuity.pairing_all_seven': ' ∧ '.join('(' + str(q) + ':Nat) ∈ [0,1,2,3,4,5,6]' for q in range(7)), + 'CBZNonvacuity.dimensions_inhabited': '∃ d : Nat, d ∈ [2,3]', + 'CBZNonvacuity.dimensions_both': '(2:Nat) ∈ [2,3] ∧ (3:Nat) ∈ [2,3]', +} + + +def require(condition, message): + if not condition: + raise ValueError(message) + + +def sha(path): + return hashlib.sha256(Path(path).read_bytes()).hexdigest() + + +def load_json(text): + def unique(pairs): + result = {} + for key, value in pairs: + require(key not in result, 'duplicate JSON key: ' + key) + result[key] = value + return result + return json.loads(text, object_pairs_hook=unique) + + +def validate_census(log, targets, modules): + records, summaries = {}, [] + for line in log.splitlines(): + if line.startswith('CBZ_RECORD '): + row = load_json(line[len('CBZ_RECORD '):]) + require(set(row) == {'name', 'module', 'kind', 'axioms', 'statement', 'prop_premises'}, 'invalid census record') + name = row['name'] + require(isinstance(name, str) and name and name not in records, 'duplicate/invalid census declaration') + require(row['module'] in modules, 'unexpected module') + require(row['kind'] in {'theorem', 'definition', 'generated'}, 'project axiom or unknown constant kind') + require(isinstance(row['axioms'], list) and all(isinstance(a, str) for a in row['axioms']) and set(row['axioms']) <= ALLOWED, 'forbidden transitive axiom') + require(isinstance(row['statement'], str) and row['statement'], 'missing elaborated statement') + require(isinstance(row['prop_premises'], list), 'invalid premise inventory') + if name in WITNESS_TYPES: + require(row['kind'] == 'theorem' and not row['prop_premises'] and + ''.join(row['statement'].split()) == ''.join(WITNESS_TYPES[name].split()), + 'witness type contract changed: ' + name) + for premise in row['prop_premises']: + require(isinstance(premise, dict) and set(premise) == {'name', 'type'} and all(isinstance(v, str) for v in premise.values()), 'invalid premise record') + if row['kind'] == 'theorem' and row['prop_premises']: + require(name in PREMISES and len(row['prop_premises']) == 1, 'conditional theorem lacks an explicit nonvacuity witness') + actual = ''.join(row['prop_premises'][0]['type'].split()) + require(actual == ''.join(PREMISES[name].split()), 'witness does not cover changed theorem premise') + records[name] = row + elif line.startswith('CBZ_END '): + summaries.append(load_json(line[len('CBZ_END '):])) + elif line.startswith('CBZ_'): + raise ValueError('unknown/refused audit output: ' + line) + require(len(summaries) == 1, 'missing/duplicate census end') + end = summaries[0] + require(set(end) == {'count', 'modules'} and type(end['count']) is int and end['count'] == len(records), 'census count mismatch') + require(isinstance(end['modules'], list) and len(end['modules']) == len(set(end['modules'])) and set(end['modules']) == set(modules), 'missing/duplicate selected module') + proofs = [row for row in records.values() if row['kind'] == 'theorem'] + require({row['name'] for row in proofs} == set(targets), 'actual theorem inventory differs from manifest targets') + return dict(constants=list(records.values()), proofs=proofs, modules=end['modules']) + + +def run(command, label, out, pkg, env, timeout, expected=0): + result = subprocess.run(command, cwd=pkg, env=env, text=True, stdout=subprocess.PIPE, stderr=subprocess.STDOUT, timeout=timeout) + (out / (label + '.log')).write_text(result.stdout, encoding='utf-8') + require((result.returncode == 0) == (expected == 0), 'unexpected phase outcome: ' + label + '\n' + result.stdout[-3000:]) + return result.stdout + + +def audit_program(source, module): + require(source.count(MODULES_LINE) == 1, 'missing/duplicate audit module boundary') + require(re.fullmatch(r'[A-Za-z_][A-Za-z0-9_.]*', module) is not None, 'unsafe audit module name') + marker = 'open Lean Meta Elab Command' + require(source.count(marker) == 1, 'missing/duplicate audit command boundary') + return ('import Lean\nimport ' + module + '\n' + source[source.index(marker):]).replace( + MODULES_LINE, 'let modules : Array Name := #[`' + module + ']') + + +def witness_contract_program(module): + require(re.fullmatch(r'[A-Za-z_][A-Za-z0-9_.]*', module) is not None, 'unsafe witness contract module') + return ('import ' + module + '\n' + + '\n'.join('example : (' + WITNESS_PROPOSITIONS[name] + ') := ' + name for name in WITNESSES) + '\n') + + +def self_test(source, lake, out, pkg, env, timeout): + cases = { + 'honest': ('theorem honest : True := True.intro\n', True), + 'unused_axiom': ('axiom hidden : False\ntheorem honest : True := True.intro\n', False), + 'sorry': ('theorem bad : False := by sorry\n', False), + 'native': ('theorem native : (2 : Nat) + 2 = 4 := by native_decide\n', False), + 'false_premise': ('theorem vacuous (h : False) : False := h\n', True), + } + outcomes = {} + for label, (body, accepted) in cases.items(): + module = 'CBZControl_' + label + fixture = out / (module + '.lean') + fixture.write_text('import UniversalLaw\n' + body) + run([lake, 'env', 'lean', '-o', str(pkg / '.lake/build/lib/lean' / (module + '.olean')), str(fixture)], label + '-compile', out, pkg, env, timeout) + audit = out / ('Audit_' + label + '.lean') + audit.write_text(source.replace('import UniversalLaw', 'import ' + module).replace(MODULES_LINE, 'let modules : Array Name := #[`' + module + ']')) + log = run([lake, 'env', 'lean', str(audit)], label + '-audit', out, pkg, env, timeout, expected=0 if accepted else 1) + if not accepted: + require('CBZ_FORBIDDEN' in log, 'control failed outside its intended axiom boundary') + elif label == 'false_premise': + try: + validate_census(log, {'vacuous'}, {module}) + except ValueError as exc: + require('nonvacuity' in str(exc), 'false-premise control failed for an unrelated reason') + else: + raise ValueError('false-premise theorem escaped premise gate') + else: + validate_census(log, {'honest'}, {module}) + outcomes[label] = 'EXPECTED_REJECTION' if not accepted or label == 'false_premise' else 'EXPECTED_ACCEPTANCE' + missing = out / 'MissingModule.lean' + missing.write_text(source.replace(MODULES_LINE, 'let modules : Array Name := #[`UniversalLaw, `MissingModule]')) + log = run([lake, 'env', 'lean', str(missing)], 'missing-module', out, pkg, env, timeout, expected=1) + require('CBZ_MISSING_MODULE' in log, 'missing-module control failed outside the inventory boundary') + outcomes['missing_module'] = 'EXPECTED_REJECTION' + # R3: same public names, empty axiom lists and no premises still do not + # establish nonvacuity if all four witness statements have become True. + module = 'CBZWeakenedWitness' + fixture = out / (module + '.lean') + fixture.write_text('import UniversalLaw\nnamespace CBZNonvacuity\n' + + ''.join('theorem ' + name.split('.')[-1] + ' : True := True.intro\n' for name in WITNESSES) + + 'end CBZNonvacuity\n') + run([lake, 'env', 'lean', '-o', str(pkg / '.lake/build/lib/lean' / (module + '.olean')), str(fixture)], + 'weakened-witness-compile', out, pkg, env, timeout) + audit = out / 'AuditWeakenedWitness.lean' + audit.write_text(audit_program(source, module)) + log = run([lake, 'env', 'lean', str(audit)], 'weakened-witness-audit', out, pkg, env, timeout) + try: + validate_census(log, set(WITNESSES), {module}) + except ValueError as exc: + require('witness type contract' in str(exc), 'weakened witness rejected for unrelated reason') + else: + raise ValueError('weakened witness escaped the exact-type census contract') + contract = out / 'WeakenedWitnessContract.lean' + contract.write_text(witness_contract_program(module)) + log = run([lake, 'env', 'lean', str(contract)], 'weakened-witness-contract', out, pkg, env, timeout, expected=1) + require('type mismatch' in log.lower(), 'weakened witness contract failed outside its proof type') + outcomes['weakened_witness_types'] = 'REJECTED_BY_EXACT_TYPE_CENSUS_AND_LEAN_ASCRIPTION' + return outcomes + + +def execute(root, timeout): + gate_path = root / 'tools/formal_gate_check.py' + spec = importlib.util.spec_from_file_location('existing_main_gate', gate_path) + gate = importlib.util.module_from_spec(spec) + spec.loader.exec_module(gate) + manifest, digest, pkg = gate.source_check(root) + out = pkg / '.lake/cbz-evidence' + require(not (pkg / '.lake').is_symlink() and not out.is_symlink(), 'symlink evidence directory refused') + out.mkdir(parents=True, exist_ok=True) + receipt_path = out / 'receipt.json' + receipt_path.unlink(missing_ok=True) + inputs = [gate_path, root / 'tools/CBZNonvacuity.lean', Path(__file__).resolve()] + before = {str(p.relative_to(root)): sha(p) for p in inputs} + source = inputs[1].read_text() + require(source.count(MODULES_LINE) == 1, 'census module boundary changed') + lake = gate.lake_binary() + require(lake is not None, 'pinned lake missing from PATH') + env = dict(os.environ, PATH=str(Path(lake).parent) + os.pathsep + os.environ.get('PATH', '')) + baseline = gate.execute(manifest, digest, pkg, root) + controls = self_test(source, lake, out, pkg, env, timeout) + audit = out / 'CBZNonvacuity.lean' + audit.write_text(source) + log = run([lake, 'env', 'lean', '-o', str(pkg / '.lake/build/lib/lean/CBZNonvacuity.olean'), str(audit)], 'all-declarations-and-witnesses', out, pkg, env, timeout) + targets = {t['name'] for t in manifest['targets']} + modules = {p[:-5].replace('/', '.') for p in manifest['source_modules']} | {manifest['root_module']} + census = validate_census(log, targets, modules) + witness_lines = '\n'.join(m.group() for m in gate.AXIOM_LINE.finditer(log)) + witnesses = gate.audit_axioms(witness_lines, WITNESSES) + self_audit = out / 'SelfAudit.lean' + self_audit.write_text(audit_program(source, 'CBZNonvacuity')) + self_log = run([lake, 'env', 'lean', str(self_audit)], 'auditor-module-census', out, pkg, env, timeout) + auditor_census = validate_census(self_log, set(WITNESSES), {'CBZNonvacuity'}) + contract = out / 'WitnessTypeContract.lean' + contract.write_text(witness_contract_program('CBZNonvacuity')) + run([lake, 'env', 'lean', str(contract)], 'witness-type-contract', out, pkg, env, timeout) + run([lake, 'env', 'leanchecker', '-v', 'CBZNonvacuity'], 'witness-kernel', out, pkg, env, timeout) + run([lake, 'env', 'leanchecker', '-v', '--fresh', manifest['root_module']], 'fresh-kernel', out, pkg, env, timeout) + _, after, _ = gate.source_check(root) + require(after == digest and all(sha(p) == before[str(p.relative_to(root))] for p in inputs), 'source or audit inputs changed during execution') + receipt = dict(schema_version=1, scope='31 literal Main arithmetic statements only; no analytic/source parent closure', checked_commit=baseline['checked_commit'], manifest_sha256=digest, lean_version=baseline['lean_version'], baseline_receipt_sha256=sha(pkg / '.lake/formal-evidence/receipt.json'), audit_input_sha256=before, all_project_constants=census['constants'], audit_module_constants=auditor_census['constants'], proofs=census['proofs'], witness_axioms=witnesses, witness_type_contract=WITNESS_PROPOSITIONS, self_tests=controls, fresh_kernel='PASS', scientific_effect='NONE', source_alignment='NOT_INFERRED', logs={p.name: sha(p) for p in out.glob('*.log')}) + receipt_path.write_text(json.dumps(receipt, indent=2, sort_keys=True) + '\n') + return receipt + + +def main(argv=None): + parser = argparse.ArgumentParser(description=__doc__) + parser.add_argument('--root', type=Path, default=Path(__file__).resolve().parents[1]) + parser.add_argument('--timeout', type=int, default=600) + args = parser.parse_args(argv) + try: + require(args.timeout > 0, 'timeout must be positive') + receipt = execute(args.root.resolve(), args.timeout) + print(json.dumps(dict(status='PASS_LITERAL_MAIN_ARITHMETIC', proofs=len(receipt['proofs']), constants=len(receipt['all_project_constants']), receipt='formal/.lake/cbz-evidence/receipt.json'), sort_keys=True)) + return 0 + except (ValueError, KeyError, TypeError, OSError, subprocess.SubprocessError) as exc: + print('CBZ_LEAN_FAIL: ' + str(exc), file=sys.stderr) + return 1 + + +if __name__ == '__main__': + raise SystemExit(main()) diff --git a/tools/cbz_refs.py b/tools/cbz_refs.py new file mode 100644 index 000000000..fddf64e74 --- /dev/null +++ b/tools/cbz_refs.py @@ -0,0 +1,373 @@ +#!/usr/bin/env python3 +"""Exact-ref CBZ archives and guarded atomic branch pruning (stdlib + Git). + +Default commands emit JSON plans. Only --execute writes. Snapshot writes a NEW, +standalone bare repository; publish adds one archive tag; prune deletes eligible +heads in one atomic push with explicit expected-old leases. No source checkout, +index, worktree, trunk update, tag deletion, or hosting-setting mutation occurs. + +Caller must supply the complete protected/active branch inventory at snapshot +creation. Hosting protections remain enforced. No credentials are printed. +""" +from __future__ import annotations + +import argparse +from datetime import datetime, timezone +import hashlib +import json +import os +from pathlib import Path +import re +import shutil +import subprocess +import sys +import tempfile +from urllib.parse import urlsplit + +MANIFEST_PATH = '.cbz/refs-manifest.json' +OID = re.compile(r'^[0-9a-f]{40}(?:[0-9a-f]{24})?$') + + +class SafetyError(RuntimeError): + """A refusal or failed verification; never successful partial cleanup.""" + + +def _git(repo, *args, data=None, env=None, allowed=(0,)): + command = ['git'] + (['-C', str(repo)] if repo is not None else []) + list(args) + clean_env = os.environ.copy() + # Never inherit an index, alternate object database, or Git directory override. + for key in list(clean_env): + if key.startswith('GIT_') and key not in ('GIT_SSH_COMMAND', 'GIT_SSH', 'GIT_ASKPASS', 'GIT_TERMINAL_PROMPT'): + clean_env.pop(key) + clean_env.update({'GIT_TERMINAL_PROMPT': '0', 'GIT_NO_REPLACE_OBJECTS': '1'}) + if env: + clean_env.update(env) + p = subprocess.run(command, input=data, capture_output=True, env=clean_env) + if p.returncode not in allowed: + # Git errors can contain credential-bearing URLs. Do not forward stderr. + raise SafetyError(f'git {args[0]} failed (exit {p.returncode}); no success claimed') + return p.stdout + + +def _text(repo, *args, **kwargs): + return _git(repo, *args, **kwargs).decode('utf-8').strip() + + +def _canonical(value): + return (json.dumps(value, sort_keys=True, indent=2, ensure_ascii=True) + '\n').encode() + + +def _ref(ref): + if not isinstance(ref, str) or not ref.startswith(('refs/heads/', 'refs/tags/')): + raise SafetyError('unsupported ref namespace') + # Git check-ref-format rules, without a subprocess for each of thousands of refs. + if (any(ord(char) < 33 or ord(char) == 127 or char in '~^:?*[\\' for char in ref) + or '..' in ref or '@{' in ref or ref.endswith('.') + or any(not part or part.startswith('.') or part.endswith('.lock') for part in ref.split('/'))): + raise SafetyError('invalid Git ref name') + return ref + + +def _remote(remote): + if not isinstance(remote, str) or not remote or remote.startswith('-') or '\n' in remote: + raise SafetyError('invalid remote') + # URL credentials must never enter a manifest or diagnostic. SSH user names are allowed. + if '://' in remote: + parsed = urlsplit(remote) + if parsed.password or (parsed.username and parsed.scheme != 'ssh') or parsed.query or parsed.fragment: + raise SafetyError('credential-bearing remote URLs are not accepted') + return remote + + +def remote_state(remote): + """Read exact advertised heads/tags, annotated-tag peeled IDs, and HEAD target.""" + raw = _text(None, 'ls-remote', '--symref', _remote(remote)) + refs, peeled, default = {}, {}, None + for line in raw.splitlines(): + value, sep, name = line.partition('\t') + if not sep: + raise SafetyError('malformed remote advertisement') + if value.startswith('ref: '): + if name == 'HEAD': + default = value[5:] + continue + if not OID.fullmatch(value): + raise SafetyError('malformed remote object ID') + if name.startswith(('refs/heads/', 'refs/tags/')): + target = peeled if name.endswith('^{}') else refs + key = name[:-3] if name.endswith('^{}') else name + _ref(key) + if key in target: + raise SafetyError('duplicate advertised ref') + target[key] = value + if default is None or not default.startswith('refs/heads/') or default not in refs: + raise SafetyError('remote default branch is missing or detached') + return {'default_ref': default, 'refs': dict(sorted(refs.items())), 'peeled_tags': dict(sorted(peeled.items()))} + + +def _same(actual, expected, phase): + if actual != expected: + raise SafetyError(f'{phase}: remote refs/default/peeled tags changed or mismatch; refresh snapshot') + + +def _state(manifest): + return {key: manifest[key] for key in ('default_ref', 'refs', 'peeled_tags')} + + +def _local_refs(repo): + raw = _text(repo, 'for-each-ref', '--format=%(objectname) %(refname)', 'refs/heads', 'refs/tags') + return {ref: oid for oid, ref in (line.split(' ', 1) for line in raw.splitlines())} + + +def _tree(repo, manifest, manifest_bytes, temp): + default = manifest['refs'][manifest['default_ref']] + # Reserved namespace is absent in the default source tree, so its exact entries survive. + if _git(repo, 'ls-tree', default, '--', '.cbz'): + raise SafetyError('source tree already uses reserved .cbz path') + index = str(Path(temp) / 'archive-index') + env = {'GIT_INDEX_FILE': index} + _git(repo, 'read-tree', f'{default}^{{tree}}', env=env) + blob = _text(repo, 'hash-object', '-w', '--stdin', data=manifest_bytes) + _git(repo, 'update-index', '--add', '--cacheinfo', f'100644,{blob},{MANIFEST_PATH}', env=env) + return _text(repo, 'write-tree', env=env) + + +def snapshot(remote, output, archive_tag, *, execute=False, protected=(), active=()): + """Plan or create a new standalone archive, never modifying the source repo.""" + remote = _remote(remote) + tag_ref = _ref('refs/tags/' + archive_tag) + if not archive_tag.startswith('pre-cbz-'): + raise SafetyError('archive tag must start pre-cbz-') + state = remote_state(remote) + if tag_ref in state['refs']: + raise SafetyError('archive tag already exists remotely; choose a new name') + policies = [] + for names in (protected, active): + refs = sorted(set(names)) + for ref in refs: + if not ref.startswith('refs/heads/') or ref not in state['refs']: + raise SafetyError('policy must name an existing full branch ref') + _ref(ref) + policies.append(refs) + manifest = {'schema': 'cbz-refs-v1', 'remote': remote, 'archive_tag': archive_tag, + 'created_utc': datetime.now(timezone.utc).isoformat(), **state, + 'protected_refs': policies[0], 'active_refs': policies[1]} + result = {'mode': 'execute' if execute else 'dry-run', 'action': 'snapshot', 'manifest': manifest} + if not execute: + return result + output = Path(output).absolute() + if output.exists(): + raise SafetyError('snapshot output exists; refusing overwrite') + output.parent.mkdir(parents=True, exist_ok=True) + temp = Path(tempfile.mkdtemp(prefix='.cbz-snapshot-', dir=output.parent)) + try: + repo = temp / 'repository.git' + # Match the advertised object format; repositories with mixed IDs are invalid. + lengths = {len(oid) for oid in state['refs'].values()} + if len(lengths) != 1: + raise SafetyError('mixed object ID formats') + fmt = 'sha256' if lengths == {64} else 'sha1' + _git(None, 'init', '--bare', f'--object-format={fmt}', str(repo)) + _git(repo, 'fetch', '--no-tags', '--no-write-fetch-head', remote, + '+refs/heads/*:refs/heads/*', '+refs/tags/*:refs/tags/*') + _same(remote_state(remote), state, 'snapshot post-fetch') + if _local_refs(repo) != state['refs']: + raise SafetyError('fetched original refs do not match advertisement') + encoded = _canonical(manifest) + tree = _tree(repo, manifest, encoded, temp) + parents = sorted({oid for ref, oid in state['refs'].items() if ref.startswith('refs/heads/')}) + args = ['commit-tree', tree] + for parent in parents: + args.extend(['-p', parent]) + ident = {'GIT_AUTHOR_NAME': 'CBZ ref archive', 'GIT_AUTHOR_EMAIL': 'cbz@invalid', + 'GIT_COMMITTER_NAME': 'CBZ ref archive', 'GIT_COMMITTER_EMAIL': 'cbz@invalid'} + commit = _text(repo, *args, data=b'Pre-CBZ exact ref archive; all unique original branch tips are parents.\n', env=ident) + _git(repo, 'update-ref', tag_ref, commit, '0' * len(commit)) + # Archive custody has one named archive tag, not hundreds of dangling heads. + # Keep original tag refs too: annotated/tag-only objects need exact retention. + transaction = ['start'] + transaction.extend(f'delete {ref} {oid}' for ref, oid in state['refs'].items() + if ref.startswith('refs/heads/')) + transaction.extend(['prepare', 'commit']) + _git(repo, 'update-ref', '--stdin', data=('\n'.join(transaction) + '\n').encode()) + _git(repo, 'update-ref', '--no-deref', 'HEAD', commit) + (temp / 'manifest.json').write_bytes(encoded) + receipt = {'schema': 'cbz-refs-receipt-v1', 'archive_commit': commit, + 'archive_tree': tree, 'manifest_sha256': hashlib.sha256(encoded).hexdigest()} + (temp / 'receipt.json').write_bytes(_canonical(receipt)) + (temp / 'archive-index').unlink(missing_ok=True) + verify_snapshot(temp) + _same(remote_state(remote), state, 'snapshot final readback') + temp.rename(output) + except BaseException: + shutil.rmtree(temp, ignore_errors=True) + raise + return {**result, 'verified': True, 'archive_commit': commit, 'output': str(output)} + + +def verify_snapshot(output): + """Verify exact manifest bytes, expected tree/parents, tag and all original objects.""" + output = Path(output) + try: + encoded = (output / 'manifest.json').read_bytes() + manifest = json.loads(encoded) + receipt = json.loads((output / 'receipt.json').read_bytes()) + if manifest['schema'] != 'cbz-refs-v1' or encoded != _canonical(manifest): + raise SafetyError('manifest schema or canonical bytes mismatch') + if hashlib.sha256(encoded).hexdigest() != receipt['manifest_sha256']: + raise SafetyError('manifest hash mismatch') + tag_ref = _ref('refs/tags/' + manifest['archive_tag']) + if not manifest['archive_tag'].startswith('pre-cbz-') or tag_ref in manifest['refs']: + raise SafetyError('invalid archive tag') + for ref, oid in manifest['refs'].items(): + _ref(ref) + if not OID.fullmatch(oid): + raise SafetyError('invalid manifest object ID') + repo = output / 'repository.git' + if _text(repo, 'rev-parse', '--is-shallow-repository') != 'false': + raise SafetyError('shallow archive is not acceptable') + commit = _text(repo, 'rev-parse', '--verify', tag_ref) + if commit != receipt['archive_commit'] or _text(repo, 'cat-file', '-t', commit) != 'commit': + raise SafetyError('archive tag/commit mismatch') + expected_refs = {ref: oid for ref, oid in manifest['refs'].items() if ref.startswith('refs/tags/')} + expected_refs[tag_ref] = commit + if _local_refs(repo) != expected_refs: + raise SafetyError('archive original tag refs/archive tag membership mismatch or unexpected heads') + if (_text(repo, 'symbolic-ref', '-q', 'HEAD', allowed=(0, 1)) + or _text(repo, 'rev-parse', '--verify', 'HEAD') != commit): + raise SafetyError('archive HEAD must be detached at archive commit') + if _git(repo, 'show', f'{commit}:{MANIFEST_PATH}') != encoded: + raise SafetyError('embedded exact manifest mismatch') + tips = sorted({oid for ref, oid in manifest['refs'].items() if ref.startswith('refs/heads/')}) + actual_parents = _text(repo, 'show', '-s', '--format=%P', commit).split() + if actual_parents != tips: + raise SafetyError('archive parent membership mismatch') + with tempfile.TemporaryDirectory(prefix='cbz-verify-') as temp: + expected_tree = _tree(repo, manifest, encoded, temp) + actual_tree = _text(repo, 'show', '-s', '--format=%T', commit) + if actual_tree != expected_tree or receipt['archive_tree'] != actual_tree: + raise SafetyError('archive source tree/manifest membership mismatch') + # Batch object checks and one reachability walk keep thousand-tip archives bounded. + originals = sorted(set(manifest['refs'].values())) + checked = _text(repo, 'cat-file', '--batch-check=%(objectname) %(objecttype)', + data=('\n'.join(originals) + '\n').encode()).splitlines() + if len(checked) != len(originals): + raise SafetyError('original object membership mismatch') + for oid, row in zip(originals, checked): + parts = row.split() + if len(parts) != 2 or parts[0] != oid or parts[1] not in ('commit', 'tree', 'blob', 'tag'): + raise SafetyError('missing original ref object') + reachable = set(_text(repo, 'rev-list', commit).splitlines()) + if not set(tips).issubset(reachable): + raise SafetyError('original branch tip is not reachable from archive') + for ref, oid in manifest['peeled_tags'].items(): + original = manifest['refs'][ref] + if _text(repo, 'rev-parse', f'{original}^{{}}') != oid: + raise SafetyError('original tag peeled identity mismatch') + _git(repo, 'fsck', '--full', '--no-reflogs') + return {'verified': True, 'archive_commit': commit, 'manifest': manifest} + except (OSError, ValueError, KeyError, TypeError) as error: + raise SafetyError('invalid or incomplete snapshot metadata') from error + + +def _published_state(manifest, commit): + expected = _state(manifest) + return {**expected, 'refs': {**expected['refs'], 'refs/tags/' + manifest['archive_tag']: commit}} + + +def _remote_archive_readback(repo, remote, tag_ref, commit): + # Independent fresh fetch of the remote tag, not trust in a local receipt/tag. + with tempfile.TemporaryDirectory(prefix='cbz-readback-') as temp: + objfmt = _text(repo, 'rev-parse', '--show-object-format') + _git(None, 'init', '--bare', f'--object-format={objfmt}', temp) + _git(temp, 'fetch', '--no-tags', '--no-write-fetch-head', remote, f'{tag_ref}:refs/tags/readback') + if _text(temp, 'rev-parse', 'refs/tags/readback') != commit: + raise SafetyError('remote archive tag readback mismatch') + if _git(temp, 'cat-file', 'commit', commit) != _git(repo, 'cat-file', 'commit', commit): + raise SafetyError('remote archive commit bytes mismatch') + _git(temp, 'fsck', '--full', '--no-reflogs') + + +def publish(output, *, execute=False): + verified = verify_snapshot(output) + manifest, commit = verified['manifest'], verified['archive_commit'] + remote = _remote(manifest['remote']) + expected = _published_state(manifest, commit) + actual = remote_state(remote) + already = actual == expected + if not already: + _same(actual, _state(manifest), 'publish preflight') + result = {'action': 'publish', 'mode': 'execute' if execute else 'dry-run', + 'archive_tag': manifest['archive_tag'], 'archive_commit': commit, + 'already_published': already} + if not execute: + return result + repo = Path(output) / 'repository.git' + tag_ref = 'refs/tags/' + manifest['archive_tag'] + if not already: + _git(repo, 'push', '--atomic', f'--force-with-lease={tag_ref}:', remote, f'{commit}:{tag_ref}') + _same(remote_state(remote), expected, 'publish final readback') + _remote_archive_readback(repo, remote, tag_ref, commit) + return {**result, 'verified': True} + + +def prune(output, *, execute=False): + verified = verify_snapshot(output) + manifest, commit = verified['manifest'], verified['archive_commit'] + remote = _remote(manifest['remote']) + expected = _published_state(manifest, commit) + _same(remote_state(remote), expected, 'prune preflight (remote archive required)') + excluded = {manifest['default_ref'], *manifest['protected_refs'], *manifest['active_refs']} + delete_refs = sorted(ref for ref in manifest['refs'] if ref.startswith('refs/heads/') and ref not in excluded) + result = {'action': 'prune', 'mode': 'execute' if execute else 'dry-run', + 'delete_refs': delete_refs, 'expected_old_refs': {ref: manifest['refs'][ref] for ref in delete_refs}, + 'excluded_refs': sorted(excluded), 'archive_commit': commit} + if not execute: + return result + repo = Path(output) / 'repository.git' + _remote_archive_readback(repo, remote, 'refs/tags/' + manifest['archive_tag'], commit) + # Fresh full check immediately before CAS deletion; changed unrelated refs reject too. + _same(remote_state(remote), expected, 'prune immediate pre-push') + if delete_refs: + leases = [f'--force-with-lease={ref}:{manifest["refs"][ref]}' for ref in delete_refs] + _git(repo, 'push', '--atomic', *leases, remote, *(':' + ref for ref in delete_refs)) + final = {**expected, 'refs': {ref: oid for ref, oid in expected['refs'].items() if ref not in delete_refs}} + _same(remote_state(remote), final, 'prune final readback') + _remote_archive_readback(repo, remote, 'refs/tags/' + manifest['archive_tag'], commit) + return {**result, 'verified': True} + + +def main(argv=None): + parser = argparse.ArgumentParser(description=__doc__) + sub = parser.add_subparsers(dest='command', required=True) + snap = sub.add_parser('snapshot', help='read-only plan, or create a new standalone bare archive') + snap.add_argument('--remote', required=True) + snap.add_argument('--output', required=True) + snap.add_argument('--archive-tag', required=True) + snap.add_argument('--protected-ref', action='append', default=[]) + snap.add_argument('--active-ref', action='append', default=[]) + snap.add_argument('--execute', action='store_true') + for name in ('publish', 'prune', 'verify'): + command = sub.add_parser(name) + command.add_argument('--snapshot', required=True) + if name != 'verify': + command.add_argument('--execute', action='store_true') + args = parser.parse_args(argv) + try: + if args.command == 'snapshot': + result = snapshot(args.remote, args.output, args.archive_tag, execute=args.execute, + protected=args.protected_ref, active=args.active_ref) + elif args.command == 'verify': + result = verify_snapshot(args.snapshot) + else: + result = globals()[args.command](args.snapshot, execute=args.execute) + print(json.dumps(result, sort_keys=True, indent=2)) + return 0 + except SafetyError as error: + print(json.dumps({'ok': False, 'error': str(error), 'action': args.command, + 'note': 'No partial-success claim; inspect fresh remote refs after any failed execute.'}), file=sys.stderr) + return 1 + + +if __name__ == '__main__': + sys.exit(main()) diff --git a/tools/cbz_storage.py b/tools/cbz_storage.py new file mode 100644 index 000000000..782484962 --- /dev/null +++ b/tools/cbz_storage.py @@ -0,0 +1,249 @@ +#!/usr/bin/env python3 +"""CBZ storage tool registry: share exact immutable regular-file copies via hardlinks. + +Purpose: reclaim duplicate local immutable toolchain blocks without deleting paths. +Usage: plan --root ABS (repeat) --output plan.json; apply --plan plan.json +--sha256 PRINTED_SHA. Planning is the default safe/dry operation. Apply requires +an independently retained exact plan digest and refuses stale identities. Never +use on mutable files: shared inodes intentionally share all subsequent writes. +Files with any extended attributes, or unreadable xattr state, are refused. +Self verification: python -m unittest discover -s tests -p test_cbz_storage.py +Reports establish storage integrity only, never mathematical certification. +""" +import argparse +import hashlib +import json +import os +from pathlib import Path +import stat +import uuid + + +class Refusal(RuntimeError): + pass + + +def encoded(value): + return (json.dumps(value, sort_keys=True, separators=(',', ':')) + '\n').encode() + + +def digest(data): + return hashlib.sha256(data).hexdigest() + + +def safe_path(root, relative): + root = Path(root) + parts = Path(relative).parts + if Path(relative).is_absolute() or '..' in parts: + raise Refusal('path escape') + for item in [root, *root.parents]: + if item.is_symlink(): + raise Refusal('symlink ancestor') + path = root + for part in parts: + path = path / part + if path.is_symlink(): + raise Refusal('symlink path') + return path + + +def identity(s): + return [s.st_dev, s.st_ino, s.st_size, s.st_mode, s.st_uid, s.st_gid, + s.st_mtime_ns, s.st_ctime_ns] + + +def require_no_xattrs(fd): + try: + attributes = os.listxattr(fd) + except OSError as error: + raise Refusal('cannot establish absence of extended attributes') from error + if attributes: + raise Refusal('extended attributes unsupported; file sharing refused') + + +def file_record(path): + fd = os.open(path, os.O_RDONLY | os.O_NOFOLLOW) + try: + before = os.fstat(fd) + require_no_xattrs(fd) + if not stat.S_ISREG(before.st_mode): + raise Refusal('nonregular file') + h = hashlib.sha256() + while True: + chunk = os.read(fd, 1024 * 1024) + if not chunk: + break + h.update(chunk) + require_no_xattrs(fd) + after = os.fstat(fd) + if identity(before) != identity(after) or identity(after) != identity(os.lstat(path)): + raise Refusal('file changed while hashing') + return {'identity': identity(after), 'sha256': h.hexdigest(), + 'blocks': after.st_blocks} + finally: + os.close(fd) + + +ARCHIVE_SUFFIXES = ('.zip', '.tar', '.tar.gz', '.tgz', '.tar.zst', '.deb', '.xz') + + +def scan(roots, archives_only=False): + entries = [] + for root in roots: + safe_path(root, '.') + if not Path(root).is_dir(): + raise Refusal('missing root') + for current, dirs, files in os.walk(root, followlinks=False): + if archives_only: + dirs[:] = [d for d in dirs if d not in ('.git', '.lake') and 'cache' not in d.casefold()] + for name in sorted(dirs + files): + path = Path(current) / name + s = os.lstat(path) + if archives_only and (not stat.S_ISREG(s.st_mode) or s.st_size <= 1024 * 1024 + or not name.lower().endswith(ARCHIVE_SUFFIXES) + or any(p in ('.git', '.lake') or 'cache' in p.casefold() + for p in path.parts)): + continue + base = {'root': root, 'path': str(path.relative_to(root)), + 'mode': s.st_mode, 'uid': s.st_uid, 'gid': s.st_gid} + if stat.S_ISREG(s.st_mode): + base.update(file_record(path)) + base['kind'] = 'file' + elif stat.S_ISLNK(s.st_mode): + base.update(kind='symlink', target=os.readlink(path)) + elif stat.S_ISDIR(s.st_mode): + base['kind'] = 'directory' + else: + base['kind'] = 'other' + entries.append(base) + return sorted(entries, key=lambda x: (x['root'], x['path'])) + + +def make_plan(roots, archives_only=False): + roots = [str(Path(r).absolute()) for r in roots] + if len(set(roots)) != len(roots): + raise Refusal('duplicate roots') + for a in roots: + for b in roots: + if a != b and Path(a) in Path(b).parents: + raise Refusal('overlapping roots') + entries = scan(roots, archives_only) + groups = {} + operations = [] + for i, entry in enumerate(entries): + if entry['kind'] != 'file': + continue + ident = entry['identity'] + key = (ident[0], ident[2], ident[3], ident[4], ident[5], entry['sha256']) + if key not in groups: + groups[key] = i + elif entries[groups[key]]['identity'][:2] != ident[:2]: + operations.append([groups[key], i]) + result = {'version': 1, 'roots': roots, 'entries': entries, 'operations': operations} + if archives_only: + result['selection'] = 'archives-over-1MiB' + return result + + +def same_content(before, after): + keys = ('root', 'path', 'mode', 'uid', 'gid', 'kind', 'sha256', 'target') + return [{k: e[k] for k in keys if k in e} for e in before] == [ + {k: e[k] for k in keys if k in e} for e in after] + + +def check_entry(entry, allow_link_ctime=False): + path = safe_path(entry['root'], entry['path']) + actual = file_record(path) + expected = entry['identity'] + observed = actual['identity'] + # Creating/removing links changes ctime, so compare all other identity fields. + if ((observed[:-1] != expected[:-1] if allow_link_ctime else observed != expected) + or actual['sha256'] != entry['sha256']): + raise Refusal('stale file identity or content: ' + str(path)) + return path + + +def apply_plan(plan, before_replace=None): + if plan.get('version') != 1: + raise Refusal('unsupported plan') + # Re-derive operations and inventory before any mutation: no injected paths, + # forged pairs, changed files, added files, missing files, or mode drift. + archives_only = plan.get('selection') == 'archives-over-1MiB' + fresh = make_plan(plan['roots'], archives_only) + if fresh != plan: + raise Refusal('plan inputs changed') + free_before = os.statvfs(plan['roots'][0]).f_bavail * os.statvfs(plan['roots'][0]).f_frsize + applied = 0 + for source_i, target_i in plan['operations']: + source = plan['entries'][source_i] + target = plan['entries'][target_i] + src = check_entry(source, allow_link_ctime=True) + dst = check_entry(target, allow_link_ctime=True) + temporary = dst.parent / ('.cbz-hardlink-' + uuid.uuid4().hex) + try: + os.link(src, temporary, follow_symlinks=False) + if before_replace is not None: + before_replace(src, dst) + # Hash both fresh paths after creating link and before atomic replace. + check_entry(source, allow_link_ctime=True) + check_entry(target, allow_link_ctime=True) + if os.lstat(temporary).st_ino != os.lstat(src).st_ino: + raise Refusal('temporary link identity changed') + os.replace(temporary, dst) + applied += 1 + finally: + if temporary.exists() or temporary.is_symlink(): + temporary.unlink() + after = scan(plan['roots'], archives_only) + if not same_content(plan['entries'], after): + raise Refusal('post-apply inventory/content/modes mismatch') + for a, b in plan['operations']: + ea, eb = plan['entries'][a], plan['entries'][b] + if not os.path.samefile(safe_path(ea['root'], ea['path']), safe_path(eb['root'], eb['path'])): + raise Refusal('post-apply inode mismatch') + v = os.statvfs(plan['roots'][0]) + return {'applied': applied, 'content_paths_modes_verified': True, + 'free_before': free_before, 'free_after': v.f_bavail * v.f_frsize, + 'actual_df_bytes_freed': v.f_bavail * v.f_frsize - free_before} + + +def main(): + parser = argparse.ArgumentParser(description=__doc__) + sub = parser.add_subparsers(dest='command', required=True) + planning = sub.add_parser('plan') + planning.add_argument('--root', action='append', required=True) + planning.add_argument('--output', required=True) + planning.add_argument('--archives-only', action='store_true', + help='Only >1MiB immutable archive candidates; excludes .git/.lake and cache paths') + applying = sub.add_parser('apply') + applying.add_argument('--plan', required=True) + applying.add_argument('--sha256', required=True) + applying.add_argument('--report', required=True) + args = parser.parse_args() + if args.command == 'plan': + plan = make_plan(args.root, args.archives_only) + data = encoded(plan) + # Exclusive creation: never overwrite a previous attempted plan. + with open(args.output, 'xb') as output: + output.write(data) + output.flush() + os.fsync(output.fileno()) + print(json.dumps({'plan_sha256': digest(data), 'operations': len(plan['operations']), + 'estimated_duplicate_bytes': sum(plan['entries'][b]['identity'][2] for a,b in plan['operations'])})) + else: + data = Path(args.plan).read_bytes() + if digest(data) != args.sha256: + raise Refusal('plan SHA mismatch') + plan = json.loads(data) + if encoded(plan) != data: + raise Refusal('noncanonical plan') + report = apply_plan(plan) + report['plan_sha256'] = args.sha256 + with open(args.report, 'x') as output: + json.dump(report, output, indent=2) + output.write('\n') + print(json.dumps(report)) + + +if __name__ == '__main__': + main() From 0e47450ec27ccf1fecc175ea2bd3a7b74c485c92 Mon Sep 17 00:00:00 2001 From: Dylan Roy <8n96mrd5d4@privaterelay.appleid.com> Date: Thu, 29 Oct 2026 18:41:36 +0000 Subject: [PATCH 3/6] Preserve scoped CBZ proof boundaries and reproducible verification evidence --- .../ARCHIVAL_CONTROLS.json | 103 + .../ARTIFACT_SHA256.json | 3016 + .../BASELINE.proposed.md | 23 + .../CONTRIBUTION.json | 67 + .../DECISIONS.proposed.md | 16 + .../FINAL_METADATA_CHECK.json | 16 + .../FINAL_VERIFICATION.json | 36 + .../GOVERNANCE.proposed.md | 17 + .../INVENTORY.proposed.md | 13 + .../NEGATIVE_EVIDENCE_FINDINGS.json | 161 + .../NEGATIVE_EVIDENCE_QUARANTINE.json | 125 + .../PROOF_INDEX.proposed.md | 15 + .../STATUS.proposed.md | 46 + .../TOOLING.proposed.md | 39 + .../VERIFICATION.json | 30 + .../FULL_LEGACY_COPY_VERIFICATION.json | 2004 + .../archive/LEGACY_COPY_DISPOSITION.json | 11 + .../archive/STATUS.pre-cbz-20261029.json | 11 + .../archive/STATUS.pre-cbz-20261029.md | 61 + .../baseline-config.json | 161 + .../construction/generate.py | 189 + .../test_verify_proposal_guard.py | 20 + .../construction/verify_proposal.py | 99 + .../decisions.json | 48 + .../proof-index.json | 58645 ++++++++++++++++ .../source-manifest.json | 2876 + .../sources/MISSION.md | 75 + .../d2_atom_integral_20261006/Contract.lean | 64 + .../D2AtomIntegral.lean | 149 + .../D2MomentBridge.lean | 238 + .../d2_square_schur_20261006/Contract.lean | 22 + .../D2SquareSchur.lean | 77 + .../ClosedSuperlevel.lean | 197 + .../torus_filtration_20261011/OrdinaryH0.lean | 339 + .../OrdinaryH0Controls.lean | 453 + .../SuperlevelBar.lean | 299 + .../SuperlevelBarField.lean | 205 + .../TorusFiltration.lean | 6 + .../TorusTopology.lean | 247 + .../Math-/formal/ResearchFormalCoreR1.lean | 8 + .../ResearchFormalCoreR1/AlgebraV2.lean | 50 + .../formal/ResearchFormalCoreR1/D2Schur.lean | 169 + .../ResearchFormalCoreR1/MeasureBridge.lean | 145 + .../MomentGenerality.lean | 95 + .../ResearchFormalCoreR1/MomentTail.lean | 151 + .../ProbabilityCompanionsV2.lean | 88 + .../WeightPerturbation.lean | 141 + .../ResearchFormalCoreR1/WeightedLaw.lean | 127 + .../ElderBridge.lean | 83 + .../ElderBridgeAudit.lean | 9 + .../ElderClearance.lean | 129 + .../ElderClearanceAudit.lean | 12 + .../ElderClearanceControls.lean | 33 + .../ElderInterval.lean | 392 + .../ElderIntervalAxiomAudit.lean | 37 + .../ElderIntervalControls.lean | 79 + .../CapFirstExit.lean | 5473 ++ .../inputs/C291/SourceLifetimeField.lean | 92 + .../inputs/C291/SourceLifetimeGeometry.lean | 98 + .../inputs/C291/inputs/Lifetime.lean | 634 + .../torus_filtration_20261011/OrdinaryH0.lean | 339 + .../SuperlevelBar.lean | 299 + .../SuperlevelBarField.lean | 205 + .../TorusTopology.lean | 247 + .../ElderBridge.lean | 83 + .../ElderClearance.lean | 129 + .../ElderInterval.lean | 392 + .../Specifications/Field.lean | 380 + .../ResearchFormalCoreR1.lean | 13 + .../ResearchFormalCoreR1/AlgebraV2.lean | 53 + .../DeterminantMoment.lean | 218 + .../EndpointGaussianMoments.lean | 139 + .../EndpointNormalizerBridge.lean | 191 + .../GaussianCoupling.lean | 65 + .../GaussianJetMoments.lean | 124 + .../GaussianNormalizer.lean | 110 + .../GaussianNormalizerLimit.lean | 210 + .../GaussianRegressionKernel.lean | 270 + .../GaussianScalarMoments.lean | 99 + .../ResearchFormalCoreR1/NormalizerFloor.lean | 120 + .../ResearchFormalCoreR1/PalmReweighting.lean | 139 + .../ProbabilityCompanionsV2.lean | 93 + .../downstream_gate_20260925/GRAPH.json | 1041 + ...483d8a878afe5eaa72f1ea629f0ca5a29760f.lean | 133 + ...d0d7b7f271fdfc3db377cdb093f7e356f946d.lean | 135 + .../WithoutCoordinateIdentity.lean | 24 + .../WithoutRegularOrInterior.lean | 22 + .../project/Lifetime.lean | 634 + .../project/RegularPointChart.lean | 64 + .../project/RegularSuperlevel.lean | 140 + .../project/RegularSuperlevelAxiomAudit.lean | 62 + .../project/RegularSuperlevelLiteral.lean | 55 + .../ConfluentIntegralIdentities.lean | 204 + .../ContactJetCovariance.lean | 169 + .../GaussianRegressionLimits.lean | 159 + .../GaussianWeightedMajorants.lean | 386 + .../SourceConditionalMajorant.lean | 448 + .../SourceConfluentLimits.lean | 1127 + .../SourceConfluentPins.lean | 152 + .../SourceContactCovariance.lean | 180 + .../SourceContactEndpointParameters.lean | 325 + .../SourceContactSchur.lean | 206 + .../SourceDerivativeContinuity.lean | 99 + .../SourceDerivativeGaussian.lean | 188 + .../SourceEndpointEstimates.lean | 366 + .../SourceEndpointParameters.lean | 291 + .../SourceEndpointRegression.lean | 206 + .../SourcePhysicalEndpointKernel.lean | 131 + .../SourceSmoothConditionalKernel.lean | 720 + .../SourceSmoothPalm.lean | 329 + .../inputs/GaussianSeriesFoundation.lean | 96 + .../DeterminantMoment.lean | 218 + .../EndpointGaussianMoments.lean | 139 + .../EndpointNormalizerBridge.lean | 191 + .../GaussianCoupling.lean | 65 + .../GaussianJetMoments.lean | 124 + .../GaussianNormalizer.lean | 110 + .../GaussianNormalizerLimit.lean | 210 + .../GaussianRegressionKernel.lean | 270 + .../GaussianScalarMoments.lean | 99 + .../ResearchFormalCoreR1/NormalizerFloor.lean | 120 + .../ResearchFormalCoreR1/PalmReweighting.lean | 139 + .../inputs/SourceC4.lean | 141 + .../inputs/SourceCovariance.lean | 74 + .../inputs/SourceFourierSeries.lean | 147 + .../inputs/SourceGaussianLaw.lean | 189 + .../inputs/SourceKernel.lean | 112 + .../inputs/SourceLattice.lean | 159 + .../inputs/SourceSmooth.lean | 254 + .../inputs/SourceSmoothCarrier.lean | 230 + .../inputs/SourceTorus.lean | 111 + .../inputs/SourceTorusC4.lean | 134 + .../inputs/SpectralWeights.lean | 160 + .../SourceLifetimeAxiomAudit.lean | 81 + .../SourceLifetimeControls.lean | 124 + .../SourceLifetimeField.lean | 92 + .../SourceLifetimeGeometry.lean | 98 + .../SourceThetaBridge.lean | 266 + .../inputs/GaussianSeriesFoundation.lean | 96 + .../inputs/Lifetime.lean | 634 + .../inputs/SourceC4.lean | 141 + .../inputs/SourceCovariance.lean | 74 + .../inputs/SourceFourierSeries.lean | 147 + .../inputs/SourceGaussianLaw.lean | 189 + .../inputs/SourceKernel.lean | 112 + .../inputs/SourceLattice.lean | 159 + .../inputs/SourceSmooth.lean | 254 + .../inputs/SourceSmoothCarrier.lean | 230 + .../inputs/SourceSmoothControls.lean | 67 + .../inputs/SourceTorus.lean | 111 + .../inputs/SourceTorusC4.lean | 134 + .../inputs/SpectralWeights.lean | 160 + .../GaussianSeriesFoundation.lean | 96 + .../SourceC4.lean | 141 + .../SourceCovariance.lean | 74 + .../SourceFourierSeries.lean | 147 + .../SourceGaussianLaw.lean | 189 + .../SourceKernel.lean | 112 + .../SourceLattice.lean | 159 + .../SourceSmooth.lean | 254 + .../SourceSmoothAxiomAudit.lean | 68 + .../SourceSmoothCarrier.lean | 230 + .../SourceSmoothControls.lean | 67 + .../SourceTorus.lean | 111 + .../SourceTorusC4.lean | 134 + .../SpectralWeights.lean | 160 + .../W3Scratch/D2SchurLinks.lean | 390 + .../W3Scratch/Side24Law.lean | 274 + .../W3Scratch/Side24Poisson.lean | 342 + .../SpecificationProofs.lean | 14 + .../SpecificationProofs/P15Budget.lean | 469 + .../SpecificationProofs/P15Covers.lean | 285 + .../SpecificationProofs/P15Elementary.lean | 1015 + .../SpecificationProofs/P15Hazard.lean | 404 + .../SpecificationProofs/P15Interpolation.lean | 1183 + .../SpecificationProofs/P15Structure.lean | 1278 + .../SpecificationProofs/RNCluster.lean | 335 + .../SpecificationProofs/RNProbability.lean | 363 + .../SpecificationProofs/Side24Analysis.lean | 1639 + .../SpecificationProofs/Side24ConeMoment.lean | 485 + .../SpecificationProofs/Side24Covariance.lean | 282 + .../SpecificationProofs/Side24Elementary.lean | 212 + .../SpecificationProofs/Side24Images.lean | 862 + .../SpecificationProofs/Side24Interfaces.lean | 632 + .../Specifications.lean | 5 + .../Specifications/Field.lean | 380 + .../Specifications/Lifetime.lean | 634 + .../Specifications/P15.lean | 1161 + .../Specifications/RN.lean | 1009 + .../Specifications/Side24.lean | 1014 + ..._FIELD_WITNESS_PRESENT_BUT_NOT_PARENT.lean | 92 + .../MAIN_ARITHMETIC_PARENT_BOUNDARY.lean | 42 + ...W_ENDPOINT_AND_WHOLE_CARRIER_PROGRESS.lean | 329 + .../alignment/PAIR_LAW_SOURCE_BINDING.lean | 634 + .../REGULAR_LEVEL_GEOMETRY_BOUNDARY.lean | 55 + .../alignment/RN_REGRESSION_PALM_BINDING.lean | 1009 + .../alignment/SIDE24_EXACT_ENCLOSURE.lean | 1014 + .../sources/final-6fc/coverage-boundary.json | 1844 + .../R3-observed-run/baseline-receipt.json | 77 + .../logs/all-declarations-and-witnesses.log | 50 + .../logs/auditor-module-census.log | 5 + .../logs/false_premise-audit.log | 6 + .../logs/false_premise-compile.log | 0 .../R3-observed-run/logs/fresh-kernel.log | 1 + .../R3-observed-run/logs/honest-audit.log | 6 + .../R3-observed-run/logs/honest-compile.log | 0 .../R3-observed-run/logs/missing-module.log | 5 + .../R3-observed-run/logs/native-audit.log | 5 + .../R3-observed-run/logs/native-compile.log | 0 .../R3-observed-run/logs/sorry-audit.log | 5 + .../R3-observed-run/logs/sorry-compile.log | 1 + .../logs/unused_axiom-audit.log | 6 + .../logs/unused_axiom-compile.log | 0 .../logs/weakened-witness-audit.log | 5 + .../logs/weakened-witness-compile.log | 0 .../logs/weakened-witness-contract.log | 27 + .../R3-observed-run/logs/witness-kernel.log | 1 + .../logs/witness-type-contract.log | 0 .../R3-observed-run/receipt.json | 748 + .../R3-observed-run/tools/CBZNonvacuity.lean | 57 + .../R3-observed-run/tools/cbz_lean_check.py | 245 + .../tools/formal_gate_check.py | 403 + .../R3-receipt-observation.json | 52 + .../final-6fc/engineering-review/REVIEW.md | 99 + .../engineering-review/REVIEW.pending-R3.md | 89 + .../engineering-review/REVIEWED_SOURCE.json | 37 + .../REVIEWED_SUCCESSOR_SOURCE.json | 37 + .../live-receipt-observation.json | 13 + .../private-axiom-probe.json | 16 + .../engineering-review/probe_private_axiom.py | 17 + .../engineering-review/probe_safety.py | 29 + .../probe_safety_successor.py | 24 + .../probe_witness_contract.py | 18 + .../probe_witness_successor.py | 20 + .../safety-probe-report.json | 38 + .../safety-successor-report.json | 14 + .../witness-contract-probe.json | 14 + .../witness-successor-probe.json | 27 + .../sources/final-6fc/kernel-run-result.json | 15 + .../sources/final-6fc/kernel/MANIFEST.json | 382 + .../cbz-evidence/AuditWeakenedWitness.lean | 40 + .../cbz-evidence/Audit_false_premise.lean | 57 + .../kernel/cbz-evidence/Audit_honest.lean | 57 + .../kernel/cbz-evidence/Audit_native.lean | 57 + .../kernel/cbz-evidence/Audit_sorry.lean | 57 + .../cbz-evidence/Audit_unused_axiom.lean | 57 + .../CBZControl_false_premise.lean | 2 + .../cbz-evidence/CBZControl_honest.lean | 2 + .../cbz-evidence/CBZControl_native.lean | 2 + .../kernel/cbz-evidence/CBZControl_sorry.lean | 2 + .../cbz-evidence/CBZControl_unused_axiom.lean | 3 + .../kernel/cbz-evidence/CBZNonvacuity.lean | 57 + .../cbz-evidence/CBZWeakenedWitness.lean | 7 + .../kernel/cbz-evidence/MissingModule.lean | 57 + .../kernel/cbz-evidence/SelfAudit.lean | 40 + .../cbz-evidence/WeakenedWitnessContract.lean | 5 + .../cbz-evidence/WitnessTypeContract.lean | 5 + .../all-declarations-and-witnesses.log | 50 + .../cbz-evidence/auditor-module-census.log | 5 + .../cbz-evidence/false_premise-audit.log | 6 + .../cbz-evidence/false_premise-compile.log | 0 .../kernel/cbz-evidence/fresh-kernel.log | 1 + .../kernel/cbz-evidence/honest-audit.log | 6 + .../kernel/cbz-evidence/honest-compile.log | 0 .../kernel/cbz-evidence/missing-module.log | 5 + .../kernel/cbz-evidence/native-audit.log | 5 + .../kernel/cbz-evidence/native-compile.log | 0 .../kernel/cbz-evidence/receipt.json | 748 + .../kernel/cbz-evidence/sorry-audit.log | 5 + .../kernel/cbz-evidence/sorry-compile.log | 1 + .../cbz-evidence/unused_axiom-audit.log | 6 + .../cbz-evidence/unused_axiom-compile.log | 0 .../cbz-evidence/weakened-witness-audit.log | 5 + .../cbz-evidence/weakened-witness-compile.log | 0 .../weakened-witness-contract.log | 27 + .../kernel/cbz-evidence/witness-kernel.log | 1 + .../cbz-evidence/witness-type-contract.log | 0 .../kernel/formal-evidence/Audit.lean | 32 + .../kernel/formal-evidence/Types.lean | 33 + .../kernel/formal-evidence/axioms.log | 31 + .../kernel/formal-evidence/build.log | 5 + .../formal-evidence/custom_imported.lean | 5 + .../formal-evidence/custom_imported.log | 1 + .../formal-evidence/elaborated-types.log | 389 + .../false_covariance_bound.lean | 142 + .../false_covariance_bound.log | 3 + .../false_eigenvalue_third.lean | 142 + .../false_eigenvalue_third.log | 3 + .../false_endpoint_adjacency.lean | 42 + .../false_endpoint_adjacency.log | 3 + .../false_exp_partial_sum.lean | 142 + .../formal-evidence/false_exp_partial_sum.log | 3 + .../false_exponent_bound_d3.lean | 142 + .../false_exponent_bound_d3.log | 3 + .../formal-evidence/false_trace_variance.lean | 85 + .../formal-evidence/false_trace_variance.log | 3 + .../kernel/formal-evidence/leanchecker.log | 0 .../kernel/formal-evidence/native.lean | 3 + .../kernel/formal-evidence/native.log | 1 + .../formal-evidence/preflight-version.log | 1 + .../kernel/formal-evidence/receipt.json | 77 + .../kernel/formal-evidence/sorry.lean | 3 + .../kernel/formal-evidence/sorry.log | 2 + .../kernel/formal-evidence/version.log | 1 + .../formal-evidence/wrong_image_constant.lean | 142 + .../formal-evidence/wrong_image_constant.log | 3 + .../kernel/inputs/formal/UniversalLaw.lean | 13 + .../UniversalLaw/Side24/ConeMoments.lean | 85 + .../formal/UniversalLaw/Side24/Endpoints.lean | 42 + .../formal/UniversalLaw/Side24/Ledger.lean | 142 + .../kernel/inputs/formal/lean-toolchain | 1 + .../kernel/inputs/formal/manifest.json | 365 + .../kernel/inputs/tools/CBZNonvacuity.lean | 57 + .../kernel/inputs/tools/cbz_lean_check.py | 245 + .../kernel/inputs/tools/formal_gate_check.py | 403 + .../graph-composition-optimized.stderr | 6 + .../graph-composition-optimized.stdout | 0 .../regression/graph-composition.stderr | 6 + .../regression/graph-composition.stdout | 0 .../regression/museum-input-receipt.json | 243 + .../final-6fc/regression/museum-inputs.json | 1 + .../final-6fc/regression/node-result.json | 59 + .../sources/final-6fc/regression/node.stderr | 0 .../sources/final-6fc/regression/node.stdout | 772 + .../pytest-bytecode-optimized.stderr | 15 + .../pytest-bytecode-optimized.stdout | 0 .../regression/pytest-bytecode.stderr | 15 + .../regression/pytest-bytecode.stdout | 0 .../regression/pytest-install.stderr | 0 .../regression/pytest-install.stdout | 12 + .../regression/python-interruption.json | 6 + .../final-6fc/regression/python-skips.json | 30 + .../final-6fc/regression/python-start.json | 265 + .../final-6fc/regression/python.stderr | 311 + .../final-6fc/regression/python.stdout | 0 .../python-result.json | 18 + .../python-start.json | 265 + .../retry-after-restart-1804/python.stderr | 1697 + .../retry-after-restart-1804/python.stdout | 6 + .../regression/sandbox-image-pull.stderr | 0 .../regression/sandbox-image-pull.stdout | 21 + .../regression/sandbox-readable-result.json | 49 + .../regression/sandbox-readable-source.json | 8 + .../regression/sandbox-readable.stderr | 17 + .../regression/sandbox-readable.stdout | 0 .../final-6fc/regression/sandbox-result.json | 49 + .../regression/sandbox-source-diagnostic.json | 42 + .../regression/sandbox-staged-result.json | 51 + .../regression/sandbox-staged.stderr | 10 + .../regression/sandbox-staged.stdout | 0 .../final-6fc/regression/sandbox.stderr | 17 + .../final-6fc/regression/sandbox.stdout | 0 .../regression/shop-input-receipt.json | 26 + .../lean-foundation/MAIN_PROOF_INDEX.json | 577 + .../QUARANTINE_BOUNDARIES.json | 19102 +++++ .../sources/lean-foundation/REPORT.txt | 145 + .../sources/lean-foundation/RESULT.json | 39 + .../MANIFEST.json | 396 + .../MANIFEST.sha256 | 1 + .../cbz-gate/AuditWeakenedWitness.lean | 40 + .../cbz-gate/Audit_false_premise.lean | 57 + .../cbz-gate/Audit_honest.lean | 57 + .../cbz-gate/Audit_native.lean | 57 + .../cbz-gate/Audit_sorry.lean | 57 + .../cbz-gate/Audit_unused_axiom.lean | 57 + .../cbz-gate/CBZControl_false_premise.lean | 2 + .../cbz-gate/CBZControl_honest.lean | 2 + .../cbz-gate/CBZControl_native.lean | 2 + .../cbz-gate/CBZControl_sorry.lean | 2 + .../cbz-gate/CBZControl_unused_axiom.lean | 3 + .../cbz-gate/CBZNonvacuity.lean | 57 + .../cbz-gate/CBZWeakenedWitness.lean | 7 + .../cbz-gate/MissingModule.lean | 57 + .../cbz-gate/SelfAudit.lean | 40 + .../cbz-gate/WeakenedWitnessContract.lean | 5 + .../cbz-gate/WitnessTypeContract.lean | 5 + .../all-declarations-and-witnesses.log | 50 + .../cbz-gate/auditor-module-census.log | 5 + .../cbz-gate/false_premise-audit.log | 6 + .../cbz-gate/false_premise-compile.log | 0 .../cbz-gate/fresh-kernel.log | 1 + .../cbz-gate/honest-audit.log | 6 + .../cbz-gate/honest-compile.log | 0 .../cbz-gate/missing-module.log | 5 + .../cbz-gate/native-audit.log | 5 + .../cbz-gate/native-compile.log | 0 .../cbz-gate/receipt.json | 748 + .../cbz-gate/sorry-audit.log | 5 + .../cbz-gate/sorry-compile.log | 1 + .../cbz-gate/unused_axiom-audit.log | 6 + .../cbz-gate/unused_axiom-compile.log | 0 .../cbz-gate/weakened-witness-audit.log | 5 + .../cbz-gate/weakened-witness-compile.log | 0 .../cbz-gate/weakened-witness-contract.log | 27 + .../cbz-gate/witness-kernel.log | 1 + .../cbz-gate/witness-type-contract.log | 0 .../formal-gate/Audit.lean | 32 + .../formal-gate/Types.lean | 33 + .../formal-gate/axioms.log | 31 + .../formal-gate/build.log | 5 + .../formal-gate/custom_imported.lean | 5 + .../formal-gate/custom_imported.log | 1 + .../formal-gate/elaborated-types.log | 389 + .../formal-gate/false_covariance_bound.lean | 142 + .../formal-gate/false_covariance_bound.log | 3 + .../formal-gate/false_eigenvalue_third.lean | 142 + .../formal-gate/false_eigenvalue_third.log | 3 + .../formal-gate/false_endpoint_adjacency.lean | 42 + .../formal-gate/false_endpoint_adjacency.log | 3 + .../formal-gate/false_exp_partial_sum.lean | 142 + .../formal-gate/false_exp_partial_sum.log | 3 + .../formal-gate/false_exponent_bound_d3.lean | 142 + .../formal-gate/false_exponent_bound_d3.log | 3 + .../formal-gate/false_trace_variance.lean | 85 + .../formal-gate/false_trace_variance.log | 3 + .../formal-gate/leanchecker.log | 0 .../formal-gate/native.lean | 3 + .../formal-gate/native.log | 1 + .../formal-gate/preflight-version.log | 1 + .../formal-gate/receipt.json | 77 + .../formal-gate/sorry.lean | 3 + .../formal-gate/sorry.log | 2 + .../formal-gate/version.log | 1 + .../formal-gate/wrong_image_constant.lean | 142 + .../formal-gate/wrong_image_constant.log | 3 + .../main-latest-17-source-preservation.json | 91 + .../r3-full-main-run.exit | 1 + .../r3-full-main-run.log | 17 + .../r3-reviewer-original-probe-rejection.log | 9 + .../r3-tests-green.log | 24 + .../r3-tests-optimized.log | 24 + .../source/formal/ALIGNMENT.md | 41 + .../source/formal/GLOSSARY.md | 91 + .../source/formal/README.md | 144 + .../source/formal/REVIEW_LANE.md | 94 + .../source/formal/SCOPE.md | 65 + .../source/formal/UniversalLaw.lean | 13 + .../UniversalLaw/Side24/ConeMoments.lean | 85 + .../formal/UniversalLaw/Side24/Endpoints.lean | 42 + .../formal/UniversalLaw/Side24/Ledger.lean | 142 + .../source/formal/lake-manifest.json | 6 + .../source/formal/lakefile.toml | 11 + .../source/formal/lean-toolchain | 1 + .../source/formal/manifest.json | 365 + .../source/formal/reviews/README.md | 16 + .../reviews/TEMPLATE_alignment_review.json | 27 + .../formal/sources/side24_v1/ENCLOSURE.json | 29 + .../source/formal/sources/side24_v1/PROOF.md | 216 + .../source/tests/test_cbz_lean_check.py | 138 + .../source/tools/CBZNonvacuity.lean | 57 + .../source/tools/cbz_lean_check.py | 245 + .../source/tools/formal_gate_check.py | 403 + ...oolchain-runtime-archive-verification.json | 31 + .../STATEMENT_ALIGNMENT_GAPS.json | 95 + .../lean-foundation/TOOL_REGISTRY.json | 144 + .../main-git-source-bindings.json | 73 + ...-tests-with-pinned-toolchain-optimized.log | 55 + .../main-tests-with-pinned-toolchain.log | 55 + .../math-resource-boundary.json | 11 + .../portable-main-receipt.json | 737 + .../portable-tests-green-final.log | 19 + .../portable-tests-optimized-final.log | 19 + .../sources/legacy-v20/COPY_MANIFEST.json | 443 + .../engine/DEMO_D1_EVENT_TRACE.json | 20 + .../legacy-v20/engine/ENVIRONMENT_V17.json | 41 + .../engine/LOCAL_EVIDENCE_NOTES_INDEX.json | 94 + .../engine/SOURCE_REFERENCE_INDEX.json | 1323 + .../legacy-v20/engine/certificate_schema.json | 84 + .../sources/legacy-v20/engine/dataset.json | 7569 ++ .../engine/external_theorem_sources.json | 34 + .../engine/frozen_v14_proof_hypergraph.json | 6700 ++ .../COVERAGE_REPORT.md | 7 + .../LINEAGE_IMPACT_v11_to_v12.md | 20 + .../NEXT_VERIFICATION_TARGETS.md | 7 + .../SOURCING_LEDGER_v11.md | 15 + .../SOURCING_LEDGER_v12.md | 29 + .../VERIFICATION_REPORT.md | 27 + .../acceptance_evidence_ledger.json | 877 + .../independent_verification_ledger.json | 580 + .../engine/import_applicability.json | 343 + .../engine/local_exact_receipt.json | 21 + .../sources/legacy-v20/engine/manifest.json | 277 + .../legacy-v20/engine/runtime_schema.json | 82 + .../sources/legacy-v20/engine/schema.json | 103 + .../legacy-v20/engine/source_provenance.json | 2138 + .../engine/source_statement_comparisons.json | 1511 + ...eac23f3cf494e0c1b3bf4476e4e6666de46574.raw | 60 + ...3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d.raw | 215 + ...aa0e2ecd020485eb0f6e919679841b5b2636fc.raw | 230 + ...fb6c901f5c7c72fc70f73e81de3dde50c23432.raw | 163 + ...8d8a701729c9c61ea24f73f7e20a9cf10c552b.raw | 230 + ...f1aeba48bb14fffd4193864b3f482185bc1698.raw | 291 + ...977d8e707e2079e216fba4fee3669cebec127d.raw | 188 + ...d05952c6ab8e0a384f33725b50de847aeec1eb.raw | 618 + ...af9560d3f1b1ce22fd5538927db0c52f4f3a4a.raw | 267 + ...eb3769813a6f8099a7780200ef048049637c82.raw | 120 + ...8f0dcd64aedd45099e8394cbe9db99866ec531.raw | 804 + ...91b6693e3f233808b89df10cce1b57036b65da.raw | 309 + ...1a7e89b6cba7b285fcbf550fd8dd1d9c30f3e1.raw | 119 + ...918cdf72e36386a757615f9e37a5a5c743a03f.pdf | Bin 0 -> 326691 bytes ...918cdf72e36386a757615f9e37a5a5c743a03f.txt | 1375 + ...484b118fe9c8d79f1036ac6c70045180e2a744.raw | 119 + ...3772ab22413a1d81194d5a6a78adf6ada5f03f.raw | 158 + ...70ac6029fb54e0ef906001efe48fe908549b80.raw | 601 + ...583559ad8f96b3a318293df1c2db8193302706.raw | 52 + ...a3e82d80fbd6b148d074f11e1015e826813268.raw | 240 + ...c5b993c0a874906cf6ea25e8c890afed8cdc53.raw | 123 + ...310c7bd69c0ac5735996d7854642e4d698a99d.raw | 21 + ...fc65ac9ad4c7d8304b028b88764356fd3825b6.raw | 56 + ...5a2e7206a3d2de3d876f35f75ff6e2dc13e62f.raw | 147 + ...eb1cd0326affbd6f5967b53c4178590da993f9.raw | 153 + ...839ae45d8006d1891ff3e700fa521cc96f6cb4.raw | 159 + ...16bc055355c9d075349ed8ac9b3dd72fd4859f.raw | 81 + ...a8cd09d6f3229740525d74ec7d06d8d1470717.raw | 45 + ...9e2ff816e5cdf1c8318e85fb27499141c84bc7.raw | 494 + ...409cc3d94eb610a0c7b74ba5ba2d01a1620cb7.raw | 217 + ...678367497e8dc2cf43eef197a4d6592c2f129b.raw | 721 + ...9a74156d976bbdc19b6711d0c5b1a1da9e5669.raw | 480 + ...dc698970febc1ea8bcbc0b24555e69e2a66392.raw | 402 + ...e39a4fe12d52fe2c9669e249dddfa30ea3144f.raw | 70 + ...003888ef138b445d3289ec5588f116af9050c2.raw | 328 + ...1b6807921e19a9d556ed793ad1a0db6e202028.raw | 44 + ...76a7d599934fc3b91bd753ee5d492262917769.raw | 216 + ...074456f39a9697f3104afd1f728e4732179bb9.raw | 140 + ...5b4d480e736b737c8c39a474d1735185793733.raw | 370 + ...c41d7ddcbfcc5ed251c31b309e9c3532fd7d75.raw | 61 + ...e15ef3ac564b3d7453d41647f91af540a1b8eb.raw | 145 + ...385131ac5336c51ba983e00e4d540fe2f00aaa.raw | 637 + ...a2aa9f611ae7a1ecf1c74f2d430d6490336445.raw | 85 + ...06cc39c725470b710af10728867ec10c8ca985.raw | 150 + ...1ff21e54840cd1e20dc4e41ea9ad52228beb05.raw | 245 + ...d208c1300c6e93a1c3c8a7c3b255860442551b.raw | 59 + ...510e05fc39e15238d5e4f656e5000644293f58.raw | 36 + ...fbb99f258a2dc2a959ae231ae80cb4baa61e1e.raw | 82 + ...11eb5b406758f3c5ff09a222d02ba54bd0752c.raw | 452 + .../engine/verification_report.json | 144 + .../sources/math-source-manifest.json | 816 + .../sources/prior-decisions.jsonl | 20 + .../sources/tooling/auditor/G0.json | 92 + .../sources/tooling/auditor/G1-main.json | 28391 ++++++++ .../sources/tooling/auditor/REPORT.md | 58 + .../tooling/auditor/TOOL_REGISTRY_ENTRY.json | 56 + .../auditor/coverage/COVERAGE_REPORT.md | 37 + .../COVERAGE_TOOL_REGISTRY_ENTRY.json | 56 + .../tooling/auditor/coverage/G1-main.json | 28391 ++++++++ .../coverage/coverage-archive-quarantine.json | 622 + .../auditor/coverage/coverage-boundary.json | 1816 + .../auditor/coverage/coverage-containers.json | 37413 ++++++++++ .../coverage/coverage-dispositions.json | 5426 ++ ...ge-selftest-missing-total-budget-test.json | 76 + .../coverage-selftest-proposal-replay.json | 76 + .../auditor/coverage/coverage-selftest.json | 76 + .../auditor/coverage/coverage_boundary.py | 56 + .../auditor/coverage/coverage_companion.py | 211 + .../auditor/coverage/coverage_selftest.py | 27 + .../coverage/test_coverage_companion.py | 81 + .../auditor/selftest-negative-controls.json | 77 + .../baseline-tool/actual-cold-start.json | 8 + .../tooling/baseline-tool/actual-inspect.json | 90 + .../proposal-final-cold-start.json | 8 + .../baseline-tool/proposal-final-inspect.json | 90 + .../current-tool-selftests-optimized.log | 119 + .../tooling/current-tool-selftests.log | 119 + .../tooling/metadata-identity/normal.json | 1 + .../tooling/metadata-identity/optimized.json | 1 + .../source-mutation-normal.json | 22 + .../source-mutation-optimized.json | 22 + .../cli-controls.json | 22 + .../mutation-closed_quarantine.log | 14 + .../mutation-custom_axiom.log | 14 + .../mutation-doc_truth.log | 18 + .../mutation-live_hash.log | 17 + .../mutation-receipt_binding.log | 17 + .../mutation-receipt_logs.log | 17 + .../mutation-unlisted_tool.log | 14 + .../mutations.json | 51 + .../positive.json | 7 + .../positive.log | 23 + .../report.json | 90 + .../cli-controls.json | 22 + .../mutation-archive_readback.log | 17 + .../mutation-atomic_push.log | 22 + .../mutation-default_exclusion.log | 15 + .../mutation-expected_old_leases.log | 15 + .../mutation-full_state_guard.log | 15 + .../mutation-manifest_hash_guard.log | 15 + .../mutation-original_tag_ref_guard.log | 15 + .../mutations.json | 51 + .../positive.json | 7 + .../positive.log | 31 + .../report.json | 101 + .../scale.json | 11 + .../sources/tooling/ref-tool/REPORT.txt | 122 + .../sources/tooling/ref-tool/mutations.json | 44 + .../sources/tooling/ref-tool/registry.json | 23 + .../sources/tooling/ref-tool/scale.json | 11 + .../tooling/ref-tool/test-optimized.log | 27 + .../sources/tooling/ref-tool/test.log | 27 + .../sources/tooling/storage/REPORT.txt | 11 + .../tooling/storage/TOOL_REGISTRY_ENTRY.json | 81 + .../tool-registry.json | 712 + .../verification/baseline_controls.py | 141 + .../verification/ref_controls.py | 205 + 603 files changed, 297233 insertions(+) create mode 100644 cbz/evidence/website-foundation-20261029/ARCHIVAL_CONTROLS.json create mode 100644 cbz/evidence/website-foundation-20261029/ARTIFACT_SHA256.json create mode 100644 cbz/evidence/website-foundation-20261029/BASELINE.proposed.md create mode 100644 cbz/evidence/website-foundation-20261029/CONTRIBUTION.json create mode 100644 cbz/evidence/website-foundation-20261029/DECISIONS.proposed.md create mode 100644 cbz/evidence/website-foundation-20261029/FINAL_METADATA_CHECK.json create mode 100644 cbz/evidence/website-foundation-20261029/FINAL_VERIFICATION.json create mode 100644 cbz/evidence/website-foundation-20261029/GOVERNANCE.proposed.md create mode 100644 cbz/evidence/website-foundation-20261029/INVENTORY.proposed.md create mode 100644 cbz/evidence/website-foundation-20261029/NEGATIVE_EVIDENCE_FINDINGS.json create mode 100644 cbz/evidence/website-foundation-20261029/NEGATIVE_EVIDENCE_QUARANTINE.json create mode 100644 cbz/evidence/website-foundation-20261029/PROOF_INDEX.proposed.md create mode 100644 cbz/evidence/website-foundation-20261029/STATUS.proposed.md create mode 100644 cbz/evidence/website-foundation-20261029/TOOLING.proposed.md create mode 100644 cbz/evidence/website-foundation-20261029/VERIFICATION.json create mode 100644 cbz/evidence/website-foundation-20261029/archive/FULL_LEGACY_COPY_VERIFICATION.json create mode 100644 cbz/evidence/website-foundation-20261029/archive/LEGACY_COPY_DISPOSITION.json create mode 100644 cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.json create mode 100644 cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.md create mode 100644 cbz/evidence/website-foundation-20261029/baseline-config.json create mode 100644 cbz/evidence/website-foundation-20261029/construction/generate.py create mode 100644 cbz/evidence/website-foundation-20261029/construction/test_verify_proposal_guard.py create mode 100644 cbz/evidence/website-foundation-20261029/construction/verify_proposal.py create mode 100644 cbz/evidence/website-foundation-20261029/decisions.json create mode 100644 cbz/evidence/website-foundation-20261029/proof-index.json create mode 100644 cbz/evidence/website-foundation-20261029/source-manifest.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/MISSION.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_atom_integral_20261006/Contract.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_atom_integral_20261006/D2AtomIntegral.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_moment_bridge_20261006/D2MomentBridge.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/Contract.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/D2SquareSchur.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/ClosedSuperlevel.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0Controls.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusFiltration.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusTopology.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/AlgebraV2.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/D2Schur.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MeasureBridge.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentGenerality.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentTail.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightPerturbation.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightedLaw.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridgeAudit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceAudit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceControls.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalAxiomAudit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalControls.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeField.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeGeometry.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/inputs/Lifetime.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/TorusTopology.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/specifications/lean_statements_20261010/Specifications/Field.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/AlgebraV2.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/DeterminantMoment.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointGaussianMoments.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointNormalizerBridge.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianCoupling.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianJetMoments.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizer.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizerLimit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianRegressionKernel.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianScalarMoments.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/NormalizerFloor.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/PalmReweighting.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutCoordinateIdentity.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutRegularOrInterior.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/Lifetime.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularPointChart.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevel.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelAxiomAudit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelLiteral.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ConfluentIntegralIdentities.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ContactJetCovariance.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianRegressionLimits.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianWeightedMajorants.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConditionalMajorant.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentLimits.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentPins.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactCovariance.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactEndpointParameters.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactSchur.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeContinuity.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeGaussian.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointEstimates.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointParameters.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointRegression.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourcePhysicalEndpointKernel.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothConditionalKernel.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothPalm.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/GaussianSeriesFoundation.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/DeterminantMoment.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointGaussianMoments.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointNormalizerBridge.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianCoupling.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianJetMoments.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizer.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizerLimit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianRegressionKernel.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianScalarMoments.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/NormalizerFloor.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/PalmReweighting.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceC4.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceCovariance.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceFourierSeries.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceGaussianLaw.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceKernel.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceLattice.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmooth.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmoothCarrier.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorus.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorusC4.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SpectralWeights.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeAxiomAudit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeControls.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeField.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeGeometry.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceThetaBridge.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/GaussianSeriesFoundation.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/Lifetime.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceC4.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceCovariance.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceFourierSeries.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceGaussianLaw.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceKernel.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceLattice.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmooth.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothCarrier.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothControls.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorus.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorusC4.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SpectralWeights.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/GaussianSeriesFoundation.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceC4.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceCovariance.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceFourierSeries.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceGaussianLaw.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceKernel.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceLattice.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmooth.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothAxiomAudit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothCarrier.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothControls.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorus.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorusC4.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SpectralWeights.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/D2SchurLinks.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Law.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Poisson.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Budget.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Covers.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Elementary.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Hazard.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Interpolation.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Structure.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNCluster.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNProbability.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Analysis.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24ConeMoment.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Covariance.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Elementary.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Images.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Interfaces.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Field.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Lifetime.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/P15.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/RN.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Side24.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/alignment/ACTUAL_FIELD_WITNESS_PRESENT_BUT_NOT_PARENT.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/alignment/MAIN_ARITHMETIC_PARENT_BOUNDARY.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/alignment/NEW_ENDPOINT_AND_WHOLE_CARRIER_PROGRESS.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/alignment/PAIR_LAW_SOURCE_BINDING.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/alignment/REGULAR_LEVEL_GEOMETRY_BOUNDARY.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/alignment/RN_REGRESSION_PALM_BINDING.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/alignment/SIDE24_EXACT_ENCLOSURE.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/coverage-boundary.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/baseline-receipt.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/all-declarations-and-witnesses.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/auditor-module-census.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/false_premise-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/false_premise-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/fresh-kernel.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/honest-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/honest-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/missing-module.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/native-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/native-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/sorry-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/sorry-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/unused_axiom-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/unused_axiom-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-contract.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/witness-kernel.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/witness-type-contract.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/receipt.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/CBZNonvacuity.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/cbz_lean_check.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/formal_gate_check.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-receipt-observation.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEW.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEW.pending-R3.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEWED_SOURCE.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEWED_SUCCESSOR_SOURCE.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/live-receipt-observation.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/private-axiom-probe.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_private_axiom.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_safety.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_safety_successor.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_witness_contract.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_witness_successor.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/safety-probe-report.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/safety-successor-report.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/witness-contract-probe.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/witness-successor-probe.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel-run-result.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/AuditWeakenedWitness.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_false_premise.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_honest.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_native.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_sorry.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_unused_axiom.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_false_premise.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_honest.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_native.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_sorry.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_unused_axiom.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZNonvacuity.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZWeakenedWitness.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/MissingModule.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/SelfAudit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/WeakenedWitnessContract.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/WitnessTypeContract.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/all-declarations-and-witnesses.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/auditor-module-census.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/false_premise-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/false_premise-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/fresh-kernel.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/honest-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/honest-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/missing-module.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/native-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/native-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/sorry-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/sorry-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/unused_axiom-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/unused_axiom-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-contract.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/witness-kernel.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/witness-type-contract.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/Audit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/Types.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/axioms.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/build.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/elaborated-types.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_covariance_bound.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_covariance_bound.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_eigenvalue_third.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_eigenvalue_third.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_endpoint_adjacency.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_endpoint_adjacency.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exp_partial_sum.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exp_partial_sum.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exponent_bound_d3.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exponent_bound_d3.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_trace_variance.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_trace_variance.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/leanchecker.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/preflight-version.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/version.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/wrong_image_constant.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/wrong_image_constant.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/ConeMoments.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/Endpoints.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/Ledger.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/lean-toolchain create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/manifest.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/CBZNonvacuity.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/cbz_lean_check.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/formal_gate_check.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition-optimized.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition-optimized.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/museum-input-receipt.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/museum-inputs.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node-result.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode-optimized.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode-optimized.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-install.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-install.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-interruption.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-skips.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-start.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python-result.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python-start.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-image-pull.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-image-pull.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable-result.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable-source.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-result.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-source-diagnostic.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged-result.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox.stderr create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox.stdout create mode 100644 cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/shop-input-receipt.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/MAIN_PROOF_INDEX.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/QUARANTINE_BOUNDARIES.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/REPORT.txt create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/RESULT.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.sha256 create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/AuditWeakenedWitness.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_false_premise.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_honest.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_native.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_sorry.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_unused_axiom.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_false_premise.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_honest.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_native.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_sorry.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_unused_axiom.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZNonvacuity.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZWeakenedWitness.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/MissingModule.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/SelfAudit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WeakenedWitnessContract.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WitnessTypeContract.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/all-declarations-and-witnesses.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/auditor-module-census.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/false_premise-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/false_premise-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/fresh-kernel.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/honest-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/honest-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/missing-module.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/native-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/native-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/sorry-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/sorry-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/unused_axiom-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/unused_axiom-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-audit.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-compile.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-contract.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/witness-kernel.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/witness-type-contract.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/Audit.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/Types.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/axioms.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/build.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/elaborated-types.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_covariance_bound.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_covariance_bound.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_eigenvalue_third.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_eigenvalue_third.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_endpoint_adjacency.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_endpoint_adjacency.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exp_partial_sum.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exp_partial_sum.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exponent_bound_d3.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exponent_bound_d3.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_trace_variance.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_trace_variance.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/leanchecker.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/preflight-version.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/version.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/wrong_image_constant.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/wrong_image_constant.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/main-latest-17-source-preservation.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-full-main-run.exit create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-full-main-run.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-reviewer-original-probe-rejection.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-tests-green.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-tests-optimized.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/ALIGNMENT.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/GLOSSARY.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/README.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/REVIEW_LANE.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/SCOPE.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/ConeMoments.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/Endpoints.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/Ledger.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lake-manifest.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lakefile.toml create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lean-toolchain create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/manifest.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/reviews/README.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/reviews/TEMPLATE_alignment_review.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/sources/side24_v1/ENCLOSURE.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/sources/side24_v1/PROOF.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tests/test_cbz_lean_check.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/CBZNonvacuity.lean create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/cbz_lean_check.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/formal_gate_check.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/toolchain-runtime-archive-verification.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/STATEMENT_ALIGNMENT_GAPS.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/TOOL_REGISTRY.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/main-git-source-bindings.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/main-tests-with-pinned-toolchain-optimized.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/main-tests-with-pinned-toolchain.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/math-resource-boundary.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/portable-main-receipt.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/portable-tests-green-final.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/lean-foundation/portable-tests-optimized-final.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/COPY_MANIFEST.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/DEMO_D1_EVENT_TRACE.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/ENVIRONMENT_V17.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/LOCAL_EVIDENCE_NOTES_INDEX.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/SOURCE_REFERENCE_INDEX.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/certificate_schema.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/external_theorem_sources.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/frozen_v14_proof_hypergraph.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/COVERAGE_REPORT.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/LINEAGE_IMPACT_v11_to_v12.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/NEXT_VERIFICATION_TARGETS.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/SOURCING_LEDGER_v11.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/SOURCING_LEDGER_v12.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/VERIFICATION_REPORT.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/acceptance_evidence_ledger.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/independent_verification_ledger.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/import_applicability.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/local_exact_receipt.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/manifest.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/runtime_schema.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/schema.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/source_provenance.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/source_statement_comparisons.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/04cf4c986f29ac7ac33b3cc87feac23f3cf494e0c1b3bf4476e4e6666de46574.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/21ce7a29ac0971919c0602f556f1aeba48bb14fffd4193864b3f482185bc1698.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/29a0c6d00ce739baf1d29a3163977d8e707e2079e216fba4fee3669cebec127d.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/320bc988c468bea4938bb777a2d05952c6ab8e0a384f33725b50de847aeec1eb.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/3d938d2223d99f7a8dbaa005b9eb3769813a6f8099a7780200ef048049637c82.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/3d952a906553d578876456539a8f0dcd64aedd45099e8394cbe9db99866ec531.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/56c0b94f9b1fcc1207b8e0bc4d1a7e89b6cba7b285fcbf550fd8dd1d9c30f3e1.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f.pdf create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f.txt create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/65a1037f270b22fc776ac4fb85484b118fe9c8d79f1036ac6c70045180e2a744.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/69ea7a479a9e8a5150cbe07b373772ab22413a1d81194d5a6a78adf6ada5f03f.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/767688188b02cda022fae2c411583559ad8f96b3a318293df1c2db8193302706.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/7a425f7119dd8a0701fb241769a3e82d80fbd6b148d074f11e1015e826813268.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/7ff9e4a028f24afc731200b14bc5b993c0a874906cf6ea25e8c890afed8cdc53.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/830637948365dae801c4ec8382310c7bd69c0ac5735996d7854642e4d698a99d.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/83f653393dc6245980f6848e2bfc65ac9ad4c7d8304b028b88764356fd3825b6.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/8b9376a69fda9f0f231d9502be839ae45d8006d1891ff3e700fa521cc96f6cb4.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/8cf417db179ac66fe44018d42d16bc055355c9d075349ed8ac9b3dd72fd4859f.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/910d371ebb4a310a7e2248348ba8cd09d6f3229740525d74ec7d06d8d1470717.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/b529fe3780e1909014b3cb144b9a74156d976bbdc19b6711d0c5b1a1da9e5669.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/b7328d4bab97fa2d12622ca730dc698970febc1ea8bcbc0b24555e69e2a66392.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/b7ce509af57b1bdc999813927ee39a4fe12d52fe2c9669e249dddfa30ea3144f.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c35de0d50d9f0b7df664d8f3b4c41d7ddcbfcc5ed251c31b309e9c3532fd7d75.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c8bd489ca3fbb3760f7b2d53e7385131ac5336c51ba983e00e4d540fe2f00aaa.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/cc0f49b407337af0e1ce232b0ca2aa9f611ae7a1ecf1c74f2d430d6490336445.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/d28aa700ba83ca139b7b29b6ff06cc39c725470b710af10728867ec10c8ca985.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/e3bb8751fbdaf0db075342a31dd208c1300c6e93a1c3c8a7c3b255860442551b.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/f821d911aaba767677f341f4b6510e05fc39e15238d5e4f656e5000644293f58.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/f8289546ee82fb386a0d0b6b54fbb99f258a2dc2a959ae231ae80cb4baa61e1e.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/fa6d443fd5eeeb21c0d311de4d11eb5b406758f3c5ff09a222d02ba54bd0752c.raw create mode 100644 cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/verification_report.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/math-source-manifest.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/prior-decisions.jsonl create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/G0.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/G1-main.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/REPORT.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/TOOL_REGISTRY_ENTRY.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/COVERAGE_REPORT.md create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/COVERAGE_TOOL_REGISTRY_ENTRY.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/G1-main.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-archive-quarantine.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-boundary.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-containers.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-dispositions.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-selftest-missing-total-budget-test.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-selftest-proposal-replay.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-selftest.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage_boundary.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage_companion.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage_selftest.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/test_coverage_companion.py create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/selftest-negative-controls.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/baseline-tool/actual-cold-start.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/baseline-tool/actual-inspect.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/baseline-tool/proposal-final-cold-start.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/baseline-tool/proposal-final-inspect.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/current-tool-selftests-optimized.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/current-tool-selftests.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/metadata-identity/normal.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/metadata-identity/optimized.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/metadata-identity/source-mutation-normal.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/metadata-identity/source-mutation-optimized.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/cli-controls.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-closed_quarantine.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-custom_axiom.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-doc_truth.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-live_hash.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-receipt_binding.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-receipt_logs.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-unlisted_tool.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutations.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/positive.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/positive.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/report.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/cli-controls.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-archive_readback.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-atomic_push.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-default_exclusion.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-expected_old_leases.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-full_state_guard.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-manifest_hash_guard.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-original_tag_ref_guard.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutations.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/positive.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/positive.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/report.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/scale.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/REPORT.txt create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/mutations.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/registry.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/scale.json create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/test-optimized.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/test.log create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/storage/REPORT.txt create mode 100644 cbz/evidence/website-foundation-20261029/sources/tooling/storage/TOOL_REGISTRY_ENTRY.json create mode 100644 cbz/evidence/website-foundation-20261029/tool-registry.json create mode 100644 cbz/evidence/website-foundation-20261029/verification/baseline_controls.py create mode 100644 cbz/evidence/website-foundation-20261029/verification/ref_controls.py diff --git a/cbz/evidence/website-foundation-20261029/ARCHIVAL_CONTROLS.json b/cbz/evidence/website-foundation-20261029/ARCHIVAL_CONTROLS.json new file mode 100644 index 000000000..b627355ed --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/ARCHIVAL_CONTROLS.json @@ -0,0 +1,103 @@ +{ + "scope": "Visible exact copied R3 negative inputs/audit harness sources; no scanner suppression", + "records": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_honest.lean", + "sha256": "7e3db1846b209bf1b1c4309ccc319d70eaca67932ceff91c2e1eb5183ba79c75", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/MissingModule.lean", + "sha256": "c14bbecc2f99170c2c56c3e2865493a89a144a55927bc036c751e7f5ad3a039c", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_native.lean", + "sha256": "4c5529b6c627afca507e031a24f43750a8376f5b5179b349efc4d63a24ed2187", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WeakenedWitnessContract.lean", + "sha256": "ce758e7ce7d3c30865f9ccc01b1f6f27d582e6ff5e9d5f411a09daaa9cc6fcf7", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZWeakenedWitness.lean", + "sha256": "810e160d7666b4ad02f616ff0e02502bc2d83bd99f934d692aa7a420b2b05c07", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/AuditWeakenedWitness.lean", + "sha256": "e371bdfc23bdce4823e34a6ba256f20b8786def91aaafe7fc4bed771119fc668", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_honest.lean", + "sha256": "d8099911accbf7a768892136256820e31afa9158d8d15c92d7437bb695a53295", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_false_premise.lean", + "sha256": "90c2c80bb3fbc9cc7ae30816d050ae5d0eac8903b3d2455136b48ebea7281dc0", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_unused_axiom.lean", + "sha256": "e45b7df50d35aa6fd7f9cfcd89157a664f4474fd7f11bebf2b7883afe27a914a", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_sorry.lean", + "sha256": "f05c64a3378544e29d991af8346187542dd50938e2488132152e1179a8af500e", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_false_premise.lean", + "sha256": "bc649d9293515f6a1f707503b0883fb6ea2b845c20fccd9f42f3dee6216215e1", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_native.lean", + "sha256": "b7c80d76545ac4de9cd065cd23b65e9363a6e9585469f445764d138772c1c20b", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_sorry.lean", + "sha256": "9326bf1f792972f852fc0449f52b530e1ebb1b6a092993dd745e873600620683", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_unused_axiom.lean", + "sha256": "17e7bd63d299fb6ca43b4b791d75268499a1af711bc82aa3fbcc2a56da941175", + "status": "QUARANTINED_ARCHIVAL_NEGATIVE_CONTROL", + "reason": "Exact historical adversarial input or audit harness retained for actual R3 controls. Never imported by CLOSED live Main modules. Token findings remain visible; not a current proof claim.", + "owner": "none" + } + ] +} diff --git a/cbz/evidence/website-foundation-20261029/ARTIFACT_SHA256.json b/cbz/evidence/website-foundation-20261029/ARTIFACT_SHA256.json new file mode 100644 index 000000000..74c53baf5 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/ARTIFACT_SHA256.json @@ -0,0 +1,3016 @@ +{ + "generated_utc": "2026-10-29T18:39:30.497864+00:00", + "scope": "All namespaced contribution files; excludes itself to avoid a self-hash cycle. Live product/tool sources separately bound by registry and proof source entries.", + "files": [ + { + "path": "cbz/evidence/website-foundation-20261029/ARCHIVAL_CONTROLS.json", + "bytes": 7855, + "sha256": "6b26022cd44412a605c45fb09128be022db1734ed6dd649dd329459decc4aefe" + }, + { + "path": "cbz/evidence/website-foundation-20261029/BASELINE.proposed.md", + "bytes": 4177, + "sha256": "375dc77ce8ce2bdd6a75c089c6394dd6498237f3fef9a1d6780f524f88a41d7c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/CONTRIBUTION.json", + "bytes": 3110, + "sha256": "19e42902f3ca44e6b0eadccf93aa3a035ccb327e2a61d5f9e0e109b67635f622" + }, + { + "path": "cbz/evidence/website-foundation-20261029/DECISIONS.proposed.md", + "bytes": 2395, + "sha256": "bdce86d7caf168d5b8cd64d4125a1f3db2699141628d03860b6ef9af07889644" + }, + { + "path": "cbz/evidence/website-foundation-20261029/FINAL_METADATA_CHECK.json", + "bytes": 559, + "sha256": "fd0ad5cdcbe5b319669c9f8a3c1b8857184d0b37665b4254b94e6ba3fe91f11d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/FINAL_VERIFICATION.json", + "bytes": 1240, + "sha256": "128114e0d5b5abb3840c971c1fb2e29321d02ad5ac0646ef2043b395eea9944e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/GOVERNANCE.proposed.md", + "bytes": 3130, + "sha256": "1c1c9bd4fc2cf58e844cf922b0ddaa1db5a801f9b5394ab58b1307d32aa701af" + }, + { + "path": "cbz/evidence/website-foundation-20261029/INVENTORY.proposed.md", + "bytes": 2440, + "sha256": "a1ad277083fb4dcffecd3a9f5a8b43827b363d348a3586f55ce1da8f329763ea" + }, + { + "path": "cbz/evidence/website-foundation-20261029/NEGATIVE_EVIDENCE_FINDINGS.json", + "bytes": 6024, + "sha256": "9d6d2eae559b008187446d14e6956e972e30fe8157b440599496384f2c2b113b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/NEGATIVE_EVIDENCE_QUARANTINE.json", + "bytes": 8842, + "sha256": "2cbf5b04e094456107b41c3a74f02120e4996df5eaf5d5099858583abca24af6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/PROOF_INDEX.proposed.md", + "bytes": 2918, + "sha256": "aec3bfb3ed6d662fb846f0767fc0fe90ebd1b87b4b7db5cd4f603945dd0e65a8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/STATUS.proposed.md", + "bytes": 8439, + "sha256": "14600a542f56275e70636a17cbae79aae2ae70ea83c683b145070157db4568b4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/TOOLING.proposed.md", + "bytes": 5696, + "sha256": "a0a8779ea9cbf650590a0afe4329c41c59cdcde0ae86f9c866abcd73b2fab85e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/VERIFICATION.json", + "bytes": 823, + "sha256": "2fb4181a33c01e7e9cec0654cb451bbf36029536786121dff1ac3b4d4c8077d3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/archive/FULL_LEGACY_COPY_VERIFICATION.json", + "bytes": 112326, + "sha256": "1326553469bc0263040d5c9185e22b4af6b8dd66e7eda99b3d7ac03703b8918a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/archive/LEGACY_COPY_DISPOSITION.json", + "bytes": 769, + "sha256": "c0a3545789660e122de55131002adac4f12a46637db633264e4e80a43db26136" + }, + { + "path": "cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.json", + "bytes": 572, + "sha256": "418f0716fd00d57fc3df1148384144ae088072acfc5d07083bd9ac861545f2b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.md", + "bytes": 12345, + "sha256": "c35de0d50d9f0b7df664d8f3b4c41d7ddcbfcc5ed251c31b309e9c3532fd7d75" + }, + { + "path": "cbz/evidence/website-foundation-20261029/baseline-config.json", + "bytes": 5329, + "sha256": "fbfa98e921ddc79ec9682da64686a1767f67b650e481571a1625b708b027e2c9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/construction/generate.py", + "bytes": 31633, + "sha256": "610b8953c903c37dfdc0289ddd29d60d5411d5a0efb872be98b2e3a1226a8ddb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/construction/test_verify_proposal_guard.py", + "bytes": 1894, + "sha256": "4355cdd6f6c197e13dfe70300c668d4963522e1a77f9aa46e970801c627dc178" + }, + { + "path": "cbz/evidence/website-foundation-20261029/construction/verify_proposal.py", + "bytes": 6155, + "sha256": "17a44125ca44d0f36e1c614c1809159f7fd933b3c292cec22c937356548e57e5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/decisions.json", + "bytes": 2357, + "sha256": "7627ed940e054c0ff073108048b74b5067d3adffa167f148825970b9d14d4b23" + }, + { + "path": "cbz/evidence/website-foundation-20261029/proof-index.json", + "bytes": 4839718, + "sha256": "4aea4adfb81f293b7662c68d76f6d6bd1db14653a2ffce1fd47207bb77b4499d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/source-manifest.json", + "bytes": 147705, + "sha256": "1a026ac774d087c7cbcf9b9c3e1715071ef1b9c26c7a5ff5afa75cce4e859869" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/MISSION.md", + "bytes": 4530, + "sha256": "6a50282921fe0cfd3f5fee6e15838529896344cdf866a3c758005cca79de53ef" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_atom_integral_20261006/Contract.lean", + "bytes": 3433, + "sha256": "746523ec422f3325029bb476f254b8d584692534f9cde00d95901209e6d81ccb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_atom_integral_20261006/D2AtomIntegral.lean", + "bytes": 7278, + "sha256": "247507c4b7aeaccc033cd4d648442172d61227bb27239a7dacccd0f2fa1ba6c3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_moment_bridge_20261006/D2MomentBridge.lean", + "bytes": 10696, + "sha256": "cde3bbd96eb29eb9ab7ff1448ffab1f794fb2b80355ac618800155eea6ccc42f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/Contract.lean", + "bytes": 869, + "sha256": "17d29f16a788be98145ac76e55ab4103378e453770eb8ac4bde58281747d2eea" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/D2SquareSchur.lean", + "bytes": 3004, + "sha256": "e0f9560e6f129216cd989cea3cdf97254972ca9b1cae7bab57df664329ae78fa" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/ClosedSuperlevel.lean", + "bytes": 8088, + "sha256": "90d1481b75d9c6d14e462c3fbf0bf7c7cdd0efb9eaad68d6732400658753b1c2" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean", + "bytes": 19803, + "sha256": "3d6b0d6b53413c484b1d010bccf0d53ae7f75becb2d747868f22dbd673fe0a88" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0Controls.lean", + "bytes": 29590, + "sha256": "df9d3645282ca526b67eca3d5db691b622092a14b5fddee9be21013e39666184" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean", + "bytes": 15309, + "sha256": "346eea948e18d5904422904006827930e27d3141ccbc19ee8ac2c24bcf65a4a9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean", + "bytes": 11816, + "sha256": "8a2470431c3fda5e98859aa9372cbb8866ed5c5c722cea5dfc28cb577840bbad" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusFiltration.lean", + "bytes": 136, + "sha256": "cddb8bc93569edbcc913eb7c79e23f9a5a637924207aabc2c11c1ad7fe476a75" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusTopology.lean", + "bytes": 12257, + "sha256": "ddb145b3f791c181d4f2a51e54e711937297bd6476ba55bcd5252b7ddb57cfe1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/AlgebraV2.lean", + "bytes": 1970, + "sha256": "4480708263c40a2f7f03f12ef7e15f0eb4f8193c2dccbb253921a7ec251863c3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/D2Schur.lean", + "bytes": 6694, + "sha256": "d3fb3ed7b4043227f1d5a06e208de9d94eb413c067e9d0f8802388407c9e15b9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MeasureBridge.lean", + "bytes": 6911, + "sha256": "28ac130db490c3c3e2fbfabf3ac5be43c854ab1468bf573bf5a8c0dd2c50955f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentGenerality.lean", + "bytes": 4543, + "sha256": "fdec55f1602938cd8fdb5b71535962e76a9671bf230dea53868b14147fb3b509" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentTail.lean", + "bytes": 7197, + "sha256": "87fe3ee90afc52d8c2652881f1ae195d1b0b15a2ffc18c84d6166d1a4d0de2aa" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean", + "bytes": 3498, + "sha256": "338452a0c2ba24d016059354d543cc995b8cb29c9d4a41d98bb93499f5f8cb8f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightPerturbation.lean", + "bytes": 6728, + "sha256": "50ce15709a133da12a0b4333cc653d26c5fd8a412976c975a7c2f3b25ed5c00f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightedLaw.lean", + "bytes": 6251, + "sha256": "f31dfd2cd048cc0c0446c54c46d89c9cdd5d7bb9d76e9d8d16b7c034f351d736" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1.lean", + "bytes": 339, + "sha256": "c55cc116ff3ffbffdb692226e215450a5d2e85b60d27b1b04d529b87bdef38f8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean", + "bytes": 3683, + "sha256": "6b0be1116f6b357b0ffbda202c572c27c2788b98bee639e228375a5ebeea1fa9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridgeAudit.lean", + "bytes": 340, + "sha256": "b3b4151188b4d790d280968c1fbe65b9c3458888a37b380349f3707302113e4c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean", + "bytes": 5866, + "sha256": "d3d78472881059546402218cc77792eeef00755c222bb02499d69abd3b5cd57e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceAudit.lean", + "bytes": 600, + "sha256": "8ddaab57d2651a7375a509a90f274381bf15f6dcf5707460614a81075aa9e52b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceControls.lean", + "bytes": 1257, + "sha256": "f048de3c19859b96af44b4637c875eed57443d33767b57631f9ad0548a7ee7ca" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean", + "bytes": 16006, + "sha256": "3dab19342c307f6b70f4fa05ac913b4ead083742a56408db71b45276c0acb9ab" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalAxiomAudit.lean", + "bytes": 1802, + "sha256": "4916c4446872057a0ebcbe07226fd8c4245ff450ddd2d430be81ab97ec5c6dc3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalControls.lean", + "bytes": 3561, + "sha256": "b515d40bc0f58a71c3afa80e3ae7fae53725f3d713c2df2df110ba2814a4ece3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean", + "bytes": 326607, + "sha256": "040aa91fcbdf25ccdaced1c828dd779318217a7c41ac928f87e8d17a8d3c3ef0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeField.lean", + "bytes": 3913, + "sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeGeometry.lean", + "bytes": 4588, + "sha256": "8ec4b18959055f20d849337e44a70d0c5b39b7959b54cb4d7b6c2a473ee0612d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/inputs/Lifetime.lean", + "bytes": 51383, + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean", + "bytes": 19803, + "sha256": "3d6b0d6b53413c484b1d010bccf0d53ae7f75becb2d747868f22dbd673fe0a88" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean", + "bytes": 15309, + "sha256": "346eea948e18d5904422904006827930e27d3141ccbc19ee8ac2c24bcf65a4a9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean", + "bytes": 11816, + "sha256": "8a2470431c3fda5e98859aa9372cbb8866ed5c5c722cea5dfc28cb577840bbad" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/TorusTopology.lean", + "bytes": 12257, + "sha256": "ddb145b3f791c181d4f2a51e54e711937297bd6476ba55bcd5252b7ddb57cfe1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean", + "bytes": 3683, + "sha256": "6b0be1116f6b357b0ffbda202c572c27c2788b98bee639e228375a5ebeea1fa9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean", + "bytes": 5866, + "sha256": "d3d78472881059546402218cc77792eeef00755c222bb02499d69abd3b5cd57e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean", + "bytes": 16006, + "sha256": "3dab19342c307f6b70f4fa05ac913b4ead083742a56408db71b45276c0acb9ab" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/specifications/lean_statements_20261010/Specifications/Field.lean", + "bytes": 27767, + "sha256": "f22c91e082cd7e738ba47c9c3534e47ac687d066f0b78586d15103cf1132535e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/AlgebraV2.lean", + "bytes": 2076, + "sha256": "71e4327df9f7d6979f1467f7e0d880e0ab0a70ab6d234802d8c7a1624b9ce2d9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/DeterminantMoment.lean", + "bytes": 10099, + "sha256": "661b73c3f21c6d2529f5e09ce426d89c01939ab27a5cc868db3802c7e66ea82d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointGaussianMoments.lean", + "bytes": 6574, + "sha256": "c6351881326491ce30f1a266ea60e44c5adb8b3a1e5882c90575c67e459479d1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointNormalizerBridge.lean", + "bytes": 9341, + "sha256": "36eab3b805fcba5160cb7e286dbd7f96940b0c6a85b464aad5fdad2f624ceb7e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianCoupling.lean", + "bytes": 3413, + "sha256": "426a53c139215650e961601c12f3cc1e09069520c5ebb96234a29483280551bb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianJetMoments.lean", + "bytes": 6276, + "sha256": "f2e785975aee6915848fe78dc3ecde02b8f13a0a1fb56ae3771e4c727c723360" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizer.lean", + "bytes": 4688, + "sha256": "32b7202cba2a9a0e0ed603d1a6db9ba2031714375b4e955614d5a40826a14aeb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizerLimit.lean", + "bytes": 11638, + "sha256": "12c98054b5bcf47f4619c624ef5e91c37f316d7c4848f560279d1f1e96fe0049" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianRegressionKernel.lean", + "bytes": 14982, + "sha256": "66d4fbee044a1a0c0b434bcd7614e220fad21d1ac275ce9b01070a66c5780460" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianScalarMoments.lean", + "bytes": 4398, + "sha256": "71ce88ad2c97891858a5196f3293907bdffdd2341dfbace24204f2318c7510df" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/NormalizerFloor.lean", + "bytes": 6134, + "sha256": "428eefd71b8c64fc4bcb208d9f73658058f29765f01a01c591f20a2d2359ec3e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/PalmReweighting.lean", + "bytes": 6520, + "sha256": "d34e422693f1d449bfcaf9c844c99c8fef4f19503312d3677ca525bd2d67c4d6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean", + "bytes": 3670, + "sha256": "dbc42b17797be688fecec790f32fcfd0004d98ac776cbbe0471c62c3f506aa41" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1.lean", + "bytes": 623, + "sha256": "15e6b160ea4dcd0b95d9bf56afe318d0292e2421659637cb6754e18eee1e4364" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "bytes": 38753, + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f.lean", + "bytes": 6173, + "sha256": "0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d.lean", + "bytes": 6225, + "sha256": "b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutCoordinateIdentity.lean", + "bytes": 950, + "sha256": "167d0afb49457303a61fac6927784e4f0157ed5725739903bf5e33224974b081" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutRegularOrInterior.lean", + "bytes": 838, + "sha256": "d3c12e33718a00be343d0e2b3cbbd9a1cdf08e8a2062eb3bfeb7026fb47a543d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/Lifetime.lean", + "bytes": 51383, + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularPointChart.lean", + "bytes": 2767, + "sha256": "5568c8d6e03f7064cd5924ebe2814ae746100505ae31789d5c975902528f9fa2" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevel.lean", + "bytes": 6405, + "sha256": "0db6ce3ea7358a59c089680d774a6806f0fb747c24d9828850377458156e2f02" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelAxiomAudit.lean", + "bytes": 3248, + "sha256": "807de09540b9f7f4f4e14c3408f1f82cb08b1e4232c68c04da5a2355cec02f9e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelLiteral.lean", + "bytes": 2299, + "sha256": "334759063a3ae58b42b8cd4a45e3bfd6f3a31b668d18526aa6fdcb5ea65c13d3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ConfluentIntegralIdentities.lean", + "bytes": 10154, + "sha256": "0324d7556d485cd360a513587199354fa1f3863d15cf06b52c86e362de5e56b8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ContactJetCovariance.lean", + "bytes": 6927, + "sha256": "50df0281c580ac7af018713a38c6bdd5dd34b52e3834b573165045bc64acd49d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianRegressionLimits.lean", + "bytes": 8122, + "sha256": "26c403ea1104fbce89f5c2833f603edd4d2703669d8a94a77b2c9a2a06b572be" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianWeightedMajorants.lean", + "bytes": 20065, + "sha256": "3bde84aa83d02b364ca17f242cc5dbca83908c02f2f75649075d7da6a3d1bfd0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConditionalMajorant.lean", + "bytes": 24822, + "sha256": "07ae7796e461a2ee59a757b37a3e64f7ed31c76d26a3b40825f23170fcb4e691" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentLimits.lean", + "bytes": 54275, + "sha256": "1635a05bbd5b56608bc0a1a04eb4404c2df4601f1255f5846c1342a597bf5b0b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentPins.lean", + "bytes": 7123, + "sha256": "41e1ea1ef4f9960307552a8271a5c04d2b72d94736b98eb601b51669ed603c3f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactCovariance.lean", + "bytes": 8225, + "sha256": "4189cbaf4c18c55f21e3af2c96b0b2842d83161f44596eb691c507dcc1a439c8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactEndpointParameters.lean", + "bytes": 16225, + "sha256": "da5337a7814a008eaa8b8a98c0df4daf3efb1bc347789a2f75efc63c9c258d01" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactSchur.lean", + "bytes": 9665, + "sha256": "2fe122a50ec1889b579558d80086251d87ed0cec2420d268ab1d04f6bfff4409" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeContinuity.lean", + "bytes": 5076, + "sha256": "552511e0aee227133b7d067faeceaab9c43c0094b07d68b8eddab0ab2419775e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeGaussian.lean", + "bytes": 9874, + "sha256": "c9754debcbf2aab7ff8d9604f2c13726723e8a8c1921ae68f83349205e43885d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointEstimates.lean", + "bytes": 20080, + "sha256": "d1f08d80d06d1ac08afbdd700370059fd8eaf0d4e483916e742efcdd1f664598" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointParameters.lean", + "bytes": 15783, + "sha256": "efc88ac59217ab1960d5518abcd9f16a71b42080a2810f1e337eeb2f686c1e3a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointRegression.lean", + "bytes": 10303, + "sha256": "67e68553e004adc3b1b6beb987b3e7ad477b4541d96fec22ee481facd2038fce" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourcePhysicalEndpointKernel.lean", + "bytes": 7126, + "sha256": "689ced2a760b38333b0224f19af52812d0057527d5a790ba50116cb5f07b7e3a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothConditionalKernel.lean", + "bytes": 34339, + "sha256": "664892acb12d40e5bf20075e1ef633efdd4a54ae1308c714308eab3a4deaa517" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothPalm.lean", + "bytes": 17790, + "sha256": "1b1d47b640b541195dad1472a07fa9490f203bd1619b1759b29587a0effe631d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/GaussianSeriesFoundation.lean", + "bytes": 4262, + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/DeterminantMoment.lean", + "bytes": 10099, + "sha256": "661b73c3f21c6d2529f5e09ce426d89c01939ab27a5cc868db3802c7e66ea82d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointGaussianMoments.lean", + "bytes": 6574, + "sha256": "c6351881326491ce30f1a266ea60e44c5adb8b3a1e5882c90575c67e459479d1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointNormalizerBridge.lean", + "bytes": 9341, + "sha256": "36eab3b805fcba5160cb7e286dbd7f96940b0c6a85b464aad5fdad2f624ceb7e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianCoupling.lean", + "bytes": 3413, + "sha256": "426a53c139215650e961601c12f3cc1e09069520c5ebb96234a29483280551bb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianJetMoments.lean", + "bytes": 6276, + "sha256": "f2e785975aee6915848fe78dc3ecde02b8f13a0a1fb56ae3771e4c727c723360" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizer.lean", + "bytes": 4688, + "sha256": "32b7202cba2a9a0e0ed603d1a6db9ba2031714375b4e955614d5a40826a14aeb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizerLimit.lean", + "bytes": 11638, + "sha256": "12c98054b5bcf47f4619c624ef5e91c37f316d7c4848f560279d1f1e96fe0049" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianRegressionKernel.lean", + "bytes": 14982, + "sha256": "66d4fbee044a1a0c0b434bcd7614e220fad21d1ac275ce9b01070a66c5780460" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianScalarMoments.lean", + "bytes": 4398, + "sha256": "71ce88ad2c97891858a5196f3293907bdffdd2341dfbace24204f2318c7510df" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/NormalizerFloor.lean", + "bytes": 6134, + "sha256": "428eefd71b8c64fc4bcb208d9f73658058f29765f01a01c591f20a2d2359ec3e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/PalmReweighting.lean", + "bytes": 6520, + "sha256": "d34e422693f1d449bfcaf9c844c99c8fef4f19503312d3677ca525bd2d67c4d6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceC4.lean", + "bytes": 6438, + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceCovariance.lean", + "bytes": 3925, + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceFourierSeries.lean", + "bytes": 6524, + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceGaussianLaw.lean", + "bytes": 8984, + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceKernel.lean", + "bytes": 5293, + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceLattice.lean", + "bytes": 6284, + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmooth.lean", + "bytes": 11336, + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmoothCarrier.lean", + "bytes": 11222, + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorus.lean", + "bytes": 5182, + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorusC4.lean", + "bytes": 6081, + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SpectralWeights.lean", + "bytes": 6924, + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeAxiomAudit.lean", + "bytes": 3759, + "sha256": "fea8df29106f295238b3a039bb2aae350167a9ada2326d6d00ba6f6663be52c3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeControls.lean", + "bytes": 5456, + "sha256": "f50da7cb374c3e75280ae465696b657902f9070cff1256784dc28050017cd171" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeField.lean", + "bytes": 3913, + "sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeGeometry.lean", + "bytes": 4588, + "sha256": "8ec4b18959055f20d849337e44a70d0c5b39b7959b54cb4d7b6c2a473ee0612d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceThetaBridge.lean", + "bytes": 11897, + "sha256": "c03df303f47ac056af332ad421a6720966464c474ee77e671f85242d30f6cc9b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/GaussianSeriesFoundation.lean", + "bytes": 4262, + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/Lifetime.lean", + "bytes": 51383, + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceC4.lean", + "bytes": 6438, + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceCovariance.lean", + "bytes": 3925, + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceFourierSeries.lean", + "bytes": 6524, + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceGaussianLaw.lean", + "bytes": 8984, + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceKernel.lean", + "bytes": 5293, + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceLattice.lean", + "bytes": 6284, + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmooth.lean", + "bytes": 11336, + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothCarrier.lean", + "bytes": 11222, + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothControls.lean", + "bytes": 3257, + "sha256": "8eca5ecdb5e2a0c1cb786468b340e4516df653468f958e535f156baafef088b4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorus.lean", + "bytes": 5182, + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorusC4.lean", + "bytes": 6081, + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SpectralWeights.lean", + "bytes": 6924, + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/GaussianSeriesFoundation.lean", + "bytes": 4262, + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceC4.lean", + "bytes": 6438, + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceCovariance.lean", + "bytes": 3925, + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceFourierSeries.lean", + "bytes": 6524, + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceGaussianLaw.lean", + "bytes": 8984, + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceKernel.lean", + "bytes": 5293, + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceLattice.lean", + "bytes": 6284, + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmooth.lean", + "bytes": 11336, + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothAxiomAudit.lean", + "bytes": 3399, + "sha256": "4dfa901029fab71d127c9f4c8cf30c937607f4444e6af64f429890d9d141d591" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothCarrier.lean", + "bytes": 11222, + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothControls.lean", + "bytes": 3257, + "sha256": "8eca5ecdb5e2a0c1cb786468b340e4516df653468f958e535f156baafef088b4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorus.lean", + "bytes": 5182, + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorusC4.lean", + "bytes": 6081, + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SpectralWeights.lean", + "bytes": 6924, + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/D2SchurLinks.lean", + "bytes": 19735, + "sha256": "628260ba01ae2cedf2f89478faddb4426ebbfb054aa7d64d983da237c124f00e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Law.lean", + "bytes": 13899, + "sha256": "97dd915fdcdc78b8242f60bd93005ba854f1fc24c2db9da5df6bedfd20eef0a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Poisson.lean", + "bytes": 18488, + "sha256": "45377ccfd156d4342d9e5aee0f90843f46f015436e7f2aa80779c1ed1a02a87d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Budget.lean", + "bytes": 26949, + "sha256": "6b5c5515345b3a8609fd7198f2da07e94a136dcf662445f1e528c63266671c46" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Covers.lean", + "bytes": 14860, + "sha256": "5d14d6283c52e90451bce80061dd55b07b9234c92b3d87de38c1975f5b1852ed" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Elementary.lean", + "bytes": 47996, + "sha256": "d4d87bba1da9473cd3c5bda9c702ba4dd036de06085d5ad589f17988bf8695b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Hazard.lean", + "bytes": 20770, + "sha256": "65584aea77eefd1f59aee51554d94b9ea9c390f7a62da40e4210f8487dbdf8f1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Interpolation.lean", + "bytes": 64531, + "sha256": "bdfd836ecc96910824e78249a19a12e74b99ac2f352bda1e9d5daa4f93ff03cb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Structure.lean", + "bytes": 57827, + "sha256": "a3c9f514a4d482a99402a57c0097e1819fedbfd71faffaafade3b2050d797598" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNCluster.lean", + "bytes": 18754, + "sha256": "829f8ad5677c52d55ae7c4c3ea36d817692c3d122273e29dfe2068b00dde442a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNProbability.lean", + "bytes": 19474, + "sha256": "3bdc6055c8fe9419addc3ad7bf77c5a88efe387470d9c7201331343859808636" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Analysis.lean", + "bytes": 91018, + "sha256": "7cf64095450464b5974e381f9c6d1ed238473dd931ff558cad67db1d9a62acbc" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24ConeMoment.lean", + "bytes": 30230, + "sha256": "08d53d0a970d5765c32e42253fd78226430627018c276398968cab9fc8e3180e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Covariance.lean", + "bytes": 17493, + "sha256": "08317c620ae7b85ce2d253f0a106a6cee0099566a09debeb703acbce4744ae30" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Elementary.lean", + "bytes": 10774, + "sha256": "7fb8f8c5045f51ca766f1fa614a25e3b334b1ac6199731c2556c28707193c1bb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Images.lean", + "bytes": 49482, + "sha256": "ca643c39144400074658c39bbdd0f04ac47d29bd0c59fc2327d5a90d4f5ae392" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Interfaces.lean", + "bytes": 36376, + "sha256": "cac965c9f6095a0812891b609be56e0fed885861f5c95cc0e9518e7908642fce" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs.lean", + "bytes": 572, + "sha256": "bf65105b6902ba3ef8262a7cff13e611ce3e56263ad7f57a7183097e67332a8c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Field.lean", + "bytes": 27767, + "sha256": "f22c91e082cd7e738ba47c9c3534e47ac687d066f0b78586d15103cf1132535e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Lifetime.lean", + "bytes": 51383, + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/P15.lean", + "bytes": 78813, + "sha256": "a30d9e6938b64d4e2728c5380d41b3a627cde42448df254069293e3839a41ca6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/RN.lean", + "bytes": 81196, + "sha256": "cad83a9d18029e66f2563f16a0850e846eb01dad0c3f08da6959ce0c186ae59c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Side24.lean", + "bytes": 75259, + "sha256": "3164ccfd527d5d443c3830ae871e5592abc6658dc3678006da368fdace3818e3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications.lean", + "bytes": 139, + "sha256": "9a05b58eb94b0f24c9b8118b625ff003ca99ff2257734fe3d1f1d57ce3c9b976" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/ACTUAL_FIELD_WITNESS_PRESENT_BUT_NOT_PARENT.lean", + "bytes": 3913, + "sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/MAIN_ARITHMETIC_PARENT_BOUNDARY.lean", + "bytes": 1940, + "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/NEW_ENDPOINT_AND_WHOLE_CARRIER_PROGRESS.lean", + "bytes": 17790, + "sha256": "1b1d47b640b541195dad1472a07fa9490f203bd1619b1759b29587a0effe631d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/PAIR_LAW_SOURCE_BINDING.lean", + "bytes": 51383, + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/REGULAR_LEVEL_GEOMETRY_BOUNDARY.lean", + "bytes": 2299, + "sha256": "334759063a3ae58b42b8cd4a45e3bfd6f3a31b668d18526aa6fdcb5ea65c13d3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/RN_REGRESSION_PALM_BINDING.lean", + "bytes": 81196, + "sha256": "cad83a9d18029e66f2563f16a0850e846eb01dad0c3f08da6959ce0c186ae59c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/SIDE24_EXACT_ENCLOSURE.lean", + "bytes": 75259, + "sha256": "3164ccfd527d5d443c3830ae871e5592abc6658dc3678006da368fdace3818e3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/coverage-boundary.json", + "bytes": 94359, + "sha256": "12699c7cad27501dc6ebb8835cfffdc56cb0087e1da15e8571ac686ee7a9a18e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/baseline-receipt.json", + "bytes": 4378, + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/all-declarations-and-witnesses.log", + "bytes": 10360, + "sha256": "dcc81dc13a6dce4b25a6300fd616966e835877f124b8e6448b452878df9673ea" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/auditor-module-census.log", + "bytes": 1028, + "sha256": "6b9bf4260474d13fb392b71b0fa3b3dadc75fc99fb06310b9caaff31feb3ce4c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/false_premise-audit.log", + "bytes": 538, + "sha256": "424799495dafb2dac297a8206c364a73e8c41bed48ac772b0e806443811bfac1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/false_premise-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/fresh-kernel.log", + "bytes": 36, + "sha256": "765e0f77863dc012524cd125d2699754f19e967f4ec35908a2aed7903057572e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/honest-audit.log", + "bytes": 485, + "sha256": "62390300f3aaa05474dd1d9b75e47728635f0e2c4b0b49dc9daf0914ec506d87" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/honest-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/missing-module.log", + "bytes": 450, + "sha256": "2d9fdde838c729bf8630456eec1033381833a4a2eb42c8f07ca910d9d636f121" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/native-audit.log", + "bytes": 502, + "sha256": "468963ce795fd68a13b99e1e5b9e90e817f273fe2099bda696deb61552697200" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/native-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/sorry-audit.log", + "bytes": 441, + "sha256": "938f55996c45f78c29d90750ce73a1cfba8bd488b34f5b9e99ced19993bab2f4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/sorry-compile.log", + "bytes": 136, + "sha256": "693c90261e9a6a2c68216209a5692f39ee06659d9a50919b2e551ffbd8f8deaa" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/unused_axiom-audit.log", + "bytes": 581, + "sha256": "972d65c1ff8afddb2e2f9024fbaf972b80292d7b9c0d774f8d946dee28fc12f6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/unused_axiom-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-audit.log", + "bytes": 665, + "sha256": "3da011e5e28b010ac0851c66e96f3c3d7f501dbb8febcf944f597f239d4412d4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/weakened-witness-contract.log", + "bytes": 1180, + "sha256": "727a132984645d32ac0f4607e61132c096ab4aa1dfe82bcfe9ad4756744d9346" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/witness-kernel.log", + "bytes": 24, + "sha256": "ab7e01501bc759b00ba24bb39ea9d9bf5e475a179a06f32ee13f3cb1bbc2492d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/logs/witness-type-contract.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/receipt.json", + "bytes": 26957, + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/CBZNonvacuity.lean", + "bytes": 3008, + "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/cbz_lean_check.py", + "bytes": 14610, + "sha256": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-observed-run/tools/formal_gate_check.py", + "bytes": 23845, + "sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/R3-receipt-observation.json", + "bytes": 2419, + "sha256": "734713556cd769748d7774da85972db330e2affaaf426b1c37d725b5d8edc079" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEW.md", + "bytes": 15291, + "sha256": "b981feebca396c7b12ee187995aae96e7135fa70bc18485ccc9e8dac5ec5e3c5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEW.pending-R3.md", + "bytes": 13379, + "sha256": "c5271efac153209a4984fc6f0a0e4abf92f5a973a6f55f7867965f83434500cd" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEWED_SOURCE.json", + "bytes": 1040, + "sha256": "b11271969e307c849638293b8f08668e57f705bb4834e3c89084488d2c5a1966" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/REVIEWED_SUCCESSOR_SOURCE.json", + "bytes": 1041, + "sha256": "3d9c3bedb82d36cb1be8ca9460a83971755115c4d6bc5d2f2d398da0a548c9fc" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/live-receipt-observation.json", + "bytes": 854, + "sha256": "0012408cb3f1740595a102785ac71b817de0522355850cafda86ed3c2eb0b840" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/private-axiom-probe.json", + "bytes": 891, + "sha256": "ad736295d36339608100aae024fd40f721b5c32e274f94a2c9bc730cc08b89f1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_private_axiom.py", + "bytes": 1368, + "sha256": "97c6b0b1479733e78393827576038b2e4bab56e12fbccbb27c8a3ee3b2d1d980" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_safety.py", + "bytes": 2261, + "sha256": "d18a7109dda14c9b514f9f78f65666ed15a1c87eb288268fbc0aede25c0603cd" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_safety_successor.py", + "bytes": 2165, + "sha256": "43750d724c1d4ee800dca1d8333addfa4dff639f5cba1ee1f764301e640c4c92" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_witness_contract.py", + "bytes": 1733, + "sha256": "5a806e6cec3e024164c87a2c878da77fc28f2321ffb12cbf5e9a29053fb597f7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/probe_witness_successor.py", + "bytes": 2401, + "sha256": "116ec5211c1f6e74e7dfbf9556ed69348d43f9ede7ca246982e792b5c0d4caf6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/safety-probe-report.json", + "bytes": 760, + "sha256": "a4dbb1e434f7a577400c54469552a99304d04638d903f7494bc74b2a09d867c1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/safety-successor-report.json", + "bytes": 731, + "sha256": "0cf475ffee06c83156b0df5174bdb2d74d2ed531d5c5bf15b4605c1da61b3f0f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/witness-contract-probe.json", + "bytes": 1173, + "sha256": "f0f623689283baea14b2ed46a7393e49659fe6b8553e8fbdec4221b01b8c2a9b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/engineering-review/witness-successor-probe.json", + "bytes": 2094, + "sha256": "20acfc23a0fc5b52a150ec86be4a0a9ada388beb8addc93d25b601f7092bf712" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "bytes": 12966, + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/AuditWeakenedWitness.lean", + "bytes": 1996, + "sha256": "e371bdfc23bdce4823e34a6ba256f20b8786def91aaafe7fc4bed771119fc668" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_false_premise.lean", + "bytes": 2937, + "sha256": "bc649d9293515f6a1f707503b0883fb6ea2b845c20fccd9f42f3dee6216215e1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_honest.lean", + "bytes": 2923, + "sha256": "7e3db1846b209bf1b1c4309ccc319d70eaca67932ceff91c2e1eb5183ba79c75" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_native.lean", + "bytes": 2923, + "sha256": "b7c80d76545ac4de9cd065cd23b65e9363a6e9585469f445764d138772c1c20b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_sorry.lean", + "bytes": 2921, + "sha256": "f05c64a3378544e29d991af8346187542dd50938e2488132152e1179a8af500e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/Audit_unused_axiom.lean", + "bytes": 2935, + "sha256": "17e7bd63d299fb6ca43b4b791d75268499a1af711bc82aa3fbcc2a56da941175" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_false_premise.lean", + "bytes": 61, + "sha256": "90c2c80bb3fbc9cc7ae30816d050ae5d0eac8903b3d2455136b48ebea7281dc0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_honest.lean", + "bytes": 56, + "sha256": "d8099911accbf7a768892136256820e31afa9158d8d15c92d7437bb695a53295" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_native.lean", + "bytes": 75, + "sha256": "4c5529b6c627afca507e031a24f43750a8376f5b5179b349efc4d63a24ed2187" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_sorry.lean", + "bytes": 52, + "sha256": "9326bf1f792972f852fc0449f52b530e1ebb1b6a092993dd745e873600620683" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_unused_axiom.lean", + "bytes": 77, + "sha256": "e45b7df50d35aa6fd7f9cfcd89157a664f4474fd7f11bebf2b7883afe27a914a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZNonvacuity.lean", + "bytes": 3008, + "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZWeakenedWitness.lean", + "bytes": 258, + "sha256": "810e160d7666b4ad02f616ff0e02502bc2d83bd99f934d692aa7a420b2b05c07" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/MissingModule.lean", + "bytes": 2929, + "sha256": "c14bbecc2f99170c2c56c3e2865493a89a144a55927bc036c751e7f5ad3a039c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/SelfAudit.lean", + "bytes": 1986, + "sha256": "d9a5c1d0b99420d6731163698f53a83253cb9913c5e1a793d7c12e3df6005bdd" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/WeakenedWitnessContract.lean", + "bytes": 542, + "sha256": "ce758e7ce7d3c30865f9ccc01b1f6f27d582e6ff5e9d5f411a09daaa9cc6fcf7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/WitnessTypeContract.lean", + "bytes": 537, + "sha256": "613a79ffe608808ca7b2a4e06e76453b72b390116adf4d880b50106ab7c34596" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/all-declarations-and-witnesses.log", + "bytes": 10360, + "sha256": "dcc81dc13a6dce4b25a6300fd616966e835877f124b8e6448b452878df9673ea" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/auditor-module-census.log", + "bytes": 1028, + "sha256": "6b9bf4260474d13fb392b71b0fa3b3dadc75fc99fb06310b9caaff31feb3ce4c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/false_premise-audit.log", + "bytes": 538, + "sha256": "424799495dafb2dac297a8206c364a73e8c41bed48ac772b0e806443811bfac1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/false_premise-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/fresh-kernel.log", + "bytes": 36, + "sha256": "765e0f77863dc012524cd125d2699754f19e967f4ec35908a2aed7903057572e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/honest-audit.log", + "bytes": 485, + "sha256": "62390300f3aaa05474dd1d9b75e47728635f0e2c4b0b49dc9daf0914ec506d87" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/honest-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/missing-module.log", + "bytes": 450, + "sha256": "2d9fdde838c729bf8630456eec1033381833a4a2eb42c8f07ca910d9d636f121" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/native-audit.log", + "bytes": 502, + "sha256": "468963ce795fd68a13b99e1e5b9e90e817f273fe2099bda696deb61552697200" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/native-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "bytes": 26957, + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/sorry-audit.log", + "bytes": 441, + "sha256": "938f55996c45f78c29d90750ce73a1cfba8bd488b34f5b9e99ced19993bab2f4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/sorry-compile.log", + "bytes": 136, + "sha256": "693c90261e9a6a2c68216209a5692f39ee06659d9a50919b2e551ffbd8f8deaa" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/unused_axiom-audit.log", + "bytes": 581, + "sha256": "972d65c1ff8afddb2e2f9024fbaf972b80292d7b9c0d774f8d946dee28fc12f6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/unused_axiom-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-audit.log", + "bytes": 665, + "sha256": "3da011e5e28b010ac0851c66e96f3c3d7f501dbb8febcf944f597f239d4412d4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/weakened-witness-contract.log", + "bytes": 1180, + "sha256": "727a132984645d32ac0f4607e61132c096ab4aa1dfe82bcfe9ad4756744d9346" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/witness-kernel.log", + "bytes": 24, + "sha256": "ab7e01501bc759b00ba24bb39ea9d9bf5e475a179a06f32ee13f3cb1bbc2492d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/witness-type-contract.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/Audit.lean", + "bytes": 1837, + "sha256": "09b59390c165b16d1c7b5bae189da6b806d79e8491ee0df1e2e83bb911674c71" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/Types.lean", + "bytes": 1648, + "sha256": "e235933f1ff52b448b3b80952f7ec9ac932723520c22766e85dd81046d558884" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/axioms.log", + "bytes": 2375, + "sha256": "856d934eabb250bffb96085454fc04b3ddd64a47bb92829728f7d5bb7d286d0c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/build.log", + "bytes": 237, + "sha256": "44deafbbb3d221e71b39a9acefff0973a13f662a3e30de6855971abe5c5ceaaf" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.lean", + "bytes": 146, + "sha256": "dc222fa20546b3443101625ac0793b3cd9e2cd563af489b8db03990e11afd6d5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.log", + "bytes": 46, + "sha256": "6e7f917c7fe2fdc3efe1943dcc327c56acadd0b0ca96507a4327073fdfd2f083" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/elaborated-types.log", + "bytes": 25152, + "sha256": "10a954ced98371c5cf98eecada196d50c1e6e570af9ea8e07caade4a80b0aab8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_covariance_bound.lean", + "bytes": 7025, + "sha256": "621b585e6a025d9a606cc21c7dfdd2dbc5095b432d4e51d7ea9b2b713a637030" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_covariance_bound.log", + "bytes": 224, + "sha256": "3e9f3d67aa666c88ed8e2b0b126163336cd5982dee6ce21b1118fa200292a4dd" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_eigenvalue_third.lean", + "bytes": 7025, + "sha256": "1380775e4a2dc33ffb8c126dea5d2194ed7bdf7428b6d9d3dca1f8a3addafcb9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_eigenvalue_third.log", + "bytes": 192, + "sha256": "fda3cc4e985c3309e132c150d4ba988a4d4699095ef2f0cab010dc8e2a5094b2" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_endpoint_adjacency.lean", + "bytes": 1940, + "sha256": "f3874de8ca4cab2016d51822373ea1932fcf64b233bec9b653e6a73360a19c0c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_endpoint_adjacency.log", + "bytes": 221, + "sha256": "62af9c46e66215424a5c82c4a1ee83700bbe7ca84906c14400cc4bfdcd5b276a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exp_partial_sum.lean", + "bytes": 7025, + "sha256": "c3bd8d4579b8f23a53e7185bd74e44e3a09b92fe904c61a25ddb3001a33341a4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exp_partial_sum.log", + "bytes": 221, + "sha256": "a82d1d1651352ec73a73ee7ad17a596d225fc808b9a3723dbbdd41f982f5328e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exponent_bound_d3.lean", + "bytes": 7025, + "sha256": "2822b2cce0cf09eccc1926df9be7b48d06a0747a5b79bf14d5187057ea10c588" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_exponent_bound_d3.log", + "bytes": 262, + "sha256": "bccf477ff397333506812af1a4a1475a3716f50a0ac0f3a20de77b421064b78d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_trace_variance.lean", + "bytes": 4409, + "sha256": "07963f41f4b3b682042b048a8133b8315ecfc47f59a441d9684d075585cc18b4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/false_trace_variance.log", + "bytes": 265, + "sha256": "685a68785e68c9590b0479754dc6479d4e1be7a9f89b29a40bfed17c24a376bb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/leanchecker.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.lean", + "bytes": 100, + "sha256": "7a79ea6c867f3a79ef2474d2290e7265ab56a775212c6e67dc1bbad9e4334f37" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.log", + "bytes": 70, + "sha256": "8a0b9f79f3265724af58b27461627f9d532535f8a23681361da731c9ea37c101" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/preflight-version.log", + "bytes": 106, + "sha256": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "bytes": 4378, + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.lean", + "bytes": 80, + "sha256": "8d3b8320eba70953d8de1bc5665cd3665d0d1dfe90f783a7270b1bb1bfab353e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.log", + "bytes": 168, + "sha256": "50c0e4557dee071a09d39a848a5eb54324115cd8958a4564f1e845380a64677a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/version.log", + "bytes": 106, + "sha256": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/wrong_image_constant.lean", + "bytes": 7025, + "sha256": "bb6e6665b42659821261de1b84674ef6a0a19811e8599671f9a7d2d90e81eb77" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/wrong_image_constant.log", + "bytes": 204, + "sha256": "56114d671544669de953160f6688ba962a052a17b8a00e614dc5cdab711744b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/ConeMoments.lean", + "bytes": 4409, + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/Endpoints.lean", + "bytes": 1940, + "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw/Side24/Ledger.lean", + "bytes": 7025, + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/UniversalLaw.lean", + "bytes": 586, + "sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/lean-toolchain", + "bytes": 25, + "sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/formal/manifest.json", + "bytes": 18104, + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/CBZNonvacuity.lean", + "bytes": 3008, + "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/cbz_lean_check.py", + "bytes": 14610, + "sha256": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/inputs/tools/formal_gate_check.py", + "bytes": 23845, + "sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel-run-result.json", + "bytes": 518, + "sha256": "3fcf94200e83350c31a8e13a7cbf3f4e1dba26193d0b083ac9df935faa37edb1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition-optimized.stderr", + "bytes": 192, + "sha256": "88b68bca7a451e084c7ae87a679bdcd0ee211dc0fb132ca8ba1f1f84252e3aea" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition-optimized.stdout", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition.stderr", + "bytes": 192, + "sha256": "46602b4f16b6b14e548e40929439ba749b9fde29eb0900a35fba33ed10cff982" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/graph-composition.stdout", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/museum-input-receipt.json", + "bytes": 9901, + "sha256": "bfdc717490c8a25b889717daa63b32c8b84debc1f8b5ea3f51e20edfbfbf4720" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/museum-inputs.json", + "bytes": 594637, + "sha256": "83c4fd052a1c6164778630dbf090396b66d88d25d9581770c1b554952c054425" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node-result.json", + "bytes": 2151, + "sha256": "2625ed7b6cf94656f464e68c828b047d3f3f43f6ed8fb03c01b9127b3b5a3330" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node.stderr", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/node.stdout", + "bytes": 68785, + "sha256": "f25e068e9087cfedb0f684f385ebee32e1ff7d0710ae6b0346e74f6531e538e6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode-optimized.stderr", + "bytes": 1475, + "sha256": "bf0e3683ed86cfbdbe11b2dc6c4f1b3894649f4c93f9e325d483b6bbcf776f66" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode-optimized.stdout", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode.stderr", + "bytes": 1475, + "sha256": "239ddf7e11d4a11a19dbfe84e34de3fcedd78c9bcd6d3b52065ac77acffdd0cb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-bytecode.stdout", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-install.stderr", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/pytest-install.stdout", + "bytes": 743, + "sha256": "69b2f5bac3518c3441ef4b6f8ab3598d395cf141fe1e53541776853d7d5b5a3b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-interruption.json", + "bytes": 283, + "sha256": "ca27ef175290c6e8fe67d33436941cad6b6ad3a3cdd92037fb2645fa0900d155" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-skips.json", + "bytes": 4929, + "sha256": "e11f582fe60ee278771425566534b0701b3b474a9cb311726bbd5f142664f40e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python-start.json", + "bytes": 28231, + "sha256": "c06ee380c7c85698746d16c795fe6b73769c9d2255165ccc5425ad9e57bcd852" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python.stderr", + "bytes": 63098, + "sha256": "fb837fe092775fcb9077a7f8c93133377efd15a1bfb30b009cc1660cb5523259" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/python.stdout", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python-result.json", + "bytes": 343, + "sha256": "ac7a5d8f6327810d5dd0b19228c30f19f3912900d4cecb73de07a579e1e70e8c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python-start.json", + "bytes": 28231, + "sha256": "0f46a93e0ca44ac0523abe4daf45a6a1bdd99ea035fb34f3d0e5c7a296a74a6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python.stderr", + "bytes": 276084, + "sha256": "f5fd5d54a1d22afbda61d71774dd97d614d7e691d706cdae7ea09482e1c32b40" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/retry-after-restart-1804/python.stdout", + "bytes": 1296, + "sha256": "35c4e53a5f58babac7b3e2ddf792c55f9a54116f0e8b0f4201ca7d280fc2907d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-image-pull.stderr", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-image-pull.stdout", + "bytes": 957, + "sha256": "a37b2d621a1055f8689826b8937f40f62b460a4692b99d87926cf17318eaf822" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable-result.json", + "bytes": 1065, + "sha256": "0812603488f7774973cbcb483b01a7a4308857ff395c330f2c0bca68dd757477" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable-source.json", + "bytes": 537, + "sha256": "8a2b5a03c4b2fc47355abf93f5d95c507bde63cb5257c8c33ebabca16460a901" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable.stderr", + "bytes": 1008, + "sha256": "e1d9cc43e2d60aa897b3a54d4c72e261a5a92f56006a9c43a08bde5006c820c3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-readable.stdout", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-result.json", + "bytes": 1071, + "sha256": "2f33000b26bfd87891a000c0f2c87b8c081c8ff8d8afa009166d91a431324d35" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-source-diagnostic.json", + "bytes": 1325, + "sha256": "2468f40830e603a5ef65c5a4a75774831a03643f4e1f2d36a59b91b33e120f62" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged-result.json", + "bytes": 1261, + "sha256": "5c0b4007b236cca3981b92184cca68e37fd588352a258b644a706a3d6a3f400e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged.stderr", + "bytes": 939, + "sha256": "02758b2de148504b6166949b21120de6942b52e6498426fc2f3a728176341dd1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox-staged.stdout", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox.stderr", + "bytes": 1008, + "sha256": "e1d9cc43e2d60aa897b3a54d4c72e261a5a92f56006a9c43a08bde5006c820c3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/sandbox.stdout", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/regression/shop-input-receipt.json", + "bytes": 1022, + "sha256": "2c1f18f2e7480d39c14a278294c6b2cd8c5e24703dc643fb2755031268273bbc" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/MAIN_PROOF_INDEX.json", + "bytes": 31034, + "sha256": "eef91849447fb0c3ee74a3a9c88a34bb72067aa8f4138f533c783da87d35eb88" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/QUARANTINE_BOUNDARIES.json", + "bytes": 1883656, + "sha256": "5503ef19d06be12bd41eb0803214c11201fa59eaaf3038609901f1782d2a045b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/REPORT.txt", + "bytes": 8882, + "sha256": "37d2d3fbe1fda354110f3ffa0ed23a3c041c0d1501a73428faf9e360f90ca6c5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/RESULT.json", + "bytes": 1321, + "sha256": "143d7e9520a13bce56121a12149c41236fc47a2bd8b48c2b0f5f061c6d11d4c3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "bytes": 15209, + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.sha256", + "bytes": 80, + "sha256": "6ab6e5ee4971ee4b705ef0bcd61a7786cce9a8510956902bf5c8d46005edc95f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/AuditWeakenedWitness.lean", + "bytes": 1996, + "sha256": "e371bdfc23bdce4823e34a6ba256f20b8786def91aaafe7fc4bed771119fc668" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_false_premise.lean", + "bytes": 2937, + "sha256": "bc649d9293515f6a1f707503b0883fb6ea2b845c20fccd9f42f3dee6216215e1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_honest.lean", + "bytes": 2923, + "sha256": "7e3db1846b209bf1b1c4309ccc319d70eaca67932ceff91c2e1eb5183ba79c75" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_native.lean", + "bytes": 2923, + "sha256": "b7c80d76545ac4de9cd065cd23b65e9363a6e9585469f445764d138772c1c20b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_sorry.lean", + "bytes": 2921, + "sha256": "f05c64a3378544e29d991af8346187542dd50938e2488132152e1179a8af500e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/Audit_unused_axiom.lean", + "bytes": 2935, + "sha256": "17e7bd63d299fb6ca43b4b791d75268499a1af711bc82aa3fbcc2a56da941175" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_false_premise.lean", + "bytes": 61, + "sha256": "90c2c80bb3fbc9cc7ae30816d050ae5d0eac8903b3d2455136b48ebea7281dc0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_honest.lean", + "bytes": 56, + "sha256": "d8099911accbf7a768892136256820e31afa9158d8d15c92d7437bb695a53295" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_native.lean", + "bytes": 75, + "sha256": "4c5529b6c627afca507e031a24f43750a8376f5b5179b349efc4d63a24ed2187" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_sorry.lean", + "bytes": 52, + "sha256": "9326bf1f792972f852fc0449f52b530e1ebb1b6a092993dd745e873600620683" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_unused_axiom.lean", + "bytes": 77, + "sha256": "e45b7df50d35aa6fd7f9cfcd89157a664f4474fd7f11bebf2b7883afe27a914a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZNonvacuity.lean", + "bytes": 3008, + "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZWeakenedWitness.lean", + "bytes": 258, + "sha256": "810e160d7666b4ad02f616ff0e02502bc2d83bd99f934d692aa7a420b2b05c07" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/MissingModule.lean", + "bytes": 2929, + "sha256": "c14bbecc2f99170c2c56c3e2865493a89a144a55927bc036c751e7f5ad3a039c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/SelfAudit.lean", + "bytes": 1986, + "sha256": "d9a5c1d0b99420d6731163698f53a83253cb9913c5e1a793d7c12e3df6005bdd" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WeakenedWitnessContract.lean", + "bytes": 542, + "sha256": "ce758e7ce7d3c30865f9ccc01b1f6f27d582e6ff5e9d5f411a09daaa9cc6fcf7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/WitnessTypeContract.lean", + "bytes": 537, + "sha256": "613a79ffe608808ca7b2a4e06e76453b72b390116adf4d880b50106ab7c34596" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/all-declarations-and-witnesses.log", + "bytes": 10360, + "sha256": "dcc81dc13a6dce4b25a6300fd616966e835877f124b8e6448b452878df9673ea" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/auditor-module-census.log", + "bytes": 1028, + "sha256": "6b9bf4260474d13fb392b71b0fa3b3dadc75fc99fb06310b9caaff31feb3ce4c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/false_premise-audit.log", + "bytes": 538, + "sha256": "424799495dafb2dac297a8206c364a73e8c41bed48ac772b0e806443811bfac1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/false_premise-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/fresh-kernel.log", + "bytes": 36, + "sha256": "765e0f77863dc012524cd125d2699754f19e967f4ec35908a2aed7903057572e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/honest-audit.log", + "bytes": 485, + "sha256": "62390300f3aaa05474dd1d9b75e47728635f0e2c4b0b49dc9daf0914ec506d87" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/honest-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/missing-module.log", + "bytes": 450, + "sha256": "2d9fdde838c729bf8630456eec1033381833a4a2eb42c8f07ca910d9d636f121" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/native-audit.log", + "bytes": 502, + "sha256": "468963ce795fd68a13b99e1e5b9e90e817f273fe2099bda696deb61552697200" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/native-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "bytes": 26957, + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/sorry-audit.log", + "bytes": 441, + "sha256": "938f55996c45f78c29d90750ce73a1cfba8bd488b34f5b9e99ced19993bab2f4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/sorry-compile.log", + "bytes": 136, + "sha256": "693c90261e9a6a2c68216209a5692f39ee06659d9a50919b2e551ffbd8f8deaa" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/unused_axiom-audit.log", + "bytes": 581, + "sha256": "972d65c1ff8afddb2e2f9024fbaf972b80292d7b9c0d774f8d946dee28fc12f6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/unused_axiom-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-audit.log", + "bytes": 665, + "sha256": "3da011e5e28b010ac0851c66e96f3c3d7f501dbb8febcf944f597f239d4412d4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-compile.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/weakened-witness-contract.log", + "bytes": 1180, + "sha256": "727a132984645d32ac0f4607e61132c096ab4aa1dfe82bcfe9ad4756744d9346" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/witness-kernel.log", + "bytes": 24, + "sha256": "ab7e01501bc759b00ba24bb39ea9d9bf5e475a179a06f32ee13f3cb1bbc2492d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/witness-type-contract.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/Audit.lean", + "bytes": 1837, + "sha256": "09b59390c165b16d1c7b5bae189da6b806d79e8491ee0df1e2e83bb911674c71" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/Types.lean", + "bytes": 1648, + "sha256": "e235933f1ff52b448b3b80952f7ec9ac932723520c22766e85dd81046d558884" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/axioms.log", + "bytes": 2375, + "sha256": "856d934eabb250bffb96085454fc04b3ddd64a47bb92829728f7d5bb7d286d0c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/build.log", + "bytes": 237, + "sha256": "6a7ae1a06694eb7d44106bbd4e578aa965abdae391a1678ac0a14ec7e0b0908e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.lean", + "bytes": 146, + "sha256": "dc222fa20546b3443101625ac0793b3cd9e2cd563af489b8db03990e11afd6d5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.log", + "bytes": 46, + "sha256": "6e7f917c7fe2fdc3efe1943dcc327c56acadd0b0ca96507a4327073fdfd2f083" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/elaborated-types.log", + "bytes": 25152, + "sha256": "10a954ced98371c5cf98eecada196d50c1e6e570af9ea8e07caade4a80b0aab8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_covariance_bound.lean", + "bytes": 7025, + "sha256": "621b585e6a025d9a606cc21c7dfdd2dbc5095b432d4e51d7ea9b2b713a637030" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_covariance_bound.log", + "bytes": 224, + "sha256": "3e9f3d67aa666c88ed8e2b0b126163336cd5982dee6ce21b1118fa200292a4dd" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_eigenvalue_third.lean", + "bytes": 7025, + "sha256": "1380775e4a2dc33ffb8c126dea5d2194ed7bdf7428b6d9d3dca1f8a3addafcb9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_eigenvalue_third.log", + "bytes": 192, + "sha256": "fda3cc4e985c3309e132c150d4ba988a4d4699095ef2f0cab010dc8e2a5094b2" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_endpoint_adjacency.lean", + "bytes": 1940, + "sha256": "f3874de8ca4cab2016d51822373ea1932fcf64b233bec9b653e6a73360a19c0c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_endpoint_adjacency.log", + "bytes": 221, + "sha256": "62af9c46e66215424a5c82c4a1ee83700bbe7ca84906c14400cc4bfdcd5b276a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exp_partial_sum.lean", + "bytes": 7025, + "sha256": "c3bd8d4579b8f23a53e7185bd74e44e3a09b92fe904c61a25ddb3001a33341a4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exp_partial_sum.log", + "bytes": 221, + "sha256": "a82d1d1651352ec73a73ee7ad17a596d225fc808b9a3723dbbdd41f982f5328e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exponent_bound_d3.lean", + "bytes": 7025, + "sha256": "2822b2cce0cf09eccc1926df9be7b48d06a0747a5b79bf14d5187057ea10c588" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_exponent_bound_d3.log", + "bytes": 262, + "sha256": "bccf477ff397333506812af1a4a1475a3716f50a0ac0f3a20de77b421064b78d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_trace_variance.lean", + "bytes": 4409, + "sha256": "07963f41f4b3b682042b048a8133b8315ecfc47f59a441d9684d075585cc18b4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/false_trace_variance.log", + "bytes": 265, + "sha256": "685a68785e68c9590b0479754dc6479d4e1be7a9f89b29a40bfed17c24a376bb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/leanchecker.log", + "bytes": 0, + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.lean", + "bytes": 100, + "sha256": "7a79ea6c867f3a79ef2474d2290e7265ab56a775212c6e67dc1bbad9e4334f37" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.log", + "bytes": 70, + "sha256": "8a0b9f79f3265724af58b27461627f9d532535f8a23681361da731c9ea37c101" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/preflight-version.log", + "bytes": 106, + "sha256": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "bytes": 4378, + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.lean", + "bytes": 80, + "sha256": "8d3b8320eba70953d8de1bc5665cd3665d0d1dfe90f783a7270b1bb1bfab353e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.log", + "bytes": 168, + "sha256": "50c0e4557dee071a09d39a848a5eb54324115cd8958a4564f1e845380a64677a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/version.log", + "bytes": 106, + "sha256": "355a9a028f81641782d75d6e6b58dec70f29d2f61238a9e271690259d9bf5680" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/wrong_image_constant.lean", + "bytes": 7025, + "sha256": "bb6e6665b42659821261de1b84674ef6a0a19811e8599671f9a7d2d90e81eb77" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/wrong_image_constant.log", + "bytes": 204, + "sha256": "56114d671544669de953160f6688ba962a052a17b8a00e614dc5cdab711744b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/main-latest-17-source-preservation.json", + "bytes": 3659, + "sha256": "924affa17b07d78efb9aa612bde8f10a9227660db9ab78af3af88e23419f2038" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-full-main-run.exit", + "bytes": 2, + "sha256": "9a271f2a916b0b6ee6cecb2426f0b3206ef074578be55d9bc94f6f3fe3ab86aa" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-full-main-run.log", + "bytes": 511, + "sha256": "b4f578ceb447f3c447c89b114f02b54b3b878784f7f7bd9b775eecc45820958a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-reviewer-original-probe-rejection.log", + "bytes": 665, + "sha256": "2fd63f0be170493a6f41b2d6e39f3e5f8b4a5adb80224087766a3971b6d36735" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-tests-green.log", + "bytes": 2562, + "sha256": "39c8ddcf0bef091f78841a14e109d6afdb31053b02490afee04e2acc0db5c1d3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/r3-tests-optimized.log", + "bytes": 2562, + "sha256": "cd92d4ffedf3b4f9d47aa065c341071a2488599f605ae1694b7b71856ed6be78" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/ALIGNMENT.md", + "bytes": 7923, + "sha256": "059fcf3b501e2a6e73b3c20c6294eb57467ffc9118db696e05c8c3fcd7b2fa75" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/GLOSSARY.md", + "bytes": 10035, + "sha256": "342d4efb374fea31c39e51f8f6bcdbc50d7fb5fea1fd393eda21afff92c62fb8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/README.md", + "bytes": 9154, + "sha256": "137e7c7ed44d732042d803eb4a0ee75f9ddc6475950a2bb6226a7711a44be14b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/REVIEW_LANE.md", + "bytes": 5151, + "sha256": "54d32104aa012e917ef40b73fa3a40228d023249b339cf30fe4bdb7dcbfed414" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/SCOPE.md", + "bytes": 6279, + "sha256": "fd06700628b1fbc81c5cfe3786aaa455032375bcb879914f068a66b726802a17" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/ConeMoments.lean", + "bytes": 4409, + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/Endpoints.lean", + "bytes": 1940, + "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw/Side24/Ledger.lean", + "bytes": 7025, + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/UniversalLaw.lean", + "bytes": 586, + "sha256": "cb94ad3490a00bc35b420a53a42ff65b6fc66a46b8a26ef1b87035d7bb15587e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lake-manifest.json", + "bytes": 144, + "sha256": "562d38ad95598486b2b592e6d072d5d3212735bfeb1cb6d8eb8ec04492522ba2" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lakefile.toml", + "bytes": 464, + "sha256": "58f0fa6864cc03e9bcbef2d8c0404e9f3385a30a6124000454319367906cbe4a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/lean-toolchain", + "bytes": 25, + "sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/manifest.json", + "bytes": 18104, + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/reviews/README.md", + "bytes": 906, + "sha256": "333ca71e7c676cee89e5d01cd61999c21bb0584e41d6bdacb18afa410109f95d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/reviews/TEMPLATE_alignment_review.json", + "bytes": 1061, + "sha256": "e722e928ca43c16981e063d8eb1c91e9bf8c683241d9dcf156400a419e72feb3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/sources/side24_v1/ENCLOSURE.json", + "bytes": 1090, + "sha256": "72b6cd92d31394cdaf5da8919a5d548e902228af1f095cc184158a71d8287811" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/formal/sources/side24_v1/PROOF.md", + "bytes": 10272, + "sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tests/test_cbz_lean_check.py", + "bytes": 6992, + "sha256": "8642d2bb63acf3d9ab56c89dad4132449f6b9b964431ca14ce9cf52ed3eac3d6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/CBZNonvacuity.lean", + "bytes": 3008, + "sha256": "b9f29f231bb41ff6ffc896230c5c23b358cf2527ebd33a576d3c6d96a0ded49f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/cbz_lean_check.py", + "bytes": 14610, + "sha256": "a0c4b544da423a741e8d8a4590fe28878c8f77b19b35c786e61a4e6948d6796d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/source/tools/formal_gate_check.py", + "bytes": 23845, + "sha256": "1125e435429f0a7391d6b076c99f1198bf862376276f6c00c91b5ea4f6a88ec5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/toolchain-runtime-archive-verification.json", + "bytes": 978, + "sha256": "75932d8d2d5461188f48b9184ecea495599213e7e18dc52ef397adc01dda797a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/STATEMENT_ALIGNMENT_GAPS.json", + "bytes": 7944, + "sha256": "ceb1d7453cd4c2ba9b5371bfcddf0c771e19184bb7aa2263ba18ab8170b7c145" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/TOOL_REGISTRY.json", + "bytes": 11225, + "sha256": "f6b6ff72a0664cb55dc33232ac1837e43213f3e04d957ec4772bba05696dde64" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/main-git-source-bindings.json", + "bytes": 2935, + "sha256": "db0bc4cd3423a9963f079822b2a5e15fccd41034e80c1f327fdde46eb63d1d06" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/main-tests-with-pinned-toolchain-optimized.log", + "bytes": 5768, + "sha256": "e19602624139f448f96088401ffb98c03656c780da40fecc05a71f18b1f4bda0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/main-tests-with-pinned-toolchain.log", + "bytes": 5768, + "sha256": "69c2ff08ecfee460dd31bdccedcb1be7e7d964079c3dfc77f5a2372bfd3536ed" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/math-resource-boundary.json", + "bytes": 299, + "sha256": "e9c0de125e30f85dba38be349194493d3901e3e55c02c3e098d3e7c5ca54af8e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/portable-main-receipt.json", + "bytes": 25873, + "sha256": "8de0eb40af25a4e4bc2342e6ec3dc057299385e1baae99610186c6161e0b06c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/portable-tests-green-final.log", + "bytes": 1901, + "sha256": "00e8f0897db38c104f786054e5ad5e39ae9781fa3a3c61cba9914a7057314878" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/portable-tests-optimized-final.log", + "bytes": 1901, + "sha256": "a02b3ba1b56d368d7c927dca9dd09b78c6650cdcf6996f22a0697abfc319f9fe" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/COPY_MANIFEST.json", + "bytes": 29289, + "sha256": "e8de32619c854819c3580de5e78023c60e5e134d68f34652f1be56b2c2bb0264" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/DEMO_D1_EVENT_TRACE.json", + "bytes": 416, + "sha256": "9073ad7a32928fab9360dad41592e2686f45c7f7c0cd279839637d013ffb67e5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/ENVIRONMENT_V17.json", + "bytes": 1347, + "sha256": "2db336881cda309c300ecb58250502c6a6c91c7e6cce49694f12d72f9965656d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/LOCAL_EVIDENCE_NOTES_INDEX.json", + "bytes": 2762, + "sha256": "66069be95ff492ea281d772c8af861a80055c60c3c12932fb93e110b8588602b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/SOURCE_REFERENCE_INDEX.json", + "bytes": 51576, + "sha256": "819ab42fff6e0d842ad005e313ce7881745b66c4b98d08bb3d251f82df51d6fc" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/certificate_schema.json", + "bytes": 4628, + "sha256": "94c47d41688b014b573ac8bd258dc78c406efe694fff94b4e03e0d1e9e72dea6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "bytes": 396561, + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/external_theorem_sources.json", + "bytes": 1349, + "sha256": "dd33c4ec03e4c189f65516a84d470be297228628ba0519fe4e73736d7387c724" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/frozen_v14_proof_hypergraph.json", + "bytes": 349355, + "sha256": "fe6a1159c885ebee2c9dc38308df9a16d0a517b037ebb0a1ac942a8b595d686d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/COVERAGE_REPORT.md", + "bytes": 1183, + "sha256": "c20631d1ac4c5472905e7ff51ca8fef1e9fedb0783b6906ac4850f2e45ad7fef" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/LINEAGE_IMPACT_v11_to_v12.md", + "bytes": 1879, + "sha256": "dc3fd4b7a3b7a06b15c9df9185c619f759ee855f74b08427515c11d7e79b9830" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/NEXT_VERIFICATION_TARGETS.md", + "bytes": 1182, + "sha256": "ff101af720afe63a0605f6c03ea5bbdcfca0b546154a06e86d07f6457cc921b2" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/SOURCING_LEDGER_v11.md", + "bytes": 1522, + "sha256": "5ada539c1dd60ab30fe08b814a575feded5b075f87f0f3cfac1aed426e230fd9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/SOURCING_LEDGER_v12.md", + "bytes": 3832, + "sha256": "9b38837d3b92962db3fdc44e7a69559910c6023b38a1388fb2c4cedb99011404" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/VERIFICATION_REPORT.md", + "bytes": 3022, + "sha256": "042977aae31eac45803d410e564747aa35984679a5ac92e944a05d47ee2e79f4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/acceptance_evidence_ledger.json", + "bytes": 65862, + "sha256": "f8721930c9b244db31a7b638a0b8f1d4bc332452a36d7480d08620b2e54fe813" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/historical_source_ledgers/independent_verification_ledger.json", + "bytes": 47083, + "sha256": "69d257ea9243986f0b08263870a62fa048f84d3eea2307c5bebdb0d15e10f4cb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/import_applicability.json", + "bytes": 25570, + "sha256": "31ce56ebcbf974f66b79b5c5082e71392a3b8617d60d74d1a175bd21a99e4ca3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/local_exact_receipt.json", + "bytes": 674, + "sha256": "2253d09632119577171f676294c0b43d8bc7f05dd66a03cb5de629f4293c54dd" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/manifest.json", + "bytes": 37402, + "sha256": "6f4ae83d9ec7bb1ddb9f852328a2314c703239a1ddca90f4e251a58eab26079f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/runtime_schema.json", + "bytes": 1804, + "sha256": "204adedc01ed0e44a6cc2d023bd279bd666c07b1b99aaddd2e490643fcf58a29" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/schema.json", + "bytes": 2324, + "sha256": "643905022fe7b057c2acc6b8375e3e9c02a3eed51c0e635a8dc89783f022830f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/source_provenance.json", + "bytes": 113219, + "sha256": "e0174b1c9e3a3786c71fe06c4f143b60ee5549af59f3f636006a77b63ea2d080" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/source_statement_comparisons.json", + "bytes": 135876, + "sha256": "011ae5cc0773c8ca26323f010d4edda5533c08605c49e85ed7347ea9cb284e11" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/04cf4c986f29ac7ac33b3cc87feac23f3cf494e0c1b3bf4476e4e6666de46574.raw", + "bytes": 10073, + "sha256": "04cf4c986f29ac7ac33b3cc87feac23f3cf494e0c1b3bf4476e4e6666de46574" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d.raw", + "bytes": 15902, + "sha256": "079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc.raw", + "bytes": 15160, + "sha256": "0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432.raw", + "bytes": 12536, + "sha256": "14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b.raw", + "bytes": 17646, + "sha256": "1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/21ce7a29ac0971919c0602f556f1aeba48bb14fffd4193864b3f482185bc1698.raw", + "bytes": 13835, + "sha256": "21ce7a29ac0971919c0602f556f1aeba48bb14fffd4193864b3f482185bc1698" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/29a0c6d00ce739baf1d29a3163977d8e707e2079e216fba4fee3669cebec127d.raw", + "bytes": 12741, + "sha256": "29a0c6d00ce739baf1d29a3163977d8e707e2079e216fba4fee3669cebec127d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/320bc988c468bea4938bb777a2d05952c6ab8e0a384f33725b50de847aeec1eb.raw", + "bytes": 30935, + "sha256": "320bc988c468bea4938bb777a2d05952c6ab8e0a384f33725b50de847aeec1eb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a.raw", + "bytes": 17734, + "sha256": "380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/3d938d2223d99f7a8dbaa005b9eb3769813a6f8099a7780200ef048049637c82.raw", + "bytes": 8500, + "sha256": "3d938d2223d99f7a8dbaa005b9eb3769813a6f8099a7780200ef048049637c82" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/3d952a906553d578876456539a8f0dcd64aedd45099e8394cbe9db99866ec531.raw", + "bytes": 43927, + "sha256": "3d952a906553d578876456539a8f0dcd64aedd45099e8394cbe9db99866ec531" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da.raw", + "bytes": 23312, + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/56c0b94f9b1fcc1207b8e0bc4d1a7e89b6cba7b285fcbf550fd8dd1d9c30f3e1.raw", + "bytes": 9344, + "sha256": "56c0b94f9b1fcc1207b8e0bc4d1a7e89b6cba7b285fcbf550fd8dd1d9c30f3e1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f.pdf", + "bytes": 326691, + "sha256": "636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f.txt", + "bytes": 80857, + "sha256": "daa4b4918c7fe951a7bfd233dffaef101e58755e34009fa4593f9445bc9cd2c4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/65a1037f270b22fc776ac4fb85484b118fe9c8d79f1036ac6c70045180e2a744.raw", + "bytes": 7320, + "sha256": "65a1037f270b22fc776ac4fb85484b118fe9c8d79f1036ac6c70045180e2a744" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/69ea7a479a9e8a5150cbe07b373772ab22413a1d81194d5a6a78adf6ada5f03f.raw", + "bytes": 15925, + "sha256": "69ea7a479a9e8a5150cbe07b373772ab22413a1d81194d5a6a78adf6ada5f03f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80.raw", + "bytes": 53727, + "sha256": "6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/767688188b02cda022fae2c411583559ad8f96b3a318293df1c2db8193302706.raw", + "bytes": 2682, + "sha256": "767688188b02cda022fae2c411583559ad8f96b3a318293df1c2db8193302706" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/7a425f7119dd8a0701fb241769a3e82d80fbd6b148d074f11e1015e826813268.raw", + "bytes": 15923, + "sha256": "7a425f7119dd8a0701fb241769a3e82d80fbd6b148d074f11e1015e826813268" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/7ff9e4a028f24afc731200b14bc5b993c0a874906cf6ea25e8c890afed8cdc53.raw", + "bytes": 15615, + "sha256": "7ff9e4a028f24afc731200b14bc5b993c0a874906cf6ea25e8c890afed8cdc53" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/830637948365dae801c4ec8382310c7bd69c0ac5735996d7854642e4d698a99d.raw", + "bytes": 1056, + "sha256": "830637948365dae801c4ec8382310c7bd69c0ac5735996d7854642e4d698a99d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/83f653393dc6245980f6848e2bfc65ac9ad4c7d8304b028b88764356fd3825b6.raw", + "bytes": 3272, + "sha256": "83f653393dc6245980f6848e2bfc65ac9ad4c7d8304b028b88764356fd3825b6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f.raw", + "bytes": 9062, + "sha256": "845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9.raw", + "bytes": 11352, + "sha256": "87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/8b9376a69fda9f0f231d9502be839ae45d8006d1891ff3e700fa521cc96f6cb4.raw", + "bytes": 10858, + "sha256": "8b9376a69fda9f0f231d9502be839ae45d8006d1891ff3e700fa521cc96f6cb4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/8cf417db179ac66fe44018d42d16bc055355c9d075349ed8ac9b3dd72fd4859f.raw", + "bytes": 7620, + "sha256": "8cf417db179ac66fe44018d42d16bc055355c9d075349ed8ac9b3dd72fd4859f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/910d371ebb4a310a7e2248348ba8cd09d6f3229740525d74ec7d06d8d1470717.raw", + "bytes": 3723, + "sha256": "910d371ebb4a310a7e2248348ba8cd09d6f3229740525d74ec7d06d8d1470717" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7.raw", + "bytes": 40261, + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7.raw", + "bytes": 18355, + "sha256": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b.raw", + "bytes": 53364, + "sha256": "aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/b529fe3780e1909014b3cb144b9a74156d976bbdc19b6711d0c5b1a1da9e5669.raw", + "bytes": 23971, + "sha256": "b529fe3780e1909014b3cb144b9a74156d976bbdc19b6711d0c5b1a1da9e5669" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/b7328d4bab97fa2d12622ca730dc698970febc1ea8bcbc0b24555e69e2a66392.raw", + "bytes": 24105, + "sha256": "b7328d4bab97fa2d12622ca730dc698970febc1ea8bcbc0b24555e69e2a66392" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/b7ce509af57b1bdc999813927ee39a4fe12d52fe2c9669e249dddfa30ea3144f.raw", + "bytes": 4138, + "sha256": "b7ce509af57b1bdc999813927ee39a4fe12d52fe2c9669e249dddfa30ea3144f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2.raw", + "bytes": 26002, + "sha256": "b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028.raw", + "bytes": 1782, + "sha256": "bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769.raw", + "bytes": 10272, + "sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9.raw", + "bytes": 11467, + "sha256": "c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733.raw", + "bytes": 18174, + "sha256": "c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c35de0d50d9f0b7df664d8f3b4c41d7ddcbfcc5ed251c31b309e9c3532fd7d75.raw", + "bytes": 12345, + "sha256": "c35de0d50d9f0b7df664d8f3b4c41d7ddcbfcc5ed251c31b309e9c3532fd7d75" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb.raw", + "bytes": 11811, + "sha256": "c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/c8bd489ca3fbb3760f7b2d53e7385131ac5336c51ba983e00e4d540fe2f00aaa.raw", + "bytes": 34629, + "sha256": "c8bd489ca3fbb3760f7b2d53e7385131ac5336c51ba983e00e4d540fe2f00aaa" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/cc0f49b407337af0e1ce232b0ca2aa9f611ae7a1ecf1c74f2d430d6490336445.raw", + "bytes": 5223, + "sha256": "cc0f49b407337af0e1ce232b0ca2aa9f611ae7a1ecf1c74f2d430d6490336445" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/d28aa700ba83ca139b7b29b6ff06cc39c725470b710af10728867ec10c8ca985.raw", + "bytes": 7620, + "sha256": "d28aa700ba83ca139b7b29b6ff06cc39c725470b710af10728867ec10c8ca985" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05.raw", + "bytes": 16948, + "sha256": "d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/e3bb8751fbdaf0db075342a31dd208c1300c6e93a1c3c8a7c3b255860442551b.raw", + "bytes": 3700, + "sha256": "e3bb8751fbdaf0db075342a31dd208c1300c6e93a1c3c8a7c3b255860442551b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/f821d911aaba767677f341f4b6510e05fc39e15238d5e4f656e5000644293f58.raw", + "bytes": 3691, + "sha256": "f821d911aaba767677f341f4b6510e05fc39e15238d5e4f656e5000644293f58" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/f8289546ee82fb386a0d0b6b54fbb99f258a2dc2a959ae231ae80cb4baa61e1e.raw", + "bytes": 3912, + "sha256": "f8289546ee82fb386a0d0b6b54fbb99f258a2dc2a959ae231ae80cb4baa61e1e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/upstream_sources/fa6d443fd5eeeb21c0d311de4d11eb5b406758f3c5ff09a222d02ba54bd0752c.raw", + "bytes": 17658, + "sha256": "fa6d443fd5eeeb21c0d311de4d11eb5b406758f3c5ff09a222d02ba54bd0752c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/verification_report.json", + "bytes": 5429, + "sha256": "eb4c9ac3ec35e1d75b09a5bb1e62f4843aaea2dfa47a28dafd89d087f9b63ebf" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/math-source-manifest.json", + "bytes": 61009, + "sha256": "afb0ee38b0b43f42d716f795352a895b7859d2c409cd2e2fed142cf60049c983" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/prior-decisions.jsonl", + "bytes": 28677, + "sha256": "38c13b2c242036818a8402df8ce0ddb4c59e9e55521e09a971abdef3d5ba000a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/G0.json", + "bytes": 50479, + "sha256": "2a37797d56ce03cf45fdb32d29e514af5d7693c3398a88d6cd36764a34cdf7c1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/G1-main.json", + "bytes": 1083257, + "sha256": "f7ad53ffd6a6a6f13e2d5ab78b72900502b87357085a55168bf5623be9f2e81c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/REPORT.md", + "bytes": 10024, + "sha256": "77d7ee301826270d38147a824c69c0797c4ae8d8d99f1630ff6030900668b47a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/TOOL_REGISTRY_ENTRY.json", + "bytes": 2972, + "sha256": "3736a90029676cd50538a599055b0397aaea1120f72fc411a851b1b670b82443" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/COVERAGE_REPORT.md", + "bytes": 7587, + "sha256": "83fa0fae7502141455648613ec386b1c8ead1a6a00cfc95cf047870c66d00d46" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/COVERAGE_TOOL_REGISTRY_ENTRY.json", + "bytes": 2189, + "sha256": "8a613c91b1de22723f69623bc9518bf8d64b288791a3e0aed0da5347b1d3d50c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/G1-main.json", + "bytes": 1083257, + "sha256": "f7ad53ffd6a6a6f13e2d5ab78b72900502b87357085a55168bf5623be9f2e81c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-archive-quarantine.json", + "bytes": 133547, + "sha256": "7eef614f9de950131e8e05ea351632e3de20d8ed8385f5a2a75dc7975ff9983b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-boundary.json", + "bytes": 93155, + "sha256": "0b5790b670942729517441315dca9d2c73dcdbed79a70e1475c299a201651edb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-containers.json", + "bytes": 1243975, + "sha256": "e3b4c6ef63c6b1583494b036a56f943cbb6381784e4c5f27d05759d52b2f82d7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-dispositions.json", + "bytes": 227255, + "sha256": "cf8b4741d99514471158d71ebeaacd683300098685738a7144d7fbba56103520" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-selftest-missing-total-budget-test.json", + "bytes": 8681, + "sha256": "83dd5bc5e1e096a04f3509d2c256fc903c1ba5c87f583851ae6bdb9aa0830d69" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-selftest-proposal-replay.json", + "bytes": 10935, + "sha256": "11376eac395a4f09fa4a527fff7d572993ad34462d0cf31e71d33241ccdbb453" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-selftest.json", + "bytes": 9846, + "sha256": "263f65ca8c6296661e13c9ed4ea0f7f1b46affb95f804808f00a47faaf66cbda" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage_boundary.py", + "bytes": 6205, + "sha256": "f757d7aad6baacba99f83364140bb1a1a891f927498d6819fdd1297186e6f4ed" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage_companion.py", + "bytes": 15472, + "sha256": "adb20234c60c017a07a6411f4fa559b8552a59ae6ebb56f9753c3ecce53bb518" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage_selftest.py", + "bytes": 2588, + "sha256": "95dd8b7bc5290f4a23b21578a1c25c8322b5adf0eca19f9e3cb64d175afa3fc3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/test_coverage_companion.py", + "bytes": 6206, + "sha256": "744b429d553d044063cc3a3bb99d8979a017ccdabb16c1d1d0c5257a26f7e8e4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/selftest-negative-controls.json", + "bytes": 25337, + "sha256": "83818e641ab66c56be9695ba20dfae3f596424e95d037bd2ee8013fb6745231c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/baseline-tool/actual-cold-start.json", + "bytes": 221, + "sha256": "84f90063efd06b880ea3b71ab6d036de07b5b7c66ead2fbc2216500bbc88c245" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/baseline-tool/actual-inspect.json", + "bytes": 3165, + "sha256": "3a282789b4cad029b1d40810ad38ce385d1a4add956635054531845020f7a2ba" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/baseline-tool/proposal-final-cold-start.json", + "bytes": 221, + "sha256": "84f90063efd06b880ea3b71ab6d036de07b5b7c66ead2fbc2216500bbc88c245" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/baseline-tool/proposal-final-inspect.json", + "bytes": 3165, + "sha256": "69b2943e7c4c9f2e241cf9bcca41abe0d9913ee781381f46577d3daf9cc91dd4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/current-tool-selftests-optimized.log", + "bytes": 15535, + "sha256": "25f3a9abeb405b1452e46abf53f804bfd79f05cd0e68209ef3e9b2121ed89772" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/current-tool-selftests.log", + "bytes": 15536, + "sha256": "3eab3494ec0d807bff3818a58d33e79d01bdbf1451a7a37d57222c6d83e37948" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/metadata-identity/normal.json", + "bytes": 707, + "sha256": "8aa28d4e03c0b7424a389ef570ea33ab3e5de83f22ec4bc64b9ca7f53971f7e3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/metadata-identity/optimized.json", + "bytes": 707, + "sha256": "b704f0e141ff687fc04feb92b1993381c8ca8652afda1fd31d7ee59011dedf9c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/metadata-identity/source-mutation-normal.json", + "bytes": 1267, + "sha256": "f4423e7d477ab2953a92b829fc38ac744574ad884f6d2c3714b701f2ff3a4a25" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/metadata-identity/source-mutation-optimized.json", + "bytes": 1267, + "sha256": "9b35e636b5b678262e3d90ce72131ffc0eac7c5649a489704c39f15af51066b9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/cli-controls.json", + "bytes": 338, + "sha256": "6cc6a1f07bc16a9edf47b5c918121fe600ad7b7d824cd2b5f8511a829dcded6b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-closed_quarantine.log", + "bytes": 879, + "sha256": "d8d4dc1ac9f02d106d913dc3228d045091571ba6caa5ddbd39886bbc91b21672" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-custom_axiom.log", + "bytes": 785, + "sha256": "59ddf07974bb70756f5906d5a9023de002d764264ebb5492c82ae69c27990a0a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-doc_truth.log", + "bytes": 995, + "sha256": "929fc4739fd2482beeaf42d40d658d3e6e7a02f986f1eecd4ad710c95e6718ac" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-live_hash.log", + "bytes": 747, + "sha256": "219380190f518e542c74a01bc40d122e0919b893e146e709e2a8ecc9a2624046" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-receipt_binding.log", + "bytes": 1017, + "sha256": "8302f7f4f1e134ddb9d3c51f4c87c46eddce1f9aa0e8fd3ec9602072f9e911a6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-receipt_logs.log", + "bytes": 844, + "sha256": "0498c45624f0392d2d0647c26d50a86992ef2ebf9b449830ec082f887c3c4297" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutation-unlisted_tool.log", + "bytes": 791, + "sha256": "c0af6d1e506c452514362fb1a9a78d4c6cc3b9d3a95ab6bfd9a8eaacedb74e4b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/mutations.json", + "bytes": 1115, + "sha256": "fe5fc44974c10daad5e1c6c82504b7700e9c518fd79b2ee9b8b4df4c45d01550" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/positive.json", + "bytes": 88, + "sha256": "3e46d6f1e173c80e47e9c3388f4309bb03bf1e5050d09968ce8ab7612f9fe0bb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/positive.log", + "bytes": 2479, + "sha256": "e24f0841779cd4247fa3e4b856e530201cda1dba4fa5fba218bc88f1133fa250" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/report.json", + "bytes": 2225, + "sha256": "958c3428efba8012b72eebe84f71ef5b97698ead152413400f625fb850e5cc9a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/cli-controls.json", + "bytes": 338, + "sha256": "6cc6a1f07bc16a9edf47b5c918121fe600ad7b7d824cd2b5f8511a829dcded6b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-archive_readback.log", + "bytes": 1023, + "sha256": "605f22549e87248a8f9406b783db8b800691e271db908254d6ffb8fefe797313" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-atomic_push.log", + "bytes": 1446, + "sha256": "f08cd72bb53ace9501575da84563d162db615d3273023aa400b0dbddcbf516b4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-default_exclusion.log", + "bytes": 985, + "sha256": "6e40b20bb5d07ef2a543b06696dd88ce496834fe2394172106d1374639f58412" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-expected_old_leases.log", + "bytes": 971, + "sha256": "abcec1d2e065a11b0a0f6a3d06aaf9e1c47d283c60dfddd9e0e94b78472bed9f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-full_state_guard.log", + "bytes": 860, + "sha256": "bee504010c717832a94938aa307b27d9f740ab43ff800371570f39e378ae9557" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-manifest_hash_guard.log", + "bytes": 898, + "sha256": "e32924c46238d1a19e5307f521ff0f9e62e9b0d6f59dd9e0566c3316e772ec15" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutation-original_tag_ref_guard.log", + "bytes": 983, + "sha256": "a417e3c4870a35a3fa6cc4dc4214105cedd160edc0977c5dba4387ea9cd375a6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/mutations.json", + "bytes": 1223, + "sha256": "48b5742b4cd6e6021124a088f7ff19b6f39480fe5b6c14d5b64d4db6f4dc78b6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/positive.json", + "bytes": 88, + "sha256": "3a4d8e241f5a8b10f7596e60ed1b284b99adcf361a8e85a1c20d391777c9e90a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/positive.log", + "bytes": 3959, + "sha256": "7c97382d45a652349623a565859b29fbc1fd605a3e97bf8fc474e2eca678a4ba" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/report.json", + "bytes": 2629, + "sha256": "6168426c0fea393586217786c89fc9ecc84411950e4a277f7dc0a620628a4c5e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/scale.json", + "bytes": 272, + "sha256": "2d7e01b405816aa28dee4c3bf2de55650e95c25374761b88be31cfc7d5ddb071" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/REPORT.txt", + "bytes": 8294, + "sha256": "fa5de3ac887e303c34b85aef20780904b4ec33c2b3bd86e44c340eb76b0f14fe" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/mutations.json", + "bytes": 1038, + "sha256": "b00ee70bccfa8e22265dd53946307761dbd1c9a72182d667b9832580de33af33" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/registry.json", + "bytes": 1366, + "sha256": "4152e6e4ce896688d0adadb6023b71e8e6e5ddb770a4e248cd673dc0f2838209" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/scale.json", + "bytes": 272, + "sha256": "7ffce5b2cb3dd8949a5427efda90b73ac2bf24e6c8f6a1d81ce8f8a10706e6d5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/test-optimized.log", + "bytes": 3229, + "sha256": "9bf8274ba7d7b9470f3bb20470dd7e5d8eddbdfafd0fbfb00c22644e39d7605b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/ref-tool/test.log", + "bytes": 3229, + "sha256": "e66e3790ce2bccce522de32f7737438782744c3a2720f7a83def977553b7ab9f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/storage/REPORT.txt", + "bytes": 1308, + "sha256": "52296f902f4970bbea5429a65d848c4a5f9eb12fd07506296106374936ae7823" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/storage/TOOL_REGISTRY_ENTRY.json", + "bytes": 4833, + "sha256": "2828b771dd8fe29811c08b846d625b9f72c74f4c28b81f5b22ddeec13eab9d03" + }, + { + "path": "cbz/evidence/website-foundation-20261029/tool-registry.json", + "bytes": 28546, + "sha256": "5771c912c82a089d81816cab8de11fea54bcf550e46578386170d34aeb5d16f2" + }, + { + "path": "cbz/evidence/website-foundation-20261029/verification/baseline_controls.py", + "bytes": 7639, + "sha256": "ca0804fe6a56ceec5f7ee762158f59be7194b275f1b7e25b5728688f0721bc00" + }, + { + "path": "cbz/evidence/website-foundation-20261029/verification/ref_controls.py", + "bytes": 11378, + "sha256": "884b8a49ab4e2b73bf7a66ea46a813f7e466f3deeb824ff54d24f86e0d03955e" + } + ] +} diff --git a/cbz/evidence/website-foundation-20261029/BASELINE.proposed.md b/cbz/evidence/website-foundation-20261029/BASELINE.proposed.md new file mode 100644 index 000000000..0075f1c5a --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/BASELINE.proposed.md @@ -0,0 +1,23 @@ +# Partial Baseline — proposed contribution + +This proposal is Partial Baseline evidence for the single canonical queue. It contains 31 literal arithmetic closures and exact preserved quarantines; it is not an exhaustive Main obligation inventory or a complete federation baseline. + +The machine gate marker below starts every G0–G11 at INCOMPLETE. A scoped historical/worker PASS is retained in its own receipt and cannot set a final gate green. Actual source-bound runner receipts must agree with docs, source hashes, command argv, dependencies and live state. A final freeze must rerun all required gates after integration. The baseline runner must exit nonzero for missing semantics, permissions, proof coverage, tests, pins, evidence, cold-start answers or hygiene; an unknown value is unmet. + +Gate order: G0 auditor self-test; G1 full Layer A accounting; G2 all project declarations/axioms; G3 Lean build; G4 kernel replay; G5 regression; G6 declared mutation threshold; G7 cross-repository pin consistency; G8 status truth; G9 cold start; G10 Git hygiene; G11 tooling hygiene. Main's saved 31 literal kernel receipt is evidence for that scope only, and cannot close all-Main/federation G2–G4. + +Known residue includes current Math execution/kernel limits (the pinned 8,908-entry cache is acquired, but the first build hit its explicit resource guard) and seven semantic alignment gaps; broader prose obligations in the canonical queue; final regression; all remote/local cleanup and exact disposition receipts; classic branch-protection HTTP403; coverage companion/gate registry integration; and final clone/rerun. No failed test is hidden by quarantine. Further exact repairs must preserve statements and bounds. If irreducible residue remains, retain this Partial Baseline label. + + + +The exact R3 Main 31 slice has a sealed full execution PASS, 19 normal + 19 optimized wrapper tests, 7 actual controls and 4 exact witness contracts. This scoped observation is not a final G0–G11 federation run and does not change the all-INCOMPLETE joint markers. + +## Latest scoped verification at 6fc0218 + +Completed code cut: `6fc021839072d8c34f41e18e77b0f618c53baa15`. Full Python discovery:1,673 tests, zero failures,21 explicit skips. A restarted earlier attempt has a preserved incomplete log. All763 Node tests executed and passed with zero skips after independent museum/shop pin checks. Supplemental normal/optimized runs execute the10 pytest-dependent tests and the pinned-composition case. These results do not turn skipped cases into a claimed100% full execution. Sandbox setup failures remain separately recorded. + +A separate portable Lean run after regression exited0 at18:14:38UTC:31literal proofs/45project constants, four exact witness contracts, seven adverse controls and fresh kernel replay. The75-file sealed bundle binds the6fc code, ordinary baseline receipt, all19logs and checker inputs. Manifest SHA256 `ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0`. Exact receipts: `sources/final-6fc/`; priorR3/weaker-receipt histories remain unchanged. Python runtime was3.12.14; kernel runtime remains pinned Lean4.34.1. + +Joint G0–G11 remain INCOMPLETE. Complete Math gate/kernel, source-parent alignment, federation dispositions/pins/status and a real zero-context full cold start are not supplied by this scoped PASS. The separate Math attempt built AlgebraV2 but hit its resource guard on ProbabilityCompanionsV2; no complete Math pass is claimed. + +All five unmodified restricted-container controls subsequently executed and passed on the exact6fc git-archive source: UID65532, no-new-privileges, network-none, readonly source, 1GiB/128PID/2CPU limits and64MiB output quota. Setup failures/umask diagnosis remain visible. Thus16of21skipped broad-discovery cases have separate successful executions; five data-dependent real-record checks remain unexecuted. This remains a Partial Baseline contribution. diff --git a/cbz/evidence/website-foundation-20261029/CONTRIBUTION.json b/cbz/evidence/website-foundation-20261029/CONTRIBUTION.json new file mode 100644 index 000000000..1554becd7 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/CONTRIBUTION.json @@ -0,0 +1,67 @@ +{ + "state": "PARTIAL_BASELINE_PROPOSAL", + "canonical_queue": "https://github.com/d6g8k5htny-coder/main/issues/684", + "counts": { + "closed_main_arithmetic": 31, + "legacy_v20_application_quarantines": 104, + "current_math_application_quarantines": 49, + "math_group_quarantines": 16, + "alignment_gaps": 7 + }, + "all_main_obligations_complete": false, + "root_docs_modified": false, + "remote_writes": false, + "source_manifest": "source-manifest.json", + "proof_index": "proof-index.json", + "tool_registry": "tool-registry.json", + "gate_config_owner": "cbz_ref_snapshot_tool", + "final_joint_receipt": "NOT_OBSERVED", + "source_repository_git_mutations": false, + "disposable_fixture_git_operations": "Tool unit tests create and mutate isolated disposable fixture repositories only.", + "actual_inspect": "INCOMPLETE_WITH_NO_STRUCTURAL_FAILURES", + "actual_cold_start": "PASS_DOCUMENTATION_ENTRYPOINT_SCOPE_ONLY", + "r3_sealed_main_scope": { + "checked_commit": "a7f602241f759285190d8deebfefb017a6167ee8", + "files": 94, + "tests_normal": 19, + "tests_optimized": 19, + "actual_controls": 7, + "exact_witness_contracts": 4, + "full_literal_run": "PASS", + "joint_final": "INCOMPLETE" + }, + "portable_controls": [ + { + "path": "cbz/evidence/website-foundation-20261029/verification/ref_controls.py", + "sha256": "884b8a49ab4e2b73bf7a66ea46a813f7e466f3deeb824ff54d24f86e0d03955e", + "report": { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-ref-controls-final-20261029T1801/report.json", + "sha256": "6168426c0fea393586217786c89fc9ecc84411950e4a277f7dc0a620628a4c5e" + } + }, + { + "path": "cbz/evidence/website-foundation-20261029/verification/baseline_controls.py", + "sha256": "ca0804fe6a56ceec5f7ee762158f59be7194b275f1b7e25b5728688f0721bc00", + "report": { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/portable-baseline-controls-final-20261029T1801/report.json", + "sha256": "958c3428efba8012b72eebe84f71ef5b97698ead152413400f625fb850e5cc9a" + } + } + ], + "proposal_recheck": { + "observed_utc": "2026-10-29T18:06:37.695577+00:00", + "inspect": { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/baseline-tool/proposal-final-inspect.json", + "sha256": "69b2943e7c4c9f2e241cf9bcca41abe0d9913ee781381f46577d3daf9cc91dd4" + }, + "cold_start": { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/baseline-tool/proposal-final-cold-start.json", + "sha256": "84f90063efd06b880ea3b71ab6d036de07b5b7c66ead2fbc2216500bbc88c245" + }, + "coverage_finite_selftest": { + "path": "cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage-selftest-proposal-replay.json", + "sha256": "11376eac395a4f09fa4a527fff7d572993ad34462d0cf31e71d33241ccdbb453" + }, + "claim_scope": "INCOMPLETE global baseline with no structural failures; cold-start PASS covers literal documentation/entrypoint checks only; coverage 15 normal/optimized tests and9/9finite mutants only" + } +} diff --git a/cbz/evidence/website-foundation-20261029/DECISIONS.proposed.md b/cbz/evidence/website-foundation-20261029/DECISIONS.proposed.md new file mode 100644 index 000000000..e7ac24ddd --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/DECISIONS.proposed.md @@ -0,0 +1,16 @@ +# Decisions — proposed contribution + +This append-only contribution log preserves the earlier owner mission/decisions in sources/MISSION.md and sources/prior-decisions.jsonl. It does not replace the canonical queue's ledger. + +- Adopt the current owner baseline directive: immutable A1–A8, agent-owned operational simplification, actual observed gates, no approval loops or new research front. +- Preserve old STATUS bytes before replacement. The exact local pre-CBZ file, Git commit/blob, SHA256 and source URL are retained under archive/. Root STATUS was not replaced by this contribution. +- Preserve all 104 legacy records and49 current GRAPH records with full original fields. Add separate application QUARANTINED overlays; definitions/carriers, historical classifications and provenance remain unchanged. +- Accept only the 31 literal Main arithmetic declarations as CLOSED within their exact observed kernel/nonvacuity scope; broader Main prose obligations and all analytic/model alignment remain outside that closure. +- Preserve16 Math source/hash groups and 7 alignment gaps with owner none and zero maintenance. No weakening, axiom injection, false refutation claim, test removal or hidden dependency. +- At 2026-10-29T17:49:55.330138Z, change delivery to a namespaced proposal after Root reported the live #684/#685 canonical queue and later Main/prose work. This resolves coordination ambiguity prospectively; no competing canonical docs/ref/PR were created by this builder. Root retains serial integration and real remote mutations. + +Machine decision entry: [decisions.json](decisions.json). Remaining administrative work, remote receipts, final integrated source/command checks and all-Main census belong to the canonical queue and remain explicit unmet items. + + + +R3 update: adopt the exact 94-file seal at a7f60224 for the 31 literal arithmetic scope after actual full wrapper PASS; preserve old weak-wrapper history and missing baseline-copy uncertainty. Add the frozen finite coverage companion with its archived findings and limits. Canonical source freeze, full Python, final kernel seal and broader Main/Math obligations remain separate. diff --git a/cbz/evidence/website-foundation-20261029/FINAL_METADATA_CHECK.json b/cbz/evidence/website-foundation-20261029/FINAL_METADATA_CHECK.json new file mode 100644 index 000000000..72ab1ac87 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/FINAL_METADATA_CHECK.json @@ -0,0 +1,16 @@ +{ + "observed_utc": "2026-10-29T18:39:30.294203+00:00", + "scope": "finite contribution data/evidence consistency only, no new mathematical verification or CBZ declaration", + "records": 207, + "closed": 31, + "quarantined": 176, + "source_manifest_entries": 574, + "sealed_kernel_members": 75, + "negative_fixture_files": 12, + "metadata_controls_per_mode": 4, + "source_guard_mutants_per_mode": 1, + "inspect_status": "INCOMPLETE", + "inspect_failures": [], + "cold_start_status": "PASS_DOCUMENTATION_ENTRYPOINT_SCOPE_ONLY", + "joint_gates": "INCOMPLETE" +} diff --git a/cbz/evidence/website-foundation-20261029/FINAL_VERIFICATION.json b/cbz/evidence/website-foundation-20261029/FINAL_VERIFICATION.json new file mode 100644 index 000000000..0eae2f607 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/FINAL_VERIFICATION.json @@ -0,0 +1,36 @@ +{ + "schema": "cbz.final-contribution.v1", + "source_commit": "6fc021839072d8c34f41e18e77b0f618c53baa15", + "observed": "2026-10-29T18:30:36.516135+00:00", + "python": { + "tests": 1673, + "failures": 0, + "skips": 21, + "supplemental_pytest_normal_optimized": 10, + "supplemental_composition_normal_optimized": 1, + "supplemental_sandbox": 5, + "remaining_unexecuted_real_record_cases": 5 + }, + "node": { + "tests": 763, + "pass": 763, + "skip": 0 + }, + "kernel": { + "proofs": 31, + "constants": 45, + "witness_contracts": 4, + "adverse_controls": 7, + "receipt": { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + "manifest": { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + } + }, + "project_status": "PARTIAL_BASELINE_CONTRIBUTION_ONLY", + "federation_cbz0": false, + "sandbox_setup": "Two setup failures retained; readable snapshot root explicitly0755 after masked mkdir; all5unmodified runtime controlsPASS" +} diff --git a/cbz/evidence/website-foundation-20261029/GOVERNANCE.proposed.md b/cbz/evidence/website-foundation-20261029/GOVERNANCE.proposed.md new file mode 100644 index 000000000..615b23a9a --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/GOVERNANCE.proposed.md @@ -0,0 +1,17 @@ +# Governance — proposed contribution + +The current owner Crystalline Baseline directive controls this contribution. Prior operational approval freezes, review-family rules and repeated permission ceremonies are superseded where they conflict. Historical authorship, mathematical hypotheses, review provenance, unresolved findings and actual platform permissions remain intact. This proposal is submitted through the single canonical #684/#685 queue; it does not create another canonical root or authorize concurrent remote writers. + +Layer A is immutable: A1 no logical placeholders called closed; A2 no unverified/new axioms; A3 exact arithmetic/certification only, no floating-point certification; A4 no weakened bounds; A5 no removed/disabled failing tests; A6 explicit vacuity and witnesses; A7 statuses match actual observed source/kernel/build/audit scope; A8 auditors have real adversarial controls and never exceed demonstrated scope. Historical informal acceptance is not rewritten as kernel proof. + +Layer B is agent-owned procedure: perform authorized reversible work, minimize ceremony, use actual gates, preserve exact old refs/bytes before cleanup, keep one Root remote writer, and record explicit inaccessible/unknown items. No new research fronts or unrelated infrastructure expansion. A missing permission remains a tool gap, not an inferred green result. No permanent timers or maintenance owners are created for quarantines. + +Layer C is append-only decisions. The contribution decision log records the owner directive, exact source preservation, literal arithmetic limit, application quarantine, and the later discovery of another canonical Root. Source/execution contributors may self-review engineering; no new scientific independence is fabricated. Canonical integration belongs to the existing Root queue. + +The full terminal contract has 12 criteria: clean scoped Git/worktrees/stashes; no open PR/dangling branch/unreferenced unmerged tag; every obligation exactly CLOSED or QUARANTINED; complete Layer A accounting; full regression; Lean build/kernel/axioms; declared mutation threshold; consistent pins; documented self-verified tools; mutually truthful canonical surfaces; STATUS-only zero-context rerun; complete decisions/no administrative residue. This contribution asserts none of these federation-wide conjunctions. + + + +The two portable control scripts are registered in `tool-registry.json` with their exact source hashes, positive tests, mutation controls and CLI refusals. They exist to make the tested operational safeguards inheritable; their results certify only those finite engineering checks. + +The contribution identity checker is registered with explicit optimization-safe guards and portable checkout-relative paths. Its four finite negative metadata controls must pass in both Python modes; those checks certify only contribution metadata identity. diff --git a/cbz/evidence/website-foundation-20261029/INVENTORY.proposed.md b/cbz/evidence/website-foundation-20261029/INVENTORY.proposed.md new file mode 100644 index 000000000..1b3d21657 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/INVENTORY.proposed.md @@ -0,0 +1,13 @@ +# Inventory — proposed contribution + +Scope is explicit and finite:31 Main literal arithmetic records;104 legacy v20 application records and their complete original dataset/obligation/import fields;49 current Math GRAPH records and 55 edges;16 Math source groups covering 162 Lean files;7 source-hash statement-alignment gaps. These categories intentionally overlap at the source/obligation level and are not a count of all federation mathematics. + +Source snapshots: Main original formal source4ef1867175dbe1072a54a02e95f80c4e2c70a4ff; portable Main receipt f20cc54d4d136e854608853372249882eb4c949f; Math current source8151f592918a845bf19eb8eafaf8444540a32734. Exact legacy dataset, frozen graph, provenance and historical ledgers plus needed upstream sources are under sources/legacy-v20. The full legacy333-file/13.61MB tree was byte-verified externally before the proposal was reduced to needed 73 files/2.40MB; preservation receipts record the full prior copy. No historical bytes were silently destroyed. + +The separate remote worker snapshot observed 12 repositories,2,115 branches,69 open PRs,26 tags and 310 workflow records over2026-10-29T16:55:11Z–17:04:08Z. Three repositories were archived. All scoped collections reached terminal pages. Universal-Law-Workspace's 8 exact gitlinks resolved and matched its pins.json but differed from target default tips.36 unique exactpin targets resolved at that interval. Classic branch protection was inaccessible403. Native outputs remain in the external federation-inventory archive; they are not a claim about later state. + +Coordinating Root subsequently reported another canonical Root queue (#684/#685), later Main81acc060 and #691 prose-obligation work. These later observations require canonical reconciliation; this proposal does not claim a current remote freeze, completed cleanup, clean Git, or complete Main obligation closure. Root owns new machine receipts and serial integration. + + + +R3 evidence adds 94 sealed source/log/receipt records, including the matching formal-gate baseline receipt, and 13 coverage companion files. The earlier source/remote interval snapshots retain their dates and do not become current federation receipts. diff --git a/cbz/evidence/website-foundation-20261029/NEGATIVE_EVIDENCE_FINDINGS.json b/cbz/evidence/website-foundation-20261029/NEGATIVE_EVIDENCE_FINDINGS.json new file mode 100644 index 000000000..6ff79be20 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/NEGATIVE_EVIDENCE_FINDINGS.json @@ -0,0 +1,161 @@ +{ + "scope": "Annotations never suppress lexical findings or imply semantic safety; actualCLOSED import graph and source preservation in coverage-boundary receipts.", + "findings": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_native.lean", + "sha256": "4c5529b6c627afca507e031a24f43750a8376f5b5179b349efc4d63a24ed2187", + "hits": [ + [ + "lean.native_decide", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_sorry.lean", + "sha256": "9326bf1f792972f852fc0449f52b530e1ebb1b6a092993dd745e873600620683", + "hits": [ + [ + "lean.sorry", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_unused_axiom.lean", + "sha256": "e45b7df50d35aa6fd7f9cfcd89157a664f4474fd7f11bebf2b7883afe27a914a", + "hits": [ + [ + "lean.axiom", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.lean", + "sha256": "dc222fa20546b3443101625ac0793b3cd9e2cd563af489b8db03990e11afd6d5", + "hits": [ + [ + "lean.axiom", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.lean", + "sha256": "7a79ea6c867f3a79ef2474d2290e7265ab56a775212c6e67dc1bbad9e4334f37", + "hits": [ + [ + "lean.native_decide", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.lean", + "sha256": "8d3b8320eba70953d8de1bc5665cd3665d0d1dfe90f783a7270b1bb1bfab353e", + "hits": [ + [ + "lean.sorry", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_native.lean", + "sha256": "4c5529b6c627afca507e031a24f43750a8376f5b5179b349efc4d63a24ed2187", + "hits": [ + [ + "lean.native_decide", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_sorry.lean", + "sha256": "9326bf1f792972f852fc0449f52b530e1ebb1b6a092993dd745e873600620683", + "hits": [ + [ + "lean.sorry", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_unused_axiom.lean", + "sha256": "e45b7df50d35aa6fd7f9cfcd89157a664f4474fd7f11bebf2b7883afe27a914a", + "hits": [ + [ + "lean.axiom", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.lean", + "sha256": "dc222fa20546b3443101625ac0793b3cd9e2cd563af489b8db03990e11afd6d5", + "hits": [ + [ + "lean.axiom", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.lean", + "sha256": "7a79ea6c867f3a79ef2474d2290e7265ab56a775212c6e67dc1bbad9e4334f37", + "hits": [ + [ + "lean.native_decide", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.lean", + "sha256": "8d3b8320eba70953d8de1bc5665cd3665d0d1dfe90f783a7270b1bb1bfab353e", + "hits": [ + [ + "lean.sorry", + 2, + "lexical trust/placeholder token requires review" + ] + ], + "lexical_gaps": [], + "classification": "QUARANTINED_NEGATIVE_VERIFICATION_INPUT_NOT_PROOF" + } + ] +} diff --git a/cbz/evidence/website-foundation-20261029/NEGATIVE_EVIDENCE_QUARANTINE.json b/cbz/evidence/website-foundation-20261029/NEGATIVE_EVIDENCE_QUARANTINE.json new file mode 100644 index 000000000..0bb26fba1 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/NEGATIVE_EVIDENCE_QUARANTINE.json @@ -0,0 +1,125 @@ +{ + "version": 1, + "entries": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_native.lean", + "sha256": "4c5529b6c627afca507e031a24f43750a8376f5b5179b349efc4d63a24ed2187", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_sorry.lean", + "sha256": "9326bf1f792972f852fc0449f52b530e1ebb1b6a092993dd745e873600620683", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/CBZControl_unused_axiom.lean", + "sha256": "e45b7df50d35aa6fd7f9cfcd89157a664f4474fd7f11bebf2b7883afe27a914a", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/custom_imported.lean", + "sha256": "dc222fa20546b3443101625ac0793b3cd9e2cd563af489b8db03990e11afd6d5", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/native.lean", + "sha256": "7a79ea6c867f3a79ef2474d2290e7265ab56a775212c6e67dc1bbad9e4334f37", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/sorry.lean", + "sha256": "8d3b8320eba70953d8de1bc5665cd3665d0d1dfe90f783a7270b1bb1bfab353e", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_native.lean", + "sha256": "4c5529b6c627afca507e031a24f43750a8376f5b5179b349efc4d63a24ed2187", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_sorry.lean", + "sha256": "9326bf1f792972f852fc0449f52b530e1ebb1b6a092993dd745e873600620683", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/CBZControl_unused_axiom.lean", + "sha256": "e45b7df50d35aa6fd7f9cfcd89157a664f4474fd7f11bebf2b7883afe27a914a", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/custom_imported.lean", + "sha256": "dc222fa20546b3443101625ac0793b3cd9e2cd563af489b8db03990e11afd6d5", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/native.lean", + "sha256": "7a79ea6c867f3a79ef2474d2290e7265ab56a775212c6e67dc1bbad9e4334f37", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/sorry.lean", + "sha256": "8d3b8320eba70953d8de1bc5665cd3665d0d1dfe90f783a7270b1bb1bfab353e", + "statement": "Historical or actual verification negative-control source, not an accepted mathematical statement; exact bytes preserved for replay.", + "reason": "Deliberate placeholder/custom-axiom/native fixture is expected to be rejected. Main CLOSED modules import only their4 canonical files; no imports from this evidence directory.", + "attempts": [ + "Original and strengthened checker negative-control runs retained with hashed logs." + ], + "owner": "none" + } + ] +} diff --git a/cbz/evidence/website-foundation-20261029/PROOF_INDEX.proposed.md b/cbz/evidence/website-foundation-20261029/PROOF_INDEX.proposed.md new file mode 100644 index 000000000..640e0305b --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/PROOF_INDEX.proposed.md @@ -0,0 +1,15 @@ +# Proof index — proposed contribution + +This is a namespaced contribution proposal for the single canonical queue, not a competing root status or a complete Main obligation census. + +The authoritative contribution data is [proof-index.json](proof-index.json): 31 CLOSED literal Main arithmetic records and 176 QUARANTINED application/source/alignment records. Every record has a unique ID, exact source hashes, dependencies, exact boundary, closure limits and its full original record. All 104 v20 dataset records and their 104 obligations, imports and frozen/source-provenance JSON remain exact copies. Current Math GRAPH 49 and 55 original edges are retained; source classifications/reviewer provenance are not rewritten. + +CLOSED means only the exact Lean declaration string in `exact_boundary.statement`, with the observed empty project axiom set and explicit premise-witness scope. It does not mean a paper theorem, Gaussian field model, moment identity, Palm identification, coefficient enclosure, geometric carrier or prose obligation is closed. See [STATUS.proposed.md](STATUS.proposed.md) for the 31 closure/nonvacuity boundary and actual receipt identity. + +QUARANTINED means application closure is not established at this exact boundary. Definitions and carriers retain their original kinds and exact fields. An absent historical carrier stays absent; later constructions do not establish byte identity. The 16 group record source hashes cover all 162 current Math Lean files at `8151f592918a845bf19eb8eafaf8444540a32734`. The 7 alignment records preserve exact declaration/path/hash gaps and minimal repairs. Resource-limited execution does not retract historical evidence or prove a theorem false. + +Quarantine owner is `none`; no background maintenance, retries, approval queue or new research front is introduced. Reopening requires exact statement/model/carrier identity, missing nonvacuity/application evidence and an actual source-bound kernel/axiom result without weakened bounds. No CLOSED record depends on a QUARANTINED record. The actual Lean imports stay within the dependency-free Main formal package; copied Math sources are archival data. Full Main obligations outside this 207-record contribution remain explicitly uncounted. + + + +Current kernel evidence uses the exact sealed R3 receipt, matching baseline receipt, every declared log and four exact witness-type contracts at a7f602241f759285190d8deebfefb017a6167ee8. The earlier weak-wrapper receipt and missing historical baseline-copy uncertainty remain separate history. This repairs that auditor weakness for the recorded Main 31 scope only; broader source/model/prose applications stay quarantined. diff --git a/cbz/evidence/website-foundation-20261029/STATUS.proposed.md b/cbz/evidence/website-foundation-20261029/STATUS.proposed.md new file mode 100644 index 000000000..3b6ff06d2 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/STATUS.proposed.md @@ -0,0 +1,46 @@ +# Partial Baseline — proposed status + +## Baseline state + +This is a namespaced contribution proposal for the single canonical queue, not a competing root status or a complete Main obligation census. No CBZ-0 or all-gates-pass claim is made. The 29 October owner directive supersedes older operational approval/review-family rules; it does not weaken mathematical statements, bounds, kernel trust or actual platform permissions. Canonical coordination is [#684](https://github.com/d6g8k5htny-coder/main/issues/684) and [Root PR #685](https://github.com/d6g8k5htny-coder/main/pull/685). This local proposal is based on source commit `4ef1867175dbe1072a54a02e95f80c4e2c70a4ff` and portable Main receipt at `a7f602241f759285190d8deebfefb017a6167ee8`; later canonical Main and prose-obligation work must be reconciled by that queue. + +## Scientific boundaries + +Only **31 literal Nat/Int arithmetic/order declarations** are CLOSED here. All 45 original project constants have empty observed transitive axiom sets. Twenty-nine theorem statements have no Prop-premise binder; the two finite-domain cases have explicit witnesses for every admitted value (`q ∈ [0..6]`, `d ∈ [2,3]`). Four auditor witness constants use only the observed standard `propext`/`Quot.sound` axioms; no custom axiom is introduced. The sealed R3 receipt at a7f602241f759285190d8deebfefb017a6167ee8 observes pinned build, named-module fresh kernel replay, all 45 original constants, 4 auditor witness constants, 4 exact witness-type contracts and 7 actual controls. The reproduced same-name True witness weakening is rejected by both exact census types and independent Lean ascriptions; 19 tests passed normally and 19 optimized. The prior weak-wrapper receipt is preserved as history, and its absent original baseline copy remains explicitly unknown. The new 94-file seal includes the exact matching current baseline receipt and every referenced log; the old receipt is never relabeled. It does not identify Gaussian moments, prove analytic coefficient enclosures, discharge a parent theorem, or establish source-statement alignment. + +All **104 v20 application records**, **49 current Math GRAPH records**, **16 exact Math source groups**, and **7 alignment gaps** are QUARANTINED in [proof-index.json](proof-index.json). Definitions, carriers, absent-carrier labels, historical mathematical classifications and full original fields are preserved verbatim inside `original_record`; application quarantine does not make a definition false. Quarantines have owner `none`, exact source hashes, attempts, reasons and isolation. No CLOSED record depends on a quarantine. This is 207 contribution records, not every Main obligation; known prose-obligation work in the canonical queue is outside the census. + +## Cold-start commands + +From a fresh checkout of the eventual contribution commit, install Python 3.10+, Git and the exact Lean toolchain declared by `formal/lean-toolchain`. Use the official Lean 4.34.1 release (commit `5045d0056413266e57c625dcd7c365b10e377c52`, archive SHA256 `47bf4bbd78f70c2e9670598ab7124d92b6efb7330ff33e5fbb4030f6fd72e4e4`); keep inherited proxy/CA trust and place that release's `bin` on PATH. Confirm `lean --version`, `lake --version` and `leanchecker` are available. Do not substitute an arbitrary Lean installation. + +```sh +python -B -S tools/cbz_baseline.py inspect --root . +python -B -S tools/cbz_baseline.py run --root . --output /tmp/cbz-baseline-run +python -B -S tools/cbz_baseline.py cold-start --root . +python -B -S tools/cbz_lean_check.py +``` + +The baseline CLI defaults to this namespaced `baseline-config.json`; use `--config` for another explicit configuration. Outputs must be outside the source root. The integrated runner is implemented. Portable ref/baseline mutation controls and their exact replay commands are included in TOOLING.proposed.md. The saved inspect observation is INCOMPLETE with no structural failures. The saved cold-start PASS covers required headings, documented argv and entrypoint availability only; it is not an actual cloned/full gate execution or theorem certificate. The commands above are executable entry points; no integrated gate-run success is recorded. See sources/tooling/baseline-tool/ for those exact observations. The Lean command writes `formal/.lake/cbz-evidence/receipt.json` and can establish only its stated arithmetic scope. A nonzero exit, missing command/tool/dependency, missing receipt, source mismatch or incomplete coverage remains unmet. + +## Evidence and invariants + +Read this file first, run the commands, then use [PROOF_INDEX.proposed.md](PROOF_INDEX.proposed.md), [TOOLING.proposed.md](TOOLING.proposed.md), and [BASELINE.proposed.md](BASELINE.proposed.md) to interpret the exact result. Machine records bind copied source bytes and receipt hashes. The prior local STATUS is preserved exactly in [archive/STATUS.pre-cbz-20261029.md](archive/STATUS.pre-cbz-20261029.md), with its Git-blob/SHA256/source-link receipt; historical acceptance text remains history rather than kernel promotion. + +Immutable A1–A8: no placeholders presented as closed; no unverified/custom axiom injection; no floating-point bound certification; no weakened bounds; no silent test removal; explicit vacuity/nonvacuity limits; actual observed statuses; auditors tested adversarially and limited to demonstrated scope. Source scans, hashes, CI success, reviews and merges do not replace a kernel certificate or exact statement/model alignment. Historical source/evidence copies are isolated data and are not active imports. Failed checks remain visible. + +## Unmet criteria + +All G0–G11 remain INCOMPLETE as a joint final baseline: prior worker successes are scoped observations, not a final federation receipt. Current Math project execution/kernel/axiom closure, full semantic Layer A coverage, complete Main prose-obligation census, final regression, pins, status truth, zero-context cold start, Git/tooling hygiene and final administrative integration remain joint work. The earlier remote interval inventory observed 2,115 branches, 69 open PRs and 26 tags; it does not describe subsequent cleanup. Classic branch-protection reads returned HTTP403; no green assumption follows. Root owns current remote receipts and serial integration. No cleanup completion is claimed here. + + + +## Latest scoped verification at 6fc0218 + +Completed code cut: `6fc021839072d8c34f41e18e77b0f618c53baa15`. Full Python discovery:1,673 tests, zero failures,21 explicit skips. A restarted earlier attempt has a preserved incomplete log. All763 Node tests executed and passed with zero skips after independent museum/shop pin checks. Supplemental normal/optimized runs execute the10 pytest-dependent tests and the pinned-composition case. These results do not turn skipped cases into a claimed100% full execution. Sandbox setup failures remain separately recorded. + +A separate portable Lean run after regression exited0 at18:14:38UTC:31literal proofs/45project constants, four exact witness contracts, seven adverse controls and fresh kernel replay. The75-file sealed bundle binds the6fc code, ordinary baseline receipt, all19logs and checker inputs. Manifest SHA256 `ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0`. Exact receipts: `sources/final-6fc/`; priorR3/weaker-receipt histories remain unchanged. Python runtime was3.12.14; kernel runtime remains pinned Lean4.34.1. + +Joint G0–G11 remain INCOMPLETE. Complete Math gate/kernel, source-parent alignment, federation dispositions/pins/status and a real zero-context full cold start are not supplied by this scoped PASS. The separate Math attempt built AlgebraV2 but hit its resource guard on ProbabilityCompanionsV2; no complete Math pass is claimed. + +All five unmodified restricted-container controls subsequently executed and passed on the exact6fc git-archive source: UID65532, no-new-privileges, network-none, readonly source, 1GiB/128PID/2CPU limits and64MiB output quota. Setup failures/umask diagnosis remain visible. Thus16of21skipped broad-discovery cases have separate successful executions; five data-dependent real-record checks remain unexecuted. This remains a Partial Baseline contribution. diff --git a/cbz/evidence/website-foundation-20261029/TOOLING.proposed.md b/cbz/evidence/website-foundation-20261029/TOOLING.proposed.md new file mode 100644 index 000000000..5d75f56de --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/TOOLING.proposed.md @@ -0,0 +1,39 @@ +# Tooling — proposed contribution + +The machine registry is [tool-registry.json](tool-registry.json). Original worker registries/reports are preserved under sources/tooling/ and sources/lean-foundation/. Source hashes, exact commands and scope limits accompany active tools. The baseline runner and frozen coverage companion are registered. Fresh focused test_cbz_*.py runs passed 114 tests normally and 114 with Python optimization for the observed run window (see sources/tooling/current-tool-selftests*.log). The Lean wrapper changed afterwards; the separately sealed R3 receipt now verifies the strengthened code with 19 normal + 19 optimized tests and 7 actual Lean controls. Earlier 114-test run-window evidence is retained separately. This is not all-project regression or complete tool hygiene. + +| Tool | Command/self-verification | Demonstrated boundary | +|---|---|---| +| cbz_audit.py | `python -B tools/cbz_audit.py selftest`; `python -B tools/cbz_audit.py scan --root .` | finite lexical/source inventory; 43 normal and optimized tests, 12/12 finite mutants in original worker receipt; not semantic Layer A completion | +| cbz_lean_check.py | `python -B -S tools/cbz_lean_check.py`; unittest `test_cbz_lean_check.py` | 31 literal Main statements, 45 original constants, finite witness domains, named-module fresh kernel replay and 7 actual controls; analytic alignment excluded | +| formal_gate_check.py | see original lean-foundation registry; unittest `test_formal_gate.py` | existing build/kernel/target-axiom and source controls; no source parent theorem inference | +| cbz_refs.py | unittest `test_cbz_refs.py`; normal and optimized modes | 22 tests, 6 safety mutations, 2,215-tip disposable scale fixture; the fixture count is not the observed 2,115 remote-branch count. Root alone uses mutation commands against real remotes | +| cbz_storage.py | unittest `test_cbz_storage.py`; normal and optimized modes | exact immutable duplicate bytes/paths/modes and verified archive preservation; no mathematical effect | +| cbz_baseline.py | `inspect`, `run`, `cold-start` commands in STATUS.proposed.md | namespaced configuration/receipt/source/doc consistency only; missing gates stay INCOMPLETE | + +Use the pinned Lean 4.34.1 release and default inherited proxy/CA. The worker verified restored runtime/header/static-library bytes against official archive members, preserved earlier failed attempts, and observed all 9 Math dependency revisions. Math cache/build residue remains explicit; a source-readiness/static validator is not a current project kernel execution. + +Archive/source copies are data, not tools to execute blindly. The preservation/generation scripts and original registries retain their one-off scopes. No scanner, hash check, fixture, merged PR or green unit test substitutes for exact source-statement alignment, nonvacuity, full regression or scientific review. + + + +Coverage companion: original nine containers inventoried (1,042 members and 6 notebook cells); 31 archived Lean modules are QUARANTINED with 9 token hits preserved, 25 control-log hashes checked. Its 15 normal/optimized tests and 9/9 source mutations establish only the finite declared scope. Older boundary mismatches remain in their exact snapshot; the new R3 seal independently binds its own current baseline/log chain. Commands (cwd repository root): + +```sh +python -B cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage_selftest.py +python -B cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage_companion.py --root . --g1 cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/G1-main.json +python -B cbz/evidence/website-foundation-20261029/sources/tooling/auditor/coverage/coverage_boundary.py . +``` + +These commands print observations to stdout; preserve new output outside the source root. No notebook/archive inventory certifies dynamic Python behavior or source-parent alignment. + +Portable control replay is included in `verification/`. Each command requires a **new** external output directory; choose another name when repeating a run. The saved packaged runs observed 26 ref tests and 18 baseline tests passing, 7/7 meaningful mutants rejected for each tool, and four CLI refusals each. The ref run also preserved 2,215 distinct fixture tips while deleting 2,214 fixture branches. This is engineering safety evidence, not a production ref cleanup or mathematical certificate. + +```sh +python -B cbz/evidence/website-foundation-20261029/verification/ref_controls.py --root . --output /tmp/cbz-ref-controls +python -B cbz/evidence/website-foundation-20261029/verification/baseline_controls.py --root . --output /tmp/cbz-baseline-controls +``` + +The contribution identity checker is now portable from this checkout layout and uses explicit `require` guards, including under `python -O`. Run `python -B cbz/evidence/website-foundation-20261029/construction/verify_proposal.py` and the same command with `-O`. It verifies source fields/hashes and four finite negative metadata controls; it does not execute a kernel or establish complete scientific coverage. + +The additional `construction/test_verify_proposal_guard.py` runs a copied unmutated positive harness and one weakened source-guard mutant; the mutant must fail exactly one assertion with no harness error or skip. Both Python modes were observed passing this finite source-mutation control. It is not a complete fault model. diff --git a/cbz/evidence/website-foundation-20261029/VERIFICATION.json b/cbz/evidence/website-foundation-20261029/VERIFICATION.json new file mode 100644 index 000000000..b9335b376 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/VERIFICATION.json @@ -0,0 +1,30 @@ +{ + "verified_utc": "2026-10-29T18:37:53.414834Z", + "result": "PASS_CONTRIBUTION_DATA_CHECKS_ONLY", + "records": 207, + "closed_literal_arithmetic": 31, + "quarantined": 176, + "original_legacy_records_verified": 104, + "original_graph_records_verified": 49, + "source_files_verified": 574, + "root_status_unchanged": true, + "controls": [ + { + "name": "deleted_original_scope", + "detected": true + }, + { + "name": "all_main_overclaim", + "detected": true + }, + { + "name": "quarantine_promoted", + "detected": true + }, + { + "name": "missing_nonvacuity", + "detected": true + } + ], + "scope": "Record identity, exact fields, byte hashes, finite metadata/isolation checks and proposal gate markers; no scientific/kernel rerun or exhaustive Main obligation closure." +} diff --git a/cbz/evidence/website-foundation-20261029/archive/FULL_LEGACY_COPY_VERIFICATION.json b/cbz/evidence/website-foundation-20261029/archive/FULL_LEGACY_COPY_VERIFICATION.json new file mode 100644 index 000000000..a6f64543e --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/archive/FULL_LEGACY_COPY_VERIFICATION.json @@ -0,0 +1,2004 @@ +{ + "copied_utc": "2026-10-29T17:45:39.840458+00:00", + "files": [ + { + "path": "cbz/sources/legacy-v20/engine/ACCEPTANCE_LADDER.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/ACCEPTANCE_LADDER.md", + "sha256": "144f7b9aaf140cc2ae24d7ab54744ca889a92bd04965f18b1ec9c72d4d4958df", + "bytes": 1802 + }, + { + "path": "cbz/sources/legacy-v20/engine/AGENT_PROTOCOL.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/AGENT_PROTOCOL.md", + "sha256": "a38c860cb75ee7c5907a4cc30684414be4aff1842f06624e247cf24a0fb9fa9c", + "bytes": 3825 + }, + { + "path": "cbz/sources/legacy-v20/engine/API_AND_EVENTS_V17.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/API_AND_EVENTS_V17.md", + "sha256": "fbe268a06225dc0e172d9549f70e919bde1b078c42bdfb6c780923ce28df67c0", + "bytes": 6491 + }, + { + "path": "cbz/sources/legacy-v20/engine/CHANGELOG_v16.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/CHANGELOG_v16.md", + "sha256": "2ce9b025f1f98fe53b01bfe98ee22293475bfaeec301706116a971a9afc44817", + "bytes": 1201 + }, + { + "path": "cbz/sources/legacy-v20/engine/CODEX_HANDOFF.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/CODEX_HANDOFF.md", + "sha256": "7b69966dbf2da07aab5e363d873659e7a3400cae8ba8da2a3232c00cdb4e6a0b", + "bytes": 7041 + }, + { + "path": "cbz/sources/legacy-v20/engine/CODEX_PROMPT.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/CODEX_PROMPT.md", + "sha256": "ab787bfdf4ed081a13904f677979de99d49f0297916fc7e359c7e03386d1925e", + "bytes": 6051 + }, + { + "path": "cbz/sources/legacy-v20/engine/D1-A_snapshot.svg", + "original_path": "/workspace/cbz0/legacy-v20/engine/D1-A_snapshot.svg", + "sha256": "f31ce25024474212ff68ad6b2e4dad7e8a932cf9bc433a3a3e186d237d134e07", + "bytes": 2139 + }, + { + "path": "cbz/sources/legacy-v20/engine/DEMO_D1_EVENT_TRACE.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/DEMO_D1_EVENT_TRACE.json", + "sha256": "9073ad7a32928fab9360dad41592e2686f45c7f7c0cd279839637d013ffb67e5", + "bytes": 416 + }, + { + "path": "cbz/sources/legacy-v20/engine/ENVIRONMENT.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/ENVIRONMENT.txt", + "sha256": "4583786681a4f6ce493def5f2ec8ea48a5a682a98eeef1a87b5a32349726bc93", + "bytes": 437 + }, + { + "path": "cbz/sources/legacy-v20/engine/ENVIRONMENT_V17.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/ENVIRONMENT_V17.json", + "sha256": "2db336881cda309c300ecb58250502c6a6c91c7e6cce49694f12d72f9965656d", + "bytes": 1347 + }, + { + "path": "cbz/sources/legacy-v20/engine/HANDOFF_COMPLETENESS.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/HANDOFF_COMPLETENESS.md", + "sha256": "0940d3cb14b0c649282cbb44606d81f01cb0dc7a1f63a5e793f604a8e4fa99c1", + "bytes": 3147 + }, + { + "path": "cbz/sources/legacy-v20/engine/LOCAL_EVIDENCE_NOTES_INDEX.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/LOCAL_EVIDENCE_NOTES_INDEX.json", + "sha256": "66069be95ff492ea281d772c8af861a80055c60c3c12932fb93e110b8588602b", + "bytes": 2762 + }, + { + "path": "cbz/sources/legacy-v20/engine/MIGRATION_V17.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/MIGRATION_V17.md", + "sha256": "219b721f17cfc76df4a90955c1eb2f03a32b5ba58c1a3afd6c1dcf44fce9bfd6", + "bytes": 2532 + }, + { + "path": "cbz/sources/legacy-v20/engine/OPEN_OBLIGATIONS.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/OPEN_OBLIGATIONS.md", + "sha256": "1ccb184b0d4b454acf089ebadd32f3acbf1519c707232439d73df621e884bd62", + "bytes": 3413 + }, + { + "path": "cbz/sources/legacy-v20/engine/PROOF_ADVANCES_v10_R11_R12.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/PROOF_ADVANCES_v10_R11_R12.md", + "sha256": "e1fc8b5cfeeeadc5c4b13f13d228459e714c9e52b4fa6472877da193e3f4e8e8", + "bytes": 9391 + }, + { + "path": "cbz/sources/legacy-v20/engine/PROOF_ADVANCES_v11_CAP.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/PROOF_ADVANCES_v11_CAP.md", + "sha256": "315f60ffb2cc289e41eefb0f1b9953c6e60a53116271e9b412d88c88d97fca09", + "bytes": 6205 + }, + { + "path": "cbz/sources/legacy-v20/engine/PROOF_ADVANCES_v12_MARKED_KR.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/PROOF_ADVANCES_v12_MARKED_KR.md", + "sha256": "f132c16d0e4de9166a10a2365d9e6729d57b55c23b02156368e27946337e6c70", + "bytes": 8839 + }, + { + "path": "cbz/sources/legacy-v20/engine/PROOF_ADVANCES_v7.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/PROOF_ADVANCES_v7.md", + "sha256": "e0848f1aa21ade887565292fcf8b1cff7ef99bb6b23d454c34498c225eed6887", + "bytes": 9884 + }, + { + "path": "cbz/sources/legacy-v20/engine/PROOF_ADVANCES_v8_D4.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/PROOF_ADVANCES_v8_D4.md", + "sha256": "88d4832c915fd44241f79f5605aaac3095df1ed6cd24da90954636d2849a2f6b", + "bytes": 10137 + }, + { + "path": "cbz/sources/legacy-v20/engine/PROOF_ADVANCES_v9_D3_D2.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/PROOF_ADVANCES_v9_D3_D2.md", + "sha256": "ca5f32fc6fb838486158ff88e7eb4936ca8a321dc49fcf64768506767b99c466", + "bytes": 9031 + }, + { + "path": "cbz/sources/legacy-v20/engine/PROOF_NOTES.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/PROOF_NOTES.md", + "sha256": "dbb72741203a8fba9b85d7ac09d96b70cac6099f02d54c5d8dffc17c895bee77", + "bytes": 13416 + }, + { + "path": "cbz/sources/legacy-v20/engine/README.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/README.md", + "sha256": "fe96b4f0ee0a00c6bbb653f337cf8e6ac6cba10c225160468bd581c294a10121", + "bytes": 5870 + }, + { + "path": "cbz/sources/legacy-v20/engine/RETAINED_PROTOCOL_COMPATIBILITY.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/RETAINED_PROTOCOL_COMPATIBILITY.md", + "sha256": "d99071d5722c8e8beb977c15acd0c0662abeda8df398c8fadd83672e165c5329", + "bytes": 2239 + }, + { + "path": "cbz/sources/legacy-v20/engine/SHA256SUMS", + "original_path": "/workspace/cbz0/legacy-v20/engine/SHA256SUMS", + "sha256": "5b87ccaf737b4c4cc17f3a8443364e8b2e38263c76a1953a82fd28991ae157f7", + "bytes": 34693 + }, + { + "path": "cbz/sources/legacy-v20/engine/SOURCE_AUTHENTICATION_V17.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/SOURCE_AUTHENTICATION_V17.md", + "sha256": "a889b6711f72372798a5910f9f7a32561d8d3b25480404dabecb60de0f7c9a45", + "bytes": 6145 + }, + { + "path": "cbz/sources/legacy-v20/engine/SOURCE_REFERENCE_GUIDE.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/SOURCE_REFERENCE_GUIDE.md", + "sha256": "71d26a23456f8ea76405aa0a1d1c1b27f3a37497bd239b8cf163b5f6c41b9fdd", + "bytes": 6020 + }, + { + "path": "cbz/sources/legacy-v20/engine/SOURCE_REFERENCE_INDEX.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/SOURCE_REFERENCE_INDEX.json", + "sha256": "819ab42fff6e0d842ad005e313ce7881745b66c4b98d08bb3d251f82df51d6fc", + "bytes": 51576 + }, + { + "path": "cbz/sources/legacy-v20/engine/VERIFICATION_V16.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/VERIFICATION_V16.md", + "sha256": "3577afebf4ae1c32bb073b629e28f4ea49eaa1804b0bd28c817f24a49f57c0f1", + "bytes": 2639 + }, + { + "path": "cbz/sources/legacy-v20/engine/VERIFICATION_V17.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/VERIFICATION_V17.md", + "sha256": "1c690a82270e8d2839a04a3dba8009f38c5b008dae47b72cbe7aa44323bd3d4e", + "bytes": 6751 + }, + { + "path": "cbz/sources/legacy-v20/engine/VISUAL_AND_AGENT_ROADMAP.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/VISUAL_AND_AGENT_ROADMAP.md", + "sha256": "18032b40edfcc04b04b67cb8755eae6d9d1e0debd8054f357e7df8174e87e9b1", + "bytes": 2514 + }, + { + "path": "cbz/sources/legacy-v20/engine/adapters/WORKER_PROTOCOL.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/adapters/WORKER_PROTOCOL.md", + "sha256": "d87b10f79272534e554ed1e1c0d3fb6569c35646efd3db28f178d93c26cff25c", + "bytes": 3194 + }, + { + "path": "cbz/sources/legacy-v20/engine/adapters/adapter_profiles_v17.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/adapters/adapter_profiles_v17.json", + "sha256": "3454f91507474a2fb52199f87b000f720b2d52dc719f01cd98e3e5aac2e99de7", + "bytes": 1393 + }, + { + "path": "cbz/sources/legacy-v20/engine/adapters/checker_registry.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/adapters/checker_registry.json", + "sha256": "f18342a121bfd52367956a9bb8cd2a5a8e67138183c86caf0bd62adce61764bb", + "bytes": 856 + }, + { + "path": "cbz/sources/legacy-v20/engine/adapters/worker_protocol.schema.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/adapters/worker_protocol.schema.json", + "sha256": "7e2d5a030c577cbad43f6a5951c2d2c1a4c67ce982d62fff39931c5d96dea74e", + "bytes": 3277 + }, + { + "path": "cbz/sources/legacy-v20/engine/baseline/Universal_Law_Reactive_Conductor_v16_Codex_Ready.zip", + "original_path": "/workspace/cbz0/legacy-v20/engine/baseline/Universal_Law_Reactive_Conductor_v16_Codex_Ready.zip", + "sha256": "47348544f7766b56d7982ee9e88776726ac900e1a4d6abc06d38c95f7db98279", + "bytes": 392139 + }, + { + "path": "cbz/sources/legacy-v20/engine/baseline/archive.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/baseline/archive.json", + "sha256": "0e01faab4d8d6a8e13c42cc6a90cb1d288185831e99f94df640f72bcaac2e5a1", + "bytes": 229 + }, + { + "path": "cbz/sources/legacy-v20/engine/baseline/demo.stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/baseline/demo.stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/baseline/demo.stdout.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/baseline/demo.stdout.txt", + "sha256": "b936132d0541b55ffda34db43ef58f9b931e3bc3f0536ba145ab28d0d1511920", + "bytes": 2204 + }, + { + "path": "cbz/sources/legacy-v20/engine/baseline/results.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/baseline/results.json", + "sha256": "31156759e39725b7064e8994a5cd6172c01ce6091837a9de654faf96043fc4ce", + "bytes": 435 + }, + { + "path": "cbz/sources/legacy-v20/engine/baseline/verify.stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/baseline/verify.stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/baseline/verify.stdout.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/baseline/verify.stdout.txt", + "sha256": "cfa5df63aa3f490720439c16a7a598bb7cda9724c71bc9821bc852ea93bf8f34", + "bytes": 947 + }, + { + "path": "cbz/sources/legacy-v20/engine/browser_smoke.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/browser_smoke.py", + "sha256": "17c157b4994308f74c32e895aa99f6b1b1a95c2efa7734c7133d13a80b3b0482", + "bytes": 1756 + }, + { + "path": "cbz/sources/legacy-v20/engine/browser_smoke_live_v16.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/browser_smoke_live_v16.py", + "sha256": "935e3a2bc6a9f05d1f1c11c9b0aab8eb17ce0f0003c46a82c331dc10216ed96b", + "bytes": 2787 + }, + { + "path": "cbz/sources/legacy-v20/engine/browser_smoke_v16.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/browser_smoke_v16.py", + "sha256": "8a322543a02e3680129d4f651da6b5a6ffdb4287d189a7eb1da9d68cae4e2146", + "bytes": 1737 + }, + { + "path": "cbz/sources/legacy-v20/engine/browser_smoke_v17.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/browser_smoke_v17.py", + "sha256": "79eb3572f9daaaddcd3b29aee2da33ef71fe619b0112917caf3c22efa016cd75", + "bytes": 6074 + }, + { + "path": "cbz/sources/legacy-v20/engine/build_views.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/build_views.py", + "sha256": "1fb16c26d5bbcc168f951dd5518cfa7a938cce761d15ff19c0839eea6a2da23d", + "bytes": 3624 + }, + { + "path": "cbz/sources/legacy-v20/engine/certificate_schema.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/certificate_schema.json", + "sha256": "94c47d41688b014b573ac8bd258dc78c406efe694fff94b4e03e0d1e9e72dea6", + "bytes": 4628 + }, + { + "path": "cbz/sources/legacy-v20/engine/certificates.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/certificates.py", + "sha256": "6a47237bb9bf3cba4a486769bcb2fcc3c3664c157853dd6a9478670ff73741ec", + "bytes": 19028 + }, + { + "path": "cbz/sources/legacy-v20/engine/conductor.html", + "original_path": "/workspace/cbz0/legacy-v20/engine/conductor.html", + "sha256": "05a0f2ca5ac33d8657d69b41bbe950e72f6d59ad1710ca984cd192e7e26ccd39", + "bytes": 195658 + }, + { + "path": "cbz/sources/legacy-v20/engine/conductor.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/conductor.py", + "sha256": "41bdc2b734742f96a94f6a383ce3e1235026febdab69d20ff33734e9a65c25f4", + "bytes": 57693 + }, + { + "path": "cbz/sources/legacy-v20/engine/conductor_template.html", + "original_path": "/workspace/cbz0/legacy-v20/engine/conductor_template.html", + "sha256": "ecf04a4db949992344f7a4ebddeeadea4d9fe11f5f6c35ab200c13f5fdb14a94", + "bytes": 32486 + }, + { + "path": "cbz/sources/legacy-v20/engine/dataset.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7", + "bytes": 396561 + }, + { + "path": "cbz/sources/legacy-v20/engine/demo_v17.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/demo_v17.py", + "sha256": "012cb962d214b1d53354ab5c5315aedca43e662c42fd37c018af5957d4c0c956", + "bytes": 8875 + }, + { + "path": "cbz/sources/legacy-v20/engine/exact_math_checks.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/exact_math_checks.py", + "sha256": "72704d35ed0f9c852f1f77fdb66df6baf4d8cee1ff156b5742b899478fbfcf9b", + "bytes": 3570 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/dataset.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/dataset.json", + "sha256": "21be1797a6c7d677dd8e00f3729ec9eaea25b20ef13da9beea33a83a1685ec2a", + "bytes": 334371 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/diagnostic.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/diagnostic.json", + "sha256": "22927d7b6137d4218fecee9b3b6559d5bad20cc1a2de9b8f66e04047e0b2ac94", + "bytes": 1979 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/job.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/job.json", + "sha256": "aedfc80fee3d0187e521b58db2ad48d3004d6ed7758be9738ae5ae03bb24f07a", + "bytes": 13326 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/notes/PROOF_ADVANCES_v11_CAP.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/notes/PROOF_ADVANCES_v11_CAP.md", + "sha256": "315f60ffb2cc289e41eefb0f1b9953c6e60a53116271e9b412d88c88d97fca09", + "bytes": 6205 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/notes/PROOF_ADVANCES_v12_MARKED_KR.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/notes/PROOF_ADVANCES_v12_MARKED_KR.md", + "sha256": "f132c16d0e4de9166a10a2365d9e6729d57b55c23b02156368e27946337e6c70", + "bytes": 8839 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/receipt.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/receipt.json", + "sha256": "48939a97c29285f0513d18c86a7a5de85da812b9b61dbd6623fb49d1e34bc5dd", + "bytes": 18454 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/0.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/0.bin", + "sha256": "636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f", + "bytes": 326691 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/1.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/1.bin", + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da", + "bytes": 23312 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/2.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/2.bin", + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "bytes": 40261 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/3.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/3.bin", + "sha256": "bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028", + "bytes": 1782 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/4.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/4.bin", + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "bytes": 40261 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/5.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/5.bin", + "sha256": "b7328d4bab97fa2d12622ca730dc698970febc1ea8bcbc0b24555e69e2a66392", + "bytes": 24105 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/6.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/6.bin", + "sha256": "845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f", + "bytes": 9062 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/7.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/7.bin", + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da", + "bytes": 23312 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/8.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/sources/8.bin", + "sha256": "0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc", + "bytes": 15160 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/stdout.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-6de501fcf254cce23859fedb9ea677c8/29ab8a1b60f3440091ccbd737019ab6b/stdout.txt", + "sha256": "e906cab3e588420ab16ee9dc1d116283dc628f2aef78fe7d754342018c94331d", + "bytes": 76 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/dataset.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/dataset.json", + "sha256": "21be1797a6c7d677dd8e00f3729ec9eaea25b20ef13da9beea33a83a1685ec2a", + "bytes": 334371 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/diagnostic.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/diagnostic.json", + "sha256": "318bd0fad9b1cadc1795b9ba46cf3dada7caafb9319c034b4031dedf282ef33c", + "bytes": 2051 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/job.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/job.json", + "sha256": "7ee3db9637a83012e8caf3ea81bb41c75da7108ea58baeb22c928ff7055cd5bf", + "bytes": 13799 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/notes/PROOF_ADVANCES_v11_CAP.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/notes/PROOF_ADVANCES_v11_CAP.md", + "sha256": "315f60ffb2cc289e41eefb0f1b9953c6e60a53116271e9b412d88c88d97fca09", + "bytes": 6205 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/notes/PROOF_ADVANCES_v12_MARKED_KR.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/notes/PROOF_ADVANCES_v12_MARKED_KR.md", + "sha256": "f132c16d0e4de9166a10a2365d9e6729d57b55c23b02156368e27946337e6c70", + "bytes": 8839 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/receipt.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/receipt.json", + "sha256": "83a9a8d95f323b7982aac9be34148ba8b4ac9adef1348df52884b19f5301e172", + "bytes": 18999 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/0.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/0.bin", + "sha256": "636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f", + "bytes": 326691 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/1.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/1.bin", + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da", + "bytes": 23312 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/2.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/2.bin", + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "bytes": 40261 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/3.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/3.bin", + "sha256": "bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028", + "bytes": 1782 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/4.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/4.bin", + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "bytes": 40261 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/5.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/5.bin", + "sha256": "b7328d4bab97fa2d12622ca730dc698970febc1ea8bcbc0b24555e69e2a66392", + "bytes": 24105 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/6.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/6.bin", + "sha256": "845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f", + "bytes": 9062 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/7.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/7.bin", + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da", + "bytes": 23312 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/8.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/sources/8.bin", + "sha256": "0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc", + "bytes": 15160 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/stdout.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-aaa62915bedf86e34c0bf596f557a7a1/91abde8fd1434bee9132c2fb4f9949fe/stdout.txt", + "sha256": "e906cab3e588420ab16ee9dc1d116283dc628f2aef78fe7d754342018c94331d", + "bytes": 76 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/dataset.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/dataset.json", + "sha256": "21be1797a6c7d677dd8e00f3729ec9eaea25b20ef13da9beea33a83a1685ec2a", + "bytes": 334371 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/diagnostic.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/diagnostic.json", + "sha256": "4afb335b286446c12b9fffdc43acf4f416a75068d4677b9f490be2eb960f083d", + "bytes": 1215 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/job.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/job.json", + "sha256": "4ebb42181feb48efbf4a6174ac6f18ea3768128a9206470d294b2f767ff8c672", + "bytes": 4528 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/notes/PROOF_ADVANCES_v12_MARKED_KR.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/notes/PROOF_ADVANCES_v12_MARKED_KR.md", + "sha256": "f132c16d0e4de9166a10a2365d9e6729d57b55c23b02156368e27946337e6c70", + "bytes": 8839 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/receipt.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/receipt.json", + "sha256": "0fa0b36426f6d5725741ff0ebf722fbda128ff175cefb8ebe49e5024d8f7fd4b", + "bytes": 7953 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/sources/0.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/sources/0.bin", + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da", + "bytes": 23312 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/sources/1.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/sources/1.bin", + "sha256": "bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028", + "bytes": 1782 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/stdout.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-ad93e8475e7ac2199f588dd7e04e72f9/39c17252559141c69ad0ec7afc3932c2/stdout.txt", + "sha256": "e906cab3e588420ab16ee9dc1d116283dc628f2aef78fe7d754342018c94331d", + "bytes": 76 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/dataset.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/dataset.json", + "sha256": "21be1797a6c7d677dd8e00f3729ec9eaea25b20ef13da9beea33a83a1685ec2a", + "bytes": 334371 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/diagnostic.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/diagnostic.json", + "sha256": "ca2305ea418d65c48adcb6e54661f0bd509748be0f4bb9ff16130a48b67a7fef", + "bytes": 2076 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/job.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/job.json", + "sha256": "894b88923e3f41359a49ef8bfe6409a83afb3cbbb780fa2aa4cc63d254c28dd4", + "bytes": 13487 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/notes/PROOF_ADVANCES_v11_CAP.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/notes/PROOF_ADVANCES_v11_CAP.md", + "sha256": "315f60ffb2cc289e41eefb0f1b9953c6e60a53116271e9b412d88c88d97fca09", + "bytes": 6205 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/notes/PROOF_ADVANCES_v12_MARKED_KR.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/notes/PROOF_ADVANCES_v12_MARKED_KR.md", + "sha256": "f132c16d0e4de9166a10a2365d9e6729d57b55c23b02156368e27946337e6c70", + "bytes": 8839 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/notes/PROOF_NOTES.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/notes/PROOF_NOTES.md", + "sha256": "dbb72741203a8fba9b85d7ac09d96b70cac6099f02d54c5d8dffc17c895bee77", + "bytes": 13416 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/receipt.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/receipt.json", + "sha256": "d67b8b2c750cb0981406760bec83580a6b5c93f326d46ef3ae7453d276d5d64d", + "bytes": 18835 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/0.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/0.bin", + "sha256": "636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f", + "bytes": 326691 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/1.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/1.bin", + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da", + "bytes": 23312 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/2.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/2.bin", + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "bytes": 40261 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/3.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/3.bin", + "sha256": "bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028", + "bytes": 1782 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/4.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/4.bin", + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "bytes": 40261 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/5.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/5.bin", + "sha256": "b7328d4bab97fa2d12622ca730dc698970febc1ea8bcbc0b24555e69e2a66392", + "bytes": 24105 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/6.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/6.bin", + "sha256": "845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f", + "bytes": 9062 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/7.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/7.bin", + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da", + "bytes": 23312 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/8.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/sources/8.bin", + "sha256": "0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc", + "bytes": 15160 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/stdout.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-bcb92f60c321a738c675dd6d2dc91770/fc88ebb962ae4a2e8040f02f66da9f85/stdout.txt", + "sha256": "e906cab3e588420ab16ee9dc1d116283dc628f2aef78fe7d754342018c94331d", + "bytes": 76 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/dataset.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/dataset.json", + "sha256": "21be1797a6c7d677dd8e00f3729ec9eaea25b20ef13da9beea33a83a1685ec2a", + "bytes": 334371 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/diagnostic.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/diagnostic.json", + "sha256": "f2c2ed75b838508e55270570597d7310994435eb4ff614470913ffe33cf20ed0", + "bytes": 1697 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/job.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/job.json", + "sha256": "edffa42962ae07567d17741eb644f6da28ea8f2113e9362dd12d5a15391b2812", + "bytes": 11800 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/notes/PROOF_ADVANCES_v11_CAP.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/notes/PROOF_ADVANCES_v11_CAP.md", + "sha256": "315f60ffb2cc289e41eefb0f1b9953c6e60a53116271e9b412d88c88d97fca09", + "bytes": 6205 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/notes/PROOF_ADVANCES_v12_MARKED_KR.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/notes/PROOF_ADVANCES_v12_MARKED_KR.md", + "sha256": "f132c16d0e4de9166a10a2365d9e6729d57b55c23b02156368e27946337e6c70", + "bytes": 8839 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/receipt.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/receipt.json", + "sha256": "be1bcc84637dde925802ab67982b5d757ee2c44d78c7d6737df14caff9b105ed", + "bytes": 16529 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/0.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/0.bin", + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da", + "bytes": 23312 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/1.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/1.bin", + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "bytes": 40261 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/2.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/2.bin", + "sha256": "bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028", + "bytes": 1782 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/3.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/3.bin", + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "bytes": 40261 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/4.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/4.bin", + "sha256": "b7328d4bab97fa2d12622ca730dc698970febc1ea8bcbc0b24555e69e2a66392", + "bytes": 24105 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/5.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/5.bin", + "sha256": "845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f", + "bytes": 9062 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/6.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/6.bin", + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da", + "bytes": 23312 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/7.bin", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/sources/7.bin", + "sha256": "0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc", + "bytes": 15160 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/stdout.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/artifacts/j-e57a5088e246448d3432785ba2e18e8c/123bfcb3f4a343679988f548fac5c868/stdout.txt", + "sha256": "e906cab3e588420ab16ee9dc1d116283dc628f2aef78fe7d754342018c94331d", + "bytes": 76 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/current_state.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/current_state.json", + "sha256": "b8e98cdb9d78ecdd2df7d8bf22b479ebcce014a07cdfccf30016eb78b1476659", + "bytes": 462098 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/cycle_report.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/cycle_report.json", + "sha256": "c4837ee858236a2ae56931543a1c04cc6aa5edd1ecf6351e8265f7b4f76d6d2b", + "bytes": 1122 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/event_stream_observations.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/event_stream_observations.json", + "sha256": "15c4a392b25e6c492d7bbb4b53386651abad477c726651ac421e136010f05db8", + "bytes": 5688 + }, + { + "path": "cbz/sources/legacy-v20/engine/examples/change_cycle/events.jsonl", + "original_path": "/workspace/cbz0/legacy-v20/engine/examples/change_cycle/events.jsonl", + "sha256": "c68eaf6bfbbfb6f2a24d270a18f313400b7b754fddc8f27955160144977854e0", + "bytes": 152672 + }, + { + "path": "cbz/sources/legacy-v20/engine/external_theorem_sources.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/external_theorem_sources.json", + "sha256": "dd33c4ec03e4c189f65516a84d470be297228628ba0519fe4e73736d7387c724", + "bytes": 1349 + }, + { + "path": "cbz/sources/legacy-v20/engine/fixtures/adversarial_v17.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/fixtures/adversarial_v17.json", + "sha256": "e89703bd6ee5365553fbaf23b6636a5c7ba18d858ca7f116367a93e2f42b8e47", + "bytes": 3099 + }, + { + "path": "cbz/sources/legacy-v20/engine/fixtures/certificates/fake_checker_pass.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/fixtures/certificates/fake_checker_pass.json", + "sha256": "dc3eb3a340b44d22dbce94a788a9219b2ead63fd22334e986310cf4249119472", + "bytes": 202 + }, + { + "path": "cbz/sources/legacy-v20/engine/fixtures/certificates/invalid_hash.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/fixtures/certificates/invalid_hash.json", + "sha256": "2bfbffb5c4fd234777722745166ba5a94f95c4aa9d6a6a0801d3d868f3a5eea5", + "bytes": 274 + }, + { + "path": "cbz/sources/legacy-v20/engine/fixtures/certificates/path_escape.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/fixtures/certificates/path_escape.json", + "sha256": "1ca658eaad4e4e69e2397fd15656f801ed97b1f17a4a84bed65bed840f614b04", + "bytes": 223 + }, + { + "path": "cbz/sources/legacy-v20/engine/fixtures/certificates/statement_mismatch.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/fixtures/certificates/statement_mismatch.json", + "sha256": "fd293b3686537b81386eef12362fae73471ce5fcb82013c474f3c6b543e789a9", + "bytes": 261 + }, + { + "path": "cbz/sources/legacy-v20/engine/fixtures/negative_cases.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/fixtures/negative_cases.json", + "sha256": "fd7904b282720192ed7d8b298326b919ecf9854be2388e429a64c0e982db3c0e", + "bytes": 1760 + }, + { + "path": "cbz/sources/legacy-v20/engine/frozen_v14_proof_hypergraph.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/frozen_v14_proof_hypergraph.json", + "sha256": "fe6a1159c885ebee2c9dc38308df9a16d0a517b037ebb0a1ac942a8b595d686d", + "bytes": 349355 + }, + { + "path": "cbz/sources/legacy-v20/engine/historical_source_ledgers/COVERAGE_REPORT.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/historical_source_ledgers/COVERAGE_REPORT.md", + "sha256": "c20631d1ac4c5472905e7ff51ca8fef1e9fedb0783b6906ac4850f2e45ad7fef", + "bytes": 1183 + }, + { + "path": "cbz/sources/legacy-v20/engine/historical_source_ledgers/LINEAGE_IMPACT_v11_to_v12.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/historical_source_ledgers/LINEAGE_IMPACT_v11_to_v12.md", + "sha256": "dc3fd4b7a3b7a06b15c9df9185c619f759ee855f74b08427515c11d7e79b9830", + "bytes": 1879 + }, + { + "path": "cbz/sources/legacy-v20/engine/historical_source_ledgers/NEXT_VERIFICATION_TARGETS.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/historical_source_ledgers/NEXT_VERIFICATION_TARGETS.md", + "sha256": "ff101af720afe63a0605f6c03ea5bbdcfca0b546154a06e86d07f6457cc921b2", + "bytes": 1182 + }, + { + "path": "cbz/sources/legacy-v20/engine/historical_source_ledgers/SOURCING_LEDGER_v11.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/historical_source_ledgers/SOURCING_LEDGER_v11.md", + "sha256": "5ada539c1dd60ab30fe08b814a575feded5b075f87f0f3cfac1aed426e230fd9", + "bytes": 1522 + }, + { + "path": "cbz/sources/legacy-v20/engine/historical_source_ledgers/SOURCING_LEDGER_v12.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/historical_source_ledgers/SOURCING_LEDGER_v12.md", + "sha256": "9b38837d3b92962db3fdc44e7a69559910c6023b38a1388fb2c4cedb99011404", + "bytes": 3832 + }, + { + "path": "cbz/sources/legacy-v20/engine/historical_source_ledgers/VERIFICATION_REPORT.md", + "original_path": "/workspace/cbz0/legacy-v20/engine/historical_source_ledgers/VERIFICATION_REPORT.md", + "sha256": "042977aae31eac45803d410e564747aa35984679a5ac92e944a05d47ee2e79f4", + "bytes": 3022 + }, + { + "path": "cbz/sources/legacy-v20/engine/historical_source_ledgers/acceptance_evidence_ledger.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/historical_source_ledgers/acceptance_evidence_ledger.json", + "sha256": "f8721930c9b244db31a7b638a0b8f1d4bc332452a36d7480d08620b2e54fe813", + "bytes": 65862 + }, + { + "path": "cbz/sources/legacy-v20/engine/historical_source_ledgers/independent_verification_ledger.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/historical_source_ledgers/independent_verification_ledger.json", + "sha256": "69d257ea9243986f0b08263870a62fa048f84d3eea2307c5bebdb0d15e10f4cb", + "bytes": 47083 + }, + { + "path": "cbz/sources/legacy-v20/engine/import_applicability.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/import_applicability.json", + "sha256": "31ce56ebcbf974f66b79b5c5082e71392a3b8617d60d74d1a175bd21a99e4ca3", + "bytes": 25570 + }, + { + "path": "cbz/sources/legacy-v20/engine/index.html", + "original_path": "/workspace/cbz0/legacy-v20/engine/index.html", + "sha256": "aa43ca1f11236576e66fda9849c2537cdc1f19889bb61eb6d0162e6843db0816", + "bytes": 348497 + }, + { + "path": "cbz/sources/legacy-v20/engine/index_template.html", + "original_path": "/workspace/cbz0/legacy-v20/engine/index_template.html", + "sha256": "309a2df16c7ccb6f6121763b512725d1eafd7c8d7f660c25985579c6a1e45005", + "bytes": 14209 + }, + { + "path": "cbz/sources/legacy-v20/engine/live_integration_test.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/live_integration_test.py", + "sha256": "f3b53bac035e0465051113066b5a187a116249afa6ef363d9499de902e2560ea", + "bytes": 2233 + }, + { + "path": "cbz/sources/legacy-v20/engine/local_exact_receipt.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/local_exact_receipt.json", + "sha256": "2253d09632119577171f676294c0b43d8bc7f05dd66a03cb5de629f4293c54dd", + "bytes": 674 + }, + { + "path": "cbz/sources/legacy-v20/engine/make_release.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/make_release.py", + "sha256": "fea4263d28d6f25caa4f37cfcfd1e05b1071108573a16b88198f30d5e44cd865", + "bytes": 2198 + }, + { + "path": "cbz/sources/legacy-v20/engine/manifest.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/manifest.json", + "sha256": "6f4ae83d9ec7bb1ddb9f852328a2314c703239a1ddca90f4e251a58eab26079f", + "bytes": 37402 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/C6-01.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/C6-01.mmd", + "sha256": "6d1f0aa90d29290a4c9248c20df94d7d8f490dab39d1772f297f7e45b0edcf7a", + "bytes": 313 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/C6-F.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/C6-F.mmd", + "sha256": "3b7e5b25fae16a4c54b71f45fd3b0ef40ffc5933ccff40697bba06a45fd6c978", + "bytes": 285 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/C6-W.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/C6-W.mmd", + "sha256": "95a50a56162fbc688edcb6aa851277631e3b8e3e431afc490f56707bd7545bad", + "bytes": 341 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D1-01.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D1-01.mmd", + "sha256": "5066699107700a0ff1818273ae65c4bbce73a9aa68a4df35f07dd87c1f710eb3", + "bytes": 279 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D1-02.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D1-02.mmd", + "sha256": "b196ae36ecc5805fa38e65a4b0eb28296bb03e5dab48481407dacac673498fe8", + "bytes": 286 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D1-03.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D1-03.mmd", + "sha256": "2c6cfa0cabe59514793a45635fdf4c5dd33e4af17c8c36321a8913aedf9fe9df", + "bytes": 308 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D1-04.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D1-04.mmd", + "sha256": "4b4a409871f51310f3ebaa685d3d717962b0f7778e21d2abced6724bd13ea2b9", + "bytes": 276 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D1-A.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D1-A.mmd", + "sha256": "9081ce92b8a78cb82cb012a24196692b8bcc67b0ec2a4d19dd415e199bc49884", + "bytes": 819 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D1-B.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D1-B.mmd", + "sha256": "26e1296a32817e89fa3b6857d921929007ea99eb967d259a1859f0ca21251e44", + "bytes": 716 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D1-C.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D1-C.mmd", + "sha256": "8d50eb248e29bccaea990d452fa6d2b8241880acf55532729f611c9ff3b472d9", + "bytes": 711 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D2-R.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D2-R.mmd", + "sha256": "9613174c674f2fb4666e0bbde0fe5fb1dcc10a7f3e6deb56ebe47cd671f78b4b", + "bytes": 662 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D3-01.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D3-01.mmd", + "sha256": "6d81ab1a467eaf4eb7dccc81077a816c4a8e8b44ee3de925033e613705832b96", + "bytes": 322 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D3-02.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D3-02.mmd", + "sha256": "3901dc80e9f9ae4750e3b83502983b65765b14564414a2618a85f07f9dcbcace", + "bytes": 324 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D3-03.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D3-03.mmd", + "sha256": "34950df9b56e9baa05bdc189ad81ccff4158b75f81626af8927cc29bfe47a54f", + "bytes": 287 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D3-04.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D3-04.mmd", + "sha256": "a93bcb73d3e29a7ff73a3a85be36ef0e1a1524eeb8b5bbd136167c53c43b5356", + "bytes": 311 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D4-01.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D4-01.mmd", + "sha256": "f6e9009ccecdefbe7da6973b8cbab8dd92d2c1bdbe23754c3c231fffb1705499", + "bytes": 325 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D4-A.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D4-A.mmd", + "sha256": "08e0bd03352706a4ab31b8647206689abf7ce3544389c83b9effb6546891b882", + "bytes": 416 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D5-C.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D5-C.mmd", + "sha256": "cae89e93fcacf7d86f6ef752d7bcc42af67470844cf36c9302f215e6de4a184e", + "bytes": 264 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D5-G.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D5-G.mmd", + "sha256": "2e6c20d685ce548918a740d7d169fc212fa50cbc19a3c36d640c47c40bf3ce03", + "bytes": 340 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D5-I.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D5-I.mmd", + "sha256": "a6383ff3a908415950d4fab71d8ae99e02b268b0d50ce04f97a1741155cddb1f", + "bytes": 264 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D5-M.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D5-M.mmd", + "sha256": "949cc12cf7e8f9707325070cab03eeeabc699b7445560a37931220d932e7fe21", + "bytes": 278 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/D5-P.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/D5-P.mmd", + "sha256": "59138f80ab540e233a0536fd8a0e36bdd5ea32a1bf39d630d6ed4b7026e65d43", + "bytes": 284 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/P15-01.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/P15-01.mmd", + "sha256": "43874b175a0e98b5200b008d95073472d49ac8ffe9b5c6facfc7bafef0d70cf5", + "bytes": 305 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/P15-F.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/P15-F.mmd", + "sha256": "073fe403c58f9aa9bc911c222e0bd0a67bf627ff4cb57351a7ab12975ef67f9c", + "bytes": 453 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/P15-L.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/P15-L.mmd", + "sha256": "10dfc06041c70775805e3c5ef4cbf3126532a2494218d6f289cf09bc8cc0a9d7", + "bytes": 285 + }, + { + "path": "cbz/sources/legacy-v20/engine/mermaid/SG-01.mmd", + "original_path": "/workspace/cbz0/legacy-v20/engine/mermaid/SG-01.mmd", + "sha256": "07724dd062eef5096955924d76747cb072fc428717573706d191d9e34c9f32cb", + "bytes": 285 + }, + { + "path": "cbz/sources/legacy-v20/engine/model.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/model.py", + "sha256": "0ff53aa92bd3fffa9a554863e41bf28424cd8e814d729f7148189325b8f58102", + "bytes": 10033 + }, + { + "path": "cbz/sources/legacy-v20/engine/preservation.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/preservation.py", + "sha256": "199114b475e0287ae43f5b4893ae4b9cfcf4dccf63c8deb067b13afb797a7e83", + "bytes": 2117 + }, + { + "path": "cbz/sources/legacy-v20/engine/research_evidence.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/research_evidence.py", + "sha256": "14cc8e5a668df4c99be21bccec7a6a25bc7abc4492d0fda7b47c4a194ae0322e", + "bytes": 5313 + }, + { + "path": "cbz/sources/legacy-v20/engine/retained_worker_compat.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/retained_worker_compat.py", + "sha256": "88e59a603ce620983a4b18b55eb886f805a58da9e1ede24e3f0f68835b84ae02", + "bytes": 5392 + }, + { + "path": "cbz/sources/legacy-v20/engine/runtime_schema.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/runtime_schema.json", + "sha256": "204adedc01ed0e44a6cc2d023bd279bd666c07b1b99aaddd2e490643fcf58a29", + "bytes": 1804 + }, + { + "path": "cbz/sources/legacy-v20/engine/schema.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/schema.json", + "sha256": "643905022fe7b057c2acc6b8375e3e9c02a3eed51c0e635a8dc89783f022830f", + "bytes": 2324 + }, + { + "path": "cbz/sources/legacy-v20/engine/schemas/import_applicability.schema.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/schemas/import_applicability.schema.json", + "sha256": "1c730feb1a7f473b252aca2428c8ee858c27a6c7b6b3035e211f1fa33ff59e5c", + "bytes": 1898 + }, + { + "path": "cbz/sources/legacy-v20/engine/schemas/source_provenance.schema.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/schemas/source_provenance.schema.json", + "sha256": "047667c5e77c3e4f34a9fd864a2801d0d8f056e2cd404fc4a17eadc125663040", + "bytes": 3677 + }, + { + "path": "cbz/sources/legacy-v20/engine/source_custody.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/source_custody.py", + "sha256": "f41c54146166d3cecb94546381659b354dd1152af6dfbf870b1534b88213a470", + "bytes": 25399 + }, + { + "path": "cbz/sources/legacy-v20/engine/source_provenance.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/source_provenance.json", + "sha256": "e0174b1c9e3a3786c71fe06c4f143b60ee5549af59f3f636006a77b63ea2d080", + "bytes": 113219 + }, + { + "path": "cbz/sources/legacy-v20/engine/source_statement_comparisons.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/source_statement_comparisons.json", + "sha256": "011ae5cc0773c8ca26323f010d4edda5533c08605c49e85ed7347ea9cb284e11", + "bytes": 135876 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests/test_adversarial_v17.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests/test_adversarial_v17.py", + "sha256": "a4904ee3ee06512e5b5891c528f56135e0688783009bc884a49a010dadcf9852", + "bytes": 19587 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests/test_certificates_v17.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests/test_certificates_v17.py", + "sha256": "388dbeb02793a18260a8a474e6dde197b277342618a268a1ac7ea10b91d7150e", + "bytes": 8292 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests/test_conductor.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests/test_conductor.py", + "sha256": "c7ef3357a455c875149d6c8980d9bbdf5fcd3ca6a7074ce4fd7243e46eb6e227", + "bytes": 6470 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests/test_engine_integrity_v17.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests/test_engine_integrity_v17.py", + "sha256": "2201e6ed5312b9783fcc62d6eba3934fc8bd8b424ca1b335ac828405fe2ba21d", + "bytes": 5815 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests/test_handoff_references.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests/test_handoff_references.py", + "sha256": "f2cd6c8cbfee97f6bf5c1b70f78da76c7c4b6d9f7763a89287c6cda6285544f8", + "bytes": 1998 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests/test_http.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests/test_http.py", + "sha256": "e33c78c179028637c6b6ff7c4928e98c9a395dd8405d9d58d31e4cbf613247b8", + "bytes": 3543 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests/test_negative.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests/test_negative.py", + "sha256": "433649511d02806b31fd92cdae8f7fbc9a8061cb536f8c21068ecdb63639ca65", + "bytes": 3301 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests/test_retained_worker_compat.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests/test_retained_worker_compat.py", + "sha256": "1108b09a28ba24081a2a109563d17e6fd5c2ff7618d750efa859b8560fdb62e5", + "bytes": 3955 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests/test_source_custody.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests/test_source_custody.py", + "sha256": "5c3aba2d4d69c70f8eca0be6ca16e017d146b61bbc142853c025cda6ed863c0f", + "bytes": 5446 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests/test_workers_v17.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests/test_workers_v17.py", + "sha256": "a404d4338330901e161cadfa2eeda0957b75644c9d702d4a03989a28d9e889cf", + "bytes": 3950 + }, + { + "path": "cbz/sources/legacy-v20/engine/tests_v16/test_conductor.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/tests_v16/test_conductor.py", + "sha256": "1efc6bc13f96f3ffe38fd4899df4264529cfdfe47901d9df23485e2c858dc9e8", + "bytes": 4704 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/04cf4c986f29ac7ac33b3cc87feac23f3cf494e0c1b3bf4476e4e6666de46574.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/04cf4c986f29ac7ac33b3cc87feac23f3cf494e0c1b3bf4476e4e6666de46574.raw", + "sha256": "04cf4c986f29ac7ac33b3cc87feac23f3cf494e0c1b3bf4476e4e6666de46574", + "bytes": 10073 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d.raw", + "sha256": "079f9399aef401d58749b3684f3acbb7f49ffdcbcac9f501b79e06c28a7f4e7d", + "bytes": 15902 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc.raw", + "sha256": "0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc", + "bytes": 15160 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432.raw", + "sha256": "14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432", + "bytes": 12536 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b.raw", + "sha256": "1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b", + "bytes": 17646 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/21ce7a29ac0971919c0602f556f1aeba48bb14fffd4193864b3f482185bc1698.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/21ce7a29ac0971919c0602f556f1aeba48bb14fffd4193864b3f482185bc1698.raw", + "sha256": "21ce7a29ac0971919c0602f556f1aeba48bb14fffd4193864b3f482185bc1698", + "bytes": 13835 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/29a0c6d00ce739baf1d29a3163977d8e707e2079e216fba4fee3669cebec127d.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/29a0c6d00ce739baf1d29a3163977d8e707e2079e216fba4fee3669cebec127d.raw", + "sha256": "29a0c6d00ce739baf1d29a3163977d8e707e2079e216fba4fee3669cebec127d", + "bytes": 12741 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/320bc988c468bea4938bb777a2d05952c6ab8e0a384f33725b50de847aeec1eb.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/320bc988c468bea4938bb777a2d05952c6ab8e0a384f33725b50de847aeec1eb.raw", + "sha256": "320bc988c468bea4938bb777a2d05952c6ab8e0a384f33725b50de847aeec1eb", + "bytes": 30935 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a.raw", + "sha256": "380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a", + "bytes": 17734 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/3d938d2223d99f7a8dbaa005b9eb3769813a6f8099a7780200ef048049637c82.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/3d938d2223d99f7a8dbaa005b9eb3769813a6f8099a7780200ef048049637c82.raw", + "sha256": "3d938d2223d99f7a8dbaa005b9eb3769813a6f8099a7780200ef048049637c82", + "bytes": 8500 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/3d952a906553d578876456539a8f0dcd64aedd45099e8394cbe9db99866ec531.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/3d952a906553d578876456539a8f0dcd64aedd45099e8394cbe9db99866ec531.raw", + "sha256": "3d952a906553d578876456539a8f0dcd64aedd45099e8394cbe9db99866ec531", + "bytes": 43927 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da.raw", + "sha256": "451b9d7ffee072a73fc904cab891b6693e3f233808b89df10cce1b57036b65da", + "bytes": 23312 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/56c0b94f9b1fcc1207b8e0bc4d1a7e89b6cba7b285fcbf550fd8dd1d9c30f3e1.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/56c0b94f9b1fcc1207b8e0bc4d1a7e89b6cba7b285fcbf550fd8dd1d9c30f3e1.raw", + "sha256": "56c0b94f9b1fcc1207b8e0bc4d1a7e89b6cba7b285fcbf550fd8dd1d9c30f3e1", + "bytes": 9344 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f.pdf", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f.pdf", + "sha256": "636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f", + "bytes": 326691 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/636aa9274e6acc3bec5f2eec87918cdf72e36386a757615f9e37a5a5c743a03f.txt", + "sha256": "daa4b4918c7fe951a7bfd233dffaef101e58755e34009fa4593f9445bc9cd2c4", + "bytes": 80857 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/65a1037f270b22fc776ac4fb85484b118fe9c8d79f1036ac6c70045180e2a744.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/65a1037f270b22fc776ac4fb85484b118fe9c8d79f1036ac6c70045180e2a744.raw", + "sha256": "65a1037f270b22fc776ac4fb85484b118fe9c8d79f1036ac6c70045180e2a744", + "bytes": 7320 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/69ea7a479a9e8a5150cbe07b373772ab22413a1d81194d5a6a78adf6ada5f03f.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/69ea7a479a9e8a5150cbe07b373772ab22413a1d81194d5a6a78adf6ada5f03f.raw", + "sha256": "69ea7a479a9e8a5150cbe07b373772ab22413a1d81194d5a6a78adf6ada5f03f", + "bytes": 15925 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80.raw", + "sha256": "6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80", + "bytes": 53727 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/767688188b02cda022fae2c411583559ad8f96b3a318293df1c2db8193302706.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/767688188b02cda022fae2c411583559ad8f96b3a318293df1c2db8193302706.raw", + "sha256": "767688188b02cda022fae2c411583559ad8f96b3a318293df1c2db8193302706", + "bytes": 2682 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/7a425f7119dd8a0701fb241769a3e82d80fbd6b148d074f11e1015e826813268.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/7a425f7119dd8a0701fb241769a3e82d80fbd6b148d074f11e1015e826813268.raw", + "sha256": "7a425f7119dd8a0701fb241769a3e82d80fbd6b148d074f11e1015e826813268", + "bytes": 15923 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/7ff9e4a028f24afc731200b14bc5b993c0a874906cf6ea25e8c890afed8cdc53.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/7ff9e4a028f24afc731200b14bc5b993c0a874906cf6ea25e8c890afed8cdc53.raw", + "sha256": "7ff9e4a028f24afc731200b14bc5b993c0a874906cf6ea25e8c890afed8cdc53", + "bytes": 15615 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/830637948365dae801c4ec8382310c7bd69c0ac5735996d7854642e4d698a99d.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/830637948365dae801c4ec8382310c7bd69c0ac5735996d7854642e4d698a99d.raw", + "sha256": "830637948365dae801c4ec8382310c7bd69c0ac5735996d7854642e4d698a99d", + "bytes": 1056 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/83f653393dc6245980f6848e2bfc65ac9ad4c7d8304b028b88764356fd3825b6.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/83f653393dc6245980f6848e2bfc65ac9ad4c7d8304b028b88764356fd3825b6.raw", + "sha256": "83f653393dc6245980f6848e2bfc65ac9ad4c7d8304b028b88764356fd3825b6", + "bytes": 3272 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f.raw", + "sha256": "845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f", + "bytes": 9062 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9.raw", + "sha256": "87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9", + "bytes": 11352 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/8b9376a69fda9f0f231d9502be839ae45d8006d1891ff3e700fa521cc96f6cb4.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/8b9376a69fda9f0f231d9502be839ae45d8006d1891ff3e700fa521cc96f6cb4.raw", + "sha256": "8b9376a69fda9f0f231d9502be839ae45d8006d1891ff3e700fa521cc96f6cb4", + "bytes": 10858 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/8cf417db179ac66fe44018d42d16bc055355c9d075349ed8ac9b3dd72fd4859f.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/8cf417db179ac66fe44018d42d16bc055355c9d075349ed8ac9b3dd72fd4859f.raw", + "sha256": "8cf417db179ac66fe44018d42d16bc055355c9d075349ed8ac9b3dd72fd4859f", + "bytes": 7620 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/910d371ebb4a310a7e2248348ba8cd09d6f3229740525d74ec7d06d8d1470717.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/910d371ebb4a310a7e2248348ba8cd09d6f3229740525d74ec7d06d8d1470717.raw", + "sha256": "910d371ebb4a310a7e2248348ba8cd09d6f3229740525d74ec7d06d8d1470717", + "bytes": 3723 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7.raw", + "sha256": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "bytes": 40261 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7.raw", + "sha256": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "bytes": 18355 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b.raw", + "sha256": "aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b", + "bytes": 53364 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/b529fe3780e1909014b3cb144b9a74156d976bbdc19b6711d0c5b1a1da9e5669.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/b529fe3780e1909014b3cb144b9a74156d976bbdc19b6711d0c5b1a1da9e5669.raw", + "sha256": "b529fe3780e1909014b3cb144b9a74156d976bbdc19b6711d0c5b1a1da9e5669", + "bytes": 23971 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/b7328d4bab97fa2d12622ca730dc698970febc1ea8bcbc0b24555e69e2a66392.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/b7328d4bab97fa2d12622ca730dc698970febc1ea8bcbc0b24555e69e2a66392.raw", + "sha256": "b7328d4bab97fa2d12622ca730dc698970febc1ea8bcbc0b24555e69e2a66392", + "bytes": 24105 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/b7ce509af57b1bdc999813927ee39a4fe12d52fe2c9669e249dddfa30ea3144f.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/b7ce509af57b1bdc999813927ee39a4fe12d52fe2c9669e249dddfa30ea3144f.raw", + "sha256": "b7ce509af57b1bdc999813927ee39a4fe12d52fe2c9669e249dddfa30ea3144f", + "bytes": 4138 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2.raw", + "sha256": "b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2", + "bytes": 26002 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028.raw", + "sha256": "bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028", + "bytes": 1782 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769.raw", + "sha256": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769", + "bytes": 10272 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9.raw", + "sha256": "c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9", + "bytes": 11467 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733.raw", + "sha256": "c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733", + "bytes": 18174 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/c35de0d50d9f0b7df664d8f3b4c41d7ddcbfcc5ed251c31b309e9c3532fd7d75.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/c35de0d50d9f0b7df664d8f3b4c41d7ddcbfcc5ed251c31b309e9c3532fd7d75.raw", + "sha256": "c35de0d50d9f0b7df664d8f3b4c41d7ddcbfcc5ed251c31b309e9c3532fd7d75", + "bytes": 12345 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb.raw", + "sha256": "c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb", + "bytes": 11811 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/c8bd489ca3fbb3760f7b2d53e7385131ac5336c51ba983e00e4d540fe2f00aaa.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/c8bd489ca3fbb3760f7b2d53e7385131ac5336c51ba983e00e4d540fe2f00aaa.raw", + "sha256": "c8bd489ca3fbb3760f7b2d53e7385131ac5336c51ba983e00e4d540fe2f00aaa", + "bytes": 34629 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/cc0f49b407337af0e1ce232b0ca2aa9f611ae7a1ecf1c74f2d430d6490336445.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/cc0f49b407337af0e1ce232b0ca2aa9f611ae7a1ecf1c74f2d430d6490336445.raw", + "sha256": "cc0f49b407337af0e1ce232b0ca2aa9f611ae7a1ecf1c74f2d430d6490336445", + "bytes": 5223 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/d28aa700ba83ca139b7b29b6ff06cc39c725470b710af10728867ec10c8ca985.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/d28aa700ba83ca139b7b29b6ff06cc39c725470b710af10728867ec10c8ca985.raw", + "sha256": "d28aa700ba83ca139b7b29b6ff06cc39c725470b710af10728867ec10c8ca985", + "bytes": 7620 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05.raw", + "sha256": "d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05", + "bytes": 16948 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/e3bb8751fbdaf0db075342a31dd208c1300c6e93a1c3c8a7c3b255860442551b.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/e3bb8751fbdaf0db075342a31dd208c1300c6e93a1c3c8a7c3b255860442551b.raw", + "sha256": "e3bb8751fbdaf0db075342a31dd208c1300c6e93a1c3c8a7c3b255860442551b", + "bytes": 3700 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/f821d911aaba767677f341f4b6510e05fc39e15238d5e4f656e5000644293f58.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/f821d911aaba767677f341f4b6510e05fc39e15238d5e4f656e5000644293f58.raw", + "sha256": "f821d911aaba767677f341f4b6510e05fc39e15238d5e4f656e5000644293f58", + "bytes": 3691 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/f8289546ee82fb386a0d0b6b54fbb99f258a2dc2a959ae231ae80cb4baa61e1e.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/f8289546ee82fb386a0d0b6b54fbb99f258a2dc2a959ae231ae80cb4baa61e1e.raw", + "sha256": "f8289546ee82fb386a0d0b6b54fbb99f258a2dc2a959ae231ae80cb4baa61e1e", + "bytes": 3912 + }, + { + "path": "cbz/sources/legacy-v20/engine/upstream_sources/fa6d443fd5eeeb21c0d311de4d11eb5b406758f3c5ff09a222d02ba54bd0752c.raw", + "original_path": "/workspace/cbz0/legacy-v20/engine/upstream_sources/fa6d443fd5eeeb21c0d311de4d11eb5b406758f3c5ff09a222d02ba54bd0752c.raw", + "sha256": "fa6d443fd5eeeb21c0d311de4d11eb5b406758f3c5ff09a222d02ba54bd0752c", + "bytes": 17658 + }, + { + "path": "cbz/sources/legacy-v20/engine/validation_logs/independent_demo.stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/validation_logs/independent_demo.stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/validation_logs/independent_demo.stdout.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/validation_logs/independent_demo.stdout.txt", + "sha256": "cbe265b84774e2796e8f1a5620072d58c6c27f6c2fc2e0c0d38b1f24675bcd9f", + "bytes": 1122 + }, + { + "path": "cbz/sources/legacy-v20/engine/validation_logs/independent_example.stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/validation_logs/independent_example.stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/validation_logs/independent_example.stdout.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/validation_logs/independent_example.stdout.txt", + "sha256": "cf5cb1f752716b0fec0b2d315c4b4ede56ed83721e67dc02867c056635f18d51", + "bytes": 142 + }, + { + "path": "cbz/sources/legacy-v20/engine/validation_logs/independent_summary.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/validation_logs/independent_summary.json", + "sha256": "10198a731524f6635a422978a748af2662927af2afa03b63739bd8d02faaf65b", + "bytes": 1182 + }, + { + "path": "cbz/sources/legacy-v20/engine/validation_logs/independent_verify.stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/validation_logs/independent_verify.stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/validation_logs/independent_verify.stdout.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/validation_logs/independent_verify.stdout.txt", + "sha256": "4d907377d8072f1c93ec315f3dba8b52ec709f20dce9049bf667313b02523b7d", + "bytes": 2200 + }, + { + "path": "cbz/sources/legacy-v20/engine/validation_logs/working_tree_verify.stderr.txt", + "original_path": "/workspace/cbz0/legacy-v20/engine/validation_logs/working_tree_verify.stderr.txt", + "sha256": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855", + "bytes": 0 + }, + { + "path": "cbz/sources/legacy-v20/engine/validation_logs/working_tree_verify.stdout.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/validation_logs/working_tree_verify.stdout.json", + "sha256": "4d907377d8072f1c93ec315f3dba8b52ec709f20dce9049bf667313b02523b7d", + "bytes": 2200 + }, + { + "path": "cbz/sources/legacy-v20/engine/verification_report.json", + "original_path": "/workspace/cbz0/legacy-v20/engine/verification_report.json", + "sha256": "eb4c9ac3ec35e1d75b09a5bb1e62f4843aaea2dfa47a28dafd89d087f9b63ebf", + "bytes": 5429 + }, + { + "path": "cbz/sources/legacy-v20/engine/verify.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/verify.py", + "sha256": "e2412e8f60203f6942a8b921f6f76b3704cf4879773351327266050faab7f193", + "bytes": 6069 + }, + { + "path": "cbz/sources/legacy-v20/engine/verify_example.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/verify_example.py", + "sha256": "d4e97a56b0817ee30b322b8066e8b8abe3eebef624f1dce7169bfdb5a2884feb", + "bytes": 1905 + }, + { + "path": "cbz/sources/legacy-v20/engine/verify_reference_index.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/verify_reference_index.py", + "sha256": "2ca83b967a1a38937e8afb863449cd0243b1d0897aeeb49799ceb974e1b3dd9f", + "bytes": 2622 + }, + { + "path": "cbz/sources/legacy-v20/engine/worker_process.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/worker_process.py", + "sha256": "fab28e600e84a0d3c0a684875c1d0d2a6fa091669223e16c8739a95187b3262c", + "bytes": 5148 + }, + { + "path": "cbz/sources/legacy-v20/engine/workers.py", + "original_path": "/workspace/cbz0/legacy-v20/engine/workers.py", + "sha256": "a56cf42be8a49b3309e7d9fbde40e88c1562608a40273856346c9bc8e18b20ea", + "bytes": 23758 + }, + { + "path": "cbz/sources/legacy-v20/sources/Next_Gate_Literature.zip", + "original_path": "/workspace/cbz0/legacy-v20/sources/Next_Gate_Literature.zip", + "sha256": "440e1749ed0a7729b245a0003fd70695569b7ee93173bee4b1daf080fc82865e", + "bytes": 3973299 + }, + { + "path": "cbz/sources/legacy-v20/literature/LITERATURE_EXPANSION.md", + "original_path": "/workspace/cbz0/legacy-v20/literature/LITERATURE_EXPANSION.md", + "sha256": "9e2d702dce9246bf9cf212c2518de830eb554f2ee743eaec2d552ad03ed4587c", + "bytes": 20248 + }, + { + "path": "cbz/sources/legacy-v20/literature/NEXT_READING_PLAN.md", + "original_path": "/workspace/cbz0/legacy-v20/literature/NEXT_READING_PLAN.md", + "sha256": "555ab53e10833c04f649f1dd5511fc690576830dfb38e25cc0b00287c1900ec8", + "bytes": 4129 + }, + { + "path": "cbz/sources/legacy-v20/literature/OFFLINE_SELECTION.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/OFFLINE_SELECTION.json", + "sha256": "2871022d77f2109b35d1b1df69d97335d5f5162fd85eb108ef126391047212f2", + "bytes": 11645 + }, + { + "path": "cbz/sources/legacy-v20/literature/OFFLINE_SELECTION_PRIOR.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/OFFLINE_SELECTION_PRIOR.json", + "sha256": "fbc7e0d3a1442328f20a78287440af75b75977568a456c6e0ddeed0847e2d9c3", + "bytes": 10797 + }, + { + "path": "cbz/sources/legacy-v20/literature/PRIOR_LITERATURE.md", + "original_path": "/workspace/cbz0/legacy-v20/literature/PRIOR_LITERATURE.md", + "sha256": "b74fe11140e1c646b0ca6ef5910af0e1f03ddc89816ad9acc4ebcf5e19dca6d6", + "bytes": 13849 + }, + { + "path": "cbz/sources/legacy-v20/literature/PROVENANCE_LEDGER.md", + "original_path": "/workspace/cbz0/legacy-v20/literature/PROVENANCE_LEDGER.md", + "sha256": "1c776a07bb6a7b3c0efb2d9a42b04e55c80b4233d3a80f316ada47a66f1ba569", + "bytes": 16509 + }, + { + "path": "cbz/sources/legacy-v20/literature/catalog.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/catalog.json", + "sha256": "f254d47f6d830ae27d697ff0735682e05884fb322a6bbb405ca164905319216d", + "bytes": 99161 + }, + { + "path": "cbz/sources/legacy-v20/literature/expansion_catalog.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/expansion_catalog.json", + "sha256": "ba9d44df614bda568409d1ba45fa5dc1c5141c83521f67b2246d28b5a4eb5861", + "bytes": 67390 + }, + { + "path": "cbz/sources/legacy-v20/literature/expansion_provenance_ledger.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/expansion_provenance_ledger.json", + "sha256": "ac79fdcebaab62a23de1952014cd31040bc3230f56ae6f506293274a94cb833d", + "bytes": 26276 + }, + { + "path": "cbz/sources/legacy-v20/literature/expansion_search_log.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/expansion_search_log.json", + "sha256": "e3d4f1263edac3f2edfa3d3d82dca099aad233f2f399ee2c8e9e393d2e566c36", + "bytes": 8763 + }, + { + "path": "cbz/sources/legacy-v20/literature/primary/E01.pdf", + "original_path": "/workspace/cbz0/legacy-v20/literature/primary/E01.pdf", + "sha256": "f0189eb65987de25e9047a3e5c6984aee455c04b1342a00d09e8f7be55b0f26e", + "bytes": 348163 + }, + { + "path": "cbz/sources/legacy-v20/literature/primary/E01.txt", + "original_path": "/workspace/cbz0/legacy-v20/literature/primary/E01.txt", + "sha256": "d0ec1cfa630b778b24ad4f559d3bfa99855d95368582fac3409abbdbe092f62d", + "bytes": 88815 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch0.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch0.json", + "sha256": "f851af60396e163e65cf8e252cefd4bad47532eed69b7eb4ca4aaccaeb0f436c", + "bytes": 32787 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch1.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch1.json", + "sha256": "894dfcae98b4d6d99a8fb5e8e422b5d25106a27232635b4675c3f2e90ca9c115", + "bytes": 34135 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch10.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch10.json", + "sha256": "715f923af36e00804f0e0336083353e54a5abe17f84a005ebd767eaf8369463a", + "bytes": 27793 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch11.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch11.json", + "sha256": "514531f0f5cd4eb18474426516aab053242d034de64efd6ac3c2f0abcb1e76ab", + "bytes": 29292 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch12.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch12.json", + "sha256": "4b714fdb9901c618bab69fc7ce51d583c12193dc7d95f3d47457eced374fc128", + "bytes": 31856 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch13.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch13.json", + "sha256": "1a3a5aedd17abc5879999b38ec4d9b89b4c32b80dd59a833a3015edc5029a666", + "bytes": 30845 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch14.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch14.json", + "sha256": "19ae506f1ffdefe44c644a2c06b5cdc79650be9806f790d0dbf79023b70bb519", + "bytes": 31120 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch2.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch2.json", + "sha256": "2deb3fb13e3c1e94769030d1a1390ccffba03cf5f48c7145664f4a389efead80", + "bytes": 31128 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch3.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch3.json", + "sha256": "eb3103e80ffbcf34c74a10adf8daf3970ec462dd0aaf95471e93ae48178c0887", + "bytes": 34239 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch4.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch4.json", + "sha256": "465e3fe9de82fa96673c223263916b0528889635fb9611dbaf4098efa8bf1fe3", + "bytes": 33982 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch5.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch5.json", + "sha256": "ef2e982535f32b896c8900d3a7d99304085ca961cd96fce0ba79e112103774e7", + "bytes": 29220 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch6.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch6.json", + "sha256": "85bc3129ba9d9ecf617903135602b3569da8155bd25974d82e6c4a09fd38e0d8", + "bytes": 29656 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch7.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch7.json", + "sha256": "7099201cb27c289f181af4382b271627f5d978376d2e97707005f95e4009970a", + "bytes": 31981 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch8.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch8.json", + "sha256": "75dd5fd3cc2b07137e4b098181758826044e5086660f0ca21b06545c0009daa3", + "bytes": 34219 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/batch9.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/batch9.json", + "sha256": "81b2c0373948c625f9d27c1d5650f7bc669372b0e54d3358db23799a05ef6d9e", + "bytes": 32959 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/open_alpha.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/open_alpha.json", + "sha256": "8e331cfd9c22405b99518f50ed297f288215b2c9ae74abf9054f71543fe29a94", + "bytes": 20070 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/open_core.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/open_core.json", + "sha256": "158a7628c7e59c5aee00f6764e18b57374a1c6646036a05d0502fb1913527565", + "bytes": 26023 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/open_detail.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/open_detail.json", + "sha256": "e509377c7ad83a1a712c9ca66200680d75f5f6f385bdcf3d4390f950bb8a7113", + "bytes": 26224 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/open_more.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/open_more.json", + "sha256": "7feec5dc58b941ecdc340e8519274e28579c3c1db4e4644621fa9719076e380d", + "bytes": 16527 + }, + { + "path": "cbz/sources/legacy-v20/literature/receipts/search1.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/receipts/search1.json", + "sha256": "c8fa68f53a301b79203803b16405ea4ab310488695920b5fd06fdd7c5c025023", + "bytes": 32481 + }, + { + "path": "cbz/sources/legacy-v20/literature/verification.json", + "original_path": "/workspace/cbz0/legacy-v20/literature/verification.json", + "sha256": "45c65ba1b65fe42cd504058bd94b23a57228b18993376181f29f17465a93d5d0", + "bytes": 413 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/CANDIDATES.json", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/CANDIDATES.json", + "sha256": "93a624f60a543d1eea997dc1f9a15631170f807f121fd0882f27a80efe77e884", + "bytes": 2030 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/CONDITIONAL_CHART_LEMMA.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/CONDITIONAL_CHART_LEMMA.md", + "sha256": "3e9df6d13e0b22501a211a0978eb71a03cc47bf84bf77033c8ed5f767a07958f", + "bytes": 17165 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/CONDITIONAL_MORSE.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/CONDITIONAL_MORSE.md", + "sha256": "faed701a5713e2062228f225267190b2d831491ee579cf70108eb67ff59a6b73", + "bytes": 17641 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/CURRENT_MATH_PATH.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/CURRENT_MATH_PATH.md", + "sha256": "0e1293108a6bd7a0e10a9cf90ae2404f09471f9d7aeb25139447495403871168", + "bytes": 8833 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/DERIVATION_PROVENANCE.json", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/DERIVATION_PROVENANCE.json", + "sha256": "b81f0dc8fd4226634dbd8da6a5fd5e0b4a0298962047b2e8992ae14569f68bb6", + "bytes": 7452 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/GAUSSIAN_DERIVATIONS.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/GAUSSIAN_DERIVATIONS.md", + "sha256": "946333fcb7985c4989d4f3030022fe35d06744d108860035633f39c98d4a6781", + "bytes": 27912 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/MATH_REVIEW.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/MATH_REVIEW.md", + "sha256": "277e63297454229b603f9c6c7e13cb6940641cc2be646d072adb690bfd65aca7", + "bytes": 9868 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/PERIODIC_CELL_TAILS.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/PERIODIC_CELL_TAILS.md", + "sha256": "e666de0d2e9dbcfc698b3a0641515e690a7034fea704d89422439b5bd2d30c0a", + "bytes": 4954 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/PRESENTATION_PROVENANCE.json", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/PRESENTATION_PROVENANCE.json", + "sha256": "359164be1eaf55c0b0dbf9f84c97445c54a95a9e6ed9c488b7a5d2406d0bc832", + "bytes": 436 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/RANK_LOCUS_FOLLOWUP.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/RANK_LOCUS_FOLLOWUP.md", + "sha256": "f7b3186efc9272841b01079e05aa45b7b4366b0ea3d3ac0010ef88acff87f2fe", + "bytes": 13002 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/SOURCE_ASSESSMENT.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/SOURCE_ASSESSMENT.md", + "sha256": "6bb90e60e1cac3e8ef8eee9b44bef455b5f0277785777fae60bea887a5d7bc10", + "bytes": 13159 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/UNFOLDING_NEIGHBORHOOD.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/UNFOLDING_NEIGHBORHOOD.md", + "sha256": "e81793337ee542dfe4c0ffb69c6333374f426fe1f017506ad86eb74caa4000a5", + "bytes": 13574 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/UNIFORM_OFF_CONTACT_COUNTS.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/UNIFORM_OFF_CONTACT_COUNTS.md", + "sha256": "2d66fa1a7b24aab9c0e3aa84f1be99a4f96c6a2a902ece17f6bc379e11238c03", + "bytes": 19521 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/ALGEBRA_REVIEW.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/ALGEBRA_REVIEW.md", + "sha256": "7ed3c83365b962b45be93cd257d571ee563ced3c9439ce06949b3ceeb2f64f01", + "bytes": 2478 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/INDEPENDENT_REVIEW.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/INDEPENDENT_REVIEW.md", + "sha256": "555f95c583e1c60224ba69b1baf679b23fa08b648be4f4132804e849eba828e5", + "bytes": 9505 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/RANK_LOCUS_REVIEW.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/RANK_LOCUS_REVIEW.md", + "sha256": "3844b2868722bdc62648481bfd46a5c596aecfe07266d592f2efc4e1a1ae6660", + "bytes": 9267 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/UNFOLDING_REVIEW.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/UNFOLDING_REVIEW.md", + "sha256": "bc78fb6219af11c9f090f5146798b5a47bead2198f829bb2d9d5b5e4df93ce5b", + "bytes": 9722 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/algebra/RANK_LOCUS_ALGEBRA.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/algebra/RANK_LOCUS_ALGEBRA.md", + "sha256": "0832073f16814208895c9d573a3fc19b1e8698a356142d0c4bfe26d506ee6d4b", + "bytes": 2853 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/algebra/REVIEW.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/algebra/REVIEW.md", + "sha256": "7ed3c83365b962b45be93cd257d571ee563ced3c9439ce06949b3ceeb2f64f01", + "bytes": 2478 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/algebra/UNFOLDING_ALGEBRA.md", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/algebra/UNFOLDING_ALGEBRA.md", + "sha256": "31db435ba85aa714557e2c598d723d239cd238c274cb471540b31c44cc631ff9", + "bytes": 3611 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/algebra/check.py", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/algebra/check.py", + "sha256": "4fb5d785329c9b266a078c785e94243ca1ebf4131422bc8c2e1ccb8dff69d1fa", + "bytes": 3892 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/algebra/check_rank_locus.py", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/algebra/check_rank_locus.py", + "sha256": "a5530ae1121dd27d68982e981c240fed2e4b616456acb5f3a9648d24079b8e64", + "bytes": 4955 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/algebra/check_unfolding.py", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/algebra/check_unfolding.py", + "sha256": "02e9d62d44cad11c1e31946e6f06c7f80925bf864a7285c97d62acddfc693b7b", + "bytes": 7312 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/algebra/rank_locus_results.json", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/algebra/rank_locus_results.json", + "sha256": "5ef13024a84acd31c6dea03ef7174ecfec2dcf9ca3f308ef5226f1c0413e6fc0", + "bytes": 2201 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/algebra/rank_locus_stdout.json", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/algebra/rank_locus_stdout.json", + "sha256": "5ef13024a84acd31c6dea03ef7174ecfec2dcf9ca3f308ef5226f1c0413e6fc0", + "bytes": 2201 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/algebra/results.json", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/algebra/results.json", + "sha256": "dd4c9175b704b9f1a2f406f089a63dcd7afefa67154b44feb425460ca0e7de69", + "bytes": 1725 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/reviews/algebra/unfolding_results.json", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/reviews/algebra/unfolding_results.json", + "sha256": "7ef897ffca19e812e1b6d97afb727d2bd9283fab05f103543c282bd069530c7c", + "bytes": 4425 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/symbolic_controls.json", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/symbolic_controls.json", + "sha256": "0c9b44093f92ca852f3cc560eef0afaf311b93fad4c0f82af758108d113d76f3", + "bytes": 691 + }, + { + "path": "cbz/sources/legacy-v20/mathematics/symbolic_controls.py", + "original_path": "/workspace/cbz0/legacy-v20/mathematics/symbolic_controls.py", + "sha256": "90f07fe6828b754754e27dbf845f33a1ce59253c809dbb0ebe7229f909c40716", + "bytes": 1896 + } + ], + "files_verified": 333 +} diff --git a/cbz/evidence/website-foundation-20261029/archive/LEGACY_COPY_DISPOSITION.json b/cbz/evidence/website-foundation-20261029/archive/LEGACY_COPY_DISPOSITION.json new file mode 100644 index 000000000..dc594008d --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/archive/LEGACY_COPY_DISPOSITION.json @@ -0,0 +1,11 @@ +{ + "status": "REDUCED_CONTRIBUTION_AFTER_VERIFIED_PRESERVATION", + "full_prior_copy_receipt": "FULL_LEGACY_COPY_VERIFICATION.json", + "full_retained_external_copy": "/workspace/cbz0/legacy-v20", + "full_external_files_recompared_before_removal": 333, + "needed_subset_manifest": "../sources/legacy-v20/COPY_MANIFEST.json", + "needed_subset_files": 73, + "removed_copy_scope": "Only this builder own generic Main/cbz/sources/legacy-v20 duplicate; exact source bytes retained externally and needed records copied into this proposal. No original v20 tree deleted by this builder.", + "historical_path_warning": "FULL_LEGACY_COPY_VERIFICATION.json records paths valid at original verification, not current live paths.", + "timestamp": "2026-10-29T17:53:54.181847+00:00" +} diff --git a/cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.json b/cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.json new file mode 100644 index 000000000..8babd188a --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.json @@ -0,0 +1,11 @@ +{ + "source_path": "STATUS.md", + "source_commit": "f20cc54d4d136e854608853372249882eb4c949f", + "git_blob": "0be46963b4e62ae2f3fbc650b4dce902b1a9acca", + "source_url": "https://github.com/d6g8k5htny-coder/main/blob/f20cc54d4d136e854608853372249882eb4c949f/STATUS.md", + "archive_path": "cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.md", + "sha256": "c35de0d50d9f0b7df664d8f3b4c41d7ddcbfcc5ed251c31b309e9c3532fd7d75", + "bytes": 12345, + "matches_git_object": true, + "original_archive_path": "archive/cbz-history/STATUS.pre-cbz-20261029.md" +} diff --git a/cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.md b/cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.md new file mode 100644 index 000000000..0be46963b --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/archive/STATUS.pre-cbz-20261029.md @@ -0,0 +1,61 @@ +# Scientific status snapshot + +**Snapshot date:** 2026-09-29 +**Purpose:** one human-readable status page for the public front door. +**Rule:** this page summarizes source-bound review outcomes; it is not an independent promotion register. + +The D5, SARD-G successor and C6 rows below use the [29 September source-bound reconciliation](docs/STATUS_RECONCILIATION_20260929.md), read at Math- `4d062e2a976abc8800a1ae63a49a943526b6bc0d`. They do not execute Math- GRAPH transitions or refresh the museum/shop's explicitly pinned historical snapshots. + +## ACCEPT — scoped + +| Object | Accepted scope | Source and review | Explicit limits | +|---|---|---|---| +| **D1 — parent lifetime theorem (Theorems A, B, C)** | Theorem A `0 <= 1-p_r <= C r^3`, uniform over compact births, compact positive gaps and all frames; Theorem B compact-mark candidate/elder densities `~ c_{B,K} ell^(-1/3)` with difference `O(ell^(2/3))`, for `B` and `K` of positive length; Theorem C unrestricted leading term `c_{d,L} ell^(-1/3)`. Fixed `d>=2` and `L`, existential constants, read with the congruence erratum, the Section 9 replacement v1.1, wording W1 and `r < L/(4 sqrt 2)` | [Proof](https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md) · [reconciliation](https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md) · [Math-#126](https://github.com/d6g8k5htny-coder/Math-/pull/126) | No numerical `C`, `r_*`, `z_*` or coefficient; no unrestricted difference rate; this row is confined to the Math- `8224783` reconciliation, whose lower composition is planar (`d=2`); the separately reviewed every-fixed-`d` lower bound `1-p_r >= c r^3` was integrated afterwards by [Math-#129](https://github.com/d6g8k5htny-coder/Math-/pull/129) at `e7f8aca41c308f8ad8614b587f75916943c86f27` and is not part of this row's reconciliation scope; no RN/24-jet certificate | +| **D2 — unrestricted lifetime remainder** | Theorem R at its stated existential `O(1)` remainder scope: candidate and elder densities have leading `c ell^(-1/3)` term with bounded remainder for sufficiently small lifetime | [Proof](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md) · [review reconciliation](https://github.com/d6g8k5htny-coder/main/issues/67#issuecomment-5841782206) | No numerical remainder constant or numerical lifetime cutoff; no RN/JETMOD closure | +| **D3 — SIDE24 coefficient calculation** | The coefficient expression for SIDE24 in dimensions 2 and 3, including cone moments, all-direction periodization comparison, covariance/Schur transfer, and outward special-function arithmetic | [Proof/package](https://github.com/d6g8k5htny-coder/Math-/tree/main/coefficients/side24_v1) · [review](https://github.com/d6g8k5htny-coder/main/issues/65#issuecomment-5841269490) · [reconciliation](https://github.com/d6g8k5htny-coder/main/issues/65#issuecomment-5841779222) | Coefficient arithmetic acceptance is separate from any imported parent theorem and from a finite-radius error band | +| **D4 — fixed-remote RN count theorem** | Fixed positive spatial separation `rho`, fixed witness separation `eta`, between-pin height window; conditioned covariance, three determinant factors, endpoint normalizer, contact kernel, and fixed-separation factorial moments | [Proof](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/remote_window_20260924/PROOF.md) · [review](https://github.com/d6g8k5htny-coder/main/issues/76#issuecomment-5841783172) · [reconciliation](https://github.com/d6g8k5htny-coder/main/issues/76#issuecomment-5841861362) | Does not cover shrinking `rho` or `eta`, pin neighborhoods, intermediate scales, all remote heights, or global RN/24-jet closure | +| **D6 — P15 full-price theorem** | Realized disjoint capacity/clutter family with `d_i >= 2`, all independent probabilities, `c_v <= phi(p_v)`, same palette `K >= K_H(d)`, sharp `rho*=1/(3-log(3e-2))` | [Proof](https://github.com/d6g8k5htny-coder/Math-/blob/main/frontiers/full_price_20260924/PROOF.md) · [review reconciliation](https://github.com/d6g8k5htny-coder/main/issues/74#issuecomment-5842112010) | Demand one remains an obstruction; no arbitrary-downset or unrestricted prize-problem extension | +| **D5 — planar pin neighborhoods and global window first moment** | Original weighted six-observation pin law, fixed torus and compact positive-gap marks, all planar frames and indices, counting only critical points other than the conditioned pins M and S: all-height punctured pin disks and fixed scaled-ball/collar first moments are `O(r^3)`; nested `kappa*r^2` microdisks are `O(r^5)`. Intermediate shells and the torus-wide first moment are `O(r^3)` **for the stated between-pin height window**. Existential constants only | [Source-bound reconciliation](https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md) · [planar P2 continuum review](https://github.com/d6g8k5htny-coder/Math-/pull/141#issuecomment-5894512272) · [source ledger](docs/STATUS_RECONCILIATION_20260929.json) | Planar `d=2`, fixed torus, gap bounded away from zero; no all-height global count, higher-dimensional transfer, numerical RN/24-jet certificate, elder-pairing conclusion or sharp C6 factorial order | +| **SARD-G — qualitative robust-chart successor** | The unconditioned planar periodized field and each fixed admissible original two-pin law with its original determinant tilt are almost surely Morse with distinct critical values and no saddle-saddle gradient connection, hence planar Morse-Smale in the completed-measure sense. Uses first-closed-contact charts, fixed atlas axes, corrected v2 A2, R3/R4 and the pinned-law transfer with its genericity input | [Integrated reading rule](https://github.com/d6g8k5htny-coder/Math-/blob/e947ade51defcec1fb75444efbe91ac7fcf43f60/reviews/sard_closure_integration_20260929/READING_RULE.md) · [transfer review](https://github.com/d6g8k5htny-coder/Math-/blob/e947ade51defcec1fb75444efbe91ac7fcf43f60/reviews/sard_closure_integration_20260929/TRANSFER_REVIEW.md) | Per fixed admissible planar law; historical A1/A6 remains AMEND as written. No common probability-one set over uncountably many targets, C103 regional estimate, R0 Boolean transition, near-connection rate, RN/JETMOD closure or quantitative pin-coalescence uniformity | +| **C6 — Fourier count tail and planar factorial upper bound** | At fixed `d>=2`, torus and compact positive-gap marks, Theorem F gives count tail `C exp(-c x^(2/d))` under the original pin law and determinant tilt. Theorem W composes with the dimension's global window mean. In `d=2`, the reviewed planar mean yields `E[N(N-1)] <= C r^3 log(1/r)` and fixed higher factorial orders `C_p r^3 log(1/r)^(p-1)` for the stated window count N, excluding M and S; the tail cap includes all critical points | [Exact reviewed proof](https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md) · [nonauthor review 5356335148](https://github.com/d6g8k5htny-coder/Math-/pull/148#pullrequestreview-5356335148) · [reading note](https://github.com/d6g8k5htny-coder/Math-/blob/4d062e2a976abc8800a1ae63a49a943526b6bc0d/reviews/c6_fourier_completion_20260929/READING_NOTE.md) | Higher-dimensional factorial bounds remain conditional on `G_d`; sharp Gaussian `O(r^3)`/`Theta(r^3)` and the marked-Palm route are not accepted here. No numerical cutoff or parameter-uniform constants; the abstract barrier is not a Gaussian counterexample | + +## AMEND / open + +| Object | Current reason | Source | +|---|---|---| +| **D5 — remaining quantitative obligations** | The scoped planar first moments above do not complete the historical numerical RN annulus partition/area-weighted budget, all-radius RN or RN/24-jet certificates. Separately, Math-#141's P_d/C_d/I_d/G_d continuum counts were accepted and merged for fixed `d>=2` and torus, compact birth and positive-gap marks with `k>=k_->0`, sufficiently small `r`, the original `W_r/Z_r`, and counts excluding M and S. Pin/collar estimates are all-height; intermediate shells and the global first moment retain the stated between-pin height window. Constants remain existential. These later results are separate from the planar reconciliation above. Proposed GRAPH transitions have not been executed by this summary. | [D5 reconciliation and exclusions](https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md) · [merged #141 proof](https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md) · [A/B review5357858391](https://github.com/d6g8k5htny-coder/Math-/pull/141#pullrequestreview-5357858391) · [C review5357882570](https://github.com/d6g8k5htny-coder/Math-/pull/141#pullrequestreview-5357882570) (OpenAI, source-exposed) | +| **SARD-G A1/A6 — original formulation** | Remains AMEND as written. The separately reviewed robust-chart/fixed-frame successor establishes its own qualitative fixed-law theorem; it does not validate the defective original A1 premise or supply a regional C103 estimate. | [Original-formulation review](reviews/sard_g_successor_a1_a6_20260926/REVIEW.md) · [historical PR](https://github.com/d6g8k5htny-coder/main/pull/122) | + +## Engineering only + +These are useful infrastructure, but they carry **no theorem-acceptance meaning**. + +| Surface | What it provides | +|---|---| +| **[query-](https://github.com/d6g8k5htny-coder/query-)** | Public read-only package and exact-source lookup; default commit `76e1ca09` includes the package and the canonical no-dependency unittest command in CI | +| **[Universal-Law-Workspace](https://github.com/d6g8k5htny-coder/Universal-Law-Workspace)** | Supporting federation/navigation map with `scientific_status_authority: false` | +| **main CI/navigation** | Link, structure, and engineering checks; green runs are not mathematical review | + +## Where to read — public source custody + +The two human maps are this file and the [Math- proof index at the pinned public Math commit](https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/PROOF_INDEX.md). Neither file replaces the underlying proof or review. + +For exact source identity, use [`docs/public-math/sources.json`](docs/public-math/sources.json). It indexes **2,138 intended public text artifacts** and points to 14 JSON shards. Each artifact row carries: + +`repository + path + 40-char commit + Git blob + bytes + sha256`. + +The frozen inventory includes the public `Math-` and `main` mathematics selected for publication and explicitly excludes sandbox, quarantine, and personal paths. It is source visibility/custody only. + +The machine catalog at [`meta-framework/registry.json`](https://github.com/d6g8k5htny-coder/meta-framework/blob/main/registry.json) currently contains only public GitHub sources (`Math-` plus one declared public `google-drive` replica). The query portable stubs likewise point only to public `Math-` commits. Candidate query stubs are not silently promoted into the catalog. + +### Default-branch boundary + +- Pinned Math reading checkout: `82247833b5dd58e04291d55353b52938d73ec614`. +- Pinned query checkout: `89456c5033173c69a304c5fffa781888185675cc`. +- [Math- PR #70](https://github.com/d6g8k5htny-coder/Math-/pull/70) landed nine byte-custody copies at `9d7b6802424fb4715b31999066aafca8ee2f3cca`; [PR #75](https://github.com/d6g8k5htny-coder/Math-/pull/75) added their proof-index pointer. These are public default-branch imports, **not newly accepted mathematics**. Source self-labels were not adopted. +- The `main#59` issue-body file in PR #70 is explicitly a transcription, not original source bytes, so it is not counted as byte custody. +- Open draft AMEND/review PRs remain visible but are not represented here as landed mathematics. + +## Reading rule + +When a reviewed child result imports a parent that remains AMEND or open, keep those facts separate. “ACCEPT — scoped” never means “everything upstream and downstream is accepted.” diff --git a/cbz/evidence/website-foundation-20261029/baseline-config.json b/cbz/evidence/website-foundation-20261029/baseline-config.json new file mode 100644 index 000000000..22aa9ab62 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/baseline-config.json @@ -0,0 +1,161 @@ +{ + "allowed_axioms": [ + "propext", + "Classical.choice", + "Quot.sound" + ], + "cold_start": { + "commands": [ + [ + "python", + "-B", + "-S", + "tools/cbz_baseline.py", + "inspect", + "--root", + "." + ], + [ + "python", + "-B", + "-S", + "tools/cbz_baseline.py", + "run", + "--root", + ".", + "--output", + "/tmp/cbz-baseline-run" + ], + [ + "python", + "-B", + "-S", + "tools/cbz_baseline.py", + "cold-start", + "--root", + "." + ] + ], + "required_answers": [ + "Baseline state", + "Scientific boundaries", + "Cold-start commands", + "Evidence and invariants", + "Unmet criteria" + ], + "status": "cbz/evidence/website-foundation-20261029/STATUS.proposed.md" + }, + "docs": [ + "cbz/evidence/website-foundation-20261029/STATUS.proposed.md", + "cbz/evidence/website-foundation-20261029/PROOF_INDEX.proposed.md", + "cbz/evidence/website-foundation-20261029/GOVERNANCE.proposed.md", + "cbz/evidence/website-foundation-20261029/TOOLING.proposed.md", + "cbz/evidence/website-foundation-20261029/BASELINE.proposed.md", + "cbz/evidence/website-foundation-20261029/INVENTORY.proposed.md", + "cbz/evidence/website-foundation-20261029/DECISIONS.proposed.md" + ], + "external_gate_gaps": { + "G10": "Canonical queue owns full gate execution/acceptance; no portable complete registered gate supplied in this contribution.", + "G2": "Canonical queue owns full gate execution/acceptance; no portable complete registered gate supplied in this contribution.", + "G3": "Canonical queue owns full gate execution/acceptance; no portable complete registered gate supplied in this contribution.", + "G4": "Canonical queue owns full gate execution/acceptance; no portable complete registered gate supplied in this contribution.", + "G5": "Canonical queue owns full gate execution/acceptance; no portable complete registered gate supplied in this contribution.", + "G6": "Canonical queue owns full gate execution/acceptance; no portable complete registered gate supplied in this contribution.", + "G7": "Canonical queue owns full gate execution/acceptance; no portable complete registered gate supplied in this contribution.", + "G8": "Canonical queue owns full gate execution/acceptance; no portable complete registered gate supplied in this contribution.", + "G9": "Canonical queue owns full gate execution/acceptance; no portable complete registered gate supplied in this contribution." + }, + "gates": [ + { + "argv": [ + "python", + "-B", + "-S", + "tools/cbz_audit.py", + "selftest" + ], + "id": "G0", + "scope": "Finite static auditor adversarial selftest; no complete Layer A claim", + "sources": [ + "tools/cbz_audit.py", + "tests/test_cbz_audit.py" + ], + "timeout_seconds": 60 + }, + { + "argv": [ + "python", + "-B", + "-S", + "tools/cbz_audit.py", + "scan", + "--root", + "." + ], + "id": "G1", + "scope": "Finite static scan only; semantic/kernel/alignment gaps remain", + "sources": [ + "tools/cbz_audit.py" + ], + "timeout_seconds": 120 + }, + { + "argv": [ + "python", + "-B", + "-S", + "-m", + "unittest", + "discover", + "-s", + "tests", + "-p", + "test_cbz_*.py", + "-v" + ], + "id": "G11", + "memory_mb": 2048, + "scope": "Focused mission-tool engineering selftests only", + "sources": [ + "tools/cbz_audit.py", + "tools/cbz_baseline.py", + "tools/cbz_lean_check.py", + "tools/cbz_refs.py", + "tools/cbz_storage.py", + "tests/test_cbz_audit.py", + "tests/test_cbz_baseline.py", + "tests/test_cbz_lean_check.py", + "tests/test_cbz_refs.py", + "tests/test_cbz_storage.py" + ], + "timeout_seconds": 300 + } + ], + "limits": [ + "Namespaced contribution only, not canonical status/governance.", + "No global CBZ-0/Layer A/theorem certification.", + "Gate PASS records actual command exit and exact source/log hashes only.", + "Output outside root required; no automatic full-regression duplication." + ], + "pins": [ + { + "commit": "a7f602241f759285190d8deebfefb017a6167ee8", + "limits": "Snapshot object identity only; no independently verified consuming cross-repository manifest available.", + "name": "Main", + "object_path": "formal/lean-toolchain", + "repo": ".", + "sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b" + }, + { + "commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "limits": "Snapshot object identity only; no independently verified consuming cross-repository manifest available.", + "name": "Math-snapshot", + "object_path": "formal/lean-toolchain", + "repo": "../../cbz0/repos/Math-", + "sha256": "d5edba4e4b8faad9c1baeadb265716d20d03be4d1a2647dc5e35b0c0325bea7b" + } + ], + "proof_index": "cbz/evidence/website-foundation-20261029/proof-index.json", + "schema": "cbz.baseline.v1", + "tool_registry": "cbz/evidence/website-foundation-20261029/tool-registry.json" +} diff --git a/cbz/evidence/website-foundation-20261029/construction/generate.py b/cbz/evidence/website-foundation-20261029/construction/generate.py new file mode 100644 index 000000000..ba1713e0f --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/construction/generate.py @@ -0,0 +1,189 @@ +#!/usr/bin/env python3 +"""Build a namespaced, evidence-bound proposal; never mutate Git or root docs.""" +from pathlib import Path +import datetime as dt,hashlib,json,shutil +ROOT=Path('/workspace/universal-law/website-repair-20261028') +OUT=ROOT/'cbz/evidence/website-foundation-20261029' +WORK=Path('/workspace/cbz0') +PREFIX=str(OUT.relative_to(ROOT)) +NOW=dt.datetime.now(dt.timezone.utc).isoformat().replace('+00:00','Z') +def sha(p):return hashlib.sha256(Path(p).read_bytes()).hexdigest() +def write(p,j): + p=OUT/p;p.parent.mkdir(parents=True,exist_ok=True);p.write_text(json.dumps(j,indent=2,ensure_ascii=False)+'\n') +def copy(src,rel): + src=Path(src);p=OUT/rel;p.parent.mkdir(parents=True,exist_ok=True);shutil.copy2(src,p);assert sha(src)==sha(p);return {'path':str(p.relative_to(ROOT)),'sha256':sha(p),'original_path':str(src)} +def load(p):return json.loads(Path(p).read_text()) +def canon(j):return hashlib.sha256(json.dumps(j,sort_keys=True,separators=(',',':'),ensure_ascii=False).encode()).hexdigest() +def binding(rel):return {'path':rel,'sha256':sha(ROOT/rel)} +evidence=[] +for name in ['MAIN_PROOF_INDEX.json','QUARANTINE_BOUNDARIES.json','STATEMENT_ALIGNMENT_GAPS.json','RESULT.json','REPORT.txt','TOOL_REGISTRY.json','portable-main-receipt.json','main-git-source-bindings.json','math-resource-boundary.json','portable-tests-green-final.log','portable-tests-optimized-final.log','main-tests-with-pinned-toolchain.log','main-tests-with-pinned-toolchain-optimized.log']: + evidence.append(copy(WORK/'lean-foundation'/name,'sources/lean-foundation/'+name)) +for folder,names in {'auditor':['G0.json','G1-main.json','TOOL_REGISTRY_ENTRY.json','REPORT.md','selftest-negative-controls.json'],'ref-tool':['registry.json','REPORT.txt','mutations.json','scale.json','test.log','test-optimized.log'],'storage':['TOOL_REGISTRY_ENTRY.json','REPORT.txt']}.items(): + for name in names: + if (WORK/folder/name).exists():evidence.append(copy(WORK/folder/name,'sources/tooling/'+folder+'/'+name)) +evidence.append(copy(WORK/'MISSION.md','sources/MISSION.md')) +evidence.append(copy(WORK/'DECISIONS.jsonl','sources/prior-decisions.jsonl')) +graph_source=WORK/'repos/Math-/frontiers/downstream_gate_20260925/GRAPH.json' +graph_binding=copy(graph_source,'sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json');evidence.append(graph_binding) +main=load(WORK/'lean-foundation/MAIN_PROOF_INDEX.json');groups=load(WORK/'lean-foundation/QUARANTINE_BOUNDARIES.json');gaps=load(WORK/'lean-foundation/STATEMENT_ALIGNMENT_GAPS.json');graph=load(graph_source) +dataset_path=OUT/'sources/legacy-v20/engine/dataset.json';dataset=load(dataset_path) +dataset_binding=binding(str(dataset_path.relative_to(ROOT))) +source_manifest=[] +for group in groups['entries']: + for source in group['source_files']: + src=WORK/'repos/Math-'/source['path'];assert sha(src)==source['sha256'],str(src) + b=copy(src,'sources/Math-/'+source['path']);source_manifest.append(b) +write(Path('sources/math-source-manifest.json'),{'scope':'all 162 exact current Math Lean source files named by worker boundaries','repository_commit':groups['Math_current_commit'],'files':source_manifest}) +records=[];categories={k:[] for k in ['closed_main_arithmetic','legacy_v20_application_quarantines','current_math_application_quarantines','math_group_quarantines','alignment_gaps']} +receipt=binding(PREFIX+'/sources/lean-foundation/portable-main-receipt.json') +for p in main['proofs']: + ident='MAIN:'+p['declaration'];path=str(Path(p['source_path']).relative_to(ROOT));assert sha(ROOT/path)==p['source_sha256'] + r={'id':ident,'status':'CLOSED','category':'literal_main_arithmetic','source_hashes':[binding(path),binding('formal/manifest.json')],'source_record_sha256':canon(p),'dependencies':[],'exact_boundary':{'declaration':p['declaration'],'module':p['module'],'statement':p['statement'],'prop_premise_binders':p['prop_premise_binders'],'nonvacuity':p['nonvacuity']},'scientific_closure_limits':p['does_not_claim']+'; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.','axioms':p['axioms'],'kernel_evidence':[receipt],'original_record':p} + records.append(r);categories['closed_main_arithmetic'].append(ident) +qcommon={'status':'QUARANTINED','owner':'none','dependencies':[],'isolation':'Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.','scientific_closure_limits':'Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.'} +obligations={x['conclusion']:x for x in dataset['obligations']} +for p in dataset['records']: + ident='V20:'+p['id'];r=dict(qcommon,id=ident,category='legacy_v20_application',source_hashes=[dataset_binding],source_record_sha256=canon(p),exact_boundary={'record_id':p['id'],'kind':p.get('kind'),'statement':p.get('statement'),'equations':p.get('equations'),'scope':p.get('scope'),'source':p.get('source'),'proof_ref':p.get('proof_ref'),'original_kind_preserved':True},reason='No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.',attempts=['Preserved all exact source-record fields and original dataset/obligation/import/provenance files.','Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure.'],original_record=p,original_obligation=obligations.get(p['id'])) + records.append(r);categories['legacy_v20_application_quarantines'].append(ident) +for ident0,p in graph['nodes'].items(): + ident='MATH_GRAPH:'+ident0;r=dict(qcommon,id=ident,category='current_math_graph_application',source_hashes=[{k:graph_binding[k] for k in ['path','sha256']}],source_record_sha256=canon(p),exact_boundary={'node_id':ident0,'kind':p.get('kind'),'scope':p.get('scope'),'source':p.get('source'),'fingerprint':p.get('fingerprint'),'notes':p.get('notes'),'classification_preserved':p.get('classification'),'full_original_record_preserved':True},reason='The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.',attempts=['Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.','Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed.'],original_record=p) + records.append(r);categories['current_math_application_quarantines'].append(ident) +for p in groups['entries']: + ident='MATH_GROUP:'+p['id'];hashes=[binding(PREFIX+'/sources/Math-/'+s['path']) for s in p['source_files']] + r=dict(qcommon,id=ident,category='current_math_source_group',source_hashes=hashes,source_record_sha256=canon(p),exact_boundary={'repository_commit':p['repository_commit'],'path_boundary':p['boundary'],'source_files':p['source_files']},reason=p['reason'],attempts=['Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.','No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary.'],original_record=p) + records.append(r);categories['math_group_quarantines'].append(ident) +for p in gaps['entries']: + ident='ALIGNMENT:'+p['id'];src=Path(p['source_path']);assert sha(src)==p['source_sha256'];b=copy(src,'sources/alignment/'+p['id']+src.suffix);evidence.append(b) + r=dict(qcommon,id=ident,category='statement_alignment_gap',source_hashes=[{k:b[k] for k in ['path','sha256']}],source_record_sha256=canon(p),exact_boundary={'declarations':p['declarations'],'source_path':p['source_path'],'source_sha256':p['source_sha256'],'gap':p['gap']},reason=p['gap'],attempts=['Source-exposed exact declaration/source comparison recorded by Lean foundation worker; no new scientific acceptance.'],minimal_repair=p['minimal_repair'],original_record=p) + records.append(r);categories['alignment_gaps'].append(ident) +assert len(records)==207 and len({r['id'] for r in records})==207 +index={'schema':'cbz.proof-index.v1','generated_utc':NOW,'baseline_status':'PARTIAL_BASELINE_CONTRIBUTION','scope':'Namespaced proposal only. 31 literal Main arithmetic closures; not an exhaustive Main obligation census. All104 v20 and49 current Math GRAPH applications preserved and quarantined;16 Math groups and7 alignment gaps. Canonical queue/other prose obligations are outside this contribution.','source_commit':main['source_commit'],'latest_portable_checked_commit':main['latest_portable_checked_commit'],'source_record_digest_format':'SHA256 of UTF-8 JSON with sort_keys=True,separators=(comma,colon),ensure_ascii=False; whole original source files also copied byte-for-byte.','records':records,**categories,'source_evidence':evidence,'original_math_graph_edges':graph['edges'],'legacy_obligations_exact':dataset['obligations'],'legacy_imports_exact':dataset['imports'],'coordination':{'canonical_queue':'https://github.com/d6g8k5htny-coder/main/issues/684','canonical_root_pr':'https://github.com/d6g8k5htny-coder/main/pull/685','root_message_observation':'New canonical Main tip81acc060 and #691 prose census reported by coordinating Root; not locally reauthenticated by this builder.','all_main_obligations_complete':False,'remote_cleanup_complete':False}} +write(Path('proof-index.json'),index) +# Registry originals remain exact; normalized active command entries add only explicit scope. +tools=[] +for path,pattern,purpose in [('tools/cbz_audit.py','test_cbz_audit.py','Finite static source inventory and lexical controls; not complete Layer A semantics.'),('tools/cbz_refs.py','test_cbz_refs.py','Exact Git ref snapshot and guarded archive/prune engineering; only Root executes real remote mutations.'),('tools/cbz_storage.py','test_cbz_storage.py','Exact immutable duplicate-storage preservation; no mathematical certification.'),('tools/cbz_lean_check.py','test_cbz_lean_check.py','31 literal arithmetic declarations, all project constants, named-module fresh kernel replay and finite nonvacuity witnesses.'),('tools/formal_gate_check.py','test_formal_gate.py','Existing source/build/kernel/axiom controls; analytic alignment is separate.')]: + testpath='tests/'+pattern + if not (ROOT/testpath).exists() and path.endswith('formal_gate_check.py'):testpath='tests/test_formal_gate_check.py';pattern='test_formal_gate_check.py' + tools.append({'path':path,'sha256':sha(ROOT/path),'purpose':purpose,'self_test':['python','-B','-S','-m','unittest','discover','-s','tests','-p',pattern],'source_hashes':[binding(path)]+([binding(testpath)] if (ROOT/testpath).exists() else []),'status':'OBSERVED_WORKER_EVIDENCE; JOINT_FINAL_RUN_PENDING'}) +write(Path('tool-registry.json'),{'schema':'cbz.tools.v1','generated_utc':NOW,'scope':'Namespaced contribution toolkit; original worker registries copied under sources/tooling and sources/lean-foundation. Complete canonical mission registry remains joint-run work.','tools':tools,'pending_tools':['tools/cbz_baseline.py (owner registers final source/selftests after implementation)','auditor coverage companion (owner supplies exact final registry)'],'original_registry_sources':[e for e in evidence if 'REGISTRY' in e['path'] or e['path'].endswith('/registry.json')]}) +marker='' +intro='This is a namespaced contribution proposal for the single canonical queue, not a competing root status or a complete Main obligation census. ' +docs={} +docs['STATUS']=f'''# Partial Baseline — proposed status + +## Baseline state + +{intro} No CBZ-0 or all-gates-pass claim is made. The 29 October owner directive supersedes older operational approval/review-family rules; it does not weaken mathematical statements, bounds, kernel trust or actual platform permissions. Canonical coordination is [#684](https://github.com/d6g8k5htny-coder/main/issues/684) and [Root PR #685](https://github.com/d6g8k5htny-coder/main/pull/685). This local proposal is based on source commit `{main['source_commit']}` and portable Main receipt at `{main['latest_portable_checked_commit']}`; later canonical Main and prose-obligation work must be reconciled by that queue. + +## Scientific boundaries + +Only **31 literal Nat/Int arithmetic/order declarations** are CLOSED here. All 45 original project constants have empty observed transitive axiom sets. Twenty-nine theorem statements have no Prop-premise binder; the two finite-domain cases have explicit witnesses for every admitted value (`q ∈ [0..6]`, `d ∈ [2,3]`). Four auditor witness constants use only the observed standard `propext`/`Quot.sound` axioms; no custom axiom is introduced. The receipt observes pinned build, named-module fresh kernel replay and finite adversarial controls. It does not identify Gaussian moments, prove analytic coefficient enclosures, discharge a parent theorem, or establish source-statement alignment. + +All **104 v20 application records**, **49 current Math GRAPH records**, **16 exact Math source groups**, and **7 alignment gaps** are QUARANTINED in [proof-index.json](proof-index.json). Definitions, carriers, absent-carrier labels, historical mathematical classifications and full original fields are preserved verbatim inside `original_record`; application quarantine does not make a definition false. Quarantines have owner `none`, exact source hashes, attempts, reasons and isolation. No CLOSED record depends on a quarantine. This is 207 contribution records, not every Main obligation; known prose-obligation work in the canonical queue is outside the census. + +## Cold-start commands + +From a fresh checkout of the eventual contribution commit, install Python 3.10+, Git and the exact Lean toolchain declared by `formal/lean-toolchain`. Use the official Lean 4.34.1 release (commit `5045d0056413266e57c625dcd7c365b10e377c52`, archive SHA256 `47bf4bbd78f70c2e9670598ab7124d92b6efb7330ff33e5fbb4030f6fd72e4e4`); keep inherited proxy/CA trust and place that release's `bin` on PATH. Confirm `lean --version`, `lake --version` and `leanchecker` are available. Do not substitute an arbitrary Lean installation. + +```sh +python -B -S tools/cbz_baseline.py inspect --root . +python -B -S tools/cbz_baseline.py run --root . --output /tmp/cbz-baseline-run +python -B -S tools/cbz_baseline.py cold-start --root . +python -B -S tools/cbz_lean_check.py +``` + +The baseline CLI defaults to this namespaced `baseline-config.json`; use `--config` for another explicit configuration. Outputs must be outside the source root. The integrated runner is under implementation and remains INCOMPLETE until its actual source-bound receipt exists; the commands above are proposed executable entry points, not recorded successes. The Lean command writes `formal/.lake/cbz-evidence/receipt.json` and can establish only its stated arithmetic scope. A nonzero exit, missing command/tool/dependency, missing receipt, source mismatch or incomplete coverage remains unmet. + +## Evidence and invariants + +Read this file first, run the commands, then use [PROOF_INDEX.proposed.md](PROOF_INDEX.proposed.md), [TOOLING.proposed.md](TOOLING.proposed.md), and [BASELINE.proposed.md](BASELINE.proposed.md) to interpret the exact result. Machine records bind copied source bytes and receipt hashes. The prior local STATUS is preserved exactly in [archive/STATUS.pre-cbz-20261029.md](archive/STATUS.pre-cbz-20261029.md), with its Git-blob/SHA256/source-link receipt; historical acceptance text remains history rather than kernel promotion. + +Immutable A1–A8: no placeholders presented as closed; no unverified/custom axiom injection; no floating-point bound certification; no weakened bounds; no silent test removal; explicit vacuity/nonvacuity limits; actual observed statuses; auditors tested adversarially and limited to demonstrated scope. Source scans, hashes, CI success, reviews and merges do not replace a kernel certificate or exact statement/model alignment. Historical source/evidence copies are isolated data and are not active imports. Failed checks remain visible. + +## Unmet criteria + +All G0–G11 remain INCOMPLETE as a joint final baseline: prior worker successes are scoped observations, not a final federation receipt. Current Math project execution/kernel/axiom closure, full semantic Layer A coverage, complete Main prose-obligation census, final regression, pins, status truth, zero-context cold start, Git/tooling hygiene and final administrative integration remain joint work. The earlier remote interval inventory observed 2,115 branches, 69 open PRs and 26 tags; it does not describe subsequent cleanup. Classic branch-protection reads returned HTTP403; no green assumption follows. Root owns current remote receipts and serial integration. No cleanup completion is claimed here. +''' +docs['PROOF_INDEX']=f'''# Proof index — proposed contribution + +{intro} + +The authoritative contribution data is [proof-index.json](proof-index.json): 31 CLOSED literal Main arithmetic records and 176 QUARANTINED application/source/alignment records. Every record has a unique ID, exact source hashes, dependencies, exact boundary, closure limits and its full original record. All104 v20 dataset records and their104 obligations, imports and frozen/source-provenance JSON remain exact copies. Current Math GRAPH49 and55 original edges are retained; source classifications/reviewer provenance are not rewritten. + +CLOSED means only the exact Lean declaration string in `exact_boundary.statement`, with the observed empty project axiom set and explicit premise-witness scope. It does not mean a paper theorem, Gaussian field model, moment identity, Palm identification, coefficient enclosure, geometric carrier or prose obligation is closed. See [STATUS.proposed.md](STATUS.proposed.md) for the31closure/nonvacuity boundary and actual receipt identity. + +QUARANTINED means application closure is not established at this exact boundary. Definitions and carriers retain their original kinds and exact fields. An absent historical carrier stays absent; later constructions do not establish byte identity. The16group record source hashes cover all162 current Math Lean files at `{groups['Math_current_commit']}`. The7alignment records preserve exact declaration/path/hash gaps and minimal repairs. Resource-limited execution does not retract historical evidence or prove a theorem false. + +Quarantine owner is `none`; no background maintenance, retries, approval queue or new research front is introduced. Reopening requires exact statement/model/carrier identity, missing nonvacuity/application evidence and an actual source-bound kernel/axiom result without weakened bounds. CLOSED dependencies are empty and import only the dependency-free Main formal package, so this contribution does not rely on quarantined Math sources. Full Main obligations outside this207recordcontribution remain explicitly uncounted. +''' +docs['GOVERNANCE']='''# Governance — proposed contribution + +The current owner Crystalline Baseline directive controls this contribution. Prior operational approval freezes, review-family rules and repeated permission ceremonies are superseded where they conflict. Historical authorship, mathematical hypotheses, review provenance, unresolved findings and actual platform permissions remain intact. This proposal is submitted through the single canonical #684/#685 queue; it does not create another canonical root or authorize concurrent remote writers. + +Layer A is immutable: A1 no logical placeholders called closed; A2 no unverified/new axioms; A3 exact arithmetic/certification only, no floating-point certification; A4 no weakened bounds; A5 no removed/disabled failing tests; A6 explicit vacuity and witnesses; A7 statuses match actual observed source/kernel/build/audit scope; A8 auditors have real adversarial controls and never exceed demonstrated scope. Historical informal acceptance is not rewritten as kernel proof. + +Layer B is agent-owned procedure: perform authorized reversible work, minimize ceremony, use actual gates, preserve exact old refs/bytes before cleanup, keep one Root remote writer, and record explicit inaccessible/unknown items. No new research fronts or unrelated infrastructure expansion. A missing permission remains a tool gap, not an inferred green result. No permanent timers or maintenance owners are created for quarantines. + +Layer C is append-only decisions. The contribution decision log records the owner directive, exact source preservation, literal arithmetic limit, application quarantine, and the later discovery of another canonical Root. Source/execution contributors may self-review engineering; no new scientific independence is fabricated. Canonical integration belongs to the existing Root queue. + +The full terminal contract has12criteria: clean scoped Git/worktrees/stashes; no open PR/dangling branch/unreferenced unmerged tag; every obligation exactly CLOSED or QUARANTINED; complete Layer A accounting; full regression; Lean build/kernel/axioms; declared mutation threshold; consistent pins; documented self-verified tools; mutually truthful canonical surfaces; STATUS-only zero-context rerun; complete decisions/no administrative residue. This contribution asserts none of these federation-wide conjunctions. +''' +docs['TOOLING']='''# Tooling — proposed contribution + +The machine registry is [tool-registry.json](tool-registry.json). Original worker registries/reports are preserved under sources/tooling/ and sources/lean-foundation/. Source hashes, exact commands and scope limits accompany active tools. The baseline runner and coverage companion remain pending final registration; no complete tool-hygiene claim is made. + +| Tool | Command/self-verification | Demonstrated boundary | +|---|---|---| +| cbz_audit.py | `python -B tools/cbz_audit.py selftest`; `python -B tools/cbz_audit.py scan --root .` | finite lexical/source inventory;43normal and optimized tests,12/12finite mutants in original worker receipt; not semantic Layer A completion | +| cbz_lean_check.py | `python -B -S tools/cbz_lean_check.py`; unittest `test_cbz_lean_check.py` |31literal Main statements,45original constants, finite witness domains, named-module fresh kernel replay and6controls; analytic alignment excluded | +| formal_gate_check.py | see original lean-foundation registry; unittest `test_formal_gate_check.py` | existing build/kernel/target-axiom and source controls; no source parent theorem inference | +| cbz_refs.py | unittest `test_cbz_refs.py`; normal and optimized modes |22tests,6safety mutations,2215-tip disposable scale fixture; the fixture count is not the observed2115remote-branch count. Root alone uses mutation commands against real remotes | +| cbz_storage.py | unittest `test_cbz_storage.py`; normal and optimized modes | exact immutable duplicate bytes/paths/modes and verified archive preservation; no mathematical effect | +| cbz_baseline.py | `inspect`, `run`, `cold-start` commands in STATUS.proposed.md | namespaced configuration/receipt/source/doc consistency only; missing gates stay INCOMPLETE | + +Use the pinned Lean4.34.1 release and default inherited proxy/CA. The worker verified restored runtime/header/static-library bytes against official archive members, preserved earlier failed attempts, and observed all9Math dependency revisions. Math cache/build residue remains explicit; a source-readiness/static validator is not a current project kernel execution. + +Archive/source copies are data, not tools to execute blindly. The preservation/generation scripts and original registries retain their one-off scopes. No scanner, hash check, fixture, merged PR or green unit test substitutes for exact source-statement alignment, nonvacuity, full regression or scientific review. +''' +docs['BASELINE']='''# Partial Baseline — proposed contribution + +This proposal is Partial Baseline evidence for the single canonical queue. It contains31literal arithmetic closures and exact preserved quarantines; it is not an exhaustive Main obligation inventory or a complete federation baseline. + +The machine gate marker below starts every G0–G11 at INCOMPLETE. A scoped historical/worker PASS is retained in its own receipt and cannot set a final gate green. Actual source-bound runner receipts must agree with docs, source hashes, command argv, dependencies and live state. A final freeze must rerun all required gates after integration. The baseline runner must exit nonzero for missing semantics, permissions, proof coverage, tests, pins, evidence, cold-start answers or hygiene; an unknown value is unmet. + +Gate order: G0 auditor self-test; G1 full Layer A accounting; G2 all project declarations/axioms; G3 Lean build; G4 kernel replay; G5 regression; G6 declared mutation threshold; G7 cross-repository pin consistency; G8 status truth; G9 cold start; G10 Git hygiene; G11 tooling hygiene. Main's saved31literal kernel receipt is evidence for that scope only, and cannot close all-Main/federation G2–G4. + +Known residue includes current Math execution/cache limits and seven semantic alignment gaps; broader prose obligations in the canonical queue; final regression; all remote/local cleanup and exact disposition receipts; classic branch-protection403; coverage companion/gate registry integration; and final clone/rerun. No failed test is hidden by quarantine. Further exact repairs must preserve statements and bounds. If irreducible residue remains, retain this Partial Baseline label. +''' +docs['INVENTORY']='''# Inventory — proposed contribution + +Scope is explicit and finite:31Main literal arithmetic records;104legacy v20 application records and their complete original dataset/obligation/import fields;49current Math GRAPH records and55edges;16Math source groups covering162Lean files;7source-hash statement-alignment gaps. These categories intentionally overlap at the source/obligation level and are not a count of all federation mathematics. + +Source snapshots: Main original formal source4ef1867175dbe1072a54a02e95f80c4e2c70a4ff; portable Main receipt f20cc54d4d136e854608853372249882eb4c949f; Math current source8151f592918a845bf19eb8eafaf8444540a32734. Exact legacy dataset, frozen graph, provenance and historical ledgers plus needed upstream sources are under sources/legacy-v20. The full legacy333-file/13.61MB tree was byte-verified externally before the proposal was reduced to needed73files/2.40MB; preservation receipts record the full prior copy. No historical bytes were silently destroyed. + +The separate remote worker snapshot observed12repositories,2115branches,69openPRs,26tags and310workflow records over2026-10-29T16:55:11Z–17:04:08Z. Three repositories were archived. All scoped collections reached terminal pages. Universal-Law-Workspace's8exactgitlinks resolved and matched its pins.json but differed from target default tips.36unique exactpin targets resolved at that interval. Classic branch protection was inaccessible403. Native outputs remain in the external federation-inventory archive; they are not a claim about later state. + +Coordinating Root subsequently reported another canonical Root queue (#684/#685), later Main81acc060 and #691 prose-obligation work. These later observations require canonical reconciliation; this proposal does not claim a current remote freeze, completed cleanup, clean Git, or complete Main obligation closure. Root owns new machine receipts and serial integration. +''' +decision={'timestamp':NOW,'layer':'C','action':'Namespace website-foundation contribution after live canonical Root discovery','rationale':'Avoid competing canonical root docs/refs; preserve exact31arithmetic kernel scope and104legacy/49GRAPH application boundaries while canonical queue reconciles wider Main prose obligations.','reversible':True,'evidence':['Current coordinating Root instruction','#684','#685','#691'],'no_git_mutations_by_builder':True} +write(Path('decisions.json'),{'schema':'cbz.decisions.v1','entries':[decision],'prior_decisions_source':'sources/prior-decisions.jsonl'}) +docs['DECISIONS']=f'''# Decisions — proposed contribution + +This append-only contribution log preserves the earlier owner mission/decisions in sources/MISSION.md and sources/prior-decisions.jsonl. It does not replace the canonical queue's ledger. + +- Adopt the current owner baseline directive: immutable A1–A8, agent-owned operational simplification, actual observed gates, no approval loops or new research front. +- Preserve old STATUS bytes before replacement. The exact local pre-CBZ file, Git commit/blob, SHA256 and source URL are retained under archive/. Root STATUS was not replaced by this contribution. +- Preserve all104legacy records and49current GRAPH records with full original fields. Add separate application QUARANTINED overlays; definitions/carriers, historical classifications and provenance remain unchanged. +- Accept only the31literal Main arithmetic declarations as CLOSED within their exact observed kernel/nonvacuity scope; broader Main prose obligations and all analytic/model alignment remain outside that closure. +- Preserve16Math source/hash groups and7alignment gaps with owner none and zero maintenance. No weakening, axiom injection, false refutation claim, test removal or hidden dependency. +- At {NOW}, change delivery to a namespaced proposal after Root reported the live #684/#685 canonical queue and later Main/prose work. This resolves coordination ambiguity prospectively; no competing canonical docs/ref/PR were created by this builder. Root retains serial integration and real remote mutations. + +Machine decision entry: [decisions.json](decisions.json). Remaining administrative work, remote receipts, final integrated source/command checks and all-Main census belong to the canonical queue and remain explicit unmet items. +''' +for name,text in docs.items(): + # Keep prose readable without altering machine IDs or original records. + for a,b in [('All104','All 104'),('GRAPH49','GRAPH 49'),('GRAPH49','GRAPH 49'),('all162','all 162'),('the31','the 31 '),('this207recordcontribution','this 207-record contribution'),('full terminal contract has12criteria','full terminal contract has 12 criteria')]:text=text.replace(a,b) + (OUT/(name+'.proposed.md')).write_text(text.strip()+'\n\n'+marker+'\n') +write(Path('source-manifest.json'),{'schema':'cbz.source-manifest.v1','generated_utc':NOW,'files':[{'path':str(p.relative_to(ROOT)),'sha256':sha(p),'bytes':p.stat().st_size} for p in sorted((OUT/'sources').rglob('*')) if p.is_file()]}) +write(Path('CONTRIBUTION.json'),{'state':'PARTIAL_BASELINE_PROPOSAL','canonical_queue':'https://github.com/d6g8k5htny-coder/main/issues/684','counts':{k:len(v) for k,v in categories.items()},'all_main_obligations_complete':False,'root_docs_modified':False,'remote_writes':False,'git_mutations':False,'source_manifest':'source-manifest.json','proof_index':'proof-index.json','tool_registry':'tool-registry.json','gate_config_owner':'cbz_ref_snapshot_tool','final_joint_receipt':'NOT_OBSERVED'}) +print(json.dumps({'out':str(OUT),'records':len(records),'categories':{k:len(v) for k,v in categories.items()},'source_files':len(source_manifest)})) diff --git a/cbz/evidence/website-foundation-20261029/construction/test_verify_proposal_guard.py b/cbz/evidence/website-foundation-20261029/construction/test_verify_proposal_guard.py new file mode 100644 index 000000000..0e4a255a5 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/construction/test_verify_proposal_guard.py @@ -0,0 +1,20 @@ +from pathlib import Path +import contextlib,hashlib,importlib.util,io,json,tempfile,unittest +ROOT=Path(__file__).resolve().parents[4] +OUT=ROOT/'cbz/evidence/website-foundation-20261029' +p=OUT/'construction/verify_proposal.py';source=p.read_text();site="require(index['coordination']['all_main_obligations_complete'] is False, 'contribution identity invariant failed')" +if source.count(site)!=1:raise RuntimeError('ambiguous mutation site') +index=json.loads((OUT/'proof-index.json').read_text());index['coordination']['all_main_obligations_complete']=True +rows=[] +with tempfile.TemporaryDirectory(prefix='metadata-guard-control-') as temp: + for label,text in [('unmutated',source),('missing_all_main_guard',source.replace(site,"require(True, 'contribution identity invariant failed')"))]: + f=Path(temp)/label/'a/b/c/d/verifier.py';f.parent.mkdir(parents=True);f.write_text(text) + spec=importlib.util.spec_from_file_location(label,f);m=importlib.util.module_from_spec(spec);spec.loader.exec_module(m);m.ROOT=ROOT;m.OUT=OUT + class Guard(unittest.TestCase): + def runTest(self): + with self.assertRaises(AssertionError):m.validate(index,False) + log=io.StringIO();result=unittest.TextTestRunner(stream=log,verbosity=2).run(unittest.TestSuite([Guard()])) + rows.append({'label':label,'tests':result.testsRun,'failures':len(result.failures),'errors':len(result.errors),'skips':len(result.skipped),'log':log.getvalue()}) +if rows[0]['failures'] or rows[0]['errors'] or rows[0]['tests']!=1:raise RuntimeError('unmutated positive harness failed') +if rows[1]['failures']!=1 or rows[1]['errors'] or rows[1]['tests']!=1:raise RuntimeError('mutant was not killed by exactly one assertion failure') +print(json.dumps({'source_sha256':hashlib.sha256(p.read_bytes()).hexdigest(),'scope':'one finite source-guard mutation, not complete validator fault model or theorem certification','rows':rows},indent=2)) diff --git a/cbz/evidence/website-foundation-20261029/construction/verify_proposal.py b/cbz/evidence/website-foundation-20261029/construction/verify_proposal.py new file mode 100644 index 000000000..37cfe5f81 --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/construction/verify_proposal.py @@ -0,0 +1,99 @@ +#!/usr/bin/env python3 +"""Verify contribution data identity, never scientific closure completeness.""" +from pathlib import Path +import copy, datetime as dt, hashlib, json, re +ROOT = Path(__file__).resolve().parents[4] +OUT = ROOT / 'cbz/evidence/website-foundation-20261029' + +def require(condition, message='contribution identity invariant failed'): + if not condition: + raise AssertionError(message) + +def load(p): + return json.loads(Path(p).read_text()) + +def sha(p): + return hashlib.sha256(Path(p).read_bytes()).hexdigest() + +def digest(j): + return hashlib.sha256(json.dumps(j, sort_keys=True, separators=(',', ':'), ensure_ascii=False).encode()).hexdigest() + +def validate(index, hashes=True): + records = index['records'] + require(len(records) == 207 and len({r['id'] for r in records}) == 207, 'contribution identity invariant failed') + require(index['coordination']['all_main_obligations_complete'] is False, 'contribution identity invariant failed') + byid = {r['id']: r for r in records} + require({s: sum((r['status'] == s for r in records)) for s in ['CLOSED', 'QUARANTINED']} == {'CLOSED': 31, 'QUARANTINED': 176}, 'contribution identity invariant failed') + dataset = load(OUT / 'sources/legacy-v20/engine/dataset.json') + graph = load(OUT / 'sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json') + main = load(OUT / 'sources/lean-foundation/MAIN_PROOF_INDEX.json') + for p in dataset['records']: + require(byid['V20:' + p['id']]['original_record'] == p, 'contribution identity invariant failed') + for ident, p in graph['nodes'].items(): + require(byid['MATH_GRAPH:' + ident]['original_record'] == p, 'contribution identity invariant failed') + require(index['legacy_obligations_exact'] == dataset['obligations'] and index['legacy_imports_exact'] == dataset['imports'], 'contribution identity invariant failed') + require(index['original_math_graph_edges'] == graph['edges'], 'contribution identity invariant failed') + for p in main['proofs']: + require(byid['MAIN:' + p['declaration']]['original_record'] == p, 'contribution identity invariant failed') + for r in records: + require(digest(r['original_record']) == r['source_record_sha256'], r['id']) + require(r['source_hashes'] and 'exact_boundary' in r and r['scientific_closure_limits'], 'contribution identity invariant failed') + require(isinstance(r['dependencies'], list), 'contribution identity invariant failed') + if r['status'] == 'CLOSED': + require(r['axioms'] == [] and r['kernel_evidence'] and (r['category'] == 'literal_main_arithmetic'), 'contribution identity invariant failed') + require(not r['dependencies'], 'closed imports cannot be inferred from Q records') + require(r['exact_boundary']['statement'] == r['original_record']['statement'], 'contribution identity invariant failed') + require(r['exact_boundary']['nonvacuity'] == r['original_record']['nonvacuity'], 'contribution identity invariant failed') + else: + require(r['owner'] == 'none' and r['reason'] and r['attempts'] and r['isolation'], 'contribution identity invariant failed') + if hashes: + for b in r['source_hashes'] + r.get('kernel_evidence', []): + require(sha(ROOT / b['path']) == b['sha256'], b) + return True + +def main(): + index = load(OUT / 'proof-index.json') + validate(index) + controls = [] + + def corrupt_record(j): + j['records'][31]['original_record'].pop('scope', None) + + def overclaim(j): + j['coordination']['all_main_obligations_complete'] = True + + def promote_q(j): + j['records'][31]['status'] = 'CLOSED' + + def remove_witness(j): + j['records'][0]['exact_boundary'].pop('nonvacuity') + for name, mutation in [('deleted_original_scope', corrupt_record), ('all_main_overclaim', overclaim), ('quarantine_promoted', promote_q), ('missing_nonvacuity', remove_witness)]: + j = copy.deepcopy(index) + mutation(j) + try: + validate(j, False) + except (AssertionError, KeyError): + controls.append({'name': name, 'detected': True}) + else: + raise AssertionError('missed ' + name) + manifest = load(OUT / 'source-manifest.json') + for b in manifest['files']: + require(sha(ROOT / b['path']) == b['sha256'], 'contribution identity invariant failed') + for p in OUT.glob('*.proposed.md'): + markers = re.findall('', p.read_text()) + require(len(markers) == 1, p) + require(json.loads(markers[0]) == {'G' + str(i): 'INCOMPLETE' for i in range(12)}, 'contribution identity invariant failed') + require(len(list(OUT.glob('*.proposed.md'))) == 7, 'contribution identity invariant failed') + prior = load(OUT / 'archive/STATUS.pre-cbz-20261029.json') + require(sha(OUT / 'archive/STATUS.pre-cbz-20261029.md') == prior['sha256'], 'contribution identity invariant failed') + require(sha(ROOT / 'STATUS.md') == prior['sha256'], 'root STATUS changed during proposal') + registry = load(OUT / 'tool-registry.json') + for tool in registry['tools']: + require((ROOT / tool['path']).is_file() and isinstance(tool['self_test'], list), 'contribution identity invariant failed') + for b in tool['source_hashes']: + require(sha(ROOT / b['path']) == b['sha256'], 'contribution identity invariant failed') + result = {'verified_utc': dt.datetime.now(dt.timezone.utc).isoformat().replace('+00:00', 'Z'), 'result': 'PASS_CONTRIBUTION_DATA_CHECKS_ONLY', 'records': 207, 'closed_literal_arithmetic': 31, 'quarantined': 176, 'original_legacy_records_verified': 104, 'original_graph_records_verified': 49, 'source_files_verified': len(manifest['files']), 'root_status_unchanged': True, 'controls': controls, 'scope': 'Record identity, exact fields, byte hashes, finite metadata/isolation checks and proposal gate markers; no scientific/kernel rerun or exhaustive Main obligation closure.'} + (OUT / 'VERIFICATION.json').write_text(json.dumps(result, indent=2) + '\n') + print(json.dumps(result)) +if __name__ == '__main__': + main() diff --git a/cbz/evidence/website-foundation-20261029/decisions.json b/cbz/evidence/website-foundation-20261029/decisions.json new file mode 100644 index 000000000..3775fd9da --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/decisions.json @@ -0,0 +1,48 @@ +{ + "schema": "cbz.decisions.v1", + "entries": [ + { + "timestamp": "2026-10-29T17:49:55.330138Z", + "layer": "C", + "action": "Namespace website-foundation contribution after live canonical Root discovery", + "rationale": "Avoid competing canonical root docs/refs; preserve exact31arithmetic kernel scope and104legacy/49GRAPH application boundaries while canonical queue reconciles wider Main prose obligations.", + "reversible": true, + "evidence": [ + "Current coordinating Root instruction", + "#684", + "#685", + "#691" + ], + "no_git_mutations_by_builder": true + }, + { + "timestamp": "2026-10-29T18:02:15.348961+00:00", + "layer": "C", + "action": "Seal and adopt exact R3 Main arithmetic evidence without relabeling earlier history", + "rationale": "Actual strengthened wrapper full run passed at a7f60224; baseline receipt/logs/source bytes atomically sealed before future full regression overwrites. Preserve old weak receipt and unknown old baseline-copy linkage. Add frozen finite coverage companion without claiming semantic/full baseline closure.", + "evidence": { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + }, + "reversible": true + }, + { + "timestamp": "2026-10-29T18:05:38.852050+00:00", + "layer": "C", + "action": "Package and register completed portable ref/baseline control replays", + "rationale": "Remove private-path-only replay dependency; preserve positive harness controls, actual assertion-failure mutation kills and distinct-tip scale evidence without claiming federation certification.", + "reversible": true, + "evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/verification/ref_controls.py", + "sha256": "884b8a49ab4e2b73bf7a66ea46a813f7e466f3deeb824ff54d24f86e0d03955e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/verification/baseline_controls.py", + "sha256": "ca0804fe6a56ceec5f7ee762158f59be7194b275f1b7e25b5728688f0721bc00" + } + ] + } + ], + "prior_decisions_source": "sources/prior-decisions.jsonl" +} diff --git a/cbz/evidence/website-foundation-20261029/proof-index.json b/cbz/evidence/website-foundation-20261029/proof-index.json new file mode 100644 index 000000000..dc4ce138e --- /dev/null +++ b/cbz/evidence/website-foundation-20261029/proof-index.json @@ -0,0 +1,58645 @@ +{ + "schema": "cbz.proof-index.v1", + "generated_utc": "2026-10-29T17:49:55.330138Z", + "baseline_status": "PARTIAL_BASELINE_CONTRIBUTION", + "scope": "Namespaced proposal only. 31 literal Main arithmetic closures; not an exhaustive Main obligation census. All104 v20 and49 current Math GRAPH applications preserved and quarantined;16 Math groups and7 alignment gaps. Canonical queue/other prose obligations are outside this contribution.", + "source_commit": "4ef1867175dbe1072a54a02e95f80c4e2c70a4ff", + "latest_portable_checked_commit": "6fc021839072d8c34f41e18e77b0f618c53baa15", + "source_record_digest_format": "SHA256 of UTF-8 JSON with sort_keys=True,separators=(comma,colon),ensure_ascii=False; whole original source files also copied byte-for-byte.", + "records": [ + { + "id": "MAIN:UniversalLaw.Side24.lattice_shell_constant", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "57ca5f588edaecd04ea343e451d01d4ba675b6e451229bdf8c43e158ef333c62", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.lattice_shell_constant", + "module": "UniversalLaw.Side24.Ledger", + "statement": "27 * 27 = 729 ∧ 729 * 2 = 1458", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the lattice-point count or the geometric tail sum; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.lattice_shell_constant", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "27 * 27 = 729 ∧ 729 * 2 = 1458", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the lattice-point count or the geometric tail sum", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.pairing_terms_six", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "67161b3647b0c2ac254f24cceab3c9605ba33ba478f617a2885e3275d41749b3", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.pairing_terms_six", + "module": "UniversalLaw.Side24.Ledger", + "statement": "UniversalLaw.Side24.fact 6 / (2 ^ 0 * UniversalLaw.Side24.fact 0 * UniversalLaw.Side24.fact 6) = 1 ∧\n UniversalLaw.Side24.fact 6 / (2 ^ 1 * UniversalLaw.Side24.fact 1 * UniversalLaw.Side24.fact 4) = 15 ∧\n UniversalLaw.Side24.fact 6 / (2 ^ 2 * UniversalLaw.Side24.fact 2 * UniversalLaw.Side24.fact 2) = 45 ∧\n UniversalLaw.Side24.fact 6 / (2 ^ 3 * UniversalLaw.Side24.fact 3 * UniversalLaw.Side24.fact 0) = 15", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.pairing_terms_six", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "UniversalLaw.Side24.fact 6 / (2 ^ 0 * UniversalLaw.Side24.fact 0 * UniversalLaw.Side24.fact 6) = 1 ∧\n UniversalLaw.Side24.fact 6 / (2 ^ 1 * UniversalLaw.Side24.fact 1 * UniversalLaw.Side24.fact 4) = 15 ∧\n UniversalLaw.Side24.fact 6 / (2 ^ 2 * UniversalLaw.Side24.fact 2 * UniversalLaw.Side24.fact 2) = 45 ∧\n UniversalLaw.Side24.fact 6 / (2 ^ 3 * UniversalLaw.Side24.fact 3 * UniversalLaw.Side24.fact 0) = 15", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.geometric_ratio_constants", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "ff62a8a9dc69d56813651f92132910a54e2efecbe7d9c0c5ba09a601e0ea6829", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.geometric_ratio_constants", + "module": "UniversalLaw.Side24.Ledger", + "statement": "2 ^ 9 = 512 ∧ 288 * 3 = 864", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "that the ratio is below 1/2; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.geometric_ratio_constants", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "2 ^ 9 = 512 ∧ 288 * 3 = 864", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "that the ratio is below 1/2", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.exponent_bounds", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "04ae02700a81589f65fd1a49e28a377a6aa266f13bf4cd8658fe84b968e72666", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.exponent_bounds", + "module": "UniversalLaw.Side24.Ledger", + "statement": "∀ (d : Nat),\n d ∈ [2, 3] →\n UniversalLaw.Side24.sixA d + 2 * UniversalLaw.Side24.sixB d < 84 ∧\n 2 * UniversalLaw.Side24.sixA d + UniversalLaw.Side24.sixB d < 78", + "prop_premise_binders": [ + { + "name": "a._@._internal._hyg.0", + "type": "d ∈ [2, 3]" + } + ], + "nonvacuity": { + "status": "EXPLICIT_FINITE_DOMAIN_WITNESSES_KERNEL_CHECKED", + "evidence": "main-nonvacuity.log + main-nonvacuity-kernel.log", + "witnesses": [ + "CBZNonvacuity.dimensions_inhabited", + "CBZNonvacuity.dimensions_both" + ] + } + }, + "scientific_closure_limits": "the log/exp estimates that follow; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.exponent_bounds", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [ + { + "name": "a._@._internal._hyg.0", + "type": "d ∈ [2, 3]" + } + ], + "statement": "∀ (d : Nat),\n d ∈ [2, 3] →\n UniversalLaw.Side24.sixA d + 2 * UniversalLaw.Side24.sixB d < 84 ∧\n 2 * UniversalLaw.Side24.sixA d + UniversalLaw.Side24.sixB d < 78", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the log/exp estimates that follow", + "nonvacuity": { + "status": "EXPLICIT_FINITE_DOMAIN_WITNESSES_KERNEL_CHECKED", + "evidence": "main-nonvacuity.log + main-nonvacuity-kernel.log", + "witnesses": [ + "CBZNonvacuity.dimensions_inhabited", + "CBZNonvacuity.dimensions_both" + ] + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.pairing_sum_six", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "fa52df6d09a7c90103cd8e849be1110c90a704bf7a538dfe3bea22696066cd28", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.pairing_sum_six", + "module": "UniversalLaw.Side24.Ledger", + "statement": "UniversalLaw.Side24.pairingSum 6 = 76", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the derivative bound 76|x|^6 e^(-|x|^2/2) itself; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.pairing_sum_six", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "UniversalLaw.Side24.pairingSum 6 = 76", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the derivative bound 76|x|^6 e^(-|x|^2/2) itself", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.covariance_relative_bound", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "e4c52223d2c04a12035026d4bcd01d0f0510f2b43133d8c552a79e800703c961", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.covariance_relative_bound", + "module": "UniversalLaw.Side24.Ledger", + "statement": "2 * 10 * 3 = 60 ∧ 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the spectral-norm bound 20E or C_ref >= I/3; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.covariance_relative_bound", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "2 * 10 * 3 = 60 ∧ 60 * UniversalLaw.Side24.imageConstant < 10 ^ 17", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the spectral-norm bound 20E or C_ref >= I/3", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.smaller_eigenvalue_exceeds_third", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "b0918beb142721ba69f193a7d09e08603b2d28039139f93a26ea6d701d9409bc", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third", + "module": "UniversalLaw.Side24.Ledger", + "statement": "58 * 9 < 23 ^ 2", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "monotonicity of the square root; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.smaller_eigenvalue_exceeds_third", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "58 * 9 < 23 ^ 2", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "monotonicity of the square root", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.odd_block_shifted_minors", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "ca71cc5ece271daee9b53f95c7fec47500bf35c2c6ab39e9e41f5510c2069a1b", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.odd_block_shifted_minors", + "module": "UniversalLaw.Side24.Ledger", + "statement": "3 * 1 - 1 = 2 ∧ 3 * 15 - 1 = 44 ∧ 2 * 44 - -9 * -9 = 7", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "Sylvester's criterion; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.odd_block_shifted_minors", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "3 * 1 - 1 = 2 ∧ 3 * 15 - 1 = 44 ∧ 2 * 44 - -9 * -9 = 7", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "Sylvester's criterion", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.density_comparison_below_reported", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "9f6f3ca8a6b4a19f8af095b0ab1b30d8a4fe5854a0f2918cb094e34af9e2017c", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.density_comparison_below_reported", + "module": "UniversalLaw.Side24.Ledger", + "statement": "32 * 10 ^ 106 < 10 ^ 108", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the multiplicative density comparison; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.density_comparison_below_reported", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "32 * 10 ^ 106 < 10 ^ 108", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the multiplicative density comparison", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.period_exponent", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "cca3a7fcaae3c2525e9431847374c816e7df68cdaa1fc1561a333ba83703cec6", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.period_exponent", + "module": "UniversalLaw.Side24.Ledger", + "statement": "24 ^ 2 / 2 = 288", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.period_exponent", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "24 ^ 2 / 2 = 288", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.odd_block_eigenvalues", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "2dc5d58c6f4a0a645e43ee066e84b7d6b90b21cb611e4bdb67379b71375964a2", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.odd_block_eigenvalues", + "module": "UniversalLaw.Side24.Ledger", + "statement": "1 + 15 = 2 * 8 ∧ 1 * 15 - -3 * -3 = 6 ∧ 8 ^ 2 - 58 = 6", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.odd_block_eigenvalues", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "1 + 15 = 2 * 8 ∧ 1 * 15 - -3 * -3 = 6 ∧ 8 ^ 2 - 58 = 6", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.pairing_sum_le_six", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "64510cf32fe37f7e740a6a92ed6a768c70d10d505fe0bd71f138597a3c454391", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.pairing_sum_le_six", + "module": "UniversalLaw.Side24.Ledger", + "statement": "∀ (q : Nat), q ∈ [0, 1, 2, 3, 4, 5, 6] → UniversalLaw.Side24.pairingSum q ≤ 76", + "prop_premise_binders": [ + { + "name": "a._@._internal._hyg.0", + "type": "q ∈ [0, 1, 2, 3, 4, 5, 6]" + } + ], + "nonvacuity": { + "status": "EXPLICIT_FINITE_DOMAIN_WITNESSES_KERNEL_CHECKED", + "evidence": "main-nonvacuity.log + main-nonvacuity-kernel.log", + "witnesses": [ + "CBZNonvacuity.pairing_domain_inhabited", + "CBZNonvacuity.pairing_all_seven" + ] + } + }, + "scientific_closure_limits": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.pairing_sum_le_six", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [ + { + "name": "a._@._internal._hyg.0", + "type": "q ∈ [0, 1, 2, 3, 4, 5, 6]" + } + ], + "statement": "∀ (q : Nat), q ∈ [0, 1, 2, 3, 4, 5, 6] → UniversalLaw.Side24.pairingSum q ≤ 76", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem", + "nonvacuity": { + "status": "EXPLICIT_FINITE_DOMAIN_WITNESSES_KERNEL_CHECKED", + "evidence": "main-nonvacuity.log + main-nonvacuity-kernel.log", + "witnesses": [ + "CBZNonvacuity.pairing_domain_inhabited", + "CBZNonvacuity.pairing_all_seven" + ] + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.image_constant_value", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "e07205e788fbc07a06dc08e85c0e266f27219319f779c15bb51ff9ce797ec5a0", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.image_constant_value", + "module": "UniversalLaw.Side24.Ledger", + "statement": "UniversalLaw.Side24.imageConstant = 21175738586478", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the inequality |D^q K_24(0)-D^q K_infty(0)| < E; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.image_constant_value", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "UniversalLaw.Side24.imageConstant = 21175738586478", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the inequality |D^q K_24(0)-D^q K_infty(0)| < E", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "69fdc9bc5519a3640497d57f20d11552dbad9de8c4a4a552ede5ae7097f39457", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten", + "module": "UniversalLaw.Side24.Ledger", + "statement": "10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "that the partial sum is below exp(288/125) (positivity of the omitted terms is analysis); informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.exp_taylor_partial_sum_gt_ten", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "10 * (125 ^ 20 * UniversalLaw.Side24.fact 20) < UniversalLaw.Side24.expTaylorNumerator", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "that the partial sum is below exp(288/125) (positivity of the omitted terms is analysis)", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.sixth_moment_double_factorial", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "f1827b4c37c774810c1cc000a28b457694b5d71e3bb24cee7d879c0278f4b280", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.sixth_moment_double_factorial", + "module": "UniversalLaw.Side24.Ledger", + "statement": "1 * 3 * 5 = 15", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "that Gaussian derivative contractions at zero are bounded by 15; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.sixth_moment_double_factorial", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "1 * 3 * 5 = 15", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "that Gaussian derivative contractions at zero are bounded by 15", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.exponent_values", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "8225ecabdc300724ab7f800164e444cf826eff8440a6017b30b6949f4c9560d4", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.exponent_values", + "module": "UniversalLaw.Side24.Ledger", + "statement": "UniversalLaw.Side24.sixA 2 = 13 ∧\n UniversalLaw.Side24.sixB 2 = 15 ∧ UniversalLaw.Side24.sixA 3 = 25 ∧ UniversalLaw.Side24.sixB 3 = 27", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.exponent_values", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "UniversalLaw.Side24.sixA 2 = 13 ∧\n UniversalLaw.Side24.sixB 2 = 15 ∧ UniversalLaw.Side24.sixA 3 = 25 ∧ UniversalLaw.Side24.sixB 3 = 27", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.ratio_constant_ordering", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Ledger.lean", + "sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "2a26cb3aab438a37178a664946805792d7450fe282c15c19c7a0a4e46007352e", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.ratio_constant_ordering", + "module": "UniversalLaw.Side24.Ledger", + "statement": "13 ≤ 32 ∧ 28 ≤ 32", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the elementary log/exp bounds; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.ratio_constant_ordering", + "module": "UniversalLaw.Side24.Ledger", + "prop_premise_binders": [], + "statement": "13 ≤ 32 ∧ 28 ≤ 32", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Ledger.lean", + "source_sha256": "ae4a14f3db8cf26668e55e2d2f80e0dcecb0703826b40396d91fb6e0d266d3f7", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the elementary log/exp bounds", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.conditional_third_derivative_variance", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/ConeMoments.lean", + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "1621be2d5c288fae4a646d2cf398dbfae99dee8167fe14c97d0818425df502db", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.conditional_third_derivative_variance", + "module": "UniversalLaw.Side24.ConeMoments", + "statement": "15 - -3 * -3 / 1 = 6", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the Gaussian conditioning formula or the covariance derivatives; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.conditional_third_derivative_variance", + "module": "UniversalLaw.Side24.ConeMoments", + "prop_premise_binders": [], + "statement": "15 - -3 * -3 / 1 = 6", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/ConeMoments.lean", + "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the Gaussian conditioning formula or the covariance derivatives", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.cube_root_simplification", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/ConeMoments.lean", + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "3b96d3384e2a06bc0aea1be2d76cedbf834bf35b23f584b4310060c1f2cb4ac3", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.cube_root_simplification", + "module": "UniversalLaw.Side24.ConeMoments", + "statement": "6 ^ 2 * 2 = 3 * 24", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.cube_root_simplification", + "module": "UniversalLaw.Side24.ConeMoments", + "prop_premise_binders": [], + "statement": "6 ^ 2 * 2 = 3 * 24", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/ConeMoments.lean", + "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.exponential_moment_of_trace", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/ConeMoments.lean", + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "0185272ea3f0d981f0903adf6216e679ce5a1711865da5e7eadaf286a61640c8", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.exponential_moment_of_trace", + "module": "UniversalLaw.Side24.ConeMoments", + "statement": "3 + 5 = 8", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the Gaussian exponential-moment identity; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.exponential_moment_of_trace", + "module": "UniversalLaw.Side24.ConeMoments", + "prop_premise_binders": [], + "statement": "3 + 5 = 8", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/ConeMoments.lean", + "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the Gaussian exponential-moment identity", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.fourth_moment_of_trace", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/ConeMoments.lean", + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "4c9b91200e0d27795ee0f045411a5fd88a21f68faba7615fd4b251051f5b0743", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.fourth_moment_of_trace", + "module": "UniversalLaw.Side24.ConeMoments", + "statement": "3 * 5 ^ 2 * 3 = 25 * 9", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the Gaussian fourth-moment identity; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.fourth_moment_of_trace", + "module": "UniversalLaw.Side24.ConeMoments", + "prop_premise_binders": [], + "statement": "3 * 5 ^ 2 * 3 = 25 * 9", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/ConeMoments.lean", + "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the Gaussian fourth-moment identity", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.hessian_block_eigenvalues", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/ConeMoments.lean", + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "fd566477713804fd07e9b3acbb5d290fbc331931bcf3b4f2705d545a658d3b90", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.hessian_block_eigenvalues", + "module": "UniversalLaw.Side24.ConeMoments", + "statement": "2 + 2 = 4 ∧ 3 + 2 = 5 ∧ 1 < 3 * 2", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the spectral decomposition; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.hessian_block_eigenvalues", + "module": "UniversalLaw.Side24.ConeMoments", + "prop_premise_binders": [], + "statement": "2 + 2 = 4 ∧ 3 + 2 = 5 ∧ 1 < 3 * 2", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/ConeMoments.lean", + "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the spectral decomposition", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.pin_determinant_and_joint_dimension", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/ConeMoments.lean", + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "9de988af56f5ac1152eb19354b1058e61aae64d17a8d0153e281e56f8960c8ba", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.pin_determinant_and_joint_dimension", + "module": "UniversalLaw.Side24.ConeMoments", + "statement": "3 * 1 * 1 = 3 ∧ 2 + 1 + 2 * 3 / 2 = 6 ∧ 3 + 1 + 3 * 4 / 2 = 10", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.pin_determinant_and_joint_dimension", + "module": "UniversalLaw.Side24.ConeMoments", + "prop_premise_binders": [], + "statement": "3 * 1 * 1 = 3 ∧ 2 + 1 + 2 * 3 / 2 = 6 ∧ 3 + 1 + 3 * 4 / 2 = 10", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/ConeMoments.lean", + "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the analytic statement the arithmetic is attached to; the coefficient bound; the parent theorem", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.transverse_covariance_entries_thirds", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/ConeMoments.lean", + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "0f1fdf5fdd74bc35bf7b378fc35d41d7b9c77b38fc9c3cead4b1b5b7f319299c", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.transverse_covariance_entries_thirds", + "module": "UniversalLaw.Side24.ConeMoments", + "statement": "2 + 3 + 3 = 8 ∧ 0 + 3 + 0 = 3 ∧ 2 + 0 + 0 = 2", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the delta formula itself; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.transverse_covariance_entries_thirds", + "module": "UniversalLaw.Side24.ConeMoments", + "prop_premise_binders": [], + "statement": "2 + 3 + 3 = 8 ∧ 0 + 3 + 0 = 3 ∧ 2 + 0 + 0 = 2", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/ConeMoments.lean", + "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the delta formula itself", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.trace_and_traceless_variances", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/ConeMoments.lean", + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "5ed2f4a8d559e166ea0bdbf8c7a638342e4b540a67cd398c22f1bd7518b87d94", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.trace_and_traceless_variances", + "module": "UniversalLaw.Side24.ConeMoments", + "statement": "8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 5 * 12 ∧ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧ 8 - 8 = 0", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "independence beyond zero covariance, which is Gaussian; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.trace_and_traceless_variances", + "module": "UniversalLaw.Side24.ConeMoments", + "prop_premise_binders": [], + "statement": "8 + 8 + 2 * 2 = 20 ∧ 20 * 3 = 5 * 12 ∧ 8 + 8 - 2 * 2 = 12 ∧ 12 = 1 * 12 ∧ 8 - 8 = 0", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/ConeMoments.lean", + "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "independence beyond zero covariance, which is Gaussian", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.cone_moment_m1_thirds", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/ConeMoments.lean", + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "e2dacd7ca5dca89ab3ca7e956fcaaf89bed68706a28e29c53113706368d6d59d", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.cone_moment_m1_thirds", + "module": "UniversalLaw.Side24.ConeMoments", + "statement": "8 = 2 * 4", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "centred Gaussian symmetry; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.cone_moment_m1_thirds", + "module": "UniversalLaw.Side24.ConeMoments", + "prop_premise_binders": [], + "statement": "8 = 2 * 4", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/ConeMoments.lean", + "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "centred Gaussian symmetry", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.cone_moment_m2_algebra", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/ConeMoments.lean", + "sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "7a6d8b521c5d19270667792f1d56083084d700dc8d5dc0dd5099bdace9e904e6", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.cone_moment_m2_algebra", + "module": "UniversalLaw.Side24.ConeMoments", + "statement": "4 * 5 = 20 ∧ 25 - 20 + 24 = 29 ∧ 4 ^ 2 * 3 = 6 * 8", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "the integral identity or the Rayleigh cone integration; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.cone_moment_m2_algebra", + "module": "UniversalLaw.Side24.ConeMoments", + "prop_premise_binders": [], + "statement": "4 * 5 = 20 ∧ 25 - 20 + 24 = 29 ∧ 4 ^ 2 * 3 = 6 * 8", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/ConeMoments.lean", + "source_sha256": "2bcd4a83683188856bce010c3dcdec6904e45a6d73b50b9f3891e632ff58985c", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "the integral identity or the Rayleigh cone integration", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.d2_endpoints_adjacent", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Endpoints.lean", + "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "3248251bd8cbef240653602201e4853841c36f7f298a4b6c5a7b68d7ca4a95a9", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.d2_endpoints_adjacent", + "module": "UniversalLaw.Side24.Endpoints", + "statement": "UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper ∧\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "that c_2,24 lies between them; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.d2_endpoints_adjacent", + "module": "UniversalLaw.Side24.Endpoints", + "prop_premise_binders": [], + "statement": "UniversalLaw.Side24.d2Lower < UniversalLaw.Side24.d2Upper ∧\n UniversalLaw.Side24.d2Upper = UniversalLaw.Side24.d2Lower + 1", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Endpoints.lean", + "source_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "that c_2,24 lies between them", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.d3_endpoints_adjacent", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Endpoints.lean", + "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "ecb9f16323529b15398ca698e2e472c0092ba40710ff20bc09267608fafa979c", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.d3_endpoints_adjacent", + "module": "UniversalLaw.Side24.Endpoints", + "statement": "UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper ∧\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "that c_3,24 lies between them; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.d3_endpoints_adjacent", + "module": "UniversalLaw.Side24.Endpoints", + "prop_premise_binders": [], + "statement": "UniversalLaw.Side24.d3Lower < UniversalLaw.Side24.d3Upper ∧\n UniversalLaw.Side24.d3Upper = UniversalLaw.Side24.d3Lower + 1", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Endpoints.lean", + "source_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "that c_3,24 lies between them", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.endpoints_in_unit_tenth", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Endpoints.lean", + "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "ac6725909f848d1b22595483bd016dd199779c77bdb845626397c5845928e45e", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.endpoints_in_unit_tenth", + "module": "UniversalLaw.Side24.Endpoints", + "statement": "0 < UniversalLaw.Side24.d3Lower ∧ UniversalLaw.Side24.d2Upper < 10 ^ 19", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "anything about the true coefficients; the range (0, 1/10) is a derived artifact-consistency check of the displayed endpoints; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.endpoints_in_unit_tenth", + "module": "UniversalLaw.Side24.Endpoints", + "prop_premise_binders": [], + "statement": "0 < UniversalLaw.Side24.d3Lower ∧ UniversalLaw.Side24.d2Upper < 10 ^ 19", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Endpoints.lean", + "source_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "anything about the true coefficients; the range (0, 1/10) is a derived artifact-consistency check of the displayed endpoints", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "id": "MAIN:UniversalLaw.Side24.d3_below_d2", + "status": "CLOSED", + "category": "literal_main_arithmetic", + "source_hashes": [ + { + "path": "formal/UniversalLaw/Side24/Endpoints.lean", + "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd" + }, + { + "path": "formal/manifest.json", + "sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0" + } + ], + "source_record_sha256": "4266ef1ab44fe1f197dc6e9ae4448b5991d2841cf0155a943d2515a56df31d66", + "dependencies": [], + "exact_boundary": { + "declaration": "UniversalLaw.Side24.d3_below_d2", + "module": "UniversalLaw.Side24.Endpoints", + "statement": "UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower", + "prop_premise_binders": [], + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "scientific_closure_limits": "anything about the true coefficients; the ordering d3 upper < d2 lower is a derived artifact-consistency check of the displayed endpoints; informal/source alignment remains pending. No all-Main obligation census or analytic parent closure.", + "axioms": [], + "kernel_evidence": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/cbz-evidence/receipt.json", + "sha256": "ce4616ef56bb8b3662310b5601175d0347d21681cf7d5d1c2f35080bef3983a7" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/formal-evidence/receipt.json", + "sha256": "f160ede9dcabc20bf4d22a5574d2e4b2f0bc62847b93c99fba5c4216060fcab1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/final-6fc/kernel/MANIFEST.json", + "sha256": "ad9c2c40ac4f164757223201b64554bb007ae883e7434767199719e7ed0d80c0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/cbz-gate/receipt.json", + "sha256": "b7c14c0131fd77faf6c14c7eb80ba33bd796499943e3fd718e6077f12ec1ab6c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/formal-gate/receipt.json", + "sha256": "93cd20d348acec42c4478fd323c566e48792b5ae96e397b2a84647135e1900b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/lean-foundation/SEALED_MAIN_R3_a7f602241f759285190d8deebfefb017a6167ee8/MANIFEST.json", + "sha256": "63ec2b5c11b893e1fbb026133b19c7f7dd004a5ed0e20a3ad2d62a98bccde8c6" + } + ], + "original_record": { + "axioms": [], + "declaration": "UniversalLaw.Side24.d3_below_d2", + "module": "UniversalLaw.Side24.Endpoints", + "prop_premise_binders": [], + "statement": "UniversalLaw.Side24.d3Upper < UniversalLaw.Side24.d2Lower", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Endpoints.lean", + "source_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd", + "manifest_sha256": "38eefbfdd84658cd0f6e18bd7d714458a7522b1021f73b1075e7972a63b9bcb0", + "literal_statement_status": "CLOSED_BY_OBSERVED_BUILD_AND_NAMED_MODULE_KERNEL_REPLAY", + "informal_alignment_status": "PENDING_NOT_INFERRED_FROM_KERNEL", + "does_not_claim": "anything about the true coefficients; the ordering d3 upper < d2 lower is a derived artifact-consistency check of the displayed endpoints", + "nonvacuity": { + "status": "UNCONDITIONAL_NO_PROP_PREMISE" + } + }, + "kernel_evidence_scope": "Actual final portable run at6fc021839072d8c34f41e18e77b0f618c53baa15 after regression:31literal proofs,45project constants,4exact-witness contracts,7actual controls,fresh kernel. Baseline/log/input hashes matched and sealed; no source-parent, Math or federation final-gate claim." + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:C6-01", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "9459d4f4ce16a8892b946460e3af84d36247a76fed5523a8a5b25adb09796685", + "exact_boundary": { + "record_id": "C6-01", + "kind": "Moment consequence", + "statement": "The same cap has a uniformly finite positive stretched-exponential moment under the weighted pinned law.", + "equations": [ + "sup 𝔼_{Qʷ_r} exp(a Ψ_F^(2/d)) < ∞" + ], + "scope": "Fixed d and parameter regime of C6-F; some a>0.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "proof_ref": "(F2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "sup 𝔼_{Qʷ_r} exp(a Ψ_F^(2/d)) < ∞" + ], + "full_theorem_checker_passed": false, + "id": "C6-01", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Moment consequence", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "aa56dc0bcb5170636148b89bf9405842a8affc94ccbe76a99b2cabee75606e59", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "(F2)", + "record_fingerprint_v14": "dd71598363a211b94937b67c3de0de653ff347053d8fc0719dacee30a83661c4", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Fixed d and parameter regime of C6-F; some a>0.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "source_authenticated": false, + "statement": "The same cap has a uniformly finite positive stretched-exponential moment under the weighted pinned law.", + "theorem_certificate_status": "not_attached", + "title": "Stretched-exponential moment", + "topic": "C6" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-01", + "external_theorem_imports": [], + "fingerprint": "7ae2add8b72ead7846a1ffc48ba5e169c0c803afcfcfc87a8216b1b76ee73989", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-01", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "C6-F" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "(F2)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-01:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d and parameter regime of C6-F; some a>0.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:C6-F", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "6bfe2eae95ccfa2d16e4c88fc10c7053f16ab3ad7c917574e3091ba0dd928852", + "exact_boundary": { + "record_id": "C6-F", + "kind": "Theorem F", + "statement": "A measurable global cap dominates the number of all real torus critical points, and has a uniform stretched-exponential tail.", + "equations": [ + "Ψ_F ≥ C(f)\nQ_r(Ψ_F>x), Qʷ_r(Ψ_F>x) ≤ C exp(−c x^(2/d)) for x≥1" + ], + "scope": "Fixed d≥2 and torus, original pin law, compact positive-gap marks; cap counts ALL critical points, not only narrow-window points.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "proof_ref": "Theorem F, (F1)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "Ψ_F ≥ C(f)\nQ_r(Ψ_F>x), Qʷ_r(Ψ_F>x) ≤ C exp(−c x^(2/d)) for x≥1" + ], + "full_theorem_checker_passed": false, + "id": "C6-F", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem F", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "d520135aea78d971a4d292f604e9492b5c5546847884055308cba733ab07a765", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem F, (F1)", + "record_fingerprint_v14": "128dca276853caec3a081558ae69dce0c1a2b9fd573a312bc1ca9d87d13a56db", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Fixed d≥2 and torus, original pin law, compact positive-gap marks; cap counts ALL critical points, not only narrow-window points.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "source_authenticated": false, + "statement": "A measurable global cap dominates the number of all real torus critical points, and has a uniform stretched-exponential tail.", + "theorem_certificate_status": "not_attached", + "title": "Stretched-exponential critical-count cap", + "topic": "C6" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-F", + "external_theorem_imports": [], + "fingerprint": "e955143df27a1879a7fad84a67f5eeca259cfd07a1e544a393bcb55771bff1a5", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-F", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem F, (F1)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-F:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and torus, original pin law, compact positive-gap marks; cap counts ALL critical points, not only narrow-window points.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:C6-PALM-Q", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "6f37b9ef33d962639220e21939dc45115f05d3c1ba3130e715740b40cc1daf47", + "exact_boundary": { + "record_id": "C6-PALM-Q", + "kind": "Theorem Q + corollaries", + "statement": "The reviewed Palm route upgrades logarithmic factorial bounds to cubic bounds and supplies a matching second-factorial lower order.", + "equations": [ + "\\mathbb E_{Q_r^W}[(N)_q]\\le C_q r^3\\quad\\text{for each fixed integer }q\\ge2", + "\\mathbb E_{Q_r^W}[N(N-1)]=\\Theta(r^3),\\quad Q_r^W\\{N\\ge2\\}=\\Theta(r^3)" + ], + "scope": "Each fixed d>=2,L; original weighted pins; compact B,K with k_->0; N counts window critical points excluding the pins; consumes separately accepted dimensional D5 first-moment input; no spatial Poisson law.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/820d4435c5f13c12b9c2f3590e859212d2648dc0/frontiers/c6_palm_route_20260929/PROOF.md", + "proof_ref": "§1 Theorem Q / Corollary Theta", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\mathbb E_{Q_r^W}[(N)_q]\\le C_q r^3\\quad\\text{for each fixed integer }q\\ge2", + "\\mathbb E_{Q_r^W}[N(N-1)]=\\Theta(r^3),\\quad Q_r^W\\{N\\ge2\\}=\\Theta(r^3)" + ], + "full_theorem_checker_passed": false, + "id": "C6-PALM-Q", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem Q + corollaries", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "b6d5913a6e04c647334fb9fb31eca3fcdb291c6a6238af29f081901a9c3184d0", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§1 Theorem Q / Corollary Theta", + "record_fingerprint_v14": "ff810e9569241d3990ddc9d98c0e7dfcdcb1b1d91483006e7d78908909b36d89", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/820d4435c5f13c12b9c2f3590e859212d2648dc0/frontiers/c6_palm_route_20260929/README.md", + "scope": "Each fixed d>=2,L; original weighted pins; compact B,K with k_->0; N counts window critical points excluding the pins; consumes separately accepted dimensional D5 first-moment input; no spatial Poisson law.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/820d4435c5f13c12b9c2f3590e859212d2648dc0/frontiers/c6_palm_route_20260929/PROOF.md", + "source_authenticated": false, + "statement": "The reviewed Palm route upgrades logarithmic factorial bounds to cubic bounds and supplies a matching second-factorial lower order.", + "theorem_certificate_status": "not_attached", + "title": "Sharp factorial moment and multiple-occurrence law", + "topic": "C6" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-PALM-Q", + "external_theorem_imports": [], + "fingerprint": "14323b2c7e8213be311170d6623fba5a3f4e0f98356b7217770acc476c5fc980", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-PALM-Q", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D5d-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§1 Theorem Q / Corollary Theta", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/820d4435c5f13c12b9c2f3590e859212d2648dc0/frontiers/c6_palm_route_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/820d4435c5f13c12b9c2f3590e859212d2648dc0/frontiers/c6_palm_route_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-PALM-Q:scope", + "origin": "verbatim_curated_scope", + "text": "Each fixed d>=2,L; original weighted pins; compact B,K with k_->0; N counts window critical points excluding the pins; consumes separately accepted dimensional D5 first-moment input; no spatial Poisson law.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:C6-RARE-CPOISSON", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "3cf0ed3e68868c15ecb727268bc2553474fc757af8a520f4eef6eacbff7bf867", + "exact_boundary": { + "record_id": "C6-RARE-CPOISSON", + "kind": "Theorem C", + "statement": "Project-reviewed conditional result for the actual r-dependent positive-count law F and p=P(N>0).", + "equations": [ + "\\frac{p^2}{3}\\le d_{TV}(\\mathcal L(N),CP(p,F))\\le p(1-e^{-p})\\le p^2", + "p=\\Theta(r^3)\\ \\Longrightarrow\\ d_{TV}(\\mathcal L(N),CP(p,F))=\\Theta(r^6)" + ], + "scope": "H1 and H2; F=Law(N | N>0) is generally unknown and depends on r. This does not identify a limiting cluster distribution or an in-field spatial clustering process.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "proof_ref": "§4 Theorem C (4.1)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\frac{p^2}{3}\\le d_{TV}(\\mathcal L(N),CP(p,F))\\le p(1-e^{-p})\\le p^2", + "p=\\Theta(r^3)\\ \\Longrightarrow\\ d_{TV}(\\mathcal L(N),CP(p,F))=\\Theta(r^6)" + ], + "full_theorem_checker_passed": false, + "id": "C6-RARE-CPOISSON", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem C", + "original_admission_code": "reviewed_conditional", + "original_admission_label": "Conditionally reviewed", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "ed2fdae8faff85c5ae87eac45ef75e252dbe2eeff4a6fc2dd1eac199457bcd75", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§4 Theorem C (4.1)", + "record_fingerprint_v14": "fe3414a5b05c792b445e51bcbc9642ed03f2b980685625a0344158d7b299f424", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/REVIEW_RECORD.md", + "scope": "H1 and H2; F=Law(N | N>0) is generally unknown and depends on r. This does not identify a limiting cluster distribution or an in-field spatial clustering process.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "source_authenticated": false, + "statement": "Project-reviewed conditional result for the actual r-dependent positive-count law F and p=P(N>0).", + "theorem_certificate_status": "not_attached", + "title": "Canonical compound-Poisson approximation", + "topic": "C6 rare clusters" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-RARE-CPOISSON", + "external_theorem_imports": [], + "fingerprint": "30aec8c151fbad0cd2b70232c24b9fea454020cc136c5bc44ac25c252c0c0203", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-RARE-CPOISSON", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "C6-PALM-Q", + "D5d-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§4 Theorem C (4.1)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/REVIEW_RECORD.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-RARE-CPOISSON:scope", + "origin": "verbatim_curated_scope", + "text": "H1 and H2; F=Law(N | N>0) is generally unknown and depends on r. This does not identify a limiting cluster distribution or an in-field spatial clustering process.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:C6-RARE-POISSON", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "2e9a240494fcd58967b69819cd2e3a9c1969a2c357a02a62b5fc2dbed0796082", + "exact_boundary": { + "record_id": "C6-RARE-POISSON", + "kind": "Theorem O", + "statement": "A project-reviewed conditional implication from count upper bounds and multiple-occurrence lower bounds: ordinary Poisson approximation cannot beat cubic total-variation error.", + "equations": [ + "\\frac a2r^3\\le\\inf_{\\lambda\\ge0}d_{TV}(\\mathcal L(N_r),\\mathrm{Pois}(\\lambda))\\le A r^3" + ], + "scope": "Abstract assumptions H1: EN<=A r^3 and H2: P(N>=2)>=a r^3, with a,A>0; original Gaussian application needs the accepted D5 and sharp C6 inputs. Not a positive Poisson limit claim.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "proof_ref": "§3 Theorem O (3.1)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\frac a2r^3\\le\\inf_{\\lambda\\ge0}d_{TV}(\\mathcal L(N_r),\\mathrm{Pois}(\\lambda))\\le A r^3" + ], + "full_theorem_checker_passed": false, + "id": "C6-RARE-POISSON", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem O", + "original_admission_code": "reviewed_conditional", + "original_admission_label": "Conditionally reviewed", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "6818a552e2c7f0b4d033e6cb2139359e217c09a12887a23714f41d7b7f7456c4", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§3 Theorem O (3.1)", + "record_fingerprint_v14": "61e1401b7472cb6e7c25c074cfc193154c0e4c7d5e33b339fdf2952558f1d93f", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/REVIEW_RECORD.md", + "scope": "Abstract assumptions H1: EN<=A r^3 and H2: P(N>=2)>=a r^3, with a,A>0; original Gaussian application needs the accepted D5 and sharp C6 inputs. Not a positive Poisson limit claim.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "source_authenticated": false, + "statement": "A project-reviewed conditional implication from count upper bounds and multiple-occurrence lower bounds: ordinary Poisson approximation cannot beat cubic total-variation error.", + "theorem_certificate_status": "not_attached", + "title": "Rare-count ordinary-Poisson obstruction", + "topic": "C6 rare clusters" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-RARE-POISSON", + "external_theorem_imports": [], + "fingerprint": "345f6cc5556005e92a743f9b9d86e4fde0c1a64256575392147ad8989f0e72f0", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-RARE-POISSON", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "C6-PALM-Q", + "D5d-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3 Theorem O (3.1)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/REVIEW_RECORD.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-RARE-POISSON:scope", + "origin": "verbatim_curated_scope", + "text": "Abstract assumptions H1: EN<=A r^3 and H2: P(N>=2)>=a r^3, with a,A>0; original Gaussian application needs the accepted D5 and sharp C6 inputs. Not a positive Poisson limit claim.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:C6-RARE-REPLICAS", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "95860a0edf16aea7f39eae0dd654b2f48d2e873467250d1c77c13bb8b04b1877", + "exact_boundary": { + "record_id": "C6-RARE-REPLICAS", + "kind": "Conditional theorem", + "statement": "A reviewed theorem for pooling independent copies of an entire pinned count, along convergent rare-intensity subsequences.", + "equations": [ + "d_{TV}(\\mathcal L(T_r),CP(t\\nu))\\le tA^2r^3+Ar^3+t\\|\\nu_r-\\nu\\|_1\\to0" + ], + "scope": "H1,H2 and every fixed factorial Hq; subsequence with nu_r -> nu, and m_r=floor(t/r^3) independent whole-field replicas; NOT independent spatial cells in one realization; no unique limit asserted.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "proof_ref": "§6–7 Theorem S and independent replicas (7.1)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "d_{TV}(\\mathcal L(T_r),CP(t\\nu))\\le tA^2r^3+Ar^3+t\\|\\nu_r-\\nu\\|_1\\to0" + ], + "full_theorem_checker_passed": false, + "id": "C6-RARE-REPLICAS", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Conditional theorem", + "original_admission_code": "reviewed_conditional", + "original_admission_label": "Conditionally reviewed", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "d2581ee89ba9d3ce7d1584acef58fb53bf5bb96977a813c14befc95f04052aae", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§6–7 Theorem S and independent replicas (7.1)", + "record_fingerprint_v14": "82f914ad229d0ae964c4456eec07ce5398d61cd03b2e2be8f09f7ec7bff7a629", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/REVIEW_RECORD.md", + "scope": "H1,H2 and every fixed factorial Hq; subsequence with nu_r -> nu, and m_r=floor(t/r^3) independent whole-field replicas; NOT independent spatial cells in one realization; no unique limit asserted.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "source_authenticated": false, + "statement": "A reviewed theorem for pooling independent copies of an entire pinned count, along convergent rare-intensity subsequences.", + "theorem_certificate_status": "not_attached", + "title": "Independent-replica subsequential compound-Poisson law", + "topic": "C6 rare clusters" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-RARE-REPLICAS", + "external_theorem_imports": [], + "fingerprint": "2bce1fece049732e0622a11e557f91292af4983cfae3856e600965167422b719", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-RARE-REPLICAS", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "C6-PALM-Q", + "D5d-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§6–7 Theorem S and independent replicas (7.1)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/REVIEW_RECORD.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-RARE-REPLICAS:scope", + "origin": "verbatim_curated_scope", + "text": "H1,H2 and every fixed factorial Hq; subsequence with nu_r -> nu, and m_r=floor(t/r^3) independent whole-field replicas; NOT independent spatial cells in one realization; no unique limit asserted.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:C6-W", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "51b4105423035b3f5bdd607af377415b04a02bb936feda018b3a49869e6bc732", + "exact_boundary": { + "record_id": "C6-W", + "kind": "Theorem W", + "statement": "If the dimension-matched global first-moment estimate holds, each fixed falling-factorial moment has a logarithmic bound; the reviewed planar case supplies the needed premise.", + "equations": [ + "𝔼_{Qʷ_r}(N)_p ≤ C_p r³[log(1/r)]^(d(p−1)/2)\nd=2: 𝔼_{Qʷ_r}N(N−1) ≤ C r³ log(1/r)" + ], + "scope": "p≥2 fixed; general dimension conditional on G_d; planar case uses reviewed D5 first moment and full reading rule.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "proof_ref": "Theorem W, (F3)–(F4)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "𝔼_{Qʷ_r}(N)_p ≤ C_p r³[log(1/r)]^(d(p−1)/2)\nd=2: 𝔼_{Qʷ_r}N(N−1) ≤ C r³ log(1/r)" + ], + "full_theorem_checker_passed": false, + "id": "C6-W", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem W", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "63e068697a05f26542439a4e0fb4fc3122954b0f00c9611acff4df2d566d12b4", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem W, (F3)–(F4)", + "record_fingerprint_v14": "df37c5d9bc461ac31a14012fe6e70a655e1a7426a3b24fd7123f1c90d61007b2", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "p≥2 fixed; general dimension conditional on G_d; planar case uses reviewed D5 first moment and full reading rule.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "source_authenticated": false, + "statement": "If the dimension-matched global first-moment estimate holds, each fixed falling-factorial moment has a logarithmic bound; the reviewed planar case supplies the needed premise.", + "theorem_certificate_status": "not_attached", + "title": "Narrow-window factorial upper bounds", + "topic": "C6" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-W", + "external_theorem_imports": [], + "fingerprint": "955674af1d533fccbbe33f2649447afe502e3172b637f1ab0fe8b524960e5693", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-W", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "C6-F", + "D5-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem W, (F3)–(F4)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-W:scope", + "origin": "verbatim_curated_scope", + "text": "p≥2 fixed; general dimension conditional on G_d; planar case uses reviewed D5 first moment and full reading rule.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-01", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "b0c8f9aa24a019812ab6a83c8124085be68baf4b624aa153337eabe206ffc093", + "exact_boundary": { + "record_id": "D1-01", + "kind": "Definition", + "statement": "Centered, variance-one stationary Gaussian field on the flat d-torus.", + "equations": [ + "K_L(z) = [Σ_{n∈ℤᵈ} exp(−|z+Ln|²/2)] / [Σ_{n∈ℤᵈ} exp(−|Ln|²/2)]" + ], + "scope": "Fixed d ≥ 2 and side L > 0; the exact periodized model, not the minimum-image approximation.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "§1", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "K_L(z) = [Σ_{n∈ℤᵈ} exp(−|z+Ln|²/2)] / [Σ_{n∈ℤᵈ} exp(−|Ln|²/2)]" + ], + "full_theorem_checker_passed": false, + "id": "D1-01", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Definition", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "4d9a379987a95ddaefad390351def70c60e50e7a6e40b9c091784863b85a18c9", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§1", + "record_fingerprint_v14": "d77c6ca573e555c86e26c710f2edb40849b8539cfd9b925104b8b3882ea5ae5e", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Fixed d ≥ 2 and side L > 0; the exact periodized model, not the minimum-image approximation.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "Centered, variance-one stationary Gaussian field on the flat d-torus.", + "theorem_certificate_status": "not_attached", + "title": "Periodized Gaussian field", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-01", + "external_theorem_imports": [], + "fingerprint": "0440670dc5bba47a4bf87d4574d98baa2e531aee2d61f68818e8630f3a6b0648", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-01", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§1", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-01:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d ≥ 2 and side L > 0; the exact periodized model, not the minimum-image approximation.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-02", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "fb0da0f43117f416dcfffa4bfdf3a5f95963af839b10a5e82771b51383465a7b", + "exact_boundary": { + "record_id": "D1-02", + "kind": "Definition", + "statement": "The pin observations and the full determinant tilt used in D1 and its dependent counting results.", + "equations": [ + "M=−(r/2)u; S=(r/2)u; f(M)=b; f(S)=b−kr³; ∇f(M)=∇f(S)=0\nW_r=|det H_M det H_S|·1{H_M negative definite, index(H_S)=d−1}\nZ_r=𝔼_Q[W_r]; dQʷ=(W_r/Z_r)dQ" + ], + "scope": "Unit axial vector u; b in compact birth interval, k in a compact positive-gap interval, and original full normalizer.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "§1", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "M=−(r/2)u; S=(r/2)u; f(M)=b; f(S)=b−kr³; ∇f(M)=∇f(S)=0\nW_r=|det H_M det H_S|·1{H_M negative definite, index(H_S)=d−1}\nZ_r=𝔼_Q[W_r]; dQʷ=(W_r/Z_r)dQ" + ], + "full_theorem_checker_passed": false, + "id": "D1-02", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Definition", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "f190066311379c04d7bf28b9a408edb9a8cb0a6b5146ee7d27ef074694447c9c", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§1", + "record_fingerprint_v14": "47171f5cbe4f697d7746186527bb7f552e7e89935d321bff3f1fecfb1687c56b", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Unit axial vector u; b in compact birth interval, k in a compact positive-gap interval, and original full normalizer.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "The pin observations and the full determinant tilt used in D1 and its dependent counting results.", + "theorem_certificate_status": "not_attached", + "title": "Conditioned two-pin weighted law", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-02", + "external_theorem_imports": [], + "fingerprint": "d8ab1e2719c8382d43e4d78d97470b052d5d9290bcf9802babf7d5adbf94bd18", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-02", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§1", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-02:scope", + "origin": "verbatim_curated_scope", + "text": "Unit axial vector u; b in compact birth interval, k in a compact positive-gap interval, and original full normalizer.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-03", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "d071d26b9d6e555129f77b2b4acbfdad82f0e35d33d0f7894a8a6263e446629c", + "exact_boundary": { + "record_id": "D1-03", + "kind": "Lemma / proof ingredient", + "statement": "Every lattice frequency has strictly positive Fourier weight; distinct finite-jet evaluation functionals have nondegenerate Gaussian covariance.", + "equations": [ + "K_L(z)=Σ_{n∈ℤᵈ} a_n exp(2πi n·z/L)\na_n=exp(−2π²|n|²/L²) / Σ_j exp(−2π²|j|²/L²) > 0" + ], + "scope": "The precise periodized covariance and nonduplicate symmetric-jet coordinates.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "§2, Fourier representation", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "K_L(z)=Σ_{n∈ℤᵈ} a_n exp(2πi n·z/L)\na_n=exp(−2π²|n|²/L²) / Σ_j exp(−2π²|j|²/L²) > 0" + ], + "full_theorem_checker_passed": false, + "id": "D1-03", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma / proof ingredient", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "a8b17acad7d672edfded36260205193be472bb5473d2734b13941684cf72ee62", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§2, Fourier representation", + "record_fingerprint_v14": "67cb8ed133101c5d2bcd5d1e6e4095e0fb1f1b037843ab4246226e8c0be07097", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "The precise periodized covariance and nonduplicate symmetric-jet coordinates.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "Every lattice frequency has strictly positive Fourier weight; distinct finite-jet evaluation functionals have nondegenerate Gaussian covariance.", + "theorem_certificate_status": "not_attached", + "title": "Positive Fourier spectrum and finite-jet nondegeneracy", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-03", + "external_theorem_imports": [], + "fingerprint": "869acbe742498050c11cf1aec0f3455053ab5dd2bb2b4a9550a7caa9760df9f4", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-03", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V10" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§2, Fourier representation", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-03:scope", + "origin": "verbatim_curated_scope", + "text": "The precise periodized covariance and nonduplicate symmetric-jet coordinates.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-04", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "fe0ac0a979298b5859f723006533eb5502c62d397f357b68f6d3bbb63b35a099", + "exact_boundary": { + "record_id": "D1-04", + "kind": "Proof ingredient", + "statement": "The exact transformed two-pin observations have an invertible matrix and a specified determinant.", + "equations": [ + "|det T_r| = 12 r^(−(d+3))" + ], + "scope": "The original axial and transverse observation ordering; r>0.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "§3, Eq. (3.2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "|det T_r| = 12 r^(−(d+3))" + ], + "full_theorem_checker_passed": false, + "id": "D1-04", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Proof ingredient", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "aeac8378256bdc779f32bb86a888eaf63f3fe23a873392bd0b3d99d49ad78f95", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§3, Eq. (3.2)", + "record_fingerprint_v14": "4af998d6ac19596840a7afcbceb10ff12324bb2fd7f54abe08c3591d1acb663d", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "The original axial and transverse observation ordering; r>0.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "The exact transformed two-pin observations have an invertible matrix and a specified determinant.", + "theorem_certificate_status": "not_attached", + "title": "Contact-frame Jacobian", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-04", + "external_theorem_imports": [], + "fingerprint": "a5a068fa0eb1528c15869400f1d344bb236ddadbc2095bcfcb9210a232a42e93", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-04", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3, Eq. (3.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-04:scope", + "origin": "verbatim_curated_scope", + "text": "The original axial and transverse observation ordering; r>0.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-A", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "2460136a10b3ca19e0dfffa4ebff6606d7918f8031bf47735068a82461bc0dfb", + "exact_boundary": { + "record_id": "D1-A", + "kind": "Theorem A", + "statement": "Under the conditioned and tilted law, the chance that the specified saddle is not the maximum’s global elder partner is bounded by a cubic term.", + "equations": [ + "0 ≤ 1 − p_r(b,k,R) ≤ C r³" + ], + "scope": "Uniform over compact birth and strictly positive gap-mark intervals and all orthonormal frames; sufficiently small r and reading-rule corrections apply.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "Theorem A, Eq. (1.1)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "0 ≤ 1 − p_r(b,k,R) ≤ C r³" + ], + "full_theorem_checker_passed": false, + "id": "D1-A", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem A", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "6b9edd25a74c60527197333846b649ae32d0c9c1ac332bf5dbbd729b99976a39", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem A, Eq. (1.1)", + "record_fingerprint_v14": "6d1e8e2f3a218bd4051de5c7c51de83a88f0f6327ab0e12f049d7e647334dfd0", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Uniform over compact birth and strictly positive gap-mark intervals and all orthonormal frames; sufficiently small r and reading-rule corrections apply.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "Under the conditioned and tilted law, the chance that the specified saddle is not the maximum’s global elder partner is bounded by a cubic term.", + "theorem_certificate_status": "not_attached", + "title": "Uniform global elder selection", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-A", + "external_theorem_imports": [], + "fingerprint": "4dc900b5d3754d41fe77da082ce280390913fb0d38fdf57423a7300b984b744b", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-A", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D1-02", + "D1-CAP-ELDER", + "D1-CAP-MATRIX", + "D1-CORR-CONG", + "D1-CORR-SCOPE", + "D1-ELDER-MEAS" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem A, Eq. (1.1)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-A:scope", + "origin": "verbatim_curated_scope", + "text": "Uniform over compact birth and strictly positive gap-mark intervals and all orthonormal frames; sufficiently small r and reading-rule corrections apply.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [ + "SRC-D1-ERRATUM", + "SRC-D1-PARENT", + "SRC-D1-RECON", + "SRC-D1-REPAIR" + ], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-B", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "d1e77529cdde354f970fa55d33c8299d5e7c5c50c104fda4187158c56d6c5c16", + "exact_boundary": { + "record_id": "D1-B", + "kind": "Theorem B", + "statement": "Candidate maximum–saddle pairs and actual elder pairs have a shared leading short-lifetime density. Their difference is quantitatively smaller.", + "equations": [ + "ν_cand(ℓ) ∼ c_{B,K} ℓ^(−1/3)\nν_eld(ℓ) ∼ c_{B,K} ℓ^(−1/3), c_{B,K}>0\n0 ≤ ν_cand(ℓ)−ν_eld(ℓ) ≤ C_{B,K} ℓ^(2/3)" + ], + "scope": "B,K must be compact intervals of positive length, with K bounded away from zero; restricted pair distance; fixed d,L.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "Theorem B, Eq. (1.2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "ν_cand(ℓ) ∼ c_{B,K} ℓ^(−1/3)\nν_eld(ℓ) ∼ c_{B,K} ℓ^(−1/3), c_{B,K}>0\n0 ≤ ν_cand(ℓ)−ν_eld(ℓ) ≤ C_{B,K} ℓ^(2/3)" + ], + "full_theorem_checker_passed": false, + "id": "D1-B", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem B", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "da06ff8c4f5f79ec7ea902ea18c11ccddf80bcbc2c1074012863da2db47abd6e", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem B, Eq. (1.2)", + "record_fingerprint_v14": "07baad843649f207af0955ddcc7bf73109465aaf39a92b952fc3b5b192fc1448", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "B,K must be compact intervals of positive length, with K bounded away from zero; restricted pair distance; fixed d,L.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "Candidate maximum–saddle pairs and actual elder pairs have a shared leading short-lifetime density. Their difference is quantitatively smaller.", + "theorem_certificate_status": "not_attached", + "title": "Compact-mark lifetime density", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-B", + "external_theorem_imports": [], + "fingerprint": "928c60b2f0ad846074e6f1d7ad31f207d3736f7b0925af5f7be0227afabc4c95", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-B", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D1-A", + "D1-EQ-COMPACT", + "D1-KR-BOREL", + "D1-KR-JACOB" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem B, Eq. (1.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-B:scope", + "origin": "verbatim_curated_scope", + "text": "B,K must be compact intervals of positive length, with K bounded away from zero; restricted pair distance; fixed d,L.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [ + "SRC-D1-ERRATUM", + "SRC-D1-PARENT", + "SRC-D1-RECON", + "SRC-D1-REPAIR" + ], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-C", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "038072d2635ecc43b3369ca92e3eb3a18087a31caa8c1accd95b0840963a0a65", + "exact_boundary": { + "record_id": "D1-C", + "kind": "Theorem C", + "statement": "For the specified fixed periodized field, the full candidate-pair and actual finite superlevel H₀ lifetime densities have the same leading power.", + "equations": [ + "ν_cand^all(ℓ) ∼ c_{d,L} ℓ^(−1/3)\nν_eld^all(ℓ) ∼ c_{d,L} ℓ^(−1/3), 0(4/(3κ)) r M_3²", + "r M_4≤3κ/10", + "maximin(M, {z:f(z)>f(M)})=f(S)=f(M)-κr³" + ], + "scope": "C⁴ deterministic embedded cylinder; extends to a global compact Morse manifold with distinct critical values; exactly sufficient, not necessary, for pairing; unique ascending branch statement uses gradient-flow assumptions, ridge never identified with that branch.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "proof_ref": "§§4–5, eqs. (13)–(14) and maximin argument", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "λ_min(-D_y² f(M))>(4/(3κ)) r M_3²", + "r M_4≤3κ/10", + "maximin(M, {z:f(z)>f(M)})=f(S)=f(M)-κr³" + ], + "full_theorem_checker_passed": false, + "id": "D1-CAP-ELDER", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "reviewed deterministic cap-to-elder interface", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "18b57675574fa43837eec4c8a3e09bb73e2a963506a1891caf0e3e160c30e13a", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§§4–5, eqs. (13)–(14) and maximin argument", + "record_fingerprint_v14": "8f0bc8bb5f5cb8c2a638ab37686b365e93e5a988009da61c31e5934c683a4714", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "scope": "C⁴ deterministic embedded cylinder; extends to a global compact Morse manifold with distinct critical values; exactly sufficient, not necessary, for pairing; unique ascending branch statement uses gradient-flow assumptions, ridge never identified with that branch.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "source_authenticated": false, + "statement": "Under the sufficient cap conditions, boundary values of the cap are at most the saddle height while a ridge path from M through S reaches a point older than M at maximin level f(S). With a global Morse extension and distinct critical values, S is the global elder death partner of M.", + "theorem_certificate_status": "not_attached", + "title": "Separating cap gives global ordinary elder pairing", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CAP-ELDER", + "external_theorem_imports": [], + "fingerprint": "4776516b32941a0342368bcada751000651b3297281d15f6fa65572177a385e7", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CAP-ELDER", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V32" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-CAP-RIDGE" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§§4–5, eqs. (13)–(14) and maximin argument", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CAP-ELDER:scope", + "origin": "verbatim_curated_scope", + "text": "C⁴ deterministic embedded cylinder; extends to a global compact Morse manifold with distinct critical values; exactly sufficient, not necessary, for pairing; unique ascending branch statement uses gradient-flow assumptions, ridge never identified with that branch.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-CAP-HERMITE", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "92f78ef3e7afdee869a3c1998dd8beec34e5a1f25d25147a41dd4d08d4aa4fc9", + "exact_boundary": { + "record_id": "D1-CAP-HERMITE", + "kind": "reviewed deterministic cap interface", + "statement": "Two critical pins and their prescribed cubic height gap force a weighted mean of the third axial derivative; the uniform partial-block derivative hypotheses give positive axial third derivative and a strictly concave transverse fiber throughout the embedded cylinder.", + "equations": [ + "f(S)-f(M)=-1/2 ∫_{-r/2}^{r/2}(x+r/2)(r/2-x) f_xxx(x,0) dx", + "M_3≥2 and f_xxx≥7/4 for κ=1/6, rM_4≤1/20", + "D_y² f≼-(λ-5rM_3)I with λ>8rM_3², κ=1/6" + ], + "scope": "C⁴ deterministic function; r>0 embedded product cylinder [-2r,2r]×closed ball radius 2r; critical pins ±r/2, exact gap κr³; normalized κ=1/6 until rescaled. Partial-block operator norms, not arbitrary scalar Hessian entries.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "proof_ref": "§§2–3, eqs. (4)–(8)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "f(S)-f(M)=-1/2 ∫_{-r/2}^{r/2}(x+r/2)(r/2-x) f_xxx(x,0) dx", + "M_3≥2 and f_xxx≥7/4 for κ=1/6, rM_4≤1/20", + "D_y² f≼-(λ-5rM_3)I with λ>8rM_3², κ=1/6" + ], + "full_theorem_checker_passed": false, + "id": "D1-CAP-HERMITE", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "reviewed deterministic cap interface", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "1644ed0992ad41a8224c0e605c8c03dd2d81ccdba437e4745fb652ab6b909a76", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§§2–3, eqs. (4)–(8)", + "record_fingerprint_v14": "722ce5fc4a0f1ba30fdcf89880aa57abe1e3d38885359da36db74cbcc58cb462", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "scope": "C⁴ deterministic function; r>0 embedded product cylinder [-2r,2r]×closed ball radius 2r; critical pins ±r/2, exact gap κr³; normalized κ=1/6 until rescaled. Partial-block operator norms, not arbitrary scalar Hessian entries.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "source_authenticated": false, + "statement": "Two critical pins and their prescribed cubic height gap force a weighted mean of the third axial derivative; the uniform partial-block derivative hypotheses give positive axial third derivative and a strictly concave transverse fiber throughout the embedded cylinder.", + "theorem_certificate_status": "not_attached", + "title": "Pinned Hermite identity and transverse concavity", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CAP-HERMITE", + "external_theorem_imports": [], + "fingerprint": "51b845201143d307364af61000bc2b19eca21308333a1c838eb8299c4e6ea014", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CAP-HERMITE", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V29" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§§2–3, eqs. (4)–(8)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CAP-HERMITE:scope", + "origin": "verbatim_curated_scope", + "text": "C⁴ deterministic function; r>0 embedded product cylinder [-2r,2r]×closed ball radius 2r; critical pins ±r/2, exact gap κr³; normalized κ=1/6 until rescaled. Partial-block operator norms, not arbitrary scalar Hessian entries.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-CAP-MATRIX", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "3bd2643e2646356250726dd46cf8b4c041fe1bc11affabd1ed16e4a5a2a2b1df", + "exact_boundary": { + "record_id": "D1-CAP-MATRIX", + "kind": "reviewed deterministic matrix envelope", + "statement": "The maximum Hessian Schur complement and the saddle block determinant, under the typed maximum/saddle support and derivative increment bounds, yield two vanishing soft-eigenvalue factors. The 3/2 saddle factor is sharp for this matrix relaxation.", + "equations": [ + "W_r/r²≤(M_3²/4) λ₁(λ₁+(3/2)rM_3) ∏_{j=2}^{d-1}λ_j(λ_j+rM_3)", + "|det H_M|≤(rM_3/2) ∏_j λ_j", + "|det H_S|≤(rM_3/2)[λ₁+(3/2)rM_3]∏_{j=2}^{d-1}(λ_j+rM_3)" + ], + "scope": "d≥2, transverse m=d−1, A_M<0 on typed maximum support, H_S index d−1; |α_i|,||β_i||≤M_3/2, ||A_S-A_M||≤rM_3; sharpness refers to abstract matrix relaxation only, not Gaussian failure probability.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "§§5–6 eqs. (5.1), (5.3), (6.1), (6.2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "W_r/r²≤(M_3²/4) λ₁(λ₁+(3/2)rM_3) ∏_{j=2}^{d-1}λ_j(λ_j+rM_3)", + "|det H_M|≤(rM_3/2) ∏_j λ_j", + "|det H_S|≤(rM_3/2)[λ₁+(3/2)rM_3]∏_{j=2}^{d-1}(λ_j+rM_3)" + ], + "full_theorem_checker_passed": false, + "id": "D1-CAP-MATRIX", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "reviewed deterministic matrix envelope", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "3eac8641b003de1bc84e162bc6e81a0b2e765c3e8ccea3106c3a92631a525524", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§§5–6 eqs. (5.1), (5.3), (6.1), (6.2)", + "record_fingerprint_v14": "9c0e05285484c52a5ded5c9ee96f1f5b08589ed4e97e154818c6ff9dd7de99fe", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "scope": "d≥2, transverse m=d−1, A_M<0 on typed maximum support, H_S index d−1; |α_i|,||β_i||≤M_3/2, ||A_S-A_M||≤rM_3; sharpness refers to abstract matrix relaxation only, not Gaussian failure probability.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "The maximum Hessian Schur complement and the saddle block determinant, under the typed maximum/saddle support and derivative increment bounds, yield two vanishing soft-eigenvalue factors. The 3/2 saddle factor is sharp for this matrix relaxation.", + "theorem_certificate_status": "not_attached", + "title": "Double soft-eigenvalue typed determinant envelope", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CAP-MATRIX", + "external_theorem_imports": [], + "fingerprint": "1e8734fb1af32ebfccbcd3fbfaa26a8c6c9607c47b1bfe7ea68bc871f0595110", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CAP-MATRIX", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V31" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§§5–6 eqs. (5.1), (5.3), (6.1), (6.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CAP-MATRIX:scope", + "origin": "verbatim_curated_scope", + "text": "d≥2, transverse m=d−1, A_M<0 on typed maximum support, H_S index d−1; |α_i|,||β_i||≤M_3/2, ||A_S-A_M||≤rM_3; sharpness refers to abstract matrix relaxation only, not Gaussian failure probability.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-CAP-RIDGE", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "cf52f34dfc128a6c07abc8b35af6ef2e68cba2b7e69cd06ec8a290e490838c19", + "exact_boundary": { + "record_id": "D1-CAP-RIDGE", + "kind": "reviewed deterministic cap interface", + "statement": "Strict transverse concavity yields a unique C³ transverse-critical ridge h(x); the correct third derivative of its reduced height function includes the mixed transverse terms and is strictly positive under the cap conditions.", + "equations": [ + "F''=f_xxx+3f_xxy[h']+3f_xyy[h',h']+f_yyy[h',h',h']", + "F''>2184415/7086244>1/4 (κ=1/6)", + "||h'||<2/(8M_3-5)+2/(8M_3-5)²≤24/121" + ], + "scope": "Same embedded C⁴ marked-cylinder hypotheses as D1-CAP-HERMITE; normalized κ=1/6; F=∂x f(x,h(x)), not the gradient trajectory. No assertion that the ridge equals any Morse flow line.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "proof_ref": "§§3–4, eqs. (9)–(12)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "F''=f_xxx+3f_xxy[h']+3f_xyy[h',h']+f_yyy[h',h',h']", + "F''>2184415/7086244>1/4 (κ=1/6)", + "||h'||<2/(8M_3-5)+2/(8M_3-5)²≤24/121" + ], + "full_theorem_checker_passed": false, + "id": "D1-CAP-RIDGE", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "reviewed deterministic cap interface", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "db2b23216f7f74fa573489537fab8e3843bef428fd58e45841a723493773b4d5", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§§3–4, eqs. (9)–(12)", + "record_fingerprint_v14": "5efe6c413c114c5821f0666147f6d380083635a2b9e51040a2756803f19c91f0", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "scope": "Same embedded C⁴ marked-cylinder hypotheses as D1-CAP-HERMITE; normalized κ=1/6; F=∂x f(x,h(x)), not the gradient trajectory. No assertion that the ridge equals any Morse flow line.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "source_authenticated": false, + "statement": "Strict transverse concavity yields a unique C³ transverse-critical ridge h(x); the correct third derivative of its reduced height function includes the mixed transverse terms and is strictly positive under the cap conditions.", + "theorem_certificate_status": "not_attached", + "title": "Unique transverse ridge and positive ridge third derivative", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CAP-RIDGE", + "external_theorem_imports": [], + "fingerprint": "3fc314d535b4922eaa7a43d6767cb40157a64fc944bbedc38f23ad0077261003", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CAP-RIDGE", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V30" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-CAP-HERMITE" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§§3–4, eqs. (9)–(12)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CAP-RIDGE:scope", + "origin": "verbatim_curated_scope", + "text": "Same embedded C⁴ marked-cylinder hypotheses as D1-CAP-HERMITE; normalized κ=1/6; F=∂x f(x,h(x)), not the gradient trajectory. No assertion that the ridge equals any Morse flow line.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-COR-CUMULATIVE", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "fb095963923945a477bd8f68ffb8a79afd590f2982066b45d6a146924a5fc031", + "exact_boundary": { + "record_id": "D1-COR-CUMULATIVE", + "kind": "Corollary", + "statement": "Integrating the compact-mark short-bar density yields expected cumulative and moment asymptotics.", + "equations": [ + "\\mathbb E N_{\\mathrm{eld}}((0,t])\\sim\\tfrac32 c_{B,K}t^{2/3}", + "\\mathbb E\\sum_{\\mathrm{elder},\\,\\ell\\le t}\\ell^q\\sim\\frac{c_{B,K}}{q+2/3}t^{q+2/3},\\quad q>-2/3" + ], + "scope": "Same compact birth/gap restriction as Theorem B; t down to 0; q>-2/3 for the moment asymptotic. No unrestricted selection-loss rate.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "§12 (12.1)–(12.2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\mathbb E N_{\\mathrm{eld}}((0,t])\\sim\\tfrac32 c_{B,K}t^{2/3}", + "\\mathbb E\\sum_{\\mathrm{elder},\\,\\ell\\le t}\\ell^q\\sim\\frac{c_{B,K}}{q+2/3}t^{q+2/3},\\quad q>-2/3" + ], + "full_theorem_checker_passed": false, + "id": "D1-COR-CUMULATIVE", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Corollary", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "3285f83163b5f317fd55da681e168eb84fbbe99a57625c1b5c16338b6ff29f20", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§12 (12.1)–(12.2)", + "record_fingerprint_v14": "96db87e8533e64187d31fcae59d570a0e1e07d772d9fa95d4222af681579534f", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Same compact birth/gap restriction as Theorem B; t down to 0; q>-2/3 for the moment asymptotic. No unrestricted selection-loss rate.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "Integrating the compact-mark short-bar density yields expected cumulative and moment asymptotics.", + "theorem_certificate_status": "not_attached", + "title": "Compact-window cumulative short-bar law", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-COR-CUMULATIVE", + "external_theorem_imports": [], + "fingerprint": "92bd61f41fab7921fe52c1e148cca8e4209321340b0f608367e4b03803123e2e", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-COR-CUMULATIVE", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V08" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-B" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§12 (12.1)–(12.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-COR-CUMULATIVE:scope", + "origin": "verbatim_curated_scope", + "text": "Same compact birth/gap restriction as Theorem B; t down to 0; q>-2/3 for the moment asymptotic. No unrestricted selection-loss rate.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-CORR-CONG", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "c746d3d6c6e49d6ca3a9c8122cf2ba27353c69ec3061b307b89ec1c615eaa2d8", + "exact_boundary": { + "record_id": "D1-CORR-CONG", + "kind": "Reviewed scoped proof interface", + "statement": "The corrected endpoint Hessian rescaling is D_r=diag(r^(-1/2),I), which gives the intended O(sqrt(r)) mixed blocks and det(H_i)/r. The original displayed sqrt(r) factor is invalid and must not be consumed.", + "equations": [ + "H_i=[[r alpha_i,r beta_i^T],[r beta_i,A_i]]", + "D_r H_i D_r=[[alpha_i,sqrt(r) beta_i^T],[sqrt(r) beta_i,A_i]]", + "det(D_r H_i D_r)=det(H_i)/r" + ], + "scope": "Exactly parent Section 5 A3 with amendment E1; no new theorem/status promotion.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/ERRATUM_CONGRUENCE.md", + "proof_ref": "§5 mandatory erratum E1; reconciliation §1", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "H_i=[[r alpha_i,r beta_i^T],[r beta_i,A_i]]", + "D_r H_i D_r=[[alpha_i,sqrt(r) beta_i^T],[sqrt(r) beta_i,A_i]]", + "det(D_r H_i D_r)=det(H_i)/r" + ], + "full_theorem_checker_passed": false, + "id": "D1-CORR-CONG", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed scoped proof interface", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "b20da788f2585a71dc2e93ab0cdf5f662c9108c34c825a44eace3dca1c94a9ba", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§5 mandatory erratum E1; reconciliation §1", + "record_fingerprint_v14": "add5df1d3332c10820a04e4f10ffc1b9bc84de56fdd3ef11b0889e97ae59ef35", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Exactly parent Section 5 A3 with amendment E1; no new theorem/status promotion.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/ERRATUM_CONGRUENCE.md", + "source_authenticated": false, + "statement": "The corrected endpoint Hessian rescaling is D_r=diag(r^(-1/2),I), which gives the intended O(sqrt(r)) mixed blocks and det(H_i)/r. The original displayed sqrt(r) factor is invalid and must not be consumed.", + "theorem_certificate_status": "not_attached", + "title": "Mandatory A3 congruence erratum", + "topic": "D1 corrected lifetime / marked Kac–Rice" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CORR-CONG", + "external_theorem_imports": [], + "fingerprint": "9ea0e5f480fccfeaac6f6ba8a1d1302276b1fa8380fd344cc4f2448dd4043660", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CORR-CONG", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V33" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5 mandatory erratum E1; reconciliation §1", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/ERRATUM_CONGRUENCE.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CORR-CONG:scope", + "origin": "verbatim_curated_scope", + "text": "Exactly parent Section 5 A3 with amendment E1; no new theorem/status promotion.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-CORR-SCOPE", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "48ba7e182a15f7caad24cf0882177045cca734fbf1fa2c8d0f84b48497c6c6e0", + "exact_boundary": { + "record_id": "D1-CORR-SCOPE", + "kind": "Reviewed scoped proof interface", + "statement": "The correctly normalized matrices approach their contact block limits via small errors in probability and transverse-block convergence in distribution, using Slutsky; no almost-sure or joint-in-probability limit is asserted. The cap cylinder must fit in the torus injectivity ball.", + "equations": [ + "D_r H_i D_r - diag(±6k,A_M) -> 0 in probability", + "A_M -> A_0 in law", + "r < L/(4 sqrt(2))" + ], + "scope": "Fixed d>=2, L>0, compact positive marks; W1 and embedding bound E3 from reconciled reading rule. Do not infer A_M -> A_0 in probability.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "proof_ref": "§1 reading rule E3, §5 W1 and embedded radius", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "D_r H_i D_r - diag(±6k,A_M) -> 0 in probability", + "A_M -> A_0 in law", + "r < L/(4 sqrt(2))" + ], + "full_theorem_checker_passed": false, + "id": "D1-CORR-SCOPE", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed scoped proof interface", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "0faa9fd00f9a47489fc4324e092e6547d45d20abda812a4f918ea0f9a878493c", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§1 reading rule E3, §5 W1 and embedded radius", + "record_fingerprint_v14": "e4575d87cf3d1690c9feea7ca392765107ec723c95b7dc52c93ced2643244d0c", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Fixed d>=2, L>0, compact positive marks; W1 and embedding bound E3 from reconciled reading rule. Do not infer A_M -> A_0 in probability.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source_authenticated": false, + "statement": "The correctly normalized matrices approach their contact block limits via small errors in probability and transverse-block convergence in distribution, using Slutsky; no almost-sure or joint-in-probability limit is asserted. The cap cylinder must fit in the torus injectivity ball.", + "theorem_certificate_status": "not_attached", + "title": "Mandatory D1 in-law and embedded-cylinder clarifications", + "topic": "D1 corrected lifetime / marked Kac–Rice" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CORR-SCOPE", + "external_theorem_imports": [], + "fingerprint": "18cffbbac2f5f8f9a9a8c399f2743b0fc6ec3dc96ab7e31ea31ef0f810affc78", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CORR-SCOPE", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V34" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§1 reading rule E3, §5 W1 and embedded radius", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CORR-SCOPE:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d>=2, L>0, compact positive marks; W1 and embedding bound E3 from reconciled reading rule. Do not infer A_M -> A_0 in probability.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-ELDER-MEAS", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "68b92e107e966d00e760f6ee37862053c45a13c0638b32cc1a5170498c5d8872", + "exact_boundary": { + "record_id": "D1-ELDER-MEAS", + "kind": "Reviewed scoped proof interface", + "statement": "The global maximin pairing level can be represented by countably many strict path tests, giving a Borel elder indicator on the Morse distinct-critical-value locus; this is a global path event, not a local Hessian-index event.", + "equations": [ + "d_f(M)=sup_{gamma(0)=M,f(gamma(1))>f(M)} min_t f(gamma(t))", + "1{d_f(M)=f(S)} is Borel on the Morse distinct-level locus" + ], + "scope": "Smooth functions on compact manifold, Morse and distinct critical values; rational polygonal paths only approximate strict superlevel connectivity. Identification as elder partner uses the specified superlevel H0 convention.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "§8 pinned genericity and global Borel pairing", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "d_f(M)=sup_{gamma(0)=M,f(gamma(1))>f(M)} min_t f(gamma(t))", + "1{d_f(M)=f(S)} is Borel on the Morse distinct-level locus" + ], + "full_theorem_checker_passed": false, + "id": "D1-ELDER-MEAS", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed scoped proof interface", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "d96cf740c7b9cde48cbf98111a94a6148f9db94f0c7371318639b7c9003cf429", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§8 pinned genericity and global Borel pairing", + "record_fingerprint_v14": "4d29cf7a509690b1dbf467d2a6b35bccb0be7bb7acb807a7852cd035f0e59b4a", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Smooth functions on compact manifold, Morse and distinct critical values; rational polygonal paths only approximate strict superlevel connectivity. Identification as elder partner uses the specified superlevel H0 convention.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "The global maximin pairing level can be represented by countably many strict path tests, giving a Borel elder indicator on the Morse distinct-critical-value locus; this is a global path event, not a local Hessian-index event.", + "theorem_certificate_status": "not_attached", + "title": "Borel global elder maximin event", + "topic": "D1 corrected lifetime / marked Kac–Rice" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-ELDER-MEAS", + "external_theorem_imports": [ + "EXT-MORSE-ELDER" + ], + "fingerprint": "b11e650c3b0ca82f7b3e4d61c739fce7583433b747ff969778f5847992e3b26a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-ELDER-MEAS", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V35" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§8 pinned genericity and global Borel pairing", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-ELDER-MEAS:scope", + "origin": "verbatim_curated_scope", + "text": "Smooth functions on compact manifold, Morse and distinct critical values; rational polygonal paths only approximate strict superlevel connectivity. Identification as elder partner uses the specified superlevel H0 convention.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-EQ-COMPACT", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "7fb66b1853ea33a3ea92f599e8e6719b4e8bd1c9fba31720a9833fe912c62d8a", + "exact_boundary": { + "record_id": "D1-EQ-COMPACT", + "kind": "Equation", + "statement": "Exact contact-integral coefficient in the accepted compact-mark density theorem.", + "equations": [ + "c_{B,K}=4\\int_{B\\times K\\times S^{d-1}}k^{-2/3}\\,\\pi_0(R;v_0)\\,z_0(b,k,R)\\,db\\,dk\\,d\\sigma(u)", + "z_0=(6k)^2\\mathbb E[(\\det A_0)^2\\,\\mathbf 1_{\\{A_0\\prec0\\}}]" + ], + "scope": "Fixed d,L; B,K compact positive-length intervals with k_->0; unnormalized full pin density/normalizer, sphere area measure. No numerical evaluation.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "§11 (11.3)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "c_{B,K}=4\\int_{B\\times K\\times S^{d-1}}k^{-2/3}\\,\\pi_0(R;v_0)\\,z_0(b,k,R)\\,db\\,dk\\,d\\sigma(u)", + "z_0=(6k)^2\\mathbb E[(\\det A_0)^2\\,\\mathbf 1_{\\{A_0\\prec0\\}}]" + ], + "full_theorem_checker_passed": false, + "id": "D1-EQ-COMPACT", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Equation", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "e3a586f165588008ca21cc5e816b78ae25f07c428fd40a122ccc5b5f4e40567a", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§11 (11.3)", + "record_fingerprint_v14": "aea39de86c07004f38267995c71a1077b1e002184170f9464e35002be16d5e70", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Fixed d,L; B,K compact positive-length intervals with k_->0; unnormalized full pin density/normalizer, sphere area measure. No numerical evaluation.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "Exact contact-integral coefficient in the accepted compact-mark density theorem.", + "theorem_certificate_status": "not_attached", + "title": "Compact-window leading coefficient", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-EQ-COMPACT", + "external_theorem_imports": [], + "fingerprint": "7ae93560f4166610af6967943535dcd73cc92fecb23790aa1230ff54126cb388", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-EQ-COMPACT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§11 (11.3)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-EQ-COMPACT:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d,L; B,K compact positive-length intervals with k_->0; unnormalized full pin density/normalizer, sphere area measure. No numerical evaluation.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-EQ-GLOBAL", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "d26b710c2e781974d231cf6e1a4ae4ea2ac0878b9eacd7ea24d0d14079781946", + "exact_boundary": { + "record_id": "D1-EQ-GLOBAL", + "kind": "Equation", + "statement": "Birth and gap integration produces the reviewed angular/Gaussian coefficient formula.", + "equations": [ + "c_{d,L}=\\frac{\\Gamma(7/6)}{24^{1/3}\\sqrt\\pi}\\int_{S^{d-1}}p_G(0)\\,p_{V_u}(0)\\,\\tau_u^{4/3}\\,D_u\\,d\\sigma(u)", + "\\tau_u^2=\\operatorname{Var}(\\partial_u^3 f\\mid \\nabla f=0),\\quad D_u=\\mathbb E[(\\det A_u)^2\\mathbf 1_{A_u\\prec0}\\mid V_u=0]" + ], + "scope": "Exact periodized covariance, every fixed d>=2 and L. 24 is an algebraic prefactor, not the torus side length; coefficient not numerically evaluated here.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "§15 (15.1)–(15.2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "c_{d,L}=\\frac{\\Gamma(7/6)}{24^{1/3}\\sqrt\\pi}\\int_{S^{d-1}}p_G(0)\\,p_{V_u}(0)\\,\\tau_u^{4/3}\\,D_u\\,d\\sigma(u)", + "\\tau_u^2=\\operatorname{Var}(\\partial_u^3 f\\mid \\nabla f=0),\\quad D_u=\\mathbb E[(\\det A_u)^2\\mathbf 1_{A_u\\prec0}\\mid V_u=0]" + ], + "full_theorem_checker_passed": false, + "id": "D1-EQ-GLOBAL", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Equation", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "acf3ec6f42c8efc940f04fb5f539d99b6ebbdf469747a517953a945f40675ee9", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§15 (15.1)–(15.2)", + "record_fingerprint_v14": "26086bf68fca2a4165e0b2b4bcaf7b4fbcbf4bf60b64ae7c8f3a2fbb2078b5c1", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Exact periodized covariance, every fixed d>=2 and L. 24 is an algebraic prefactor, not the torus side length; coefficient not numerically evaluated here.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "Birth and gap integration produces the reviewed angular/Gaussian coefficient formula.", + "theorem_certificate_status": "not_attached", + "title": "Unrestricted leading coefficient", + "topic": "D1" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-EQ-GLOBAL", + "external_theorem_imports": [], + "fingerprint": "81df579875a93b1c7ca1b909103970ff328290c356cdbc6b2a5d50d1f022a4a6", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-EQ-GLOBAL", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§15 (15.1)–(15.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-EQ-GLOBAL:scope", + "origin": "verbatim_curated_scope", + "text": "Exact periodized covariance, every fixed d>=2 and L. 24 is an algebraic prefactor, not the torus side length; coefficient not numerically evaluated here.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-KR-BOREL", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "ab48317ffbe961b2ef0b5b8c7f12a1b5aa385a7e7fbf0f979362d18c53d88837", + "exact_boundary": { + "record_id": "D1-KR-BOREL", + "kind": "Reviewed scoped proof interface", + "statement": "The continuous-cylinder marked Kac–Rice formula extends to bounded Borel marks because it identifies two finite measures on D×C²(X) on a determining algebra and the functional monotone-class theorem applies; then the Borel elder/type indicator is permitted with the full determinant included only once.", + "equations": [ + "mu(A)=E sum_{t in D:G(t)=0}1_A(t,f)", + "nu(A)=integral_D p_(G(t))(0) E[Delta(t)1_A(t,f)|G(t)=0]dt", + "Delta(t)=|det H_x det H_y|" + ], + "scope": "Requires verified unweighted Kac–Rice and continuous-weight theorem hypotheses on compact off-diagonal D, finite total masses, C²-valued conditional kernel, and the Borel elder mark. The cited external general theorem is imported, NOT independently proved.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_section9_borel_repair_20260925/REPAIR.md", + "proof_ref": "Replacement §§9.2–9.4, reviewed C1–C6", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "mu(A)=E sum_{t in D:G(t)=0}1_A(t,f)", + "nu(A)=integral_D p_(G(t))(0) E[Delta(t)1_A(t,f)|G(t)=0]dt", + "Delta(t)=|det H_x det H_y|" + ], + "full_theorem_checker_passed": false, + "id": "D1-KR-BOREL", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed scoped proof interface", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "be90631760ee0a74c8fd58aa7c860ee2360e3e5ac9cec60a2b1f48f8de397dc3", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Replacement §§9.2–9.4, reviewed C1–C6", + "record_fingerprint_v14": "547afba0acc2fab5c6f5e31a6e6739083f3e34c708416d2d586fbf47a3473052", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Requires verified unweighted Kac–Rice and continuous-weight theorem hypotheses on compact off-diagonal D, finite total masses, C²-valued conditional kernel, and the Borel elder mark. The cited external general theorem is imported, NOT independently proved.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_section9_borel_repair_20260925/REPAIR.md", + "source_authenticated": false, + "statement": "The continuous-cylinder marked Kac–Rice formula extends to bounded Borel marks because it identifies two finite measures on D×C²(X) on a determining algebra and the functional monotone-class theorem applies; then the Borel elder/type indicator is permitted with the full determinant included only once.", + "theorem_certificate_status": "not_attached", + "title": "Finite-measure extension to the global elder weight", + "topic": "D1 corrected lifetime / marked Kac–Rice" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-KR-BOREL", + "external_theorem_imports": [ + "EXT-C2-KERNEL", + "EXT-KR-AAL" + ], + "fingerprint": "443019d2b2f711d2b789ea99b366db41aa7945d80f3262a312942b7cb9d5da86", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-KR-BOREL", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V37" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-ELDER-MEAS", + "D1-KR-KERNEL" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Replacement §§9.2–9.4, reviewed C1–C6", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_section9_borel_repair_20260925/REPAIR.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-KR-BOREL:scope", + "origin": "verbatim_curated_scope", + "text": "Requires verified unweighted Kac–Rice and continuous-weight theorem hypotheses on compact off-diagonal D, finite total masses, C²-valued conditional kernel, and the Borel elder mark. The cited external general theorem is imported, NOT independently proved.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [ + "SRC-D1-ERRATUM", + "SRC-D1-PARENT", + "SRC-D1-RECON", + "SRC-D1-REPAIR" + ], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-KR-DOM", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "75d3f5c6f2be89589253b8eb9a14b5ab79ac2df72b431f8b3bb6a7053007f688", + "exact_boundary": { + "record_id": "D1-KR-DOM", + "kind": "Reviewed scoped proof interface", + "statement": "The near-diagonal compact spatial exhaustion is legitimate under an r A_r integrable bound. The all-mark near lifetime pushforward has cutoff k≥ell/r0³ and an integrable k^(-2/3) Gaussian majorant, so dominated convergence is valid for the leading coefficient without any global probability floor.", + "equations": [ + "A_r≤C(1+|b|+k)^(2d) exp(-c(b²+k²))", + "k ≥ ell/r0³", + "ell^(1/3) nu_near(ell)=integral 1{k≥ell/r0³} A_((ell/k)^(1/3))/(3k^(2/3)) db dk dσ" + ], + "scope": "Fixed d,L and r≤r0; all real b and k>0; uses prior Gaussian residual uniform moments, positivity and local convergence of full normalizer and pair density, and marked Kac–Rice. Does not prove unrestricted O(1) density remainder.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "proof_ref": "§13 (13.3)–(13.6), plus replacement §9 final exhaustion", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "A_r≤C(1+|b|+k)^(2d) exp(-c(b²+k²))", + "k ≥ ell/r0³", + "ell^(1/3) nu_near(ell)=integral 1{k≥ell/r0³} A_((ell/k)^(1/3))/(3k^(2/3)) db dk dσ" + ], + "full_theorem_checker_passed": false, + "id": "D1-KR-DOM", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed scoped proof interface", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "6bea80f533287489f03e209b764747c201ef529252405eea990a0946553501df", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§13 (13.3)–(13.6), plus replacement §9 final exhaustion", + "record_fingerprint_v14": "2b5d731529b4bc304d7c150245834c4ba8d3f63c8708baefed69ca1518741ce6", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "scope": "Fixed d,L and r≤r0; all real b and k>0; uses prior Gaussian residual uniform moments, positivity and local convergence of full normalizer and pair density, and marked Kac–Rice. Does not prove unrestricted O(1) density remainder.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_authenticated": false, + "statement": "The near-diagonal compact spatial exhaustion is legitimate under an r A_r integrable bound. The all-mark near lifetime pushforward has cutoff k≥ell/r0³ and an integrable k^(-2/3) Gaussian majorant, so dominated convergence is valid for the leading coefficient without any global probability floor.", + "theorem_certificate_status": "not_attached", + "title": "Unnormalized all-mark majorant and diagonal exhaustion", + "topic": "D1 corrected lifetime / marked Kac–Rice" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-KR-DOM", + "external_theorem_imports": [ + "EXT-GAUSS-MOMENTS", + "EXT-KR-OFFDIAG" + ], + "fingerprint": "417a1f3e4f383ad486379e4bfb46e1e49f7993d9fcc0379b2a1a593f6fd7fef6", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-KR-DOM", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V39" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-KR-JACOB" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§13 (13.3)–(13.6), plus replacement §9 final exhaustion", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-KR-DOM:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d,L and r≤r0; all real b and k>0; uses prior Gaussian residual uniform moments, positivity and local convergence of full normalizer and pair density, and marked Kac–Rice. Does not prove unrestricted O(1) density remainder.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [ + "SRC-D1-ERRATUM", + "SRC-D1-PARENT", + "SRC-D1-RECON", + "SRC-D1-REPAIR" + ], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D1-KR-FAR", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "f4d24ce1f727947198ff2ea8b108351d79855d71610d5ff404e5e0401f6cc437", + "exact_boundary": { + "record_id": "D1-KR-FAR", + "kind": "Reviewed scoped proof interface", + "statement": "For spatial pairs at separation at least r0, compactness and nondegenerate joint pin covariance give a Gaussian birth-height density bound, polynomial determinant moments, and a bounded candidate and selected height-density contribution.", + "equations": [ + "0≤nu_eld^far(ell)≤nu_cand^far(ell)≤C for 00, 00, 00, 0=2, torus L and compact birth/gap windows with k_->0, all frames, sufficiently small r. Existential constants only. Lower proof and D1 upper have separate review provenance.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e7f8aca41c308f8ad8614b587f75916943c86f27/frontiers/elder_dimension_lift_20260928/PROOF.md", + "proof_ref": "Theorem A (A2)–(A4), dimensional lower", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "c r^3\\le 1-p_r(b,k,R)\\le C r^3\\quad(\\text{after combining distinct accepted inputs})" + ], + "full_theorem_checker_passed": false, + "id": "D1-LOWER-DIM", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed theorem", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "58cd6a605f70c6dfb45961a4b7418d1f6fb7baf86232dbd608aec296a7a278a8", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem A (A2)–(A4), dimensional lower", + "record_fingerprint_v14": "61185538443534bd7a4650520da624413a1b64bfb9acb6c10b7db290f6eff29d", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/docs/integration/2026-09-29-reviewed-dimension-and-pair.md", + "scope": "Every fixed d>=2, torus L and compact birth/gap windows with k_->0, all frames, sufficiently small r. Existential constants only. Lower proof and D1 upper have separate review provenance.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e7f8aca41c308f8ad8614b587f75916943c86f27/frontiers/elder_dimension_lift_20260928/PROOF.md", + "source_authenticated": false, + "statement": "Separately reviewed lower-event construction yields the matching cubic lower probability; together with the separately reviewed D1 upper bound it gives the sharp order.", + "theorem_certificate_status": "not_attached", + "title": "Fixed-dimensional cubic elder-rejection lower bound", + "topic": "D1 extension" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-LOWER-DIM", + "external_theorem_imports": [], + "fingerprint": "b98f7be50f6a891d2f779584f8749bced59d1e341b2eee8db379ca2d6e822c76", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-LOWER-DIM", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem A (A2)–(A4), dimensional lower", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/docs/integration/2026-09-29-reviewed-dimension-and-pair.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e7f8aca41c308f8ad8614b587f75916943c86f27/frontiers/elder_dimension_lift_20260928/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-LOWER-DIM:scope", + "origin": "verbatim_curated_scope", + "text": "Every fixed d>=2, torus L and compact birth/gap windows with k_->0, all frames, sufficiently small r. Existential constants only. Lower proof and D1 upper have separate review provenance.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D2-CUMULATIVE-CORRECTION", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "f26d6ba56b7a30464ddb7da4e2a4f7a0d009ca5fee306bd5321414a9fec8be58", + "exact_boundary": { + "record_id": "D2-CUMULATIVE-CORRECTION", + "kind": "Corrected reviewed theorem", + "statement": "A general, separately reviewed cumulative asymptotic from monotone contact-height inversion under an exact asymptotic normalization; derivative assumptions are unnecessary for this cumulative statement.", + "equations": [ + "\\beta=(\\alpha+1)/m,\\qquad h(r,z)/(\\kappa(z)r^m)\\to 1", + "N(\\ell)=\\int_Z\\int_0^{r_0}r^\\alpha B(r,z)\\mathbf 1_{\\{h(r,z)\\le\\ell\\}}\\,dr\\,d\\lambda(z)", + "\\lim_{\\ell\\downarrow0}\\frac{N(\\ell)}{\\ell^\\beta}=\\frac{1}{\\alpha+1}\\int_Z B_0(z)\\kappa(z)^{-\\beta}\\,d\\lambda(z)" + ], + "scope": "σ-finite (Z,λ), α>-1, m>0, κ>0; 0≤B≤G, B→B0, integrable G κ^{-β}; h continuous strictly increasing, h(0+)=0, h/(κ r^m)→1, and h≥c0 κ r^m uniformly. Positive asymptotic equivalence only if coefficient positive; zero coefficient yields o(ℓ^β). No derivative or density limit follows.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/collision_mechanism_20260925/CUMULATIVE_TRANSFER_CORRECTION.md", + "proof_ref": "Corrected cumulative theorem, §1 and proof", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\beta=(\\alpha+1)/m,\\qquad h(r,z)/(\\kappa(z)r^m)\\to 1", + "N(\\ell)=\\int_Z\\int_0^{r_0}r^\\alpha B(r,z)\\mathbf 1_{\\{h(r,z)\\le\\ell\\}}\\,dr\\,d\\lambda(z)", + "\\lim_{\\ell\\downarrow0}\\frac{N(\\ell)}{\\ell^\\beta}=\\frac{1}{\\alpha+1}\\int_Z B_0(z)\\kappa(z)^{-\\beta}\\,d\\lambda(z)" + ], + "full_theorem_checker_passed": false, + "id": "D2-CUMULATIVE-CORRECTION", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Corrected reviewed theorem", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "d4e8901601e4e46a06e78d363e0835926ee2dc70113b16a63f3045078d8b28d9", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Corrected cumulative theorem, §1 and proof", + "record_fingerprint_v14": "2a5c5626d8f7fb5198e971c2bd15dbd2854bd51b4858d81e6acc8633c5b3a160", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d2_cumulative_correction_20260925/REVIEW.md", + "scope": "σ-finite (Z,λ), α>-1, m>0, κ>0; 0≤B≤G, B→B0, integrable G κ^{-β}; h continuous strictly increasing, h(0+)=0, h/(κ r^m)→1, and h≥c0 κ r^m uniformly. Positive asymptotic equivalence only if coefficient positive; zero coefficient yields o(ℓ^β). No derivative or density limit follows.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/collision_mechanism_20260925/CUMULATIVE_TRANSFER_CORRECTION.md", + "source_authenticated": false, + "statement": "A general, separately reviewed cumulative asymptotic from monotone contact-height inversion under an exact asymptotic normalization; derivative assumptions are unnecessary for this cumulative statement.", + "theorem_certificate_status": "not_attached", + "title": "Normalized cumulative transfer theorem", + "topic": "D2" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-CUMULATIVE-CORRECTION", + "external_theorem_imports": [], + "fingerprint": "ef8681afbe7a78b5425b4e4b2ca7764f1c1b25e0a404aff7b0655582b5599b21", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-CUMULATIVE-CORRECTION", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V07" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Corrected cumulative theorem, §1 and proof", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d2_cumulative_correction_20260925/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/collision_mechanism_20260925/CUMULATIVE_TRANSFER_CORRECTION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-CUMULATIVE-CORRECTION:scope", + "origin": "verbatim_curated_scope", + "text": "σ-finite (Z,λ), α>-1, m>0, κ>0; 0≤B≤G, B→B0, integrable G κ^{-β}; h continuous strictly increasing, h(0+)=0, h/(κ r^m)→1, and h≥c0 κ r^m uniformly. Positive asymptotic equivalence only if coefficient positive; zero coefficient yields o(ℓ^β). No derivative or density limit follows.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D2-LEM-R31", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "54b52e41919786f14b98ad8a4799b595781e154622db026157075cffbcfa1180", + "exact_boundary": { + "record_id": "D2-LEM-R31", + "kind": "Lemma R3.1", + "statement": "Typed determinant is locally Lipschitz with a polynomial operator-norm factor, even as the inertia changes.", + "equations": [ + "F_j(H)=|\\det H|\\mathbf 1_{\\{\\operatorname{ind}(H)=j\\}}", + "|F_j(X)-F_j(Y)|\\le n\\max(\\|X\\|,\\|Y\\|)^{n-1}\\|X-Y\\|" + ], + "scope": "Real symmetric n by n X,Y, with F_j=0 on singular matrices; index counts negative eigenvalues.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "proof_ref": "§3 Lemma R3.1 (R6)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "F_j(H)=|\\det H|\\mathbf 1_{\\{\\operatorname{ind}(H)=j\\}}", + "|F_j(X)-F_j(Y)|\\le n\\max(\\|X\\|,\\|Y\\|)^{n-1}\\|X-Y\\|" + ], + "full_theorem_checker_passed": false, + "id": "D2-LEM-R31", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma R3.1", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "086ab4843d67e0bea7b958873367cb49aea8be3902b97926417da4d38d04ea21", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§3 Lemma R3.1 (R6)", + "record_fingerprint_v14": "dc49cd4a2a4bbe107da1bd856a03a20dfdbe98e2c184af96481a83874bdeb557", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Real symmetric n by n X,Y, with F_j=0 on singular matrices; index counts negative eigenvalues.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_authenticated": false, + "statement": "Typed determinant is locally Lipschitz with a polynomial operator-norm factor, even as the inertia changes.", + "theorem_certificate_status": "not_attached", + "title": "Index-filtered determinant stability", + "topic": "D2" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-LEM-R31", + "external_theorem_imports": [], + "fingerprint": "b24f1e88c9f35a933684039d92fbd3e15ef42f30c4dcd52c9b7f8426758e6b3d", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-LEM-R31", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V01" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3 Lemma R3.1 (R6)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-LEM-R31:scope", + "origin": "verbatim_curated_scope", + "text": "Real symmetric n by n X,Y, with F_j=0 on singular matrices; index counts negative eigenvalues.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D2-LEM-R32", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "548f00acbee956325fec5322cd19d919d5da8d1bcddea656bdd4a7cb0c54ab1b", + "exact_boundary": { + "record_id": "D2-LEM-R32", + "kind": "Lemma R3.2", + "statement": "Symmetric block perturbation by a square-root off-diagonal term changes typed determinant at order r.", + "equations": [ + "K_t=\\begin{pmatrix}\\alpha&\\sqrt t\\,\\beta^T\\\\\\sqrt t\\,\\beta&A\\end{pmatrix}", + "|F_j(K_r)-F_j(K_0)|\\le r|\\beta^T\\operatorname{adj}(A)\\beta|" + ], + "scope": "Real symmetric A, scalar alpha, beta vector, r>=0; no inverse of A needed, even if A singular.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "proof_ref": "§3 Lemma R3.2 (R7)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "K_t=\\begin{pmatrix}\\alpha&\\sqrt t\\,\\beta^T\\\\\\sqrt t\\,\\beta&A\\end{pmatrix}", + "|F_j(K_r)-F_j(K_0)|\\le r|\\beta^T\\operatorname{adj}(A)\\beta|" + ], + "full_theorem_checker_passed": false, + "id": "D2-LEM-R32", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma R3.2", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "7a2ca753030d4badfa97c58e5068ab5a6d54ae7e04a2d20b3726907e3b207feb", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§3 Lemma R3.2 (R7)", + "record_fingerprint_v14": "db6ef5f9affcf3bc2b9a6e8ab172a320614a08a8489aaf658cb85145d2bc5b90", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Real symmetric A, scalar alpha, beta vector, r>=0; no inverse of A needed, even if A singular.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_authenticated": false, + "statement": "Symmetric block perturbation by a square-root off-diagonal term changes typed determinant at order r.", + "theorem_certificate_status": "not_attached", + "title": "Quadratic off-diagonal determinant cancellation", + "topic": "D2" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-LEM-R32", + "external_theorem_imports": [], + "fingerprint": "e8963d2d57b16baef69ccd4d9a5bd01aa2d2ea5e27494534ff8cf6f49c77884a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-LEM-R32", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V02" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3 Lemma R3.2 (R7)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-LEM-R32:scope", + "origin": "verbatim_curated_scope", + "text": "Real symmetric A, scalar alpha, beta vector, r>=0; no inverse of A needed, even if A singular.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D2-OBS", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "daf0e46bc68470cb3a1ebe6b964ac07d2df6c8c3d7dda45a3120a8a9f7cbf020", + "exact_boundary": { + "record_id": "D2-OBS", + "kind": "Supporting identity", + "statement": "The symmetric two-pin observation transform has an exact determinant and second-order, not first-order, centered difference error.", + "equations": [ + "|det T_r|=12 r^(-(d+3))", + "U_{r,4}=f_{xxx}(0)+(r²/40)f_{xxxxx}(0)+O(r⁴)", + "v_r=(b−kr³/2,−kr²,0,12k,0,…)" + ], + "scope": "Smooth scalar axial field; r>0 and symmetric pins ±r/2; d−1 transverse derivative pairs. Formal Taylor identity alone does not prove Gaussian-field Lp coupling.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "proof_ref": "§2, axial transform and (R2)–(R4)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "|det T_r|=12 r^(-(d+3))", + "U_{r,4}=f_{xxx}(0)+(r²/40)f_{xxxxx}(0)+O(r⁴)", + "v_r=(b−kr³/2,−kr²,0,12k,0,…)" + ], + "full_theorem_checker_passed": false, + "id": "D2-OBS", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Supporting identity", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "5e9070e2b37169edcac2d4fd8da1f69830b83cc9f9cc07387fca604b34b8feee", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§2, axial transform and (R2)–(R4)", + "record_fingerprint_v14": "54dc7028b4a396805ddc2b29c33a9048422462538de85132ec61ad70b2ee7daa", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Smooth scalar axial field; r>0 and symmetric pins ±r/2; d−1 transverse derivative pairs. Formal Taylor identity alone does not prove Gaussian-field Lp coupling.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_authenticated": false, + "statement": "The symmetric two-pin observation transform has an exact determinant and second-order, not first-order, centered difference error.", + "theorem_certificate_status": "not_attached", + "title": "Centered contact-observation transform identities", + "topic": "D2" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-OBS", + "external_theorem_imports": [], + "fingerprint": "2696ed189f5de73fb9d3140325a5eebe445c104b0e411bc0f0555527a9a1c5d7", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-OBS", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V15" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§2, axial transform and (R2)–(R4)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-OBS:scope", + "origin": "verbatim_curated_scope", + "text": "Smooth scalar axial field; r>0 and symmetric pins ±r/2; d−1 transverse derivative pairs. Formal Taylor identity alone does not prove Gaussian-field Lp coupling.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D2-R", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "f28843116841bfb8366769b976be852c6c026f7e818456a5202f0cfb83ef15a0", + "exact_boundary": { + "record_id": "D2-R", + "kind": "Theorem R", + "statement": "The project’s accepted scoped refinement bounds the deviations of unrestricted candidate and actual elder densities from the leading power term.", + "equations": [ + "|ν_cand(ℓ)−c ℓ^(−1/3)| ≤ C\n0 ≤ ν_cand(ℓ)−ν_eld(ℓ) ≤ C\n|ν_eld(ℓ)−c ℓ^(−1/3)| ≤ C" + ], + "scope": "For sufficiently small ℓ in the exact fixed d,L field, using the parent theorem interfaces. C and lifetime cutoff are existential; no second coefficient.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "proof_ref": "Theorem R, Eq. (R1)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "|ν_cand(ℓ)−c ℓ^(−1/3)| ≤ C\n0 ≤ ν_cand(ℓ)−ν_eld(ℓ) ≤ C\n|ν_eld(ℓ)−c ℓ^(−1/3)| ≤ C" + ], + "full_theorem_checker_passed": false, + "id": "D2-R", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem R", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "16fbf4d1a704d52d4396c2b78120d45ed5fa08af1de6e340ff746648b9fb35e0", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem R, Eq. (R1)", + "record_fingerprint_v14": "232e46c1f351ca700e0ce28c74aec378447e836013d8ab66ed0af735bd290611", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "For sufficiently small ℓ in the exact fixed d,L field, using the parent theorem interfaces. C and lifetime cutoff are existential; no second coefficient.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_authenticated": false, + "statement": "The project’s accepted scoped refinement bounds the deviations of unrestricted candidate and actual elder densities from the leading power term.", + "theorem_certificate_status": "not_attached", + "title": "Bounded unrestricted lifetime remainder", + "topic": "D2" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-R", + "external_theorem_imports": [], + "fingerprint": "6e41a68ceb4961bd89bd137351c9540a245885a5730291c56f49306d65e39323", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-R", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V23" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-02", + "D1-KR-BOREL", + "D1-KR-FAR", + "D1-KR-JACOB", + "D2-LEM-R31", + "D2-LEM-R32", + "D2-OBS", + "D2-R11-INTENSITY", + "D2-R12-TAILS" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem R, Eq. (R1)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-R:scope", + "origin": "verbatim_curated_scope", + "text": "For sufficiently small ℓ in the exact fixed d,L field, using the parent theorem interfaces. C and lifetime cutoff are existential; no second coefficient.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D2-R11-GAUSS", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "94670cca7641e58617fde9ad52a28d02570a1eeb855d468a654751b6ad72c2de", + "exact_boundary": { + "record_id": "D2-R11-GAUSS", + "kind": "R2–R5 supporting estimate", + "statement": "Centered pin observations yield a second-order covariance and Gaussian-density interpolation bound uniformly in all height and gap marks, with Gaussian tail absorbing target growth.", + "equations": [ + "||Σ_r−Σ_0|| + ||Σ_r⁻¹−Σ_0⁻¹|| = O(r²)", + "π_r(v_r) ≤ C exp(−c(b²+k²))", + "|π_r(v_r)−π_0(v_0)| ≤ C r² (1+|b|+k)² exp(−c(b²+k²))" + ], + "scope": "Fixed d,L, compact orientation space, sufficiently small r; exact periodized Gaussian field with nondegenerate finite contact jets. Covariance/target interpolation, not a proof of Kac–Rice selection.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "proof_ref": "§2 (R2)–(R5)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "||Σ_r−Σ_0|| + ||Σ_r⁻¹−Σ_0⁻¹|| = O(r²)", + "π_r(v_r) ≤ C exp(−c(b²+k²))", + "|π_r(v_r)−π_0(v_0)| ≤ C r² (1+|b|+k)² exp(−c(b²+k²))" + ], + "full_theorem_checker_passed": false, + "id": "D2-R11-GAUSS", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "R2–R5 supporting estimate", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "b675cc209eaddc577214353c84fe06b5c5c33456b307bf10d6132d4a9c2753d4", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§2 (R2)–(R5)", + "record_fingerprint_v14": "02f5269ee747c3160412e02c03f9032d65f8cb43103aa6ef7c87002075f77156", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Fixed d,L, compact orientation space, sufficiently small r; exact periodized Gaussian field with nondegenerate finite contact jets. Covariance/target interpolation, not a proof of Kac–Rice selection.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_authenticated": false, + "statement": "Centered pin observations yield a second-order covariance and Gaussian-density interpolation bound uniformly in all height and gap marks, with Gaussian tail absorbing target growth.", + "theorem_certificate_status": "not_attached", + "title": "Uniform second-order Gaussian regression and target-density envelope", + "topic": "D2" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-R11-GAUSS", + "external_theorem_imports": [ + "EXT-GAUSS-MOMENTS" + ], + "fingerprint": "a531502db038fe6ea93a07eb4e3139302d8f03078b37f04dd660ebf4385aad2c", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-R11-GAUSS", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V24" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-03", + "D2-OBS" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§2 (R2)–(R5)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-R11-GAUSS:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d,L, compact orientation space, sufficiently small r; exact periodized Gaussian field with nondegenerate finite contact jets. Covariance/target interpolation, not a proof of Kac–Rice selection.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D2-R11-INTENSITY", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "8669bb652bf117c49c131da07f6d14c843a9efe13938fcaaecd878410e97d81f", + "exact_boundary": { + "record_id": "D2-R11-INTENSITY", + "kind": "R8–R11 supporting estimate", + "statement": "The endpoint Hessian determinant product has a contact limit and r(k+r) error; multiplying by the Gaussian pin density gives a k-uniform all-mark envelope without a normalizer lower bound.", + "equations": [ + "Z_r/r² ≤ C(k+r)² P^N", + "|Z_r/r²−z_0| ≤ C r(k+r) P^N", + "0≤A_r≤(k+r)² H; 0≤A_0≤k² H; |A_r−A_0|≤r(k+r)H" + ], + "scope": "Fixed d,L; every b∈R,k>0; 00; 00; 01/(4Dδ)]" + ], + "scope": "m=d−1≥1; δ=r/k≤1; fixed d,L; uses imported parent determinant envelope, Weyl eigenvalue coordinates, full Gaussian tail and weighted moment estimates. Does not assert a globally normalized cap probability bound.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "proof_ref": "§5 (R14), (R15), soft near branch", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "W/r² ≤ (h²/4) λ₁(λ₁+3rh/2) ∏_{j=2}^m λ_j(λ_j+rh)", + "∫₀^{DδU²} λ(λ+E rU) dλ = (D³/3)δ³ U⁶+(ED²/2)rδ² U⁵", + "λ≤Dδ(T+λ)² ⇒ [λ≤4Dδ T² or λ>1/(4Dδ)]" + ], + "full_theorem_checker_passed": false, + "id": "D2-R12-SOFT", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "R14–R15 supporting estimate", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "291b781df84f22e0b3948d4911daf2ccf34a5d654141e3dcfbf085b4b572b966", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§5 (R14), (R15), soft near branch", + "record_fingerprint_v14": "8b4bf45676b1674907e8deaf2ef914aaf45d8e3340197bb55bf9269cdae8b6a5", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "m=d−1≥1; δ=r/k≤1; fixed d,L; uses imported parent determinant envelope, Weyl eigenvalue coordinates, full Gaussian tail and weighted moment estimates. Does not assert a globally normalized cap probability bound.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_authenticated": false, + "statement": "On negative transverse-Hessian support, a soft eigenvalue integrates to cubic order in δ=r/k under the joint Gaussian density; the scalar m=1 case requires an additional large-eigenvalue branch.", + "theorem_certificate_status": "not_attached", + "title": "R12 soft-eigenvalue cap-loss integration", + "topic": "D2" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-R12-SOFT", + "external_theorem_imports": [], + "fingerprint": "f7cadb1ae9c24632e1b9c250c60049e4962db946d22c38804b6cb178808cd1d1", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-R12-SOFT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V27" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-02", + "D1-CAP-MATRIX", + "D2-R12-JOINT" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5 (R14), (R15), soft near branch", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-R12-SOFT:scope", + "origin": "verbatim_curated_scope", + "text": "m=d−1≥1; δ=r/k≤1; fixed d,L; uses imported parent determinant envelope, Weyl eigenvalue coordinates, full Gaussian tail and weighted moment estimates. Does not assert a globally normalized cap probability bound.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D2-R12-TAILS", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "b7697d5f9b02c3c5a86a310a712c10343a876b646db57f5e4053b509fc6a7b69", + "exact_boundary": { + "record_id": "D2-R12-TAILS", + "kind": "R12 supporting estimate", + "statement": "The large-eigenvalue scalar branch and fourth-derivative exception are controlled by fourth-moment weighted Markov inequalities and contribute O(δ⁴), which is bounded by O(δ³) for δ≤1.", + "equations": [ + "1_{λ>1/(4Dδ)} ≤ (4Dδ λ)⁴", + "1_{M4>3/(10δ)} ≤ (10δ M4/3)⁴", + "B_r ≤ δ³ H(b,k), δ=r/k≤1" + ], + "scope": "Fixed d,L; Gaussian joint envelope and all weighted polynomial moments must be established; near soft-eigenvalue contribution is imported from its separate proof step. No inference that B_r/A_r is uniformly O(δ³).", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "proof_ref": "§5 far branch, fourth derivative exception, (R12)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "1_{λ>1/(4Dδ)} ≤ (4Dδ λ)⁴", + "1_{M4>3/(10δ)} ≤ (10δ M4/3)⁴", + "B_r ≤ δ³ H(b,k), δ=r/k≤1" + ], + "full_theorem_checker_passed": false, + "id": "D2-R12-TAILS", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "R12 supporting estimate", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "05228430b7369ae1be056af3e81af345b26e9b0735bb464181f55b93a7614ed0", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§5 far branch, fourth derivative exception, (R12)", + "record_fingerprint_v14": "1845467c3cc0dd767785ca4568cae907c750e394e7ae6e4aacac2bd74d328fd4", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Fixed d,L; Gaussian joint envelope and all weighted polynomial moments must be established; near soft-eigenvalue contribution is imported from its separate proof step. No inference that B_r/A_r is uniformly O(δ³).", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_authenticated": false, + "statement": "The large-eigenvalue scalar branch and fourth-derivative exception are controlled by fourth-moment weighted Markov inequalities and contribute O(δ⁴), which is bounded by O(δ³) for δ≤1.", + "theorem_certificate_status": "not_attached", + "title": "R12 weighted exceptional-event tail bounds", + "topic": "D2" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-R12-TAILS", + "external_theorem_imports": [], + "fingerprint": "76629daf7e795ef02f669f15ad6f2c20488855b4545b1917faf32d6380a1d85a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-R12-TAILS", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V28" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-CAP-ELDER", + "D2-R12-JOINT", + "D2-R12-SOFT" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5 far branch, fourth derivative exception, (R12)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-R12-TAILS:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d,L; Gaussian joint envelope and all weighted polynomial moments must be established; near soft-eigenvalue contribution is imported from its separate proof step. No inference that B_r/A_r is uniformly O(δ³).", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D3-01", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "0398ff61983a739169b286ca99ee1b72f54c762394c25513ba13c69e3ad4702c", + "exact_boundary": { + "record_id": "D3-01", + "kind": "Certified enclosure", + "statement": "Outward interval enclosure for the coefficient defined by the exact SIDE24 coefficient construction.", + "equations": [ + "0.07340691930603427103 < c₂,₂₄ < 0.07340691930603427104" + ], + "scope": "Fixed SIDE24 periodized Gaussian law; coefficient enclosure, not a finite-lifetime numerical error bar.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "proof_ref": "Coefficient enclosure", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "0.07340691930603427103 < c₂,₂₄ < 0.07340691930603427104" + ], + "full_theorem_checker_passed": false, + "id": "D3-01", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Certified enclosure", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "ab29277c40ea1ef2c66977aa6677908c15cc096ec6e212d3dbf72d2db2f1e2bf", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Coefficient enclosure", + "record_fingerprint_v14": "884834d771f94902168198c43eb63cad936e9d738b4379132c7b40f9c55fe867", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Fixed SIDE24 periodized Gaussian law; coefficient enclosure, not a finite-lifetime numerical error bar.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_authenticated": false, + "statement": "Outward interval enclosure for the coefficient defined by the exact SIDE24 coefficient construction.", + "theorem_certificate_status": "not_attached", + "title": "SIDE24 coefficient in dimension two", + "topic": "D3" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D3-01", + "external_theorem_imports": [], + "fingerprint": "954827cbbbeb9a9f6c15849ecc1e10e8d2c1a5b27f134076978db3e830bf93e8", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D3-01", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D3-C3" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Coefficient enclosure", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D3-01:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed SIDE24 periodized Gaussian law; coefficient enclosure, not a finite-lifetime numerical error bar.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D3-02", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "0e4c8576af46a6fbef209a713ce0f9d56f6d3c6712bd14bd7e5fa53c16512df9", + "exact_boundary": { + "record_id": "D3-02", + "kind": "Certified enclosure", + "statement": "Outward interval enclosure for the dimension-three coefficient.", + "equations": [ + "0.04177593184059834334 < c₃,₂₄ < 0.04177593184059834335" + ], + "scope": "Same SIDE24 normalization and all-direction periodization comparison.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "proof_ref": "Coefficient enclosure", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "0.04177593184059834334 < c₃,₂₄ < 0.04177593184059834335" + ], + "full_theorem_checker_passed": false, + "id": "D3-02", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Certified enclosure", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "aada1f0c5e004bdbe2f70b44d919b62fd869e7a35c9323a07b12b02a3f419bc6", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Coefficient enclosure", + "record_fingerprint_v14": "8a32a3c4a971ae52943092401764f7453aa78470ec3b0d18a247b8bbe8059aba", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Same SIDE24 normalization and all-direction periodization comparison.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_authenticated": false, + "statement": "Outward interval enclosure for the dimension-three coefficient.", + "theorem_certificate_status": "not_attached", + "title": "SIDE24 coefficient in dimension three", + "topic": "D3" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D3-02", + "external_theorem_imports": [], + "fingerprint": "9ba91d20ee4a4fb12fee3a76508d3055a37019ee75dfcc29bf0dba97409190ab", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D3-02", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D3-C3" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Coefficient enclosure", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D3-02:scope", + "origin": "verbatim_curated_scope", + "text": "Same SIDE24 normalization and all-direction periodization comparison.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D3-03", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "0df178b917fe605efa6559040c1a10987a939829c28a58d6bb0a5905fd4a26e9", + "exact_boundary": { + "record_id": "D3-03", + "kind": "Lemma / coefficient identity", + "statement": "The nonperiodic reference cone integrals used to control the dimension-two and dimension-three SIDE24 coefficients.", + "equations": [ + "D₁ = 4/3\nD₂ = 29/6 − √6\nc_{d,ref} = Γ(7/6)(3/2)^(1/3) D_{d−1} / [2√3·π^(d−1)√π]" + ], + "scope": "Reference contact expression only; not an asserted infinite-volume persistence theorem.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "proof_ref": "Cone moment / reference expression", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "D₁ = 4/3\nD₂ = 29/6 − √6\nc_{d,ref} = Γ(7/6)(3/2)^(1/3) D_{d−1} / [2√3·π^(d−1)√π]" + ], + "full_theorem_checker_passed": false, + "id": "D3-03", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma / coefficient identity", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "dc2fc0bc966cfefeae69cf438c60f5b7db84fd297e4005cff296704dd914045a", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Cone moment / reference expression", + "record_fingerprint_v14": "820b361db0b673772217f540fe669c4eb9c5f6369a0d46be2795c332bfb9b014", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Reference contact expression only; not an asserted infinite-volume persistence theorem.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_authenticated": false, + "statement": "The nonperiodic reference cone integrals used to control the dimension-two and dimension-three SIDE24 coefficients.", + "theorem_certificate_status": "not_attached", + "title": "Reference transverse cone moments", + "topic": "D3" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D3-03", + "external_theorem_imports": [], + "fingerprint": "aa3d45faeec3bf63e10507b2d5584c9a15ff473c2fc49f239f8ffa33b08023cd", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D3-03", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V03" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Cone moment / reference expression", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D3-03:scope", + "origin": "verbatim_curated_scope", + "text": "Reference contact expression only; not an asserted infinite-volume persistence theorem.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D3-04", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "b50f6fae86dfb522aaf27a49c798f4438fe76e1a0856c3862eada5b118a2a0ad", + "exact_boundary": { + "record_id": "D3-04", + "kind": "Certified comparison", + "statement": "The fully periodized coefficient is bounded relative to the stated nonperiodic reference.", + "equations": [ + "|c_{d,24}/c_{d,ref} − 1| < 10^(−106) (d=2,3)" + ], + "scope": "Directional covariance derivatives through order six; SIDE24 fixed law.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "proof_ref": "All-direction comparison", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "|c_{d,24}/c_{d,ref} − 1| < 10^(−106) (d=2,3)" + ], + "full_theorem_checker_passed": false, + "id": "D3-04", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Certified comparison", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "40df3e6eb5adb4ff05bed4fcd577b3a3dd0218510840d12772b331e0268c05d6", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "All-direction comparison", + "record_fingerprint_v14": "9ff981db08e844bd396ecbc9a60ec41c5b74ce12e7ece07c1ae3b04664fadcd7", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Directional covariance derivatives through order six; SIDE24 fixed law.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_authenticated": false, + "statement": "The fully periodized coefficient is bounded relative to the stated nonperiodic reference.", + "theorem_certificate_status": "not_attached", + "title": "Periodization correction", + "topic": "D3" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D3-04", + "external_theorem_imports": [], + "fingerprint": "12929d2fec0099640f7da6cd36b28e0f3dbf55761b90d38156439d7fc03b5fdc", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D3-04", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V22" + ], + "premise_bases": "source_explicit", + "premises": [ + "D3-C5" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "All-direction comparison", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D3-04:scope", + "origin": "verbatim_curated_scope", + "text": "Directional covariance derivatives through order six; SIDE24 fixed law.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D3-C3", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "3b2536f79ae8d4083acd6a569b48d42a70beceb0201c483c23f1bf4321619e26", + "exact_boundary": { + "record_id": "D3-C3", + "kind": "Reviewed coefficient interface C3", + "statement": "The reference coefficient is obtained from the full-sphere directional integral; positive-gap integration yields the stated Gamma(7/6) factor.", + "equations": [ + "c_{d,L} = Γ(7/6)/(24^(1/3)√π) · ∫_{S^(d−1)} p_G(0)p_{V_u}(0) τ_u^(4/3)D_u dσ(u)" + ], + "scope": "SIDE24 normalized periodized covariance, L=24, d∈{2,3}; the coefficient-calculation review only; independent of finite-radius lifetime accuracy. The isotropic reference simplification is separate from the periodized directional comparison.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "proof_ref": "Reviewer C3; parent Eq. (15.2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "c_{d,L} = Γ(7/6)/(24^(1/3)√π) · ∫_{S^(d−1)} p_G(0)p_{V_u}(0) τ_u^(4/3)D_u dσ(u)" + ], + "full_theorem_checker_passed": false, + "id": "D3-C3", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed coefficient interface C3", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "d39f258814e1725d14177560d1373e55896cc6f350ffbc008cc613d916a0b6c6", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Reviewer C3; parent Eq. (15.2)", + "record_fingerprint_v14": "99f89778c0d81f66dc40f9067ac8b5a33322c8ec8b8438a2b22dd96aeaa7a103", + "review": "https://github.com/d6g8k5htny-coder/main/issues/65", + "scope": "SIDE24 normalized periodized covariance, L=24, d∈{2,3}; the coefficient-calculation review only; independent of finite-radius lifetime accuracy. The isotropic reference simplification is separate from the periodized directional comparison.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_authenticated": false, + "statement": "The reference coefficient is obtained from the full-sphere directional integral; positive-gap integration yields the stated Gamma(7/6) factor.", + "theorem_certificate_status": "not_attached", + "title": "Angular reduction and gamma contact integral", + "topic": "D3" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D3-C3", + "external_theorem_imports": [], + "fingerprint": "e807b30e9a76077fe3cf0f23f3696bb766f1f7a87c65d7ced01f81ab9fbef8ea", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D3-C3", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D3-03" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Reviewer C3; parent Eq. (15.2)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/65", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D3-C3:scope", + "origin": "verbatim_curated_scope", + "text": "SIDE24 normalized periodized covariance, L=24, d∈{2,3}; the coefficient-calculation review only; independent of finite-radius lifetime accuracy. The isotropic reference simplification is separate from the periodized directional comparison.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D3-C4", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "8ec0cc0ab5d068baba070034b32af1876f23908764969647103a15b7a5aebe66", + "exact_boundary": { + "record_id": "D3-C4", + "kind": "Reviewed coefficient interface C4", + "statement": "Uniform Hermite-product bounds and the nonzero lattice-image sum control the difference between SIDE24 derivative covariances and the nonperiodic reference through differential order six.", + "equations": [ + "E=1458(76·24⁶+15)·10^(−125); 60E<10^(−108)" + ], + "scope": "SIDE24 normalized periodized covariance, L=24, d∈{2,3}; the coefficient-calculation review only; independent of finite-radius lifetime accuracy. Original review bounds all multi-indices of order ≤6 and both d=2,3; no other torus sizes.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "proof_ref": "Reviewer C4; periodization inequality", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "E=1458(76·24⁶+15)·10^(−125); 60E<10^(−108)" + ], + "full_theorem_checker_passed": false, + "id": "D3-C4", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed coefficient interface C4", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "c6221c453794202aaa161e70a6880a2f9cfad3b6039c09d6e9ae932f800dc6a9", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Reviewer C4; periodization inequality", + "record_fingerprint_v14": "71e28904fe9f0acd2bf19535e3e9bb729846d03dd1086d2bcb6e77f19cefead6", + "review": "https://github.com/d6g8k5htny-coder/main/issues/65", + "scope": "SIDE24 normalized periodized covariance, L=24, d∈{2,3}; the coefficient-calculation review only; independent of finite-radius lifetime accuracy. Original review bounds all multi-indices of order ≤6 and both d=2,3; no other torus sizes.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_authenticated": false, + "statement": "Uniform Hermite-product bounds and the nonzero lattice-image sum control the difference between SIDE24 derivative covariances and the nonperiodic reference through differential order six.", + "theorem_certificate_status": "not_attached", + "title": "Sixth-order derivative lattice-image control", + "topic": "D3" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D3-C4", + "external_theorem_imports": [], + "fingerprint": "3195a42bb5419ef40d2061c35b35403ab1a88a4c76fc008b5084e594384e2076", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D3-C4", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V20" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Reviewer C4; periodization inequality", + "review": "https://github.com/d6g8k5htny-coder/main/issues/65", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D3-C4:scope", + "origin": "verbatim_curated_scope", + "text": "SIDE24 normalized periodized covariance, L=24, d∈{2,3}; the coefficient-calculation review only; independent of finite-radius lifetime accuracy. Original review bounds all multi-indices of order ≤6 and both d=2,3; no other torus sizes.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D3-C5", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "e06ac90a613291b00b4cac09839e29ee75a070a1f0dde8a4377489ae3a79c7e9", + "exact_boundary": { + "record_id": "D3-C5", + "kind": "Reviewed coefficient interface C5", + "statement": "The small entrywise periodization error yields a multiplicative Gaussian covariance sandwich, which transfers to the conditional transverse blocks and coefficient integrand.", + "equations": [ + "(1−ε)C_ref ⪯ C_24 ⪯ (1+ε)C_ref, ε=10^(−108); C_ref ⪰ I/3" + ], + "scope": "SIDE24 normalized periodized covariance, L=24, d∈{2,3}; the coefficient-calculation review only; independent of finite-radius lifetime accuracy. Fixed finite jet covariance, conditional Schur complements; the all-frame comparison is retained.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "proof_ref": "Reviewer C5; Schur sandwich", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "(1−ε)C_ref ⪯ C_24 ⪯ (1+ε)C_ref, ε=10^(−108); C_ref ⪰ I/3" + ], + "full_theorem_checker_passed": false, + "id": "D3-C5", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed coefficient interface C5", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "75838dfa8e67037d6235627e2bf05e72e9b35639051b3b044843c47090b0b5f5", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Reviewer C5; Schur sandwich", + "record_fingerprint_v14": "8e68ce76f7fa7def1108c76621c95bb86789586f4b71f33e5cec950730087165", + "review": "https://github.com/d6g8k5htny-coder/main/issues/65", + "scope": "SIDE24 normalized periodized covariance, L=24, d∈{2,3}; the coefficient-calculation review only; independent of finite-radius lifetime accuracy. Fixed finite jet covariance, conditional Schur complements; the all-frame comparison is retained.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_authenticated": false, + "statement": "The small entrywise periodization error yields a multiplicative Gaussian covariance sandwich, which transfers to the conditional transverse blocks and coefficient integrand.", + "theorem_certificate_status": "not_attached", + "title": "Covariance and Schur-complement comparison", + "topic": "D3" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D3-C5", + "external_theorem_imports": [], + "fingerprint": "c890178dfb3f16a9699a00e28f3ca9c47feaf47710451b9ffd06ebe822aaebf9", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D3-C5", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V21" + ], + "premise_bases": "source_explicit", + "premises": [ + "D3-C4" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Reviewer C5; Schur sandwich", + "review": "https://github.com/d6g8k5htny-coder/main/issues/65", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e329fba1e927a12dbb4f0d1556f85f39284d17a9/coefficients/side24_v1/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D3-C5:scope", + "origin": "verbatim_curated_scope", + "text": "SIDE24 normalized periodized covariance, L=24, d∈{2,3}; the coefficient-calculation review only; independent of finite-radius lifetime accuracy. Fixed finite jet covariance, conditional Schur complements; the all-frame comparison is retained.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-01", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "6890f31c9237ad07654083bf913bbc0a564162fba4e88e297a5b5d769ec97df9", + "exact_boundary": { + "record_id": "D4-01", + "kind": "Corollary", + "statement": "The expected number of index-j window critical points and probability of at least one such point are both cubic in pin separation.", + "equations": [ + "𝔼_{Qʷ}N_{r,j}(E) ≤ C k r³ |E|\nℙ_{Qʷ}{N_{r,j}(E)≥1} ≤ C k r³ |E|" + ], + "scope": "Same fixed remote separation and shrinking between-pin height window as D4-A.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "Eq. (3)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "𝔼_{Qʷ}N_{r,j}(E) ≤ C k r³ |E|\nℙ_{Qʷ}{N_{r,j}(E)≥1} ≤ C k r³ |E|" + ], + "full_theorem_checker_passed": false, + "id": "D4-01", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Corollary", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "b9c1eba314272dfb71d9f79a1a19126f87ff7b856b10a639b563ab03031a37c5", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Eq. (3)", + "record_fingerprint_v14": "17ad2bc33638a4d0d0b4d780d07c64fdd6535ece7954b7b01e02f91a6ac2a014", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Same fixed remote separation and shrinking between-pin height window as D4-A.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The expected number of index-j window critical points and probability of at least one such point are both cubic in pin separation.", + "theorem_certificate_status": "not_attached", + "title": "Remote count and occurrence upper bounds", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-01", + "external_theorem_imports": [], + "fingerprint": "3340f3a2851023d60486343bbd46b427d2b48d4a2ee04582c12389734321b816", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-01", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V09" + ], + "premise_bases": "source_explicit", + "premises": [ + "D4-A" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Eq. (3)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-01:scope", + "origin": "verbatim_curated_scope", + "text": "Same fixed remote separation and shrinking between-pin height window as D4-A.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-A", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "5e6943d3cc81a567cbe5a21e1e6c977f594e6d169b7a5a54dff7d179711a1311", + "exact_boundary": { + "record_id": "D4-A", + "kind": "Theorem A", + "statement": "The scaled mean count of critical points in a fixed-separated spatial region converges to a positive contact-intensity integral with a uniform measure error.", + "equations": [ + "| 𝔼_{Qʷ}N_{r,j}(E)/(k r³) − ∫_E Λ_j(x;b,k,u)dx | ≤ C r |E|" + ], + "scope": "Fixed d,L; 0<ρ=2, L, compact birth/gap marks with k_->0, fixed rho>0 and eta0<=rho/2, Borel E contained outside fixed pin disk, window I_r=(b−kr³,b), original determinant tilt and full normalizer. No torus-wide collision or elder-pairing conclusion. Scoped review accepts near O(r^5) and separated O(r^6), not full source indiscriminately.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remote_collision_20260928/PROOF.md", + "proof_ref": "Theorem C and Corollary D", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\mathbb E_{Q_r^W}T_{\\rm near}(E)\\le Cr^5|E|", + "\\mathbb E_{Q_r^W}[N(E)(N(E)-1)]\\le Cr^5|E|" + ], + "full_theorem_checker_passed": false, + "id": "D4-COLLISION", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "6ce9573c1c5d553d405c524b441f06365ede943f482aed0f3bfd3d8414f237c4", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem C and Corollary D", + "record_fingerprint_v14": "74920a9b708cc169a104d5c85b64ea5676a038ed752bb0f1894060fd3c564ddb", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d5_remote_collision_grok_20260928/REVIEW.md", + "scope": "Fixed d>=2, L, compact birth/gap marks with k_->0, fixed rho>0 and eta0<=rho/2, Borel E contained outside fixed pin disk, window I_r=(b−kr³,b), original determinant tilt and full normalizer. No torus-wide collision or elder-pairing conclusion. Scoped review accepts near O(r^5) and separated O(r^6), not full source indiscriminately.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remote_collision_20260928/PROOF.md", + "source_authenticated": false, + "statement": "Ordered pairs of extra critical points in the fixed remote region and between-pin height window, at arbitrarily close mutual separation, have an O(r^5) weighted first pair count; hence the second factorial moment is O(r^5).", + "theorem_certificate_status": "not_attached", + "title": "Fixed-remote near-collision factorial bound", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-COLLISION", + "external_theorem_imports": [], + "fingerprint": "a9d1a6135f960598c2bb1450d73b1b8dc6bf7ba2c3c77d47941ad90cd36c52b2", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-COLLISION", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-A" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem C and Corollary D", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/d5_remote_collision_grok_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/remote_collision_20260928/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-COLLISION:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d>=2, L, compact birth/gap marks with k_->0, fixed rho>0 and eta0<=rho/2, Borel E contained outside fixed pin disk, window I_r=(b−kr³,b), original determinant tilt and full normalizer. No torus-wide collision or elder-pairing conclusion. Scoped review accepts near O(r^5) and separated O(r^6), not full source indiscriminately.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-DET", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "3dd3465275b0daf765e16db83b306d69508dffbbed1c77aa2b8dce4e18c2d5c3", + "exact_boundary": { + "record_id": "D4-DET", + "kind": "Lemma / reviewer interface 2", + "statement": "The two endpoint Hessian determinant weights vanish quadratically, with a one-order relative remainder even under the extra remote conditioning; inertia filtering is retained.", + "equations": [ + "W_r/r² = (6k)²(det A_0)² 1{A_0≺0} + O_{L^p}(r)" + ], + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Every fixed finite p; full typed endpoint factors, not scalar determinants alone.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "§4 Eqs. (8)–(10)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "W_r/r² = (6k)²(det A_0)² 1{A_0≺0} + O_{L^p}(r)" + ], + "full_theorem_checker_passed": false, + "id": "D4-DET", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma / reviewer interface 2", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "969aae2762c234d208f835459e6526f5949faece927ae4ca6a24244ce6614d2e", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§4 Eqs. (8)–(10)", + "record_fingerprint_v14": "ca2db03ba29573963ee4251169ad532951c629e9a52a1189c140e6084697484c", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Every fixed finite p; full typed endpoint factors, not scalar determinants alone.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The two endpoint Hessian determinant weights vanish quadratically, with a one-order relative remainder even under the extra remote conditioning; inertia filtering is retained.", + "theorem_certificate_status": "not_attached", + "title": "Typed endpoint determinant contact limit", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-DET", + "external_theorem_imports": [], + "fingerprint": "b7c95becbc540ee57747516d8639f64633f31309556711cfc413745c74266d55", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-DET", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V16" + ], + "premise_bases": "source_explicit", + "premises": [ + "D4-REG" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§4 Eqs. (8)–(10)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-DET:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Every fixed finite p; full typed endpoint factors, not scalar determinants alone.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-JET", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "eeaf50af41bd430a7991dfb862074115333ffc191a49ab70684ad43459affa07", + "exact_boundary": { + "record_id": "D4-JET", + "kind": "Lemma / reviewer interface 1", + "statement": "After conditioning on the original pair of pins, adding a spatially remote gradient and height, transverse midpoint Hessian and witness Hessian retains a uniformly nonsingular finite Gaussian covariance.", + "equations": [ + "λ_min Cov(U_r,Y_x,A_0,H_x) ≥ c_ρ > 0" + ], + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Distinct nonduplicate derivative coordinates; full Fourier spectrum, r small.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "§2 and review interface 1", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "λ_min Cov(U_r,Y_x,A_0,H_x) ≥ c_ρ > 0" + ], + "full_theorem_checker_passed": false, + "id": "D4-JET", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma / reviewer interface 1", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "f064e72f14cc2627dff4ec6763bdc487e854ee705a37657e4b3520eec38e4906", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§2 and review interface 1", + "record_fingerprint_v14": "70d3961844e2ea8c9bc95c085beb67f9e3ce69a70139c2d4cfb2374bdabd2e92", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Distinct nonduplicate derivative coordinates; full Fourier spectrum, r small.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "After conditioning on the original pair of pins, adding a spatially remote gradient and height, transverse midpoint Hessian and witness Hessian retains a uniformly nonsingular finite Gaussian covariance.", + "theorem_certificate_status": "not_attached", + "title": "Fixed-remote finite-jet covariance floor", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-JET", + "external_theorem_imports": [], + "fingerprint": "f74c351db4dee9bd060b66fc0182a261816d8422735bef05a5f15723aa601e1b", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-JET", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D1-02", + "D1-03" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§2 and review interface 1", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-JET:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Distinct nonduplicate derivative coordinates; full Fourier spectrum, r small.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-KERNEL", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "b1a88f17532f3df8ebc2f91456dae636ee51f6b20d02864325127c5a5659a3b6", + "exact_boundary": { + "record_id": "D4-KERNEL", + "kind": "Proposition / reviewer interface 4", + "statement": "The remote contact intensity retains the joint conditional Hessian dependence and is continuous and uniformly positive and finite on compact parameter sets.", + "equations": [ + "Λ_j(x;b,k,u) = p_{Y_x|U_0}(0,b) E[w_0F_j(H_x)|U_0,Y_x=(0,b)] / z_0; 00; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Only remote sites; no independence assumption between midpoint and witness Hessians.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "§5 Eq. (13)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "Λ_j(x;b,k,u) = p_{Y_x|U_0}(0,b) E[w_0F_j(H_x)|U_0,Y_x=(0,b)] / z_0; 00; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Only remote sites; no independence assumption between midpoint and witness Hessians.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The remote contact intensity retains the joint conditional Hessian dependence and is continuous and uniformly positive and finite on compact parameter sets.", + "theorem_certificate_status": "not_attached", + "title": "Positive fixed-remote contact intensity", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-KERNEL", + "external_theorem_imports": [], + "fingerprint": "4a0d563150468abb8af0c82719762d38c200ff5a181edb623d0d2232b4d93b1e", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-KERNEL", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-KR" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5 Eq. (13)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-KERNEL:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Only remote sites; no independence assumption between midpoint and witness Hessians.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-KR", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "9daeca41533b71a2314500568793c0f02b7a0152de6034517f548c87e6b4aee4", + "exact_boundary": { + "record_id": "D4-KR", + "kind": "Proposition / reviewer interface 2", + "statement": "The finite-r remote count equals the height-disintegrated Kac–Rice integral with the two endpoint determinant factors and one witness determinant, each included exactly once.", + "equations": [ + "E_{Q_r^W}N_{r,j}(E) = (r²/Z_r) ∫_E ∫_{b−kr³}^{b} p_{Y_x|U_r}(0,t) E[(W_r/r²)F_j(H_x)|U_r,Y_x=(0,t)]dt dx" + ], + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. E any Borel subset of D_ρ; j any negative-Hessian index. No extra pin Jacobian.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "§5 Eq. (12)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "E_{Q_r^W}N_{r,j}(E) = (r²/Z_r) ∫_E ∫_{b−kr³}^{b} p_{Y_x|U_r}(0,t) E[(W_r/r²)F_j(H_x)|U_r,Y_x=(0,t)]dt dx" + ], + "full_theorem_checker_passed": false, + "id": "D4-KR", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Proposition / reviewer interface 2", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "29fb8050b73177234a300dd6628d722f12d50667abef0d340989c5c2d26e7e77", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§5 Eq. (12)", + "record_fingerprint_v14": "42b78deaa0eb21dfede080a31b53e04adae1be89f13b2990a7e9b6c9beff2c30", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. E any Borel subset of D_ρ; j any negative-Hessian index. No extra pin Jacobian.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The finite-r remote count equals the height-disintegrated Kac–Rice integral with the two endpoint determinant factors and one witness determinant, each included exactly once.", + "theorem_certificate_status": "not_attached", + "title": "Three-determinant weighted Kac–Rice identity", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-KR", + "external_theorem_imports": [ + "EXT-KR-AAL" + ], + "fingerprint": "a42bd5a8500d50da781a61d1044b97972423dff33fc9e3ec12da1848a55b548d", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-KR", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V18" + ], + "premise_bases": "source_explicit", + "premises": [ + "D4-DET", + "D4-REG", + "D4-Z" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5 Eq. (12)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-KR:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. E any Borel subset of D_ρ; j any negative-Hessian index. No extra pin Jacobian.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-NUM", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "8bb71b2d174f64f6293c4cff546ff7e42c0f68f1802ed9f099de48fdf2632528", + "exact_boundary": { + "record_id": "D4-NUM", + "kind": "Proposition / reviewer interface 2", + "statement": "The unnormalized weighted Kac–Rice numerator carries two endpoint determinant factors and the shrinking height-window factor; the numerator is fifth order in r.", + "equations": [ + "∫_E∫_{b−kr³}^{b} p_{Y_x|U_r}(0,t)E[W_rF_j(H_x)|U_r,Y_x=(0,t)]dt dx ≤ C k r⁵|E|" + ], + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. E Borel in fixed D_ρ; no estimate when ρ→0.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "§5 Eq. (14)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "∫_E∫_{b−kr³}^{b} p_{Y_x|U_r}(0,t)E[W_rF_j(H_x)|U_r,Y_x=(0,t)]dt dx ≤ C k r⁵|E|" + ], + "full_theorem_checker_passed": false, + "id": "D4-NUM", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Proposition / reviewer interface 2", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "03d860d1fb1f3076c5e5bb5f2f9e775cae9ac1152151c9490947f9bc05185dfa", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§5 Eq. (14)", + "record_fingerprint_v14": "d243fdc0b4931716cad571c255f48756fca8f98afe136fdd416e53bfe5eda06d", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. E Borel in fixed D_ρ; no estimate when ρ→0.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The unnormalized weighted Kac–Rice numerator carries two endpoint determinant factors and the shrinking height-window factor; the numerator is fifth order in r.", + "theorem_certificate_status": "not_attached", + "title": "Remote triple-determinant numerator estimate", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-NUM", + "external_theorem_imports": [], + "fingerprint": "65faa7782ff91d15a1bbca4c9708ceb619f6223698a8a0807e0c8009276a4f3f", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-NUM", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V19" + ], + "premise_bases": "source_explicit", + "premises": [ + "D4-KR" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5 Eq. (14)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-NUM:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. E Borel in fixed D_ρ; no estimate when ρ→0.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-REG", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "cebad2d99606020c26073afd5d52944544aa5e23bb4d106b34e0c025cada97a6", + "exact_boundary": { + "record_id": "D4-REG", + "kind": "Lemma / reviewer interface 1", + "statement": "A common regression construction couples finite-r and contact-law conditional fields with second-order error, including the additional remote value and gradient observations.", + "equations": [ + "||F_{r,x,t}−F_{0,x,b}||_{L^p(C^q)} ≤ C_{p,q} r²; |p_r(0,t)−p_0(0,b)| ≤ C r²" + ], + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Fixed finite derivative order q and moment p, t∈(b−kr³,b).", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "§3 Eq. (5)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "||F_{r,x,t}−F_{0,x,b}||_{L^p(C^q)} ≤ C_{p,q} r²; |p_r(0,t)−p_0(0,b)| ≤ C r²" + ], + "full_theorem_checker_passed": false, + "id": "D4-REG", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma / reviewer interface 1", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "59de3164693f0beeec8ed3c9fd482b8b0c6bf52d0a26e882d34768e628e55000", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§3 Eq. (5)", + "record_fingerprint_v14": "025fd89c7262e56e30741f905dc29e3c4f3711b186d106e20daa82395a934a6c", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Fixed finite derivative order q and moment p, t∈(b−kr³,b).", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "A common regression construction couples finite-r and contact-law conditional fields with second-order error, including the additional remote value and gradient observations.", + "theorem_certificate_status": "not_attached", + "title": "Conditioned contact coupling and density transfer", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-REG", + "external_theorem_imports": [ + "EXT-GAUSS-MOMENTS" + ], + "fingerprint": "d1e165c5c83610e317c496716dbd399d78e1000cf5b7822838299609d848cb3a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-REG", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-JET" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3 Eq. (5)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-REG:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Fixed finite derivative order q and moment p, t∈(b−kr³,b).", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-REMOTE-PAIR", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "3c421229b4cee2269b6b9aacf22826f966db74da811841825e03563dadb397fb", + "exact_boundary": { + "record_id": "D4-REMOTE-PAIR", + "kind": "Factorial bound", + "statement": "The fixed-separation count bound extends to m pairwise-separated remote critical points within the between-pin height window.", + "equations": [ + "\\mathbb P\\{\\exists\\ m\\ \\eta\\text{-separated qualifying witnesses}\\}=O(r^{3m})" + ], + "scope": "Fixed remote cutoff rho>0 and pairwise witness separation eta>0; every fixed integer m; only points in the shrinking between-pin height window, not collisions at vanishing separation.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "§6 (15)–(16)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\mathbb P\\{\\exists\\ m\\ \\eta\\text{-separated qualifying witnesses}\\}=O(r^{3m})" + ], + "full_theorem_checker_passed": false, + "id": "D4-REMOTE-PAIR", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Factorial bound", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "8088a41481604270bd606b9bc8952961a56c0772797e1043f434a61cf553836a", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§6 (15)–(16)", + "record_fingerprint_v14": "35e979967cb0fa6820d3994e873c0e154cc053dab397051585c79bb22c08708b", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Fixed remote cutoff rho>0 and pairwise witness separation eta>0; every fixed integer m; only points in the shrinking between-pin height window, not collisions at vanishing separation.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The fixed-separation count bound extends to m pairwise-separated remote critical points within the between-pin height window.", + "theorem_certificate_status": "not_attached", + "title": "Separated remote witness tuples", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-REMOTE-PAIR", + "external_theorem_imports": [], + "fingerprint": "74689b0bd9365b7e6324f3fc8e89046e4f4dc255d1bbfac4d98445976924d1f4", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-REMOTE-PAIR", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-TUPLE" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§6 (15)–(16)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-REMOTE-PAIR:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed remote cutoff rho>0 and pairwise witness separation eta>0; every fixed integer m; only points in the shrinking between-pin height window, not collisions at vanishing separation.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-SELECT", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "30b94a3a04d8df072553f775ddc76e5ef54b25c29339ce33774b3913bfa2c885", + "exact_boundary": { + "record_id": "D4-SELECT", + "kind": "Corollary / reviewer interface 6", + "statement": "A Boolean witness indicator is controlled by the reviewed expected count only when its type, location and height conditions imply the fixed-remote count definition.", + "equations": [ + "1{qualifying selector} ≤ N_{r,j}(E) ⇒ P(selector)=O(kr³|E|)" + ], + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Selector must require the same index j, fixed D_ρ location and between-pin height; NOT a universal RN selector.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "§7 fixed-remote selector crosswalk", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "1{qualifying selector} ≤ N_{r,j}(E) ⇒ P(selector)=O(kr³|E|)" + ], + "full_theorem_checker_passed": false, + "id": "D4-SELECT", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Corollary / reviewer interface 6", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "8dad2a5816b3be61b78a7f0975f663420f0dfe553caa9db7a76b01836be02a57", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§7 fixed-remote selector crosswalk", + "record_fingerprint_v14": "822da4d860100c2583260c0ef625234b292bb3339356799a22d1dc3fad92ddcf", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Selector must require the same index j, fixed D_ρ location and between-pin height; NOT a universal RN selector.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "A Boolean witness indicator is controlled by the reviewed expected count only when its type, location and height conditions imply the fixed-remote count definition.", + "theorem_certificate_status": "not_attached", + "title": "Dominated selector in fixed-remote height window", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-SELECT", + "external_theorem_imports": [], + "fingerprint": "549611c183328487e2a003f87251513c16ad6bfe5be2ac034dc7963ddbec6c78", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-SELECT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-01" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§7 fixed-remote selector crosswalk", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-SELECT:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Selector must require the same index j, fixed D_ρ location and between-pin height; NOT a universal RN selector.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-TUPLE", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "03c48f06cb8bc16e5cd160ae951c20b785c6d7e272cbccda727152a922a5e85c", + "exact_boundary": { + "record_id": "D4-TUPLE", + "kind": "Proposition / reviewer interface 5", + "statement": "The m-point ordered remote witness count uses a joint, not product, contact kernel and exactly one endpoint weight and normalizer.", + "equations": [ + "E_{Q_r^W}T_{r,j,m,η} = (kr³)^m ∫_{D_{ρ,η,m}} Λ_{j,m}(x_1,…,x_m) dx_1⋯dx_m + O(r^{3m+1})" + ], + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Each fixed integer m≥2 and fixed pairwise separation η>0; no η(r)→0 claim.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "§6 Eq. (15)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "E_{Q_r^W}T_{r,j,m,η} = (kr³)^m ∫_{D_{ρ,η,m}} Λ_{j,m}(x_1,…,x_m) dx_1⋯dx_m + O(r^{3m+1})" + ], + "full_theorem_checker_passed": false, + "id": "D4-TUPLE", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Proposition / reviewer interface 5", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "17a0ba75ca160463bf175248e53494cfa4a125165b299cacbacf935cae852156", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§6 Eq. (15)", + "record_fingerprint_v14": "5e0c26bda04d8fbc5cb898a3d37b90629b25e8af0644e2f4f9b378d7a1587366", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Each fixed integer m≥2 and fixed pairwise separation η>0; no η(r)→0 claim.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The m-point ordered remote witness count uses a joint, not product, contact kernel and exactly one endpoint weight and normalizer.", + "theorem_certificate_status": "not_attached", + "title": "Joint contact asymptotic for separated witness tuples", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-TUPLE", + "external_theorem_imports": [], + "fingerprint": "dbff1ba69c6d069ad23f6fac4cad458ddefcdc4da223f4a6cee93fcdb5cb61d4", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-TUPLE", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-JET", + "D4-KR", + "D4-Z" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§6 Eq. (15)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-TUPLE:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Each fixed integer m≥2 and fixed pairwise separation η>0; no η(r)→0 claim.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D4-Z", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "2fea8850b35add554507938952939cbe6d9b1b7d000835cc7a35c9c183f987e0", + "exact_boundary": { + "record_id": "D4-Z", + "kind": "Lemma / reviewer interface 3", + "statement": "The normalizer is calculated only under the original endpoint law and remains strictly positive after extracting r²; it must not be replaced by a witness-conditioned denominator.", + "equations": [ + "Z_r/r² = z_0 + O(r), inf z_0>0; Z_r=E_{Q_r}W_r" + ], + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. z0 uses endpoint-only contact conditioning; no geometric restriction in Z_r.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "proof_ref": "§4 Eq. (11)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "Z_r/r² = z_0 + O(r), inf z_0>0; Z_r=E_{Q_r}W_r" + ], + "full_theorem_checker_passed": false, + "id": "D4-Z", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma / reviewer interface 3", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "8946fd638f91b17a4e1a1dc88313d760c7181dfa29040bfb8e9231234e1b245a", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§4 Eq. (11)", + "record_fingerprint_v14": "9667da2c1ec12a4f2356a58c156c5a403f30169258527d59ec3b46a63340e0b1", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "scope": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. z0 uses endpoint-only contact conditioning; no geometric restriction in Z_r.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The normalizer is calculated only under the original endpoint law and remains strictly positive after extracting r²; it must not be replaced by a witness-conditioned denominator.", + "theorem_certificate_status": "not_attached", + "title": "Original full endpoint normalizer asymptotic", + "topic": "D4" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-Z", + "external_theorem_imports": [], + "fingerprint": "0fcb4f496205f6f21416a020955aa11554ffe265022be290899468f6e458b80d", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-Z", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V17" + ], + "premise_bases": "source_explicit", + "premises": [ + "D4-DET" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§4 Eq. (11)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-Z:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. z0 uses endpoint-only contact conditioning; no geometric restriction in Z_r.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5-ANN-R1", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "e7fd7b51a10a3588bacf100909b93af95cc53c7a8519a6dc6b7ff67da54ba523", + "exact_boundary": { + "record_id": "D5-ANN-R1", + "kind": "Accepted interface R1", + "statement": "The six-endpoint Hermite/affine interpolation retains exact finite-r pin targets and yields aspect-uniform remainder estimates for the scaled witness gradient.", + "equations": [ + "U_r=(s_0-a^2d_1/2,(3d_0-s_1)/2,d_1,3(s_1-d_0)/a^2,L_r(0),L_r'(0))", + "g'(ru)-H_r'(ru)=r^3 A_u f_{xxxx}(0)+O_{L^p}(r^4),\\quad A_u=u(u^2-1/4)/6" + ], + "scope": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 00" + ], + "scope": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 01. The bound relies on all minors, not just the axial minor.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "proof_ref": "R2; proof §4, (12)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "M=\\begin{pmatrix}A_u\\alpha&u\\beta&0\\\\0&B_u\\alpha&\\beta\\end{pmatrix}", + "\\det(MM^T)=A_u^2B_u^2\\alpha^4+A_u^2\\alpha^2\\beta^2+u^2\\beta^4\\ge c_{A,B}>0" + ], + "full_theorem_checker_passed": false, + "id": "D5-ANN-R2", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Accepted interface R2", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "f1d8d190a22152517d08ccb3e90ad44f1ab1db280a5a5089b4678e2e974da406", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "R2; proof §4, (12)", + "record_fingerprint_v14": "07ad15f2ab9446e7b04c3b776e9beee8dc07a9984ee4da4f2352ac339d295f8f", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md", + "scope": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 01. The bound relies on all minors, not just the axial minor.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "source_authenticated": false, + "statement": "The three distinct 2×2 minors force a strictly positive aspect-uniform covariance floor after Gaussian pin conditioning.", + "theorem_certificate_status": "not_attached", + "title": "Aspect-uniform two-row rank bound", + "topic": "D5 annulus" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-ANN-R2", + "external_theorem_imports": [], + "fingerprint": "24e7ecf9244efdfe90766acab01fc31fcb4ad165f05b90daefe020c78b2f393f", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-ANN-R2", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D5-ANN-R1" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "R2; proof §4, (12)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-ANN-R2:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 01. The bound relies on all minors, not just the axial minor.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5-ANN-R3", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "b7074f5559d7ccdc4e64a9c692a83f1f1e5376ea6c643272c93efa12e7ffb6fc", + "exact_boundary": { + "record_id": "D5-ANN-R3", + "kind": "Accepted interface R3", + "statement": "After conditioning on the rare witness gradient, the full-field C³ sixth moment is controlled; no false independence between Hessian factors is assumed.", + "equations": [ + "\\mathbb E[\\|f\\|_{C^3}^6\\mid \\nabla f(X)=0,\\text{pins}]\\le C\\delta^{-6}", + "\\mathbb E[\\|f\\|_{C^3}^6\\mid Y=\\tau]\\le C\\delta^{-6}" + ], + "scope": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 00 is essential to the uniform floor.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "proof_ref": "R5; proof §3, (5)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "Z_r=\\mathbb E_{Q_r}[F_2(H_M)F_1(H_S)]\\ge c_Z r^2", + "\\det H_M/r\\to-6k f_{zz}(0),\\qquad \\det H_S/r\\to6k f_{zz}(0)" + ], + "full_theorem_checker_passed": false, + "id": "D5-ANN-R5", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Accepted interface R5", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "51c38ac72cad7ced0e6d2d6e8c20f1f8210dd59d8b5a5cc468d1fb9011902947", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "R5; proof §3, (5)", + "record_fingerprint_v14": "d4a38b5b4314ca123b6633fba0f89d99181e3fc8de3e02f7f37e789518bda19f", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md", + "scope": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 00 is essential to the uniform floor.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "source_authenticated": false, + "statement": "For the original Hessian determinant/index tilt under Q_r, the normalizer has the correctly scaled nonzero lower bound.", + "theorem_certificate_status": "not_attached", + "title": "Original endpoint-only Gaussian normalizer", + "topic": "D5 annulus" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-ANN-R5", + "external_theorem_imports": [], + "fingerprint": "e6c8c168a2625af4420c13a09ed49a6317d8552fc0d10abcbccd7c8f455dbdca", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-ANN-R5", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D5-ANN-R1" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "R5; proof §3, (5)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-ANN-R5:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 00 is essential to the uniform floor.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5-ANN-R6", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "d1fe97f1cfaee22895597f05b6bf53056b1db63ac81b9098ca9109f64b6d47c9", + "exact_boundary": { + "record_id": "D5-ANN-R6", + "kind": "Accepted interface R6", + "statement": "Kac–Rice for the conditioned Gaussian Q_r gives a critical-point intensity with endpoint weight and one witness determinant; Q_r^W is not treated as a Gaussian field.", + "equations": [ + "\\mathbb E_{Q_r^W}N_j(rE)=Z_r^{-1}\\int_{rE}p_{\\nabla f(x)|Q_r}(0)\\,\\mathbb E_{Q_r}[W_r F_j(H_x)\\mid \\nabla f(x)=0]dx" + ], + "scope": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 0=k_->0; original six conditioned pins and determinant tilt; j=0,1,2; all heights. No uniform-in-L, higher-d, pin, mesoscopic, growing-annulus, collision or numerical claim.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "proof_ref": "§1 Eq. (2) and §8; R1–R7", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\mathbb E_{Q_r^W} N_j(rE) \\le C r^3 \\operatorname{area}(E),\\qquad E\\subseteq\\{(u,v): A\\le\\sqrt{u^2+v^2}\\le B\\}", + "\\rho_j^W(ru,rv)\\le C r" + ], + "full_theorem_checker_passed": false, + "id": "D5-ANNULUS-ALLHEIGHT", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed theorem interface", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "48c35b6b40a56767a619b3aeb1e5e1e9508bf46ddf16adc32e00fed302bd6dde", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§1 Eq. (2) and §8; R1–R7", + "record_fingerprint_v14": "ab1bf1e21621168c4ddd78491af2f1a4ef9bd22a1cd528167f682d9aa67e7f70", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md", + "scope": "Fixed planar d=2 and L; 1=k_->0; original six conditioned pins and determinant tilt; j=0,1,2; all heights. No uniform-in-L, higher-d, pin, mesoscopic, growing-annulus, collision or numerical claim.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "source_authenticated": false, + "statement": "A project-reviewed upper bound controls the weighted first moment of critical points of each index in any Borel subset of a fixed, scaled planar annulus.", + "theorem_certificate_status": "not_attached", + "title": "All-height fixed-annulus critical-point bound", + "topic": "D5" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-ANNULUS-ALLHEIGHT", + "external_theorem_imports": [], + "fingerprint": "8efd1e87d0ca397379d64faa9835bcbde25f3fd0df0532f9e65e9f2b04d54523", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-ANNULUS-ALLHEIGHT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D5-ANN-R7" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§1 Eq. (2) and §8; R1–R7", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-ANNULUS-ALLHEIGHT:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed planar d=2 and L; 1=k_->0; original six conditioned pins and determinant tilt; j=0,1,2; all heights. No uniform-in-L, higher-d, pin, mesoscopic, growing-annulus, collision or numerical claim.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5-C", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "892cee9178eadab67d6e6e957154cb36e961899d4f23bbb1153dce14113099de", + "exact_boundary": { + "record_id": "D5-C", + "kind": "Reviewed estimate", + "statement": "Other critical points in fixed scaled collars away from both pins are bounded at third order.", + "equations": [ + "𝔼_{Qʷ}N_j(rE) ≤ C r³ |E|" + ], + "scope": "Planar, fixed collar separated from pin sites; full weighted law.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "proof_ref": "D5-c / C1", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "𝔼_{Qʷ}N_j(rE) ≤ C r³ |E|" + ], + "full_theorem_checker_passed": false, + "id": "D5-C", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed estimate", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "1f5bc18d1d0cf04afe0c5a0f0faa78c1c5d1b6011404e18bd2805c377852f031", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "D5-c / C1", + "record_fingerprint_v14": "d0394833542985dd732813c097aebaba4ee8f30354d62774ec2742a09da0413f", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Planar, fixed collar separated from pin sites; full weighted law.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "source_authenticated": false, + "statement": "Other critical points in fixed scaled collars away from both pins are bounded at third order.", + "theorem_certificate_status": "not_attached", + "title": "Collar first moment", + "topic": "D5" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-C", + "external_theorem_imports": [], + "fingerprint": "d7b4891419819eac69001f32321a3099afdb5352d3f895c7a54037a96b5fa192", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-C", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "D5-c / C1", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-C:scope", + "origin": "verbatim_curated_scope", + "text": "Planar, fixed collar separated from pin sites; full weighted law.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5-FIXED-ANNULUS-WINDOW", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "9b5b9edfea0b37040f534126da311c35f6deedd04b8c0672d38e4b117e445d45", + "exact_boundary": { + "record_id": "D5-FIXED-ANNULUS-WINDOW", + "kind": "Reviewed local theorem", + "statement": "For the original pinned Gaussian field in d=2, a separately reviewed candidate bounds critical-point count on one fixed annulus when restricted to the between-pin-height window.", + "equations": [ + "\\mathbb E_{Q_r^W}N_j\\{x\\in rK_{A_0B_0},\\ f(x)\\in[b-kr^3,b]\\}=O(r^3)" + ], + "scope": "Fixed dimension two, fixed torus side, compact marks with positive k_-, fixed annulus 11; |w|<=W, compact b and k>=k0>0, all frames, small r. This is a gradient density only, not a weighted count or a bound on a fixed-width scaled belt.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/axial_density_20260925/PROOF.md", + "proof_ref": "§1 Corollary (1); reviewed PR21 corollary", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "p_{\\nabla f(X)\\mid Q_r}(0)\\le C r^{-5}\\exp(-c k^2/r^2),\\qquad X=R(ru,r^2w)" + ], + "full_theorem_checker_passed": false, + "id": "D5-INNER-DENSITY", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed sublemma", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "180ab537d80eeeb05d4110a8a15e3eb58134c3cc927e455cf1a0572ba2342877", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§1 Corollary (1); reviewed PR21 corollary", + "record_fingerprint_v14": "df2c1f43e7702cf7f04252fd4e405bafb2379f9e7b80c547565c0bd5656e87f5", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/replacement_20260925_pr19_pr21/REVIEW.md", + "scope": "Fixed planar d=2 and L; A<=|u|<=B with A>1; |w|<=W, compact b and k>=k0>0, all frames, small r. This is a gradient density only, not a weighted count or a bound on a fixed-width scaled belt.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/axial_density_20260925/PROOF.md", + "source_authenticated": false, + "statement": "The reviewed corollary controls the two-dimensional gradient density at zero under the original six-pin Gaussian regression law in an r-squared-width axial belt.", + "theorem_certificate_status": "not_attached", + "title": "Inner axial belt conditional-gradient density", + "topic": "D5" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-INNER-DENSITY", + "external_theorem_imports": [], + "fingerprint": "20d03d8cae57a865fce7b246689315a9b0aab81d6390ce525edb4f418a73e2aa", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-INNER-DENSITY", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§1 Corollary (1); reviewed PR21 corollary", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/replacement_20260925_pr19_pr21/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/axial_density_20260925/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-INNER-DENSITY:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed planar d=2 and L; A<=|u|<=B with A>1; |w|<=W, compact b and k>=k0>0, all frames, small r. This is a gradient density only, not a weighted count or a bound on a fixed-width scaled belt.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5-M", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "4db5884a90d212f7b476da53c4404038d71da6064a92c565095c581bc89b39d6", + "exact_boundary": { + "record_id": "D5-M", + "kind": "Reviewed estimate", + "statement": "The smaller physical neighborhood of radius κr² has a stronger fifth-order estimate.", + "equations": [ + "\\mathbb{E}_{Q_r^W}N_j(B(M,\\kappa r^2)\\setminus\\{M\\})=O(r^5)" + ], + "scope": "Fixed κ, planar law; analogous estimate for S; all critical-point heights.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "proof_ref": "D5-b", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\mathbb{E}_{Q_r^W}N_j(B(M,\\kappa r^2)\\setminus\\{M\\})=O(r^5)" + ], + "full_theorem_checker_passed": false, + "id": "D5-M", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed estimate", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "5a242b6f01a52f675b7a3bd6ed22e33510d70a2eaf9778019c4de280079d011e", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "D5-b", + "record_fingerprint_v14": "1b0efd727b7da0371a73f3ffa620fafab890e3ff414ea9f019f9401620ce9c2b", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Fixed κ, planar law; analogous estimate for S; all critical-point heights.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "source_authenticated": false, + "statement": "The smaller physical neighborhood of radius κr² has a stronger fifth-order estimate.", + "theorem_certificate_status": "not_attached", + "title": "Nested pin microdisk first moment", + "topic": "D5" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-M", + "external_theorem_imports": [], + "fingerprint": "6dfcab6f736f0611cb39ff83edc33deadf4c13519d30593351c825f2e1ff2994", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-M", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "D5-b", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-M:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed κ, planar law; analogous estimate for S; all critical-point heights.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5-P", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "7c4e962ae46269b18f86c56bbb4108c747e3b7836542330fced5fc7b89eab73b", + "exact_boundary": { + "record_id": "D5-P", + "kind": "Reviewed estimate", + "statement": "The count of other critical points in each punctured scaled pin ball has cubic first-moment control.", + "equations": [ + "𝔼_{Qʷ}N_j(M+rE) ≤ C r³ (d=2)" + ], + "scope": "Original weighted six-observation pin law; fixed planar torus; compact strictly positive-gap marks; all heights in punctured pin disks.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "proof_ref": "D5-a / P2", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "𝔼_{Qʷ}N_j(M+rE) ≤ C r³ (d=2)" + ], + "full_theorem_checker_passed": false, + "id": "D5-P", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed estimate", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "39798f57e605831b814d7cc8f8fd3c10a1077b3712bbbbef43ca3e79349a07d3", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "D5-a / P2", + "record_fingerprint_v14": "cc85b8c7c996485dbd57c2e1f67b64d3bce22ec52510a34395a22da57cbdc619", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Original weighted six-observation pin law; fixed planar torus; compact strictly positive-gap marks; all heights in punctured pin disks.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "source_authenticated": false, + "statement": "The count of other critical points in each punctured scaled pin ball has cubic first-moment control.", + "theorem_certificate_status": "not_attached", + "title": "Punctured pin-neighborhood first moment", + "topic": "D5" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-P", + "external_theorem_imports": [], + "fingerprint": "9fd79cf6a9ead338bd529032e4adc1ea729d91e6cf132889b99a909b33c53e47", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-P", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "D5-a / P2", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-P:scope", + "origin": "verbatim_curated_scope", + "text": "Original weighted six-observation pin law; fixed planar torus; compact strictly positive-gap marks; all heights in punctured pin disks.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5-TWOSCALE-S6S21", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "42f82a7359a73edd345b35e7bedb56c59830f71472e7442f964c8d3616575381", + "exact_boundary": { + "record_id": "D5-TWOSCALE-S6S21", + "kind": "Reviewed interface packet", + "statement": "The separately accepted inner narrow-strip mechanism uses exact midpoint pins, aspect-uniform three-minor rank, rare-target penalty, third-derivative moments, weighted count, and source-preserved cutoff quantifiers.", + "equations": [ + "\\delta=\\sqrt{r^2+t^2},\\qquad (\\alpha,\\beta)=(r/\\delta,t/\\delta),\\quad \\alpha^2+\\beta^2=1", + "\\nabla f(ru,rt)=\\operatorname{diag}(r^2\\delta,r\\delta)\\{Y+(6k(u^2-1/4)/\\delta,0)\\}" + ], + "scope": "The S6–S21 packet is reviewed only for the stated inner two-scale interfaces and associated S3–S5 bounds, not for a whole fixed annulus, complete regional theorem, or all-height result.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/b2e1652f1374c3b45759324a1ad1fd4177458500/frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md", + "proof_ref": "S6–S21 and S3–S5", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\delta=\\sqrt{r^2+t^2},\\qquad (\\alpha,\\beta)=(r/\\delta,t/\\delta),\\quad \\alpha^2+\\beta^2=1", + "\\nabla f(ru,rt)=\\operatorname{diag}(r^2\\delta,r\\delta)\\{Y+(6k(u^2-1/4)/\\delta,0)\\}" + ], + "full_theorem_checker_passed": false, + "id": "D5-TWOSCALE-S6S21", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Reviewed interface packet", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "f9ba3dae0b47eb65f7e815fa8e1aa6395c8686d3761a423ec2856077fc1bfd48", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "S6–S21 and S3–S5", + "record_fingerprint_v14": "c52713df28e0b95e3d40e20695201fbc98ed796e15324195f530d2b3f26ffeeb", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md", + "scope": "The S6–S21 packet is reviewed only for the stated inner two-scale interfaces and associated S3–S5 bounds, not for a whole fixed annulus, complete regional theorem, or all-height result.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/b2e1652f1374c3b45759324a1ad1fd4177458500/frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md", + "source_authenticated": false, + "statement": "The separately accepted inner narrow-strip mechanism uses exact midpoint pins, aspect-uniform three-minor rank, rare-target penalty, third-derivative moments, weighted count, and source-preserved cutoff quantifiers.", + "theorem_certificate_status": "not_attached", + "title": "Two-scale conditioned-gradient interfaces S6–S21", + "topic": "D5 annulus" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-TWOSCALE-S6S21", + "external_theorem_imports": [], + "fingerprint": "6a8734c9382069a508d8d55d260902409fc1abed93e6987f8fd9bd30a1b13e5b", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-TWOSCALE-S6S21", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "S6–S21 and S3–S5", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/b2e1652f1374c3b45759324a1ad1fd4177458500/frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-TWOSCALE-S6S21:scope", + "origin": "verbatim_curated_scope", + "text": "The S6–S21 packet is reviewed only for the stated inner two-scale interfaces and associated S3–S5 bounds, not for a whole fixed annulus, complete regional theorem, or all-height result.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5d-C", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "7fdde46610aab35f2ae738b634f02a6059eef9c85c4b18d9688692003a6cac6a", + "exact_boundary": { + "record_id": "D5d-C", + "kind": "Theorem C_d", + "statement": "Count bounds extend to arbitrary Borel subsets of a fixed scaled collar.", + "equations": [ + "𝔼_{Qʷ}N_j(rE) ≤ C r³ |E|" + ], + "scope": "Fixed d≥2, fixed radius and collar exclusion, original weighted law; all heights.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "proof_ref": "Theorem C_d, (1.3)–(1.4)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "𝔼_{Qʷ}N_j(rE) ≤ C r³ |E|" + ], + "full_theorem_checker_passed": false, + "id": "D5d-C", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem C_d", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "0f50fd752965ac1f45d8a392610b58f31f406ebdc78ca0b694ef06afa5708b01", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem C_d, (1.3)–(1.4)", + "record_fingerprint_v14": "69c9406d9ad9bb33356d5fbf6705e89a9ac30fa2248dbe438c1f58e1fd5f19b2", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "scope": "Fixed d≥2, fixed radius and collar exclusion, original weighted law; all heights.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_authenticated": false, + "statement": "Count bounds extend to arbitrary Borel subsets of a fixed scaled collar.", + "theorem_certificate_status": "not_attached", + "title": "Fixed scaled collar in every fixed dimension", + "topic": "D5 extension" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-C", + "external_theorem_imports": [], + "fingerprint": "699d112c38962bed9dfdc1e0940cb77e96d73bb132a0a2c14de6a3629d788cb2", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-C", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem C_d, (1.3)–(1.4)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-C:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2, fixed radius and collar exclusion, original weighted law; all heights.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5d-F", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "e46999347f9e4d9e17e168a1546f3005d008eb88dbc05ea9eaf701bf7277a0f8", + "exact_boundary": { + "record_id": "D5d-F", + "kind": "Corollary F_d", + "statement": "There is a matching cubic upper and lower order for occurrence of at least one additional critical point in the window.", + "equations": [ + "c r³ ≤ ℙ_{Qʷ}(A_r) ≤ C r³" + ], + "scope": "Every fixed d≥2; A_r means one or more nonpin critical points in the between-pin height window.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "proof_ref": "Corollary F_d, (1.8)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "c r³ ≤ ℙ_{Qʷ}(A_r) ≤ C r³" + ], + "full_theorem_checker_passed": false, + "id": "D5d-F", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Corollary F_d", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "80b75a7febc1c46eb48728955ba708f252987ca6cc25eb770ebdfbaac4e042f7", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Corollary F_d, (1.8)", + "record_fingerprint_v14": "bf2625736c0a141d7315780cedce7f1237857231b7fb6a3edbf79721144d4bba", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "scope": "Every fixed d≥2; A_r means one or more nonpin critical points in the between-pin height window.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_authenticated": false, + "statement": "There is a matching cubic upper and lower order for occurrence of at least one additional critical point in the window.", + "theorem_certificate_status": "not_attached", + "title": "Global window event probability", + "topic": "D5 extension" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-F", + "external_theorem_imports": [], + "fingerprint": "a338a8a22dfcb1bdaa8ea9fae35b73a2c7a2eba35be40522be552fb8dc86d7b0", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-F", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D5d-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Corollary F_d, (1.8)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-F:scope", + "origin": "verbatim_curated_scope", + "text": "Every fixed d≥2; A_r means one or more nonpin critical points in the between-pin height window.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5d-G", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "6810dba7ee2a0278ca9b125af3a0b4e55b81465c382f9c363a2b4313a5670f9c", + "exact_boundary": { + "record_id": "D5d-G", + "kind": "Theorem G_d", + "statement": "Full torus first moments of nonpin critical points in the narrow between-pin window remain third order.", + "equations": [ + "\\mathbb{E}_{Q_r^W}N_{r,j}(X\\setminus\\{M,S\\})\\le Cr^3" + ], + "scope": "Every fixed d≥2 and L; original pinned and tilted law; window restriction is essential.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "proof_ref": "Theorem G_d, (1.7)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\mathbb{E}_{Q_r^W}N_{r,j}(X\\setminus\\{M,S\\})\\le Cr^3" + ], + "full_theorem_checker_passed": false, + "id": "D5d-G", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem G_d", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "d4e8e86860563399d25fac390fa87cdee81336067bcdabac0db1059bf4ad4a4f", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem G_d, (1.7)", + "record_fingerprint_v14": "775f4678e94e7b683f5e64c1fea4b33f66ef6767e721066450e2d17b53ccee80", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "scope": "Every fixed d≥2 and L; original pinned and tilted law; window restriction is essential.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_authenticated": false, + "statement": "Full torus first moments of nonpin critical points in the narrow between-pin window remain third order.", + "theorem_certificate_status": "not_attached", + "title": "Global window count in every fixed dimension", + "topic": "D5 extension" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-G", + "external_theorem_imports": [], + "fingerprint": "b9c05069d1308ba6ea7c84865635b42818358e13aa45b3c69cd3dc907aafa318", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-G", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem G_d, (1.7)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-G:scope", + "origin": "verbatim_curated_scope", + "text": "Every fixed d≥2 and L; original pinned and tilted law; window restriction is essential.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5d-I", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "d0a55c86e37b04c34cb04fd9ac6cd0f582205db3820db84178fbec0abd687cdb", + "exact_boundary": { + "record_id": "D5d-I", + "kind": "Theorem I_d", + "statement": "The intermediate-shell first-moment estimate is available for the specified narrow height window.", + "equations": [ + "𝔼_{Qʷ}N_{r,j}({s≤|X|≤2s}) ≤ C r³[(r/s)²+s²]" + ], + "scope": "Every fixed d≥2; 00.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "proof_ref": "Lemma D1, (3.1)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "|det H| ≤ ||He||·||He′||·K^(d−2) / ||e∧e′||" + ], + "full_theorem_checker_passed": false, + "id": "D5d-L", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma D1", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "7cc92099a85c4e4942db27e6b2cb85b79d0774aae8047ebb3dba74fc27afddf5", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Lemma D1, (3.1)", + "record_fingerprint_v14": "e3873618a2fee94a1ac5eddce88167978324cdbd1e00373b5bfb4449102252dc", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "scope": "For ||H||op≤K and unit e,e′ with ||e∧e′||>0.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_authenticated": false, + "statement": "A deterministic determinant estimate used by the dimension-lift proof.", + "theorem_certificate_status": "not_attached", + "title": "Two soft directions determinant bound", + "topic": "D5 extension" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-L", + "external_theorem_imports": [], + "fingerprint": "fb1d26f62681119cf5b7632b2c41f91eef54debf59e1ea8558cc2c80f3812594", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-L", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Lemma D1, (3.1)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-L:scope", + "origin": "verbatim_curated_scope", + "text": "For ||H||op≤K and unit e,e′ with ||e∧e′||>0.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5d-M", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "11ab30fc720b703f2d261adca56e16205b83bfa2733f2c517433bec0d45cbafa", + "exact_boundary": { + "record_id": "D5d-M", + "kind": "Corollary M_d", + "statement": "Two-or-more window critical points have probability of cubic order, and the second falling-factorial moment has a cubic lower bound.", + "equations": [ + "c r³ ≤ ℙ_{Qʷ}(N_r≥2) ≤ C r³\n𝔼_{Qʷ}[N_r(N_r−1)] ≥ c r³" + ], + "scope": "Every fixed d≥2; no matching upper bound for the second factorial moment claimed here.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "proof_ref": "Corollary M_d, (1.9)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "c r³ ≤ ℙ_{Qʷ}(N_r≥2) ≤ C r³\n𝔼_{Qʷ}[N_r(N_r−1)] ≥ c r³" + ], + "full_theorem_checker_passed": false, + "id": "D5d-M", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Corollary M_d", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "f2c4dd72353d79c1d12c54c64995e45036094c9cb43b594838291729d710d8ac", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Corollary M_d, (1.9)", + "record_fingerprint_v14": "c225e4a0a442ce7a2d8bd7dd4890bd623f00a2578e8d75bd8d2dd387e62251ec", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "scope": "Every fixed d≥2; no matching upper bound for the second factorial moment claimed here.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_authenticated": false, + "statement": "Two-or-more window critical points have probability of cubic order, and the second falling-factorial moment has a cubic lower bound.", + "theorem_certificate_status": "not_attached", + "title": "Multiplicity and factorial lower bound", + "topic": "D5 extension" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-M", + "external_theorem_imports": [], + "fingerprint": "5cbceb8142b3791f3f861d7b7ae285617e79112b04183aa207df2a7685b64566", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-M", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Corollary M_d, (1.9)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-M:scope", + "origin": "verbatim_curated_scope", + "text": "Every fixed d≥2; no matching upper bound for the second factorial moment claimed here.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:D5d-P", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "d700ec52b2fc8b02a1a3e81892e3055b20ecce97aff27f717c201e61a6073cf1", + "exact_boundary": { + "record_id": "D5d-P", + "kind": "Theorem P_d", + "statement": "The weighted point-count estimate extends to a punctured pin ball with an integrable angular weight.", + "equations": [ + "ω_d(p,q)=max(|q|,r|p|)^(2−d)\n𝔼_{Qʷ}N_j(M+rE) ≤ C r³ ∫_E ω_d(p,q)dpdq ≤ C′r³" + ], + "scope": "Every fixed d≥2 and torus L; compact b,k with k bounded from zero; all heights; E within punctured scaled ball.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "proof_ref": "Theorem P_d, (1.1)–(1.2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "ω_d(p,q)=max(|q|,r|p|)^(2−d)\n𝔼_{Qʷ}N_j(M+rE) ≤ C r³ ∫_E ω_d(p,q)dpdq ≤ C′r³" + ], + "full_theorem_checker_passed": false, + "id": "D5d-P", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem P_d", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "0586ad45bb19084f5d7194aa2382c32f7377095a3dcd6c5d7775b2a6ef2f08db", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem P_d, (1.1)–(1.2)", + "record_fingerprint_v14": "72dbb6deb2ae53ab833915437d8681284ad319bea970c3a6099a1265c960f177", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "scope": "Every fixed d≥2 and torus L; compact b,k with k bounded from zero; all heights; E within punctured scaled ball.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_authenticated": false, + "statement": "The weighted point-count estimate extends to a punctured pin ball with an integrable angular weight.", + "theorem_certificate_status": "not_attached", + "title": "Punctured pin ball in every fixed dimension", + "topic": "D5 extension" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-P", + "external_theorem_imports": [], + "fingerprint": "a58576bc63f43a6f3ac3240ac0bca84ff86ceb3e7897eca4b6675026c8bb2619", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-P", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem P_d, (1.1)–(1.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-P:scope", + "origin": "verbatim_curated_scope", + "text": "Every fixed d≥2 and torus L; compact b,k with k bounded from zero; all heights; E within punctured scaled ball.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:H0-ADAPTER", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "a5d46e528460a860156a5fae76bc6927f1c3a743c65ee8bf680ab5bba0302ee9", + "exact_boundary": { + "record_id": "H0-ADAPTER", + "kind": "Conditional theorem", + "statement": "The project’s fixed-law adapter verifies the five structural interfaces for the infinite periodized Gaussian field at each fixed dimension and torus side, subject to named classical imports.", + "equations": [ + "K_L(z)=\\frac{\\sum_{j\\in\\mathbb Z^d}e^{-|z+Lj|^2/2}}{\\sum_{j\\in\\mathbb Z^d}e^{-|Lj|^2/2}}", + "\\nu_{\\rm bar}(\\ell)\\sim c_{d,L}\\ell^{-1/3}" + ], + "scope": "Fixed d>=2 and L>0; full infinite Gaussian spectrum with random constant mode. Not a finite Fourier cutoff, rescaled/renormalized sample, coefficient digit certificate, quantitative remainder, or model-family universal law. Same-provider scoped technical PASS; scientific status unchanged.", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/periodized_gaussian_h0/PROOF.md", + "proof_ref": "Adapter theorem (2)–(4)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "K_L(z)=\\frac{\\sum_{j\\in\\mathbb Z^d}e^{-|z+Lj|^2/2}}{\\sum_{j\\in\\mathbb Z^d}e^{-|Lj|^2/2}}", + "\\nu_{\\rm bar}(\\ell)\\sim c_{d,L}\\ell^{-1/3}" + ], + "full_theorem_checker_passed": false, + "id": "H0-ADAPTER", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Conditional theorem", + "original_admission_code": "reviewed_conditional", + "original_admission_label": "Conditionally reviewed", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "d3d473cc58bc6ce0dfebe401abef44cf2d788fb0b9de1193cf285632b45bd0dc", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Adapter theorem (2)–(4)", + "record_fingerprint_v14": "18fa137c446ebe0d5a8cb568683a8a7168d79948421fa589ebac37a7a6e607dd", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/periodized_gaussian_h0/REVIEW.md", + "scope": "Fixed d>=2 and L>0; full infinite Gaussian spectrum with random constant mode. Not a finite Fourier cutoff, rescaled/renormalized sample, coefficient digit certificate, quantitative remainder, or model-family universal law. Same-provider scoped technical PASS; scientific status unchanged.", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/periodized_gaussian_h0/PROOF.md", + "source_authenticated": false, + "statement": "The project’s fixed-law adapter verifies the five structural interfaces for the infinite periodized Gaussian field at each fixed dimension and torus side, subject to named classical imports.", + "theorem_certificate_status": "not_attached", + "title": "Exact periodized Gaussian actual-H0 adapter", + "topic": "H0" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "H0-ADAPTER", + "external_theorem_imports": [], + "fingerprint": "b9801ee3d7661759a77966ee7395429a9e42056ae736a9f86889b2f586c50ca8", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:H0-ADAPTER", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "H0-STRUCT" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Adapter theorem (2)–(4)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/periodized_gaussian_h0/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/periodized_gaussian_h0/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:H0-ADAPTER:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d>=2 and L>0; full infinite Gaussian spectrum with random constant mode. Not a finite Fourier cutoff, rescaled/renormalized sample, coefficient digit certificate, quantitative remainder, or model-family universal law. Same-provider scoped technical PASS; scientific status unchanged.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:H0-IID", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "e28d5f3033a0573b548b134cc5258e5b8f7b6da75a57c02d3be97fc5d58bb983", + "exact_boundary": { + "record_id": "H0-IID", + "kind": "Conditional theorem", + "statement": "The reviewed project proof obtains a marked Poisson limit by superposing independent entire copies of the same fixed-torus Gaussian field; the single-copy process vanishes in the small-lifetime limit.", + "equations": [ + "nt_n^{2/3}\\to\\lambda\\in(0,\\infty)", + "\\mathbb E[N_{Tt}\\mathbf1_{\\{N_{Tt}\\ge2\\}}]=o(t^{2/3})", + "\\mathrm{intensity}(da)=\\lambda L^d c_{d,L}a^{-1/3}da" + ], + "scope": "Fixed d>=2, L>0, ordinary finite superlevel H0 bars; independent whole copies, not points within one field or expanding domains; depends on actual-H0 adapter and the proved weighted cluster-avoidance interface. Same-provider scoped mathematical PASS, zero organizational independence and no scientific promotion.", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/iid_short_bar_process/PROOF.md", + "proof_ref": "§§1,4,5,7 and (25)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "nt_n^{2/3}\\to\\lambda\\in(0,\\infty)", + "\\mathbb E[N_{Tt}\\mathbf1_{\\{N_{Tt}\\ge2\\}}]=o(t^{2/3})", + "\\mathrm{intensity}(da)=\\lambda L^d c_{d,L}a^{-1/3}da" + ], + "full_theorem_checker_passed": false, + "id": "H0-IID", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Conditional theorem", + "original_admission_code": "reviewed_conditional", + "original_admission_label": "Conditionally reviewed", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "68cabd147c127a94591f358a004b3cd726a79711a99927f0e776f41b5ce0c3a6", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§§1,4,5,7 and (25)", + "record_fingerprint_v14": "d6660074b71396f1fcb9e35ff3766cfccbc65a4a19299f7cd38e73f623ef6329", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/iid_short_bar_process/REVIEW.md", + "scope": "Fixed d>=2, L>0, ordinary finite superlevel H0 bars; independent whole copies, not points within one field or expanding domains; depends on actual-H0 adapter and the proved weighted cluster-avoidance interface. Same-provider scoped mathematical PASS, zero organizational independence and no scientific promotion.", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/iid_short_bar_process/PROOF.md", + "source_authenticated": false, + "statement": "The reviewed project proof obtains a marked Poisson limit by superposing independent entire copies of the same fixed-torus Gaussian field; the single-copy process vanishes in the small-lifetime limit.", + "theorem_certificate_status": "not_attached", + "title": "Poisson short-bar limit across independent field copies", + "topic": "H0" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "H0-IID", + "external_theorem_imports": [], + "fingerprint": "1f15a2acdd97bdcc3a465dd5298a6daa583a4737bfe03cc79777219d107c4d62", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:H0-IID", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "H0-ADAPTER" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§§1,4,5,7 and (25)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/iid_short_bar_process/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/iid_short_bar_process/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:H0-IID:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d>=2, L>0, ordinary finite superlevel H0 bars; independent whole copies, not points within one field or expanding domains; depends on actual-H0 adapter and the proved weighted cluster-avoidance interface. Same-provider scoped mathematical PASS, zero organizational independence and no scientific promotion.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:H0-STRUCT", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "6939d150902c615f3e6f9029335fdc367bac394db12938302ef483f74b9db871", + "exact_boundary": { + "record_id": "H0-STRUCT", + "kind": "Conditional theorem", + "statement": "The project’s corrected structural theorem obtains the short finite ordinary H0-bar density under its five expressly named interfaces and a positive contact coefficient.", + "equations": [ + "\\nu_{\\rm bar}(\\ell)\\sim C\\ell^{-1/3}", + "\\mathbb E N_{\\rm bar}((0,t])/V_X\\sim\\tfrac32Ct^{2/3}" + ], + "scope": "Compact connected smooth manifold; COUNT, CONTACT, SELECT, ENVELOPE, FAR all hold for actual field, selector and conditional kernels; C finite and positive. Same-provider full technical PASS under named classical imports; scientific-status promotion NONE.", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/fold_structural_universality/PROOF.md", + "proof_ref": "Structural theorem (1)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\nu_{\\rm bar}(\\ell)\\sim C\\ell^{-1/3}", + "\\mathbb E N_{\\rm bar}((0,t])/V_X\\sim\\tfrac32Ct^{2/3}" + ], + "full_theorem_checker_passed": false, + "id": "H0-STRUCT", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Conditional theorem", + "original_admission_code": "reviewed_conditional", + "original_admission_label": "Conditionally reviewed", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "bfdb1b5e9e8e93063e45ed8118e8acccbfb02f7854e0ee72fea50a7455e3503e", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Structural theorem (1)", + "record_fingerprint_v14": "c46cd419b2527c481b446b63b1b3f9a985e5482ed819b792d6f80a69ba6c9743", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/periodized_gaussian_h0/REVIEW.md", + "scope": "Compact connected smooth manifold; COUNT, CONTACT, SELECT, ENVELOPE, FAR all hold for actual field, selector and conditional kernels; C finite and positive. Same-provider full technical PASS under named classical imports; scientific-status promotion NONE.", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/fold_structural_universality/PROOF.md", + "source_authenticated": false, + "statement": "The project’s corrected structural theorem obtains the short finite ordinary H0-bar density under its five expressly named interfaces and a positive contact coefficient.", + "theorem_certificate_status": "not_attached", + "title": "Regular-fold actual H0-bar lifetime law", + "topic": "H0" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "H0-STRUCT", + "external_theorem_imports": [], + "fingerprint": "1c4a0926103b65de1240382ff2f2657be92c79b27275b3b6527f6401f065d51f", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:H0-STRUCT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Structural theorem (1)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/periodized_gaussian_h0/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/fold_structural_universality/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:H0-STRUCT:scope", + "origin": "verbatim_curated_scope", + "text": "Compact connected smooth manifold; COUNT, CONTACT, SELECT, ENVELOPE, FAR all hold for actual field, selector and conditional kernels; C finite and positive. Same-provider full technical PASS under named classical imports; scientific-status promotion NONE.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:NUM-BIN-EXACT", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "a58c2d2ddbc8323dbf3ec8f418a038b48569bb8110806ae604b245e30f0140ae", + "exact_boundary": { + "record_id": "NUM-BIN-EXACT", + "kind": "Conditional lemma", + "statement": "The expectation of the absolute difference between exact vertex-cubical finite-bar counts and continuum counts becomes negligible relative to expected continuum bin mass.", + "equations": [ + "h^2\\sqrt{\\log(1/h)}=o(\\tau_h)", + "\\frac{\\mathbb E|N_h(I_h)-N(I_h)|}{\\mathbb E N(I_h)}\\to0,\\quad I_h=[\\lambda\\tau_h,\\mu\\tau_h)" + ], + "scope": "Unconditioned smooth planar periodized Gaussian field, torus L=24; exact n×n vertex samples h=24/n; 00; assumes M4-M5 continuum density and deterministic approximation interfaces. No realization-wise bound or observed confidence interval. Same-account PASS_TECHNICAL_SCOPED, not scientific-status acceptance.", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/EXACT_SAMPLE_SHRINKING_BIN.md", + "proof_ref": "Exact statement §§Exact statement–Dependencies", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "h^2\\sqrt{\\log(1/h)}=o(\\tau_h)", + "\\frac{\\mathbb E|N_h(I_h)-N(I_h)|}{\\mathbb E N(I_h)}\\to0,\\quad I_h=[\\lambda\\tau_h,\\mu\\tau_h)" + ], + "full_theorem_checker_passed": false, + "id": "NUM-BIN-EXACT", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Conditional lemma", + "original_admission_code": "reviewed_conditional", + "original_admission_label": "Conditionally reviewed", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "d7ca3e32b7c3633bf914f225f3ce576ccf9affc9e282a652708062132359a9ec", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Exact statement §§Exact statement–Dependencies", + "record_fingerprint_v14": "8793f34224bdc81a97543413d5ce5817482279b9c216b2faa5fa4c1ae3b38a58", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/EXACT_SAMPLE_SHRINKING_BIN.md", + "scope": "Unconditioned smooth planar periodized Gaussian field, torus L=24; exact n×n vertex samples h=24/n; 00; assumes M4-M5 continuum density and deterministic approximation interfaces. No realization-wise bound or observed confidence interval. Same-account PASS_TECHNICAL_SCOPED, not scientific-status acceptance.", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/EXACT_SAMPLE_SHRINKING_BIN.md", + "source_authenticated": false, + "statement": "The expectation of the absolute difference between exact vertex-cubical finite-bar counts and continuum counts becomes negligible relative to expected continuum bin mass.", + "theorem_certificate_status": "not_attached", + "title": "Exact-grid shrinking lifetime-bin convergence", + "topic": "NUM" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "NUM-BIN-EXACT", + "external_theorem_imports": [], + "fingerprint": "99c02d511687a46dbe8546bcddbf73b2d191435ce061fa58ba8423b981a6ba4a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:NUM-BIN-EXACT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Exact statement §§Exact statement–Dependencies", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/EXACT_SAMPLE_SHRINKING_BIN.md", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/EXACT_SAMPLE_SHRINKING_BIN.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:NUM-BIN-EXACT:scope", + "origin": "verbatim_curated_scope", + "text": "Unconditioned smooth planar periodized Gaussian field, torus L=24; exact n×n vertex samples h=24/n; 00; assumes M4-M5 continuum density and deterministic approximation interfaces. No realization-wise bound or observed confidence interval. Same-account PASS_TECHNICAL_SCOPED, not scientific-status acceptance.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:NUM-BIN-SPECTRAL", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "522475a0f3418911934f0302ad5dfb4292bb6848c6a9ab2ba7c0aa62ad0be135", + "exact_boundary": { + "record_id": "NUM-BIN-SPECTRAL", + "kind": "Conditional theorem", + "statement": "Certified coupled spectral samples recover continuum expected short-bar counts in the shrinking-bin limit under controlled truncation, normalization, nodal error and failure probability.", + "equations": [ + "[h_n^2+e^{-\\beta m_n^2}]\\sqrt{\\log n}+\\eta_n=o(\\tau_n)", + "n^2q_n+\\sqrt{q_n}=o(\\tau_n^{2/3})", + "\\frac{\\mathbb E|N_{Q_n}(I_n)-N_F(I_n)|}{\\mathbb E N_F(I_n)}\\to0" + ], + "scope": "Planar L=24, exact joint Fourier coupling; M_n>=m_n or M_n=∞; beta=pi²/24²; finite-grid supplied-value errors eta_n and failure chance q_n. Imports density/count/approximation interfaces and does not certify historical floating-point samples or finite-grid threshold. PASS_TECHNICAL_SCOPED with zero organizational independence.", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/spectral_shrinking_bins/PROOF.md", + "proof_ref": "Theorem and proof, §1 and schedules", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "[h_n^2+e^{-\\beta m_n^2}]\\sqrt{\\log n}+\\eta_n=o(\\tau_n)", + "n^2q_n+\\sqrt{q_n}=o(\\tau_n^{2/3})", + "\\frac{\\mathbb E|N_{Q_n}(I_n)-N_F(I_n)|}{\\mathbb E N_F(I_n)}\\to0" + ], + "full_theorem_checker_passed": false, + "id": "NUM-BIN-SPECTRAL", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Conditional theorem", + "original_admission_code": "reviewed_conditional", + "original_admission_label": "Conditionally reviewed", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "4c63ea30d0a85a9f68aec4bca1a0e4e7aaed91d972960bc62a428c746163ec77", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem and proof, §1 and schedules", + "record_fingerprint_v14": "b8c34b83ac9a141f5898631f9d2108cc386ec9d6b42c9b4299f490bb6789ae8c", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/spectral_shrinking_bins/README.md", + "scope": "Planar L=24, exact joint Fourier coupling; M_n>=m_n or M_n=∞; beta=pi²/24²; finite-grid supplied-value errors eta_n and failure chance q_n. Imports density/count/approximation interfaces and does not certify historical floating-point samples or finite-grid threshold. PASS_TECHNICAL_SCOPED with zero organizational independence.", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/spectral_shrinking_bins/PROOF.md", + "source_authenticated": false, + "statement": "Certified coupled spectral samples recover continuum expected short-bar counts in the shrinking-bin limit under controlled truncation, normalization, nodal error and failure probability.", + "theorem_certificate_status": "not_attached", + "title": "Spectral-coupled shrinking-bin convergence", + "topic": "NUM" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "NUM-BIN-SPECTRAL", + "external_theorem_imports": [], + "fingerprint": "33dac5c3439f0b901452e2e0d9588a863ba8450aa293841a7d7759ca4874bba6", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:NUM-BIN-SPECTRAL", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "NUM-BIN-EXACT" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem and proof, §1 and schedules", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/spectral_shrinking_bins/README.md", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/spectral_shrinking_bins/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:NUM-BIN-SPECTRAL:scope", + "origin": "verbatim_curated_scope", + "text": "Planar L=24, exact joint Fourier coupling; M_n>=m_n or M_n=∞; beta=pi²/24²; finite-grid supplied-value errors eta_n and failure chance q_n. Imports density/count/approximation interfaces and does not certify historical floating-point samples or finite-grid threshold. PASS_TECHNICAL_SCOPED with zero organizational independence.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-01", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "5a8809e315677e9f87c41ab9d2af8077c401ee457cfd68314556908f36fbccc3", + "exact_boundary": { + "record_id": "P15-01", + "kind": "Sharp constant", + "statement": "The sharp uniform factor is enclosed by two adjacent 20-decimal bounds; 6/7 is a simpler valid upper factor.", + "equations": [ + "0.84547981724898672067 < ρ* < 0.84547981724898672068 < 6/7" + ], + "scope": "Theorem F realized family and its price hypotheses.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "proof_ref": "(F3)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "0.84547981724898672067 < ρ* < 0.84547981724898672068 < 6/7" + ], + "full_theorem_checker_passed": false, + "id": "P15-01", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Sharp constant", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "7e0e03e399af77464d135cced9ef0daa41c407453af568e23b6db7f9cce3f7db", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "(F3)", + "record_fingerprint_v14": "2201098fa0f88a007799adbc509f852ee5ba2d0fdc2cefcb973a15d14c7808bb", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Theorem F realized family and its price hypotheses.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The sharp uniform factor is enclosed by two adjacent 20-decimal bounds; 6/7 is a simpler valid upper factor.", + "theorem_certificate_status": "not_attached", + "title": "Certified factor and simple rational bound", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-01", + "external_theorem_imports": [], + "fingerprint": "32416b5d621d428a1a118f939d7b29ec6807c1906114ab16759fe98dae968a46", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-01", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V04" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "(F3)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-01:scope", + "origin": "verbatim_curated_scope", + "text": "Theorem F realized family and its price hypotheses.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-E1", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "0ce5b87af99e9ea1358c6c6a793551e89f453e6c7126720f91433a11bb1b16b4", + "exact_boundary": { + "record_id": "P15-E1", + "kind": "Theorem", + "statement": "When each original coordinate belongs to at most two capacity blocks and every capacity is positive and even, exact colouring holds without bipartiteness.", + "equations": [ + "\\chi_D(U)=\\max_i\\left\\lceil|U\\cap X_i|/a_i\\right\\rceil" + ], + "scope": "Finite capacity family; every coordinate lies in <=2 blocks; every ai positive EVEN integer. Odd-capacity nonbipartite instances are excluded.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "proof_ref": "Theorem E1 (E1)–(E2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\chi_D(U)=\\max_i\\left\\lceil|U\\cap X_i|/a_i\\right\\rceil" + ], + "full_theorem_checker_passed": false, + "id": "P15-E1", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "739f9fc3d4bf389f428bdd004761fff45b08ce9616b00143809d7e61cd6590e9", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem E1 (E1)–(E2)", + "record_fingerprint_v14": "b74af7111ecb2f258f616282143d636154d4ef1057476a3832de75c2986e9bb8", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "scope": "Finite capacity family; every coordinate lies in <=2 blocks; every ai positive EVEN integer. Odd-capacity nonbipartite instances are excluded.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "source_authenticated": false, + "statement": "When each original coordinate belongs to at most two capacity blocks and every capacity is positive and even, exact colouring holds without bipartiteness.", + "theorem_certificate_status": "not_attached", + "title": "Even-capacity read-two colouring", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-E1", + "external_theorem_imports": [], + "fingerprint": "68ee8a858736a6d5429d5c1d3f62e5d97f5a54e3da027d14071e627318ff82f6", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-E1", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem E1 (E1)–(E2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-E1:scope", + "origin": "verbatim_curated_scope", + "text": "Finite capacity family; every coordinate lies in <=2 blocks; every ai positive EVEN integer. Odd-capacity nonbipartite instances are excluded.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-E2", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "26c22e8158c4bb0fcc4f34b9ddec0a4d1ba09fceeab97034e7f366cbd766d72c", + "exact_boundary": { + "record_id": "P15-E2", + "kind": "Lemma", + "statement": "For product measure and events Ai depending on coordinate sets of incidence at most q, a common subevent D has total marginal hazards bounded by q times its own hazard.", + "equations": [ + "\\sum_i[-\\log\\mu(A_i)]\\le q[-\\log\\mu(D)]" + ], + "scope": "Finite product probability measure; coordinate incidence <=q; D subset Ai for every i; extended log/hazard conventions. Not an assertion for arbitrary dependent measures.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "proof_ref": "Lemma E2 (E3)–(E4)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\sum_i[-\\log\\mu(A_i)]\\le q[-\\log\\mu(D)]" + ], + "full_theorem_checker_passed": false, + "id": "P15-E2", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "c95b29001304f7b62b677172e00619d7c1a1a502056519eabf5ff307c1249bc3", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Lemma E2 (E3)–(E4)", + "record_fingerprint_v14": "7eaeaddff031b420162ce0c150053a09cbdfbe48013659d151a741fae5d7f83a", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "scope": "Finite product probability measure; coordinate incidence <=q; D subset Ai for every i; extended log/hazard conventions. Not an assertion for arbitrary dependent measures.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "source_authenticated": false, + "statement": "For product measure and events Ai depending on coordinate sets of incidence at most q, a common subevent D has total marginal hazards bounded by q times its own hazard.", + "theorem_certificate_status": "not_attached", + "title": "Read-q relative-entropy hazard inequality", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-E2", + "external_theorem_imports": [], + "fingerprint": "36bf16487f7ac5b6e19f4191b6114733755634927d5d330f685db236407c909a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-E2", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V06" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Lemma E2 (E3)–(E4)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-E2:scope", + "origin": "verbatim_curated_scope", + "text": "Finite product probability measure; coordinate incidence <=q; D subset Ai for every i; extended log/hazard conventions. Not an assertion for arbitrary dependent measures.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-E3", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "666734dda1929e7dc8cb2e970710cbfcbc22f06cd3c8beeb4ebb145ae391e1f4", + "exact_boundary": { + "record_id": "P15-E3", + "kind": "Theorem", + "statement": "Combining the exact even/read-two cover, relative-entropy hazard inequality and reference tail yields a strictly sub-two-thirds factor.", + "equations": [ + "\\rho_{\\mathrm{even}}=2/\\log(512/25)<2/3", + "\\mathrm{covercost}(\\mathcal O_K(D))\\le\\min\\{1,\\rho_{\\mathrm{even}}[-\\log\\mu_p(D)]\\}" + ], + "scope": "Every ai positive even; each original coordinate in at most two blocks; |Xi|=ai di+1; K=max di>=4; original independent probabilities and transformed-price hypothesis. No claim that factor is optimal.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "proof_ref": "§E3 (E5)–(E6)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\rho_{\\mathrm{even}}=2/\\log(512/25)<2/3", + "\\mathrm{covercost}(\\mathcal O_K(D))\\le\\min\\{1,\\rho_{\\mathrm{even}}[-\\log\\mu_p(D)]\\}" + ], + "full_theorem_checker_passed": false, + "id": "P15-E3", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "5a9822f9f721c71dc3c92c1af85e028446f65ccbd51b66b32d4cfc5b7ad27ca8", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§E3 (E5)–(E6)", + "record_fingerprint_v14": "d64e5a97e6e5627fa97839c1cc9788a8351262237b6cc787fa4cfb7ce0335c08", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "scope": "Every ai positive even; each original coordinate in at most two blocks; |Xi|=ai di+1; K=max di>=4; original independent probabilities and transformed-price hypothesis. No claim that factor is optimal.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "source_authenticated": false, + "statement": "Combining the exact even/read-two cover, relative-entropy hazard inequality and reference tail yields a strictly sub-two-thirds factor.", + "theorem_certificate_status": "not_attached", + "title": "Even/read-two transformed-price budget", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-E3", + "external_theorem_imports": [], + "fingerprint": "db5b3cacc18bb8b86fe6b391a7138c5954c482a4e7e1175f5251c459c1283da9", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-E3", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "P15-E1", + "P15-E2" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§E3 (E5)–(E6)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-E3:scope", + "origin": "verbatim_curated_scope", + "text": "Every ai positive even; each original coordinate in at most two blocks; |Xi|=ai di+1; K=max di>=4; original independent probabilities and transformed-price hypothesis. No claim that factor is optimal.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-F", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "cab93f9a9e17d8b1574184265097c5c421e47b1088b0b663ca7138bceefb60d8", + "exact_boundary": { + "record_id": "P15-F", + "kind": "Theorem F", + "statement": "The accepted theorem bounds cost of covering the non-K-colorable portion of the realized disjoint-block decreasing family.", + "equations": [ + "φ(p)=min(1,−log(1−p)); φ(1)=1\nρ*=1/[3−log(3e−2)]\ncovercost_c(O_K(D)) ≤ min(1, ρ*·[−log μ_p(D)])" + ], + "scope": "Disjoint realized blocks, integer demands d_i≥2, original independent p, prices 0≤c_v≤φ(p_v), same K≥K_H(d). No arbitrary-downset extension.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "proof_ref": "Theorem F, (F1)–(F2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "φ(p)=min(1,−log(1−p)); φ(1)=1\nρ*=1/[3−log(3e−2)]\ncovercost_c(O_K(D)) ≤ min(1, ρ*·[−log μ_p(D)])" + ], + "full_theorem_checker_passed": false, + "id": "P15-F", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem F", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "ad9ac5d57326271e08e654acf89f7d33727dccf50d6a9a37cb1263c5b556c6c4", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem F, (F1)–(F2)", + "record_fingerprint_v14": "b42bd63c852d8a2024df9851fe8d1567dd693d08392fb390e043ad6a02a26dfc", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Disjoint realized blocks, integer demands d_i≥2, original independent p, prices 0≤c_v≤φ(p_v), same K≥K_H(d). No arbitrary-downset extension.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The accepted theorem bounds cost of covering the non-K-colorable portion of the realized disjoint-block decreasing family.", + "theorem_certificate_status": "not_attached", + "title": "Sharp transformed-price covering inequality", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-F", + "external_theorem_imports": [], + "fingerprint": "09d740c2782fca35263a7adccde1969b81c3b5c193eb6c8437da077de28a0194", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-F", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V11" + ], + "premise_bases": "source_explicit", + "premises": [ + "P15-L", + "P15-SHARP", + "P15-STRUCT", + "P15-TAIL" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem F, (F1)–(F2)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-F:scope", + "origin": "verbatim_curated_scope", + "text": "Disjoint realized blocks, integer demands d_i≥2, original independent p, prices 0≤c_v≤φ(p_v), same K≥K_H(d). No arbitrary-downset extension.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-L", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "c5a484068afd67b6806fae19640385d8a9d9a08c021ba22a1ea4a8252d303d62", + "exact_boundary": { + "record_id": "P15-L", + "kind": "Lemma", + "statement": "The hazard of a proper decreasing family obeys a product lower bound under a coordinatewise interpolation.", + "equations": [ + "F_A(t)=−log μ_{p(t)}(A), p_i(t)=1−e^(−t_i)\nH_A=F_A(1,…,1)\nF_A(t) ≥ H_A∏_i t_i\n−log μ_p(A) ≥ H_A∏_i φ(p_i)" + ], + "scope": "Proper decreasing A containing ∅; coordinate t∈[0,1]^n, independent Bernoulli inputs; separate concavity only.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "proof_ref": "§2, (F4)–(F8)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "F_A(t)=−log μ_{p(t)}(A), p_i(t)=1−e^(−t_i)\nH_A=F_A(1,…,1)\nF_A(t) ≥ H_A∏_i t_i\n−log μ_p(A) ≥ H_A∏_i φ(p_i)" + ], + "full_theorem_checker_passed": false, + "id": "P15-L", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma", + "original_admission_code": "status_snapshot", + "original_admission_label": "Project status-listed (scoped)", + "project_acceptance": "primary", + "proof_lineage_fingerprint_v14": "3c1f49e4cda518d368e622ed4ba174eba34c929b511e880dd0d88c88298aef0a", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§2, (F4)–(F8)", + "record_fingerprint_v14": "a68e34aeec465b6d7f995fbe661f4c883636015136e911d34be22c07fdcf23fd", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Proper decreasing A containing ∅; coordinate t∈[0,1]^n, independent Bernoulli inputs; separate concavity only.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_authenticated": false, + "statement": "The hazard of a proper decreasing family obeys a product lower bound under a coordinatewise interpolation.", + "theorem_certificate_status": "not_attached", + "title": "Hazard interpolation inequality", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-L", + "external_theorem_imports": [], + "fingerprint": "9cfeb0bec2ff7e0800da5304f342a5bd109dcff32a02c49441b81a16aed15c5b", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-L", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V05" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§2, (F4)–(F8)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-L:scope", + "origin": "verbatim_curated_scope", + "text": "Proper decreasing A containing ∅; coordinate t∈[0,1]^n, independent Bernoulli inputs; separate concavity only.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-O1", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "e060b69a881a7da749753bd25533ad68ec6e6805a0d6ba912f6f6546d98b8fbb", + "exact_boundary": { + "record_id": "P15-O1", + "kind": "Theorem", + "statement": "For a finite capacity downset whose covering blocks have bipartite intersection graph, the exact minimum number of capacity-feasible colours is the maximum block load divided by its capacity, rounded up.", + "equations": [ + "\\chi_D(U)=\\max_i\\left\\lceil |U\\cap X_i|/a_i\\right\\rceil" + ], + "scope": "Finite original coordinates X; nonempty covering blocks Xi; ai positive integers; intersecting-block graph bipartite. Each coordinate is coloured once. No macro-clutter or arbitrary read-two extension.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "proof_ref": "Theorem O1 (O1)–(O2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\chi_D(U)=\\max_i\\left\\lceil |U\\cap X_i|/a_i\\right\\rceil" + ], + "full_theorem_checker_passed": false, + "id": "P15-O1", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "53926b6639e0abf7bfecd0584fc73b8890e7508a79a452d1b8df7917b0ec1232", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem O1 (O1)–(O2)", + "record_fingerprint_v14": "38a74ead231882c19cd8d8ff51afcd5afc0267d281a0a670ad8bc0eb9da2bd48", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "scope": "Finite original coordinates X; nonempty covering blocks Xi; ai positive integers; intersecting-block graph bipartite. Each coordinate is coloured once. No macro-clutter or arbitrary read-two extension.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "source_authenticated": false, + "statement": "For a finite capacity downset whose covering blocks have bipartite intersection graph, the exact minimum number of capacity-feasible colours is the maximum block load divided by its capacity, rounded up.", + "theorem_certificate_status": "not_attached", + "title": "Bipartite-overlap exact original-coordinate colouring", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-O1", + "external_theorem_imports": [], + "fingerprint": "21f2dd2b4e58a9f72d00735318b1cfe3718a9c44aab341d16ecb414471cf34c9", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-O1", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem O1 (O1)–(O2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-O1:scope", + "origin": "verbatim_curated_scope", + "text": "Finite original coordinates X; nonempty covering blocks Xi; ai positive integers; intersecting-block graph bipartite. Each coordinate is coloured once. No macro-clutter or arbitrary read-two extension.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-O2", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "ffdcbe9a972658816e438b97240dea1fda37088c4f69a20551398db7c5e9f639", + "exact_boundary": { + "record_id": "P15-O2", + "kind": "Corollary", + "statement": "At the palette K=max_i d_i, inclusion-minimal distinct active full blocks describe the minimal K-obstructions; the whole ground set needs K+1 colours.", + "equations": [ + "|X_i|=a_i d_i+1,\\quad K=\\max_i d_i\\ge4", + "\\chi_D(X)=K+1" + ], + "scope": "Bipartite-overlap class of P15-O1, with active blocks d_i=K. Inactive and duplicate/superset blocks require the source removal rules.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "proof_ref": "Corollary O2 (O3)–(O4)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "|X_i|=a_i d_i+1,\\quad K=\\max_i d_i\\ge4", + "\\chi_D(X)=K+1" + ], + "full_theorem_checker_passed": false, + "id": "P15-O2", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Corollary", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "5a7390665db2b6061cab62a61ee22c7ef34f8c6f3a88f3c54255227318877681", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Corollary O2 (O3)–(O4)", + "record_fingerprint_v14": "9d1e2a7225aee3a8c486cb995a6d449930ada9732364301c00a3fe8d7f9d7f66", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "scope": "Bipartite-overlap class of P15-O1, with active blocks d_i=K. Inactive and duplicate/superset blocks require the source removal rules.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "source_authenticated": false, + "statement": "At the palette K=max_i d_i, inclusion-minimal distinct active full blocks describe the minimal K-obstructions; the whole ground set needs K+1 colours.", + "theorem_certificate_status": "not_attached", + "title": "Active-block exact obstruction cover", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-O2", + "external_theorem_imports": [], + "fingerprint": "c0f89341774be2b6cb702f7a6f27d14bcdcf3225ba1fbd2dab6886198c910160", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-O2", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "P15-O1" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Corollary O2 (O3)–(O4)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-O2:scope", + "origin": "verbatim_curated_scope", + "text": "Bipartite-overlap class of P15-O1, with active blocks d_i=K. Inactive and duplicate/superset blocks require the source removal rules.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-O3", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "b2655eae968e8a6e6a23b19e54ec3c0b0fe3779598de88a7fc1ab107912b0477", + "exact_boundary": { + "record_id": "P15-O3", + "kind": "Theorem", + "statement": "The reviewed active-block cover has a transformed-price cost bounded by the bipartite reference-hazard factor under the original independent Bernoulli coordinates.", + "equations": [ + "\\rho_{\\mathrm{bip}}=\\frac{2}{5-\\log(5e-4)}<\\frac34", + "\\mathrm{covercost}(\\mathcal O_K(D))\\le\\min\\{1,\\rho_{\\mathrm{bip}}[-\\log\\mu_p(D)]\\}" + ], + "scope": "Bipartite intersection graph; arbitrary positive capacities; K=max d_i>=4; prices 0<=cv<=min(1,-log(1-pv)); same original coordinates and full-block cover. Here 5e-4 means 5*e−4.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "proof_ref": "Theorem O4 (O5)–(O12)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\rho_{\\mathrm{bip}}=\\frac{2}{5-\\log(5e-4)}<\\frac34", + "\\mathrm{covercost}(\\mathcal O_K(D))\\le\\min\\{1,\\rho_{\\mathrm{bip}}[-\\log\\mu_p(D)]\\}" + ], + "full_theorem_checker_passed": false, + "id": "P15-O3", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "6a5df59a18bd12a1ca31e45b315c946008122a99c62553d079e9dc3c90de6408", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem O4 (O5)–(O12)", + "record_fingerprint_v14": "7ee7047445756a272dbbbf06003ee426613549f6f57a0d156375a6f0ed876ee9", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "scope": "Bipartite intersection graph; arbitrary positive capacities; K=max d_i>=4; prices 0<=cv<=min(1,-log(1-pv)); same original coordinates and full-block cover. Here 5e-4 means 5*e−4.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "source_authenticated": false, + "statement": "The reviewed active-block cover has a transformed-price cost bounded by the bipartite reference-hazard factor under the original independent Bernoulli coordinates.", + "theorem_certificate_status": "not_attached", + "title": "Bipartite-overlap transformed-price factor", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-O3", + "external_theorem_imports": [], + "fingerprint": "74ed4d4279f9129ae30f5a0cdac5bd160e73eff23edc302b0b3f4b3937a6ffca", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-O3", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "P15-O2" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem O4 (O5)–(O12)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-O3:scope", + "origin": "verbatim_curated_scope", + "text": "Bipartite intersection graph; arbitrary positive capacities; K=max d_i>=4; prices 0<=cv<=min(1,-log(1-pv)); same original coordinates and full-block cover. Here 5e-4 means 5*e−4.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-SHARP", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "c8e7e012b7b1c865b5ce073af6c34ef593dbddce44b4284fbacaac9727d30f7d", + "exact_boundary": { + "record_id": "P15-SHARP", + "kind": "Supporting proposition", + "statement": "A single capacity-one block on three original coordinates and two colors makes the transformed-price factor optimal even over alternative generator covers.", + "equations": [ + "a=1,d=2,n=3,K=2; O_2(D)={X}", + "p_i=p_*=1-e^(-1), c_i=1; min_covercost=1, −log μ_p(D)=3−log(3e−2)" + ], + "scope": "Single block; empty macro H; K=2; price-one convention for every generator including the empty set. This witnesses sharpness ONLY within the stated realized family.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "proof_ref": "§5, sharpness construction", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "a=1,d=2,n=3,K=2; O_2(D)={X}", + "p_i=p_*=1-e^(-1), c_i=1; min_covercost=1, −log μ_p(D)=3−log(3e−2)" + ], + "full_theorem_checker_passed": false, + "id": "P15-SHARP", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Supporting proposition", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "7fd32770562a0a497ca4b21753f236cd662cca78c2d0047677140ac285280c31", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§5, sharpness construction", + "record_fingerprint_v14": "50d66bb939726ec77967d342175bd4498df4173e2296faf8807bb2f5fe0999bc", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Single block; empty macro H; K=2; price-one convention for every generator including the empty set. This witnesses sharpness ONLY within the stated realized family.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_authenticated": false, + "statement": "A single capacity-one block on three original coordinates and two colors makes the transformed-price factor optimal even over alternative generator covers.", + "theorem_certificate_status": "not_attached", + "title": "Three-coordinate optimality witness", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-SHARP", + "external_theorem_imports": [], + "fingerprint": "9a27f77b3bcae7d5978d1b223f850f3265bfef4caa5ca04f1baf262252d077a3", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-SHARP", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V14" + ], + "premise_bases": "source_explicit", + "premises": [ + "P15-TAIL" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5, sharpness construction", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-SHARP:scope", + "origin": "verbatim_curated_scope", + "text": "Single block; empty macro H; K=2; price-one convention for every generator including the empty set. This witnesses sharpness ONLY within the stated realized family.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-STRUCT", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "bae851196bd4e916ea268723e1e29a2515e101459195b99288198b91a7b01468", + "exact_boundary": { + "record_id": "P15-STRUCT", + "kind": "Supporting proposition", + "statement": "For realized disjoint block capacity families, the specified full-block generators cover O_K(D) exactly when K admits feasible macro palettes.", + "equations": [ + "n_i=a_i d_i+1; D={U: |U∩X_i|≤a_i and supp(U) contains no H-edge}", + "G={X_1,…,X_b}; G covers O_K(D) ⇔ K≥K_H(d)" + ], + "scope": "Finite disjoint nonempty original-coordinate blocks, a_i,d_i positive integers; H is a clutter with edges of size ≥2 (or empty). This is only the specified G, not optimality of arbitrary covers at lower K.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md", + "proof_ref": "Theorem P2, (P1)–(P7)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "n_i=a_i d_i+1; D={U: |U∩X_i|≤a_i and supp(U) contains no H-edge}", + "G={X_1,…,X_b}; G covers O_K(D) ⇔ K≥K_H(d)" + ], + "full_theorem_checker_passed": false, + "id": "P15-STRUCT", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Supporting proposition", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "86df5f1a7b8b7f15c66dd4d6476df41e61831a21aac32dd905faf261089a8de3", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem P2, (P1)–(P7)", + "record_fingerprint_v14": "63808b3c6eca2f14a2afc72bee5646a4b2862f5323cfd7f1d15da283eb142b76", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "Finite disjoint nonempty original-coordinate blocks, a_i,d_i positive integers; H is a clutter with edges of size ≥2 (or empty). This is only the specified G, not optimality of arbitrary covers at lower K.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md", + "source_authenticated": false, + "statement": "For realized disjoint block capacity families, the specified full-block generators cover O_K(D) exactly when K admits feasible macro palettes.", + "theorem_certificate_status": "not_attached", + "title": "Exact original-coordinate palette cover", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-STRUCT", + "external_theorem_imports": [], + "fingerprint": "93d531ca885c1082ba04b9d74b804e1216298e84a59935b2a3ee7ca880baca7d", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-STRUCT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V12" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem P2, (P1)–(P7)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-STRUCT:scope", + "origin": "verbatim_curated_scope", + "text": "Finite disjoint nonempty original-coordinate blocks, a_i,d_i positive integers; H is a clutter with edges of size ≥2 (or empty). This is only the specified G, not optimality of arbitrary covers at lower K.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-T1", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "d5acd53dcc8b5417324b114dc0adfaf20a785c3426fbbdb04be72a8774330fe0", + "exact_boundary": { + "record_id": "P15-T1", + "kind": "Theorem", + "statement": "The source-exposed reviewer accepts the tighter uniform even/read-two cover factor, derived from the sharp nine-coordinate reference tail.", + "equations": [ + "\\rho_9=\\frac{2}{9-\\log(36e^2-63e+28)}<\\frac12" + ], + "scope": "Same even-capacity read-two eligibility and palette as P15-E3, independently proved genuine cover; uniform factor is not claimed globally optimal. Formula and scope from source summary and reviewed Theorem 1 (T1)–(T2).", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "proof_ref": "Theorem 1, (T1)–(T2)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\rho_9=\\frac{2}{9-\\log(36e^2-63e+28)}<\\frac12" + ], + "full_theorem_checker_passed": false, + "id": "P15-T1", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "1349e971f8e8c2df594f3a5fba228c98896402f8adac9e7a40304f831b025aee", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem 1, (T1)–(T2)", + "record_fingerprint_v14": "ef9d48997156725425a658f3f41f67e7407f75b9161e9187fcb065e4daec11f5", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "scope": "Same even-capacity read-two eligibility and palette as P15-E3, independently proved genuine cover; uniform factor is not claimed globally optimal. Formula and scope from source summary and reviewed Theorem 1 (T1)–(T2).", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "source_authenticated": false, + "statement": "The source-exposed reviewer accepts the tighter uniform even/read-two cover factor, derived from the sharp nine-coordinate reference tail.", + "theorem_certificate_status": "not_attached", + "title": "Sharper even/read-two tail price factor", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-T1", + "external_theorem_imports": [], + "fingerprint": "8cc1f040a87ffe126e5746d072df0bd15648f79f19a34e769d2698a0f3d3d8ed", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-T1", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "P15-E1", + "P15-E2", + "P15-T3" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem 1, (T1)–(T2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-T1:scope", + "origin": "verbatim_curated_scope", + "text": "Same even-capacity read-two eligibility and palette as P15-E3, independently proved genuine cover; uniform factor is not claimed globally optimal. Formula and scope from source summary and reviewed Theorem 1 (T1)–(T2).", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-T2", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "e14cc95700cb2fad704664e7026d73351417aa28d2bcda9e094c3a2bd0194fe2", + "exact_boundary": { + "record_id": "P15-T2", + "kind": "Theorem", + "statement": "The reviewed weighted relative-entropy argument bounds cost using each coordinate’s actual sum of inverse reference hazards, conditional on an independently valid cover.", + "equations": [ + "\\sum_i D_{KL}(\\nu_{S_i}\\Vert\\mu_{S_i})\\le\\sum_v m_v c_v" + ], + "scope": "Finite product coordinates; true cover proved first; source (T3)–(T4), (T9)–(T11) uses coordinate-specific loads rather than replacing all with a maximum. Displayed inequality is a schematic general entropy form; consult exact source for the budget.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "proof_ref": "Theorem 2 (T3)–(T4), (T9)–(T11)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "\\sum_i D_{KL}(\\nu_{S_i}\\Vert\\mu_{S_i})\\le\\sum_v m_v c_v" + ], + "full_theorem_checker_passed": false, + "id": "P15-T2", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Theorem", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "e73bec6353989fe8638a97e15692cbecec7a865812b683377777487f97879c71", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "Theorem 2 (T3)–(T4), (T9)–(T11)", + "record_fingerprint_v14": "9c5c9f559d8642aa24f05d5643cab0aae15eedbe94564fad344b2b4b00ffda09", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "scope": "Finite product coordinates; true cover proved first; source (T3)–(T4), (T9)–(T11) uses coordinate-specific loads rather than replacing all with a maximum. Displayed inequality is a schematic general entropy form; consult exact source for the budget.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "source_authenticated": false, + "statement": "The reviewed weighted relative-entropy argument bounds cost using each coordinate’s actual sum of inverse reference hazards, conditional on an independently valid cover.", + "theorem_certificate_status": "not_attached", + "title": "Instance-adaptive weighted coordinate-load budget", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-T2", + "external_theorem_imports": [], + "fingerprint": "1be1b093813b845b888b8da05da5b4ac79f8fc7b5ff81843af48c8f709b395cd", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-T2", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem 2 (T3)–(T4), (T9)–(T11)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-T2:scope", + "origin": "verbatim_curated_scope", + "text": "Finite product coordinates; true cover proved first; source (T3)–(T4), (T9)–(T11) uses coordinate-specific loads rather than replacing all with a maximum. Displayed inequality is a schematic general entropy form; consult exact source for the budget.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-T3", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "851319ff47e1332e7ebfb6107717e792ea16de612c955a5d03c41ac055e4e3ab", + "exact_boundary": { + "record_id": "P15-T3", + "kind": "Lemma", + "statement": "The reference lower tail on nine Bernoulli coordinates attains the maximum used in the tighter uniform bound at capacity two and palette four.", + "equations": [ + "q_9=\\Pr\\{\\operatorname{Bin}(9,1-e^{-1})\\le2\\}" + ], + "scope": "Reference binomial-tail computation for even/read-two class; exact attainment a=2, K=4; a reference-tail sharpness, not an optimal cover factor.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "proof_ref": "(T12)–(T13)", + "original_kind_preserved": true + }, + "reason": "No aligned full-statement kernel certificate is attached for this legacy application record. Definitions and carriers remain exact definitions/carriers; their application/identification in a theorem is unclosed. Source-custody or local checks do not discharge imports, side conditions or nonvacuity.", + "attempts": [ + "Preserved all exact source-record fields and original dataset/obligation/import/provenance files.", + "Read original full_theorem_checker_passed/theorem_certificate_status/obligation fields; no conversion of prior review labels into kernel closure." + ], + "original_record": { + "equations": [ + "q_9=\\Pr\\{\\operatorname{Bin}(9,1-e^{-1})\\le2\\}" + ], + "full_theorem_checker_passed": false, + "id": "P15-T3", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Lemma", + "original_admission_code": "reviewed_separately", + "original_admission_label": "Separately reviewed only", + "project_acceptance": "reviewed", + "proof_lineage_fingerprint_v14": "dc8a44006c27a7ebc372ea47614847e26c5b9d6edf5dd0ba393410c54b9d9225", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "(T12)–(T13)", + "record_fingerprint_v14": "3be7893dd6dc912c77af7683fa7b9d5073844a87f627c81c9c3d870ca5d862e0", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "scope": "Reference binomial-tail computation for even/read-two class; exact attainment a=2, K=4; a reference-tail sharpness, not an optimal cover factor.", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "source_authenticated": false, + "statement": "The reference lower tail on nine Bernoulli coordinates attains the maximum used in the tighter uniform bound at capacity two and palette four.", + "theorem_certificate_status": "not_attached", + "title": "Sharp nine-coordinate reference tail", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-T3", + "external_theorem_imports": [], + "fingerprint": "cacc46e428007ce559587cf7d6acc161cf0c1a5b3a6941e3bfd0c29212611960", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-T3", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "(T12)–(T13)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-T3:scope", + "origin": "verbatim_curated_scope", + "text": "Reference binomial-tail computation for even/read-two class; exact attainment a=2, K=4; a reference-tail sharpness, not an optimal cover factor.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "V20:P15-TAIL", + "category": "legacy_v20_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/legacy-v20/engine/dataset.json", + "sha256": "4cfae309b9da989ca6c95881f207c0a097a4dde836f45eacbe0e78d7faf9e4d7" + } + ], + "source_record_sha256": "7e928259079c5406a3b3dae2583a4a01e7bf7ab3122d1ee3fc4175629e9d93cb", + "exact_boundary": { + "record_id": "P15-TAIL", + "kind": "Supporting lemma", + "statement": "For p>1/2, the odd-binomial lower tail decreases strictly with the capacity index. This bounds every realized demand≥2 local hazard from below by the three-coordinate reference.", + "equations": [ + "Pr(Bin(2a+3,p)≤a+1)-Pr(Bin(2a+1,p)≤a)=p(1-2p)Pr(Bin(2a+1,p)=a)<0", + "H_(ad+1,a)≥h_*=3-log(3e-2)>1 (a≥1,d≥2,p_*=1-e^(-1))" + ], + "scope": "a≥1 integer; d≥2 integer; p=p_*=1-e^(-1) for hazard conclusion; the recurrence holds for all 1/21 (a≥1,d≥2,p_*=1-e^(-1))" + ], + "full_theorem_checker_passed": false, + "id": "P15-TAIL", + "import_status": "unvalidated", + "imports_inventory_exhaustive": false, + "independently_reproduced_full_theorem": false, + "kind": "Supporting lemma", + "original_admission_code": "within_reviewed_proof", + "original_admission_label": "Reviewed proof component", + "project_acceptance": "supporting", + "proof_lineage_fingerprint_v14": "56937797dee91efdfdf79f405cdb9d684b15c672d02100871bcb110498ae47f0", + "proof_obligation_status": "side_conditions_open", + "proof_ref": "§3, (F9)–(F11)", + "record_fingerprint_v14": "5f4dfc81bde401152359d9ae7cad31da306e690d3a8c231323d9ec9e68a54322", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "scope": "a≥1 integer; d≥2 integer; p=p_*=1-e^(-1) for hazard conclusion; the recurrence holds for all 1/21/2, the odd-binomial lower tail decreases strictly with the capacity index. This bounds every realized demand≥2 local hazard from below by the three-coordinate reference.", + "theorem_certificate_status": "not_attached", + "title": "Sharp odd-binomial tail comparison", + "topic": "P15" + }, + "original_obligation": { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-TAIL", + "external_theorem_imports": [], + "fingerprint": "bf66e1ab1451cf9c7f110529c2234149bbef6e805519c95c3b782e3953d41ca1", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-TAIL", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V13" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3, (F9)–(F11)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-TAIL:scope", + "origin": "verbatim_curated_scope", + "text": "a≥1 integer; d≥2 integer; p=p_*=1-e^(-1) for hazard conclusion; the recurrence holds for all 1/2=2 and L; compact births and positive gap marks for Theorems A and B, with B and K of positive length for Theorem B (singleton intervals give zero mark-window intensity); embedding radius r < L/(4 sqrt 2); all frames; Theorem C leading term only; no numerical C, r_*, z_* or coefficient; no d>=3 lower bound; no RN/24-jet", + "source": "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "fingerprint": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "notes": "Parent Gaussian selection / Kac-Rice / elder chain. Theorems A, B, C accepted at existential scope, read with the four required reading-rule component nodes (congruence erratum, section 9 replacement v1.1, cap sections 1-5, reconciliation record with W1 and the embedding radius).", + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D1", + "kind": "candidate", + "author_provider": "OpenAI", + "classification": "PROVED_REVIEWED", + "controlling": false, + "review_issue": 63, + "fingerprint": "9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7", + "source": "imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "notes": "Parent Gaussian selection / Kac-Rice / elder chain. Theorems A, B, C accepted at existential scope, read with the four required reading-rule component nodes (congruence erratum, section 9 replacement v1.1, cap sections 1-5, reconciliation record with W1 and the embedding radius).", + "review_source": "reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "review_disposition": "ACCEPT_AT_EXISTENTIAL_SCOPE", + "review_providers": [ + "xAI/Grok via Cursor (D1-A-E, section 9 v1.1, partial slices)", + "Anthropic/Claude (A1-A7, cap, section 9 v1.1, sections 11-12)" + ], + "scope": "fixed d>=2 and L; compact births and positive gap marks for Theorems A and B, with B and K of positive length for Theorem B (singleton intervals give zero mark-window intensity); embedding radius r < L/(4 sqrt 2); all frames; Theorem C leading term only; no numerical C, r_*, z_* or coefficient; no d>=3 lower bound; no RN/24-jet", + "reading_rule": [ + "math.d1-component.congruence-erratum", + "math.d1-component.section9-replacement-v1_1", + "math.d1-component.marked-cylinder-cap", + "math.d1-component.reconciliation-record" + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d1-component.congruence-erratum", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "f12dc80a222156da58abb57711ff0a4a8d60c0a84afc3a4dc61ebb6734ba9121", + "exact_boundary": { + "node_id": "math.d1-component.congruence-erratum", + "kind": "reading_rule_component", + "scope": "congruence factor D_r = diag(r^-1/2, I) in parent section 5; replaces the displayed factor", + "source": "imports/lifetime_parent_20260925/ERRATUM_CONGRUENCE.md", + "fingerprint": "bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D1", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.uniform-matrix-cap-lifetime", + "component_role": "amendment", + "author_provider": "OpenAI", + "fingerprint": "bad7ef609c4ad8c41ad6af562c1b6807921e19a9d556ed793ad1a0db6e202028", + "source": "imports/lifetime_parent_20260925/ERRATUM_CONGRUENCE.md", + "ledger_items": [ + "A3-E1" + ], + "review_basis": [ + { + "review": "C1", + "provider": "Anthropic", + "verdict": "ACCEPT", + "depth": "full" + }, + { + "review": "G3", + "provider": "xAI", + "verdict": "ACCEPT", + "depth": "full" + } + ], + "review_source": "reviews/d1_chain_reconciliation_20260928/LEDGER.json", + "scope": "congruence factor D_r = diag(r^-1/2, I) in parent section 5; replaces the displayed factor" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d1-component.section9-replacement-v1_1", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "fa081a9422db4d821ac4b722ea023b916a0fa531c705fedacdb768f68faa51cc", + "exact_boundary": { + "node_id": "math.d1-component.section9-replacement-v1_1", + "kind": "reading_rule_component", + "scope": "replaces parent section 9 (Borel elder mark in weighted pair Kac-Rice), C1-C6", + "source": "reviews/d1_section9_borel_repair_20260925/REPAIR.md", + "fingerprint": "845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D1", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.uniform-matrix-cap-lifetime", + "component_role": "amendment", + "author_provider": "OpenAI", + "fingerprint": "845abf9f9c99d672c2a10a887b5a2e7206a3d2de3d876f35f75ff6e2dc13e62f", + "source": "reviews/d1_section9_borel_repair_20260925/REPAIR.md", + "ledger_items": [ + "D1-B-E2" + ], + "review_basis": [ + { + "review": "C1", + "provider": "Anthropic", + "verdict": "ACCEPT", + "depth": "full" + }, + { + "review": "G2", + "provider": "xAI", + "verdict": "ACCEPT", + "depth": "full" + } + ], + "review_source": "reviews/d1_chain_reconciliation_20260928/LEDGER.json", + "scope": "replaces parent section 9 (Borel elder mark in weighted pair Kac-Rice), C1-C6" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d1-component.marked-cylinder-cap", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "7dc8609aa3b4600b62318f04790cb68173095bf33ab68b1780bd187392d55b47", + "exact_boundary": { + "node_id": "math.d1-component.marked-cylinder-cap", + "kind": "reading_rule_component", + "scope": "deterministic separating cap, sections 1-5 (lines 1-168) only; sections 6-8 are not consumed", + "source": "imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "fingerprint": "0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D1", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.uniform-matrix-cap-lifetime", + "component_role": "deterministic_support", + "author_provider": "OpenAI", + "fingerprint": "0bf922b9203c29088b12388807aa0e2ecd020485eb0f6e919679841b5b2636fc", + "source": "imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "ledger_items": [ + "CAP" + ], + "review_basis": [ + { + "review": "C1", + "provider": "Anthropic", + "verdict": "ACCEPT", + "depth": "full" + }, + { + "review": "G3", + "provider": "xAI", + "verdict": "ACCEPT", + "depth": "full" + } + ], + "review_source": "reviews/d1_chain_reconciliation_20260928/LEDGER.json", + "scope": "deterministic separating cap, sections 1-5 (lines 1-168) only; sections 6-8 are not consumed" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d1-component.reconciliation-record", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "9607764642408c86cd2b21b7b35b8a655e4182b1a638392031e4a2a4da95eaee", + "exact_boundary": { + "node_id": "math.d1-component.reconciliation-record", + "kind": "reading_rule_component", + "scope": "nonauthor record binding the reading rule (E1, E2, W1, r < L/(4 sqrt 2)) and the interface-to-review ledger; the whole directory is bound", + "source": "reviews/d1_chain_reconciliation_20260928/", + "fingerprint": null, + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D1", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.uniform-matrix-cap-lifetime", + "component_role": "reading_rule_record", + "author_provider": "Anthropic", + "source": "reviews/d1_chain_reconciliation_20260928/", + "ledger_items": [ + "S11", + "S12", + "R-W1", + "R-embedding-radius" + ], + "review_basis": [ + { + "review": "C2", + "provider": "Anthropic", + "verdict": "ACCEPT", + "depth": "full", + "item": "S11, S12 (record section 6)" + }, + { + "item": "R-W1", + "raised_in": "C1", + "raised_by_provider": "Anthropic", + "discharged_in": "RECONCILIATION.md section 5" + }, + { + "item": "R-embedding-radius", + "raised_in": "G3", + "raised_by_provider": "xAI", + "discharged_in": "RECONCILIATION.md section 5" + } + ], + "technical_checks_non_discharge": [ + { + "review": "https://github.com/d6g8k5htny-coder/Math-/pull/126#pullrequestreview-5345687857", + "provider": "OpenAI", + "role": "author provider of the parent; A4, section 12 and register binding; never discharge" + } + ], + "review_source": "reviews/d1_chain_reconciliation_20260928/LEDGER.json", + "scope": "nonauthor record binding the reading rule (E1, E2, W1, r < L/(4 sqrt 2)) and the interface-to-review ledger; the whole directory is bound" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.lifetime-remainder", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "2140af7e42be08fcdf84d14b907dd4cc7d0e677d7577e4f198b9f0983ed44fc9", + "exact_boundary": { + "node_id": "math.lifetime-remainder", + "kind": "candidate", + "scope": "Theorem R at its stated existential O(1)-remainder scope; no numerical constants or radii", + "source": "frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "fingerprint": "380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a", + "notes": "Imports named #63 interfaces (D1-A-E); not parent collapse; does not consume Theorem A (1.1)", + "classification_preserved": "AUTHOR_SIDE_CANDIDATE", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D2", + "kind": "candidate", + "classification": "AUTHOR_SIDE_CANDIDATE", + "controlling": false, + "review_issue": 67, + "fingerprint": "380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a", + "source": "frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "notes": "Imports named #63 interfaces (D1-A-E); not parent collapse; does not consume Theorem A (1.1)", + "review_disposition": "ACCEPT", + "review_provider": "xAI/Grok via Cursor", + "review_source": "https://github.com/d6g8k5htny-coder/main/issues/67#issuecomment-5841782206", + "scope": "Theorem R at its stated existential O(1)-remainder scope; no numerical constants or radii" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.side24-coefficient", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "3b105b8cc7f4da740fcd9fe5799b06a2d067a12c3ccf214d9c0ca3a84d9c5505", + "exact_boundary": { + "node_id": "math.side24-coefficient", + "kind": "candidate", + "scope": "coefficient calculation for SIDE24 d=2,3; persistence reading via reconciled parent Theorem C; no finite-radius band", + "source": "coefficients/side24_v1/PROOF.md", + "fingerprint": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769", + "notes": "Evaluates parent Eq15.2; parent reconciled in reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "classification_preserved": "AUTHOR_SIDE_CANDIDATE", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D3", + "kind": "candidate", + "classification": "AUTHOR_SIDE_CANDIDATE", + "controlling": false, + "review_issue": 65, + "fingerprint": "c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769", + "source": "coefficients/side24_v1/PROOF.md", + "notes": "Evaluates parent Eq15.2; parent reconciled in reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "review_disposition": "ACCEPT", + "review_provider": "xAI/Grok via Cursor", + "review_source": "https://github.com/d6g8k5htny-coder/main/issues/65#issuecomment-5841269490", + "scope": "coefficient calculation for SIDE24 d=2,3; persistence reading via reconciled parent Theorem C; no finite-radius band" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-count-interface", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "aff41c03524a37ca053c815ae28b3fe3bebd8179883ef51372c4cf871413582b", + "exact_boundary": { + "node_id": "math.rn-count-interface", + "kind": "candidate", + "scope": null, + "source": "frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md", + "fingerprint": "aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab", + "notes": "Probability-to-count interface; not an expected-count rate", + "classification_preserved": "AUTHOR_SIDE_CANDIDATE", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D4", + "kind": "candidate", + "classification": "AUTHOR_SIDE_CANDIDATE", + "controlling": false, + "review_issue": 67, + "fingerprint": "aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab", + "source": "frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md", + "notes": "Probability-to-count interface; not an expected-count rate" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-fixed-remote-window", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "985642cad7ffde27aa3d255da60aee583fcc3181023b2ef272d66b660e777b37", + "exact_boundary": { + "node_id": "math.rn-fixed-remote-window", + "kind": "candidate", + "scope": null, + "source": "frontiers/remote_window_20260924/PROOF.md", + "fingerprint": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "notes": "Cubic mean on fixed spatial exclusion and between-pin height window", + "classification_preserved": "AUTHOR_SIDE_CANDIDATE", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D4", + "kind": "candidate", + "classification": "AUTHOR_SIDE_CANDIDATE", + "controlling": false, + "review_issue": 76, + "fingerprint": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "source": "frontiers/remote_window_20260924/PROOF.md", + "notes": "Cubic mean on fixed spatial exclusion and between-pin height window" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-region.fixed-remote", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "d4d82eeacecceb62500b916a3afbfa510e476194a2fb5b61b5bbf35aacbe511d", + "exact_boundary": { + "node_id": "math.rn-region.fixed-remote", + "kind": "region", + "scope": null, + "source": null, + "fingerprint": "dist>=rho and between-pin height", + "notes": "Covered by rn-fixed-remote-window candidate only", + "classification_preserved": "COVERED_BY_CANDIDATE", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D4", + "kind": "region", + "classification": "COVERED_BY_CANDIDATE", + "controlling": false, + "fingerprint": "dist>=rho and between-pin height", + "notes": "Covered by rn-fixed-remote-window candidate only", + "coverage_source": "math.rn-fixed-remote-window" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-region.mesoscopic-scaled-annulus", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "84a2cae422bf02350bd717e239cedbe76dbd9db0822840e0a605684f1fcd0524", + "exact_boundary": { + "node_id": "math.rn-region.mesoscopic-scaled-annulus", + "kind": "region", + "scope": "D5-d with R >= B (covers the reviewed fixed annulus)", + "source": null, + "fingerprint": "x=r y with A<=|y|<=B away from pins", + "notes": "Reviewed only at D5-d with R >= B (covers the reviewed fixed annulus); see the complete D5 reconciliation reading rule. No d>2, numerical, elder-selection, JETMOD, or witness-collision closure.", + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "region", + "classification": "PROVED_REVIEWED", + "controlling": false, + "fingerprint": "x=r y with A<=|y|<=B away from pins", + "notes": "Reviewed only at D5-d with R >= B (covers the reviewed fixed annulus); see the complete D5 reconciliation reading rule. No d>2, numerical, elder-selection, JETMOD, or witness-collision closure.", + "scope": "D5-d with R >= B (covers the reviewed fixed annulus)", + "review_source": "reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "review_disposition": "ACCEPT_AT_STATED_SCOPE", + "reading_rule": [ + "math.d5-component.punctured-pin-proof", + "math.d5-component.punctured-pin-review-111", + "math.d5-component.punctured-pin-continuum-review", + "math.d5-component.punctured-pin-continuum-check", + "math.d5-component.collar-proof", + "math.d5-component.collar-review", + "math.d5-component.annulus-proof", + "math.d5-component.annulus-review" + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-region.pin-collision", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "9830d1d087cbc1d2c5d9760989e583dee2e001ee2d7b4d47edda6aa926985f5d", + "exact_boundary": { + "node_id": "math.rn-region.pin-collision", + "kind": "region", + "scope": "D5-a, D5-b, D5-d", + "source": null, + "fingerprint": "near +-e1/2 scaled pin sites", + "notes": "Reviewed only at D5-a, D5-b, D5-d; see the complete D5 reconciliation reading rule. No d>2, numerical, elder-selection, JETMOD, or witness-collision closure.", + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "region", + "classification": "PROVED_REVIEWED", + "controlling": false, + "fingerprint": "near +-e1/2 scaled pin sites", + "notes": "Reviewed only at D5-a, D5-b, D5-d; see the complete D5 reconciliation reading rule. No d>2, numerical, elder-selection, JETMOD, or witness-collision closure.", + "scope": "D5-a, D5-b, D5-d", + "review_source": "reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "review_disposition": "ACCEPT_AT_STATED_SCOPE", + "reading_rule": [ + "math.d5-component.punctured-pin-proof", + "math.d5-component.punctured-pin-review-111", + "math.d5-component.punctured-pin-continuum-review", + "math.d5-component.punctured-pin-continuum-check", + "math.d5-component.collar-proof", + "math.d5-component.collar-review" + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-region.intermediate-r-to-rho", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "8e61d5d5696016628bac6c061508a29e61ac9d5857434b8d870ba7dc04ac7dc6", + "exact_boundary": { + "node_id": "math.rn-region.intermediate-r-to-rho", + "kind": "region", + "scope": "D5-e (I3/I4, window I_r)", + "source": null, + "fingerprint": "r<<|x|<2, numerical, elder-selection, JETMOD, or witness-collision closure.", + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "region", + "classification": "PROVED_REVIEWED", + "controlling": false, + "fingerprint": "r<<|x|<2, numerical, elder-selection, JETMOD, or witness-collision closure.", + "scope": "D5-e (I3/I4, window I_r)", + "review_source": "reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "review_disposition": "ACCEPT_AT_STATED_SCOPE", + "reading_rule": [ + "math.d5-component.intermediate-window-proof", + "math.d5-component.i5-review-xai", + "math.d5-component.i5-review-claude" + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-region.witness-collision", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "fcd92ee2dc1c2a40eba7c25109be6717008bd2f6d51772df3bfedb70de112df9", + "exact_boundary": { + "node_id": "math.rn-region.witness-collision", + "kind": "region", + "scope": "catalog C6", + "source": null, + "fingerprint": "eta->0 mutual witness separation", + "notes": "Off-pin fixed-separation second-moment evidence is reviewed and sharp global order is reviewed and merged through Math-#145, but the regional shrinking pin/witness-collision mechanism and its source-bound graph fold remain open.", + "classification_preserved": "OPEN_ACTIVE", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "region", + "classification": "OPEN_ACTIVE", + "controlling": false, + "fingerprint": "eta->0 mutual witness separation", + "notes": "Off-pin fixed-separation second-moment evidence is reviewed and sharp global order is reviewed and merged through Math-#145, but the regional shrinking pin/witness-collision mechanism and its source-bound graph fold remain open.", + "scope": "catalog C6", + "review_source": "reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "review_disposition": "OPEN", + "reading_rule": [ + "math.d5-component.offpin-second-moment-review" + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-mesoscopic-reduction", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "5b275fc55363ea42c790e05ae761829f0c7b9a14d3c6ee6a850f7a3c57fb17a2", + "exact_boundary": { + "node_id": "math.rn-mesoscopic-reduction", + "kind": "candidate", + "scope": null, + "source": "external:Math-PR7", + "fingerprint": "Math-PR7-draft", + "notes": "Legacy author-side PR7 route. Regionally superseded/nonblocking for the reviewed fixed-annulus between-pin height-window subregion; still unresolved for scopes outside that theorem.", + "classification_preserved": "AUTHOR_SIDE_REDUCTION", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "candidate", + "classification": "AUTHOR_SIDE_REDUCTION", + "controlling": false, + "fingerprint": "Math-PR7-draft", + "source": "external:Math-PR7", + "notes": "Legacy author-side PR7 route. Regionally superseded/nonblocking for the reviewed fixed-annulus between-pin height-window subregion; still unresolved for scopes outside that theorem." + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.p15-full-price", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "c3b44d8c8b3bbaa9943cb68c58dad7408eebef88178b73ab18d6a82c34eef11e", + "exact_boundary": { + "node_id": "math.p15-full-price", + "kind": "candidate", + "scope": null, + "source": "frontiers/full_price_20260924/PROOF.md", + "fingerprint": "full-price-20260924", + "notes": "Full probability cube under demand>=2; review open. Price-boundary refutation is a scope boundary, not a required premise.", + "classification_preserved": "AUTHOR_SIDE_CANDIDATE", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D6", + "kind": "candidate", + "classification": "AUTHOR_SIDE_CANDIDATE", + "controlling": false, + "review_issue": 74, + "fingerprint": "full-price-20260924", + "source": "frontiers/full_price_20260924/PROOF.md", + "notes": "Full probability cube under demand>=2; review open. Price-boundary refutation is a scope boundary, not a required premise." + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.p15-price-boundary", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "9d37f5378aa3508b60b2c041d026a90d21b493777ebd093a60eaba4f25c24932", + "exact_boundary": { + "node_id": "math.p15-price-boundary", + "kind": "candidate", + "scope": null, + "source": "frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md", + "fingerprint": "498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b", + "notes": "Unrestricted same-palette transformed-price extension is false", + "classification_preserved": "REFUTED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D6", + "kind": "candidate", + "classification": "REFUTED", + "controlling": false, + "fingerprint": "498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b", + "source": "frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md", + "notes": "Unrestricted same-palette transformed-price extension is false" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:eng.hard-gate", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "4b83a382a245702a493133d45782e0833ea1de48a64a1b4763759cf4f0bb3ed5", + "exact_boundary": { + "node_id": "eng.hard-gate", + "kind": "integrity_control", + "scope": null, + "source": "frontiers/downstream_gate_20260925/", + "fingerprint": "downstream-hard-gate-20260925-v1", + "notes": "This package; never mathematical discharge", + "classification_preserved": "ENGINEERING_CONTROL", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D7", + "kind": "integrity_control", + "classification": "ENGINEERING_CONTROL", + "controlling": false, + "fingerprint": "downstream-hard-gate-20260925-v1", + "source": "frontiers/downstream_gate_20260925/", + "notes": "This package; never mathematical discharge" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:eng.main-pr87-crosswalk", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "9447b4523c5894e5624df23cebcd50058489015093dc5422a984209ce954f2ce", + "exact_boundary": { + "node_id": "eng.main-pr87-crosswalk", + "kind": "engineering", + "scope": null, + "source": "https://github.com/d6g8k5htny-coder/main/pull/87", + "fingerprint": "main-PR87-3d4969ab-ci-unexpected-file", + "notes": "Human D0 crosswalk exists; math_status_check rejects unlisted file until allowlist patch lands", + "classification_preserved": "HOLD", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D0", + "kind": "engineering", + "classification": "HOLD", + "controlling": false, + "fingerprint": "main-PR87-3d4969ab-ci-unexpected-file", + "source": "https://github.com/d6g8k5htny-coder/main/pull/87", + "notes": "Human D0 crosswalk exists; math_status_check rejects unlisted file until allowlist patch lands" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:eng.d0-packet-allowlist-fix", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "9a1fbf292deffb6efc2a59cf10284ac7fb726446289ec8829f2847500b8ec9dc", + "exact_boundary": { + "node_id": "eng.d0-packet-allowlist-fix", + "kind": "engineering", + "scope": null, + "source": "frontiers/downstream_gate_20260925/patches/d0_packet_allowlist.patch", + "fingerprint": "84b7ad724e4da1c5b4b396c90ae03d4ddedc37771a6e45e1082a45fd80d7ff4a", + "notes": "Portable fix verified locally; Cursor cannot push to main (403); awaiting agent/owner with write", + "classification_preserved": "AUTHOR_SIDE_CANDIDATE", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D7", + "kind": "engineering", + "classification": "AUTHOR_SIDE_CANDIDATE", + "controlling": false, + "fingerprint": "84b7ad724e4da1c5b4b396c90ae03d4ddedc37771a6e45e1082a45fd80d7ff4a", + "source": "frontiers/downstream_gate_20260925/patches/d0_packet_allowlist.patch", + "notes": "Portable fix verified locally; Cursor cannot push to main (403); awaiting agent/owner with write" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-selector-region-crosswalk", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "b17a8f3e9fb4d1242afaeaaa49c5274179036fd1f2d463bd642afd51eb3ca132", + "exact_boundary": { + "node_id": "math.rn-selector-region-crosswalk", + "kind": "inventory", + "scope": null, + "source": "frontiers/downstream_gate_20260925/SELECTOR_REGION.json", + "fingerprint": "rn-selector-region-crosswalk-20260925-v1", + "notes": "Maps historical selectors onto fixed-remote vs open complements", + "classification_preserved": "ENGINEERING_CONTROL", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D4", + "kind": "inventory", + "classification": "ENGINEERING_CONTROL", + "controlling": false, + "fingerprint": "rn-selector-region-crosswalk-20260925-v1", + "source": "frontiers/downstream_gate_20260925/SELECTOR_REGION.json", + "notes": "Maps historical selectors onto fixed-remote vs open complements" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-fixed-annulus-window", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "5457e921b58b2831de4897fbdb24359cfa19e744c99d8ff68208d537857c1271", + "exact_boundary": { + "node_id": "math.rn-fixed-annulus-window", + "kind": "candidate", + "scope": "d=2; fixed L; fixed scaled annulus 10; all frames; between-pin height window", + "source": "frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md", + "fingerprint": "081abc13c5e66342c13df2af2bd6b114f320486f", + "notes": "Source-bound xAI/Grok technical ACCEPT at exact scoped theorem only. No global D5/RN/JETMOD, k->0, d>=3, pin-neighborhood, intermediate-scale, collision, or elder-selection closure.", + "classification_preserved": "AUTHOR_SIDE_CANDIDATE", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "candidate", + "classification": "AUTHOR_SIDE_CANDIDATE", + "controlling": false, + "fingerprint": "081abc13c5e66342c13df2af2bd6b114f320486f", + "source": "frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md", + "review_source": "reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md", + "scope": "d=2; fixed L; fixed scaled annulus 10; all frames; between-pin height window", + "notes": "Source-bound xAI/Grok technical ACCEPT at exact scoped theorem only. No global D5/RN/JETMOD, k->0, d>=3, pin-neighborhood, intermediate-scale, collision, or elder-selection closure.", + "review_disposition": "ACCEPT", + "review_provider": "xAI/Grok via Cursor", + "scientific_status_unchanged": true + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.rn-region.fixed-annulus-window", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "a920f62640573a26b51f4e1879a572f2262a7ada01d15330054e00728d04664e", + "exact_boundary": { + "node_id": "math.rn-region.fixed-annulus-window", + "kind": "region", + "scope": null, + "source": null, + "fingerprint": "fixed-d2-annulus-between-pin-window-reviewed", + "notes": "Covered by math.rn-fixed-annulus-window only at its exact declared scope.", + "classification_preserved": "COVERED_BY_CANDIDATE", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "region", + "classification": "COVERED_BY_CANDIDATE", + "controlling": false, + "fingerprint": "fixed-d2-annulus-between-pin-window-reviewed", + "notes": "Covered by math.rn-fixed-annulus-window only at its exact declared scope.", + "review_disposition": "ACCEPT_AT_SCOPED_SOURCE", + "coverage_source": "math.rn-fixed-annulus-window" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:regional.fixed-annulus.high-jet-route", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "a3834c3666c396a54b4751f4e35e7e4138a6c452fbb725a54e0d99c20d6de792", + "exact_boundary": { + "node_id": "regional.fixed-annulus.high-jet-route", + "kind": "regional_supersession", + "scope": "fixed d=2 scaled annulus; compact positive gaps; between-pin height window", + "source": null, + "fingerprint": "regional-bypass-fixed-annulus-window-v1", + "notes": "For this scope only, the reviewed analytic route bypasses CH-LIFT / Piece-2 / OBL-H5-JETMOD. Historical predicates remain OPEN/ABSENT in their original replay scopes.", + "classification_preserved": "SUPERSEDED_NONBLOCKING", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D0", + "kind": "regional_supersession", + "classification": "SUPERSEDED_NONBLOCKING", + "controlling": false, + "fingerprint": "regional-bypass-fixed-annulus-window-v1", + "scope": "fixed d=2 scaled annulus; compact positive gaps; between-pin height window", + "notes": "For this scope only, the reviewed analytic route bypasses CH-LIFT / Piece-2 / OBL-H5-JETMOD. Historical predicates remain OPEN/ABSENT in their original replay scopes." + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-pin-neighborhood-first-moment", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "3a3141dcb29e929afbad05c54d3d0b234f5d2b72526b48801f7c04ab89d5b545", + "exact_boundary": { + "node_id": "math.d5-pin-neighborhood-first-moment", + "kind": "candidate", + "scope": "D5-a..D5-f of RECONCILIATION.md section 2; existential constants; fixed T; compact marks with k >= k_- > 0; d = 2", + "source": "reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "fingerprint": null, + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "candidate", + "classification": "PROVED_REVIEWED", + "controlling": false, + "scope": "D5-a..D5-f of RECONCILIATION.md section 2; existential constants; fixed T; compact marks with k >= k_- > 0; d = 2", + "source": "reviews/d5_reconciliation_20260929/RECONCILIATION.md" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.punctured-pin-proof", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "896e174856262c260b79c45640e4449e99a06b65a7374b5bf84df71ac0c7e273", + "exact_boundary": { + "node_id": "math.d5-component.punctured-pin-proof", + "kind": "reading_rule_component", + "scope": null, + "source": "reviews/d5_local_collar_20260928/PUNCTURED_PIN_PROOF.md", + "fingerprint": "f972e50bc07674ebce9d971d1a1bd4dba2f8036dde37ecb57d8a44a35650f76a", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "proof", + "author_provider": "OpenAI", + "fingerprint": "f972e50bc07674ebce9d971d1a1bd4dba2f8036dde37ecb57d8a44a35650f76a", + "source": "reviews/d5_local_collar_20260928/PUNCTURED_PIN_PROOF.md", + "review_basis": [ + { + "review": "#111", + "provider": "xAI", + "verdict": "ACCEPT algebra; continuum HOLD", + "depth": "algebraic" + }, + { + "review": "d5_punctured_pin_continuum_claude_20260929", + "provider": "Anthropic", + "verdict": "ACCEPT existential", + "depth": "full" + } + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.punctured-pin-review-111", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "a787ab9a5d0a0609b6dd9420e9eb2d4a33076275c0b9d7baadac94a685c3ecac", + "exact_boundary": { + "node_id": "math.d5-component.punctured-pin-review-111", + "kind": "reading_rule_component", + "scope": null, + "source": "reviews/d5_punctured_pin_nonauthor_20260928/REVIEW.md", + "fingerprint": "668d74825f156c929177bc1a3481cf421de4dd7874e7b25b2aece6c10aa7dc0e", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "review_record", + "author_provider": "xAI", + "fingerprint": "668d74825f156c929177bc1a3481cf421de4dd7874e7b25b2aece6c10aa7dc0e", + "source": "reviews/d5_punctured_pin_nonauthor_20260928/REVIEW.md" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.punctured-pin-continuum-review", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "a73fa333816225da5291fd7de6ce6ade7c76f96101adef174375d4a61ea41d38", + "exact_boundary": { + "node_id": "math.d5-component.punctured-pin-continuum-review", + "kind": "reading_rule_component", + "scope": null, + "source": "reviews/d5_punctured_pin_continuum_claude_20260929/REVIEW.md", + "fingerprint": "124c472cc064ba24021cb4bb8da1002836a4ce26c8df506228f5c20609f6575a", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "review_record", + "author_provider": "Anthropic", + "fingerprint": "124c472cc064ba24021cb4bb8da1002836a4ce26c8df506228f5c20609f6575a", + "source": "reviews/d5_punctured_pin_continuum_claude_20260929/REVIEW.md" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.punctured-pin-continuum-check", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "9684e7bbc96bc323ac11249d85bd5719e17440dae3e39ce758e7762f15194675", + "exact_boundary": { + "node_id": "math.d5-component.punctured-pin-continuum-check", + "kind": "reading_rule_component", + "scope": null, + "source": "reviews/d5_punctured_pin_continuum_claude_20260929/pp_continuum_check.py", + "fingerprint": "57bc87d11271b47ebccec6ea73abf823fa90e3a8c3c7d7cd2165bdc6f7e4175c", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "review_checker", + "author_provider": "Anthropic", + "fingerprint": "57bc87d11271b47ebccec6ea73abf823fa90e3a8c3c7d7cd2165bdc6f7e4175c", + "source": "reviews/d5_punctured_pin_continuum_claude_20260929/pp_continuum_check.py" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.collar-proof", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "71c23682b47d96dbc9248772a35c827cef4d68164f63aa0d44a3c73577e7e925", + "exact_boundary": { + "node_id": "math.d5-component.collar-proof", + "kind": "reading_rule_component", + "scope": null, + "source": "reviews/d5_local_collar_20260928/COLLAR_PROOF.md", + "fingerprint": "794babe0fd039c3a93c401c0b8978316331af009fad45f953e63fbe7e1e31aab", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "proof", + "author_provider": "OpenAI", + "fingerprint": "794babe0fd039c3a93c401c0b8978316331af009fad45f953e63fbe7e1e31aab", + "source": "reviews/d5_local_collar_20260928/COLLAR_PROOF.md", + "review_basis": [ + { + "review": "d5_collar_count_20260928", + "provider": "not named in record", + "verdict": "ACCEPT existential", + "depth": "full" + }, + { + "review": "Math-#105 comment 5872932723 (external)", + "provider": "Anthropic", + "verdict": "CONFIRMED", + "depth": "full" + } + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.collar-review", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "60351618f4da42d9e6b8d8f7f57897eca21b31ebdca7d9221670a727cef13e51", + "exact_boundary": { + "node_id": "math.d5-component.collar-review", + "kind": "reading_rule_component", + "scope": null, + "source": "reviews/d5_collar_count_20260928/REVIEW.md", + "fingerprint": "8c8c30cc3b19601a7421341d5da8cb6c982fbc1fcc5ae4791acafa11cc81ee4e", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "review_record", + "author_provider": "not named in record", + "fingerprint": "8c8c30cc3b19601a7421341d5da8cb6c982fbc1fcc5ae4791acafa11cc81ee4e", + "source": "reviews/d5_collar_count_20260928/REVIEW.md" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.annulus-proof", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "8577d83cc635240f86f91caef814d4cf9bb93dd86aa73f3ab4d5de7aa386bdc8", + "exact_boundary": { + "node_id": "math.d5-component.annulus-proof", + "kind": "reading_rule_component", + "scope": null, + "source": "frontiers/rn_annulus_bridge_20260925/PROOF.md", + "fingerprint": "d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "proof", + "author_provider": "OpenAI", + "fingerprint": "d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05", + "source": "frontiers/rn_annulus_bridge_20260925/PROOF.md", + "review_basis": [ + { + "review": "pr28_annulus_bridge_nonauthor_20260925", + "provider": "xAI", + "verdict": "ACCEPT R1-R7", + "depth": "full" + } + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.annulus-review", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "ffa54f6d4c4d1c7ff53f2df6f6ff9dbd7601c274a341cd943f26eaf9bcb2673f", + "exact_boundary": { + "node_id": "math.d5-component.annulus-review", + "kind": "reading_rule_component", + "scope": null, + "source": "reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md", + "fingerprint": "69ea7a479a9e8a5150cbe07b373772ab22413a1d81194d5a6a78adf6ada5f03f", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "review_record", + "author_provider": "xAI", + "fingerprint": "69ea7a479a9e8a5150cbe07b373772ab22413a1d81194d5a6a78adf6ada5f03f", + "source": "reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.intermediate-window-proof", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "86e58a3c61a18692265fb59e26ebd16e2d14317f5d626240fe4c6dc266fee30b", + "exact_boundary": { + "node_id": "math.d5-component.intermediate-window-proof", + "kind": "reading_rule_component", + "scope": null, + "source": "frontiers/intermediate_window_20260928/PROOF.md", + "fingerprint": "b3eb9456d7058b5b78149cfca4e072679beda85cd1a0293d209664a542db66cf", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "proof", + "author_provider": "OpenAI", + "fingerprint": "b3eb9456d7058b5b78149cfca4e072679beda85cd1a0293d209664a542db66cf", + "source": "frontiers/intermediate_window_20260928/PROOF.md", + "review_basis": [ + { + "review": "d5_i5_planar_f_20260928", + "provider": "xAI", + "verdict": "ACCEPT existential", + "depth": "full" + }, + { + "review": "d5_intermediate_window_claude_20260928", + "provider": "Anthropic", + "verdict": "ACCEPT", + "depth": "full" + } + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.i5-review-xai", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "a8a7654480440d8d902d799694dc13a7ab4e9a3c6672fc6b367c8432062ff2e3", + "exact_boundary": { + "node_id": "math.d5-component.i5-review-xai", + "kind": "reading_rule_component", + "scope": null, + "source": "reviews/d5_i5_planar_f_20260928/REVIEW.md", + "fingerprint": "527d66e72b079ef7c854987f7e9d44f2252b81aa0e8d9e7ef3b45deb02388659", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "review_record", + "author_provider": "xAI", + "fingerprint": "527d66e72b079ef7c854987f7e9d44f2252b81aa0e8d9e7ef3b45deb02388659", + "source": "reviews/d5_i5_planar_f_20260928/REVIEW.md" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.i5-review-claude", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "c6787507fb57ae969a8fceb019563946c406bd655b43c08f66c038a5e774bac4", + "exact_boundary": { + "node_id": "math.d5-component.i5-review-claude", + "kind": "reading_rule_component", + "scope": null, + "source": "reviews/d5_intermediate_window_claude_20260928/REVIEW.md", + "fingerprint": "fb3207802bf2d92ad138bc338a36f39bcd3a94440669b9aba9558e566f767976", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "review_record", + "author_provider": "Anthropic", + "fingerprint": "fb3207802bf2d92ad138bc338a36f39bcd3a94440669b9aba9558e566f767976", + "source": "reviews/d5_intermediate_window_claude_20260928/REVIEW.md" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.remote-window-proof", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "f29a3716e9126e9cabb56d1fa4521951c3053814063a97bb09c4801625692bb8", + "exact_boundary": { + "node_id": "math.d5-component.remote-window-proof", + "kind": "reading_rule_component", + "scope": null, + "source": "frontiers/remote_window_20260924/PROOF.md", + "fingerprint": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.d5-pin-neighborhood-first-moment", + "component_role": "proof", + "author_provider": "OpenAI", + "fingerprint": "a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7", + "source": "frontiers/remote_window_20260924/PROOF.md", + "review_basis": [ + { + "review": "STATUS D4 (main#76, external)", + "provider": "nonauthor", + "verdict": "ACCEPT", + "depth": "full" + } + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GRAPH:math.d5-component.offpin-second-moment-review", + "category": "current_math_graph_application", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/downstream_gate_20260925/GRAPH.json", + "sha256": "8822e9618678321a342d69cd0b8ae6552de1b5d578c331de5072b2892ee9dd09" + } + ], + "source_record_sha256": "6b892ef33799a6d4c8153b28f735fe20612c307f57957e3312f295753feea53a", + "exact_boundary": { + "node_id": "math.d5-component.offpin-second-moment-review", + "kind": "reading_rule_component", + "scope": null, + "source": "reviews/d5_offpin_second_moment_20260928/REVIEW.md", + "fingerprint": "43beb4ef7da5bf71e15164d5c4bc1862db387d83f906aebdf9831625b1ca6369", + "notes": null, + "classification_preserved": "PROVED_REVIEWED", + "full_original_record_preserved": true + }, + "reason": "The graph record carries historical/source classifications, including absent carriers and definitions. No current exact-application kernel certificate aligned to this entire record and its carrier/model has been established by this contribution.", + "attempts": [ + "Preserved full exact 49-node GRAPH and all edges, source/reviewer fields, fingerprints, absent-carrier labels and notes.", + "Compared contribution scope against 16 source-bound Math runtime/semantic groups and seven statement-alignment gaps; no current whole-Math execution claimed." + ], + "original_record": { + "layer": "D5", + "kind": "reading_rule_component", + "classification": "PROVED_REVIEWED", + "controlling": false, + "component_of": "math.rn-region.witness-collision", + "component_role": "review_record", + "author_provider": "nonauthor", + "fingerprint": "43beb4ef7da5bf71e15164d5c4bc1862db387d83f906aebdf9831625b1ca6369", + "source": "reviews/d5_offpin_second_moment_20260928/REVIEW.md" + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:companions/d2_atom_integral_20261006", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_atom_integral_20261006/Contract.lean", + "sha256": "746523ec422f3325029bb476f254b8d584692534f9cde00d95901209e6d81ccb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_atom_integral_20261006/D2AtomIntegral.lean", + "sha256": "247507c4b7aeaccc033cd4d648442172d61227bb27239a7dacccd0f2fa1ba6c3" + } + ], + "source_record_sha256": "518c41dfe59b9d30420a3a70d5623851afdabe9f6cb30b7bb334593c99d0c0f8", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "companions/d2_atom_integral_20261006", + "source_files": [ + { + "path": "companions/d2_atom_integral_20261006/Contract.lean", + "sha256": "746523ec422f3325029bb476f254b8d584692534f9cde00d95901209e6d81ccb", + "declarations_lexical": [] + }, + { + "path": "companions/d2_atom_integral_20261006/D2AtomIntegral.lean", + "sha256": "247507c4b7aeaccc033cd4d648442172d61227bb27239a7dacccd0f2fa1ba6c3", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "two_event_integral_lower", + "line": 17, + "source_header": "]\n\ntheorem two_event_integral_lower (μ : Measure Ω) [IsProbabilityMeasure μ] (f : Ω → ℝ)\n (S T : Set Ω) (hS : MeasurableSet S) (hT : MeasurableSet T)\n (hST : Disjoint S T) (hf : Integrable f μ) (hf0 : ∀ w, 0 ≤ f w)\n (a b : ℝ) (ha : ∀ w ∈ S, a ≤ f w) (hb : ∀ w ∈ T, b ≤ f w) :\n μ.real S * a + μ.real T * b ≤ ∫ w, f w ∂" + }, + { + "kind": "theorem", + "unqualified_name": "two_radius_integral_lower", + "line": 46, + "source_header": "e\n\ntheorem two_radius_integral_lower (μ : Measure Ω) [IsProbabilityMeasure μ] (X f : Ω → ℝ)\n (s t p q a b : ℝ)\n (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t}) (hst : s ≠ t)\n (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})\n (ha0 : 0 ≤ a) (hb0 : 0 ≤ b) (hf : Integrable f μ) (hf0 : ∀ w, 0 ≤ f w)\n (ha : ∀ w, X w ^ 2 = s → f w = a) (hb : ∀ w, X w ^ 2 = t → f w = b) :\n p * a + q * b ≤ ∫ w, f w ∂" + }, + { + "kind": "theorem", + "unqualified_name": "second_moment_floor", + "line": 63, + "source_header": ")\n\ntheorem second_moment_floor (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (s t p q : ℝ) (hs : 0 < s) (ht : 0 < t) (hst : s ≠ t)\n (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) μ) :\n p*s + q*t ≤ moment μ X" + }, + { + "kind": "theorem", + "unqualified_name": "fourth_gap_floor", + "line": 74, + "source_header": ")\n\ntheorem fourth_gap_floor (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (s t p q : ℝ) (hp0 : 0 < p) (hq0 : 0 < q) (hst : s ≠ t)\n (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ) :\n p*q/(p+q)*(s-t)^2 ≤ moment μ X 4 - (moment μ X 2)^" + }, + { + "kind": "theorem", + "unqualified_name": "residual_moment_floor", + "line": 90, + "source_header": "h\n\ntheorem residual_moment_floor (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (s t p q : ℝ) (hs : 0 < s) (ht : 0 < t) (hp0 : 0 < p) (hq0 : 0 < q)\n (hst : s ≠ t) (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ) :\n (p*s)*(q*t)/(p*s+q*t)*(s-t)^2 ≤\n d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6" + }, + { + "kind": "theorem", + "unqualified_name": "schur_floor_of_radius_masses", + "line": 130, + "source_header": ")\n\ntheorem schur_floor_of_radius_masses (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (s t p q u : ℝ) (hs : 0 < s) (ht : 0 < t) (hp0 : 0 < p) (hq0 : 0 < q)\n (hst : s ≠ t) (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ) (hu0 : 0 ≤ u) (hu1 : u ≤ 1/4) :\n min (p*q/(p+q)*(s-t)^2) (2*(p*s+q*t)^2) ≤\n d2Schur (moment μ X 2) (moment μ X 4)" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:companions/d2_atom_integral_20261006", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "companions/d2_atom_integral_20261006", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "companions/d2_atom_integral_20261006/Contract.lean", + "sha256": "746523ec422f3325029bb476f254b8d584692534f9cde00d95901209e6d81ccb", + "declarations_lexical": [] + }, + { + "path": "companions/d2_atom_integral_20261006/D2AtomIntegral.lean", + "sha256": "247507c4b7aeaccc033cd4d648442172d61227bb27239a7dacccd0f2fa1ba6c3", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "two_event_integral_lower", + "line": 17, + "source_header": "]\n\ntheorem two_event_integral_lower (μ : Measure Ω) [IsProbabilityMeasure μ] (f : Ω → ℝ)\n (S T : Set Ω) (hS : MeasurableSet S) (hT : MeasurableSet T)\n (hST : Disjoint S T) (hf : Integrable f μ) (hf0 : ∀ w, 0 ≤ f w)\n (a b : ℝ) (ha : ∀ w ∈ S, a ≤ f w) (hb : ∀ w ∈ T, b ≤ f w) :\n μ.real S * a + μ.real T * b ≤ ∫ w, f w ∂" + }, + { + "kind": "theorem", + "unqualified_name": "two_radius_integral_lower", + "line": 46, + "source_header": "e\n\ntheorem two_radius_integral_lower (μ : Measure Ω) [IsProbabilityMeasure μ] (X f : Ω → ℝ)\n (s t p q a b : ℝ)\n (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t}) (hst : s ≠ t)\n (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})\n (ha0 : 0 ≤ a) (hb0 : 0 ≤ b) (hf : Integrable f μ) (hf0 : ∀ w, 0 ≤ f w)\n (ha : ∀ w, X w ^ 2 = s → f w = a) (hb : ∀ w, X w ^ 2 = t → f w = b) :\n p * a + q * b ≤ ∫ w, f w ∂" + }, + { + "kind": "theorem", + "unqualified_name": "second_moment_floor", + "line": 63, + "source_header": ")\n\ntheorem second_moment_floor (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (s t p q : ℝ) (hs : 0 < s) (ht : 0 < t) (hst : s ≠ t)\n (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) μ) :\n p*s + q*t ≤ moment μ X" + }, + { + "kind": "theorem", + "unqualified_name": "fourth_gap_floor", + "line": 74, + "source_header": ")\n\ntheorem fourth_gap_floor (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (s t p q : ℝ) (hp0 : 0 < p) (hq0 : 0 < q) (hst : s ≠ t)\n (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ) :\n p*q/(p+q)*(s-t)^2 ≤ moment μ X 4 - (moment μ X 2)^" + }, + { + "kind": "theorem", + "unqualified_name": "residual_moment_floor", + "line": 90, + "source_header": "h\n\ntheorem residual_moment_floor (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (s t p q : ℝ) (hs : 0 < s) (ht : 0 < t) (hp0 : 0 < p) (hq0 : 0 < q)\n (hst : s ≠ t) (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ) :\n (p*s)*(q*t)/(p*s+q*t)*(s-t)^2 ≤\n d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6" + }, + { + "kind": "theorem", + "unqualified_name": "schur_floor_of_radius_masses", + "line": 130, + "source_header": ")\n\ntheorem schur_floor_of_radius_masses (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (s t p q u : ℝ) (hs : 0 < s) (ht : 0 < t) (hp0 : 0 < p) (hq0 : 0 < q)\n (hst : s ≠ t) (hS : MeasurableSet {w | X w ^ 2 = s})\n (hT : MeasurableSet {w | X w ^ 2 = t})\n (hp : p ≤ μ.real {w | X w ^ 2 = s}) (hq : q ≤ μ.real {w | X w ^ 2 = t})\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ) (hu0 : 0 ≤ u) (hu1 : u ≤ 1/4) :\n min (p*q/(p+q)*(s-t)^2) (2*(p*s+q*t)^2) ≤\n d2Schur (moment μ X 2) (moment μ X 4)" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:companions/d2_moment_bridge_20261006", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_moment_bridge_20261006/D2MomentBridge.lean", + "sha256": "cde3bbd96eb29eb9ab7ff1448ffab1f794fb2b80355ac618800155eea6ccc42f" + } + ], + "source_record_sha256": "05fd8a78c5da3bc0105de8b9f5edf7698e5a68b380e24c1b0969239d7dbfef7c", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "companions/d2_moment_bridge_20261006", + "source_files": [ + { + "path": "companions/d2_moment_bridge_20261006/D2MomentBridge.lean", + "sha256": "cde3bbd96eb29eb9ab7ff1448ffab1f794fb2b80355ac618800155eea6ccc42f", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "moment", + "line": 21, + "source_header": "]\n\ndef moment (μ : Measure Ω) (X : Ω → ℝ) (n : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "cubicResidual", + "line": 23, + "source_header": "μ\n\ndef cubicResidual (c x : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "residual_sq_expand", + "line": 25, + "source_header": "x\n\ntheorem residual_sq_expand (c x : ℝ) :\n cubicResidual c x ^ 2 = x ^ 6 - (2 * c) * x ^ 4 + c ^ 2 * x ^" + }, + { + "kind": "theorem", + "unqualified_name": "residual_sq_integrable", + "line": 30, + "source_header": "g\n\ntheorem residual_sq_integrable (μ : Measure Ω) (X : Ω → ℝ) (c : ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ) :\n Integrable (fun w => cubicResidual c (X w) ^ 2)" + }, + { + "kind": "theorem", + "unqualified_name": "residual_integral_eq_delta", + "line": 38, + "source_header": ")\n\n/-- The exact residual identity; integrability prevents Bochner totalization. -/\ntheorem residual_integral_eq_delta (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (hm2 : moment μ X 2 ≠ 0) :\n (∫ w, cubicResidual (moment μ X 4 / moment μ X 2) (X w) ^ 2 ∂μ) =\n d2Delta (moment μ X 2) (moment μ X 4) (moment μ X" + }, + { + "kind": "theorem", + "unqualified_name": "delta_nonneg", + "line": 63, + "source_header": "ing\n\ntheorem delta_nonneg (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (hm2 : moment μ X 2 ≠ 0) :\n 0 ≤ d2Delta (moment μ X 2) (moment μ X 4) (moment μ X" + }, + { + "kind": "theorem", + "unqualified_name": "delta_eq_zero_iff_residual", + "line": 72, + "source_header": "_)\n\ntheorem delta_eq_zero_iff_residual (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (hm2 : moment μ X 2 ≠ 0) :\n d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) = 0 ↔\n ∀ᵐ w ∂μ, cubicResidual (moment μ X 4 / moment μ X 2) (X w)" + }, + { + "kind": "theorem", + "unqualified_name": "cubicResidual_eq_zero_iff", + "line": 94, + "source_header": "hw\n\ntheorem cubicResidual_eq_zero_iff (c x : ℝ) :\n cubicResidual c x = 0 ↔ x = 0 ∨ x ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "delta_eq_zero_iff_support", + "line": 101, + "source_header": "ro]\n\n/-- Zero may carry positive mass: the nonzero support, not all |X|, has one radius. -/\ntheorem delta_eq_zero_iff_support (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (hm2 : moment μ X 2 ≠ 0) :\n d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) = 0 ↔\n ∀ᵐ w ∂μ, X w = 0 ∨ X w ^ 2 = moment μ X 4 / moment" + }, + { + "kind": "theorem", + "unqualified_name": "delta_pos_iff_not_support", + "line": 112, + "source_header": "_iff]\n\ntheorem delta_pos_iff_not_support (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (hm2 : moment μ X 2 ≠ 0) :\n 0 < d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) ↔\n ¬ (∀ᵐ w ∂μ, X w = 0 ∨ X w ^ 2 = moment μ X 4 / moment μ" + }, + { + "kind": "theorem", + "unqualified_name": "property_of_ae_of_atom", + "line": 128, + "source_header": "hn))\n\n/-- Positive mass turns an a.e. value property into a property of that atom. -/\ntheorem property_of_ae_of_atom (μ : Measure Ω) (X : Ω → ℝ) (p : ℝ → Prop)\n (h : ∀ᵐ w ∂μ, p (X w)) (a : ℝ) (ha : μ {w | X w = a} ≠ 0" + }, + { + "kind": "theorem", + "unqualified_name": "moment_two_pos_of_atom", + "line": 140, + "source_header": "sing hp\n\ntheorem moment_two_pos_of_atom (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (a : ℝ) (ha0 : a ≠ 0) (ha : μ {w | X w = a} ≠ 0) : 0 < momen" + }, + { + "kind": "theorem", + "unqualified_name": "delta_pos_of_two_atoms", + "line": 152, + "source_header": "mp ha2)\n\ntheorem delta_pos_of_two_atoms (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (a b : ℝ) (ha0 : a ≠ 0) (hb0 : b ≠ 0) (hab : a ^ 2 ≠ b ^ 2)\n (ha : μ {w | X w = a} ≠ 0) (hb : μ {w | X w = b} ≠ 0) :\n 0 < d2Delta (moment μ X 2) (moment μ X 4) (moment" + }, + { + "kind": "theorem", + "unqualified_name": "square_gap_integrable", + "line": 168, + "source_header": ").symm)\n\ntheorem square_gap_integrable (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ) :\n Integrable (fun w => (X w ^ 2 - moment μ X 2)" + }, + { + "kind": "theorem", + "unqualified_name": "square_gap_integral", + "line": 179, + "source_header": "onst _)\n\n/-- Probability normalization is essential for the unscaled m4-m2^2 gap. -/\ntheorem square_gap_integral (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ) :\n (∫ w, (X w ^ 2 - moment μ X 2) ^ 2 ∂μ) = moment μ X 4 - (moment μ" + }, + { + "kind": "theorem", + "unqualified_name": "fourth_gt_second_sq_of_two_atoms", + "line": 198, + "source_header": "_\n ring\n\ntheorem fourth_gt_second_sq_of_two_atoms (μ : Measure Ω) [IsProbabilityMeasure μ]\n (X : Ω → ℝ) (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (a b : ℝ) (hab : a ^ 2 ≠ b ^ 2)\n (ha : μ {w | X w = a} ≠ 0) (hb : μ {w | X w = b} ≠ 0) :\n (moment μ X 2) ^ 2 < mom" + }, + { + "kind": "theorem", + "unqualified_name": "tau_pos_of_two_atoms", + "line": 219, + "source_header": "hb).symm)\n\n/-- The actual-law sufficient assumptions now supply all strict moment premises. -/\ntheorem tau_pos_of_two_atoms (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (a b q : ℝ) (ha0 : a ≠ 0) (hb0 : b ≠ 0) (hab : a ^ 2 ≠ b ^ 2)\n (ha : μ {w | X w = a} ≠ 0) (hb : μ {w | X w = b} ≠ 0)\n (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :\n 0 < d2Tau (moment μ X 2) (moment μ X 4) (mome" + }, + { + "kind": "theorem", + "unqualified_name": "zero_atom_counterexample", + "line": 232, + "source_header": "hb) hq0 hq1\n\n/-- Moments of the zero/+-1 countermodel; the actual finite law is tested separately. -/\ntheorem zero_atom_counterexample :\n (1 / 2 : ℝ) - (1 / 2) ^ 2 = 1 / 4 ∧ d2Delta (1 / 2) (1 / 2" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:companions/d2_moment_bridge_20261006", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "companions/d2_moment_bridge_20261006", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "companions/d2_moment_bridge_20261006/D2MomentBridge.lean", + "sha256": "cde3bbd96eb29eb9ab7ff1448ffab1f794fb2b80355ac618800155eea6ccc42f", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "moment", + "line": 21, + "source_header": "]\n\ndef moment (μ : Measure Ω) (X : Ω → ℝ) (n : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "cubicResidual", + "line": 23, + "source_header": "μ\n\ndef cubicResidual (c x : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "residual_sq_expand", + "line": 25, + "source_header": "x\n\ntheorem residual_sq_expand (c x : ℝ) :\n cubicResidual c x ^ 2 = x ^ 6 - (2 * c) * x ^ 4 + c ^ 2 * x ^" + }, + { + "kind": "theorem", + "unqualified_name": "residual_sq_integrable", + "line": 30, + "source_header": "g\n\ntheorem residual_sq_integrable (μ : Measure Ω) (X : Ω → ℝ) (c : ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ) :\n Integrable (fun w => cubicResidual c (X w) ^ 2)" + }, + { + "kind": "theorem", + "unqualified_name": "residual_integral_eq_delta", + "line": 38, + "source_header": ")\n\n/-- The exact residual identity; integrability prevents Bochner totalization. -/\ntheorem residual_integral_eq_delta (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (hm2 : moment μ X 2 ≠ 0) :\n (∫ w, cubicResidual (moment μ X 4 / moment μ X 2) (X w) ^ 2 ∂μ) =\n d2Delta (moment μ X 2) (moment μ X 4) (moment μ X" + }, + { + "kind": "theorem", + "unqualified_name": "delta_nonneg", + "line": 63, + "source_header": "ing\n\ntheorem delta_nonneg (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (hm2 : moment μ X 2 ≠ 0) :\n 0 ≤ d2Delta (moment μ X 2) (moment μ X 4) (moment μ X" + }, + { + "kind": "theorem", + "unqualified_name": "delta_eq_zero_iff_residual", + "line": 72, + "source_header": "_)\n\ntheorem delta_eq_zero_iff_residual (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (hm2 : moment μ X 2 ≠ 0) :\n d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) = 0 ↔\n ∀ᵐ w ∂μ, cubicResidual (moment μ X 4 / moment μ X 2) (X w)" + }, + { + "kind": "theorem", + "unqualified_name": "cubicResidual_eq_zero_iff", + "line": 94, + "source_header": "hw\n\ntheorem cubicResidual_eq_zero_iff (c x : ℝ) :\n cubicResidual c x = 0 ↔ x = 0 ∨ x ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "delta_eq_zero_iff_support", + "line": 101, + "source_header": "ro]\n\n/-- Zero may carry positive mass: the nonzero support, not all |X|, has one radius. -/\ntheorem delta_eq_zero_iff_support (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (hm2 : moment μ X 2 ≠ 0) :\n d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) = 0 ↔\n ∀ᵐ w ∂μ, X w = 0 ∨ X w ^ 2 = moment μ X 4 / moment" + }, + { + "kind": "theorem", + "unqualified_name": "delta_pos_iff_not_support", + "line": 112, + "source_header": "_iff]\n\ntheorem delta_pos_iff_not_support (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (hm2 : moment μ X 2 ≠ 0) :\n 0 < d2Delta (moment μ X 2) (moment μ X 4) (moment μ X 6) ↔\n ¬ (∀ᵐ w ∂μ, X w = 0 ∨ X w ^ 2 = moment μ X 4 / moment μ" + }, + { + "kind": "theorem", + "unqualified_name": "property_of_ae_of_atom", + "line": 128, + "source_header": "hn))\n\n/-- Positive mass turns an a.e. value property into a property of that atom. -/\ntheorem property_of_ae_of_atom (μ : Measure Ω) (X : Ω → ℝ) (p : ℝ → Prop)\n (h : ∀ᵐ w ∂μ, p (X w)) (a : ℝ) (ha : μ {w | X w = a} ≠ 0" + }, + { + "kind": "theorem", + "unqualified_name": "moment_two_pos_of_atom", + "line": 140, + "source_header": "sing hp\n\ntheorem moment_two_pos_of_atom (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (a : ℝ) (ha0 : a ≠ 0) (ha : μ {w | X w = a} ≠ 0) : 0 < momen" + }, + { + "kind": "theorem", + "unqualified_name": "delta_pos_of_two_atoms", + "line": 152, + "source_header": "mp ha2)\n\ntheorem delta_pos_of_two_atoms (μ : Measure Ω) (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (a b : ℝ) (ha0 : a ≠ 0) (hb0 : b ≠ 0) (hab : a ^ 2 ≠ b ^ 2)\n (ha : μ {w | X w = a} ≠ 0) (hb : μ {w | X w = b} ≠ 0) :\n 0 < d2Delta (moment μ X 2) (moment μ X 4) (moment" + }, + { + "kind": "theorem", + "unqualified_name": "square_gap_integrable", + "line": 168, + "source_header": ").symm)\n\ntheorem square_gap_integrable (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ) :\n Integrable (fun w => (X w ^ 2 - moment μ X 2)" + }, + { + "kind": "theorem", + "unqualified_name": "square_gap_integral", + "line": 179, + "source_header": "onst _)\n\n/-- Probability normalization is essential for the unscaled m4-m2^2 gap. -/\ntheorem square_gap_integral (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ) :\n (∫ w, (X w ^ 2 - moment μ X 2) ^ 2 ∂μ) = moment μ X 4 - (moment μ" + }, + { + "kind": "theorem", + "unqualified_name": "fourth_gt_second_sq_of_two_atoms", + "line": 198, + "source_header": "_\n ring\n\ntheorem fourth_gt_second_sq_of_two_atoms (μ : Measure Ω) [IsProbabilityMeasure μ]\n (X : Ω → ℝ) (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (a b : ℝ) (hab : a ^ 2 ≠ b ^ 2)\n (ha : μ {w | X w = a} ≠ 0) (hb : μ {w | X w = b} ≠ 0) :\n (moment μ X 2) ^ 2 < mom" + }, + { + "kind": "theorem", + "unqualified_name": "tau_pos_of_two_atoms", + "line": 219, + "source_header": "hb).symm)\n\n/-- The actual-law sufficient assumptions now supply all strict moment premises. -/\ntheorem tau_pos_of_two_atoms (μ : Measure Ω) [IsProbabilityMeasure μ] (X : Ω → ℝ)\n (h2 : Integrable (fun w => X w ^ 2) μ)\n (h4 : Integrable (fun w => X w ^ 4) μ)\n (h6 : Integrable (fun w => X w ^ 6) μ)\n (a b q : ℝ) (ha0 : a ≠ 0) (hb0 : b ≠ 0) (hab : a ^ 2 ≠ b ^ 2)\n (ha : μ {w | X w = a} ≠ 0) (hb : μ {w | X w = b} ≠ 0)\n (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :\n 0 < d2Tau (moment μ X 2) (moment μ X 4) (mome" + }, + { + "kind": "theorem", + "unqualified_name": "zero_atom_counterexample", + "line": 232, + "source_header": "hb) hq0 hq1\n\n/-- Moments of the zero/+-1 countermodel; the actual finite law is tested separately. -/\ntheorem zero_atom_counterexample :\n (1 / 2 : ℝ) - (1 / 2) ^ 2 = 1 / 4 ∧ d2Delta (1 / 2) (1 / 2" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:companions/d2_square_schur_20261006", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/D2SquareSchur.lean", + "sha256": "e0f9560e6f129216cd989cea3cdf97254972ca9b1cae7bab57df664329ae78fa" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/d2_square_schur_20261006/Contract.lean", + "sha256": "17d29f16a788be98145ac76e55ab4103378e453770eb8ac4bde58281747d2eea" + } + ], + "source_record_sha256": "2cd4d4faa1f30e4c64c9c4f3e75976f4328c4a16857b33312b0bbb46028c9f1f", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "companions/d2_square_schur_20261006", + "source_files": [ + { + "path": "companions/d2_square_schur_20261006/D2SquareSchur.lean", + "sha256": "e0f9560e6f129216cd989cea3cdf97254972ca9b1cae7bab57df664329ae78fa", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "weighted_square_identity", + "line": 12, + "source_header": "e\n\ntheorem weighted_square_identity (u v a b c : ℝ) (huv : u + v ≠ 0) :\n u * (a-c)^2 + v * (b-c)^2 =\n u*v/(u+v)*(a-b)^2 + (u+v)*(c-(u*a+v*b)/(u+v))^" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_square_lower", + "line": 18, + "source_header": "g\n\ntheorem weighted_square_lower (u v a b c : ℝ) (hu : 0 < u) (hv : 0 < v) :\n u*v/(u+v)*(a-b)^2 ≤ u*(a-c)^2 + v*(b-c)^" + }, + { + "kind": "theorem", + "unqualified_name": "schur_no_upper", + "line": 23, + "source_header": ")\n\n/-- Endpoint upper control of the denominator, not lower-bound substitution. -/\ntheorem schur_no_upper (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2^2 < m4)\n (hq0 : 0 ≤ q) (hq1 : q ≤ 1/4) :\n min (m4-m2^2) (2*m2^2) ≤ d2Schur m2 m" + }, + { + "kind": "theorem", + "unqualified_name": "schur_from_lower_inputs", + "line": 64, + "source_header": "q1)\n\ntheorem schur_from_lower_inputs (m2 m4 q s0 g0 : ℝ) (hs0 : 0 < s0) (hg0 : 0 < g0)\n (hm2 : s0 ≤ m2) (hgap : g0 ≤ m4-m2^2) (hq0 : 0 ≤ q) (hq1 : q ≤ 1/4) :\n min g0 (2*s0^2) ≤ d2Schur m2 m" + } + ] + }, + { + "path": "companions/d2_square_schur_20261006/Contract.lean", + "sha256": "17d29f16a788be98145ac76e55ab4103378e453770eb8ac4bde58281747d2eea", + "declarations_lexical": [] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:companions/d2_square_schur_20261006", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "companions/d2_square_schur_20261006", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "companions/d2_square_schur_20261006/D2SquareSchur.lean", + "sha256": "e0f9560e6f129216cd989cea3cdf97254972ca9b1cae7bab57df664329ae78fa", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "weighted_square_identity", + "line": 12, + "source_header": "e\n\ntheorem weighted_square_identity (u v a b c : ℝ) (huv : u + v ≠ 0) :\n u * (a-c)^2 + v * (b-c)^2 =\n u*v/(u+v)*(a-b)^2 + (u+v)*(c-(u*a+v*b)/(u+v))^" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_square_lower", + "line": 18, + "source_header": "g\n\ntheorem weighted_square_lower (u v a b c : ℝ) (hu : 0 < u) (hv : 0 < v) :\n u*v/(u+v)*(a-b)^2 ≤ u*(a-c)^2 + v*(b-c)^" + }, + { + "kind": "theorem", + "unqualified_name": "schur_no_upper", + "line": 23, + "source_header": ")\n\n/-- Endpoint upper control of the denominator, not lower-bound substitution. -/\ntheorem schur_no_upper (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2^2 < m4)\n (hq0 : 0 ≤ q) (hq1 : q ≤ 1/4) :\n min (m4-m2^2) (2*m2^2) ≤ d2Schur m2 m" + }, + { + "kind": "theorem", + "unqualified_name": "schur_from_lower_inputs", + "line": 64, + "source_header": "q1)\n\ntheorem schur_from_lower_inputs (m2 m4 q s0 g0 : ℝ) (hs0 : 0 < s0) (hg0 : 0 < g0)\n (hm2 : s0 ≤ m2) (hgap : g0 ≤ m4-m2^2) (hq0 : 0 ≤ q) (hq1 : q ≤ 1/4) :\n min g0 (2*s0^2) ≤ d2Schur m2 m" + } + ] + }, + { + "path": "companions/d2_square_schur_20261006/Contract.lean", + "sha256": "17d29f16a788be98145ac76e55ab4103378e453770eb8ac4bde58281747d2eea", + "declarations_lexical": [] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:companions/torus_filtration_20261011", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusTopology.lean", + "sha256": "ddb145b3f791c181d4f2a51e54e711937297bd6476ba55bcd5252b7ddb57cfe1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0Controls.lean", + "sha256": "df9d3645282ca526b67eca3d5db691b622092a14b5fddee9be21013e39666184" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean", + "sha256": "3d6b0d6b53413c484b1d010bccf0d53ae7f75becb2d747868f22dbd673fe0a88" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/ClosedSuperlevel.lean", + "sha256": "90d1481b75d9c6d14e462c3fbf0bf7c7cdd0efb9eaad68d6732400658753b1c2" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/TorusFiltration.lean", + "sha256": "cddb8bc93569edbcc913eb7c79e23f9a5a637924207aabc2c11c1ad7fe476a75" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean", + "sha256": "8a2470431c3fda5e98859aa9372cbb8866ed5c5c722cea5dfc28cb577840bbad" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean", + "sha256": "346eea948e18d5904422904006827930e27d3141ccbc19ee8ac2c24bcf65a4a9" + } + ], + "source_record_sha256": "cc01920d943d1c66d4b5e0174a714a47e79b0ad4f7824078adf54ae28841e252", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "companions/torus_filtration_20261011", + "source_files": [ + { + "path": "companions/torus_filtration_20261011/TorusTopology.lean", + "sha256": "ddb145b3f791c181d4f2a51e54e711937297bd6476ba55bcd5252b7ddb57cfe1", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "torus_E", + "line": 21, + "source_header": "n\nabbrev torus_E (d : ℕ" + }, + { + "kind": "def", + "unqualified_name": "torus_latticeVec", + "line": 22, + "source_header": ")\n\n/-- The exact `Field.latticeVec` formula, retained without any coordinate rescaling. -/\ndef torus_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : torus_" + }, + { + "kind": "theorem", + "unqualified_name": "torus_field_latticeVec_formula", + "line": 26, + "source_header": "ℝ))\n\ntheorem torus_field_latticeVec_formula (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :\n torus_latticeVec d L n = ∑ i, EuclideanSpace.single i (L * (n i :" + }, + { + "kind": "def", + "unqualified_name": "torus_periodBasis", + "line": 29, + "source_header": "rfl\n\ndef torus_periodBasis (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Module.Basis (Fin d) ℝ (torus_E" + }, + { + "kind": "def", + "unqualified_name": "torus_periodLattice", + "line": 34, + "source_header": "e')\n\ndef torus_periodLattice (d : ℕ) (L : ℝ) (hL : 0 < L) : Submodule ℤ (torus_E" + }, + { + "kind": "abbrev", + "unqualified_name": "torus_quotient", + "line": 37, + "source_header": "L))\n\nabbrev torus_quotient (d : ℕ) (L : ℝ) (hL : 0 <" + }, + { + "kind": "def", + "unqualified_name": "torus_proj", + "line": 40, + "source_header": "oup\n\ndef torus_proj (d : ℕ) (L : ℝ) (hL : 0 < L) : torus_E d → torus_quotient d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_basis_sum_eq_latticeVec", + "line": 43, + "source_header": ".mk\n\n/-- Concrete adapter from integer basis coefficients to Field's exact vector formula. -/\ntheorem torus_basis_sum_eq_latticeVec (d : ℕ) (L : ℝ) (hL : 0 < L)\n (n : Fin d → ℤ) :\n ∑ i, n i • torus_periodBasis d L hL i = torus_latticeVec" + }, + { + "kind": "theorem", + "unqualified_name": "torus_lattice_mem_iff", + "line": 61, + "source_header": "hij]\n\ntheorem torus_lattice_mem_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x : torus_E d) :\n x ∈ torus_periodLattice d L hL ↔ ∃ n : Fin d → ℤ, torus_latticeVec d L" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_discrete", + "line": 68, + "source_header": "eVec]\n\ninstance torus_lattice_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :\n DiscreteTopology (torus_periodLattice d" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_addSubgroup_discrete", + "line": 73, + "source_header": "tance\n\ninstance torus_lattice_addSubgroup_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :\n DiscreteTopology (torus_periodLattice d L hL).toAddSub" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_isZLattice", + "line": 78, + "source_header": "tance\n\ninstance torus_lattice_isZLattice (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsZLattice ℝ (torus_periodLattice d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_surjective", + "line": 83, + "source_header": "tance\n\ntheorem torus_proj_surjective (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Function.Surjective (torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_continuous", + "line": 86, + "source_header": "ctive\n\ntheorem torus_proj_continuous (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Continuous (torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_eq_iff", + "line": 89, + "source_header": "t_mk'\n\ntheorem torus_proj_eq_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x y : torus_E d) :\n torus_proj d L hL x = torus_proj d L hL y ↔\n ∃ n : Fin d → ℤ, y = x + torus_latticeVec" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_lattice_translate", + "line": 102, + "source_header": "abel⟩\n\n/-- Duplicate representatives have exactly the same quotient image. -/\ntheorem torus_control_lattice_translate (d : ℕ) (L : ℝ) (hL : 0 < L)\n (x : torus_E d) (n : Fin d → ℤ) :\n torus_proj d L hL (x + torus_latticeVec d L n) = torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_isCoveringMap", + "line": 108, + "source_header": "⟩).symm\n\ntheorem torus_proj_isCoveringMap (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsCoveringMap (torus_proj" + }, + { + "kind": "theorem", + "unqualified_name": "torus_compact", + "line": 114, + "source_header": "ringMap\n\ntheorem torus_compact (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsCompact (Set.univ : Set (torus_quotient d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_pathConnectedSpace", + "line": 121, + "source_header": "] at hc\n\ntheorem torus_pathConnectedSpace (d : ℕ) (L : ℝ) (hL : 0 < L) :\n PathConnectedSpace (torus_quotient" + }, + { + "kind": "def", + "unqualified_name": "torus_isPeriodic", + "line": 125, + "source_header": "ient _)\n\n/-- Exact Field periodicity predicate with the literal lattice-vector adapter above. -/\ndef torus_isPeriodic (d : ℕ) (L : ℝ) (g : torus_E d →" + }, + { + "kind": "theorem", + "unqualified_name": "torus_field_periodic_formula", + "line": 129, + "source_header": "n) = g x\n\ntheorem torus_field_periodic_formula (d : ℕ) (L : ℝ) (g : torus_E d → ℝ) :\n torus_isPeriodic d L g ↔\n ∀ (x : EuclideanSpace ℝ (Fin d)) (n : Fin d → ℤ),\n g (x + ∑ i, EuclideanSpace.single i (L * (n i : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "torus_periodic_respects", + "line": 134, + "source_header": "= Iff.rfl\n\ntheorem torus_periodic_respects (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x y : torus_E d)\n (hxy : QuotientAddGroup.leftRel (torus_periodLattice d L hL).toAddSubgroup x y) :" + }, + { + "kind": "def", + "unqualified_name": "torus_descend", + "line": 142, + "source_header": "x n).symm\n\ndef torus_descend (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) : torus_quotient d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_descend_proj", + "line": 146, + "source_header": "hL g hg)\n\ntheorem torus_descend_proj (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x : torus_E d) :\n torus_descend d L hL g hg (torus_proj d L hL" + }, + { + "kind": "theorem", + "unqualified_name": "torus_descend_continuous", + "line": 150, + "source_header": "x := rfl\n\ntheorem torus_descend_continuous (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (hgc : Continuous g) :\n Continuous (torus_descend d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_path_lift_from", + "line": 155, + "source_header": "hL g hg)\n\n/-- Lift from a prescribed representative; the endpoint is determined existentially. -/\ntheorem torus_path_lift_from (d : ℕ) (L : ℝ) (hL : 0 < L)\n {M : torus_E d} {y : torus_quotient d L hL}\n (γ : Path (torus_proj d L hL M) y) :\n ∃ z : torus_E d, ∃ Γ : Path M z,\n torus_proj d L hL z = y ∧\n ∀ t : unitInterval, torus_proj d L hL" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_constant_path_endpoint", + "line": 169, + "source_header": "γ.source) t\n\n/-- Control: a constant projected path cannot be lifted from M to a different lift.\nThis refutes replacing the existential endpoint by an arbitrary chosen representative. -/\ntheorem torus_control_constant_path_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)\n {M z : torus_E d} (Γ : Path M z)\n (hΓ : ∀ t : unitInterval, torus_proj d L hL (Γ t) = torus_proj d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_no_arbitrary_endpoint", + "line": 179, + "source_header": "ngrFun heq 1)\n\n/-- Combining the duplicate-image and uniqueness controls gives a direct rejection\nof any different preselected endpoint for a constant quotient path. -/\ntheorem torus_control_no_arbitrary_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)\n (M : torus_E d) (n : Fin d → ℤ) (hn : torus_latticeVec d L n ≠ 0) :\n torus_proj d L hL (M + torus_latticeVec d L n) = torus_proj d L hL M ∧\n ¬ ∃ Γ : Path M (M + torus_latticeVec d L n),\n ∀ t : unitInterval, torus_proj d L hL (Γ t) = toru" + }, + { + "kind": "theorem", + "unqualified_name": "torus_higher_path_iff", + "line": 192, + "source_header": "impa using heq)\n\n/-- Higher-endpoint compatibility for any scalar path predicate, including strict\nand closed thresholds. No conclusion here asserts critical-level attainment. -/\ntheorem torus_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (P : ℝ → Prop) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, P (g (γ t))) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, P (torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_strict_higher_path_iff", + "line": 216, + "source_header": "ht\n exact ht\n\ntheorem torus_strict_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, h < torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_closed_higher_path_iff", + "line": 225, + "source_header": "(fun a => h < a)\n\ntheorem torus_closed_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h ≤ g (γ t)) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, h ≤ torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_global_max_iff", + "line": 234, + "source_header": "(fun a => h ≤ a)\n\ntheorem torus_global_max_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) :\n (∀ y : torus_E d, g y ≤ g M) ↔\n ∀ y : torus_quotient d L hL,\n torus_descend d L hL g hg y ≤ torus_descend d L hL g hg (tor" + } + ] + }, + { + "path": "companions/torus_filtration_20261011/OrdinaryH0Controls.lean", + "sha256": "df9d3645282ca526b67eca3d5db691b622092a14b5fddee9be21013e39666184", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "ordinaryH0Control_intCoeff", + "line": 63, + "source_header": "n\n\n/-- Proves: nothing; it names the integer coefficient object `ℤ` as a `ℤ`-module at universe 0.\nMethod: Mathlib's `ModuleCat.of`.\nDoes not establish: any homology computation. -/\nabbrev ordinaryH0Control_intCoeff : ModuleCat.{0" + }, + { + "kind": "abbrev", + "unqualified_name": "ordinaryH0Control_zeroCoeff", + "line": 68, + "source_header": "ℤ ℤ\n\n/-- Proves: nothing; it names the zero coefficient object, the one-point `ℤ`-module at universe 0.\nMethod: Mathlib's `ModuleCat.of` on `PUnit`.\nDoes not establish: any homology computation. -/\nabbrev ordinaryH0Control_zeroCoeff : ModuleCat." + }, + { + "kind": "abbrev", + "unqualified_name": "ordinaryH0Control_mod2Coeff", + "line": 73, + "source_header": "t.{1}\n\n/-- Proves: nothing; it names the characteristic-two coefficient object `ZMod 2` as a `ℤ`-module at universe 0.\nMethod: Mathlib's `ModuleCat.of`.\nDoes not establish: any homology computation. -/\nabbrev ordinaryH0Control_mod2Coeff : ModuleCa" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_intCoeff_id_ne_zero", + "line": 78, + "source_header": "ZMod 2)\n\n/-- Proves: the identity of the integer coefficient object is not the zero morphism.\nMethod: evaluate both morphisms at `1 : ℤ`, where they give `1` and `0`.\nDoes not establish: nonvanishing of any homology class by itself. -/\ntheorem ordinaryH0Control_intCoeff_id_ne_zero :\n (𝟙 ordinaryH0Control_intCoeff : ordinaryH0Control_intCoeff ⟶ ordinaryH0Control_intC" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_mod2Coeff_id_ne_zero", + "line": 88, + "source_header": "e_zero h1\n\n/-- Proves: the identity of the `ZMod 2` coefficient object is not the zero morphism.\nMethod: evaluate both morphisms at `1 : ZMod 2`, where they give `1` and `0`, which differ by `decide`.\nDoes not establish: nonvanishing of any homology class by itself. -/\ntheorem ordinaryH0Control_mod2Coeff_id_ne_zero :\n (𝟙 ordinaryH0Control_mod2Coeff : ordinaryH0Control_mod2Coeff ⟶ ordinaryH0Control_mod" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_mod2Coeff_id_add_self", + "line": 98, + "source_header": "(by decide)\n\n/-- Proves: the `ZMod 2` coefficient object has characteristic two: its identity added to itself is zero.\nMethod: pointwise, `x + x = 0` in `ZMod 2` by Mathlib's characteristic-two identity.\nDoes not establish: any homology computation. -/\ntheorem ordinaryH0Control_mod2Coeff_id_add_self :\n (𝟙 ordinaryH0Control_mod2Coeff : ordinaryH0Control_mod2Coeff ⟶ ordinaryH0Control_mod2Coeff) +\n 𝟙 ordinaryH0Control_" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_zeroCoeff_isZero", + "line": 108, + "source_header": "elf_eq_zero x\n\n/-- Proves: the one-point module is a zero object of `ModuleCat ℤ`.\nMethod: Mathlib's zero-object criterion for a subsingleton module.\nDoes not establish: vanishing of homology with nonzero coefficients. -/\ntheorem ordinaryH0Control_zeroCoeff_isZero : IsZero ordinaryH0Co" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_zeroCoeff_id_eq_zero", + "line": 114, + "source_header": "_subsingleton _\n\n/-- Proves: the identity of the zero coefficient object is the zero morphism.\nMethod: any two morphisms out of a zero object agree.\nDoes not establish: that the zero coefficient object satisfies the nonzero-coefficient hypothesis. -/\ntheorem ordinaryH0Control_zeroCoeff_id_eq_zero :\n (𝟙 ordinaryH0Control_zeroCoeff : ordinaryH0Control_zeroCoeff ⟶ ordinaryH0Contr" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_empty_components", + "line": 121, + "source_header": "ero.eq_of_src _ _\n\n/-- Proves: the empty space has no path component.\nMethod: every component is the class of a point, and the empty space has no point.\nDoes not establish: anything about a nonempty space. -/\ntheorem ordinaryH0Control_empty_components : IsEmpty (ZerothHomotopy" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_empty_componentCoproduct_isZero", + "line": 130, + "source_header": "exact Empty.elim x\n\n/-- Proves: the component-indexed coproduct of the empty space is a zero object for every coefficient module.\nMethod: its identity and zero morphism agree on every (absent) coproduct inclusion.\nDoes not establish: vanishing for a nonempty space with nonzero coefficients. -/\ntheorem ordinaryH0Control_empty_componentCoproduct_isZero (R : ModuleCat.{0} ℤ) :\n IsZero ((ordinaryH0_componentCoproductFunctor R).o" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_empty_h0_isZero", + "line": 139, + "source_header": "onents.false q).elim)\n\n/-- Proves: actual ordinary singular H0 of the empty space with integer coefficients is a zero object.\nMethod: transport the empty-coproduct zero object along the proved natural comparison `ordinaryH0_naturalIso`.\nDoes not establish: H0 of the empty space for coefficients other than `ℤ` (the zero-module case is `ordinaryH0Control_zeroCoeff_h0_isZero`), or anything about a nonempty space; no nonempty or `PathConnectedSpace` hypothesis is used. -/\ntheorem ordinaryH0Control_empty_h0_isZero :\n IsZero (((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).obj" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_zeroCoeff_componentCoproduct_isZero", + "line": 148, + "source_header": ".app (TopCat.of Empty))\n\n/-- Proves: with zero coefficients the component-indexed coproduct of every space is a zero object.\nMethod: its identity and zero morphism agree on every coproduct inclusion, each out of the zero module.\nDoes not establish: vanishing with nonzero coefficients. -/\ntheorem ordinaryH0Control_zeroCoeff_componentCoproduct_isZero (X : TopCat.{0}) :\n IsZero ((ordinaryH0_componentCoproductFunctor ordinaryH0" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_zeroCoeff_h0_isZero", + "line": 157, + "source_header": "eff_isZero.eq_of_src _ _)\n\n/-- Proves: with zero coefficients actual ordinary singular H0 of every space is a zero object.\nMethod: transport along the module's natural comparison `ordinaryH0_naturalIso` instantiated at the zero module.\nDoes not establish: any statement for nonzero coefficients, or that component distinctions are visible with zero coefficients. -/\ntheorem ordinaryH0Control_zeroCoeff_h0_isZero (X : TopCat.{0}) :\n IsZero (((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinary" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_point_augmentation", + "line": 165, + "source_header": "H0Control_zeroCoeff).app X)\n\n/-- Proves: the point class of the one-point space with integer coefficients augments to the identity of `ℤ`.\nMethod: specialize the module's ordinary augmentation formula.\nDoes not establish: reduced-H0 vanishing; this is the ordinary point class. -/\ntheorem ordinaryH0Control_point_augmentation :\n ordinaryH0_pointClass (TopCat.of Unit) ordinaryH0Control_intCoeff () ≫\n TopCat.singularHomology₀ε (TopCat.of Unit) ordinaryH0Control_intCoeff =" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_point_ne_zero", + "line": 174, + "source_header": "pointClass_augmentation _ _ _\n\n/-- Proves: the point class of the one-point space with integer coefficients is nonzero.\nMethod: the module's nonvanishing theorem with the proved nonzero identity of `ℤ`.\nDoes not establish: nonvanishing with zero coefficients. -/\ntheorem ordinaryH0Control_point_ne_zero :\n ordinaryH0_pointClass (TopCat.of Unit) or" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_point_h0_not_isZero", + "line": 182, + "source_header": "0Control_intCoeff_id_ne_zero ()\n\n/-- Proves: actual ordinary singular H0 of the one-point space with integer coefficients is not a zero object.\nMethod: a zero target would force the nonzero point class to vanish.\nDoes not establish: a computation of that H0 beyond its nonvanishing. -/\ntheorem ordinaryH0Control_point_h0_not_isZero :\n ¬ IsZero (((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intC" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_line_component_eq", + "line": 190, + "source_header": "l_point_ne_zero (h.eq_of_tgt _ _)\n\n/-- Proves: `0` and `1` lie in the same actual path component of the real line.\nMethod: the explicit path `t ↦ t` along the unit interval.\nDoes not establish: path-connectedness of any closed superlevel. -/\ntheorem ordinaryH0Control_line_component_eq :\n ZerothHomotopy.mk" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_line_difference_zero_int", + "line": 201, + "source_header": "urce' := rfl\n target' := rfl }\n\n/-- Proves: with integer coefficients the point classes of `0` and `1` in the real line have zero difference.\nMethod: the module's same-component theorem with the proved path premise.\nDoes not establish: that either individual point class dies. -/\ntheorem ordinaryH0Control_line_difference_zero_int :\n ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_intCoeff (0 : ℝ) -\n ordinaryH0_pointClass (TopCat.of ℝ) o" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_line_difference_zero_zeroCoeff", + "line": 209, + "source_header": "_ ordinaryH0Control_line_component_eq\n\n/-- Proves: with zero coefficients the point classes of `0` and `1` in the real line have zero difference.\nMethod: the module's same-component theorem, which carries no coefficient hypothesis.\nDoes not establish: any separation statement for zero coefficients. -/\ntheorem ordinaryH0Control_line_difference_zero_zeroCoeff :\n ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_zeroCoeff (0 : ℝ) -\n ordinaryH0_pointClass (TopCat.of ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_line_classes_ne_zero", + "line": 217, + "source_header": "_ _ ordinaryH0Control_line_component_eq\n\n/-- Proves: with integer coefficients each of the two same-component point classes in the real line is nonzero.\nMethod: the module's nonvanishing theorem with the proved nonzero identity of `ℤ`.\nDoes not establish: distinctness of the two classes, which are equal. -/\ntheorem ordinaryH0Control_line_classes_ne_zero :\n ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_intCoeff (0 : ℝ) ≠ 0 ∧\n ordinaryH0_pointClass (TopCat.of" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_discrete_component_ne", + "line": 226, + "source_header": "ordinaryH0Control_intCoeff_id_ne_zero _⟩\n\n/-- Proves: distinct points of a discrete space lie in distinct actual path components.\nMethod: a path is a continuous map from the connected unit interval into a discrete space, hence constant.\nDoes not establish: anything about path components of a non-discrete space. -/\ntheorem ordinaryH0Control_discrete_component_ne {X : Type} [TopologicalSpace X] [DiscreteTopology X]\n {x y : X} (hxy : x ≠ y)" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_bool_component_ne", + "line": 237, + "source_header": "w [p.source, p.target] at hc\n exact hxy hc\n\n/-- Proves: `true` and `false` lie in distinct actual path components of the discrete space `Bool`.\nMethod: the discrete-space separation above with `true ≠ false` by `decide`.\nDoes not establish: anything about connected components of other spaces. -/\ntheorem ordinaryH0Control_bool_component_ne :\n Zer" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_bool_pointClass_ne", + "line": 244, + "source_header": "ryH0Control_discrete_component_ne (by decide)\n\n/-- Proves: with integer coefficients the point classes of `true` and `false` in `Bool` differ.\nMethod: the module's separation theorem with the two proved premises.\nDoes not establish: separation with zero coefficients. -/\ntheorem ordinaryH0Control_bool_pointClass_ne :\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff true ≠\n ordinaryH0_pointClass (T" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_bool_pointClass_ne_mod2", + "line": 253, + "source_header": "ero _ _\n ordinaryH0Control_bool_component_ne\n\n/-- Proves: with `ZMod 2` coefficients, a characteristic-two object, the point classes of `true` and `false` in `Bool` differ.\nMethod: the module's separation theorem with the proved nonzero identity of `ZMod 2` and the proved component separation.\nDoes not establish: separation for every characteristic-two coefficient object, or with zero coefficients. -/\ntheorem ordinaryH0Control_bool_pointClass_ne_mod2 :\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_mod2Coeff true ≠\n ordinaryH0_pointClass (" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0Control_collapse", + "line": 262, + "source_header": "_zero _ _\n ordinaryH0Control_bool_component_ne\n\n/-- Proves: nothing; it names the continuous collapse of `Bool` onto the one-point space.\nMethod: Mathlib's constant continuous map.\nDoes not establish: any homology statement by itself. -/\ndef ordinaryH" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_collapse_difference_zero", + "line": 268, + "source_header": "nit :=\n TopCat.ofHom (ContinuousMap.const Bool ())\n\n/-- Proves: with integer coefficients the collapse kills the difference of the two point classes of `Bool`.\nMethod: the module's merger criterion with the proved target-component equality in the one-point space.\nDoes not establish: that an individual point class dies. -/\ntheorem ordinaryH0Control_collapse_difference_zero :\n (ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff true -\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff false) ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_i" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_collapse_image_ne_zero", + "line": 278, + "source_header": "_ ordinaryH0Control_intCoeff_id_ne_zero _ _ _).2 rfl\n\n/-- Proves: with integer coefficients each image point class under the collapse is nonzero.\nMethod: actual point-class transport followed by the module's nonvanishing theorem.\nDoes not establish: distinctness of the two image classes, which are equal. -/\ntheorem ordinaryH0Control_collapse_image_ne_zero (b : Bool) :\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff b ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_collapse_difference_dies_classes_survive", + "line": 288, + "source_header": "ass_ne_zero _ _ ordinaryH0Control_intCoeff_id_ne_zero _\n\n/-- Proves: a merger kills the difference of the two point classes of `Bool` while each image class survives.\nMethod: combine the two collapse controls above.\nDoes not establish: a Morse merger event, elder selection or death height. -/\ntheorem ordinaryH0Control_collapse_difference_dies_classes_survive :\n (ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff true -\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff false) ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).map\n ordinaryH0Control_collapse = 0 ∧\n ∀ b : Bool, ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff b ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Contr" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0Control_fst", + "line": 301, + "source_header": "ifference_zero, ordinaryH0Control_collapse_image_ne_zero⟩\n\n/-- Proves: nothing; it names the continuous first projection of the discrete square `Bool × Bool` onto `Bool`, a non-injective map.\nMethod: Mathlib's continuous first projection.\nDoes not establish: any homology statement by itself. -/\ndef ordin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_square_differences_ne_zero", + "line": 307, + "source_header": "TopCat.of Bool :=\n TopCat.ofHom ⟨Prod.fst, continuous_fst⟩\n\n/-- Proves: with integer coefficients, before any map, the differences of the classes of `(true, false)` and `(true, true)`, and of `(true, false)` and `(false, true)`, in the discrete square are both nonzero.\nMethod: the module's separation theorem with the proved discrete-space component separation, then `sub_ne_zero`.\nDoes not establish: any statement about their images. -/\ntheorem ordinaryH0Control_square_differences_ne_zero :\n ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, true) : Bool × Bool) ≠ 0 ∧\n ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool × Bool))" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_fst_difference_zero", + "line": 320, + "source_header": "ntrol_discrete_component_ne (X := Bool × Bool) (by decide)))⟩\n\n/-- Proves: with integer coefficients the projection kills the difference of the classes of `(true, false)` and `(true, true)`, whose images coincide.\nMethod: the module's merger criterion with the proved target-component equality.\nDoes not establish: that an individual point class dies. -/\ntheorem ordinaryH0Control_fst_difference_zero :\n (ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, true) : Bool × Bool)) ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordi" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_fst_difference_ne_zero", + "line": 330, + "source_header": "q_zero_iff _ ordinaryH0Control_intCoeff_id_ne_zero _ _ _).2 rfl\n\n/-- Proves: with integer coefficients the same non-injective projection keeps the difference of the classes of `(true, false)` and `(false, true)` nonzero, since their images `true` and `false` stay in distinct components.\nMethod: the module's merger criterion, used contrapositively with the proved separation of the image components.\nDoes not establish: injectivity of the induced H0 map, which fails on the first pair. -/\ntheorem ordinaryH0Control_fst_difference_ne_zero :\n (ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((false, true) : Bool × Bool)) ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj or" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_bool_zeroCoeff_eq", + "line": 341, + "source_header": "_intCoeff_id_ne_zero]\n exact ordinaryH0Control_bool_component_ne\n\n/-- Proves: with zero coefficients the point classes of `true` and `false` in `Bool` are equal.\nMethod: any two morphisms out of the zero coefficient object agree.\nDoes not establish: equality of their path components, which differ. -/\ntheorem ordinaryH0Control_bool_zeroCoeff_eq :\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_zeroCoeff true =\n ordin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_point_zeroCoeff_eq_zero", + "line": 349, + "source_header": "roCoeff false :=\n ordinaryH0Control_zeroCoeff_isZero.eq_of_src _ _\n\n/-- Proves: with zero coefficients the point class of the one-point space is zero.\nMethod: any two morphisms out of the zero coefficient object agree.\nDoes not establish: vanishing of ordinary H0 with nonzero coefficients. -/\ntheorem ordinaryH0Control_point_zeroCoeff_eq_zero :\n ordi" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_separation_needs_nonzero", + "line": 356, + "source_header": "eroCoeff () = 0 :=\n ordinaryH0Control_zeroCoeff_isZero.eq_of_src _ _\n\n/-- Proves: the separation statement is false once its nonzero-coefficient hypothesis is deleted.\nMethod: the zero-coefficient fixture on `Bool` has distinct components and equal point classes.\nDoes not establish: any failure of the module's statements, which retain that hypothesis. -/\ntheorem ordinaryH0Control_separation_needs_nonzero :\n ¬ ∀ (X : TopCat.{0}) (R : ModuleCat.{0} ℤ) (x y : X),\n ZerothHomotopy.mk x ≠ ZerothHomotopy.m" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_nonvanishing_needs_nonzero", + "line": 366, + "source_header": "ordinaryH0Control_bool_component_ne ordinaryH0Control_bool_zeroCoeff_eq\n\n/-- Proves: the nonvanishing statement is false once its nonzero-coefficient hypothesis is deleted.\nMethod: the zero-coefficient fixture on the one-point space has a zero point class.\nDoes not establish: any failure of the module's statements, which retain that hypothesis. -/\ntheorem ordinaryH0Control_nonvanishing_needs_nonzero :\n ¬ ∀ (X : T" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0Control_parabolaLeft", + "line": 373, + "source_header": "ordinaryH0Control_zeroCoeff () ordinaryH0Control_point_zeroCoeff_eq_zero\n\n/-- Proves: nothing; it names the point `-1` of the closed superlevel of `x ↦ x ^ 2` at parameter `-1`.\nMethod: membership is `-(-1) ≤ (-1) ^ 2`, checked by `norm_num`.\nDoes not establish: any component statement by itself. -/\nde" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0Control_parabolaRight", + "line": 379, + "source_header": "level_set (fun x : ℝ => x ^ 2) (-1) :=\n ⟨-1, by norm_num [superlevel_set]⟩\n\n/-- Proves: nothing; it names the point `1` of the closed superlevel of `x ↦ x ^ 2` at parameter `-1`.\nMethod: membership is `-(-1) ≤ 1 ^ 2`, checked by `norm_num`.\nDoes not establish: any component statement by itself. -/\nd" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_le", + "line": 385, + "source_header": "perlevel_set (fun x : ℝ => x ^ 2) (-1) :=\n ⟨1, by norm_num [superlevel_set]⟩\n\n/-- Proves: the closed-superlevel parameter `-1` lies below `-1/4`, so the inclusion of the level at `-1` into the level at `-1/4` exists.\nMethod: `norm_num`.\nDoes not establish: any component or homology st" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_strict_growth", + "line": 391, + "source_header": ". -/\ntheorem ordinaryH0Control_parabola_le : (-1 : ℝ) ≤ -1 / 4 := by\n norm_num\n\n/-- Proves: the inclusion from parameter `-1` to `-1/4` is strict: `-1 < -1/4`, and `1/2` lies in the level `{x | 1/4 ≤ x ^ 2}` but not in `{x | 1 ≤ x ^ 2}`.\nMethod: `norm_num` on the three numeric facts.\nDoes not establish: any component or homology statement by itself. -/\ntheorem ordinaryH0Control_parabola_strict_growth :\n (-1 : ℝ) < -1 / 4 ∧ (1 / 2 : ℝ) ∈ superlevel_set (fun x : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_not_joined_quarter", + "line": 399, + "source_header": "=> x ^ 2) (-1) := by\n refine ⟨by norm_num, ?_, ?_⟩ <;> norm_num [superlevel_set]\n\n/-- Proves: `-1` and `1` are not joined inside the closed superlevel `{x | 1/4 ≤ x ^ 2}` of `x ↦ x ^ 2` at parameter `-1/4`.\nMethod: intermediate value theorem; a joining path would pass through `0`, which lies outside that level.\nDoes not establish: a first merger level or threshold attainment. -/\ntheorem ordinaryH0Control_parabola_not_joined_quarter :\n ¬ JoinedIn (superlevel_set (fun x : ℝ => x ^ 2) (-1" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_joined", + "line": 413, + "source_header": "laRight]⟩\n have hmem := hγ t\n rw [ht] at hmem\n norm_num [superlevel_set] at hmem\n\n/-- Proves: `-1` and `1` are joined inside the closed superlevel of `x ↦ x ^ 2` at parameter `0`, which is the whole line.\nMethod: the straight segment lies in that level because squares are nonnegative.\nDoes not establish: path-connectedness of any other level. -/\ntheorem ordinaryH0Control_parabola_joined :\n JoinedIn (superlevel_set (fun x : ℝ => x" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_difference_zero", + "line": 425, + "source_header": "(by\n intro z _\n show -(0 : ℝ) ≤ z ^ 2\n rw [neg_zero]\n exact sq_nonneg z)\n\n/-- Proves: with integer coefficients the closed-superlevel inclusion from parameter `-1` to `0` kills the difference of the classes of `-1` and `1`.\nMethod: the module's filtration criterion with the proved target-level path.\nDoes not establish: that either included point class dies, or that `0` is the first merger level. -/\ntheorem ordinaryH0Control_parabola_difference_zero :\n (ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaLeft -\n ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaRight) ≫\n (superlevel_h0Filtration (fun x : ℝ => x ^ 2) ordinaryH0Co" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_strict_difference_ne_zero", + "line": 438, + "source_header": "_ ordinaryH0Control_intCoeff_id_ne_zero\n _ _ _).2 ordinaryH0Control_parabola_joined\n\n/-- Proves: with integer coefficients the strict closed-superlevel inclusion from parameter `-1` to `-1/4` keeps the difference of the classes of `-1` and `1` nonzero.\nMethod: the module's filtration criterion, used contrapositively with the proved absence of a path in the target level.\nDoes not establish: the behaviour at any parameter strictly between `-1/4` and `0`, or the first merger level. -/\ntheorem ordinaryH0Control_parabola_strict_difference_ne_zero :\n (ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaLeft -\n ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaRight) ≫\n (superlevel_h0Filtration (fun x : ℝ => x ^" + } + ] + }, + { + "path": "companions/torus_filtration_20261011/OrdinaryH0.lean", + "sha256": "3d6b0d6b53413c484b1d010bccf0d53ae7f75becb2d747868f22dbd673fe0a88", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentFunctor", + "line": 44, + "source_header": "n\n\n/-- Proves: actual path-component quotients form a functor on topological spaces.\nMethod: use the existing continuous-map quotient map and its identity/composition laws.\nDoes not establish: equality of connected and path-connected components. -/\ndef ordinaryH0_componentFunctor : TopCat.{w} ⥤ Type w where\n ob" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentCoproductFunctor", + "line": 61, + "source_header": "C]\n\n/-- Proves: the component-indexed coproduct construction is a functor.\nMethod: compose the actual component functor with the categorical coproduct functor.\nDoes not establish: an identification with homology until naturality is proved below. -/\ndef ordinaryH0_componentCoproductFunctor (R : C) : TopCat.{w" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentCoproductMap_iota", + "line": 67, + "source_header": "obj R\n\n/-- Proves: a coproduct generator maps to the component of its continuous image.\nMethod: the universal coproduct map sends each inclusion to its indexed image.\nDoes not establish: that distinct source components stay distinct. -/\ntheorem ordinaryH0_componentCoproductMap_iota (R : C) {X Y : TopCat.{w}}\n (f : X ⟶ Y) (q : ZerothHomotopy X) :\n Sigma.ι (fun _ : ZerothHomotopy X => R) q ≫\n (ordinaryH0_componentCoproductFunctor R).map f =\n Sigma.ι (fun _ : ZerothHomotopy Y => R) (superlevel_componentMap f" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentFiltration", + "line": 77, + "source_header": "aConst]\n\n/-- Proves: the existing closed-superlevel family has a component-indexed coproduct filtration.\nMethod: compose its actual continuous inclusions with the proved component coproduct functor.\nDoes not establish: regularity, finite dimensionality, or Morse hypotheses for the height function. -/\ndef ordinaryH0_componentFiltration {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentFiltration_map_iota", + "line": 84, + "source_header": "Functor R\n\n/-- Proves: a filtration component generator maps by the existing actual component inclusion.\nMethod: specialize the coproduct generator map formula to a closed-superlevel inclusion.\nDoes not establish: a reverse inclusion or endpoint deletion. -/\ntheorem ordinaryH0_componentFiltration_map_iota {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t)\n (q : ZerothHomotopy (superlevel_set g s)) :\n Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g s) => R) q ≫\n (ordinaryH0_componentFiltration g R).map (homOfLE hst) =\n Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g t) => R)\n (superlevel_componentInclusi" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_simplicialPointClass", + "line": 99, + "source_header": "Homology C]\n\n/-- Proves: a zero-simplex defines a morphism into actual simplicial homology.\nMethod: include its chain generator, lift through the zero differential, then take its class.\nDoes not establish: a replacement definition of homology or any naturality premise. -/\ndef ordinaryH0_simplicialPointClass (S : SSet.{w}) (R : C) (x : S _⦋0⦌) :\n R ⟶ S" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_simplicialPointClass_iso", + "line": 107, + "source_header": ").homologyπ 0\n\n/-- Proves: the existing simplicial H0 isomorphism sends a point class to its component.\nMethod: apply Mathlib's zero-cycle generator formula.\nDoes not establish: naturality merely from the existence of the objectwise isomorphism. -/\ntheorem ordinaryH0_simplicialPointClass_iso (S : SSet.{w}) (R : C)\n (x : S _⦋0⦌) :\n ordinaryH0_simplicialPointClass S R x ≫ (S.homology₀Iso R).hom =\n Sigma.ι (fun _ : S.π₀ => R)" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_simplicialPointClass_map", + "line": 117, + "source_header": "y₀Iso_hom S R x\n\n/-- Proves: the actual simplicial homology map carries a point class to its image class.\nMethod: homology projection naturality, cycle-lift naturality, and the chain generator formula.\nDoes not establish: a transported or postulated substitute for the actual homology map. -/\ntheorem ordinaryH0_simplicialPointClass_map (R : C) {S T : SSet.{w}}\n (f : S ⟶ T) (x : S _⦋0⦌) :\n ordinaryH0_simplicialPointClass S R x ≫ SSet.homologyMap f R 0 =\n ordinaryH0_simplicialPointClas" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_toSSet_pointMap", + "line": 128, + "source_header": "hainComplexMap_f]\n\n/-- Proves: the singular zero-simplex of a point maps to that of its continuous image.\nMethod: unfold the point/simplex correspondence and the singular-set map.\nDoes not establish: a chain or homology identification by itself. -/\ntheorem ordinaryH0_toSSet_pointMap {X Y : TopCat.{w}} (f : X ⟶ Y) (x : X) :\n (TopCat.toSSet.map f).app _ (TopCat.toSSetObj₀Equiv.symm x) =\n TopCat.toSSetO" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_pointClass", + "line": 136, + "source_header": "m (f x) := by\n rfl\n\n/-- Proves: each point has its actual ordinary singular zero-homology class morphism.\nMethod: use the actual singular zero-simplex and the cycle/projection construction above.\nDoes not establish: a free-module definition standing in for singular H0. -/\ndef ordinaryH0_pointClass (X : TopCat.{w}) (R : C) (x : X) :\n R ⟶ ((singularHomologyFunc" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_map", + "line": 144, + "source_header": "SSetObj₀Equiv.symm x)\n\n/-- Proves: actual continuous-map-induced singular H0 maps transport point classes.\nMethod: specialize the proved simplicial generator naturality to the singular-set functor.\nDoes not establish: injectivity of the induced map. -/\ntheorem ordinaryH0_pointClass_map (R : C) {X Y : TopCat.{w}}\n (f : X ⟶ Y) (x : X) :\n ordinaryH0_pointClass X R x ≫ ((singularHomologyFunctor C 0).obj R).map f =\n ordinary" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_iso", + "line": 158, + "source_header": "naryH0_toSSet_pointMap]\n\n/-- Proves: Mathlib's existing topological comparison sends actual point classes to components.\nMethod: combine the simplicial generator formula with the actual path-component equivalence.\nDoes not establish: any connected-component substitution. -/\ntheorem ordinaryH0_pointClass_iso (X : TopCat.{w}) (R : C) (x : X) :\n ordinaryH0_pointClass X R x ≫ (TopCat.singularHomology₀Iso X R).hom =\n Sigma.ι (fun _ : ZerothHomotopy X =>" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentIota_isoInv", + "line": 171, + "source_header": "_iso]\n simp [sigmaConst]\n\n/-- Proves: inverse comparison takes each component generator to any representing point class.\nMethod: cancel the comparison isomorphism and use the point-class formula.\nDoes not establish: a choice of distinguished geometric representative. -/\ntheorem ordinaryH0_componentIota_isoInv (X : TopCat.{w}) (R : C) (x : X) :\n Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) ≫\n (TopCat.singularHomology₀Iso X R).inv =" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_hom_ext", + "line": 180, + "source_header": "ordinaryH0_pointClass_iso]\n\n/-- Proves: morphisms out of actual singular H0 agree if they agree on all point classes.\nMethod: cancel the inverse comparison, use coproduct extensionality and quotient surjectivity.\nDoes not establish: a basis of geometric maxima or finiteness of components. -/\ntheorem ordinaryH0_hom_ext (X : TopCat.{w}) (R : C) {A : C}\n {f g : ((singularHomologyFunctor C 0).obj R).obj X ⟶ A}\n (h : ∀ x : X, ordinaryH0_pointClass X R x ≫ f = ordinaryH0_poin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_iso_naturality", + "line": 193, + "source_header": "mponentIota_isoInv] using h x\n\n/-- Proves: the existing actual singular H0 comparison commutes with every continuous map.\nMethod: test both composites on actual point classes, transport them, and compare component images.\nDoes not establish: naturality by adding an assumption or a compatibility record. -/\ntheorem ordinaryH0_iso_naturality (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) :\n ((singularHomologyFunctor C 0).obj R).map f ≫\n (TopCat.singularHomology₀Iso Y R).hom =\n (TopCat.singularHomology₀Iso X R).hom ≫\n (ordinaryH0_com" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_naturalIso", + "line": 209, + "source_header": "mponentCoproductMap_iota]\n rfl\n\n/-- Proves: actual ordinary singular H0 is naturally isomorphic to component-indexed coproducts.\nMethod: assemble the existing objectwise isomorphisms using the commuting square proved above.\nDoes not establish: an interval decomposition or persistence-bar classification. -/\ndef ordinaryH0_naturalIso (R : C) :\n (singularHomologyFunctor C 0).obj R ≅ ordin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_augmentation", + "line": 217, + "source_header": "=> ordinaryH0_iso_naturality R f)\n\n/-- Proves: ordinary augmentation sends every actual point-class morphism to the coefficient identity.\nMethod: use the comparison's augmentation formula and the coproduct universal property.\nDoes not establish: reduced-H0 vanishing; this retains the ordinary point class. -/\ntheorem ordinaryH0_pointClass_augmentation (X : TopCat.{w}) (R : C) (x : X) :\n ordinaryH0_pointClass X R x ≫" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_ne_zero", + "line": 226, + "source_header": "ordinaryH0_pointClass_iso]\n simp\n\n/-- Proves: an actual point class is nonzero for a coefficient object with nonzero identity.\nMethod: compose a proposed zero class with ordinary augmentation.\nDoes not establish: nonzero classes for a zero coefficient object. -/\ntheorem ordinaryH0_pointClass_ne_zero (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x :" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_eq_of_component_eq", + "line": 236, + "source_header": ", zero_comp] at hε\n exact hR hε.symm\n\n/-- Proves: points in the same actual path component give equal ordinary H0 class morphisms.\nMethod: cancel the objectwise comparison and compare their component indices.\nDoes not establish: a converse for zero coefficients. -/\ntheorem ordinaryH0_pointClass_eq_of_component_eq (X : TopCat.{w}) (R : C)\n (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :\n ordinaryH0_pointCl" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_sameComponent_difference_zero", + "line": 245, + "source_header": "lass_iso, ordinaryH0_pointClass_iso, h]\n\n/-- Proves: the difference of same-component point classes is zero for arbitrary coefficients.\nMethod: subtract the equality proved from actual path-component equality.\nDoes not establish: that either individual point class dies. -/\ntheorem ordinaryH0_sameComponent_difference_zero (X : TopCat.{w}) (R : C)\n (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :\n ordinaryH0_pointClas" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_ne_of_component_ne", + "line": 253, + "source_header": "s_eq_of_component_eq X R x y h, sub_self]\n\n/-- Proves: distinct actual path components have distinct ordinary H0 class morphisms if coefficients are nonzero.\nMethod: separate the two coproduct injections by an identity/zero component projection.\nDoes not establish: distinction with zero coefficients or distinction of points within one component. -/\ntheorem ordinaryH0_pointClass_ne_of_component_ne (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X)\n (hxy : ZerothHomotopy.mk x ≠ ZerothHomotopy.mk y) :\n ordinaryH0_poi" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_eq_iff", + "line": 271, + "source_header": "ymm hxy] using congrArg (fun k => k ≫ p) hc\n\n/-- Proves: with nonzero coefficients, actual point-class equality is exactly path-component equality.\nMethod: combine the same-component formula with the separating projection control.\nDoes not establish: equality of geometric points or connected components. -/\ntheorem ordinaryH0_pointClass_eq_iff (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X) :\n ordinaryH0_pointClass X R x = ordinaryH0_pointClass X R y ↔" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_difference_map", + "line": 284, + "source_header": "inaryH0_pointClass_eq_of_component_eq X R x y\n\n/-- Proves: the actual H0 map sends a difference of point classes to the difference of image classes.\nMethod: distribute composition over subtraction and use proved actual point-class transport.\nDoes not establish: death of the individual ordinary point classes. -/\ntheorem ordinaryH0_difference_map (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫\n ((singularHomologyFunctor C 0).obj R).map f =\n ordinaryH0_pointCl" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_difference_map_eq_zero_iff", + "line": 293, + "source_header": "ryH0_pointClass_map, ordinaryH0_pointClass_map]\n\n/-- Proves: with nonzero coefficients, a mapped difference vanishes exactly when the image points merge in path components.\nMethod: actual homology-map transport, subtraction cancellation, and the component equality criterion.\nDoes not establish: a Morse merger event, elder selection, death height, or barcode. -/\ntheorem ordinaryH0_difference_map_eq_zero_iff (R : C) (hR : (𝟙 R : R ⟶ R) ≠ 0)\n {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫\n ((singularHomologyFunctor C 0).obj R).map f = 0 ↔" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_filtrationIso", + "line": 303, + "source_header": "sub_eq_zero, ordinaryH0_pointClass_eq_iff Y R hR]\n\n/-- Proves: the existing actual singular H0 filtration is naturally isomorphic to its component coproduct filtration.\nMethod: restrict the proved natural comparison along the existing topological filtration.\nDoes not establish: the later interval, elder, maximum/saddle, count, Field, or stochastic bridges. -/\ndef ordinaryH0_filtrationIso {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) :\n superlevel_h0" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_filtration_naturality", + "line": 311, + "source_header": "(superlevel_filtration g) (ordinaryH0_naturalIso R)\n\n/-- Proves: all ordered closed-superlevel inclusion maps satisfy the actual H0/component square.\nMethod: read the naturality of the proved filtration isomorphism at the preorder morphism.\nDoes not establish: strict-level conventions or any unproved geometric persistence hypothesis. -/\ntheorem ordinaryH0_filtration_naturality {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t) :\n (superlevel_h0Filtration g R).map (homOfLE hst) ≫\n (ordinaryH0_filtrationIso g R).hom.app t =\n (ordinaryH0_filtrationIso g R).hom.app s ≫\n (" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_filtration_difference_zero_iff_joinedIn", + "line": 322, + "source_header": "aryH0_filtrationIso g R).hom.naturality (homOfLE hst)\n\n/-- Proves: under a closed-superlevel inclusion, a difference vanishes exactly when the two included points are joined in the target closed superlevel.\nMethod: apply the actual H0 difference control and the existing component/JoinedIn equivalence.\nDoes not establish: attainment of a critical death threshold or an elder/barcode theorem. -/\ntheorem ordinaryH0_filtration_difference_zero_iff_joinedIn\n {X : Type w} [TopologicalSpace X] (g : X → ℝ) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) {s t : ℝ} (hst : s ≤ t)\n (x y : superlevel_set g s) :\n (ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R x -\n ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R y) ≫\n (superlevel_h0Filtration g R).map (homOfLE hst" + } + ] + }, + { + "path": "companions/torus_filtration_20261011/ClosedSuperlevel.lean", + "sha256": "90d1481b75d9c6d14e462c3fbf0bf7c7cdd0efb9eaad68d6732400658753b1c2", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "superlevel_set", + "line": 21, + "source_header": "n\n/-- The increasing closed-superlevel family, with parameter `t = -h`. -/\ndef superlevel_set {X : Type*} (g : X → ℝ) (t : ℝ) : Se" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_closed_endpoint", + "line": 24, + "source_header": "x}\n\n/-- Control: the point at the threshold belongs to the closed superlevel.\nChanging `≤` to `<` invalidates this statement. -/\ntheorem superlevel_control_closed_endpoint (b : ℝ) :\n () ∈ superlevel_set (fun _ : Unit => b)" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_strict_endpoint", + "line": 30, + "source_header": "_set]\n\n/-- Control: the strict condition fails at that same threshold. -/\ntheorem superlevel_control_strict_endpoint (b : ℝ) :\n ¬ (-(-b) < (fun _ : Unit =>" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_parameter_sign", + "line": 35, + "source_header": "simp\n\n/-- Control: at parameter `1` the constant height `0` is present.\nChanging `-t` to `t` invalidates this statement. -/\ntheorem superlevel_control_parameter_sign :\n () ∈ superlevel_set (fun _ : Unit => (" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_inclusion_direction", + "line": 41, + "source_header": "evel_set]\n\n/-- Control: inclusion cannot run from parameter `1` back to `-1`. -/\ntheorem superlevel_control_inclusion_direction :\n ¬ superlevel_set (fun _ : Unit => (0 : ℝ)) 1 ⊆\n superlevel_set (fun _ : Unit => (0" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_essential", + "line": 49, + "source_header": "_set] at hc\n\n/-- A global maximum has no strictly higher endpoint, regardless of paths. -/\ntheorem superlevel_control_essential {X : Type*} (g : X → ℝ) (M : X)\n (hM : ∀ y, g y ≤ g M) : ¬ ∃" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_mono", + "line": 55, + "source_header": "ge (hM y)) hy\n\n/-- Increasing parameters give increasing closed superlevels. -/\ntheorem superlevel_mono {X : Type*} (g : X → ℝ) {s t : ℝ} (hst : s ≤ t) :\n superlevel_set g s ⊆ sup" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_isClosed", + "line": 61, + "source_header": "_le_neg hst) hx\n\n/-- Each level is closed when the function is continuous. -/\ntheorem superlevel_isClosed {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (hg : Continuous g) (t : ℝ) : IsClosed (su" + }, + { + "kind": "def", + "unqualified_name": "superlevel_inclusion", + "line": 66, + "source_header": "ntinuous_const hg\n\n/-- Continuity of the inclusion is independent of continuity of the height function. -/\ndef superlevel_inclusion {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) {s t : ℝ} (hst : s ≤ t) :\n C(superlevel_set g s," + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_inclusion_id", + "line": 72, + "source_header": "erlevel_mono g hst)\n\ntheorem superlevel_inclusion_id {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (t : ℝ) :\n superlevel_inclusion g (le_refl t) = ContinuousMap.id (" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_inclusion_comp", + "line": 78, + "source_header": ":= by\n ext x\n rfl\n\ntheorem superlevel_inclusion_comp {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) {r s t : ℝ} (hrs : r ≤ s) (hst : s ≤ t) :\n (superlevel_inclusion g hst).comp (superlevel_inclusion g hrs) =\n superlevel_inclusio" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_mem_at_own_height", + "line": 85, + "source_header": ":= by\n ext x\n rfl\n\n/-- Point membership at its own height; this is not a component-birth theorem. -/\ntheorem superlevel_mem_at_own_height {X : Type*} (g : X → ℝ) (x : X) :\n x ∈ su" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_neg_height", + "line": 90, + "source_header": "simp [superlevel_set]\n\ntheorem superlevel_neg_height {X : Type*} (g : X → ℝ) (h : ℝ) :\n superlevel_set g" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_strict_thresholds", + "line": 95, + "source_header": "simp [superlevel_set]\n\n/-- An explicit threshold countercontrol; it is not a compact Morse counterexample. -/\ntheorem superlevel_control_strict_thresholds :\n (∀ h : ℝ, h < 0 → ∃ k : ℝ, h < k ∧ k < 0) ∧\n ¬" + }, + { + "kind": "def", + "unqualified_name": "superlevel_componentMap", + "line": 105, + "source_header": "t (not_lt_of_ge hk) hk'\n\n/-- The induced map on actual path-component quotients. -/\ndef superlevel_componentMap {X Y : Type w} [TopologicalSpace X] [TopologicalSpace Y]\n (f : C(X, Y)) : ZerothHomo" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_componentMap_mk", + "line": 111, + "source_header": "und (p.map f.continuous))\n\ntheorem superlevel_componentMap_mk {X Y : Type w}\n [TopologicalSpace X] [TopologicalSpace Y] (f : C(X, Y)) (x : X) :\n superlevel_componentMap f (ZerothHomotopy.mk x)" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_componentMap_id", + "line": 115, + "source_header": "hHomotopy.mk (f x) := rfl\n\ntheorem superlevel_componentMap_id {X : Type w} [TopologicalSpace X] :\n superlevel_componentMap" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_componentMap_comp", + "line": 121, + "source_header": "opy.mk_surjective q\n rfl\n\ntheorem superlevel_componentMap_comp {X Y Z : Type w}\n [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z]\n (f : C(X, Y)) (g : C(Y, Z)) :\n superlevel_componentMap (g.comp f) =\n superlevel_componentMap g ∘" + }, + { + "kind": "def", + "unqualified_name": "superlevel_componentInclusion", + "line": 130, + "source_header": "opy.mk_surjective q\n rfl\n\ndef superlevel_componentInclusion {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) {s t : ℝ} (hst : s ≤ t) :\n ZerothHomotopy (superlevel_set g s) → ZerothHomo" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_componentInclusion_id", + "line": 135, + "source_header": "perlevel_inclusion g hst)\n\ntheorem superlevel_componentInclusion_id {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (t : ℝ) : superlevel_componentInc" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_componentInclusion_comp", + "line": 141, + "source_header": "opy.mk_surjective q\n rfl\n\ntheorem superlevel_componentInclusion_comp {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) {r s t : ℝ} (hrs : r ≤ s) (hst : s ≤ t) :\n superlevel_componentInclusion g (hrs.trans hst) =\n superlevel_componentInclusion g hst ∘ superlevel" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_component_eq_iff_joinedIn", + "line": 149, + "source_header": "opy.mk_surjective q\n rfl\n\n/-- Actual component equality is precisely a path in the ambient closed superlevel. -/\ntheorem superlevel_component_eq_iff_joinedIn {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (t : ℝ) (x y : superlevel_set g t) :\n ZerothHomotopy.mk x = ZerothHomotopy.mk y ↔\n JoinedIn (supe" + }, + { + "kind": "def", + "unqualified_name": "superlevel_filtration", + "line": 162, + "source_header": "xact ZerothHomotopy.sound p\n\n/-- The topological filtration in the preorder category of real numbers. -/\ndef superlevel_filtration {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "superlevel_h0Filtration", + "line": 178, + "source_header": "e C] [CategoryWithHomology C]\n\n/-- Actual singular H0 with coefficient object R, including the inclusion maps. -/\ndef superlevel_h0Filtration {X : Type w} [TopologicalSpace X]" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_h0Filtration_map_id", + "line": 183, + "source_header": "gularHomologyFunctor C 0).obj R\n\n/-- This target includes the actual H0 definition in the transitive dependency audit. -/\ntheorem superlevel_h0Filtration_map_id {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) (t : ℝ) :\n (superlevel_h0Filtration g R).map (𝟙 t) =\n 𝟙 ((su" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_h0Filtration_map_comp", + "line": 190, + "source_header": "rlevel_h0Filtration g R).map_id t\n\ntheorem superlevel_h0Filtration_map_comp {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) {r s t : ℝ} (f : r ⟶ s) (k : s ⟶ t) :\n (superlevel_h0Filtration g R).map (f ≫ k) =\n (superlevel_h0Filtration g R).map f ≫ (s" + } + ] + }, + { + "path": "companions/torus_filtration_20261011/TorusFiltration.lean", + "sha256": "cddb8bc93569edbcc913eb7c79e23f9a5a637924207aabc2c11c1ad7fe476a75", + "declarations_lexical": [] + }, + { + "path": "companions/torus_filtration_20261011/SuperlevelBarField.lean", + "sha256": "8a2470431c3fda5e98859aa9372cbb8866ed5c5c722cea5dfc28cb577840bbad", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_continuous", + "line": 49, + "source_header": "n\n\n/-- Proves: a smooth height in the Field sense is continuous.\nMethod: the `n = 0` instance of `IsSmooth` and `ContDiff.continuous`.\nDoes not establish: any regularity beyond continuity. -/\ntheorem superlevelBarField_continuous {d : ℕ} {g : E d → ℝ} (hg : IsSmooth d g) :\n Continuou" + }, + { + "kind": "def", + "unqualified_name": "superlevelBarField_interface", + "line": 56, + "source_header": "ous\n\n/-- Proves: the C263 data inhabit the Field interface for every dimension and period.\nMethod: death height and essentiality are the C263 definitions, the maximin clause is\n`superlevelBar_strict_cut`, and the elder relation is the right-hand side of its clause.\nDoes not establish: a persistence-module elder rule; `elderPartner_iff` holds by\ndefinition, and periodicity and `L` are not used. -/\ndef superlevelBarField_interface (d : ℕ) (L : ℝ) : SuperlevelBarInterface d L where\n deathH" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_nonempty", + "line": 72, + "source_header": "f.rfl\n\n/-- Proves: the Field superlevel-bar interface is inhabited for every `d` and `L`.\nMethod: the record above. Does not establish: that any inhabitant is the source's\nsuperlevel H0 object. -/\ntheorem superlevelBarField_nonempty (d : ℕ) (L : ℝ) :\n Nonempty (SuperlevelBarInterfa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_deathHeight_eq", + "line": 79, + "source_header": "ce d L⟩\n\n/-- Proves: the death height of the record is the C263 death height.\nMethod: `rfl`. Does not establish: a finite death for an essential point. -/\ntheorem superlevelBarField_deathHeight_eq {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :\n (superlevelBarField_interface d L).deathHeight g M = superlevelBar_deathH" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_isEssential_iff", + "line": 85, + "source_header": ":=\n rfl\n\n/-- Proves: essentiality in the record is global maximality.\nMethod: `Iff.rfl`. Does not establish: agreement with a persistence essential class. -/\ntheorem superlevelBarField_isEssential_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :\n (superlevelBarField_interface d L).IsEssential g M ↔ ∀ y" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_elderPartner_iff", + "line": 91, + "source_header": "=\n Iff.rfl\n\n/-- Proves: the elder relation of the record is, for every height, the right-hand side\nof the interface clause. Method: `Iff.rfl`, since it is defined that way.\nDoes not establish: that this relation is ordinary elder death in any persistence sense. -/\ntheorem superlevelBarField_elderPartner_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M S : E d) :\n (superlevelBarField_interface d L).ElderPartner g M S ↔\n (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ superlevelBar_isEssential g M ∧\n superlevelBar_deathHeig" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_essential_unique", + "line": 100, + "source_header": ":=\n Iff.rfl\n\n/-- Proves: on smooth periodic heights every inhabitant's essentiality is global maximality.\nMethod: its own `essential_iff` clause. Does not establish: anything off that locus. -/\ntheorem superlevelBarField_essential_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d) :\n I.IsEssential g M ↔ superlevelBar_" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_deathHeight_unique", + "line": 107, + "source_header": "l_iff g hs hp M\n\n/-- Proves: on smooth periodic heights every inhabitant's death height at a nonessential\npoint is the C263 death height. Method: its maximin clause is a strict cut for the\nclearance set, and `superlevelBar_cut_unique` leaves one such number.\nDoes not establish: agreement at essential points (see the control below). -/\ntheorem superlevelBarField_deathHeight_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d)\n (hM : ¬ I.IsEssential g M) :\n I.deathHeight g M = superlevelBa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_elderPartner_unique", + "line": 120, + "source_header": "n g hs hp M hM h)\n\n/-- Proves: on the Morse distinct-value locus of smooth periodic heights every inhabitant's\nelder relation is the record's. Method: both are their clause's right-hand side, whose\nessentiality and death-height terms agree by the two uniqueness theorems above.\nDoes not establish: agreement off the Morse distinct-value locus, where the interface\nconstrains no elder relation. -/\ntheorem superlevelBarField_elderPartner_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (hm : IsMorseDistinct d L g)\n (M S : E d) :\n I.ElderPartner g M S ↔ (superlevelBarField_interface d L)" + }, + { + "kind": "def", + "unqualified_name": "superlevelBarField_shift", + "line": 139, + "source_header": "hne').trans hdeath⟩\n\n/-- Proves: a second record, equal to the first except that its death height is the\nconstant `c` at essential points, also inhabits the interface. Method: off the essential\npoints it is the C263 death height, so the same strict cut applies; its elder relation is\nagain its clause's right-hand side. Does not establish: any preferred value at essential\npoints. -/\ndef superlevelBarField_shift (d : ℕ) (L c : ℝ) : SuperlevelBarInterface d" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_shift_deathHeight_const", + "line": 160, + "source_header": "_ _ _ _ _ => Iff.rfl\n\n/-- Proves: at a constant height the shifted record's death height is `c`.\nMethod: every point of a constant height is essential. Does not establish: a finite bar\nfor a constant height. -/\ntheorem superlevelBarField_shift_deathHeight_const (d : ℕ) (L c b : ℝ) (M : E d) :\n (superlevelBarField_shift d L c).deathHe" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_const_smooth", + "line": 171, + "source_header": "l\n rw [ite_eq_left hM]\n\n/-- Proves: constant heights are smooth. Method: `contDiff_const`.\nDoes not establish: anything about nonconstant heights. -/\ntheorem superlevelBarField_const_smooth (d : ℕ) (b : ℝ) : IsSm" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_const_periodic", + "line": 176, + "source_header": "fun _ => contDiff_const\n\n/-- Proves: constant heights are `L`-periodic. Method: both sides are the constant.\nDoes not establish: anything about the lattice. -/\ntheorem superlevelBarField_const_periodic (d : ℕ) (L b : ℝ) :\n IsLPeri" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_control_essential_free", + "line": 182, + "source_header": "d => b) :=\n fun _ _ => rfl\n\n/-- Proves: the nonessential hypothesis of `superlevelBarField_deathHeight_unique` cannot\nbe dropped: at the smooth periodic constant height `0` every point is essential for both\nrecords, the record's death height there is `0`, its shift by `1` has death height `1`,\nand the two differ. Method: `superlevelBar_death_const` and the shifted value.\nDoes not establish: anything about nonessential points, where all inhabitants agree. -/\ntheorem superlevelBarField_control_essential_free (d : ℕ) (L : ℝ) (M : E d) :\n IsSmooth d (fun _ : E d => (0 : ℝ)) ∧ IsLPeriodic d L (fun _ : E d => (0 : ℝ)) ∧\n (superlevelBarField_interface d L).IsEssential (fun _ => (0 : ℝ)) M ∧\n (superlevelBarField_shift d L 1).IsEssential (fun _ => (0 : ℝ)) M ∧\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M = 0 ∧\n (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : ℝ)) M = 1 ∧\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M ≠\n (superlevelBarField_shift d L 1).dea" + } + ] + }, + { + "path": "companions/torus_filtration_20261011/SuperlevelBar.lean", + "sha256": "346eea948e18d5904422904006827930e27d3141ccbc19ee8ac2c24bcf65a4a9", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "superlevelBar_E", + "line": 38, + "source_header": "n\n\n/-- Proves: the ambient type is real Euclidean space in the stated dimension.\nMethod: a type abbreviation. Does not establish: a positive-dimensional or\nperiodic quotient-space hypothesis. -/\nabbrev superlevelBar_E (d :" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_isEssential", + "line": 43, + "source_header": "d)\n\n/-- Proves: the essentiality datum is total. Method: global order comparison.\nDoes not establish: an actual persistence interpretation off the guarded locus. -/\ndef superlevelBar_isEssential {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) :" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_clearanceSet", + "line": 49, + "source_header": "≤ g M\n\n/-- Proves: a total strict-clearance set with the source's existential endpoint.\nMethod: quantify over actual paths and every parameter, including endpoints.\nDoes not establish: a path attaining the supremum with closed inequalities. -/\ndef superlevelBar_clearanceSet {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d)" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_deathHeight", + "line": 56, + "source_header": "(γ t)}\n\n/-- Proves: the death datum is a total real number with explicit empty default.\nMethod: nonempty conditional supremum; boundedness is proved below.\nDoes not establish: a finite death for an essential class. -/\ndef superlevelBar_deathHeight {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_essential_iff", + "line": 65, + "source_header": "M) else 0\n\n/-- Proves: essentiality is exactly global maximality for these total data.\nMethod: unfold the defining proposition. Does not establish: agreement with\nan independently defined essential persistence class. -/\ntheorem superlevelBar_essential_iff {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) :\n superlevelBar_isEssential g M ↔ ∀ y" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_mem_lt_start", + "line": 72, + "source_header": ":= Iff.rfl\n\n/-- Proves: an unconditional strict bound on each clearance member.\nMethod: evaluate its path at zero. Does not establish: an unconditional bound\non the default death value when the clearance set is empty. -/\ntheorem superlevelBar_mem_lt_start {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) {h : ℝ} (hh : h ∈ superlevelBar_clearanceSet g M)" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_bddAbove", + "line": 82, + "source_header": "] using hzero\n\n/-- Proves: the clearance set is bounded above, including when empty.\nMethod: the initial height bounds each member. Does not establish: that the\nempty-set default death value obeys the same bound. -/\ntheorem superlevelBar_clearance_bddAbove {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) : BddAbove (superlevelBar_cl" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_empty_of_essential", + "line": 89, + "source_header": "art g M hh).le⟩\n\n/-- Proves: essentiality forces the clearance set to be empty.\nMethod: contradict the required strictly higher endpoint.\nDoes not establish: a converse for arbitrary discontinuous heights. -/\ntheorem superlevelBar_clearance_empty_of_essential {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hM : superlevelBar_isEssential g M) : superlevelBar_cle" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_zero_of_empty", + "line": 102, + "source_header": "act False.elim hh\n\n/-- Proves: an empty clearance set selects the declared real value zero.\nMethod: simplify the conditional definition. Does not establish: a geometric\ndeath event or finite persistence interval at that zero. -/\ntheorem superlevelBar_death_eq_zero_of_empty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (he : superlevelBar_clearanceSet g M = ∅) : superlevelBar_" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_zero_of_essential", + "line": 111, + "source_header": "ar_deathHeight, he]\n\n/-- Proves: essential inputs have the declared zero default.\nMethod: essentiality implies empty clearance, then use the empty branch.\nDoes not establish: an essential-bar death height. -/\ntheorem superlevelBar_death_eq_zero_of_essential {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hM : superlevelBar_isEssential g M) : superlevelBa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_sSup_of_nonempty", + "line": 120, + "source_header": "_of_essential g M hM)\n\n/-- Proves: nonempty clearance selects its real supremum in the total data.\nMethod: simplify the nonempty conditional branch. Does not establish:\nnonemptiness without a witness or a regularity hypothesis. -/\ntheorem superlevelBar_death_eq_sSup_of_nonempty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hne : (superlevelBar_clearanceSet g M).Nonempty) :\n superlevelBar_deathHeight g M = sSup (superlev" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_path_minimum", + "line": 130, + "source_header": "eight, ite_eq_left hne]\n\n/-- Proves: a continuous height attains a minimum along each actual path.\nMethod: compact unit interval and the extreme-value theorem.\nDoes not establish: a minimum over all paths or an optimal path. -/\ntheorem superlevelBar_path_minimum {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) {M y : superlevelBar_E d} (γ : Path M y) :\n ∃ t₀ : unitInterval, ∀ t : unitInt" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_nonempty", + "line": 142, + "source_header": "=> hmin (Set.mem_univ t)⟩\n\n/-- Proves: nonessential continuous inputs have a nonempty clearance set.\nMethod: a higher endpoint, Path.segment, and minimum minus one.\nDoes not establish: compactness of the whole Euclidean domain. -/\ntheorem superlevelBar_clearance_nonempty {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n (superlevelBar" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_nonempty_iff", + "line": 163, + "source_header": "ave ht := hmin t\n linarith\n\n/-- Proves: for continuous heights, clearance is nonempty exactly off the\nessential locus. Method: the higher witness endpoint and the straight-path\nconstruction. Does not establish: this equivalence without continuity. -/\ntheorem superlevelBar_clearance_nonempty_iff {d : ℕ}\n (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d) :\n (superlevelBar_clearanceSet g M).Nonempty ↔ ¬" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_downward", + "line": 174, + "source_header": "Bar_clearance_nonempty g hg M\n\n/-- Proves: any smaller threshold than an existing clearance is a clearance.\nMethod: reuse the same endpoint and path and compose strict inequalities.\nDoes not establish: strict improvement to a larger threshold. -/\ntheorem superlevelBar_clearance_downward {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) {h c : ℝ} (hhc : h < c)\n (hc : c ∈ superlevelBar_clearanceSet g M) : h ∈" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_improve", + "line": 183, + "source_header": ", γ, fun t => hhc.trans (hγ t)⟩\n\n/-- Proves: each strict witness has a larger strict witness on its same path.\nMethod: attained minimum and a midpoint below it.\nDoes not establish: a witness with clearance strictly above the supremum. -/\ntheorem superlevelBar_clearance_improve {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d) {h : ℝ}\n (hh : h ∈ superlevelBar_clearanceSet g M) :\n ∃ c : ℝ, h < c ∧ c" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_strict_cut", + "line": 199, + "source_header": "have ht := hmin t\n linarith\n\n/-- Proves: the exact strict cut for continuous nonessential inputs.\nMethod: least-upper-bound property, downward closure and strict improvement.\nDoes not establish: closed-threshold attainment at the death height. -/\ntheorem superlevelBar_strict_cut {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) (h : ℝ) :\n h < superlevelBar_deathHeight g M ↔" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_le_start_of_nonempty", + "line": 223, + "source_header": "evelBar_clearance_bddAbove g M) hc)\n\n/-- Proves: the death value is at most the initial height when clearance is\nnonempty. Method: the supremum is at most this upper bound.\nDoes not establish: the bound on the empty default branch. -/\ntheorem superlevelBar_death_le_start_of_nonempty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hne : (superlevelBar_clearanceSet g M).Nonempty) :" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_le_start", + "line": 233, + "source_header": "uperlevelBar_mem_lt_start g M hh).le)\n\n/-- Proves: the death upper bound for continuous nonessential inputs.\nMethod: establish nonempty clearance and apply its guarded supremum bound.\nDoes not establish: a strict inequality or an attained optimal path. -/\ntheorem superlevelBar_death_le_start {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_eq_Iio", + "line": 242, + "source_header": "rlevelBar_clearance_nonempty g hg M hM)\n\n/-- Proves: the clearance set is the open lower interval below death on the\ncontinuous nonessential locus. Method: extensionality and the strict cut.\nDoes not establish: a closed-threshold path at the excluded endpoint. -/\ntheorem superlevelBar_clearance_eq_Iio {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n superlevelBar_clearanceSet g M" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_not_mem_clearance", + "line": 252, + "source_header": "uperlevelBar_strict_cut g hg M hM h).symm\n\n/-- Proves: death is not a strict clearance for continuous nonessential inputs.\nMethod: the cut would otherwise imply that death is strictly below itself.\nDoes not establish: failure or success of closed-threshold attainment. -/\ntheorem superlevelBar_death_not_mem_clearance {d : ℕ}\n (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n superlevelBar_death" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_cut_unique", + "line": 263, + "source_header": "Height g M)).2 hh\n exact (lt_irrefl _) hlt\n\n/-- Proves: uniqueness of a real number with this strict cut on the valid locus.\nMethod: evaluate either cut at the competing endpoint.\nDoes not establish: equality of arbitrary total interface records off that locus. -/\ntheorem superlevelBar_cut_unique {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) (a : ℝ)\n (ha : ∀ h : ℝ, h < a ↔ h ∈ superlevelBar_clearanceSet" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_const", + "line": 280, + "source_header": ").1 hlt\n exact (lt_irrefl a) ((ha a).2 hc)\n\n/-- Proves: any constant height selects the zero default at every point.\nMethod: every point is globally maximal, hence essential in these data.\nDoes not establish: any finite ordinary bar for that constant height. -/\ntheorem superlevelBar_death_const (d : ℕ) (b : ℝ) (M : superlevelBar_E d) :\n superlevelBar_dea" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_control_negative_essential", + "line": 289, + "source_header": "h_eq_zero_of_essential\n intro y\n exact le_rfl\n\n/-- Proves: the essential default forbids an unconditional death/start bound.\nMethod: constant height minus one has empty clearance and death zero.\nDoes not establish: any finite ordinary bar on a constant field. -/\ntheorem superlevelBar_control_negative_essential (d : ℕ) (M : superlevelBar_E d) :\n superlevelBar_deathHeight (fun _ : superlevelBar_E d => (-1 : ℝ)) M = 0 ∧\n ¬ superlevelBar_deathHeight (fu" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:companions/torus_filtration_20261011", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "companions/torus_filtration_20261011", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "companions/torus_filtration_20261011/TorusTopology.lean", + "sha256": "ddb145b3f791c181d4f2a51e54e711937297bd6476ba55bcd5252b7ddb57cfe1", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "torus_E", + "line": 21, + "source_header": "n\nabbrev torus_E (d : ℕ" + }, + { + "kind": "def", + "unqualified_name": "torus_latticeVec", + "line": 22, + "source_header": ")\n\n/-- The exact `Field.latticeVec` formula, retained without any coordinate rescaling. -/\ndef torus_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : torus_" + }, + { + "kind": "theorem", + "unqualified_name": "torus_field_latticeVec_formula", + "line": 26, + "source_header": "ℝ))\n\ntheorem torus_field_latticeVec_formula (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :\n torus_latticeVec d L n = ∑ i, EuclideanSpace.single i (L * (n i :" + }, + { + "kind": "def", + "unqualified_name": "torus_periodBasis", + "line": 29, + "source_header": "rfl\n\ndef torus_periodBasis (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Module.Basis (Fin d) ℝ (torus_E" + }, + { + "kind": "def", + "unqualified_name": "torus_periodLattice", + "line": 34, + "source_header": "e')\n\ndef torus_periodLattice (d : ℕ) (L : ℝ) (hL : 0 < L) : Submodule ℤ (torus_E" + }, + { + "kind": "abbrev", + "unqualified_name": "torus_quotient", + "line": 37, + "source_header": "L))\n\nabbrev torus_quotient (d : ℕ) (L : ℝ) (hL : 0 <" + }, + { + "kind": "def", + "unqualified_name": "torus_proj", + "line": 40, + "source_header": "oup\n\ndef torus_proj (d : ℕ) (L : ℝ) (hL : 0 < L) : torus_E d → torus_quotient d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_basis_sum_eq_latticeVec", + "line": 43, + "source_header": ".mk\n\n/-- Concrete adapter from integer basis coefficients to Field's exact vector formula. -/\ntheorem torus_basis_sum_eq_latticeVec (d : ℕ) (L : ℝ) (hL : 0 < L)\n (n : Fin d → ℤ) :\n ∑ i, n i • torus_periodBasis d L hL i = torus_latticeVec" + }, + { + "kind": "theorem", + "unqualified_name": "torus_lattice_mem_iff", + "line": 61, + "source_header": "hij]\n\ntheorem torus_lattice_mem_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x : torus_E d) :\n x ∈ torus_periodLattice d L hL ↔ ∃ n : Fin d → ℤ, torus_latticeVec d L" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_discrete", + "line": 68, + "source_header": "eVec]\n\ninstance torus_lattice_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :\n DiscreteTopology (torus_periodLattice d" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_addSubgroup_discrete", + "line": 73, + "source_header": "tance\n\ninstance torus_lattice_addSubgroup_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :\n DiscreteTopology (torus_periodLattice d L hL).toAddSub" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_isZLattice", + "line": 78, + "source_header": "tance\n\ninstance torus_lattice_isZLattice (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsZLattice ℝ (torus_periodLattice d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_surjective", + "line": 83, + "source_header": "tance\n\ntheorem torus_proj_surjective (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Function.Surjective (torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_continuous", + "line": 86, + "source_header": "ctive\n\ntheorem torus_proj_continuous (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Continuous (torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_eq_iff", + "line": 89, + "source_header": "t_mk'\n\ntheorem torus_proj_eq_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x y : torus_E d) :\n torus_proj d L hL x = torus_proj d L hL y ↔\n ∃ n : Fin d → ℤ, y = x + torus_latticeVec" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_lattice_translate", + "line": 102, + "source_header": "abel⟩\n\n/-- Duplicate representatives have exactly the same quotient image. -/\ntheorem torus_control_lattice_translate (d : ℕ) (L : ℝ) (hL : 0 < L)\n (x : torus_E d) (n : Fin d → ℤ) :\n torus_proj d L hL (x + torus_latticeVec d L n) = torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_isCoveringMap", + "line": 108, + "source_header": "⟩).symm\n\ntheorem torus_proj_isCoveringMap (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsCoveringMap (torus_proj" + }, + { + "kind": "theorem", + "unqualified_name": "torus_compact", + "line": 114, + "source_header": "ringMap\n\ntheorem torus_compact (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsCompact (Set.univ : Set (torus_quotient d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_pathConnectedSpace", + "line": 121, + "source_header": "] at hc\n\ntheorem torus_pathConnectedSpace (d : ℕ) (L : ℝ) (hL : 0 < L) :\n PathConnectedSpace (torus_quotient" + }, + { + "kind": "def", + "unqualified_name": "torus_isPeriodic", + "line": 125, + "source_header": "ient _)\n\n/-- Exact Field periodicity predicate with the literal lattice-vector adapter above. -/\ndef torus_isPeriodic (d : ℕ) (L : ℝ) (g : torus_E d →" + }, + { + "kind": "theorem", + "unqualified_name": "torus_field_periodic_formula", + "line": 129, + "source_header": "n) = g x\n\ntheorem torus_field_periodic_formula (d : ℕ) (L : ℝ) (g : torus_E d → ℝ) :\n torus_isPeriodic d L g ↔\n ∀ (x : EuclideanSpace ℝ (Fin d)) (n : Fin d → ℤ),\n g (x + ∑ i, EuclideanSpace.single i (L * (n i : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "torus_periodic_respects", + "line": 134, + "source_header": "= Iff.rfl\n\ntheorem torus_periodic_respects (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x y : torus_E d)\n (hxy : QuotientAddGroup.leftRel (torus_periodLattice d L hL).toAddSubgroup x y) :" + }, + { + "kind": "def", + "unqualified_name": "torus_descend", + "line": 142, + "source_header": "x n).symm\n\ndef torus_descend (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) : torus_quotient d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_descend_proj", + "line": 146, + "source_header": "hL g hg)\n\ntheorem torus_descend_proj (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x : torus_E d) :\n torus_descend d L hL g hg (torus_proj d L hL" + }, + { + "kind": "theorem", + "unqualified_name": "torus_descend_continuous", + "line": 150, + "source_header": "x := rfl\n\ntheorem torus_descend_continuous (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (hgc : Continuous g) :\n Continuous (torus_descend d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_path_lift_from", + "line": 155, + "source_header": "hL g hg)\n\n/-- Lift from a prescribed representative; the endpoint is determined existentially. -/\ntheorem torus_path_lift_from (d : ℕ) (L : ℝ) (hL : 0 < L)\n {M : torus_E d} {y : torus_quotient d L hL}\n (γ : Path (torus_proj d L hL M) y) :\n ∃ z : torus_E d, ∃ Γ : Path M z,\n torus_proj d L hL z = y ∧\n ∀ t : unitInterval, torus_proj d L hL" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_constant_path_endpoint", + "line": 169, + "source_header": "γ.source) t\n\n/-- Control: a constant projected path cannot be lifted from M to a different lift.\nThis refutes replacing the existential endpoint by an arbitrary chosen representative. -/\ntheorem torus_control_constant_path_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)\n {M z : torus_E d} (Γ : Path M z)\n (hΓ : ∀ t : unitInterval, torus_proj d L hL (Γ t) = torus_proj d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_no_arbitrary_endpoint", + "line": 179, + "source_header": "ngrFun heq 1)\n\n/-- Combining the duplicate-image and uniqueness controls gives a direct rejection\nof any different preselected endpoint for a constant quotient path. -/\ntheorem torus_control_no_arbitrary_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)\n (M : torus_E d) (n : Fin d → ℤ) (hn : torus_latticeVec d L n ≠ 0) :\n torus_proj d L hL (M + torus_latticeVec d L n) = torus_proj d L hL M ∧\n ¬ ∃ Γ : Path M (M + torus_latticeVec d L n),\n ∀ t : unitInterval, torus_proj d L hL (Γ t) = toru" + }, + { + "kind": "theorem", + "unqualified_name": "torus_higher_path_iff", + "line": 192, + "source_header": "impa using heq)\n\n/-- Higher-endpoint compatibility for any scalar path predicate, including strict\nand closed thresholds. No conclusion here asserts critical-level attainment. -/\ntheorem torus_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (P : ℝ → Prop) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, P (g (γ t))) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, P (torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_strict_higher_path_iff", + "line": 216, + "source_header": "ht\n exact ht\n\ntheorem torus_strict_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, h < torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_closed_higher_path_iff", + "line": 225, + "source_header": "(fun a => h < a)\n\ntheorem torus_closed_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h ≤ g (γ t)) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, h ≤ torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_global_max_iff", + "line": 234, + "source_header": "(fun a => h ≤ a)\n\ntheorem torus_global_max_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) :\n (∀ y : torus_E d, g y ≤ g M) ↔\n ∀ y : torus_quotient d L hL,\n torus_descend d L hL g hg y ≤ torus_descend d L hL g hg (tor" + } + ] + }, + { + "path": "companions/torus_filtration_20261011/OrdinaryH0Controls.lean", + "sha256": "df9d3645282ca526b67eca3d5db691b622092a14b5fddee9be21013e39666184", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "ordinaryH0Control_intCoeff", + "line": 63, + "source_header": "n\n\n/-- Proves: nothing; it names the integer coefficient object `ℤ` as a `ℤ`-module at universe 0.\nMethod: Mathlib's `ModuleCat.of`.\nDoes not establish: any homology computation. -/\nabbrev ordinaryH0Control_intCoeff : ModuleCat.{0" + }, + { + "kind": "abbrev", + "unqualified_name": "ordinaryH0Control_zeroCoeff", + "line": 68, + "source_header": "ℤ ℤ\n\n/-- Proves: nothing; it names the zero coefficient object, the one-point `ℤ`-module at universe 0.\nMethod: Mathlib's `ModuleCat.of` on `PUnit`.\nDoes not establish: any homology computation. -/\nabbrev ordinaryH0Control_zeroCoeff : ModuleCat." + }, + { + "kind": "abbrev", + "unqualified_name": "ordinaryH0Control_mod2Coeff", + "line": 73, + "source_header": "t.{1}\n\n/-- Proves: nothing; it names the characteristic-two coefficient object `ZMod 2` as a `ℤ`-module at universe 0.\nMethod: Mathlib's `ModuleCat.of`.\nDoes not establish: any homology computation. -/\nabbrev ordinaryH0Control_mod2Coeff : ModuleCa" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_intCoeff_id_ne_zero", + "line": 78, + "source_header": "ZMod 2)\n\n/-- Proves: the identity of the integer coefficient object is not the zero morphism.\nMethod: evaluate both morphisms at `1 : ℤ`, where they give `1` and `0`.\nDoes not establish: nonvanishing of any homology class by itself. -/\ntheorem ordinaryH0Control_intCoeff_id_ne_zero :\n (𝟙 ordinaryH0Control_intCoeff : ordinaryH0Control_intCoeff ⟶ ordinaryH0Control_intC" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_mod2Coeff_id_ne_zero", + "line": 88, + "source_header": "e_zero h1\n\n/-- Proves: the identity of the `ZMod 2` coefficient object is not the zero morphism.\nMethod: evaluate both morphisms at `1 : ZMod 2`, where they give `1` and `0`, which differ by `decide`.\nDoes not establish: nonvanishing of any homology class by itself. -/\ntheorem ordinaryH0Control_mod2Coeff_id_ne_zero :\n (𝟙 ordinaryH0Control_mod2Coeff : ordinaryH0Control_mod2Coeff ⟶ ordinaryH0Control_mod" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_mod2Coeff_id_add_self", + "line": 98, + "source_header": "(by decide)\n\n/-- Proves: the `ZMod 2` coefficient object has characteristic two: its identity added to itself is zero.\nMethod: pointwise, `x + x = 0` in `ZMod 2` by Mathlib's characteristic-two identity.\nDoes not establish: any homology computation. -/\ntheorem ordinaryH0Control_mod2Coeff_id_add_self :\n (𝟙 ordinaryH0Control_mod2Coeff : ordinaryH0Control_mod2Coeff ⟶ ordinaryH0Control_mod2Coeff) +\n 𝟙 ordinaryH0Control_" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_zeroCoeff_isZero", + "line": 108, + "source_header": "elf_eq_zero x\n\n/-- Proves: the one-point module is a zero object of `ModuleCat ℤ`.\nMethod: Mathlib's zero-object criterion for a subsingleton module.\nDoes not establish: vanishing of homology with nonzero coefficients. -/\ntheorem ordinaryH0Control_zeroCoeff_isZero : IsZero ordinaryH0Co" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_zeroCoeff_id_eq_zero", + "line": 114, + "source_header": "_subsingleton _\n\n/-- Proves: the identity of the zero coefficient object is the zero morphism.\nMethod: any two morphisms out of a zero object agree.\nDoes not establish: that the zero coefficient object satisfies the nonzero-coefficient hypothesis. -/\ntheorem ordinaryH0Control_zeroCoeff_id_eq_zero :\n (𝟙 ordinaryH0Control_zeroCoeff : ordinaryH0Control_zeroCoeff ⟶ ordinaryH0Contr" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_empty_components", + "line": 121, + "source_header": "ero.eq_of_src _ _\n\n/-- Proves: the empty space has no path component.\nMethod: every component is the class of a point, and the empty space has no point.\nDoes not establish: anything about a nonempty space. -/\ntheorem ordinaryH0Control_empty_components : IsEmpty (ZerothHomotopy" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_empty_componentCoproduct_isZero", + "line": 130, + "source_header": "exact Empty.elim x\n\n/-- Proves: the component-indexed coproduct of the empty space is a zero object for every coefficient module.\nMethod: its identity and zero morphism agree on every (absent) coproduct inclusion.\nDoes not establish: vanishing for a nonempty space with nonzero coefficients. -/\ntheorem ordinaryH0Control_empty_componentCoproduct_isZero (R : ModuleCat.{0} ℤ) :\n IsZero ((ordinaryH0_componentCoproductFunctor R).o" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_empty_h0_isZero", + "line": 139, + "source_header": "onents.false q).elim)\n\n/-- Proves: actual ordinary singular H0 of the empty space with integer coefficients is a zero object.\nMethod: transport the empty-coproduct zero object along the proved natural comparison `ordinaryH0_naturalIso`.\nDoes not establish: H0 of the empty space for coefficients other than `ℤ` (the zero-module case is `ordinaryH0Control_zeroCoeff_h0_isZero`), or anything about a nonempty space; no nonempty or `PathConnectedSpace` hypothesis is used. -/\ntheorem ordinaryH0Control_empty_h0_isZero :\n IsZero (((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).obj" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_zeroCoeff_componentCoproduct_isZero", + "line": 148, + "source_header": ".app (TopCat.of Empty))\n\n/-- Proves: with zero coefficients the component-indexed coproduct of every space is a zero object.\nMethod: its identity and zero morphism agree on every coproduct inclusion, each out of the zero module.\nDoes not establish: vanishing with nonzero coefficients. -/\ntheorem ordinaryH0Control_zeroCoeff_componentCoproduct_isZero (X : TopCat.{0}) :\n IsZero ((ordinaryH0_componentCoproductFunctor ordinaryH0" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_zeroCoeff_h0_isZero", + "line": 157, + "source_header": "eff_isZero.eq_of_src _ _)\n\n/-- Proves: with zero coefficients actual ordinary singular H0 of every space is a zero object.\nMethod: transport along the module's natural comparison `ordinaryH0_naturalIso` instantiated at the zero module.\nDoes not establish: any statement for nonzero coefficients, or that component distinctions are visible with zero coefficients. -/\ntheorem ordinaryH0Control_zeroCoeff_h0_isZero (X : TopCat.{0}) :\n IsZero (((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinary" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_point_augmentation", + "line": 165, + "source_header": "H0Control_zeroCoeff).app X)\n\n/-- Proves: the point class of the one-point space with integer coefficients augments to the identity of `ℤ`.\nMethod: specialize the module's ordinary augmentation formula.\nDoes not establish: reduced-H0 vanishing; this is the ordinary point class. -/\ntheorem ordinaryH0Control_point_augmentation :\n ordinaryH0_pointClass (TopCat.of Unit) ordinaryH0Control_intCoeff () ≫\n TopCat.singularHomology₀ε (TopCat.of Unit) ordinaryH0Control_intCoeff =" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_point_ne_zero", + "line": 174, + "source_header": "pointClass_augmentation _ _ _\n\n/-- Proves: the point class of the one-point space with integer coefficients is nonzero.\nMethod: the module's nonvanishing theorem with the proved nonzero identity of `ℤ`.\nDoes not establish: nonvanishing with zero coefficients. -/\ntheorem ordinaryH0Control_point_ne_zero :\n ordinaryH0_pointClass (TopCat.of Unit) or" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_point_h0_not_isZero", + "line": 182, + "source_header": "0Control_intCoeff_id_ne_zero ()\n\n/-- Proves: actual ordinary singular H0 of the one-point space with integer coefficients is not a zero object.\nMethod: a zero target would force the nonzero point class to vanish.\nDoes not establish: a computation of that H0 beyond its nonvanishing. -/\ntheorem ordinaryH0Control_point_h0_not_isZero :\n ¬ IsZero (((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intC" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_line_component_eq", + "line": 190, + "source_header": "l_point_ne_zero (h.eq_of_tgt _ _)\n\n/-- Proves: `0` and `1` lie in the same actual path component of the real line.\nMethod: the explicit path `t ↦ t` along the unit interval.\nDoes not establish: path-connectedness of any closed superlevel. -/\ntheorem ordinaryH0Control_line_component_eq :\n ZerothHomotopy.mk" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_line_difference_zero_int", + "line": 201, + "source_header": "urce' := rfl\n target' := rfl }\n\n/-- Proves: with integer coefficients the point classes of `0` and `1` in the real line have zero difference.\nMethod: the module's same-component theorem with the proved path premise.\nDoes not establish: that either individual point class dies. -/\ntheorem ordinaryH0Control_line_difference_zero_int :\n ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_intCoeff (0 : ℝ) -\n ordinaryH0_pointClass (TopCat.of ℝ) o" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_line_difference_zero_zeroCoeff", + "line": 209, + "source_header": "_ ordinaryH0Control_line_component_eq\n\n/-- Proves: with zero coefficients the point classes of `0` and `1` in the real line have zero difference.\nMethod: the module's same-component theorem, which carries no coefficient hypothesis.\nDoes not establish: any separation statement for zero coefficients. -/\ntheorem ordinaryH0Control_line_difference_zero_zeroCoeff :\n ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_zeroCoeff (0 : ℝ) -\n ordinaryH0_pointClass (TopCat.of ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_line_classes_ne_zero", + "line": 217, + "source_header": "_ _ ordinaryH0Control_line_component_eq\n\n/-- Proves: with integer coefficients each of the two same-component point classes in the real line is nonzero.\nMethod: the module's nonvanishing theorem with the proved nonzero identity of `ℤ`.\nDoes not establish: distinctness of the two classes, which are equal. -/\ntheorem ordinaryH0Control_line_classes_ne_zero :\n ordinaryH0_pointClass (TopCat.of ℝ) ordinaryH0Control_intCoeff (0 : ℝ) ≠ 0 ∧\n ordinaryH0_pointClass (TopCat.of" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_discrete_component_ne", + "line": 226, + "source_header": "ordinaryH0Control_intCoeff_id_ne_zero _⟩\n\n/-- Proves: distinct points of a discrete space lie in distinct actual path components.\nMethod: a path is a continuous map from the connected unit interval into a discrete space, hence constant.\nDoes not establish: anything about path components of a non-discrete space. -/\ntheorem ordinaryH0Control_discrete_component_ne {X : Type} [TopologicalSpace X] [DiscreteTopology X]\n {x y : X} (hxy : x ≠ y)" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_bool_component_ne", + "line": 237, + "source_header": "w [p.source, p.target] at hc\n exact hxy hc\n\n/-- Proves: `true` and `false` lie in distinct actual path components of the discrete space `Bool`.\nMethod: the discrete-space separation above with `true ≠ false` by `decide`.\nDoes not establish: anything about connected components of other spaces. -/\ntheorem ordinaryH0Control_bool_component_ne :\n Zer" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_bool_pointClass_ne", + "line": 244, + "source_header": "ryH0Control_discrete_component_ne (by decide)\n\n/-- Proves: with integer coefficients the point classes of `true` and `false` in `Bool` differ.\nMethod: the module's separation theorem with the two proved premises.\nDoes not establish: separation with zero coefficients. -/\ntheorem ordinaryH0Control_bool_pointClass_ne :\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff true ≠\n ordinaryH0_pointClass (T" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_bool_pointClass_ne_mod2", + "line": 253, + "source_header": "ero _ _\n ordinaryH0Control_bool_component_ne\n\n/-- Proves: with `ZMod 2` coefficients, a characteristic-two object, the point classes of `true` and `false` in `Bool` differ.\nMethod: the module's separation theorem with the proved nonzero identity of `ZMod 2` and the proved component separation.\nDoes not establish: separation for every characteristic-two coefficient object, or with zero coefficients. -/\ntheorem ordinaryH0Control_bool_pointClass_ne_mod2 :\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_mod2Coeff true ≠\n ordinaryH0_pointClass (" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0Control_collapse", + "line": 262, + "source_header": "_zero _ _\n ordinaryH0Control_bool_component_ne\n\n/-- Proves: nothing; it names the continuous collapse of `Bool` onto the one-point space.\nMethod: Mathlib's constant continuous map.\nDoes not establish: any homology statement by itself. -/\ndef ordinaryH" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_collapse_difference_zero", + "line": 268, + "source_header": "nit :=\n TopCat.ofHom (ContinuousMap.const Bool ())\n\n/-- Proves: with integer coefficients the collapse kills the difference of the two point classes of `Bool`.\nMethod: the module's merger criterion with the proved target-component equality in the one-point space.\nDoes not establish: that an individual point class dies. -/\ntheorem ordinaryH0Control_collapse_difference_zero :\n (ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff true -\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff false) ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_i" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_collapse_image_ne_zero", + "line": 278, + "source_header": "_ ordinaryH0Control_intCoeff_id_ne_zero _ _ _).2 rfl\n\n/-- Proves: with integer coefficients each image point class under the collapse is nonzero.\nMethod: actual point-class transport followed by the module's nonvanishing theorem.\nDoes not establish: distinctness of the two image classes, which are equal. -/\ntheorem ordinaryH0Control_collapse_image_ne_zero (b : Bool) :\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff b ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_collapse_difference_dies_classes_survive", + "line": 288, + "source_header": "ass_ne_zero _ _ ordinaryH0Control_intCoeff_id_ne_zero _\n\n/-- Proves: a merger kills the difference of the two point classes of `Bool` while each image class survives.\nMethod: combine the two collapse controls above.\nDoes not establish: a Morse merger event, elder selection or death height. -/\ntheorem ordinaryH0Control_collapse_difference_dies_classes_survive :\n (ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff true -\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff false) ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Control_intCoeff).map\n ordinaryH0Control_collapse = 0 ∧\n ∀ b : Bool, ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_intCoeff b ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordinaryH0Contr" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0Control_fst", + "line": 301, + "source_header": "ifference_zero, ordinaryH0Control_collapse_image_ne_zero⟩\n\n/-- Proves: nothing; it names the continuous first projection of the discrete square `Bool × Bool` onto `Bool`, a non-injective map.\nMethod: Mathlib's continuous first projection.\nDoes not establish: any homology statement by itself. -/\ndef ordin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_square_differences_ne_zero", + "line": 307, + "source_header": "TopCat.of Bool :=\n TopCat.ofHom ⟨Prod.fst, continuous_fst⟩\n\n/-- Proves: with integer coefficients, before any map, the differences of the classes of `(true, false)` and `(true, true)`, and of `(true, false)` and `(false, true)`, in the discrete square are both nonzero.\nMethod: the module's separation theorem with the proved discrete-space component separation, then `sub_ne_zero`.\nDoes not establish: any statement about their images. -/\ntheorem ordinaryH0Control_square_differences_ne_zero :\n ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, true) : Bool × Bool) ≠ 0 ∧\n ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool × Bool))" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_fst_difference_zero", + "line": 320, + "source_header": "ntrol_discrete_component_ne (X := Bool × Bool) (by decide)))⟩\n\n/-- Proves: with integer coefficients the projection kills the difference of the classes of `(true, false)` and `(true, true)`, whose images coincide.\nMethod: the module's merger criterion with the proved target-component equality.\nDoes not establish: that an individual point class dies. -/\ntheorem ordinaryH0Control_fst_difference_zero :\n (ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, true) : Bool × Bool)) ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj ordi" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_fst_difference_ne_zero", + "line": 330, + "source_header": "q_zero_iff _ ordinaryH0Control_intCoeff_id_ne_zero _ _ _).2 rfl\n\n/-- Proves: with integer coefficients the same non-injective projection keeps the difference of the classes of `(true, false)` and `(false, true)` nonzero, since their images `true` and `false` stay in distinct components.\nMethod: the module's merger criterion, used contrapositively with the proved separation of the image components.\nDoes not establish: injectivity of the induced H0 map, which fails on the first pair. -/\ntheorem ordinaryH0Control_fst_difference_ne_zero :\n (ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((true, false) : Bool × Bool) -\n ordinaryH0_pointClass (TopCat.of (Bool × Bool)) ordinaryH0Control_intCoeff ((false, true) : Bool × Bool)) ≫\n ((singularHomologyFunctor (ModuleCat.{0} ℤ) 0).obj or" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_bool_zeroCoeff_eq", + "line": 341, + "source_header": "_intCoeff_id_ne_zero]\n exact ordinaryH0Control_bool_component_ne\n\n/-- Proves: with zero coefficients the point classes of `true` and `false` in `Bool` are equal.\nMethod: any two morphisms out of the zero coefficient object agree.\nDoes not establish: equality of their path components, which differ. -/\ntheorem ordinaryH0Control_bool_zeroCoeff_eq :\n ordinaryH0_pointClass (TopCat.of Bool) ordinaryH0Control_zeroCoeff true =\n ordin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_point_zeroCoeff_eq_zero", + "line": 349, + "source_header": "roCoeff false :=\n ordinaryH0Control_zeroCoeff_isZero.eq_of_src _ _\n\n/-- Proves: with zero coefficients the point class of the one-point space is zero.\nMethod: any two morphisms out of the zero coefficient object agree.\nDoes not establish: vanishing of ordinary H0 with nonzero coefficients. -/\ntheorem ordinaryH0Control_point_zeroCoeff_eq_zero :\n ordi" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_separation_needs_nonzero", + "line": 356, + "source_header": "eroCoeff () = 0 :=\n ordinaryH0Control_zeroCoeff_isZero.eq_of_src _ _\n\n/-- Proves: the separation statement is false once its nonzero-coefficient hypothesis is deleted.\nMethod: the zero-coefficient fixture on `Bool` has distinct components and equal point classes.\nDoes not establish: any failure of the module's statements, which retain that hypothesis. -/\ntheorem ordinaryH0Control_separation_needs_nonzero :\n ¬ ∀ (X : TopCat.{0}) (R : ModuleCat.{0} ℤ) (x y : X),\n ZerothHomotopy.mk x ≠ ZerothHomotopy.m" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_nonvanishing_needs_nonzero", + "line": 366, + "source_header": "ordinaryH0Control_bool_component_ne ordinaryH0Control_bool_zeroCoeff_eq\n\n/-- Proves: the nonvanishing statement is false once its nonzero-coefficient hypothesis is deleted.\nMethod: the zero-coefficient fixture on the one-point space has a zero point class.\nDoes not establish: any failure of the module's statements, which retain that hypothesis. -/\ntheorem ordinaryH0Control_nonvanishing_needs_nonzero :\n ¬ ∀ (X : T" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0Control_parabolaLeft", + "line": 373, + "source_header": "ordinaryH0Control_zeroCoeff () ordinaryH0Control_point_zeroCoeff_eq_zero\n\n/-- Proves: nothing; it names the point `-1` of the closed superlevel of `x ↦ x ^ 2` at parameter `-1`.\nMethod: membership is `-(-1) ≤ (-1) ^ 2`, checked by `norm_num`.\nDoes not establish: any component statement by itself. -/\nde" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0Control_parabolaRight", + "line": 379, + "source_header": "level_set (fun x : ℝ => x ^ 2) (-1) :=\n ⟨-1, by norm_num [superlevel_set]⟩\n\n/-- Proves: nothing; it names the point `1` of the closed superlevel of `x ↦ x ^ 2` at parameter `-1`.\nMethod: membership is `-(-1) ≤ 1 ^ 2`, checked by `norm_num`.\nDoes not establish: any component statement by itself. -/\nd" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_le", + "line": 385, + "source_header": "perlevel_set (fun x : ℝ => x ^ 2) (-1) :=\n ⟨1, by norm_num [superlevel_set]⟩\n\n/-- Proves: the closed-superlevel parameter `-1` lies below `-1/4`, so the inclusion of the level at `-1` into the level at `-1/4` exists.\nMethod: `norm_num`.\nDoes not establish: any component or homology st" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_strict_growth", + "line": 391, + "source_header": ". -/\ntheorem ordinaryH0Control_parabola_le : (-1 : ℝ) ≤ -1 / 4 := by\n norm_num\n\n/-- Proves: the inclusion from parameter `-1` to `-1/4` is strict: `-1 < -1/4`, and `1/2` lies in the level `{x | 1/4 ≤ x ^ 2}` but not in `{x | 1 ≤ x ^ 2}`.\nMethod: `norm_num` on the three numeric facts.\nDoes not establish: any component or homology statement by itself. -/\ntheorem ordinaryH0Control_parabola_strict_growth :\n (-1 : ℝ) < -1 / 4 ∧ (1 / 2 : ℝ) ∈ superlevel_set (fun x : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_not_joined_quarter", + "line": 399, + "source_header": "=> x ^ 2) (-1) := by\n refine ⟨by norm_num, ?_, ?_⟩ <;> norm_num [superlevel_set]\n\n/-- Proves: `-1` and `1` are not joined inside the closed superlevel `{x | 1/4 ≤ x ^ 2}` of `x ↦ x ^ 2` at parameter `-1/4`.\nMethod: intermediate value theorem; a joining path would pass through `0`, which lies outside that level.\nDoes not establish: a first merger level or threshold attainment. -/\ntheorem ordinaryH0Control_parabola_not_joined_quarter :\n ¬ JoinedIn (superlevel_set (fun x : ℝ => x ^ 2) (-1" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_joined", + "line": 413, + "source_header": "laRight]⟩\n have hmem := hγ t\n rw [ht] at hmem\n norm_num [superlevel_set] at hmem\n\n/-- Proves: `-1` and `1` are joined inside the closed superlevel of `x ↦ x ^ 2` at parameter `0`, which is the whole line.\nMethod: the straight segment lies in that level because squares are nonnegative.\nDoes not establish: path-connectedness of any other level. -/\ntheorem ordinaryH0Control_parabola_joined :\n JoinedIn (superlevel_set (fun x : ℝ => x" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_difference_zero", + "line": 425, + "source_header": "(by\n intro z _\n show -(0 : ℝ) ≤ z ^ 2\n rw [neg_zero]\n exact sq_nonneg z)\n\n/-- Proves: with integer coefficients the closed-superlevel inclusion from parameter `-1` to `0` kills the difference of the classes of `-1` and `1`.\nMethod: the module's filtration criterion with the proved target-level path.\nDoes not establish: that either included point class dies, or that `0` is the first merger level. -/\ntheorem ordinaryH0Control_parabola_difference_zero :\n (ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaLeft -\n ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaRight) ≫\n (superlevel_h0Filtration (fun x : ℝ => x ^ 2) ordinaryH0Co" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0Control_parabola_strict_difference_ne_zero", + "line": 438, + "source_header": "_ ordinaryH0Control_intCoeff_id_ne_zero\n _ _ _).2 ordinaryH0Control_parabola_joined\n\n/-- Proves: with integer coefficients the strict closed-superlevel inclusion from parameter `-1` to `-1/4` keeps the difference of the classes of `-1` and `1` nonzero.\nMethod: the module's filtration criterion, used contrapositively with the proved absence of a path in the target level.\nDoes not establish: the behaviour at any parameter strictly between `-1/4` and `0`, or the first merger level. -/\ntheorem ordinaryH0Control_parabola_strict_difference_ne_zero :\n (ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaLeft -\n ordinaryH0_pointClass (TopCat.of (superlevel_set (fun x : ℝ => x ^ 2) (-1)))\n ordinaryH0Control_intCoeff ordinaryH0Control_parabolaRight) ≫\n (superlevel_h0Filtration (fun x : ℝ => x ^" + } + ] + }, + { + "path": "companions/torus_filtration_20261011/OrdinaryH0.lean", + "sha256": "3d6b0d6b53413c484b1d010bccf0d53ae7f75becb2d747868f22dbd673fe0a88", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentFunctor", + "line": 44, + "source_header": "n\n\n/-- Proves: actual path-component quotients form a functor on topological spaces.\nMethod: use the existing continuous-map quotient map and its identity/composition laws.\nDoes not establish: equality of connected and path-connected components. -/\ndef ordinaryH0_componentFunctor : TopCat.{w} ⥤ Type w where\n ob" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentCoproductFunctor", + "line": 61, + "source_header": "C]\n\n/-- Proves: the component-indexed coproduct construction is a functor.\nMethod: compose the actual component functor with the categorical coproduct functor.\nDoes not establish: an identification with homology until naturality is proved below. -/\ndef ordinaryH0_componentCoproductFunctor (R : C) : TopCat.{w" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentCoproductMap_iota", + "line": 67, + "source_header": "obj R\n\n/-- Proves: a coproduct generator maps to the component of its continuous image.\nMethod: the universal coproduct map sends each inclusion to its indexed image.\nDoes not establish: that distinct source components stay distinct. -/\ntheorem ordinaryH0_componentCoproductMap_iota (R : C) {X Y : TopCat.{w}}\n (f : X ⟶ Y) (q : ZerothHomotopy X) :\n Sigma.ι (fun _ : ZerothHomotopy X => R) q ≫\n (ordinaryH0_componentCoproductFunctor R).map f =\n Sigma.ι (fun _ : ZerothHomotopy Y => R) (superlevel_componentMap f" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentFiltration", + "line": 77, + "source_header": "aConst]\n\n/-- Proves: the existing closed-superlevel family has a component-indexed coproduct filtration.\nMethod: compose its actual continuous inclusions with the proved component coproduct functor.\nDoes not establish: regularity, finite dimensionality, or Morse hypotheses for the height function. -/\ndef ordinaryH0_componentFiltration {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentFiltration_map_iota", + "line": 84, + "source_header": "Functor R\n\n/-- Proves: a filtration component generator maps by the existing actual component inclusion.\nMethod: specialize the coproduct generator map formula to a closed-superlevel inclusion.\nDoes not establish: a reverse inclusion or endpoint deletion. -/\ntheorem ordinaryH0_componentFiltration_map_iota {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t)\n (q : ZerothHomotopy (superlevel_set g s)) :\n Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g s) => R) q ≫\n (ordinaryH0_componentFiltration g R).map (homOfLE hst) =\n Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g t) => R)\n (superlevel_componentInclusi" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_simplicialPointClass", + "line": 99, + "source_header": "Homology C]\n\n/-- Proves: a zero-simplex defines a morphism into actual simplicial homology.\nMethod: include its chain generator, lift through the zero differential, then take its class.\nDoes not establish: a replacement definition of homology or any naturality premise. -/\ndef ordinaryH0_simplicialPointClass (S : SSet.{w}) (R : C) (x : S _⦋0⦌) :\n R ⟶ S" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_simplicialPointClass_iso", + "line": 107, + "source_header": ").homologyπ 0\n\n/-- Proves: the existing simplicial H0 isomorphism sends a point class to its component.\nMethod: apply Mathlib's zero-cycle generator formula.\nDoes not establish: naturality merely from the existence of the objectwise isomorphism. -/\ntheorem ordinaryH0_simplicialPointClass_iso (S : SSet.{w}) (R : C)\n (x : S _⦋0⦌) :\n ordinaryH0_simplicialPointClass S R x ≫ (S.homology₀Iso R).hom =\n Sigma.ι (fun _ : S.π₀ => R)" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_simplicialPointClass_map", + "line": 117, + "source_header": "y₀Iso_hom S R x\n\n/-- Proves: the actual simplicial homology map carries a point class to its image class.\nMethod: homology projection naturality, cycle-lift naturality, and the chain generator formula.\nDoes not establish: a transported or postulated substitute for the actual homology map. -/\ntheorem ordinaryH0_simplicialPointClass_map (R : C) {S T : SSet.{w}}\n (f : S ⟶ T) (x : S _⦋0⦌) :\n ordinaryH0_simplicialPointClass S R x ≫ SSet.homologyMap f R 0 =\n ordinaryH0_simplicialPointClas" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_toSSet_pointMap", + "line": 128, + "source_header": "hainComplexMap_f]\n\n/-- Proves: the singular zero-simplex of a point maps to that of its continuous image.\nMethod: unfold the point/simplex correspondence and the singular-set map.\nDoes not establish: a chain or homology identification by itself. -/\ntheorem ordinaryH0_toSSet_pointMap {X Y : TopCat.{w}} (f : X ⟶ Y) (x : X) :\n (TopCat.toSSet.map f).app _ (TopCat.toSSetObj₀Equiv.symm x) =\n TopCat.toSSetO" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_pointClass", + "line": 136, + "source_header": "m (f x) := by\n rfl\n\n/-- Proves: each point has its actual ordinary singular zero-homology class morphism.\nMethod: use the actual singular zero-simplex and the cycle/projection construction above.\nDoes not establish: a free-module definition standing in for singular H0. -/\ndef ordinaryH0_pointClass (X : TopCat.{w}) (R : C) (x : X) :\n R ⟶ ((singularHomologyFunc" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_map", + "line": 144, + "source_header": "SSetObj₀Equiv.symm x)\n\n/-- Proves: actual continuous-map-induced singular H0 maps transport point classes.\nMethod: specialize the proved simplicial generator naturality to the singular-set functor.\nDoes not establish: injectivity of the induced map. -/\ntheorem ordinaryH0_pointClass_map (R : C) {X Y : TopCat.{w}}\n (f : X ⟶ Y) (x : X) :\n ordinaryH0_pointClass X R x ≫ ((singularHomologyFunctor C 0).obj R).map f =\n ordinary" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_iso", + "line": 158, + "source_header": "naryH0_toSSet_pointMap]\n\n/-- Proves: Mathlib's existing topological comparison sends actual point classes to components.\nMethod: combine the simplicial generator formula with the actual path-component equivalence.\nDoes not establish: any connected-component substitution. -/\ntheorem ordinaryH0_pointClass_iso (X : TopCat.{w}) (R : C) (x : X) :\n ordinaryH0_pointClass X R x ≫ (TopCat.singularHomology₀Iso X R).hom =\n Sigma.ι (fun _ : ZerothHomotopy X =>" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentIota_isoInv", + "line": 171, + "source_header": "_iso]\n simp [sigmaConst]\n\n/-- Proves: inverse comparison takes each component generator to any representing point class.\nMethod: cancel the comparison isomorphism and use the point-class formula.\nDoes not establish: a choice of distinguished geometric representative. -/\ntheorem ordinaryH0_componentIota_isoInv (X : TopCat.{w}) (R : C) (x : X) :\n Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) ≫\n (TopCat.singularHomology₀Iso X R).inv =" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_hom_ext", + "line": 180, + "source_header": "ordinaryH0_pointClass_iso]\n\n/-- Proves: morphisms out of actual singular H0 agree if they agree on all point classes.\nMethod: cancel the inverse comparison, use coproduct extensionality and quotient surjectivity.\nDoes not establish: a basis of geometric maxima or finiteness of components. -/\ntheorem ordinaryH0_hom_ext (X : TopCat.{w}) (R : C) {A : C}\n {f g : ((singularHomologyFunctor C 0).obj R).obj X ⟶ A}\n (h : ∀ x : X, ordinaryH0_pointClass X R x ≫ f = ordinaryH0_poin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_iso_naturality", + "line": 193, + "source_header": "mponentIota_isoInv] using h x\n\n/-- Proves: the existing actual singular H0 comparison commutes with every continuous map.\nMethod: test both composites on actual point classes, transport them, and compare component images.\nDoes not establish: naturality by adding an assumption or a compatibility record. -/\ntheorem ordinaryH0_iso_naturality (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) :\n ((singularHomologyFunctor C 0).obj R).map f ≫\n (TopCat.singularHomology₀Iso Y R).hom =\n (TopCat.singularHomology₀Iso X R).hom ≫\n (ordinaryH0_com" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_naturalIso", + "line": 209, + "source_header": "mponentCoproductMap_iota]\n rfl\n\n/-- Proves: actual ordinary singular H0 is naturally isomorphic to component-indexed coproducts.\nMethod: assemble the existing objectwise isomorphisms using the commuting square proved above.\nDoes not establish: an interval decomposition or persistence-bar classification. -/\ndef ordinaryH0_naturalIso (R : C) :\n (singularHomologyFunctor C 0).obj R ≅ ordin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_augmentation", + "line": 217, + "source_header": "=> ordinaryH0_iso_naturality R f)\n\n/-- Proves: ordinary augmentation sends every actual point-class morphism to the coefficient identity.\nMethod: use the comparison's augmentation formula and the coproduct universal property.\nDoes not establish: reduced-H0 vanishing; this retains the ordinary point class. -/\ntheorem ordinaryH0_pointClass_augmentation (X : TopCat.{w}) (R : C) (x : X) :\n ordinaryH0_pointClass X R x ≫" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_ne_zero", + "line": 226, + "source_header": "ordinaryH0_pointClass_iso]\n simp\n\n/-- Proves: an actual point class is nonzero for a coefficient object with nonzero identity.\nMethod: compose a proposed zero class with ordinary augmentation.\nDoes not establish: nonzero classes for a zero coefficient object. -/\ntheorem ordinaryH0_pointClass_ne_zero (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x :" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_eq_of_component_eq", + "line": 236, + "source_header": ", zero_comp] at hε\n exact hR hε.symm\n\n/-- Proves: points in the same actual path component give equal ordinary H0 class morphisms.\nMethod: cancel the objectwise comparison and compare their component indices.\nDoes not establish: a converse for zero coefficients. -/\ntheorem ordinaryH0_pointClass_eq_of_component_eq (X : TopCat.{w}) (R : C)\n (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :\n ordinaryH0_pointCl" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_sameComponent_difference_zero", + "line": 245, + "source_header": "lass_iso, ordinaryH0_pointClass_iso, h]\n\n/-- Proves: the difference of same-component point classes is zero for arbitrary coefficients.\nMethod: subtract the equality proved from actual path-component equality.\nDoes not establish: that either individual point class dies. -/\ntheorem ordinaryH0_sameComponent_difference_zero (X : TopCat.{w}) (R : C)\n (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :\n ordinaryH0_pointClas" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_ne_of_component_ne", + "line": 253, + "source_header": "s_eq_of_component_eq X R x y h, sub_self]\n\n/-- Proves: distinct actual path components have distinct ordinary H0 class morphisms if coefficients are nonzero.\nMethod: separate the two coproduct injections by an identity/zero component projection.\nDoes not establish: distinction with zero coefficients or distinction of points within one component. -/\ntheorem ordinaryH0_pointClass_ne_of_component_ne (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X)\n (hxy : ZerothHomotopy.mk x ≠ ZerothHomotopy.mk y) :\n ordinaryH0_poi" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_eq_iff", + "line": 271, + "source_header": "ymm hxy] using congrArg (fun k => k ≫ p) hc\n\n/-- Proves: with nonzero coefficients, actual point-class equality is exactly path-component equality.\nMethod: combine the same-component formula with the separating projection control.\nDoes not establish: equality of geometric points or connected components. -/\ntheorem ordinaryH0_pointClass_eq_iff (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X) :\n ordinaryH0_pointClass X R x = ordinaryH0_pointClass X R y ↔" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_difference_map", + "line": 284, + "source_header": "inaryH0_pointClass_eq_of_component_eq X R x y\n\n/-- Proves: the actual H0 map sends a difference of point classes to the difference of image classes.\nMethod: distribute composition over subtraction and use proved actual point-class transport.\nDoes not establish: death of the individual ordinary point classes. -/\ntheorem ordinaryH0_difference_map (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫\n ((singularHomologyFunctor C 0).obj R).map f =\n ordinaryH0_pointCl" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_difference_map_eq_zero_iff", + "line": 293, + "source_header": "ryH0_pointClass_map, ordinaryH0_pointClass_map]\n\n/-- Proves: with nonzero coefficients, a mapped difference vanishes exactly when the image points merge in path components.\nMethod: actual homology-map transport, subtraction cancellation, and the component equality criterion.\nDoes not establish: a Morse merger event, elder selection, death height, or barcode. -/\ntheorem ordinaryH0_difference_map_eq_zero_iff (R : C) (hR : (𝟙 R : R ⟶ R) ≠ 0)\n {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫\n ((singularHomologyFunctor C 0).obj R).map f = 0 ↔" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_filtrationIso", + "line": 303, + "source_header": "sub_eq_zero, ordinaryH0_pointClass_eq_iff Y R hR]\n\n/-- Proves: the existing actual singular H0 filtration is naturally isomorphic to its component coproduct filtration.\nMethod: restrict the proved natural comparison along the existing topological filtration.\nDoes not establish: the later interval, elder, maximum/saddle, count, Field, or stochastic bridges. -/\ndef ordinaryH0_filtrationIso {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) :\n superlevel_h0" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_filtration_naturality", + "line": 311, + "source_header": "(superlevel_filtration g) (ordinaryH0_naturalIso R)\n\n/-- Proves: all ordered closed-superlevel inclusion maps satisfy the actual H0/component square.\nMethod: read the naturality of the proved filtration isomorphism at the preorder morphism.\nDoes not establish: strict-level conventions or any unproved geometric persistence hypothesis. -/\ntheorem ordinaryH0_filtration_naturality {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t) :\n (superlevel_h0Filtration g R).map (homOfLE hst) ≫\n (ordinaryH0_filtrationIso g R).hom.app t =\n (ordinaryH0_filtrationIso g R).hom.app s ≫\n (" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_filtration_difference_zero_iff_joinedIn", + "line": 322, + "source_header": "aryH0_filtrationIso g R).hom.naturality (homOfLE hst)\n\n/-- Proves: under a closed-superlevel inclusion, a difference vanishes exactly when the two included points are joined in the target closed superlevel.\nMethod: apply the actual H0 difference control and the existing component/JoinedIn equivalence.\nDoes not establish: attainment of a critical death threshold or an elder/barcode theorem. -/\ntheorem ordinaryH0_filtration_difference_zero_iff_joinedIn\n {X : Type w} [TopologicalSpace X] (g : X → ℝ) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) {s t : ℝ} (hst : s ≤ t)\n (x y : superlevel_set g s) :\n (ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R x -\n ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R y) ≫\n (superlevel_h0Filtration g R).map (homOfLE hst" + } + ] + }, + { + "path": "companions/torus_filtration_20261011/ClosedSuperlevel.lean", + "sha256": "90d1481b75d9c6d14e462c3fbf0bf7c7cdd0efb9eaad68d6732400658753b1c2", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "superlevel_set", + "line": 21, + "source_header": "n\n/-- The increasing closed-superlevel family, with parameter `t = -h`. -/\ndef superlevel_set {X : Type*} (g : X → ℝ) (t : ℝ) : Se" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_closed_endpoint", + "line": 24, + "source_header": "x}\n\n/-- Control: the point at the threshold belongs to the closed superlevel.\nChanging `≤` to `<` invalidates this statement. -/\ntheorem superlevel_control_closed_endpoint (b : ℝ) :\n () ∈ superlevel_set (fun _ : Unit => b)" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_strict_endpoint", + "line": 30, + "source_header": "_set]\n\n/-- Control: the strict condition fails at that same threshold. -/\ntheorem superlevel_control_strict_endpoint (b : ℝ) :\n ¬ (-(-b) < (fun _ : Unit =>" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_parameter_sign", + "line": 35, + "source_header": "simp\n\n/-- Control: at parameter `1` the constant height `0` is present.\nChanging `-t` to `t` invalidates this statement. -/\ntheorem superlevel_control_parameter_sign :\n () ∈ superlevel_set (fun _ : Unit => (" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_inclusion_direction", + "line": 41, + "source_header": "evel_set]\n\n/-- Control: inclusion cannot run from parameter `1` back to `-1`. -/\ntheorem superlevel_control_inclusion_direction :\n ¬ superlevel_set (fun _ : Unit => (0 : ℝ)) 1 ⊆\n superlevel_set (fun _ : Unit => (0" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_essential", + "line": 49, + "source_header": "_set] at hc\n\n/-- A global maximum has no strictly higher endpoint, regardless of paths. -/\ntheorem superlevel_control_essential {X : Type*} (g : X → ℝ) (M : X)\n (hM : ∀ y, g y ≤ g M) : ¬ ∃" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_mono", + "line": 55, + "source_header": "ge (hM y)) hy\n\n/-- Increasing parameters give increasing closed superlevels. -/\ntheorem superlevel_mono {X : Type*} (g : X → ℝ) {s t : ℝ} (hst : s ≤ t) :\n superlevel_set g s ⊆ sup" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_isClosed", + "line": 61, + "source_header": "_le_neg hst) hx\n\n/-- Each level is closed when the function is continuous. -/\ntheorem superlevel_isClosed {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (hg : Continuous g) (t : ℝ) : IsClosed (su" + }, + { + "kind": "def", + "unqualified_name": "superlevel_inclusion", + "line": 66, + "source_header": "ntinuous_const hg\n\n/-- Continuity of the inclusion is independent of continuity of the height function. -/\ndef superlevel_inclusion {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) {s t : ℝ} (hst : s ≤ t) :\n C(superlevel_set g s," + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_inclusion_id", + "line": 72, + "source_header": "erlevel_mono g hst)\n\ntheorem superlevel_inclusion_id {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (t : ℝ) :\n superlevel_inclusion g (le_refl t) = ContinuousMap.id (" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_inclusion_comp", + "line": 78, + "source_header": ":= by\n ext x\n rfl\n\ntheorem superlevel_inclusion_comp {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) {r s t : ℝ} (hrs : r ≤ s) (hst : s ≤ t) :\n (superlevel_inclusion g hst).comp (superlevel_inclusion g hrs) =\n superlevel_inclusio" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_mem_at_own_height", + "line": 85, + "source_header": ":= by\n ext x\n rfl\n\n/-- Point membership at its own height; this is not a component-birth theorem. -/\ntheorem superlevel_mem_at_own_height {X : Type*} (g : X → ℝ) (x : X) :\n x ∈ su" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_neg_height", + "line": 90, + "source_header": "simp [superlevel_set]\n\ntheorem superlevel_neg_height {X : Type*} (g : X → ℝ) (h : ℝ) :\n superlevel_set g" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_control_strict_thresholds", + "line": 95, + "source_header": "simp [superlevel_set]\n\n/-- An explicit threshold countercontrol; it is not a compact Morse counterexample. -/\ntheorem superlevel_control_strict_thresholds :\n (∀ h : ℝ, h < 0 → ∃ k : ℝ, h < k ∧ k < 0) ∧\n ¬" + }, + { + "kind": "def", + "unqualified_name": "superlevel_componentMap", + "line": 105, + "source_header": "t (not_lt_of_ge hk) hk'\n\n/-- The induced map on actual path-component quotients. -/\ndef superlevel_componentMap {X Y : Type w} [TopologicalSpace X] [TopologicalSpace Y]\n (f : C(X, Y)) : ZerothHomo" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_componentMap_mk", + "line": 111, + "source_header": "und (p.map f.continuous))\n\ntheorem superlevel_componentMap_mk {X Y : Type w}\n [TopologicalSpace X] [TopologicalSpace Y] (f : C(X, Y)) (x : X) :\n superlevel_componentMap f (ZerothHomotopy.mk x)" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_componentMap_id", + "line": 115, + "source_header": "hHomotopy.mk (f x) := rfl\n\ntheorem superlevel_componentMap_id {X : Type w} [TopologicalSpace X] :\n superlevel_componentMap" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_componentMap_comp", + "line": 121, + "source_header": "opy.mk_surjective q\n rfl\n\ntheorem superlevel_componentMap_comp {X Y Z : Type w}\n [TopologicalSpace X] [TopologicalSpace Y] [TopologicalSpace Z]\n (f : C(X, Y)) (g : C(Y, Z)) :\n superlevel_componentMap (g.comp f) =\n superlevel_componentMap g ∘" + }, + { + "kind": "def", + "unqualified_name": "superlevel_componentInclusion", + "line": 130, + "source_header": "opy.mk_surjective q\n rfl\n\ndef superlevel_componentInclusion {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) {s t : ℝ} (hst : s ≤ t) :\n ZerothHomotopy (superlevel_set g s) → ZerothHomo" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_componentInclusion_id", + "line": 135, + "source_header": "perlevel_inclusion g hst)\n\ntheorem superlevel_componentInclusion_id {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (t : ℝ) : superlevel_componentInc" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_componentInclusion_comp", + "line": 141, + "source_header": "opy.mk_surjective q\n rfl\n\ntheorem superlevel_componentInclusion_comp {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) {r s t : ℝ} (hrs : r ≤ s) (hst : s ≤ t) :\n superlevel_componentInclusion g (hrs.trans hst) =\n superlevel_componentInclusion g hst ∘ superlevel" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_component_eq_iff_joinedIn", + "line": 149, + "source_header": "opy.mk_surjective q\n rfl\n\n/-- Actual component equality is precisely a path in the ambient closed superlevel. -/\ntheorem superlevel_component_eq_iff_joinedIn {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (t : ℝ) (x y : superlevel_set g t) :\n ZerothHomotopy.mk x = ZerothHomotopy.mk y ↔\n JoinedIn (supe" + }, + { + "kind": "def", + "unqualified_name": "superlevel_filtration", + "line": 162, + "source_header": "xact ZerothHomotopy.sound p\n\n/-- The topological filtration in the preorder category of real numbers. -/\ndef superlevel_filtration {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "superlevel_h0Filtration", + "line": 178, + "source_header": "e C] [CategoryWithHomology C]\n\n/-- Actual singular H0 with coefficient object R, including the inclusion maps. -/\ndef superlevel_h0Filtration {X : Type w} [TopologicalSpace X]" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_h0Filtration_map_id", + "line": 183, + "source_header": "gularHomologyFunctor C 0).obj R\n\n/-- This target includes the actual H0 definition in the transitive dependency audit. -/\ntheorem superlevel_h0Filtration_map_id {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) (t : ℝ) :\n (superlevel_h0Filtration g R).map (𝟙 t) =\n 𝟙 ((su" + }, + { + "kind": "theorem", + "unqualified_name": "superlevel_h0Filtration_map_comp", + "line": 190, + "source_header": "rlevel_h0Filtration g R).map_id t\n\ntheorem superlevel_h0Filtration_map_comp {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) {r s t : ℝ} (f : r ⟶ s) (k : s ⟶ t) :\n (superlevel_h0Filtration g R).map (f ≫ k) =\n (superlevel_h0Filtration g R).map f ≫ (s" + } + ] + }, + { + "path": "companions/torus_filtration_20261011/TorusFiltration.lean", + "sha256": "cddb8bc93569edbcc913eb7c79e23f9a5a637924207aabc2c11c1ad7fe476a75", + "declarations_lexical": [] + }, + { + "path": "companions/torus_filtration_20261011/SuperlevelBarField.lean", + "sha256": "8a2470431c3fda5e98859aa9372cbb8866ed5c5c722cea5dfc28cb577840bbad", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_continuous", + "line": 49, + "source_header": "n\n\n/-- Proves: a smooth height in the Field sense is continuous.\nMethod: the `n = 0` instance of `IsSmooth` and `ContDiff.continuous`.\nDoes not establish: any regularity beyond continuity. -/\ntheorem superlevelBarField_continuous {d : ℕ} {g : E d → ℝ} (hg : IsSmooth d g) :\n Continuou" + }, + { + "kind": "def", + "unqualified_name": "superlevelBarField_interface", + "line": 56, + "source_header": "ous\n\n/-- Proves: the C263 data inhabit the Field interface for every dimension and period.\nMethod: death height and essentiality are the C263 definitions, the maximin clause is\n`superlevelBar_strict_cut`, and the elder relation is the right-hand side of its clause.\nDoes not establish: a persistence-module elder rule; `elderPartner_iff` holds by\ndefinition, and periodicity and `L` are not used. -/\ndef superlevelBarField_interface (d : ℕ) (L : ℝ) : SuperlevelBarInterface d L where\n deathH" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_nonempty", + "line": 72, + "source_header": "f.rfl\n\n/-- Proves: the Field superlevel-bar interface is inhabited for every `d` and `L`.\nMethod: the record above. Does not establish: that any inhabitant is the source's\nsuperlevel H0 object. -/\ntheorem superlevelBarField_nonempty (d : ℕ) (L : ℝ) :\n Nonempty (SuperlevelBarInterfa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_deathHeight_eq", + "line": 79, + "source_header": "ce d L⟩\n\n/-- Proves: the death height of the record is the C263 death height.\nMethod: `rfl`. Does not establish: a finite death for an essential point. -/\ntheorem superlevelBarField_deathHeight_eq {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :\n (superlevelBarField_interface d L).deathHeight g M = superlevelBar_deathH" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_isEssential_iff", + "line": 85, + "source_header": ":=\n rfl\n\n/-- Proves: essentiality in the record is global maximality.\nMethod: `Iff.rfl`. Does not establish: agreement with a persistence essential class. -/\ntheorem superlevelBarField_isEssential_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :\n (superlevelBarField_interface d L).IsEssential g M ↔ ∀ y" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_elderPartner_iff", + "line": 91, + "source_header": "=\n Iff.rfl\n\n/-- Proves: the elder relation of the record is, for every height, the right-hand side\nof the interface clause. Method: `Iff.rfl`, since it is defined that way.\nDoes not establish: that this relation is ordinary elder death in any persistence sense. -/\ntheorem superlevelBarField_elderPartner_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M S : E d) :\n (superlevelBarField_interface d L).ElderPartner g M S ↔\n (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ superlevelBar_isEssential g M ∧\n superlevelBar_deathHeig" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_essential_unique", + "line": 100, + "source_header": ":=\n Iff.rfl\n\n/-- Proves: on smooth periodic heights every inhabitant's essentiality is global maximality.\nMethod: its own `essential_iff` clause. Does not establish: anything off that locus. -/\ntheorem superlevelBarField_essential_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d) :\n I.IsEssential g M ↔ superlevelBar_" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_deathHeight_unique", + "line": 107, + "source_header": "l_iff g hs hp M\n\n/-- Proves: on smooth periodic heights every inhabitant's death height at a nonessential\npoint is the C263 death height. Method: its maximin clause is a strict cut for the\nclearance set, and `superlevelBar_cut_unique` leaves one such number.\nDoes not establish: agreement at essential points (see the control below). -/\ntheorem superlevelBarField_deathHeight_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d)\n (hM : ¬ I.IsEssential g M) :\n I.deathHeight g M = superlevelBa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_elderPartner_unique", + "line": 120, + "source_header": "n g hs hp M hM h)\n\n/-- Proves: on the Morse distinct-value locus of smooth periodic heights every inhabitant's\nelder relation is the record's. Method: both are their clause's right-hand side, whose\nessentiality and death-height terms agree by the two uniqueness theorems above.\nDoes not establish: agreement off the Morse distinct-value locus, where the interface\nconstrains no elder relation. -/\ntheorem superlevelBarField_elderPartner_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (hm : IsMorseDistinct d L g)\n (M S : E d) :\n I.ElderPartner g M S ↔ (superlevelBarField_interface d L)" + }, + { + "kind": "def", + "unqualified_name": "superlevelBarField_shift", + "line": 139, + "source_header": "hne').trans hdeath⟩\n\n/-- Proves: a second record, equal to the first except that its death height is the\nconstant `c` at essential points, also inhabits the interface. Method: off the essential\npoints it is the C263 death height, so the same strict cut applies; its elder relation is\nagain its clause's right-hand side. Does not establish: any preferred value at essential\npoints. -/\ndef superlevelBarField_shift (d : ℕ) (L c : ℝ) : SuperlevelBarInterface d" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_shift_deathHeight_const", + "line": 160, + "source_header": "_ _ _ _ _ => Iff.rfl\n\n/-- Proves: at a constant height the shifted record's death height is `c`.\nMethod: every point of a constant height is essential. Does not establish: a finite bar\nfor a constant height. -/\ntheorem superlevelBarField_shift_deathHeight_const (d : ℕ) (L c b : ℝ) (M : E d) :\n (superlevelBarField_shift d L c).deathHe" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_const_smooth", + "line": 171, + "source_header": "l\n rw [ite_eq_left hM]\n\n/-- Proves: constant heights are smooth. Method: `contDiff_const`.\nDoes not establish: anything about nonconstant heights. -/\ntheorem superlevelBarField_const_smooth (d : ℕ) (b : ℝ) : IsSm" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_const_periodic", + "line": 176, + "source_header": "fun _ => contDiff_const\n\n/-- Proves: constant heights are `L`-periodic. Method: both sides are the constant.\nDoes not establish: anything about the lattice. -/\ntheorem superlevelBarField_const_periodic (d : ℕ) (L b : ℝ) :\n IsLPeri" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_control_essential_free", + "line": 182, + "source_header": "d => b) :=\n fun _ _ => rfl\n\n/-- Proves: the nonessential hypothesis of `superlevelBarField_deathHeight_unique` cannot\nbe dropped: at the smooth periodic constant height `0` every point is essential for both\nrecords, the record's death height there is `0`, its shift by `1` has death height `1`,\nand the two differ. Method: `superlevelBar_death_const` and the shifted value.\nDoes not establish: anything about nonessential points, where all inhabitants agree. -/\ntheorem superlevelBarField_control_essential_free (d : ℕ) (L : ℝ) (M : E d) :\n IsSmooth d (fun _ : E d => (0 : ℝ)) ∧ IsLPeriodic d L (fun _ : E d => (0 : ℝ)) ∧\n (superlevelBarField_interface d L).IsEssential (fun _ => (0 : ℝ)) M ∧\n (superlevelBarField_shift d L 1).IsEssential (fun _ => (0 : ℝ)) M ∧\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M = 0 ∧\n (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : ℝ)) M = 1 ∧\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M ≠\n (superlevelBarField_shift d L 1).dea" + } + ] + }, + { + "path": "companions/torus_filtration_20261011/SuperlevelBar.lean", + "sha256": "346eea948e18d5904422904006827930e27d3141ccbc19ee8ac2c24bcf65a4a9", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "superlevelBar_E", + "line": 38, + "source_header": "n\n\n/-- Proves: the ambient type is real Euclidean space in the stated dimension.\nMethod: a type abbreviation. Does not establish: a positive-dimensional or\nperiodic quotient-space hypothesis. -/\nabbrev superlevelBar_E (d :" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_isEssential", + "line": 43, + "source_header": "d)\n\n/-- Proves: the essentiality datum is total. Method: global order comparison.\nDoes not establish: an actual persistence interpretation off the guarded locus. -/\ndef superlevelBar_isEssential {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) :" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_clearanceSet", + "line": 49, + "source_header": "≤ g M\n\n/-- Proves: a total strict-clearance set with the source's existential endpoint.\nMethod: quantify over actual paths and every parameter, including endpoints.\nDoes not establish: a path attaining the supremum with closed inequalities. -/\ndef superlevelBar_clearanceSet {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d)" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_deathHeight", + "line": 56, + "source_header": "(γ t)}\n\n/-- Proves: the death datum is a total real number with explicit empty default.\nMethod: nonempty conditional supremum; boundedness is proved below.\nDoes not establish: a finite death for an essential class. -/\ndef superlevelBar_deathHeight {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_essential_iff", + "line": 65, + "source_header": "M) else 0\n\n/-- Proves: essentiality is exactly global maximality for these total data.\nMethod: unfold the defining proposition. Does not establish: agreement with\nan independently defined essential persistence class. -/\ntheorem superlevelBar_essential_iff {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) :\n superlevelBar_isEssential g M ↔ ∀ y" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_mem_lt_start", + "line": 72, + "source_header": ":= Iff.rfl\n\n/-- Proves: an unconditional strict bound on each clearance member.\nMethod: evaluate its path at zero. Does not establish: an unconditional bound\non the default death value when the clearance set is empty. -/\ntheorem superlevelBar_mem_lt_start {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) {h : ℝ} (hh : h ∈ superlevelBar_clearanceSet g M)" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_bddAbove", + "line": 82, + "source_header": "] using hzero\n\n/-- Proves: the clearance set is bounded above, including when empty.\nMethod: the initial height bounds each member. Does not establish: that the\nempty-set default death value obeys the same bound. -/\ntheorem superlevelBar_clearance_bddAbove {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) : BddAbove (superlevelBar_cl" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_empty_of_essential", + "line": 89, + "source_header": "art g M hh).le⟩\n\n/-- Proves: essentiality forces the clearance set to be empty.\nMethod: contradict the required strictly higher endpoint.\nDoes not establish: a converse for arbitrary discontinuous heights. -/\ntheorem superlevelBar_clearance_empty_of_essential {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hM : superlevelBar_isEssential g M) : superlevelBar_cle" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_zero_of_empty", + "line": 102, + "source_header": "act False.elim hh\n\n/-- Proves: an empty clearance set selects the declared real value zero.\nMethod: simplify the conditional definition. Does not establish: a geometric\ndeath event or finite persistence interval at that zero. -/\ntheorem superlevelBar_death_eq_zero_of_empty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (he : superlevelBar_clearanceSet g M = ∅) : superlevelBar_" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_zero_of_essential", + "line": 111, + "source_header": "ar_deathHeight, he]\n\n/-- Proves: essential inputs have the declared zero default.\nMethod: essentiality implies empty clearance, then use the empty branch.\nDoes not establish: an essential-bar death height. -/\ntheorem superlevelBar_death_eq_zero_of_essential {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hM : superlevelBar_isEssential g M) : superlevelBa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_sSup_of_nonempty", + "line": 120, + "source_header": "_of_essential g M hM)\n\n/-- Proves: nonempty clearance selects its real supremum in the total data.\nMethod: simplify the nonempty conditional branch. Does not establish:\nnonemptiness without a witness or a regularity hypothesis. -/\ntheorem superlevelBar_death_eq_sSup_of_nonempty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hne : (superlevelBar_clearanceSet g M).Nonempty) :\n superlevelBar_deathHeight g M = sSup (superlev" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_path_minimum", + "line": 130, + "source_header": "eight, ite_eq_left hne]\n\n/-- Proves: a continuous height attains a minimum along each actual path.\nMethod: compact unit interval and the extreme-value theorem.\nDoes not establish: a minimum over all paths or an optimal path. -/\ntheorem superlevelBar_path_minimum {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) {M y : superlevelBar_E d} (γ : Path M y) :\n ∃ t₀ : unitInterval, ∀ t : unitInt" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_nonempty", + "line": 142, + "source_header": "=> hmin (Set.mem_univ t)⟩\n\n/-- Proves: nonessential continuous inputs have a nonempty clearance set.\nMethod: a higher endpoint, Path.segment, and minimum minus one.\nDoes not establish: compactness of the whole Euclidean domain. -/\ntheorem superlevelBar_clearance_nonempty {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n (superlevelBar" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_nonempty_iff", + "line": 163, + "source_header": "ave ht := hmin t\n linarith\n\n/-- Proves: for continuous heights, clearance is nonempty exactly off the\nessential locus. Method: the higher witness endpoint and the straight-path\nconstruction. Does not establish: this equivalence without continuity. -/\ntheorem superlevelBar_clearance_nonempty_iff {d : ℕ}\n (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d) :\n (superlevelBar_clearanceSet g M).Nonempty ↔ ¬" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_downward", + "line": 174, + "source_header": "Bar_clearance_nonempty g hg M\n\n/-- Proves: any smaller threshold than an existing clearance is a clearance.\nMethod: reuse the same endpoint and path and compose strict inequalities.\nDoes not establish: strict improvement to a larger threshold. -/\ntheorem superlevelBar_clearance_downward {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) {h c : ℝ} (hhc : h < c)\n (hc : c ∈ superlevelBar_clearanceSet g M) : h ∈" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_improve", + "line": 183, + "source_header": ", γ, fun t => hhc.trans (hγ t)⟩\n\n/-- Proves: each strict witness has a larger strict witness on its same path.\nMethod: attained minimum and a midpoint below it.\nDoes not establish: a witness with clearance strictly above the supremum. -/\ntheorem superlevelBar_clearance_improve {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d) {h : ℝ}\n (hh : h ∈ superlevelBar_clearanceSet g M) :\n ∃ c : ℝ, h < c ∧ c" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_strict_cut", + "line": 199, + "source_header": "have ht := hmin t\n linarith\n\n/-- Proves: the exact strict cut for continuous nonessential inputs.\nMethod: least-upper-bound property, downward closure and strict improvement.\nDoes not establish: closed-threshold attainment at the death height. -/\ntheorem superlevelBar_strict_cut {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) (h : ℝ) :\n h < superlevelBar_deathHeight g M ↔" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_le_start_of_nonempty", + "line": 223, + "source_header": "evelBar_clearance_bddAbove g M) hc)\n\n/-- Proves: the death value is at most the initial height when clearance is\nnonempty. Method: the supremum is at most this upper bound.\nDoes not establish: the bound on the empty default branch. -/\ntheorem superlevelBar_death_le_start_of_nonempty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hne : (superlevelBar_clearanceSet g M).Nonempty) :" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_le_start", + "line": 233, + "source_header": "uperlevelBar_mem_lt_start g M hh).le)\n\n/-- Proves: the death upper bound for continuous nonessential inputs.\nMethod: establish nonempty clearance and apply its guarded supremum bound.\nDoes not establish: a strict inequality or an attained optimal path. -/\ntheorem superlevelBar_death_le_start {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_eq_Iio", + "line": 242, + "source_header": "rlevelBar_clearance_nonempty g hg M hM)\n\n/-- Proves: the clearance set is the open lower interval below death on the\ncontinuous nonessential locus. Method: extensionality and the strict cut.\nDoes not establish: a closed-threshold path at the excluded endpoint. -/\ntheorem superlevelBar_clearance_eq_Iio {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n superlevelBar_clearanceSet g M" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_not_mem_clearance", + "line": 252, + "source_header": "uperlevelBar_strict_cut g hg M hM h).symm\n\n/-- Proves: death is not a strict clearance for continuous nonessential inputs.\nMethod: the cut would otherwise imply that death is strictly below itself.\nDoes not establish: failure or success of closed-threshold attainment. -/\ntheorem superlevelBar_death_not_mem_clearance {d : ℕ}\n (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n superlevelBar_death" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_cut_unique", + "line": 263, + "source_header": "Height g M)).2 hh\n exact (lt_irrefl _) hlt\n\n/-- Proves: uniqueness of a real number with this strict cut on the valid locus.\nMethod: evaluate either cut at the competing endpoint.\nDoes not establish: equality of arbitrary total interface records off that locus. -/\ntheorem superlevelBar_cut_unique {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) (a : ℝ)\n (ha : ∀ h : ℝ, h < a ↔ h ∈ superlevelBar_clearanceSet" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_const", + "line": 280, + "source_header": ").1 hlt\n exact (lt_irrefl a) ((ha a).2 hc)\n\n/-- Proves: any constant height selects the zero default at every point.\nMethod: every point is globally maximal, hence essential in these data.\nDoes not establish: any finite ordinary bar for that constant height. -/\ntheorem superlevelBar_death_const (d : ℕ) (b : ℝ) (M : superlevelBar_E d) :\n superlevelBar_dea" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_control_negative_essential", + "line": 289, + "source_header": "h_eq_zero_of_essential\n intro y\n exact le_rfl\n\n/-- Proves: the essential default forbids an unconditional death/start bound.\nMethod: constant height minus one has empty clearance and death zero.\nDoes not establish: any finite ordinary bar on a constant field. -/\ntheorem superlevelBar_control_negative_essential (d : ℕ) (M : superlevelBar_E d) :\n superlevelBar_deathHeight (fun _ : superlevelBar_E d => (-1 : ℝ)) M = 0 ∧\n ¬ superlevelBar_deathHeight (fu" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:formal", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1.lean", + "sha256": "c55cc116ff3ffbffdb692226e215450a5d2e85b60d27b1b04d529b87bdef38f8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean", + "sha256": "338452a0c2ba24d016059354d543cc995b8cb29c9d4a41d98bb93499f5f8cb8f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightedLaw.lean", + "sha256": "f31dfd2cd048cc0c0446c54c46d89c9cdd5d7bb9d76e9d8d16b7c034f351d736" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/D2Schur.lean", + "sha256": "d3fb3ed7b4043227f1d5a06e208de9d94eb413c067e9d0f8802388407c9e15b9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentTail.lean", + "sha256": "87fe3ee90afc52d8c2652881f1ae195d1b0b15a2ffc18c84d6166d1a4d0de2aa" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/WeightPerturbation.lean", + "sha256": "50ce15709a133da12a0b4333cc653d26c5fd8a412976c975a7c2f3b25ed5c00f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MeasureBridge.lean", + "sha256": "28ac130db490c3c3e2fbfabf3ac5be43c854ab1468bf573bf5a8c0dd2c50955f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/MomentGenerality.lean", + "sha256": "fdec55f1602938cd8fdb5b71535962e76a9671bf230dea53868b14147fb3b509" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/formal/ResearchFormalCoreR1/AlgebraV2.lean", + "sha256": "4480708263c40a2f7f03f12ef7e15f0eb4f8193c2dccbb253921a7ec251863c3" + } + ], + "source_record_sha256": "9571c11e57ff3ff0919f38ab94735257a86b4080343695e7f7744e9dce3e46d5", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "formal", + "source_files": [ + { + "path": "formal/ResearchFormalCoreR1.lean", + "sha256": "c55cc116ff3ffbffdb692226e215450a5d2e85b60d27b1b04d529b87bdef38f8", + "declarations_lexical": [] + }, + { + "path": "formal/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean", + "sha256": "338452a0c2ba24d016059354d543cc995b8cb29c9d4a41d98bb93499f5f8cb8f", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "p02_lm008_r2_cancel", + "line": 6, + "source_header": "/-- P02-LM-008 algebraic companion: exact cancellation of the `r²` factor\n after the Cauchy–Schwarz numerator bound and the normalizer lower bound\n have been established in the surrounding probability theorem. -/\ntheorem p02_lm008_r2_cancel\n (r cW cZ q : ℝ) (hr : r ≠ 0) (hcZ : cZ ≠ 0) :\n (Real.sqrt cW * r ^ 2 * Real.sqrt q) / (cZ * r ^ 2) =\n (Real.sqrt cW / cZ) * Real.sqrt" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_cross_multiplied", + "line": 15, + "source_header": "]\n\n/-- P02-LM-008 cross-multiplied transfer companion. This theorem starts\n from an already supplied Cauchy–Schwarz numerator estimate and an exact\n normalizer lower bound. It does not formalize the measure-theoretic\n Cauchy–Schwarz step itself. -/\ntheorem p02_lm008_cross_multiplied\n (n z r cW cZ q : ℝ)\n (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)\n (hz : cZ * r ^ 2 ≤ z)\n (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n * (cZ * r ^ 2) ≤\n (Real.sqrt cW * r ^ 2 * Real.sqrt q)" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_quotient_bound", + "line": 37, + "source_header": "num\n\n/-- P02-LM-008 quotient companion. With positive denominators, the\n cross-multiplied inequality and exact `r²` cancellation yield the Palm\n square-root transfer coefficient. -/\ntheorem p02_lm008_quotient_bound\n (n z r cW cZ q : ℝ)\n (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)\n (hzpos : 0 < z) (hz : cZ * r ^ 2 ≤ z)\n (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n / z ≤ (Real.sqrt cW / cZ) * Real.s" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_bad_event_threshold", + "line": 53, + "source_header": "cross\n\n/-- P02-LM-009 deterministic threshold companion. Failure of\n `r * R^5 ≤ ε` implies the fifth-power threshold used before Markov's\n inequality. -/\ntheorem p02_lm009_bad_event_threshold\n (r R ε : ℝ) (hr : 0 < r) (hbad : ε < r * R ^ 5) :\n ε / r" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_power40_identity", + "line": 61, + "source_header": "g hbad)\n\n/-- The fixed exponent identity used when the 40th moment is selected in\n the P02-LM-009 application. -/\ntheorem p02_lm009_power40_identity (R : ℝ) :\n (R ^ 5) ^ 8" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_r4_le_r3", + "line": 67, + "source_header": "by\n ring\n\n/-- In the final P0.2 power ledger, an `O(r^4)` Palm tail is also `O(r^3)`\n on `0 ≤ r ≤ 1`. -/\ntheorem p02_lm009_r4_le_r3\n (r : ℝ) (hr0 : 0 ≤ r) (hr1 : r ≤ 1) :\n r" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_palm_r4_to_r3", + "line": 76, + "source_header": "nlinarith\n\n/-- Conditional rate companion: once the Palm square-root transfer has\n produced a uniform `C r^4` bound, the cubic target follows on `r ≤ 1`. -/\ntheorem p02_lm009_palm_r4_to_r3\n (p C r : ℝ) (hC : 0 ≤ C) (hr0 : 0 ≤ r) (hr1 : r ≤ 1)\n (hp : p ≤ C * r ^ 4) :" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/WeightedLaw.lean", + "sha256": "f31dfd2cd048cc0c0446c54c46d89c9cdd5d7bb9d76e9d8d16b7c034f351d736", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "weightedLaw", + "line": 19, + "source_header": "]\n\n/-- A measure for any W; it is a probability measure only under the hypotheses\nproved below. `ofReal` clips negative values, so a.e. nonnegativity is essential\nwhen identifying its density integral with the signed Bochner integral. -/\nnoncomputable def weightedLaw (μ : Measure Ω) (W : Ω → ℝ) : Measur" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_apply", + "line": 26, + "source_header": "x))\n\n/-- Measurable-event mass before taking real values. Genuine integrability and\nnonnegativity identify the density integral with the Bochner set integral. -/\ntheorem weightedLaw_apply\n (μ : Measure Ω) (W : Ω → ℝ) (A : Set Ω)\n (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A) :\n weightedLaw μ W A = (ENNReal.ofReal (∫ x, W x ∂μ))⁻¹ *\n ENNReal.ofReal (∫ x in A, W" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_isProbabilityMeasure", + "line": 36, + "source_header": "hW0)]\n\n/-- Total mass one follows from a positive finite normalizer. This theorem does\nnot assume that the measure it constructs is already a probability measure. -/\ntheorem weightedLaw_isProbabilityMeasure\n (μ : Measure Ω) (W : Ω → ℝ)\n (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W)\n (hz : 0 < ∫ x, W x ∂μ) : IsProbabilityMeasure (weightedL" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_event_real", + "line": 48, + "source_header": "_ne_top\n\n/-- The real event probability is the same-law integral ratio. The positive\nnormalizer is retained explicitly for its intended probability interpretation. -/\ntheorem weightedLaw_event_real\n (μ : Measure Ω) (W : Ω → ℝ) (A : Set Ω)\n (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (hz : 0 < ∫ x, W x ∂μ) :\n (weightedLaw μ W A).toReal = (∫ x in A, W x ∂μ) / (∫ x" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_absolutelyContinuous", + "line": 60, + "source_header": ")]\n ring\n\n/-- A null event under the original law is also null under the weighted law.\nNo independence or strict positivity of W is required for absolute continuity. -/\ntheorem weightedLaw_absolutelyContinuous\n (μ : Measure Ω) (W : Ω → ℝ) : weighted" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_congr_ae", + "line": 68, + "source_header": ", mul_zero]\n\n/-- Changing W on a null set changes neither its normalizer nor the law. -/\ntheorem weightedLaw_congr_ae\n (μ : Measure Ω) (W V : Ω → ℝ) (h : W =ᵐ[μ] V) :\n weightedLaw μ W = we" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_zero", + "line": 78, + "source_header": "_congr_ae hd]\n\n/-- The zero weight gives the zero measure, not a probability law. This exposes\nwhy normalization positivity cannot be removed from the construction theorem. -/\ntheorem weightedLaw_zero (μ : Measure Ω) :\n weightedLaw μ (fun _ : Ω" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_one", + "line": 84, + "source_header": "p [weightedLaw]\n\n/-- A unit weight on a probability space recovers the original probability law. -/\ntheorem weightedLaw_one (μ : Measure Ω) [IsProbabilityMeasure μ] :\n weightedLaw μ (fun _ :" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_probability_transfer", + "line": 89, + "source_header": "imp [weightedLaw]\n\n/-- P02-LM-008 for the actual constructed measure, including its probability\nproperty. The concrete moment and lower-normalizer estimates remain premises. -/\ntheorem p02_lm008_probability_transfer\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (r cW cZ : ℝ) (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :\n IsProbabilityMeasure (weightedLaw μ W) ∧\n (weightedLaw μ W A).toReal ≤ (Real.sqrt cW / cZ) * Real." + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_probability_transfer_r8_to_r3", + "line": 106, + "source_header": "hcZ hsecond hlower\n\n/-- The supplied eighth-order event bound transfers to the constructed law's\ncubic bound. Neither the event bound nor uniformity in r is proved here. -/\ntheorem p02_lm009_probability_transfer_r8_to_r3\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (r cW cZ K : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)\n (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hK : 0 ≤ K)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ)\n (htail : (μ A).toReal ≤ K * r ^ 8) :\n IsProbabilityMeasure (weightedLaw μ W) ∧\n (weightedLaw μ W A).toReal ≤ ((Real.sqrt cW / cZ) *" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/D2Schur.lean", + "sha256": "d3fb3ed7b4043227f1d5a06e208de9d94eb413c067e9d0f8802388407c9e15b9", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "d2Alpha", + "line": 14, + "source_header": "1\n\nnoncomputable def d2Alpha (m2 m4 q : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2Gamma", + "line": 17, + "source_header": "q\n\nnoncomputable def d2Gamma (m2 m4 q : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2DetV", + "line": 20, + "source_header": "q\n\nnoncomputable def d2DetV (m2 m4 q : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2Numerator", + "line": 23, + "source_header": "q\n\nnoncomputable def d2Numerator (m2 m4 : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2Schur", + "line": 26, + "source_header": ")\n\nnoncomputable def d2Schur (m2 m4 q : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2Delta", + "line": 32, + "source_header": "q\n\nnoncomputable def d2Delta (m2 m4 m6 : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2Tau", + "line": 34, + "source_header": "2\n\nnoncomputable def d2Tau (m2 m4 m6 q : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_numerator", + "line": 38, + "source_header": ")\n\n/-- Exact polynomial cancellation; it does not divide by the pin determinant. -/\ntheorem d2_schur_numerator (m2 m4 q : ℝ) :\n d2Alpha m2 m4 q * d2DetV m2 m4 q - d2Gamma m2 m4 q ^ 3 -\n (2 * d2Gamma m2 m4 q + d2Alpha m2 m4 q) *\n (m4 - 3 * m2 ^ 2) ^ 2 * q * (1 - 4 * q) = d2Numerator m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_det_axis", + "line": 46, + "source_header": "ing\n\ntheorem d2_det_axis (m2 m4 : ℝ) : d2DetV m2 m4 0 = m2 ^ 2 *" + }, + { + "kind": "theorem", + "unqualified_name": "d2_det_diagonal", + "line": 49, + "source_header": "tV]\n\ntheorem d2_det_diagonal (m2 m4 : ℝ) :\n d2DetV m2 m4 (1 / 4) = (m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2)" + }, + { + "kind": "theorem", + "unqualified_name": "d2_det_interpolation", + "line": 54, + "source_header": "ing\n\ntheorem d2_det_interpolation (m2 m4 q : ℝ) :\n d2DetV m2 m4 q = (1 - 4 * q) * (m2 ^ 2 * m4) +\n 4 * q * ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) /" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_ratio", + "line": 60, + "source_header": "ing\n\n/-- The nonzero hypothesis is essential even with Lean's total division. -/\ntheorem d2_schur_ratio (m2 m4 q : ℝ) (hD : d2DetV m2 m4 q ≠ 0) :\n d2Schur m2 m4 q = d2Numerator m2 m4 / d2DetV m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_numerator_pos", + "line": 69, + "source_header": "arith\n\ntheorem d2_numerator_pos (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n 0 < d2Numerator" + }, + { + "kind": "theorem", + "unqualified_name": "d2_det_pos", + "line": 80, + "source_header": "v) hs\n\ntheorem d2_det_pos (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) : 0 < d2DetV m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_pos", + "line": 95, + "source_header": ") hb)\n\ntheorem d2_schur_pos (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) : 0 < d2Schur m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_det_le_endpoint_max", + "line": 101, + "source_header": "4) hD\n\ntheorem d2_det_le_endpoint_max (m2 m4 q : ℝ) (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :\n d2DetV m2 m4 q ≤\n max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2)" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_endpoint_lower", + "line": 114, + "source_header": "ring\n\n/-- A uniform positive lower bound on q in [0,1/4], with moment premises explicit. -/\ntheorem d2_schur_endpoint_lower (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :\n d2Numerator m2 m4 /\n max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4) ≤\n d2Schur" + }, + { + "kind": "theorem", + "unqualified_name": "d2_tau_cumulant_eq", + "line": 127, + "source_header": "m4).le)\n\ntheorem d2_tau_cumulant_eq (m2 m4 m6 q : ℝ) (hm2 : m2 ≠ 0) :\n 6 * m2 ^ 3 + 9 * m2 * (m4 - 3 * m2 ^ 2) * (1 - 2 * q) +\n (m6 - 15 * m4 * m2 + 30 * m2 ^ 3 - (m4 - 3 * m2 ^ 2) ^ 2 / m2) *\n (1 - 3 * q) = d2Tau m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_tau_axis", + "line": 135, + "source_header": ";> ring\n\ntheorem d2_tau_axis (m2 m4 m6 : ℝ) : d2Tau m2 m4 m6 0 = d2Delta m" + }, + { + "kind": "theorem", + "unqualified_name": "d2_tau_diagonal", + "line": 138, + "source_header": "[d2Tau]\n\ntheorem d2_tau_diagonal (m2 m4 m6 : ℝ) :\n d2Tau m2 m4 m6 (1 / 4) =\n (d2Delta m2 m4 m6 + 9 * m2 * (m4 - m2 ^" + }, + { + "kind": "theorem", + "unqualified_name": "d2_tau_pos", + "line": 144, + "source_header": "ring\n\ntheorem d2_tau_pos (m2 m4 m6 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hDelta : 0 < d2Delta m2 m4 m6) (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :\n 0 < d2Tau m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_gaussian_control", + "line": 156, + "source_header": "ty) hb)\n\n/-- Gaussian-reference algebra, for all real q, not a probabilistic identification. -/\ntheorem d2_gaussian_control (q : ℝ) :\n d2DetV 1 3 q = 3 ∧ d2Schur 1 3 q = 8 / 3 ∧ d2Tau 1 3" + }, + { + "kind": "theorem", + "unqualified_name": "d2_degenerate_control", + "line": 162, + "source_header": "<;> ring\n\n/-- At a singular moment boundary the unguarded quotient identity is false. -/\ntheorem d2_degenerate_control :\n d2DetV 1 1 (1 / 4) = 0 ∧ d2Schur 1 1 (1 / 4) = 2 ∧\n d2Numerator 1 1 / d2DetV 1 1 (1 / 4) = 0 ∧ d2Tau" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/MomentTail.lean", + "sha256": "87fe3ee90afc52d8c2652881f1ae195d1b0b15a2ffc18c84d6166d1a4d0de2aa", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "badJetEvent", + "line": 19, + "source_header": "]\n\n/-- The exact strict threshold event used by the fifth-power jet ledger. -/\ndef badJetEvent (R : Ω → ℝ) (r ε : ℝ) : Se" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_markov_event", + "line": 23, + "source_header": "5}\n\n/-- Markov for any event contained in a positive superlevel set, on a finite\nmeasure. Integrability prevents totalized divergent integrals from being used. -/\ntheorem p02_lm009_markov_event\n (μ : Measure Ω) [IsFiniteMeasure μ] (Y : Ω → ℝ) (A : Set Ω)\n (hY : Integrable Y μ) (hY0 : 0 ≤ᵐ[μ] Y)\n (a : ℝ) (ha : 0 < a) (hsub : A ⊆ {x | a ≤ Y x}) :\n (μ A).toReal ≤ (∫ x, Y x ∂μ" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_badJet_measurable", + "line": 39, + "source_header": "arkov\n\n/-- Actual measurability of the bad event from measurability of the jet norm. -/\ntheorem p02_lm009_badJet_measurable\n (R : Ω → ℝ) (hR : Measurable R) (r ε : ℝ) :\n MeasurableSet (badJetEvent" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_badJet_subset", + "line": 46, + "source_header": "n_prop)\n\n/-- The event itself implies the needed positive fifth-power threshold, even\nfor signed R; no global sign assumption on R is necessary. -/\ntheorem p02_lm009_badJet_subset\n (R : Ω → ℝ) (r ε : ℝ) (hr : 0 < r) (hε : 0 < ε) :\n badJetEvent R r ε ⊆ {x | (ε / r) ^ 8 ≤" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_tail", + "line": 58, + "source_header": "using hp\n\n/-- A supplied integrable fortieth-moment bound gives the actual eighth-order\nevent tail, with the exact epsilon denominator and no independence hypothesis. -/\ntheorem p02_lm009_moment40_tail\n (μ : Measure Ω) [IsProbabilityMeasure μ] (R : Ω → ℝ)\n (r ε M : ℝ) (hr : 0 < r) (hε : 0 < ε)\n (hRi : Integrable (fun x => R x ^ 40) μ)\n (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M) :\n (μ (badJetEvent R r ε)).toReal ≤ (M / ε ^" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_weighted_r4", + "line": 79, + "source_header": "e_of_gt hε]\n\n/-- The constructed weighted probability law satisfies the stronger fourth-\norder tail. The model's moment and positive lower-normalizer bounds are premises. -/\ntheorem p02_lm009_moment40_weighted_r4\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W R : Ω → ℝ)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hR : Measurable R)\n (r ε M cW cZ : ℝ) (hr : 0 < r) (hε : 0 < ε)\n (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hRi : Integrable (fun x => R x ^ 40) μ)\n (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :\n IsProbabilityMeasure (weightedLaw μ W) ∧\n (weightedLaw μ W (badJetEvent R r ε)).toReal ≤\n ((Real.sqrt cW / cZ) * Real.sqrt (M / ε" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_weighted_r3", + "line": 111, + "source_header": "_ := by ring\n\n/-- Cubic consequence on the explicit domain 0 < r ≤ 1. -/\ntheorem p02_lm009_moment40_weighted_r3\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W R : Ω → ℝ)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hR : Measurable R)\n (r ε M cW cZ : ℝ) (hr : 0 < r) (hr1 : r ≤ 1) (hε : 0 < ε)\n (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hRi : Integrable (fun x => R x ^ 40) μ)\n (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :\n IsProbabilityMeasure (weightedLaw μ W) ∧\n (weightedLaw μ W (badJetEvent R r ε)).toReal ≤\n ((Real.sqrt cW / cZ) * Real.sqrt (M /" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_family_r3", + "line": 128, + "source_header": ") hr.le hr1 hb⟩\n\n/-- A uniform family conclusion only when all law-specific bounds are supplied\nuniformly. This proves the quantifier assembly, not the existence of model bounds. -/\ntheorem p02_lm009_moment40_family_r3\n (μ : ℝ → Measure Ω) [∀ r, IsProbabilityMeasure (μ r)]\n (W R : ℝ → Ω → ℝ) (r0 ε M cW cZ : ℝ)\n (hr0 : 0 < r0 ∧ r0 ≤ 1) (hε : 0 < ε)\n (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hdata : ∀ r, 0 < r → r ≤ r0 →\n MemLp (W r) 2 (μ r) ∧ (0 ≤ᵐ[μ r] W r) ∧ Measurable (R r) ∧\n Integrable (fun x => R r x ^ 40) (μ r) ∧\n (∫ x, R r x ^ 40 ∂(μ r)) ≤ M ∧\n (∫ x, W r x ^ 2 ∂(μ r)) ≤ cW * r ^ 4 ∧\n cZ * r ^ 2 ≤ ∫ x, W r x ∂(μ r)) :\n ∃ C : ℝ, 0 ≤ C ∧ ∀ r, 0 < r → r ≤ r0 →\n IsProbabilityMeasure (weightedLaw (μ r) (W r)) ∧\n (weightedLaw (μ r) (W r) (badJetEvent (R r) r ε)).t" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/WeightPerturbation.lean", + "sha256": "50ce15709a133da12a0b4333cc653d26c5fd8a412976c975a7c2f3b25ed5c00f", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "weightPerturbation_integral", + "line": 19, + "source_header": "]\n\n/-- Integrability, not a totalized divergent integral, justifies subtraction. -/\ntheorem weightPerturbation_integral\n (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ) :\n |(∫ x, W x ∂μ) - (∫ x, V x ∂μ)| ≤ ∫ x, |W x - V x|" + }, + { + "kind": "theorem", + "unqualified_name": "weightPerturbation_setIntegral", + "line": 26, + "source_header": "abs\n\n/-- Restricting to any set cannot increase the integral absolute error. The\nprobability formula below separately requires measurable events. -/\ntheorem weightPerturbation_setIntegral\n (μ : Measure Ω) (W V : Ω → ℝ) (A : Set Ω)\n (hW : Integrable W μ) (hV : Integrable V μ) :\n |(∫ x in A, W x ∂μ) - (∫ x in A, V x ∂μ)| ≤ ∫ x, |W x - V" + }, + { + "kind": "theorem", + "unqualified_name": "weightPerturbation_normalizer_lower", + "line": 37, + "source_header": "x))))\n\n/-- A reference normalizer lower bound loses at most the supplied L1 budget. -/\ntheorem weightPerturbation_normalizer_lower\n (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ)\n (c δ : ℝ) (hreference : c ≤ ∫ x, V x ∂μ)\n (herror : (∫ x, |W x - V x| ∂μ) ≤ δ) :\n c - δ ≤ ∫ x," + }, + { + "kind": "theorem", + "unqualified_name": "weightPerturbation_event_integral_bounds", + "line": 46, + "source_header": "inarith\n\n/-- A nonnegative event numerator lies between zero and its own normalizer. -/\ntheorem weightPerturbation_event_integral_bounds\n (μ : Measure Ω) (W : Ω → ℝ) (A : Set Ω)\n (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W) :\n 0 ≤ (∫ x in A, W x ∂μ) ∧ (∫ x in A, W x ∂μ) ≤ ∫" + }, + { + "kind": "theorem", + "unqualified_name": "weightPerturbation_quotient_bound", + "line": 54, + "source_header": "l hW hW0⟩\n\n/-- Scalar ratio stability with the reference denominator t. The factor 2 is\nconvenient, not claimed optimal. No sign premise on b is needed for this lemma. -/\ntheorem weightPerturbation_quotient_bound\n (a b z t δ : ℝ) (hz : 0 < z) (ht : 0 < t)\n (ha : 0 ≤ a) (haz : a ≤ z) (hab : |a - b| ≤ δ) (hzt : |z - t| ≤ δ) :\n |a / z - b / t|" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_event_perturbation", + "line": 84, + "source_header": ":= by ring\n\n/-- Under one common measure, a small L1 weight error transfers a positive\nreference normalizer to W and controls all measurable-event probabilities.\nThe ambient measure need not be finite or a probability measure. -/\ntheorem weightedLaw_event_perturbation\n (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ)\n (hW0 : 0 ≤ᵐ[μ] W) (hV0 : 0 ≤ᵐ[μ] V)\n (c δ : ℝ) (hc : 0 < c) (hreference : c ≤ ∫ x, V x ∂μ)\n (herror : (∫ x, |W x - V x| ∂μ) ≤ δ) (hsmall : δ ≤ c / 2) :\n c / 2 ≤ (∫ x, W x ∂μ) ∧\n IsProbabilityMeasure (weightedLaw μ W) ∧\n IsProbabilityMeasure (weightedLaw μ V) ∧\n ∀ A : Set Ω, MeasurableSet A →\n |(weightedLaw μ W A).toReal - (weightedLaw μ V A).toReal" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_event_perturbation_r2", + "line": 114, + "source_header": "c hreference)\n\n/-- The natural r² normalizer and L1-error scales cancel. No r ≤ 1 restriction\nis needed. Uniform application requires uniform c and the displayed budgets. -/\ntheorem weightedLaw_event_perturbation_r2\n (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ)\n (hW0 : 0 ≤ᵐ[μ] W) (hV0 : 0 ≤ᵐ[μ] V)\n (r c η : ℝ) (hr : 0 < r) (hc : 0 < c)\n (hreference : c * r ^ 2 ≤ ∫ x, V x ∂μ)\n (herror : (∫ x, |W x - V x| ∂μ) ≤ η * r ^ 2) (hsmall : η ≤ c / 2) :\n (c * r ^ 2) / 2 ≤ (∫ x, W x ∂μ) ∧\n IsProbabilityMeasure (weightedLaw μ W) ∧\n IsProbabilityMeasure (weightedLaw μ V) ∧\n ∀ A : Set Ω, MeasurableSet A →\n |(weightedLaw μ W A).toReal - (weightedLaw μ V A).toRe" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/MeasureBridge.lean", + "sha256": "28ac130db490c3c3e2fbfabf3ac5be43c854ab1468bf573bf5a8c0dd2c50955f", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "p02_lm008_integral_cs", + "line": 21, + "source_header": "]\n\n/-- Actual Bochner-integral Cauchy-Schwarz for nonnegative square-integrable\nfunctions, obtained from the pinned mathlib Holder theorem with exponents 2,2. -/\ntheorem p02_lm008_integral_cs\n (μ : Measure Ω) (f g : Ω → ℝ)\n (hf : MemLp f 2 μ) (hg : MemLp g 2 μ)\n (hf0 : 0 ≤ᵐ[μ] f) (hg0 : 0 ≤ᵐ[μ] g) :\n (∫ x, f x * g x ∂μ) ≤\n Real.sqrt (∫ x, f x ^ 2 ∂μ) * Real.sqrt (∫ x, g x ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_event_cs", + "line": 34, + "source_header": "g h\n\n/-- The event may depend arbitrarily on W. Its indicator's second moment is\nits probability under this same μ; no independence assumption is used. -/\ntheorem p02_lm008_event_cs\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A) :\n (∫ x in A, W x ∂μ) ≤\n Real.sqrt (∫ x, W x ^ 2 ∂μ) * Real.sqrt ((μ A).to" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_event_numerator", + "line": 61, + "source_header": "g hcs\n\n/-- The r^4 second-moment premise supplies the previously assumed r^2\nnumerator bound. This theorem does not establish that premise for a model. -/\ntheorem p02_lm008_event_numerator\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (r cW : ℝ) (hcW : 0 ≤ cW)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4) :\n (∫ x in A, W x ∂μ) ≤ Real.sqrt cW * r ^ 2 * Real.sqrt ((μ A)." + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_measure_transfer", + "line": 79, + "source_header": "neg _))\n\n/-- Same-law integral-ratio transfer. Positivity of the actual normalizer\nis derived from its explicit lower bound, never from an upper bound. -/\ntheorem p02_lm008_measure_transfer\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (r cW cZ : ℝ) (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :\n (∫ x in A, W x ∂μ) / (∫ x, W x ∂μ) ≤\n (Real.sqrt cW / cZ) * Real.sqrt ((μ A" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_measure_transfer_r8_to_r3", + "line": 96, + "source_header": "hsecond)\n\n/-- An explicitly supplied eighth-order event bound transfers to a cubic\nbound on 0 < r ≤ 1. Uniformity in r and the input tail remain unproved here. -/\ntheorem p02_lm009_measure_transfer_r8_to_r3\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (r cW cZ K : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)\n (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hK : 0 ≤ K)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ)\n (htail : (μ A).toReal ≤ K * r ^ 8) :\n (∫ x in A, W x ∂μ) / (∫ x, W x ∂μ) ≤\n ((Real.sqrt cW / cZ) * Real.sqrt" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_sqrt_counterexample", + "line": 128, + "source_header": "hr1 hfourth\n\n/-- Scalar data realized by W=4 on an event of probability 1/4 and W=0\nelsewhere. Cauchy-Schwarz is sharp; omitting the event square root is false.\nThe realization is checked separately by exact finite-model Python tests. -/\ntheorem p02_lm008_sqrt_counterexample :\n (1 : ℝ) = Real.sqrt 4 * Real.sqrt (1 / 4 : ℝ) ∧\n ¬ (1 : ℝ) ≤ Real.sqrt 4" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_upper_normalizer_counterexample", + "line": 136, + "source_header": "by\n norm_num\n\n/-- Scalar data realized by W=1 on a one-point probability space, r=1,\ncW=1, cZ=2. The upper bound on z holds but the proposed ratio bound fails.\nThis does not assert that the required lower bound holds. -/\ntheorem p02_lm008_upper_normalizer_counterexample :\n (1 : ℝ) ≤ 2 * 1 ^ 2 ∧\n (1 : ℝ) / 1 > (Real.sqrt 1 / 2" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/MomentGenerality.lean", + "sha256": "fdec55f1602938cd8fdb5b71535962e76a9671bf230dea53868b14147fb3b509", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_tail_finite", + "line": 20, + "source_header": "]\n\n/-- The fortieth-moment event bound for any finite measure. The event mass is\nnot normalized by the total mass; both sides scale with the ambient measure. -/\ntheorem p02_lm009_moment40_tail_finite\n (μ : Measure Ω) [IsFiniteMeasure μ] (R : Ω → ℝ)\n (r ε M : ℝ) (hr : 0 < r) (hε : 0 < ε)\n (hRi : Integrable (fun x => R x ^ 40) μ)\n (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M) :\n (μ (badJetEvent R r ε)).toReal ≤ (M / ε ^ 8) * r" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_tail_of_finite", + "line": 41, + "source_header": "hε]\n\n/-- The original probability-space conclusion specializes from the finite\nmeasure companion. This does not replace or edit the original declaration. -/\ntheorem p02_lm009_moment40_tail_of_finite\n (μ : Measure Ω) [IsProbabilityMeasure μ] (R : Ω → ℝ)\n (r ε M : ℝ) (hr : 0 < r) (hε : 0 < ε)\n (hRi : Integrable (fun x => R x ^ 40) μ)\n (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M) :\n (μ (badJetEvent R r ε)).toReal ≤ (M / ε ^ 8) *" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_family_r3_interval", + "line": 51, + "source_header": "bound\n\n/-- One fixed cubic constant, with probability and all model bounds required\nonly on 0 < r ≤ r0. No probability assumption is made outside that interval. -/\ntheorem p02_lm009_moment40_family_r3_interval\n (μ : ℝ → Measure Ω)\n (W R : ℝ → Ω → ℝ) (r0 ε M cW cZ : ℝ)\n (hr0 : 0 < r0 ∧ r0 ≤ 1) (hε : 0 < ε)\n (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hdata : ∀ r, 0 < r → r ≤ r0 →\n IsProbabilityMeasure (μ r) ∧\n MemLp (W r) 2 (μ r) ∧ (0 ≤ᵐ[μ r] W r) ∧ Measurable (R r) ∧\n Integrable (fun x => R r x ^ 40) (μ r) ∧\n (∫ x, R r x ^ 40 ∂(μ r)) ≤ M ∧\n (∫ x, W r x ^ 2 ∂(μ r)) ≤ cW * r ^ 4 ∧\n cZ * r ^ 2 ≤ ∫ x, W r x ∂(μ r)) :\n ∃ C : ℝ, 0 ≤ C ∧ ∀ r, 0 < r → r ≤ r0 →\n IsProbabilityMeasure (weightedLaw (μ r) (W r)) ∧\n (weightedLaw (μ r) (W r) (badJetEvent (R r) r ε)).toReal ≤ C" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_family_r3_of_interval", + "line": 75, + "source_header": "hlower\n\n/-- A globally supplied probability family is a specialization of the interval\nversion, so the previous interface is retained without changing its source. -/\ntheorem p02_lm009_moment40_family_r3_of_interval\n (μ : ℝ → Measure Ω) [∀ r, IsProbabilityMeasure (μ r)]\n (W R : ℝ → Ω → ℝ) (r0 ε M cW cZ : ℝ)\n (hr0 : 0 < r0 ∧ r0 ≤ 1) (hε : 0 < ε)\n (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hdata : ∀ r, 0 < r → r ≤ r0 →\n MemLp (W r) 2 (μ r) ∧ (0 ≤ᵐ[μ r] W r) ∧ Measurable (R r) ∧\n Integrable (fun x => R r x ^ 40) (μ r) ∧\n (∫ x, R r x ^ 40 ∂(μ r)) ≤ M ∧\n (∫ x, W r x ^ 2 ∂(μ r)) ≤ cW * r ^ 4 ∧\n cZ * r ^ 2 ≤ ∫ x, W r x ∂(μ r)) :\n ∃ C : ℝ, 0 ≤ C ∧ ∀ r, 0 < r → r ≤ r0 →\n IsProbabilityMeasure (weightedLaw (μ r) (W r)) ∧\n (weightedLaw (μ r) (W r) (badJetEvent (R r) r ε)).toReal ≤" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/AlgebraV2.lean", + "sha256": "4480708263c40a2f7f03f12ef7e15f0eb4f8193c2dccbb253921a7ec251863c3", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "foldPotential", + "line": 6, + "source_header": "/-- Canonical A₂ normal-form potential, parameterized by `s` with λ = s². -/\nnoncomputable def foldPotential (s x : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "ec005_fold_gap", + "line": 9, + "source_header": "x\n\n/-- EC-005: exact canonical fold-gap identity in the normalized coordinate. -/\ntheorem ec005_fold_gap (s : ℝ) :\n foldPotential s s - foldPotential s (-s) = (2 * s) ^ 3" + }, + { + "kind": "theorem", + "unqualified_name": "ec008_factor_expansion", + "line": 15, + "source_header": "ing\n\n/-- EC-008: scalar polynomial companion for the planar collision-Gram determinant.\n This is not the matrix-construction theorem. -/\ntheorem ec008_factor_expansion (c s : ℝ) :\n 2 * s ^ 2 *\n ((s ^ 2 * (3 * c ^ 4 + 3 * c ^ 2 * s ^ 2 + s ^ 4) / 24) *\n (s ^ 2 * (4 * c ^ 2 + s ^ 2) / 2) -\n (-c * s ^ 2 * (2 * c ^ 2 + s ^ 2) / 4) ^ 2) =\n s ^ 8 * (c ^ 2 + s ^ 2) * (3 * c ^ 2 + s ^ 2)" + }, + { + "kind": "theorem", + "unqualified_name": "ec010_generic", + "line": 25, + "source_header": "ring\n\n/-- EC-010, generic chart: declared convex-combination polynomial identity. -/\ntheorem ec010_generic (α K c η : ℝ) :\n (K + 8 * α * c * η) ^ 2 + 64 * α * (1 - α) * c ^ 2 * η ^ 2 =\n (1 - α) * K ^ 2 + α * (K + 8 * c *" + }, + { + "kind": "theorem", + "unqualified_name": "ec010_transverse", + "line": 31, + "source_header": "ring\n\n/-- EC-010, transverse chart: declared convex-combination polynomial identity. -/\ntheorem ec010_transverse (α a η : ℝ) :\n (a + (1 - 2 * α) * η) ^ 2 + 4 * α * (1 - α) * η ^ 2 =\n (1 - α) * (a + η) ^ 2 + α * (a" + }, + { + "kind": "theorem", + "unqualified_name": "ec011_scalar_cancellation", + "line": 37, + "source_header": "by\n ring\n\n/-- EC-011: scalar cancellation companion to the adjoint-orbit calculation.\n It does not formalize the ODE, Hessian symmetry, or section normalization. -/\ntheorem ec011_scalar_cancellation (h w g : ℝ) :\n (-h * w) * g + w *" + }, + { + "kind": "theorem", + "unqualified_name": "ec014_contact_power", + "line": 43, + "source_header": "= by\n ring\n\n/-- EC-014: exact contact-power scalar identity for nonzero separation.\n It does not formalize the six-pin matrix determinant or density transform. -/\ntheorem ec014_contact_power (r : ℝ) (hr : r ≠ 0) :\n (r ^ 3 / 6) * (1 / r ^ 5) * r ^ 2" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:formal", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "formal", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "formal/ResearchFormalCoreR1.lean", + "sha256": "c55cc116ff3ffbffdb692226e215450a5d2e85b60d27b1b04d529b87bdef38f8", + "declarations_lexical": [] + }, + { + "path": "formal/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean", + "sha256": "338452a0c2ba24d016059354d543cc995b8cb29c9d4a41d98bb93499f5f8cb8f", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "p02_lm008_r2_cancel", + "line": 6, + "source_header": "/-- P02-LM-008 algebraic companion: exact cancellation of the `r²` factor\n after the Cauchy–Schwarz numerator bound and the normalizer lower bound\n have been established in the surrounding probability theorem. -/\ntheorem p02_lm008_r2_cancel\n (r cW cZ q : ℝ) (hr : r ≠ 0) (hcZ : cZ ≠ 0) :\n (Real.sqrt cW * r ^ 2 * Real.sqrt q) / (cZ * r ^ 2) =\n (Real.sqrt cW / cZ) * Real.sqrt" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_cross_multiplied", + "line": 15, + "source_header": "]\n\n/-- P02-LM-008 cross-multiplied transfer companion. This theorem starts\n from an already supplied Cauchy–Schwarz numerator estimate and an exact\n normalizer lower bound. It does not formalize the measure-theoretic\n Cauchy–Schwarz step itself. -/\ntheorem p02_lm008_cross_multiplied\n (n z r cW cZ q : ℝ)\n (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)\n (hz : cZ * r ^ 2 ≤ z)\n (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n * (cZ * r ^ 2) ≤\n (Real.sqrt cW * r ^ 2 * Real.sqrt q)" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_quotient_bound", + "line": 37, + "source_header": "num\n\n/-- P02-LM-008 quotient companion. With positive denominators, the\n cross-multiplied inequality and exact `r²` cancellation yield the Palm\n square-root transfer coefficient. -/\ntheorem p02_lm008_quotient_bound\n (n z r cW cZ q : ℝ)\n (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)\n (hzpos : 0 < z) (hz : cZ * r ^ 2 ≤ z)\n (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n / z ≤ (Real.sqrt cW / cZ) * Real.s" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_bad_event_threshold", + "line": 53, + "source_header": "cross\n\n/-- P02-LM-009 deterministic threshold companion. Failure of\n `r * R^5 ≤ ε` implies the fifth-power threshold used before Markov's\n inequality. -/\ntheorem p02_lm009_bad_event_threshold\n (r R ε : ℝ) (hr : 0 < r) (hbad : ε < r * R ^ 5) :\n ε / r" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_power40_identity", + "line": 61, + "source_header": "g hbad)\n\n/-- The fixed exponent identity used when the 40th moment is selected in\n the P02-LM-009 application. -/\ntheorem p02_lm009_power40_identity (R : ℝ) :\n (R ^ 5) ^ 8" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_r4_le_r3", + "line": 67, + "source_header": "by\n ring\n\n/-- In the final P0.2 power ledger, an `O(r^4)` Palm tail is also `O(r^3)`\n on `0 ≤ r ≤ 1`. -/\ntheorem p02_lm009_r4_le_r3\n (r : ℝ) (hr0 : 0 ≤ r) (hr1 : r ≤ 1) :\n r" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_palm_r4_to_r3", + "line": 76, + "source_header": "nlinarith\n\n/-- Conditional rate companion: once the Palm square-root transfer has\n produced a uniform `C r^4` bound, the cubic target follows on `r ≤ 1`. -/\ntheorem p02_lm009_palm_r4_to_r3\n (p C r : ℝ) (hC : 0 ≤ C) (hr0 : 0 ≤ r) (hr1 : r ≤ 1)\n (hp : p ≤ C * r ^ 4) :" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/WeightedLaw.lean", + "sha256": "f31dfd2cd048cc0c0446c54c46d89c9cdd5d7bb9d76e9d8d16b7c034f351d736", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "weightedLaw", + "line": 19, + "source_header": "]\n\n/-- A measure for any W; it is a probability measure only under the hypotheses\nproved below. `ofReal` clips negative values, so a.e. nonnegativity is essential\nwhen identifying its density integral with the signed Bochner integral. -/\nnoncomputable def weightedLaw (μ : Measure Ω) (W : Ω → ℝ) : Measur" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_apply", + "line": 26, + "source_header": "x))\n\n/-- Measurable-event mass before taking real values. Genuine integrability and\nnonnegativity identify the density integral with the Bochner set integral. -/\ntheorem weightedLaw_apply\n (μ : Measure Ω) (W : Ω → ℝ) (A : Set Ω)\n (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A) :\n weightedLaw μ W A = (ENNReal.ofReal (∫ x, W x ∂μ))⁻¹ *\n ENNReal.ofReal (∫ x in A, W" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_isProbabilityMeasure", + "line": 36, + "source_header": "hW0)]\n\n/-- Total mass one follows from a positive finite normalizer. This theorem does\nnot assume that the measure it constructs is already a probability measure. -/\ntheorem weightedLaw_isProbabilityMeasure\n (μ : Measure Ω) (W : Ω → ℝ)\n (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W)\n (hz : 0 < ∫ x, W x ∂μ) : IsProbabilityMeasure (weightedL" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_event_real", + "line": 48, + "source_header": "_ne_top\n\n/-- The real event probability is the same-law integral ratio. The positive\nnormalizer is retained explicitly for its intended probability interpretation. -/\ntheorem weightedLaw_event_real\n (μ : Measure Ω) (W : Ω → ℝ) (A : Set Ω)\n (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (hz : 0 < ∫ x, W x ∂μ) :\n (weightedLaw μ W A).toReal = (∫ x in A, W x ∂μ) / (∫ x" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_absolutelyContinuous", + "line": 60, + "source_header": ")]\n ring\n\n/-- A null event under the original law is also null under the weighted law.\nNo independence or strict positivity of W is required for absolute continuity. -/\ntheorem weightedLaw_absolutelyContinuous\n (μ : Measure Ω) (W : Ω → ℝ) : weighted" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_congr_ae", + "line": 68, + "source_header": ", mul_zero]\n\n/-- Changing W on a null set changes neither its normalizer nor the law. -/\ntheorem weightedLaw_congr_ae\n (μ : Measure Ω) (W V : Ω → ℝ) (h : W =ᵐ[μ] V) :\n weightedLaw μ W = we" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_zero", + "line": 78, + "source_header": "_congr_ae hd]\n\n/-- The zero weight gives the zero measure, not a probability law. This exposes\nwhy normalization positivity cannot be removed from the construction theorem. -/\ntheorem weightedLaw_zero (μ : Measure Ω) :\n weightedLaw μ (fun _ : Ω" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_one", + "line": 84, + "source_header": "p [weightedLaw]\n\n/-- A unit weight on a probability space recovers the original probability law. -/\ntheorem weightedLaw_one (μ : Measure Ω) [IsProbabilityMeasure μ] :\n weightedLaw μ (fun _ :" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_probability_transfer", + "line": 89, + "source_header": "imp [weightedLaw]\n\n/-- P02-LM-008 for the actual constructed measure, including its probability\nproperty. The concrete moment and lower-normalizer estimates remain premises. -/\ntheorem p02_lm008_probability_transfer\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (r cW cZ : ℝ) (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :\n IsProbabilityMeasure (weightedLaw μ W) ∧\n (weightedLaw μ W A).toReal ≤ (Real.sqrt cW / cZ) * Real." + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_probability_transfer_r8_to_r3", + "line": 106, + "source_header": "hcZ hsecond hlower\n\n/-- The supplied eighth-order event bound transfers to the constructed law's\ncubic bound. Neither the event bound nor uniformity in r is proved here. -/\ntheorem p02_lm009_probability_transfer_r8_to_r3\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (r cW cZ K : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)\n (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hK : 0 ≤ K)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ)\n (htail : (μ A).toReal ≤ K * r ^ 8) :\n IsProbabilityMeasure (weightedLaw μ W) ∧\n (weightedLaw μ W A).toReal ≤ ((Real.sqrt cW / cZ) *" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/D2Schur.lean", + "sha256": "d3fb3ed7b4043227f1d5a06e208de9d94eb413c067e9d0f8802388407c9e15b9", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "d2Alpha", + "line": 14, + "source_header": "1\n\nnoncomputable def d2Alpha (m2 m4 q : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2Gamma", + "line": 17, + "source_header": "q\n\nnoncomputable def d2Gamma (m2 m4 q : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2DetV", + "line": 20, + "source_header": "q\n\nnoncomputable def d2DetV (m2 m4 q : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2Numerator", + "line": 23, + "source_header": "q\n\nnoncomputable def d2Numerator (m2 m4 : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2Schur", + "line": 26, + "source_header": ")\n\nnoncomputable def d2Schur (m2 m4 q : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2Delta", + "line": 32, + "source_header": "q\n\nnoncomputable def d2Delta (m2 m4 m6 : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "d2Tau", + "line": 34, + "source_header": "2\n\nnoncomputable def d2Tau (m2 m4 m6 q : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_numerator", + "line": 38, + "source_header": ")\n\n/-- Exact polynomial cancellation; it does not divide by the pin determinant. -/\ntheorem d2_schur_numerator (m2 m4 q : ℝ) :\n d2Alpha m2 m4 q * d2DetV m2 m4 q - d2Gamma m2 m4 q ^ 3 -\n (2 * d2Gamma m2 m4 q + d2Alpha m2 m4 q) *\n (m4 - 3 * m2 ^ 2) ^ 2 * q * (1 - 4 * q) = d2Numerator m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_det_axis", + "line": 46, + "source_header": "ing\n\ntheorem d2_det_axis (m2 m4 : ℝ) : d2DetV m2 m4 0 = m2 ^ 2 *" + }, + { + "kind": "theorem", + "unqualified_name": "d2_det_diagonal", + "line": 49, + "source_header": "tV]\n\ntheorem d2_det_diagonal (m2 m4 : ℝ) :\n d2DetV m2 m4 (1 / 4) = (m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2)" + }, + { + "kind": "theorem", + "unqualified_name": "d2_det_interpolation", + "line": 54, + "source_header": "ing\n\ntheorem d2_det_interpolation (m2 m4 q : ℝ) :\n d2DetV m2 m4 q = (1 - 4 * q) * (m2 ^ 2 * m4) +\n 4 * q * ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) /" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_ratio", + "line": 60, + "source_header": "ing\n\n/-- The nonzero hypothesis is essential even with Lean's total division. -/\ntheorem d2_schur_ratio (m2 m4 q : ℝ) (hD : d2DetV m2 m4 q ≠ 0) :\n d2Schur m2 m4 q = d2Numerator m2 m4 / d2DetV m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_numerator_pos", + "line": 69, + "source_header": "arith\n\ntheorem d2_numerator_pos (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n 0 < d2Numerator" + }, + { + "kind": "theorem", + "unqualified_name": "d2_det_pos", + "line": 80, + "source_header": "v) hs\n\ntheorem d2_det_pos (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) : 0 < d2DetV m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_pos", + "line": 95, + "source_header": ") hb)\n\ntheorem d2_schur_pos (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) : 0 < d2Schur m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_det_le_endpoint_max", + "line": 101, + "source_header": "4) hD\n\ntheorem d2_det_le_endpoint_max (m2 m4 q : ℝ) (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :\n d2DetV m2 m4 q ≤\n max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2)" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_endpoint_lower", + "line": 114, + "source_header": "ring\n\n/-- A uniform positive lower bound on q in [0,1/4], with moment premises explicit. -/\ntheorem d2_schur_endpoint_lower (m2 m4 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :\n d2Numerator m2 m4 /\n max (m2 ^ 2 * m4) ((m4 - m2 ^ 2) * (m4 + 3 * m2 ^ 2) / 4) ≤\n d2Schur" + }, + { + "kind": "theorem", + "unqualified_name": "d2_tau_cumulant_eq", + "line": 127, + "source_header": "m4).le)\n\ntheorem d2_tau_cumulant_eq (m2 m4 m6 q : ℝ) (hm2 : m2 ≠ 0) :\n 6 * m2 ^ 3 + 9 * m2 * (m4 - 3 * m2 ^ 2) * (1 - 2 * q) +\n (m6 - 15 * m4 * m2 + 30 * m2 ^ 3 - (m4 - 3 * m2 ^ 2) ^ 2 / m2) *\n (1 - 3 * q) = d2Tau m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_tau_axis", + "line": 135, + "source_header": ";> ring\n\ntheorem d2_tau_axis (m2 m4 m6 : ℝ) : d2Tau m2 m4 m6 0 = d2Delta m" + }, + { + "kind": "theorem", + "unqualified_name": "d2_tau_diagonal", + "line": 138, + "source_header": "[d2Tau]\n\ntheorem d2_tau_diagonal (m2 m4 m6 : ℝ) :\n d2Tau m2 m4 m6 (1 / 4) =\n (d2Delta m2 m4 m6 + 9 * m2 * (m4 - m2 ^" + }, + { + "kind": "theorem", + "unqualified_name": "d2_tau_pos", + "line": 144, + "source_header": "ring\n\ntheorem d2_tau_pos (m2 m4 m6 q : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hDelta : 0 < d2Delta m2 m4 m6) (hq0 : 0 ≤ q) (hq1 : q ≤ 1 / 4) :\n 0 < d2Tau m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2_gaussian_control", + "line": 156, + "source_header": "ty) hb)\n\n/-- Gaussian-reference algebra, for all real q, not a probabilistic identification. -/\ntheorem d2_gaussian_control (q : ℝ) :\n d2DetV 1 3 q = 3 ∧ d2Schur 1 3 q = 8 / 3 ∧ d2Tau 1 3" + }, + { + "kind": "theorem", + "unqualified_name": "d2_degenerate_control", + "line": 162, + "source_header": "<;> ring\n\n/-- At a singular moment boundary the unguarded quotient identity is false. -/\ntheorem d2_degenerate_control :\n d2DetV 1 1 (1 / 4) = 0 ∧ d2Schur 1 1 (1 / 4) = 2 ∧\n d2Numerator 1 1 / d2DetV 1 1 (1 / 4) = 0 ∧ d2Tau" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/MomentTail.lean", + "sha256": "87fe3ee90afc52d8c2652881f1ae195d1b0b15a2ffc18c84d6166d1a4d0de2aa", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "badJetEvent", + "line": 19, + "source_header": "]\n\n/-- The exact strict threshold event used by the fifth-power jet ledger. -/\ndef badJetEvent (R : Ω → ℝ) (r ε : ℝ) : Se" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_markov_event", + "line": 23, + "source_header": "5}\n\n/-- Markov for any event contained in a positive superlevel set, on a finite\nmeasure. Integrability prevents totalized divergent integrals from being used. -/\ntheorem p02_lm009_markov_event\n (μ : Measure Ω) [IsFiniteMeasure μ] (Y : Ω → ℝ) (A : Set Ω)\n (hY : Integrable Y μ) (hY0 : 0 ≤ᵐ[μ] Y)\n (a : ℝ) (ha : 0 < a) (hsub : A ⊆ {x | a ≤ Y x}) :\n (μ A).toReal ≤ (∫ x, Y x ∂μ" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_badJet_measurable", + "line": 39, + "source_header": "arkov\n\n/-- Actual measurability of the bad event from measurability of the jet norm. -/\ntheorem p02_lm009_badJet_measurable\n (R : Ω → ℝ) (hR : Measurable R) (r ε : ℝ) :\n MeasurableSet (badJetEvent" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_badJet_subset", + "line": 46, + "source_header": "n_prop)\n\n/-- The event itself implies the needed positive fifth-power threshold, even\nfor signed R; no global sign assumption on R is necessary. -/\ntheorem p02_lm009_badJet_subset\n (R : Ω → ℝ) (r ε : ℝ) (hr : 0 < r) (hε : 0 < ε) :\n badJetEvent R r ε ⊆ {x | (ε / r) ^ 8 ≤" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_tail", + "line": 58, + "source_header": "using hp\n\n/-- A supplied integrable fortieth-moment bound gives the actual eighth-order\nevent tail, with the exact epsilon denominator and no independence hypothesis. -/\ntheorem p02_lm009_moment40_tail\n (μ : Measure Ω) [IsProbabilityMeasure μ] (R : Ω → ℝ)\n (r ε M : ℝ) (hr : 0 < r) (hε : 0 < ε)\n (hRi : Integrable (fun x => R x ^ 40) μ)\n (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M) :\n (μ (badJetEvent R r ε)).toReal ≤ (M / ε ^" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_weighted_r4", + "line": 79, + "source_header": "e_of_gt hε]\n\n/-- The constructed weighted probability law satisfies the stronger fourth-\norder tail. The model's moment and positive lower-normalizer bounds are premises. -/\ntheorem p02_lm009_moment40_weighted_r4\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W R : Ω → ℝ)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hR : Measurable R)\n (r ε M cW cZ : ℝ) (hr : 0 < r) (hε : 0 < ε)\n (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hRi : Integrable (fun x => R x ^ 40) μ)\n (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :\n IsProbabilityMeasure (weightedLaw μ W) ∧\n (weightedLaw μ W (badJetEvent R r ε)).toReal ≤\n ((Real.sqrt cW / cZ) * Real.sqrt (M / ε" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_weighted_r3", + "line": 111, + "source_header": "_ := by ring\n\n/-- Cubic consequence on the explicit domain 0 < r ≤ 1. -/\ntheorem p02_lm009_moment40_weighted_r3\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W R : Ω → ℝ)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hR : Measurable R)\n (r ε M cW cZ : ℝ) (hr : 0 < r) (hr1 : r ≤ 1) (hε : 0 < ε)\n (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hRi : Integrable (fun x => R x ^ 40) μ)\n (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :\n IsProbabilityMeasure (weightedLaw μ W) ∧\n (weightedLaw μ W (badJetEvent R r ε)).toReal ≤\n ((Real.sqrt cW / cZ) * Real.sqrt (M /" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_family_r3", + "line": 128, + "source_header": ") hr.le hr1 hb⟩\n\n/-- A uniform family conclusion only when all law-specific bounds are supplied\nuniformly. This proves the quantifier assembly, not the existence of model bounds. -/\ntheorem p02_lm009_moment40_family_r3\n (μ : ℝ → Measure Ω) [∀ r, IsProbabilityMeasure (μ r)]\n (W R : ℝ → Ω → ℝ) (r0 ε M cW cZ : ℝ)\n (hr0 : 0 < r0 ∧ r0 ≤ 1) (hε : 0 < ε)\n (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hdata : ∀ r, 0 < r → r ≤ r0 →\n MemLp (W r) 2 (μ r) ∧ (0 ≤ᵐ[μ r] W r) ∧ Measurable (R r) ∧\n Integrable (fun x => R r x ^ 40) (μ r) ∧\n (∫ x, R r x ^ 40 ∂(μ r)) ≤ M ∧\n (∫ x, W r x ^ 2 ∂(μ r)) ≤ cW * r ^ 4 ∧\n cZ * r ^ 2 ≤ ∫ x, W r x ∂(μ r)) :\n ∃ C : ℝ, 0 ≤ C ∧ ∀ r, 0 < r → r ≤ r0 →\n IsProbabilityMeasure (weightedLaw (μ r) (W r)) ∧\n (weightedLaw (μ r) (W r) (badJetEvent (R r) r ε)).t" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/WeightPerturbation.lean", + "sha256": "50ce15709a133da12a0b4333cc653d26c5fd8a412976c975a7c2f3b25ed5c00f", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "weightPerturbation_integral", + "line": 19, + "source_header": "]\n\n/-- Integrability, not a totalized divergent integral, justifies subtraction. -/\ntheorem weightPerturbation_integral\n (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ) :\n |(∫ x, W x ∂μ) - (∫ x, V x ∂μ)| ≤ ∫ x, |W x - V x|" + }, + { + "kind": "theorem", + "unqualified_name": "weightPerturbation_setIntegral", + "line": 26, + "source_header": "abs\n\n/-- Restricting to any set cannot increase the integral absolute error. The\nprobability formula below separately requires measurable events. -/\ntheorem weightPerturbation_setIntegral\n (μ : Measure Ω) (W V : Ω → ℝ) (A : Set Ω)\n (hW : Integrable W μ) (hV : Integrable V μ) :\n |(∫ x in A, W x ∂μ) - (∫ x in A, V x ∂μ)| ≤ ∫ x, |W x - V" + }, + { + "kind": "theorem", + "unqualified_name": "weightPerturbation_normalizer_lower", + "line": 37, + "source_header": "x))))\n\n/-- A reference normalizer lower bound loses at most the supplied L1 budget. -/\ntheorem weightPerturbation_normalizer_lower\n (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ)\n (c δ : ℝ) (hreference : c ≤ ∫ x, V x ∂μ)\n (herror : (∫ x, |W x - V x| ∂μ) ≤ δ) :\n c - δ ≤ ∫ x," + }, + { + "kind": "theorem", + "unqualified_name": "weightPerturbation_event_integral_bounds", + "line": 46, + "source_header": "inarith\n\n/-- A nonnegative event numerator lies between zero and its own normalizer. -/\ntheorem weightPerturbation_event_integral_bounds\n (μ : Measure Ω) (W : Ω → ℝ) (A : Set Ω)\n (hW : Integrable W μ) (hW0 : 0 ≤ᵐ[μ] W) :\n 0 ≤ (∫ x in A, W x ∂μ) ∧ (∫ x in A, W x ∂μ) ≤ ∫" + }, + { + "kind": "theorem", + "unqualified_name": "weightPerturbation_quotient_bound", + "line": 54, + "source_header": "l hW hW0⟩\n\n/-- Scalar ratio stability with the reference denominator t. The factor 2 is\nconvenient, not claimed optimal. No sign premise on b is needed for this lemma. -/\ntheorem weightPerturbation_quotient_bound\n (a b z t δ : ℝ) (hz : 0 < z) (ht : 0 < t)\n (ha : 0 ≤ a) (haz : a ≤ z) (hab : |a - b| ≤ δ) (hzt : |z - t| ≤ δ) :\n |a / z - b / t|" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_event_perturbation", + "line": 84, + "source_header": ":= by ring\n\n/-- Under one common measure, a small L1 weight error transfers a positive\nreference normalizer to W and controls all measurable-event probabilities.\nThe ambient measure need not be finite or a probability measure. -/\ntheorem weightedLaw_event_perturbation\n (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ)\n (hW0 : 0 ≤ᵐ[μ] W) (hV0 : 0 ≤ᵐ[μ] V)\n (c δ : ℝ) (hc : 0 < c) (hreference : c ≤ ∫ x, V x ∂μ)\n (herror : (∫ x, |W x - V x| ∂μ) ≤ δ) (hsmall : δ ≤ c / 2) :\n c / 2 ≤ (∫ x, W x ∂μ) ∧\n IsProbabilityMeasure (weightedLaw μ W) ∧\n IsProbabilityMeasure (weightedLaw μ V) ∧\n ∀ A : Set Ω, MeasurableSet A →\n |(weightedLaw μ W A).toReal - (weightedLaw μ V A).toReal" + }, + { + "kind": "theorem", + "unqualified_name": "weightedLaw_event_perturbation_r2", + "line": 114, + "source_header": "c hreference)\n\n/-- The natural r² normalizer and L1-error scales cancel. No r ≤ 1 restriction\nis needed. Uniform application requires uniform c and the displayed budgets. -/\ntheorem weightedLaw_event_perturbation_r2\n (μ : Measure Ω) (W V : Ω → ℝ) (hW : Integrable W μ) (hV : Integrable V μ)\n (hW0 : 0 ≤ᵐ[μ] W) (hV0 : 0 ≤ᵐ[μ] V)\n (r c η : ℝ) (hr : 0 < r) (hc : 0 < c)\n (hreference : c * r ^ 2 ≤ ∫ x, V x ∂μ)\n (herror : (∫ x, |W x - V x| ∂μ) ≤ η * r ^ 2) (hsmall : η ≤ c / 2) :\n (c * r ^ 2) / 2 ≤ (∫ x, W x ∂μ) ∧\n IsProbabilityMeasure (weightedLaw μ W) ∧\n IsProbabilityMeasure (weightedLaw μ V) ∧\n ∀ A : Set Ω, MeasurableSet A →\n |(weightedLaw μ W A).toReal - (weightedLaw μ V A).toRe" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/MeasureBridge.lean", + "sha256": "28ac130db490c3c3e2fbfabf3ac5be43c854ab1468bf573bf5a8c0dd2c50955f", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "p02_lm008_integral_cs", + "line": 21, + "source_header": "]\n\n/-- Actual Bochner-integral Cauchy-Schwarz for nonnegative square-integrable\nfunctions, obtained from the pinned mathlib Holder theorem with exponents 2,2. -/\ntheorem p02_lm008_integral_cs\n (μ : Measure Ω) (f g : Ω → ℝ)\n (hf : MemLp f 2 μ) (hg : MemLp g 2 μ)\n (hf0 : 0 ≤ᵐ[μ] f) (hg0 : 0 ≤ᵐ[μ] g) :\n (∫ x, f x * g x ∂μ) ≤\n Real.sqrt (∫ x, f x ^ 2 ∂μ) * Real.sqrt (∫ x, g x ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_event_cs", + "line": 34, + "source_header": "g h\n\n/-- The event may depend arbitrarily on W. Its indicator's second moment is\nits probability under this same μ; no independence assumption is used. -/\ntheorem p02_lm008_event_cs\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A) :\n (∫ x in A, W x ∂μ) ≤\n Real.sqrt (∫ x, W x ^ 2 ∂μ) * Real.sqrt ((μ A).to" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_event_numerator", + "line": 61, + "source_header": "g hcs\n\n/-- The r^4 second-moment premise supplies the previously assumed r^2\nnumerator bound. This theorem does not establish that premise for a model. -/\ntheorem p02_lm008_event_numerator\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (r cW : ℝ) (hcW : 0 ≤ cW)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4) :\n (∫ x in A, W x ∂μ) ≤ Real.sqrt cW * r ^ 2 * Real.sqrt ((μ A)." + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_measure_transfer", + "line": 79, + "source_header": "neg _))\n\n/-- Same-law integral-ratio transfer. Positivity of the actual normalizer\nis derived from its explicit lower bound, never from an upper bound. -/\ntheorem p02_lm008_measure_transfer\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (r cW cZ : ℝ) (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ) :\n (∫ x in A, W x ∂μ) / (∫ x, W x ∂μ) ≤\n (Real.sqrt cW / cZ) * Real.sqrt ((μ A" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_measure_transfer_r8_to_r3", + "line": 96, + "source_header": "hsecond)\n\n/-- An explicitly supplied eighth-order event bound transfers to a cubic\nbound on 0 < r ≤ 1. Uniformity in r and the input tail remain unproved here. -/\ntheorem p02_lm009_measure_transfer_r8_to_r3\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (A : Set Ω)\n (hW : MemLp W 2 μ) (hW0 : 0 ≤ᵐ[μ] W) (hA : MeasurableSet A)\n (r cW cZ K : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)\n (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hK : 0 ≤ K)\n (hsecond : (∫ x, W x ^ 2 ∂μ) ≤ cW * r ^ 4)\n (hlower : cZ * r ^ 2 ≤ ∫ x, W x ∂μ)\n (htail : (μ A).toReal ≤ K * r ^ 8) :\n (∫ x in A, W x ∂μ) / (∫ x, W x ∂μ) ≤\n ((Real.sqrt cW / cZ) * Real.sqrt" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_sqrt_counterexample", + "line": 128, + "source_header": "hr1 hfourth\n\n/-- Scalar data realized by W=4 on an event of probability 1/4 and W=0\nelsewhere. Cauchy-Schwarz is sharp; omitting the event square root is false.\nThe realization is checked separately by exact finite-model Python tests. -/\ntheorem p02_lm008_sqrt_counterexample :\n (1 : ℝ) = Real.sqrt 4 * Real.sqrt (1 / 4 : ℝ) ∧\n ¬ (1 : ℝ) ≤ Real.sqrt 4" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_upper_normalizer_counterexample", + "line": 136, + "source_header": "by\n norm_num\n\n/-- Scalar data realized by W=1 on a one-point probability space, r=1,\ncW=1, cZ=2. The upper bound on z holds but the proposed ratio bound fails.\nThis does not assert that the required lower bound holds. -/\ntheorem p02_lm008_upper_normalizer_counterexample :\n (1 : ℝ) ≤ 2 * 1 ^ 2 ∧\n (1 : ℝ) / 1 > (Real.sqrt 1 / 2" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/MomentGenerality.lean", + "sha256": "fdec55f1602938cd8fdb5b71535962e76a9671bf230dea53868b14147fb3b509", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_tail_finite", + "line": 20, + "source_header": "]\n\n/-- The fortieth-moment event bound for any finite measure. The event mass is\nnot normalized by the total mass; both sides scale with the ambient measure. -/\ntheorem p02_lm009_moment40_tail_finite\n (μ : Measure Ω) [IsFiniteMeasure μ] (R : Ω → ℝ)\n (r ε M : ℝ) (hr : 0 < r) (hε : 0 < ε)\n (hRi : Integrable (fun x => R x ^ 40) μ)\n (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M) :\n (μ (badJetEvent R r ε)).toReal ≤ (M / ε ^ 8) * r" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_tail_of_finite", + "line": 41, + "source_header": "hε]\n\n/-- The original probability-space conclusion specializes from the finite\nmeasure companion. This does not replace or edit the original declaration. -/\ntheorem p02_lm009_moment40_tail_of_finite\n (μ : Measure Ω) [IsProbabilityMeasure μ] (R : Ω → ℝ)\n (r ε M : ℝ) (hr : 0 < r) (hε : 0 < ε)\n (hRi : Integrable (fun x => R x ^ 40) μ)\n (hMbound : (∫ x, R x ^ 40 ∂μ) ≤ M) :\n (μ (badJetEvent R r ε)).toReal ≤ (M / ε ^ 8) *" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_family_r3_interval", + "line": 51, + "source_header": "bound\n\n/-- One fixed cubic constant, with probability and all model bounds required\nonly on 0 < r ≤ r0. No probability assumption is made outside that interval. -/\ntheorem p02_lm009_moment40_family_r3_interval\n (μ : ℝ → Measure Ω)\n (W R : ℝ → Ω → ℝ) (r0 ε M cW cZ : ℝ)\n (hr0 : 0 < r0 ∧ r0 ≤ 1) (hε : 0 < ε)\n (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hdata : ∀ r, 0 < r → r ≤ r0 →\n IsProbabilityMeasure (μ r) ∧\n MemLp (W r) 2 (μ r) ∧ (0 ≤ᵐ[μ r] W r) ∧ Measurable (R r) ∧\n Integrable (fun x => R r x ^ 40) (μ r) ∧\n (∫ x, R r x ^ 40 ∂(μ r)) ≤ M ∧\n (∫ x, W r x ^ 2 ∂(μ r)) ≤ cW * r ^ 4 ∧\n cZ * r ^ 2 ≤ ∫ x, W r x ∂(μ r)) :\n ∃ C : ℝ, 0 ≤ C ∧ ∀ r, 0 < r → r ≤ r0 →\n IsProbabilityMeasure (weightedLaw (μ r) (W r)) ∧\n (weightedLaw (μ r) (W r) (badJetEvent (R r) r ε)).toReal ≤ C" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_moment40_family_r3_of_interval", + "line": 75, + "source_header": "hlower\n\n/-- A globally supplied probability family is a specialization of the interval\nversion, so the previous interface is retained without changing its source. -/\ntheorem p02_lm009_moment40_family_r3_of_interval\n (μ : ℝ → Measure Ω) [∀ r, IsProbabilityMeasure (μ r)]\n (W R : ℝ → Ω → ℝ) (r0 ε M cW cZ : ℝ)\n (hr0 : 0 < r0 ∧ r0 ≤ 1) (hε : 0 < ε)\n (hM : 0 ≤ M) (hcW : 0 ≤ cW) (hcZ : 0 < cZ)\n (hdata : ∀ r, 0 < r → r ≤ r0 →\n MemLp (W r) 2 (μ r) ∧ (0 ≤ᵐ[μ r] W r) ∧ Measurable (R r) ∧\n Integrable (fun x => R r x ^ 40) (μ r) ∧\n (∫ x, R r x ^ 40 ∂(μ r)) ≤ M ∧\n (∫ x, W r x ^ 2 ∂(μ r)) ≤ cW * r ^ 4 ∧\n cZ * r ^ 2 ≤ ∫ x, W r x ∂(μ r)) :\n ∃ C : ℝ, 0 ≤ C ∧ ∀ r, 0 < r → r ≤ r0 →\n IsProbabilityMeasure (weightedLaw (μ r) (W r)) ∧\n (weightedLaw (μ r) (W r) (badJetEvent (R r) r ε)).toReal ≤" + } + ] + }, + { + "path": "formal/ResearchFormalCoreR1/AlgebraV2.lean", + "sha256": "4480708263c40a2f7f03f12ef7e15f0eb4f8193c2dccbb253921a7ec251863c3", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "foldPotential", + "line": 6, + "source_header": "/-- Canonical A₂ normal-form potential, parameterized by `s` with λ = s². -/\nnoncomputable def foldPotential (s x : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "ec005_fold_gap", + "line": 9, + "source_header": "x\n\n/-- EC-005: exact canonical fold-gap identity in the normalized coordinate. -/\ntheorem ec005_fold_gap (s : ℝ) :\n foldPotential s s - foldPotential s (-s) = (2 * s) ^ 3" + }, + { + "kind": "theorem", + "unqualified_name": "ec008_factor_expansion", + "line": 15, + "source_header": "ing\n\n/-- EC-008: scalar polynomial companion for the planar collision-Gram determinant.\n This is not the matrix-construction theorem. -/\ntheorem ec008_factor_expansion (c s : ℝ) :\n 2 * s ^ 2 *\n ((s ^ 2 * (3 * c ^ 4 + 3 * c ^ 2 * s ^ 2 + s ^ 4) / 24) *\n (s ^ 2 * (4 * c ^ 2 + s ^ 2) / 2) -\n (-c * s ^ 2 * (2 * c ^ 2 + s ^ 2) / 4) ^ 2) =\n s ^ 8 * (c ^ 2 + s ^ 2) * (3 * c ^ 2 + s ^ 2)" + }, + { + "kind": "theorem", + "unqualified_name": "ec010_generic", + "line": 25, + "source_header": "ring\n\n/-- EC-010, generic chart: declared convex-combination polynomial identity. -/\ntheorem ec010_generic (α K c η : ℝ) :\n (K + 8 * α * c * η) ^ 2 + 64 * α * (1 - α) * c ^ 2 * η ^ 2 =\n (1 - α) * K ^ 2 + α * (K + 8 * c *" + }, + { + "kind": "theorem", + "unqualified_name": "ec010_transverse", + "line": 31, + "source_header": "ring\n\n/-- EC-010, transverse chart: declared convex-combination polynomial identity. -/\ntheorem ec010_transverse (α a η : ℝ) :\n (a + (1 - 2 * α) * η) ^ 2 + 4 * α * (1 - α) * η ^ 2 =\n (1 - α) * (a + η) ^ 2 + α * (a" + }, + { + "kind": "theorem", + "unqualified_name": "ec011_scalar_cancellation", + "line": 37, + "source_header": "by\n ring\n\n/-- EC-011: scalar cancellation companion to the adjoint-orbit calculation.\n It does not formalize the ODE, Hessian symmetry, or section normalization. -/\ntheorem ec011_scalar_cancellation (h w g : ℝ) :\n (-h * w) * g + w *" + }, + { + "kind": "theorem", + "unqualified_name": "ec014_contact_power", + "line": 43, + "source_header": "= by\n ring\n\n/-- EC-014: exact contact-power scalar identity for nonzero separation.\n It does not formalize the six-pin matrix determinant or density transform. -/\ntheorem ec014_contact_power (r : ℝ) (hr : r ≠ 0) :\n (r ^ 3 / 6) * (1 / r ^ 5) * r ^ 2" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:frontiers/asymmetric_elder_bridge_20261017", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean", + "sha256": "3dab19342c307f6b70f4fa05ac913b4ead083742a56408db71b45276c0acb9ab" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceControls.lean", + "sha256": "f048de3c19859b96af44b4637c875eed57443d33767b57631f9ad0548a7ee7ca" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalControls.lean", + "sha256": "b515d40bc0f58a71c3afa80e3ae7fae53725f3d713c2df2df110ba2814a4ece3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridgeAudit.lean", + "sha256": "b3b4151188b4d790d280968c1fbe65b9c3458888a37b380349f3707302113e4c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderIntervalAxiomAudit.lean", + "sha256": "4916c4446872057a0ebcbe07226fd8c4245ff450ddd2d430be81ab97ec5c6dc3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearanceAudit.lean", + "sha256": "8ddaab57d2651a7375a509a90f274381bf15f6dcf5707460614a81075aa9e52b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean", + "sha256": "6b0be1116f6b357b0ffbda202c572c27c2788b98bee639e228375a5ebeea1fa9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean", + "sha256": "d3d78472881059546402218cc77792eeef00755c222bb02499d69abd3b5cd57e" + } + ], + "source_record_sha256": "c9bf19ac350f4f3a11e04b2190e742e82488c211fda959f621045828da06df8e", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "frontiers/asymmetric_elder_bridge_20261017", + "source_files": [ + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean", + "sha256": "3dab19342c307f6b70f4fa05ac913b4ead083742a56408db71b45276c0acb9ab", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "elderActive", + "line": 19, + "source_header": "u\n\n/-- Increasing parameter `t=-height`: closed birth and open death. -/\ndef elderActive (m d t : ℝ) : P" + }, + { + "kind": "def", + "unqualified_name": "elderFiber", + "line": 24, + "source_header": "k]\n\n/-- The fiber is k on the interval and the zero submodule elsewhere. -/\ndef elderFiber (m d t : ℝ) : Submodule k k where\n ca" + }, + { + "kind": "theorem", + "unqualified_name": "elderFiber_eq_zero", + "line": 31, + "source_header": "hb h]\n\ntheorem elderFiber_eq_zero {m d t : ℝ} (ht : ¬ elderActive m d t)\n (x : elderFiber k m d t) :" + }, + { + "kind": "def", + "unqualified_name": "elderFiberMap", + "line": 36, + "source_header": "ty ht\n\ndef elderFiberMap (m d : ℝ) {s t : ℝ} (hst : s ≤ t) :\n elderFiber k m d s →ₗ[k] elderFiber k m d t where\n to" + }, + { + "kind": "def", + "unqualified_name": "elderInterval", + "line": 53, + "source_header": "= rfl\n\n/-- The actual interval persistence functor; no maps are assumed. -/\ndef elderInterval (m d : ℝ) : ℝ ⥤ ModuleCat k where" + }, + { + "kind": "def", + "unqualified_name": "elderFiberLift", + "line": 79, + "source_header": "mp [ht]\n\n/-- A canonical lift of a coefficient to any active interval fiber. -/\ndef elderFiberLift {m d t : ℝ} (ht : elderActive m d t) :\n k →ₗ[k] elderFiber k m d t where" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_birth", + "line": 89, + "source_header": "a := rfl\n\n/-- Endpoint control: birth is included. -/\ntheorem elder_control_birth {m d : ℝ} (hdm : d < m) : elderActi" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_death", + "line": 93, + "source_header": ";> linarith\n\n/-- Endpoint control: death is excluded, despite closed superlevels. -/\ntheorem elder_control_death (m d : ℝ) : ¬ elderAc" + }, + { + "kind": "structure", + "unqualified_name": "ElderTrap", + "line": 100, + "source_header": "X) (m d : ℝ)\n\n/-- The topological consequences of the asymmetric ridge trap. No H0 maps or\nsplitting conclusions occur among the premises. The path at d is actual closed\nsuperlevel connectivity, while active cuts are clopen. -/\nstructure ElderTrap (D : Set X) : Prop where\n death_lt_birth : d < m\n maximum_height : g M = m\n older_height : m < g P\n maximum_inside : M ∈ D\n older_outside : P ∉ D\n height_ceiling : ∀ x ∈ D, g x ≤ m\n active_clopen : ∀ t, elderActive m d t →\n IsClopen {x : superlevel_set g t | x.val ∈ D}\n closed_path : JoinedIn (superlevel" + }, + { + "kind": "theorem", + "unqualified_name": "ElderTrap.maximum_mem", + "line": 116, + "source_header": "d} {D : Set X}\n\ntheorem ElderTrap.maximum_mem (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : M ∈ sup" + }, + { + "kind": "theorem", + "unqualified_name": "ElderTrap.older_mem", + "line": 122, + "source_header": "linarith [ht.1]\n\ntheorem ElderTrap.older_mem (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : P ∈ sup" + }, + { + "kind": "theorem", + "unqualified_name": "elder_clopen_path_iff", + "line": 127, + "source_header": "T.older_height]\n\n/-- Clopen cuts are constant on actual path components, with no local path\nconnectivity assumption on the ambient space. -/\ntheorem elder_clopen_path_iff {Y : Type u} [TopologicalSpace Y] {U : Set Y}\n (hU : IsClopen U) {x y : Y} (p : Path x y" + }, + { + "kind": "def", + "unqualified_name": "ElderTrap.componentInside", + "line": 138, + "source_header": "nt_subset hy hyx⟩\n\n/-- The D indicator is genuinely descended to the path-component quotient. -/\ndef ElderTrap.componentInside (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : ZerothHomotopy (superle" + }, + { + "kind": "def", + "unqualified_name": "elderDifference", + "line": 150, + "source_header": "f.rfl\n\nvariable {k}\n\n/-- The actual singular-H0 point-class difference on an active level. -/\ndef elderDifference (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :\n ModuleCat.of k k ⟶ (superlevel_h0Filtration g (Mod" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_map", + "line": 159, + "source_header": "⟨P, T.older_mem ht⟩\n\ntheorem elderDifference_map (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_map_dead", + "line": 168, + "source_header": "⟩ ⟨P, T.older_mem hs⟩\n\ntheorem elderDifference_map_dead (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : -d ≤ t) (hst : s ≤ t) :" + }, + { + "kind": "def", + "unqualified_name": "elderProjection", + "line": 178, + "source_header": "superlevel_mono g ht)\n\n/-- The component indicator transported by the existing actual H0 comparison. -/\ndef elderProjection (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).o" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_point", + "line": 186, + "source_header": "e ht q then 𝟙 _ else 0)\n\ntheorem elderProjection_point (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) (x : superlevel_set g t) :\n ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k) x ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_projection", + "line": 198, + "source_header": "igma.ι_comp_desc]\n rfl\n\ntheorem elderDifference_projection (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :" + }, + { + "kind": "def", + "unqualified_name": "elderSectionApp", + "line": 207, + "source_header": "nside, T.older_outside]\n\ndef elderSectionApp (T : ElderTrap g M P m d D) (t : ℝ) :\n (elderInterval k m d).obj t ⟶\n (superlevel_h0Filtration g (M" + }, + { + "kind": "def", + "unqualified_name": "elderRetractionApp", + "line": 214, + "source_header": "rDifference T ht else 0\n\ndef elderRetractionApp (T : ElderTrap g M P m d D) (t : ℝ) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).obj t ⟶\n (eld" + }, + { + "kind": "theorem", + "unqualified_name": "elderSectionApp_naturality", + "line": 221, + "source_header": "rFiberLift k ht) else 0\n\ntheorem elderSectionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}\n (hst : s ≤ t) :\n (elderInterval k m d).map (homOfLE hst) ≫ elderSectionApp T t =\n elderSectionApp T s ≫\n (superlevel_h0Filtration g (ModuleCat.of" + }, + { + "kind": "def", + "unqualified_name": "elderSection", + "line": 246, + "source_header": "ro k hs x\n simp [hx]\n\n/-- Section from the interval to actual singular H0. -/\ndef elderSection (T : ElderTrap g M P m d D) :\n elderInterval k m d ⟶ superlevel_h0Filtration g (Modu" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_naturality_active", + "line": 254, + "source_header": "_naturality T (leOfHom f)\n\ntheorem elderProjection_naturality_active (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_prebirth", + "line": 266, + "source_header": "erProjection_point]\n rfl\n\n/-- The birth-crossing square follows from the geometric height ceiling:\nthere is no source point in D above m. It is not an assumed naturality field. -/\ntheorem elderProjection_prebirth (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : s < -m) (ht : elderActive m d t) (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderRetractionApp_naturality", + "line": 287, + "source_header": "right hx]\n erw [comp_zero]\n\ntheorem elderRetractionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}\n (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫\n elderRetractionApp T t =\n elderRetractionApp T s ≫ (elderInterv" + }, + { + "kind": "def", + "unqualified_name": "elderRetraction", + "line": 328, + "source_header": "simp [htd]\n · simp [hs]\n\n/-- Retraction from actual singular H0 to the interval, using component descent. -/\ndef elderRetraction (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k k) ⟶ el" + }, + { + "kind": "theorem", + "unqualified_name": "elderSection_retraction", + "line": 339, + "source_header": "r. -/\n@[reassoc (attr := simp)]\ntheorem elderSection_retraction (T : ElderTrap g M" + }, + { + "kind": "def", + "unqualified_name": "elderKernelProjection", + "line": 354, + "source_header": "er_eq_zero k ht x\n simp [hx]\n\ndef elderKernelProjection (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k" + }, + { + "kind": "def", + "unqualified_name": "elderDirectSummand", + "line": 361, + "source_header": "n, Category.comp_id, sub_self])\n\n/-- An actual natural direct-sum isomorphism, not a postulated decomposition.\nIts maps are v ↦ (qv,v-jqv) and (c,w) ↦ jc+w. -/\ndef elderDirectSummand (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k k) ≅\n elderInterval k" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_ordinary_point_survives", + "line": 381, + "source_header": "gory.assoc, Preadditive.comp_sub]\n\n/-- Ordinary individual point classes remain nonzero; the dying section uses\ntheir difference. This is valid independently of characteristic. -/\ntheorem elder_control_ordinary_point_survives (t : ℝ) (x : superlevel_set g t) :\n ordinaryH0_pointClass (TopCat.of (superlevel" + } + ] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderClearanceControls.lean", + "sha256": "f048de3c19859b96af44b4637c875eed57443d33767b57631f9ad0548a7ee7ca", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "elder_control_below", + "line": 15, + "source_header": "/-- A strict subthreshold is genuinely attained as strict clearance. -/\ntheorem elder_control_below : d - 1 ∈ superlevelBar_clearanceSet g" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_death_excluded", + "line": 21, + "source_header": "h\n\n/-- The attained closed death is excluded from the strict clearance set. -/\ntheorem elder_control_death_excluded : d ∉ superlevelBar_clearanceSet" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_positive_lifetime", + "line": 26, + "source_header": "l d\n\n/-- A strict geometric height gap gives positive lifetime in the literal data. -/\ntheorem elder_control_positive_lifetime (hg : Continuous g) (hdm : d < g M) :\n 0 < g M - superlevelBar_deathHeigh" + } + ] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderIntervalControls.lean", + "sha256": "b515d40bc0f58a71c3afa80e3ae7fae53725f3d713c2df2df110ba2814a4ece3", + "declarations_lexical": [] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderBridgeAudit.lean", + "sha256": "b3b4151188b4d790d280968c1fbe65b9c3458888a37b380349f3707302113e4c", + "declarations_lexical": [] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderIntervalAxiomAudit.lean", + "sha256": "4916c4446872057a0ebcbe07226fd8c4245ff450ddd2d430be81ab97ec5c6dc3", + "declarations_lexical": [] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderClearanceAudit.lean", + "sha256": "8ddaab57d2651a7375a509a90f274381bf15f6dcf5707460614a81075aa9e52b", + "declarations_lexical": [] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean", + "sha256": "6b0be1116f6b357b0ffbda202c572c27c2788b98bee639e228375a5ebeea1fa9", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "elderTrap_closedTrace_isClopen", + "line": 15, + "source_header": "u\n\n/-- Every active closed level includes continuously into the strict level\nabove d. Pulling back the proved strict separation gives closed-level separation. -/\ntheorem elderTrap_closedTrace_isClopen {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d t : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d)) (ht : t < -d) :\n IsClopen {x : superlevel_set g t | x.val ∈" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_of_boundary", + "line": 27, + "source_header": "hi\n\n/-- Actual geometric boundary, ceiling and closed path data inhabit the interval\ntrap. There is no H0 equation, interval split, clearance or death among inputs. -/\ntheorem elderTrap_of_boundary {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n ElderTrap g M P m d D where\n death_lt_" + }, + { + "kind": "def", + "unqualified_name": "elderBoundaryDirectSummand", + "line": 52, + "source_header": "hγ t\n\n/-- The constructed singular-H0 direct summand, instantiated from geometric\ninputs, rather than a premise asserting that a persistence summand exists. -/\ndef elderBoundaryDirectSummand (k : Type u) [Field k]\n {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevel_h0Filtration g (ModuleCat.of k k) ≅\n elderInterval k m d ⊞ kernel (elderRetrac" + }, + { + "kind": "theorem", + "unqualified_name": "elderBoundary_death_eq", + "line": 67, + "source_header": "P γ hγ)\n\n/-- On Euclidean heights the same geometric inputs also give the literal C263\ndeath. This is a proved join, not identification of an abstract death field. -/\ntheorem elderBoundary_death_eq {n : ℕ}\n (g : superlevelBar_E n → ℝ) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (m d : ℝ) (M P : superlevelBar_E n)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_deathHeigh" + } + ] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean", + "sha256": "d3d78472881059546402218cc77792eeef00755c222bb02499d69abd3b5cd57e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "elderTrap_strictTrace", + "line": 19, + "source_header": "n\n\n/-- The trace of a geometric domain in the strict superlevel above d. -/\ndef elderTrap_strictTrace {X : Type*} (g : X → ℝ) (D : Set X) (d : ℝ) :\n Set {x : X // d < g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_strictTrace_isClopen", + "line": 23, + "source_header": "D}\n\n/-- A boundary height bound makes the trace clopen in the strict superlevel.\nThis derives separation from a geometric domain; it does not assume a path cut. -/\ntheorem elderTrap_strictTrace_isClopen {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ) (hD : IsClosed D)\n (hboundary : ∀ x ∈ frontier D, g x ≤ d) :\n IsClopen (elderTrap_strictTrace g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_path_stays", + "line": 47, + "source_header": "e_val\n\n/-- A path strictly above the exit threshold cannot leave the geometric trap. -/\ntheorem elderTrap_path_stays {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n {M y : X} (hM : M ∈ D) (γ : Path M y)\n (hγ : ∀ t : unitInterval, d < g (γ t))" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_higher_path_meets_threshold", + "line": 66, + "source_header": "ng hone\n\n/-- Every higher-endpoint path must meet or fall below the exit threshold.\nThe conclusion quantifies over all ambient paths, including remote detours. -/\ntheorem elderTrap_higher_path_meets_threshold {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)\n {y : X} (hy : g M < g y) (γ : Path M y) :\n ∃ t : unitInterval, g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_clearance_eq_Iio", + "line": 79, + "source_header": "hyD)) hy\n\n/-- The literal C263 clearance is exactly the strict interval below d.\nThe closed path is supplied by the geometric construction, rather than inferred\nfrom a supremum over paths or from a compactness assertion about path space. -/\ntheorem elderTrap_clearance_eq_Iio {n : ℕ}\n (g : superlevelBar_E n → ℝ) (D : Set (superlevelBar_E n)) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ g M)\n (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_clearanceSet g M" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_death_eq", + "line": 98, + "source_header": "hh (hγ t)⟩\n\n/-- With continuity, the new geometric cut identifies the existing C263 death.\nNonessentiality is derived from the actual higher point P. -/\ntheorem elderTrap_death_eq {n : ℕ}\n (g : superlevelBar_E n → ℝ) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ g M)\n (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_deathH" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_closed_path_attains", + "line": 116, + "source_header": "P γ hγ]\n rfl\n\n/-- The displayed closed path actually attains d. This does not replace strict\nclearance by a closed inequality or infer an optimal path from a supremum. -/\ntheorem elderTrap_closed_path_attains {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)\n {P : X} (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n ∃ t : unitInterv" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:frontiers/asymmetric_elder_bridge_20261017", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "frontiers/asymmetric_elder_bridge_20261017", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean", + "sha256": "3dab19342c307f6b70f4fa05ac913b4ead083742a56408db71b45276c0acb9ab", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "elderActive", + "line": 19, + "source_header": "u\n\n/-- Increasing parameter `t=-height`: closed birth and open death. -/\ndef elderActive (m d t : ℝ) : P" + }, + { + "kind": "def", + "unqualified_name": "elderFiber", + "line": 24, + "source_header": "k]\n\n/-- The fiber is k on the interval and the zero submodule elsewhere. -/\ndef elderFiber (m d t : ℝ) : Submodule k k where\n ca" + }, + { + "kind": "theorem", + "unqualified_name": "elderFiber_eq_zero", + "line": 31, + "source_header": "hb h]\n\ntheorem elderFiber_eq_zero {m d t : ℝ} (ht : ¬ elderActive m d t)\n (x : elderFiber k m d t) :" + }, + { + "kind": "def", + "unqualified_name": "elderFiberMap", + "line": 36, + "source_header": "ty ht\n\ndef elderFiberMap (m d : ℝ) {s t : ℝ} (hst : s ≤ t) :\n elderFiber k m d s →ₗ[k] elderFiber k m d t where\n to" + }, + { + "kind": "def", + "unqualified_name": "elderInterval", + "line": 53, + "source_header": "= rfl\n\n/-- The actual interval persistence functor; no maps are assumed. -/\ndef elderInterval (m d : ℝ) : ℝ ⥤ ModuleCat k where" + }, + { + "kind": "def", + "unqualified_name": "elderFiberLift", + "line": 79, + "source_header": "mp [ht]\n\n/-- A canonical lift of a coefficient to any active interval fiber. -/\ndef elderFiberLift {m d t : ℝ} (ht : elderActive m d t) :\n k →ₗ[k] elderFiber k m d t where" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_birth", + "line": 89, + "source_header": "a := rfl\n\n/-- Endpoint control: birth is included. -/\ntheorem elder_control_birth {m d : ℝ} (hdm : d < m) : elderActi" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_death", + "line": 93, + "source_header": ";> linarith\n\n/-- Endpoint control: death is excluded, despite closed superlevels. -/\ntheorem elder_control_death (m d : ℝ) : ¬ elderAc" + }, + { + "kind": "structure", + "unqualified_name": "ElderTrap", + "line": 100, + "source_header": "X) (m d : ℝ)\n\n/-- The topological consequences of the asymmetric ridge trap. No H0 maps or\nsplitting conclusions occur among the premises. The path at d is actual closed\nsuperlevel connectivity, while active cuts are clopen. -/\nstructure ElderTrap (D : Set X) : Prop where\n death_lt_birth : d < m\n maximum_height : g M = m\n older_height : m < g P\n maximum_inside : M ∈ D\n older_outside : P ∉ D\n height_ceiling : ∀ x ∈ D, g x ≤ m\n active_clopen : ∀ t, elderActive m d t →\n IsClopen {x : superlevel_set g t | x.val ∈ D}\n closed_path : JoinedIn (superlevel" + }, + { + "kind": "theorem", + "unqualified_name": "ElderTrap.maximum_mem", + "line": 116, + "source_header": "d} {D : Set X}\n\ntheorem ElderTrap.maximum_mem (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : M ∈ sup" + }, + { + "kind": "theorem", + "unqualified_name": "ElderTrap.older_mem", + "line": 122, + "source_header": "linarith [ht.1]\n\ntheorem ElderTrap.older_mem (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : P ∈ sup" + }, + { + "kind": "theorem", + "unqualified_name": "elder_clopen_path_iff", + "line": 127, + "source_header": "T.older_height]\n\n/-- Clopen cuts are constant on actual path components, with no local path\nconnectivity assumption on the ambient space. -/\ntheorem elder_clopen_path_iff {Y : Type u} [TopologicalSpace Y] {U : Set Y}\n (hU : IsClopen U) {x y : Y} (p : Path x y" + }, + { + "kind": "def", + "unqualified_name": "ElderTrap.componentInside", + "line": 138, + "source_header": "nt_subset hy hyx⟩\n\n/-- The D indicator is genuinely descended to the path-component quotient. -/\ndef ElderTrap.componentInside (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : ZerothHomotopy (superle" + }, + { + "kind": "def", + "unqualified_name": "elderDifference", + "line": 150, + "source_header": "f.rfl\n\nvariable {k}\n\n/-- The actual singular-H0 point-class difference on an active level. -/\ndef elderDifference (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :\n ModuleCat.of k k ⟶ (superlevel_h0Filtration g (Mod" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_map", + "line": 159, + "source_header": "⟨P, T.older_mem ht⟩\n\ntheorem elderDifference_map (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_map_dead", + "line": 168, + "source_header": "⟩ ⟨P, T.older_mem hs⟩\n\ntheorem elderDifference_map_dead (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : -d ≤ t) (hst : s ≤ t) :" + }, + { + "kind": "def", + "unqualified_name": "elderProjection", + "line": 178, + "source_header": "superlevel_mono g ht)\n\n/-- The component indicator transported by the existing actual H0 comparison. -/\ndef elderProjection (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).o" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_point", + "line": 186, + "source_header": "e ht q then 𝟙 _ else 0)\n\ntheorem elderProjection_point (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) (x : superlevel_set g t) :\n ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k) x ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_projection", + "line": 198, + "source_header": "igma.ι_comp_desc]\n rfl\n\ntheorem elderDifference_projection (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :" + }, + { + "kind": "def", + "unqualified_name": "elderSectionApp", + "line": 207, + "source_header": "nside, T.older_outside]\n\ndef elderSectionApp (T : ElderTrap g M P m d D) (t : ℝ) :\n (elderInterval k m d).obj t ⟶\n (superlevel_h0Filtration g (M" + }, + { + "kind": "def", + "unqualified_name": "elderRetractionApp", + "line": 214, + "source_header": "rDifference T ht else 0\n\ndef elderRetractionApp (T : ElderTrap g M P m d D) (t : ℝ) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).obj t ⟶\n (eld" + }, + { + "kind": "theorem", + "unqualified_name": "elderSectionApp_naturality", + "line": 221, + "source_header": "rFiberLift k ht) else 0\n\ntheorem elderSectionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}\n (hst : s ≤ t) :\n (elderInterval k m d).map (homOfLE hst) ≫ elderSectionApp T t =\n elderSectionApp T s ≫\n (superlevel_h0Filtration g (ModuleCat.of" + }, + { + "kind": "def", + "unqualified_name": "elderSection", + "line": 246, + "source_header": "ro k hs x\n simp [hx]\n\n/-- Section from the interval to actual singular H0. -/\ndef elderSection (T : ElderTrap g M P m d D) :\n elderInterval k m d ⟶ superlevel_h0Filtration g (Modu" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_naturality_active", + "line": 254, + "source_header": "_naturality T (leOfHom f)\n\ntheorem elderProjection_naturality_active (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_prebirth", + "line": 266, + "source_header": "erProjection_point]\n rfl\n\n/-- The birth-crossing square follows from the geometric height ceiling:\nthere is no source point in D above m. It is not an assumed naturality field. -/\ntheorem elderProjection_prebirth (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : s < -m) (ht : elderActive m d t) (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderRetractionApp_naturality", + "line": 287, + "source_header": "right hx]\n erw [comp_zero]\n\ntheorem elderRetractionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}\n (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫\n elderRetractionApp T t =\n elderRetractionApp T s ≫ (elderInterv" + }, + { + "kind": "def", + "unqualified_name": "elderRetraction", + "line": 328, + "source_header": "simp [htd]\n · simp [hs]\n\n/-- Retraction from actual singular H0 to the interval, using component descent. -/\ndef elderRetraction (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k k) ⟶ el" + }, + { + "kind": "theorem", + "unqualified_name": "elderSection_retraction", + "line": 339, + "source_header": "r. -/\n@[reassoc (attr := simp)]\ntheorem elderSection_retraction (T : ElderTrap g M" + }, + { + "kind": "def", + "unqualified_name": "elderKernelProjection", + "line": 354, + "source_header": "er_eq_zero k ht x\n simp [hx]\n\ndef elderKernelProjection (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k" + }, + { + "kind": "def", + "unqualified_name": "elderDirectSummand", + "line": 361, + "source_header": "n, Category.comp_id, sub_self])\n\n/-- An actual natural direct-sum isomorphism, not a postulated decomposition.\nIts maps are v ↦ (qv,v-jqv) and (c,w) ↦ jc+w. -/\ndef elderDirectSummand (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k k) ≅\n elderInterval k" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_ordinary_point_survives", + "line": 381, + "source_header": "gory.assoc, Preadditive.comp_sub]\n\n/-- Ordinary individual point classes remain nonzero; the dying section uses\ntheir difference. This is valid independently of characteristic. -/\ntheorem elder_control_ordinary_point_survives (t : ℝ) (x : superlevel_set g t) :\n ordinaryH0_pointClass (TopCat.of (superlevel" + } + ] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderClearanceControls.lean", + "sha256": "f048de3c19859b96af44b4637c875eed57443d33767b57631f9ad0548a7ee7ca", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "elder_control_below", + "line": 15, + "source_header": "/-- A strict subthreshold is genuinely attained as strict clearance. -/\ntheorem elder_control_below : d - 1 ∈ superlevelBar_clearanceSet g" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_death_excluded", + "line": 21, + "source_header": "h\n\n/-- The attained closed death is excluded from the strict clearance set. -/\ntheorem elder_control_death_excluded : d ∉ superlevelBar_clearanceSet" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_positive_lifetime", + "line": 26, + "source_header": "l d\n\n/-- A strict geometric height gap gives positive lifetime in the literal data. -/\ntheorem elder_control_positive_lifetime (hg : Continuous g) (hdm : d < g M) :\n 0 < g M - superlevelBar_deathHeigh" + } + ] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderIntervalControls.lean", + "sha256": "b515d40bc0f58a71c3afa80e3ae7fae53725f3d713c2df2df110ba2814a4ece3", + "declarations_lexical": [] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderBridgeAudit.lean", + "sha256": "b3b4151188b4d790d280968c1fbe65b9c3458888a37b380349f3707302113e4c", + "declarations_lexical": [] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderIntervalAxiomAudit.lean", + "sha256": "4916c4446872057a0ebcbe07226fd8c4245ff450ddd2d430be81ab97ec5c6dc3", + "declarations_lexical": [] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderClearanceAudit.lean", + "sha256": "8ddaab57d2651a7375a509a90f274381bf15f6dcf5707460614a81075aa9e52b", + "declarations_lexical": [] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean", + "sha256": "6b0be1116f6b357b0ffbda202c572c27c2788b98bee639e228375a5ebeea1fa9", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "elderTrap_closedTrace_isClopen", + "line": 15, + "source_header": "u\n\n/-- Every active closed level includes continuously into the strict level\nabove d. Pulling back the proved strict separation gives closed-level separation. -/\ntheorem elderTrap_closedTrace_isClopen {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d t : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d)) (ht : t < -d) :\n IsClopen {x : superlevel_set g t | x.val ∈" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_of_boundary", + "line": 27, + "source_header": "hi\n\n/-- Actual geometric boundary, ceiling and closed path data inhabit the interval\ntrap. There is no H0 equation, interval split, clearance or death among inputs. -/\ntheorem elderTrap_of_boundary {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n ElderTrap g M P m d D where\n death_lt_" + }, + { + "kind": "def", + "unqualified_name": "elderBoundaryDirectSummand", + "line": 52, + "source_header": "hγ t\n\n/-- The constructed singular-H0 direct summand, instantiated from geometric\ninputs, rather than a premise asserting that a persistence summand exists. -/\ndef elderBoundaryDirectSummand (k : Type u) [Field k]\n {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevel_h0Filtration g (ModuleCat.of k k) ≅\n elderInterval k m d ⊞ kernel (elderRetrac" + }, + { + "kind": "theorem", + "unqualified_name": "elderBoundary_death_eq", + "line": 67, + "source_header": "P γ hγ)\n\n/-- On Euclidean heights the same geometric inputs also give the literal C263\ndeath. This is a proved join, not identification of an abstract death field. -/\ntheorem elderBoundary_death_eq {n : ℕ}\n (g : superlevelBar_E n → ℝ) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (m d : ℝ) (M P : superlevelBar_E n)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_deathHeigh" + } + ] + }, + { + "path": "frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean", + "sha256": "d3d78472881059546402218cc77792eeef00755c222bb02499d69abd3b5cd57e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "elderTrap_strictTrace", + "line": 19, + "source_header": "n\n\n/-- The trace of a geometric domain in the strict superlevel above d. -/\ndef elderTrap_strictTrace {X : Type*} (g : X → ℝ) (D : Set X) (d : ℝ) :\n Set {x : X // d < g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_strictTrace_isClopen", + "line": 23, + "source_header": "D}\n\n/-- A boundary height bound makes the trace clopen in the strict superlevel.\nThis derives separation from a geometric domain; it does not assume a path cut. -/\ntheorem elderTrap_strictTrace_isClopen {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ) (hD : IsClosed D)\n (hboundary : ∀ x ∈ frontier D, g x ≤ d) :\n IsClopen (elderTrap_strictTrace g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_path_stays", + "line": 47, + "source_header": "e_val\n\n/-- A path strictly above the exit threshold cannot leave the geometric trap. -/\ntheorem elderTrap_path_stays {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n {M y : X} (hM : M ∈ D) (γ : Path M y)\n (hγ : ∀ t : unitInterval, d < g (γ t))" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_higher_path_meets_threshold", + "line": 66, + "source_header": "ng hone\n\n/-- Every higher-endpoint path must meet or fall below the exit threshold.\nThe conclusion quantifies over all ambient paths, including remote detours. -/\ntheorem elderTrap_higher_path_meets_threshold {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)\n {y : X} (hy : g M < g y) (γ : Path M y) :\n ∃ t : unitInterval, g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_clearance_eq_Iio", + "line": 79, + "source_header": "hyD)) hy\n\n/-- The literal C263 clearance is exactly the strict interval below d.\nThe closed path is supplied by the geometric construction, rather than inferred\nfrom a supremum over paths or from a compactness assertion about path space. -/\ntheorem elderTrap_clearance_eq_Iio {n : ℕ}\n (g : superlevelBar_E n → ℝ) (D : Set (superlevelBar_E n)) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ g M)\n (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_clearanceSet g M" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_death_eq", + "line": 98, + "source_header": "hh (hγ t)⟩\n\n/-- With continuity, the new geometric cut identifies the existing C263 death.\nNonessentiality is derived from the actual higher point P. -/\ntheorem elderTrap_death_eq {n : ℕ}\n (g : superlevelBar_E n → ℝ) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ g M)\n (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_deathH" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_closed_path_attains", + "line": 116, + "source_header": "P γ hγ]\n rfl\n\n/-- The displayed closed path actually attains d. This does not replace strict\nclearance by a closed inequality or infer an optimal path from a supremum. -/\ntheorem elderTrap_closed_path_attains {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)\n {P : X} (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n ∃ t : unitInterv" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:frontiers/cap_first_exit_lean_20261002", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean", + "sha256": "040aa91fcbdf25ccdaced1c828dd779318217a7c41ac928f87e8d17a8d3c3ef0" + } + ], + "source_record_sha256": "3fa732dc44ae0c25350dadb1023cf30c7fb7c49abe0ed7be7294831a7d729ed7", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "frontiers/cap_first_exit_lean_20261002", + "source_files": [ + { + "path": "frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean", + "sha256": "040aa91fcbdf25ccdaced1c828dd779318217a7c41ac928f87e8d17a8d3c3ef0", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "path_meets_frontier", + "line": 55, + "source_header": "]\n\n/-! ### First exit -/\n\n/-- First exit along a path. A path from a point of `C` to a point outside `C` meets the frontier\nof `C`. -/\ntheorem path_meets_frontier {C : Set X} {x y : X} (γ : Path x y) (hx : x ∈ C) (hy : y ∉ C) :\n ∃ t : I, γ t ∈ front" + }, + { + "kind": "theorem", + "unqualified_name": "preconnected_subset_of_frontier_disjoint", + "line": 69, + "source_header": "C ht⟩\n\n/-- First exit for connected sets. A preconnected set that contains a point of `C` and does not\nmeet the frontier of `C` lies inside `C`. No path-connectedness is needed. -/\ntheorem preconnected_subset_of_frontier_disjoint {C K : Set X} (hK : IsPreconnected K) {M : X}\n (hMK : M ∈ K) (hMC : M ∈ C) (hfr : ∀ x ∈ K, x ∉ frontier C)" + }, + { + "kind": "structure", + "unqualified_name": "CapHyp", + "line": 84, + "source_header": "t C hx)\n\n/-! ### The cap hypotheses -/\n\n/-- The cap hypotheses (C1)–(C3) for a local maximum `M` of height `b`, a separating level `s`,\nand an older point `z`. -/\nstructure CapHyp (f : X → ℝ) (C : Set X) (M z : X) (b s : ℝ) : Prop where\n /-- (C1) `M` lies in the cap. -/\n mem : M ∈ C\n /-- (C1) The ceiling: `f ≤ b` on the cap (L16). -/\n ceiling : ∀ x ∈ C, f x ≤ b\n /-- (C2) The frontier bound: `f ≤ s` on the frontier of the cap (L17–L19). -/\n frontier_le : ∀ x ∈ frontier C, f x ≤ s\n /-- (C3) The older endpoint: `f z > b` (L17). -/\n older : b < f z\n /-- (C3) The ridge: a path from `M` to `z` along which `f ≥ s` (L20). -/\n ridge : ∃ γ : Path" + }, + { + "kind": "theorem", + "unqualified_name": "s_le_f_M", + "line": 104, + "source_header": "} {M z : X} {b s : ℝ}\n\n/-- `M` itself is at height at least `s` (the ridge starts at `M`). -/\ntheorem s_le_f_M (H : CapHyp" + }, + { + "kind": "theorem", + "unqualified_name": "barrier", + "line": 109, + "source_header": "idge\n simpa using hγ 0\n\n/-! ### The maximin level `d_f(M)` (L21) -/\n\n/-- The upper barrier. Every path from `M` to a point strictly above `b` passes through a point\nof height at most `s`, whatever the path does outside `C`. -/\ntheorem barrier (H : CapHyp f C M z b s) {w : X} (hw : b < f w) (γ : Path M w)" + }, + { + "kind": "def", + "unqualified_name": "connectionLevels", + "line": 121, + "source_header": "ontier_le _ ht⟩\n\nend CapHyp\n\n/-- The connection levels of `M`: heights `m` such that some path from `M` to a point strictly\nabove `b` stays at height at least `m`. Its supremum is the maximin level `d_f(M)` of L21. -/\ndef connectionLevels (f : X" + }, + { + "kind": "theorem", + "unqualified_name": "maximin_isGreatest", + "line": 130, + "source_header": ": Set X} {M z : X} {b s : ℝ}\n\n/-- The maximin level is attained and equals `s` (L21). -/\ntheorem maximin_isGreatest (H : CapHyp f C M z b s) :\n IsGrea" + }, + { + "kind": "theorem", + "unqualified_name": "maximin_eq", + "line": 139, + "source_header": "er hw γ\n exact (hγ t).trans ht\n\n/-- `d_f(M) = s`, as a supremum (L21). -/\ntheorem maximin_eq (H : CapHyp f C M z b s) :" + }, + { + "kind": "theorem", + "unqualified_name": "component_separated", + "line": 143, + "source_header": "=\n H.maximin_isGreatest.csSup_eq\n\n/-! ### Superlevel components: the persistence filtration (L22) -/\n\n/-- Component separation. If `U` avoids the frontier of `C`, the connected component of `M` in\n`U` lies in `C`, so it contains no point strictly above `b`. -/\ntheorem component_separated (H : CapHyp f C M z b s) {U : Set X}\n (hU : ∀ x ∈ frontier C, x ∉ U) {w : X} (hw : w" + }, + { + "kind": "theorem", + "unqualified_name": "component_joined", + "line": 159, + "source_header": "entIn_subset U M hx)) hw)\n\nend CapHyp\n\n/-- Component joining. If a path from `M` to `z` stays in `U`, then `z` lies in the connected\ncomponent of `M` in `U`. -/\ntheorem component_joined {U : Set X} {M z : X} (γ : Path M z) (hγ : ∀ t, γ t" + }, + { + "kind": "theorem", + "unqualified_name": "elder_merge_iff_closed", + "line": 173, + "source_header": "X → ℝ} {C : Set X} {M z : X} {b s : ℝ}\n\n/-- **Elder merge, closed superlevel filtration `{f ≥ h}`** (the filtration of L22). The connected\ncomponent of `M` in `{f ≥ h}` contains a point strictly above `b` if and only if `h ≤ s`. -/\ntheorem elder_merge_iff_closed (H : CapHyp f C M z b s) (h : ℝ) :\n (∃ w ∈ connectedComp" + }, + { + "kind": "theorem", + "unqualified_name": "elder_merge_iff_open", + "line": 191, + "source_header": "(fun t => le_trans hhs (hγ₀ t)), H.older⟩\n\n/-- **Elder merge, open superlevel filtration `{f > h}`.** The connected component of `M` in\n`{f > h}` contains a point strictly above `b` if and only if `h < s`. -/\ntheorem elder_merge_iff_open (H : CapHyp f C M z b s) (h : ℝ) :\n (∃ w ∈ connectedCo" + }, + { + "kind": "def", + "unqualified_name": "joinedLevels", + "line": 209, + "source_header": "t => lt_of_lt_of_le hhs (hγ₀ t)), H.older⟩\n\n/-- The set of levels at which the class born at `M` is joined to an older point. -/\ndef joi" + }, + { + "kind": "theorem", + "unqualified_name": "elder_death_level", + "line": 213, + "source_header": "onnectedComponentIn {x | h ≤ f x} M, b < f w}\n\n/-- **Elder death level.** In the closed superlevel filtration, the largest level at which the\ncomponent of `M` contains an older point exists and equals `s`, whatever `f` does outside the cap.\nThis is the death level of the class born at `M` in L22. -/\ntheorem elder_death_level (H : CapHyp f" + }, + { + "kind": "theorem", + "unqualified_name": "path_through_saddle", + "line": 219, + "source_header": "fun _ hh => (H.elder_merge_iff_closed _).mp hh⟩\n\n/-! ### The merging saddle -/\n\n/-- Every path from `M` to a point strictly above `b` that stays in `{f ≥ s}` passes through `S`,\nwhen `S` is the only frontier point at height `s` (C2⁺, L19). The statement says something only when\n`M ≠ S`, as in the source, where the pins are distinct. -/\ntheorem path_through_saddle (H : CapHyp f C M z b s) {S : X}\n (hS : ∀ x ∈ frontier C, x ≠ S → f x < s) {w : X} (hw : b < f w) (γ : P" + }, + { + "kind": "theorem", + "unqualified_name": "saddle_cut", + "line": 235, + "source_header": "have h1 := hS _ ht hne\n have h2 := hγ t\n linarith\n\n/-- **`S` is a cut point at the death level.** Assume (C2⁺) and `M ≠ S`. Then `M` lies in its own\ncomponent of `{f ≥ s} \\ {S}`, so the statement is not vacuous, and that component contains no\npoint strictly above `b`. By contrast, `{f ≥ s}` itself joins `M` to an older point\n(`elder_merge_iff_closed` at `h = s`). Removing `S` therefore disconnects `M` from every older\npoint at the death level. -/\ntheorem saddle_cut (H : CapHyp f C M z b s) {S : X}\n (hS : ∀ x ∈ frontier C, x ≠ S → f x < s) (hMS : M ≠ S) :\n M ∈ connectedComponentIn ({x | s ≤ f x} \\ {S}) M ∧\n ∀ w ∈" + }, + { + "kind": "theorem", + "unqualified_name": "congr", + "line": 251, + "source_header": "h3 := hS x hx h2\n have h4 : s ≤ f x := h1\n linarith\n\n/-! ### Exterior invariance -/\n\n/-- **Exterior invariance.** Any `g` that agrees with `f` on the closure of the cap and along one\nridge path satisfies the same cap hypotheses. Every conclusion above (maximin level, elder merge\nlevels, death level, saddle cut) therefore holds for `g` with the same `s`, however `g` behaves\nelsewhere: remote saddles, high corridors and re-entries change nothing. -/\ntheorem congr {g : X → ℝ} (H : CapHyp f C M z b s) (γ₀ : Path M z) (hγ₀ : ∀ t, s ≤ f (γ₀ t))\n (hgC : ∀ x ∈ closure C, g x = f x) (hgγ : ∀ t," + }, + { + "kind": "theorem", + "unqualified_name": "isClosed_connectedComponentIn", + "line": 272, + "source_header": "ridge := ⟨γ₀, fun t => (hgγ t).symm ▸ hγ₀ t⟩\n\nend CapHyp\n\n/-! ### The elder-rule interface on a compact, locally connected space\n\nThe elder rule pairs the class born at `M` with the level at which its superlevel component first\ncontains a strictly higher local maximum (an older class). On a compact, locally connected space\nwith continuous `f` (a closed manifold, in particular the torus), the following theorems identify\nthat level as `s`. -/\n\n/-- A connected component of a closed set is closed. -/\ntheorem isClosed_connectedComponentIn {F : Set X} (hF :" + }, + { + "kind": "theorem", + "unqualified_name": "older_peak", + "line": 294, + "source_header": "CapHyp\n\nvariable {f : X → ℝ} {C : Set X} {M z : X} {b s : ℝ}\n\n/-- **An older peak below the death level.** For every level `h ≤ s`, the component of `M` in\n`{f ≥ h}` contains a point `p` with `f p > b` that maximizes `f` over the component and is a local\nmaximum of `f` on `X`: the older class that absorbs the class born at `M`. -/\ntheorem older_peak [CompactSpace X] [LocallyConnectedSpace X] (H : CapHyp f C M z b s)\n (hf : Continuous f) {h : ℝ} (hh : h ≤ s) :\n ∃ p ∈ connectedComponentIn {x | h ≤ f x} M, b < f p ∧ IsLocalMax f" + }, + { + "kind": "theorem", + "unqualified_name": "elder_alive", + "line": 319, + "source_header": "em_connectedComponentIn hpU))\n (fun x hx => hmax x (hVK hx))\n\n/-- **No older point above the death level.** For every level `h > s`, `M` is a highest point of\nits component in `{f ≥ h}`, when `b = f M`: the class born at `M` is the elder of its component. -/\ntheorem elder_alive (H : CapHyp f C M z b s) (hMb : f M = b) {h : ℝ} (hh : s" + }, + { + "kind": "def", + "unqualified_name": "olderPeakLevels", + "line": 329, + "source_header": "rd ((H.elder_merge_iff_closed h).mp ⟨w, hw, hlt⟩) (not_le.mpr hh)\n\n/-- The levels at which the component of `M` in `{f ≥ h}` contains a strictly higher local" + }, + { + "kind": "theorem", + "unqualified_name": "elder_death_level_peak", + "line": 334, + "source_header": "∈ connectedComponentIn {x | h ≤ f x} M, f M < f p ∧ IsLocalMax f p}\n\n/-- **Elder death level, peak form.** On a compact, locally connected space with continuous `f`\nand `b = f M`, the largest level at which the component of `M` contains a strictly higher local\nmaximum exists and equals `s`. This is the death level of the elder rule. -/\ntheorem elder_death_level_peak [CompactSpace X] [LocallyConnectedSpace X]\n (H : CapHyp f C M z b s) (hf : C" + }, + { + "kind": "theorem", + "unqualified_name": "frontier_image_subset", + "line": 348, + "source_header": "exact (H.elder_merge_iff_closed h).mp ⟨p, hpK, hMb ▸ hMp⟩\n\nend CapHyp\n\n/-! ### Charts: the cap on the torus and its faces\n\nThe analysis of CAP §§2–5 runs in Euclidean coordinates on the periodic lift `f ∘ e` of a field\n`f` on the torus, where `e : ℝ^d → T^d` is the covering map. The two lemmas below transport the cap\nhypotheses to the torus and list the faces of the cylinder cap. The transport needs only that `e`\nis continuous and open, that the target is Hausdorff and that the cap is compact; injectivity is\nnot used. -/\n\n/-- Frontier of a compact image. If `e` is continuous and open, `X` is Hausdorff and `C` is\ncompact, every frontier point of `e '' C` is the image of a frontier point of `C`. -/\ntheorem frontier_image_subset {Y : Type*} [TopologicalSpace Y] [T2Space X] {e : Y → X}\n (hec : Continuous e) (heo : IsOpenMap e)" + }, + { + "kind": "theorem", + "unqualified_name": "map", + "line": 372, + "source_header": "interior_subset) (heo _ isOpen_interior) ⟨y, hyi, rfl⟩\n\nnamespace CapHyp\n\n/-- **Transport along a chart.** The cap hypotheses for the lift `f ∘ e` on a compact cap `C`\ngive the cap hypotheses for `f` on `e '' C`, with the same `b` and `s`. -/\ntheorem map {Y : Type*} [TopologicalSpace Y] [T2Space X] {e : Y → X} (hec : Continuous e)\n (heo : IsOpenMap e) {f : X → ℝ} {C : Set Y} (hC : IsCompact C) {M z : Y} {b s : ℝ}\n (H" + }, + { + "kind": "theorem", + "unqualified_name": "map_saddle", + "line": 390, + "source_header": "ge := by\n obtain ⟨γ, hγ⟩ := H.ridge\n exact ⟨γ.map hec, fun t => hγ t⟩\n\n/-- Transport of (C2⁺): if only `S` attains `s` on the frontier of `C` for the lift, only `e S`\nattains it on the frontier of `e '' C`. -/\ntheorem map_saddle {Y : Type*} [TopologicalSpace Y] [T2Space X] {e : Y → X} (hec : Continuous e)\n (heo : IsOpenMap e) {f : X → ℝ} {C : Set Y} (hC : IsCompact C) {S : Y} {s : ℝ}\n (hS : ∀ y ∈ fronti" + }, + { + "kind": "theorem", + "unqualified_name": "frontier_cylinder", + "line": 402, + "source_header": "age_subset hec heo hC hx\n exact hS y hy (fun h => hne (h ▸ rfl))\n\nend CapHyp\n\n/-- **The faces of the cylinder cap** `[a, c] × B̄(0, R)`: the two end faces `{a, c} × B̄(0, R)`\nand the curved side `[a, c] × S(0, R)`. These are the faces estimated in L17–L19. -/\ntheorem frontier_cylinder {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {a c R : ℝ}\n (hac : a ≤ c) (hR : R ≠ 0) :\n frontier (Icc a c ×ˢ Metric.closedBall (0 : E) R) =\n ({a," + }, + { + "kind": "theorem", + "unqualified_name": "isCompact_cylinder", + "line": 412, + "source_header": "tier_Icc hac,\n Metric.isClosed_closedBall.closure_eq]\n exact union_comm _ _\n\n/-- The cylinder cap is compact in finite dimension. -/\ntheorem isCompact_cylinder {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [Pr" + }, + { + "kind": "def", + "unqualified_name": "torusCover", + "line": 417, + "source_header": "ˢ Metric.closedBall (0 : E) R) :=\n isCompact_Icc.prod (isCompact_closedBall 0 R)\n\n/-- The covering map of the flat torus `(" + }, + { + "kind": "theorem", + "unqualified_name": "torusCover_continuous", + "line": 421, + "source_header": ": (Fin d → ℝ) → (Fin d → AddCircle L) :=\n Pi.map fun _ => ((↑) : ℝ → AddCir" + }, + { + "kind": "theorem", + "unqualified_name": "torusCover_isOpenMap", + "line": 424, + "source_header": "Continuous (torusCover L d) :=\n Continuous.piMap fun _ => continuous_quot" + }, + { + "kind": "theorem", + "unqualified_name": "CapHyp.toTorus", + "line": 428, + "source_header": "nMap_coe)\n (Filter.Eventually.of_forall fun _ => QuotientAddGroup.mk_surjective)\n\n/-- **The cap on the torus.** Let `φ` be any coordinate frame (a homeomorphism onto `ℝ^d`), and\nsuppose the periodic lift `f ∘ torusCover L d ∘ φ` satisfies the cap hypotheses on a compact cap\n`C`. Then `f` satisfies them on the image of `C` in the torus `(ℝ / Lℤ)^d`, with the same `b` and\n`s`. No embedding radius is used. -/\ntheorem CapHyp.toTorus {Y : Type*} [TopologicalSpace Y] {L : ℝ} {d : ℕ}\n (φ : Y ≃ₜ (Fin d → ℝ)) {f : (Fin d → AddCircle L) → ℝ} {C : Set Y} (hC : IsCompact C)\n {M z : Y} {b s : ℝ} (H : CapHyp (f ∘ (torusCover L d ∘ φ)) C M z b s) :\n C" + }, + { + "kind": "theorem", + "unqualified_name": "convex_zeros_between", + "line": 461, + "source_header": "x = x³/24 - r²x/32`;\n- L19: the face assembly;\n- L20: the ridge path. -/\n\nsection Ridge\n\n/-- A convex function that vanishes at `a ≤ c` is `≤ 0` between them. -/\ntheorem convex_zeros_between {φ : ℝ → ℝ} {D : Set ℝ} (hφ : ConvexOn ℝ D φ) {a c : ℝ}\n (haD : a ∈ D) (hcD : c" + }, + { + "kind": "theorem", + "unqualified_name": "convex_zeros_right", + "line": 468, + "source_header": "e_on_segment haD hcD (by rw [segment_eq_Icc hac]; exact hx)\n rwa [ha, hc, max_self] at h\n\n/-- A convex function that vanishes at `a < c` is `≥ 0` to the right of `c`. -/\ntheorem convex_zeros_right {φ : ℝ → ℝ} {D : Set ℝ} (hφ : ConvexOn ℝ D φ) {a c : ℝ}\n (haD : a ∈ D) (" + }, + { + "kind": "theorem", + "unqualified_name": "convex_zeros_left", + "line": 479, + "source_header": "zero_div, sub_zero] at h\n rw [le_div_iff₀ (sub_pos.mpr hlt), zero_mul] at h\n exact h\n\n/-- A convex function that vanishes at `a < c` is `≥ 0` to the left of `a`. -/\ntheorem convex_zeros_left {φ : ℝ → ℝ} {D : Set ℝ} (hφ : ConvexOn ℝ D φ) {a c : ℝ}\n (hcD : c ∈ D)" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_profile", + "line": 490, + "source_header": ", zero_div, zero_sub] at h\n rw [div_le_iff₀ (sub_pos.mpr hlt), zero_mul] at h\n linarith\n\n/-- **The ridge profile (L13, L16, L17, L20).** On `D = [-2r, 2r]`, let `g' = F`, with `F`\nvanishing at the pins `∓r/2` and `F - (x + r/2)(x - r/2)/8` convex. Then:\n- `g ≤ g(-r/2)` on `[-2r, r/2]`;\n- `g ≥ g(r/2)` on `[-r/2, 2r]`;\n- `g(-2r) ≤ g(-r/2) - 9r³/32`;\n- `g(2r) ≥ g(r/2) + 9r³/32`. -/\ntheorem ridge_profile {g F : ℝ → ℝ} {r : ℝ} (hr : 0 < r)\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt g (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8)) :\n (∀ x ∈ Icc (-2 * r) (r / 2), g x ≤ g (-r / 2)) ∧\n (∀ x ∈ Icc (-r / 2) (2 * r), g (r / 2) ≤" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp", + "line": 598, + "source_header": "y [hQdef] at h\n nlinarith [h]\n\nvariable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]\n\n/-- **The cap hypotheses from the ridge (L16, L17, L19, L20).** Under the analytic inputs listed\nabove, `f` satisfies (C1)–(C3) on `C = [-2r, r/2] × B̄(0, 2r)`, with `M = (-r/2, h(-r/2))`,\n`z = (2r, h(2r))`, `b = g(-r/2)` and `s = g(r/2)`. Every input is local: `g' = F` and the convexity\nhold on `[-2r, 2r]`, and `h` is continuous on `[-r/2, 2r]`. -/\ntheorem ridge_capHyp {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {r : ℝ} (hr : 0 < r)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hT : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), f p ≤ f (p.1, h p.1))\n (hside : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.sphere (0 : E) (2 * r),\n f p ≤ f (r / 2, h (r / 2)))\n (hM : ‖h (-r / 2)‖ ≤ 2 * r)\n (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) < 9 * r ^ 3 / 32) :\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 *" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_saddle_strict", + "line": 656, + "source_header": "exact h0\n · exact hside p hp\n · linarith\n · intro t\n exact hfloor (xt t) (hxmem t)\n\n/-- **(C2⁺) from the ridge.** If, in addition, `h x` is the unique transverse maximizer on the\ncap and the curved side is strictly below `g c` (L7, L18), then `S = (r/2, h(r/2))` is the only\nfrontier point at height `s`. -/\ntheorem ridge_saddle_strict {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {r : ℝ} (hr : 0 < r)\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hT : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), f p ≤ f (p.1, h p.1))\n (hTs : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), p.2 ≠ h p.1 →\n f p < f (p.1, h p.1))\n (hside : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.sphere (0 : E) (2 * r),\n f p < f (r / 2, h (r / 2)))\n (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) < 9 * r ^ 3 / 32) :\n ∀ x ∈ frontier (Icc (-2 * r) (r /" + }, + { + "kind": "theorem", + "unqualified_name": "strongConcave_le_of_hasFDerivAt", + "line": 709, + "source_header": "/\n\nsection Slice\n\nopen Filter Topology\n\nvariable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]\n\n/-- **Strong concavity about a point with a derivative (the engine of L7, L8, L18).** If `φ` is\n`δ`-strongly concave on `K`, `p ∈ K`, and `φ` has derivative `L` at `p`, then\n`φ y ≤ φ p + L (y - p) - (δ/2)‖y - p‖²` for every `y ∈ K`. `p` need not be interior: only the\nsegment from `p` to `y`, which lies in `K`, is used. -/\ntheorem strongConcave_le_of_hasFDerivAt {K : Set E} {φ : E → ℝ} {δ : ℝ} {p : E}\n {L : E →L[ℝ] ℝ} (hφ : StrongConcaveOn K δ φ) (hp :" + }, + { + "kind": "theorem", + "unqualified_name": "slice_le", + "line": 744, + "source_header": "have := le_of_tendsto_of_tendsto hlim hslope hbound\n simp only [sub_zero, one_mul] at this\n linarith\n\n/-- **L7 (the transverse maximum).** At a critical point `p` of a `δ`-strongly concave slice,\n`φ y ≤ φ p - (δ/2)‖y - p‖²` on `K`. With `δ > 0` the maximizer is unique. -/\ntheorem slice_le {K : Set E} {φ : E → ℝ} {δ : ℝ} {p : E}\n (hφ : StrongConcaveOn K δ φ) (hp :" + }, + { + "kind": "theorem", + "unqualified_name": "slice_ridge_bound", + "line": 751, + "source_header": "y ∈ K) : φ y ≤ φ p - δ / 2 * ‖y - p‖ ^ 2 := by\n simpa using strongConcave_le_of_hasFDerivAt hφ hp hd hy\n\n/-- **L8 (the ridge bound).** If `0, p ∈ K`, `p` is critical and `w` is the derivative at `0`,\nthen `δ ‖p‖ ≤ ‖w‖`, i.e. `‖h(x)‖ ≤ ‖w(x)‖/δ`. -/\ntheorem slice_ridge_bound {K : Set E} {φ : E → ℝ} {δ : ℝ} {p : E} {w : E →L[ℝ] ℝ}\n (hφ : StrongConcaveOn K δ φ) (h0 : (0" + }, + { + "kind": "theorem", + "unqualified_name": "slice_curved", + "line": 766, + "source_header": "eg p).eq_or_lt with h | h\n · rw [← h, mul_zero]; exact norm_nonneg w\n · exact le_of_mul_le_mul_right h4 h\n\n/-- **L18 (the curved side).** On the sphere of radius `R`, the slice is strictly below `s`\nonce `φ p ≤ b`, `‖w‖ ≤ ω ≤ Rδ` and `2δ(b - s) < (Rδ - ω)²`. -/\ntheorem slice_curved {φ : E → ℝ} {δ ω R b s : ℝ} {p : E} {w : E →L[ℝ] ℝ}\n (hφ : StrongConcaveOn (Metric.closedBall (0 : E) R) δ φ) (hδ : 0 < δ)\n (hp : p ∈ Metric.closedBall (0 : E) R) (hd : HasFDerivAt φ (0 : E →L[ℝ] ℝ) p)\n (hw : HasFDerivAt φ w 0) (hω : ‖w‖ ≤ ω) (hωR : ω ≤ R * δ) (hb : φ p" + }, + { + "kind": "theorem", + "unqualified_name": "slice_hasFDerivAt", + "line": 786, + "source_header": "‖ ^ 2) := by nlinarith\n have h6 : 2 * (b - s) < δ * ‖y - p‖ ^ 2 := lt_of_mul_lt_mul_left h5 hδ.le\n linarith\n\n/-- The derivative of a slice `y ↦ f (x, y)` is the joint derivative restricted to the\ntransverse directions. -/\ntheorem slice_hasFDerivAt {f : ℝ × E → ℝ} {x : ℝ} {y : E} {D : ℝ × E →L[ℝ] ℝ}\n (" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_hasDerivAt", + "line": 793, + "source_header": "(fun y' => f (x, y')) (D.comp (ContinuousLinearMap.inr ℝ ℝ E)) y :=\n hf.comp y (hasFDerivAt_prodMk_right x y)\n\n/-- **L11 (the ridge function's derivative).** If `f` has joint derivative `D` at `(x, h x)`,\n`h` has derivative `h'` at `x`, and the transverse part of `D` vanishes (the ridge equation\n`∂_y f = 0`), then `g = f (·, h ·)` has derivative `F x = D (1, 0) = ∂_x f (x, h x)`: the\n`∂_y f · h'` term drops out. -/\ntheorem ridge_hasDerivAt {f : ℝ × E → ℝ} {h : ℝ → E} {x : ℝ} {D : ℝ × E →L[ℝ] ℝ} {h' : E}\n (hf : HasFDerivAt f D (x, h x)) (hh : HasDerivAt" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_of_slices", + "line": 812, + "source_header": "_ = D (1, 0) + D (0, h') := map_add _ _ _\n _ = D (1, 0) := by rw [h0, add_zero]\n rw [← hD]\n exact hc\n\n/-- **(C1)–(C3) and (C2⁺) from the slices.** `ridge_capHyp` and `ridge_saddle_strict` with\n`hT`, `hTs`, `hside` and `hM` derived (L7, L8, L18) from L4 (`hconc`), the critical points\n`h x ∈ B̄(0, 2r)` (`hball`, `hcrit`; L7's existence part), L5 (`hw`, `hω`) and the curvature\ncondition `2δ(b - s) < (2rδ - ω)²`, which SP's constants satisfy (`sp_curved_side_constants`). -/\ntheorem ridge_capHyp_of_slices {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {w : ℝ → E →L[ℝ] ℝ}\n {r δ ω : ℝ} (hr : 0 < r) (hδ : 0 < δ)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hconc : ∀ x ∈ Icc (-2 * r) (r / 2),\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))\n (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))\n (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))\n (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hω : ∀ x ∈ Icc (-2 * r) (r / 2), ‖w x‖ ≤ ω) (hωr : ω ≤ 2 * r * δ)\n (hcurv : 2 * δ * (f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2))) < (2 * r * δ - ω) ^ 2)\n (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) < 9 * r ^ 3 / 32) :\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))\n (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) ∧\n ∀ x ∈ frontier (Icc" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_inputs_of_joint", + "line": 861, + "source_header": "hFc hconv hT (fun p hp => (hside p hp).le) hM hgap,\n ridge_saddle_strict hr hg hFa hFc hconv hT hTs hside hgap⟩\n\n/-- **The joint form (L7, L11).** From a joint derivative `D x` of `f` along the ridge, a\ndifferentiable `h` and the ridge equation `(D x) ∘ inr = 0`, the inputs `hh`, `hg` (with\n`F x = D x (1, 0)`) and `hcrit` of `ridge_capHyp_of_slices` follow. -/\ntheorem ridge_inputs_of_joint {f : ℝ × E → ℝ} {h h' : ℝ → E} {D : ℝ → ℝ × E →L[ℝ] ℝ} {r : ℝ}\n (hr : 0 < r) (hD : ∀ x ∈ Icc (-2 * r) (2 * r), HasFDerivAt f (D x) (x, h x))\n (hh' : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt h (h' x) x)\n (hridge : ∀ x ∈ Icc (-2 * r) (2 * r), (D x).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0) :\n ContinuousOn h (Icc (-r / 2) (2 * r)) ∧\n (∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x =>" + }, + { + "kind": "theorem", + "unqualified_name": "sp_curved_side_constants", + "line": 877, + "source_header": ": x ∈ Icc (-2 * r) (2 * r) := ⟨hx.1, by linarith [hx.2]⟩\n simpa [hridge x hx'] using slice_hasFDerivAt (hD x hx')\n\n/-- **SP's constants satisfy the curvature condition (L4, L5, L18).** With `m ≥ 2`,\n`δ > r m (8m - 5)` (L4, `k = 8m - 5`), `0 ≤ ω ≤ 2 m r²` (L5) and SP's gap `b - s = r³/6`:\n`ω ≤ 2rδ` and `2δ · r³/6 < (2rδ - ω)²`. -/\ntheorem sp_curved_side_constants {r m δ ω : ℝ} (hr : 0 < r) (hm : 2 ≤ m)\n (hδ : r * m *" + }, + { + "kind": "theorem", + "unqualified_name": "convexOn_add_node", + "line": 895, + "source_header": "_left₀ hpos (by have hδ0 : 0 < δ := by linarith\n positivity) two_ne_zero\n nlinarith [hsq]\n\n/-- Adding the affine function `(m/2)((t - a)(t - c) - t²)` preserves convexity. -/\ntheorem convexOn_add_node {u : ℝ → ℝ} {D : Set ℝ} {a c m : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "two_node_bound", + "line": 911, + "source_header": "/ 2 * x ^ 2) + q * (u y + m / 2 * y ^ 2)) := by\n have hq' : q = 1 - p := by linarith\n subst hq'\n ring\n linarith\n\n/-- **L5 (two-node interpolation), scalar form.** If `u + (m/2) t²` is convex and `u - (m/2) t²` is\nconcave on `D` (the weak form of `|u''| ≤ m`) and `u` vanishes at `a < c` in `D`, then\n`|u x| ≤ (m/2) |(x - a)(x - c)|` for every `x ∈ D`, inside or outside `[a, c]`. -/\ntheorem two_node_bound {u : ℝ → ℝ} {D : Set ℝ} {a c m : ℝ}\n (hcv : ConvexOn ℝ D (fun t => u t + m / 2 * t ^ 2))\n (hcc : ConcaveOn ℝ D (fun t => u t - m / 2 * t ^ 2))\n (haD : a ∈" + }, + { + "kind": "theorem", + "unqualified_name": "slice_gradient_bound", + "line": 945, + "source_header": "= mul_nonpos_of_nonneg_of_nonpos (by linarith) (by linarith)\n rw [abs_of_nonpos hP, abs_le]\n constructor <;> linarith\n\n/-- **L5 (the transverse gradient at `y = 0`).** If the slice derivatives `w t` at `y = 0` vanish at\nthe pins `a < c` and, for every direction `v`, `t ↦ w t v` has second derivative bounded by\n`m ‖v‖` in the weak form below, then `‖w x‖ ≤ (m/2) |(x - a)(x - c)|` on `D`. -/\ntheorem slice_gradient_bound {w : ℝ → E →L[ℝ] ℝ} {D : Set ℝ} {a c m : ℝ} (hm : 0 ≤ m)\n (hcv : ∀ v : E, ConvexOn ℝ D (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))\n (hcc : ∀ v : E, ConcaveOn ℝ D (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))\n (haD : a" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_sp", + "line": 960, + "source_header": "eal.norm_eq_abs]\n calc |w x v| ≤ m * ‖v‖ / 2 * |(x - a) * (x - c)| := h\n _ = m / 2 * |(x - a) * (x - c)| * ‖v‖ := by ring\n\n/-- **The cap from SP's normalized hypotheses (L2, L4, L5, L7, L11, L12).** With `m ≥ 2` (L2),\nslices `δ`-strongly concave for some `δ > r m (8m - 5)` (L4), slice derivatives at `y = 0` with\nsecond `x`-derivative bounded by `m` in the weak form (L5), critical points `h x` with\n`h(∓r/2) = 0` (L7) and the gap `b - s ≤ r³/6`, the conclusions of `ridge_capHyp_of_slices` hold.\n`hω`, `hωr` and `hcurv` are derived: `‖w‖ ≤ 2 m r²` (`slice_gradient_bound`) and\n`sp_curved_side_constants`. -/\ntheorem ridge_capHyp_sp {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {w : ℝ → E →L[ℝ] ℝ}\n {r m δ : ℝ} (hr : 0 < r) (hm : 2 ≤ m) (hδ : r * m * (8 * m - 5) < δ)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hconc : ∀ x ∈ Icc (-2 * r) (r / 2),\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))\n (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))\n (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))\n (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)\n (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))\n (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) ≤ r ^ 3 / 6) :\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))\n (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) ∧\n ∀ x ∈ fr" + }, + { + "kind": "theorem", + "unqualified_name": "hermite_gap_le", + "line": 1015, + "source_header": "_ < _ := hcurv\n · have : r ^ 3 / 6 < 9 * r ^ 3 / 32 := by\n have : 0 < r ^ 3 := by positivity\n linarith\n linarith\n\n/-- **L1 (the Hermite identity, as a bound).** If `g' = G` on `[a, c]`, `G` vanishes at both ends\n(the pins are critical) and `|G''| ≤ m` in the weak form, then `g(a) - g(c) ≤ m (c - a)³/12`.\nSP's identity `g(c) - g(a) = -(1/2)∫ φ g'''` with `∫ φ = (c - a)³/6` gives the same bound; here it\ncomes from `two_node_bound` and monotonicity of `g + (m/2)Φ`, `Φ' = (t - a)(c - t)`. -/\ntheorem hermite_gap_le {g G : ℝ → ℝ} {a c m : ℝ} (hac : a < c)\n (hg : ∀ x ∈ Icc a c, HasDerivAt g (G x) x)\n (hcv : ConvexOn ℝ (Icc a c) (fun t => G t + m / 2 * t ^ 2))\n (hcc :" + }, + { + "kind": "theorem", + "unqualified_name": "hermite_m_ge_two", + "line": 1057, + "source_header": "= 0 := by ring\n have e1 : m / 2 * ((c - a) * (c - a) ^ 2 / 2 - (c - a) ^ 3 / 3) = m * (c - a) ^ 3 / 12 := by\n ring\n linarith\n\n/-- **L2 (`m ≥ 2`).** Under SP's normalization `g(-r/2) - g(r/2) = r³/6` on the pin interval, the\nweak bound `|g'''| ≤ m` forces `m ≥ 2`. -/\ntheorem hermite_m_ge_two {g G : ℝ → ℝ} {r m : ℝ} (hr : 0 < r)\n (hg : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt g (G x) x)\n (hcv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G t + m / 2 * t ^ 2))\n (hcc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_normalized", + "line": 1071, + "source_header": "cv hcc hGa hGc\n have hcr : r / 2 - -r / 2 = r := by ring\n rw [hgap, hcr] at h\n have hr3 : 0 < r ^ 3 := by positivity\n nlinarith\n\n/-- **The cap from SP's normalization (L1, L2 and the rest of `ridge_capHyp_sp`).** As\n`ridge_capHyp_sp`, with `m ≥ 2` derived instead of assumed: `g0 = f(·, 0)` has derivative `G0`\nvanishing at the pins with `|G0''| ≤ m` (weak form), and the gap is exactly `r³/6`. -/\ntheorem ridge_capHyp_normalized {f : ℝ × E → ℝ} {h : ℝ → E} {F G0 : ℝ → ℝ}\n {w : ℝ → E →L[ℝ] ℝ} {r m δ : ℝ} (hr : 0 < r)\n (hg0 : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt (fun x => f (x, 0)) (G0 x) x)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t - m / 2 * t ^ 2))\n (hG0a : G0 (-r / 2) = 0) (hG0c : G0 (r / 2) = 0)\n (hδ : r * m * (8 * m - 5) < δ)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hconc : ∀ x ∈ Icc (-2 * r) (r / 2),\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))\n (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))\n (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))\n (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)\n (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) = r ^ 3 / 6) :\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))\n (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) ∧\n ∀" + }, + { + "kind": "theorem", + "unqualified_name": "strongConcaveOn_of_hessian", + "line": 1103, + "source_header": "impa [hha, hhc] using hnorm)\n exact ridge_capHyp_sp hr hm hδ hh hg hFa hFc hconv hconc hball hcrit hha hhc hw hwcv hwcc\n hnorm.le\n\n/-- **Second-order condition for strong concavity.** If `φ` has derivative `Dφ` and `Dφ` has\nderivative `H` at every point of the convex set `K`, and `H y v v ≤ -δ ‖v‖²` there, then `φ` is\n`δ`-strongly concave on `K`. Along each segment, `φ(x + t v) + (δ/2)‖v‖² t²` has a nonpositive\nsecond derivative, so it is concave on `[0, 1]`. -/\ntheorem strongConcaveOn_of_hessian {K : Set E} {φ : E → ℝ} {Dφ : E → E →L[ℝ] ℝ}\n {H : E → E →L[ℝ] E →L[ℝ] ℝ} {δ : ℝ} (hK : Convex ℝ K)\n (hD : ∀ y ∈ K, HasFD" + }, + { + "kind": "theorem", + "unqualified_name": "transverse_hessian_le", + "line": 1158, + "source_header": "el\n rw [hxv] at key\n show a * φ x + b * φ y + a * b * (δ / 2 * ‖v‖ ^ 2) ≤ φ (x + b • v)\n rw [hab'] at key ⊢\n linear_combination key\n\n/-- **L3–L4 (the transverse Hessian bound).** If the transverse Hessian `H` satisfies\n`H(M) ≤ -λ` (SP's `λ = λ_min(-D_y² f(M))`) and its increments from `M = (-r/2, 0)` are bounded by\n`m (|Δx| + ‖Δy‖)` (L3, with `m` bounding the third-derivative blocks), then `H(p) ≤ -(λ - 5rm)`\non the cap. The increment is at most `3r/2 + 2r ≤ 5r` there; SP bounds it on all of `D` by\n`9r/2 < 5r`. -/\ntheorem transverse_hessian_le {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam : ℝ} (hr : 0 < r)\n (hm : 0 ≤ m)\n (hlip : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -la" + }, + { + "kind": "theorem", + "unqualified_name": "hessian_increment", + "line": 1191, + "source_header": "v‖ := h1\n _ ≤ 5 * r * m * ‖v‖ * ‖v‖ := by gcongr\n _ = 5 * r * m * ‖v‖ ^ 2 := by ring\n rw [hsplit]\n have := hlam v\n nlinarith\n\n/-- **L3 (increments of the transverse Hessian).** If `x ↦ H (x, 0)` has derivative `Hx x` with\n`‖Hx x‖ ≤ m` on `[-2r, r/2]` (the block `∂_x D_y² f`), and along each ray `s ↦ H (x, s • y)`,\n`s ∈ [0, 1]`, the derivative `Hr p s` has `‖Hr p s‖ ≤ m ‖y‖` (the block `D_y³ f` applied to `y`),\nthen moving first in `x` along `y = 0` and then along the ray gives `‖H p - H M‖ ≤ m (|Δx| + ‖Δy‖)`\nfrom `M = (-r/2, 0)`, by the mean value inequality. -/\ntheorem hessian_increment {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m : ℝ} (hr : 0 < r)\n (hHx : ∀ x ∈ Icc (-2 * r) (r / 2), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r) (r / 2), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,\n HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,\n ‖Hr p s‖ ≤ m" + }, + { + "kind": "theorem", + "unqualified_name": "slices_strongConcave", + "line": 1224, + "source_header": "(H (-r / 2, 0))\n _ ≤ m * ‖y‖ + m * |x - -r / 2| := add_le_add h1 h2\n _ = m * (|(x, y).1 - -r / 2| + ‖(x, y).2‖) := by simp only; ring\n\n/-- **L4 (strong concavity of the slices).** Under `transverse_hessian_le`'s hypotheses, with the\nslice derivatives `Dφ` and Hessians `H` given on the cap, every slice `y ↦ f (x, y)`,\n`x ∈ [-2r, r/2]`, is `(λ - 5rm)`-strongly concave on `B̄(0, 2r)`. -/\ntheorem slices_strongConcave {f : ℝ × E → ℝ} {Dφ : ℝ × E → E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam : ℝ} (hr : 0 < r) (hm : 0 ≤ m)\n (hD : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (p.1, y)) (Dφ p) p.2)\n (hH : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => Dφ (p.1, y)) (H p) p.2)\n (hlip : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_H1", + "line": 1244, + "source_header": ", y))\n (convex_closedBall _ _) (fun y hy => hD (x, y) ⟨hx, hy⟩) (fun y hy => hH (x, y) ⟨hx, hy⟩)\n (fun y hy v => hbd (x, y) ⟨hx, hy⟩ v)\n\n/-- **The cap from SP's hypothesis (H1) (L1–L5, L7, L8, L11, L18).** As `ridge_capHyp_normalized`,\nwith the slice strong concavity and `δ > rm(8m - 5)` derived from Hessian data: the slice\nderivatives and Hessians on the cap, the increment bound of `H` from `M` with constant `m`,\n`H(M) ≤ -λ`, and (H1) `8 r m² < λ`. Then `δ = λ - 5rm > rm(8m - 5)`. -/\ntheorem ridge_capHyp_H1 {f : ℝ × E → ℝ} {h : ℝ → E} {F G0 : ℝ → ℝ}\n {w : ℝ → E →L[ℝ] ℝ} {Dφ : ℝ × E → E →L[ℝ] ℝ} {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ}\n {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ} {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam : ℝ} (hr : 0 < r)\n (hg0 : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt (fun x => f (x, 0)) (G0 x) x)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t - m / 2 * t ^ 2))\n (hG0a : G0 (-r / 2) = 0) (hG0c : G0 (r / 2) = 0)\n (hD : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (p.1, y)) (Dφ p) p.2)\n (hH : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => Dφ (p.1, y)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r) (r / 2), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r) (r / 2), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,\n HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,\n ‖Hr p s‖ ≤ m * ‖p.2‖)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))\n (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))\n (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)\n (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) = r ^ 3 / 6) :\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))\n (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2)))" + }, + { + "kind": "theorem", + "unqualified_name": "slice_critical_unique", + "line": 1290, + "source_header": "nlinarith\n exact ridge_capHyp_normalized hr hg0 hG0cv hG0cc hG0a hG0c hδ hh hg hFa hFc hconv hconc hball\n hcrit hha hhc hw hwcv hwcc hnorm\n\n/-- **L7 (uniqueness of the transverse critical point).** A `δ`-strongly concave slice, `δ > 0`,\nhas at most one critical point in `K`. -/\ntheorem slice_critical_unique {K : Set E} {φ : E → ℝ} {δ : ℝ} (hφ : StrongConcaveOn K δ φ)" + }, + { + "kind": "theorem", + "unqualified_name": "slice_critical_exists", + "line": 1305, + "source_header": "ct le_of_mul_le_mul_left this hδ\n have h5 : ‖q - p‖ = 0 := by nlinarith [norm_nonneg (q - p)]\n exact (sub_eq_zero.mp (norm_eq_zero.mp h5)).symm\n\n/-- **L7 (existence of the transverse critical point).** If the slice is `δ`-strongly concave and\ndifferentiable on `B̄(0, R)` and its derivative at `0` has norm `< δR` (SP: `‖w‖ < δ · 2r`), the\nmaximum over the compact ball is attained in the open ball, so it is a critical point. On the\nsphere the radial derivative is `≤ w(p) - δR² < 0` (SP's L7 computation, here from the strong\nconcavity engine), which contradicts maximality. -/\ntheorem slice_critical_exists [ProperSpace E] {φ : E → ℝ} {Dφ : E → E →L[ℝ] ℝ} {δ R : ℝ}\n (hR : 0 < R) (hφ : StrongConcaveOn (Metric.closedBall (0 : E) R) δ φ)\n (hD :" + }, + { + "kind": "theorem", + "unqualified_name": "isInvertible_of_negDef", + "line": 1343, + "source_header": "sLocalMax (Metric.closedBall_mem_nhds_of_mem hpb)\n refine ⟨p, hpb, ?_⟩\n have hz := hloc.hasFDerivAt_eq_zero (hD p hp)\n rw [← hz]\n exact hD p hp\n\n/-- In finite dimension, a bilinear form `A : E →L E →L ℝ` with `A v v ≤ -δ‖v‖²`, `δ > 0`, is\ninvertible as a map `E → E*` (SP L7: \"`D_y² f` invertible\"). -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_hasStrictFDerivAt", + "line": 1364, + "source_header": ": E →ₗ[ℝ] E →L[ℝ] ℝ))).mp hinj\n refine ⟨(LinearEquiv.ofBijective (A : E →ₗ[ℝ] E →L[ℝ] ℝ) ⟨hinj, hsurj⟩).toContinuousLinearEquiv, ?_⟩\n ext v w\n rfl\n\n/-- **L7 (regularity of the ridge, pointwise).** If the transverse gradient `G` is strictly\ndifferentiable at `(x0, h x0)` with invertible transverse part, `h x0` is a critical point, and\nnear `x0` the critical point of each slice in a neighbourhood `K` of `h x0` is unique and equal to\n`h x`, then `h` agrees near `x0` with the implicit function of `G = 0` (Mathlib's\n`implicitFunctionOfProdDomain`), so `h` is strictly differentiable at `x0` with\n`h' = -(∂_y G)⁻¹ ∂_x G` (SP L9's formula). -/\ntheorem ridge_hasStrictFDerivAt [CompleteSpace E] {f : ℝ × E → ℝ} {G : ℝ × E → E →L[ℝ] ℝ}\n {DG : ℝ × E →L[ℝ] E →L[ℝ] ℝ} {h : ℝ → E} {K : Set E} {x0 : ℝ}\n (hGs : HasStrictFDerivAt G DG (x0, h x0))\n (hinv : (DG ∘L ContinuousLinearMap.inr ℝ ℝ E).IsInvertible)\n (hG : ∀ᶠ v in 𝓝 (x0, h x0), HasFDerivAt (fun y => f (v.1, y)) (G v) v.2)\n (hcrit0 : HasFDerivAt (fun y => f (x0, y)) (0 : E →L[ℝ] ℝ) (h x0)) (hK : K ∈ 𝓝 (h x0))\n (huniq : ∀ᶠ x in 𝓝 x0, ∀ y ∈ K, HasFDerivAt (fun y => f (x, y)) (0" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_differentiable", + "line": 1394, + "source_header": ":= by\n filter_upwards [hev, hGψ, hKψ, huniq] with x h1 h2 h3 h4\n rw [h1, hGu] at h2\n exact h4 (ψ x) h3 h2\n exact hψ.congr_of_eventuallyEq heq\n\n\n/-- **L7 (regularity of the ridge on `[-2r, 2r]`).** With the slices `δ`-strongly concave and `h x` a\ncritical point in `B̄(0, 2r)` for `x` in an open set `U ⊇ [-2r, 2r]` (SP: `f ∈ C⁴` near `D`), `h x`\nin the open ball on `[-2r, 2r]`, and the transverse gradient strictly differentiable along the\nridge with negative definite transverse part, `h` is strictly differentiable at every\n`x ∈ [-2r, 2r]`. Composed with `ridge_inputs_of_joint`, as `ridge_capHyp_source` does, this supplies\nits `hh'`. -/\ntheorem ridge_differentiable [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {G : ℝ × E → E →L[ℝ] ℝ}\n {DG : ℝ → ℝ × E →L[ℝ] E →L[ℝ] ℝ} {h : ℝ → E} {U : Set ℝ} {r δ : ℝ} (hδ : 0 < δ)\n (hU : IsOpen U) (hIU : Icc (-2 * r) (2 * r) ⊆ U)\n (hconc : ∀ x ∈ U,\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))\n (hball : ∀ x ∈ U, h x ∈ Metric.closedBall (0 : E) (2 * r))\n (hcrit : ∀ x ∈ U, HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))\n (hint : ∀ x ∈ Icc (-2 * r) (2 * r), h x ∈ Metric.ball (0 : E) (2 * r))\n (hG : ∀ x ∈ Icc (-2 * r) (2 * r),\n ∀ᶠ v in 𝓝 (x, h x), HasFDerivAt (fun y => f (v.1, y)) (G v) v.2)\n (hGs : ∀ x ∈ Icc (-2 * r) (2 * r), HasStrictFDerivAt G (DG x) (x, h x))\n (hneg : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v : E,\n (DG x ∘L ContinuousLinearMap.inr ℝ ℝ E) v v ≤ -δ * ‖v‖ ^ 2) :" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_exists", + "line": 1426, + "source_header": "l x' hx') hdy (hcrit x' hx')\n exact ridge_hasStrictFDerivAt (hGs x hx) (isInvertible_of_negDef hδ (hneg x hx)) (hG x hx)\n (hcrit x (hIU hx)) hK huniq\n\n\n/-- **L7 (existence of the ridge).** If on an open set `U` of `x`-values the slices are\n`δ`-strongly concave and differentiable on `B̄(0, 2r)` with `‖∂_y f(x, 0)‖ < δ · 2r`, a map `h`\nwith `h x` a critical point in the open ball exists on `U` (by choice; unique by\n`slice_critical_unique`). -/\ntheorem ridge_exists [ProperSpace E] {f : ℝ × E → ℝ} {Dφ : ℝ → E → E →L[ℝ] ℝ} {U : Set ℝ}\n {r δ : ℝ} (hr : 0 < r)\n (hconc : ∀ x ∈ U,\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))\n (hD : ∀ x ∈ U, ∀ y ∈ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (x, y)) (Dφ x y) y)\n (hw : ∀" + }, + { + "kind": "theorem", + "unqualified_name": "hessian_increment_D", + "line": 1450, + "source_header": "hx) (hD x hx) (hw x hx)\n exact ⟨p, fun _ => ⟨hp, hdp⟩⟩\n · exact ⟨0, fun h => absurd h hx⟩\n choose h hh using hex\n exact ⟨h, fun x hx => hh x hx⟩\n\n/-! ### The full domain (v1.8)\n\nSP proves L4 on all of `D`, where the increment from `M` is at most `9r/2 < 5r`, and assumes\n`f ∈ C⁴` near `D`. The lemmas below take the source data on a collar `x ∈ [-2r - ε, 2r + ε]`,\n`0 < ε ≤ r/2`, where `|x + r/2| ≤ 3r` keeps the increment at most `5r`. So every slice over the open\nset `(-2r - ε, 2r + ε) ⊇ [-2r, 2r]` is `(λ - 5rm)`-strongly concave, which is what the L7 lemmas\nneed, and `ridge_capHyp_source` composes L7 with the cap. -/\n\n/-- **L3 on the full domain.** As `hessian_increment`, with the `x`-range `[-2r - ε, 2r + ε]`. -/\ntheorem hessian_increment_D {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1," + }, + { + "kind": "theorem", + "unqualified_name": "transverse_hessian_le_D", + "line": 1487, + "source_header": "(x, y)) (H (x, 0)) (H (-r / 2, 0))\n _ ≤ m * ‖y‖ + m * |x - -r / 2| := add_le_add h1 h2\n _ = m * (|(x, y).1 - -r / 2| + ‖(x, y).2‖) := by simp only; ring\n\n/-- **L4's Hessian bound on the full domain.** As `transverse_hessian_le`, for\n`x ∈ [-2r - ε, 2r + ε]` with `0 < ε ≤ r/2`: there `|x + r/2| ≤ 3r`, so the increment is still at\nmost `5r`. -/\ntheorem transverse_hessian_le_D {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ}\n (hm : 0 ≤ m) (hε : 0 < ε) (hεr : ε ≤ r / 2)\n (hlip : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))\n (hlam : ∀ v : E, H (-r /" + }, + { + "kind": "theorem", + "unqualified_name": "slices_strongConcave_D", + "line": 1518, + "source_header": "H (-r / 2, 0)‖ * ‖v‖ * ‖v‖ := h1\n _ ≤ 5 * r * m * ‖v‖ * ‖v‖ := by gcongr\n _ = 5 * r * m * ‖v‖ ^ 2 := by ring\n rw [hsplit]\n have := hlam v\n nlinarith\n\n/-- **L4 on the full domain.** Every slice `y ↦ f (x, y)`, `x ∈ [-2r - ε, 2r + ε]`, is\n`(λ - 5rm)`-strongly concave on `B̄(0, 2r)`. -/\ntheorem slices_strongConcave_D {f : ℝ × E → ℝ} {Dφ : ℝ × E → E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hm : 0 ≤ m) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hD : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (p.1, y)) (Dφ p) p.2)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => Dφ (p.1, y)) (H p) p.2)\n (hlip : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))\n (hlam : ∀ v : E, H (-r / 2," + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_source", + "line": 1538, + "source_header": ")) (H := fun y => H (x, y))\n (convex_closedBall _ _) (fun y hy => hD (x, y) ⟨hx, hy⟩) (fun y hy => hH (x, y) ⟨hx, hy⟩)\n (fun y hy v => hbd (x, y) ⟨hx, hy⟩ v)\n\n/-- **The cap from SP's source data (L1–L5, L7, L8, L11, L18 composed).** Fix a collar\n`0 < ε ≤ r/2` and assume, for `x ∈ [-2r - ε, 2r + ε]` and `y ∈ B̄(0, 2r)`: a joint derivative `Df` of `f`, strictly differentiable in\nits transverse part `∂_y f = Df ∘ inr` with derivative `DG`; the transverse Hessian `H` with the\nthird-derivative bounds `m` of L3; (H1) `8rm² < λ` with `H(M) ≤ -λ`; the critical pins\n`Df(∓r/2, 0) = 0`; the weak bounds `|∂_x³ f(·, 0)| ≤ m` on `[-r/2, r/2]` (L1) and\n`|∂_x² ∂_y f(·, 0)| ≤ m` on the collar (L5); and the gap `f(M) - f(S) = r³/6`. Then:\n- a ridge `h` exists: on `(-2r - ε, 2r + ε)`, `h x` is a critical point of its slice in the open\n ball;\n- for any such ridge (unique by `slice_critical_unique`) with L12's `hconv` for\n `F x = ∂_x f(x, h x)`, `h(∓r/2) = 0`, and (C1)–(C3) and (C2⁺) hold on the cap with `M = (-r/2, 0)`,\n `S = (r/2, 0)`, `b = f(M)` and `s = f(S)`.\n\nL8 puts `h` in the open ball on `[-2r, 2r]` (`‖w‖ ≤ 3mr² < 2rδ`); the implicit function theorem\n(`ridge_differentiable`) makes `h` differentiable there, with negative definite `DG ∘ inr = H`;\n`ridge_inputs_of_joint` gives L11; `ridge_capHyp_H1` gives the cap. Only L12 (`hconv`) remains an\ninput, with L6 and L9–L11's quantitative bounds that SP uses to prove it. -/\ntheorem ridge_capHyp_source [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt f (Df p) p)\n (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n ConvexOn ℝ (Icc (-2 * r) (2 * r))\n (fun x => Df (x, h x) (1, 0) - (x + r / 2) * (x - r / 2) / 8) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)\n (2 * r, h (2 * r)) (" + }, + { + "kind": "theorem", + "unqualified_name": "convex_deriv_sign", + "line": 1737, + "source_header": ".subset hcapX (convex_Icc _ _))\n (fun v => (hwcc' v).subset hcapX (convex_Icc _ _)) (by rw [hha, hhc]; exact hnorm)\n rw [hha, hhc] at key\n exact ⟨hha, hhc, key⟩\n\n\n/-! ### L6, L9 and L12 (v1.9)\n\nThe last analytic input of the cap, L12's convexity `hconv`, is derived here. L6 bounds `w'` by\nchord slopes of L5's convexity pair (no integral), L9 bounds `h'` through the differentiated ridge\nequation, and L12 uses that `F' = D²f[(1, h'), (1, 0)]` is the maximum of `ζ ↦ D²f[(1, ζ), (1, ζ)]`,\nso that no second derivative of `h` is needed. `ridge_capHyp_C3` composes them with\n`ridge_capHyp_source`. -/\n\n/-- A convex function with equal values at `a < c` has derivative `≥ 0` to the right of `c` and\n`≤ 0` to the left of `a`. -/\ntheorem convex_deriv_sign {φ : ℝ → ℝ} {D : Set ℝ} {a c x" + }, + { + "kind": "theorem", + "unqualified_name": "two_node_deriv_bound", + "line": 1772, + "source_header": "c - φ a) / (c - a) :=\n hφ.slope_mono_adjacent hx hcD h hac\n have h2 := hφ.le_slope_of_hasDerivAt hx haD h hd\n rw [slope_def_field] at h2\n linarith\n\n/-- **L6 (scalar).** If `u + (m/2)t²` is convex and `u - (m/2)t²` concave on `D` (weakly\n`|u''| ≤ m`), `u(∓r/2) = 0` and `u` has derivative `d` at `x ∈ D`, then `|d| ≤ m · max(|x|, r/2)`.\nOutside the pins the chord through them has slope `0`; between them the chord to the nearer pin and\nL5's bound on `u(x)` give `mr/2`. -/\ntheorem two_node_deriv_bound {u : ℝ → ℝ} {D : Set ℝ} {r m x d : ℝ} (hr : 0 < r) (hm : 0 ≤ m)\n (hcv : ConvexOn ℝ D (fun t => u t + m / 2 * t ^ 2))\n (hcc : ConcaveOn ℝ D (fun t => u t" + }, + { + "kind": "theorem", + "unqualified_name": "slice_gradient_deriv_bound", + "line": 1831, + "source_header": "calc |d| ≤ m / 2 * r := abs_le.mpr ⟨by linarith, hd1⟩\n _ = m * (r / 2) := by ring\n _ ≤ m * max |x| (r / 2) := mul_le_mul_of_nonneg_left (le_max_right _ _) hm\n\n\n/-- **L6 (CAP (7)).** For the slice derivatives `w t` at `y = 0` with derivative `w' x` at `x`, under\nL5's hypotheses: `‖w' x‖ ≤ m · max(|x|, r/2)`; on `[-2r, 2r]` this is SP's `‖w'‖ ≤ 2mr`. -/\ntheorem slice_gradient_deriv_bound {w : ℝ → E →L[ℝ] ℝ} {w' : E →L[ℝ] ℝ} {D : Set ℝ} {r m x : ℝ}\n (hr : 0 < r) (hm : 0 ≤ m)\n (hcv : ∀ v : E, ConvexOn ℝ D (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))\n (hcc : ∀ v : E, ConcaveOn ℝ D (fun t => w t v - m *" + }, + { + "kind": "theorem", + "unqualified_name": "schur_max", + "line": 1849, + "source_header": "(hcc v) haD hcD (by simp [ha]) (by simp [hc]) hx hdv\n rw [Real.norm_eq_abs]\n calc |w' v| ≤ m * ‖v‖ * max |x| (r / 2) := h\n _ = m * max |x| (r / 2) * ‖v‖ := by ring\n\n/-- **L9 and the Schur maximum.** Let `Q` be a bilinear form on `ℝ × E` with `δ`-negative definite\ntransverse part, and let `η` satisfy the differentiated ridge equation `Q (1, η) (0, ·) = 0`. Then\n`δ ‖η‖ ≤ ‖Q (1, 0) (0, ·)‖` (L9: `‖h'‖ ≤ ‖∂_x ∇_y f‖ / δ`), `Q (1, η) (1, η) = Q (1, η) (1, 0)`, and,\nif `Q` is symmetric, `Q (1, ζ) (1, ζ) ≤ Q (1, η) (1, η)` for every `ζ`: the Schur complement\n`F' = f_xx + f_xy[h']` is the maximum of `ζ ↦ D²f[(1, ζ), (1, ζ)]`. -/\ntheorem schur_max {Q : ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ} {δ : ℝ} {η : E} (hδ : 0 < δ)\n (hneg : ∀ v : E, Q (0, v) (0, v) ≤ -δ * ‖v‖ ^ 2)\n (hridge : (Q (1, η)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0) :\n δ *" + }, + { + "kind": "theorem", + "unqualified_name": "trilinear_lower", + "line": 1889, + "source_header": "2 : Q (0, ζ - η) (1, η) = 0 := by rw [hsym]; exact h1\n have h3 := hneg (ζ - η)\n rw [hz, map_add, map_add, add_apply, add_apply, h1, h2]\n nlinarith [sq_nonneg ‖ζ - η‖]\n\n/-- **The correction terms of L12.** Let `T a b v` be the third derivative of `f` (the derivative of\n`D²f[a, b]` in direction `v`). If every block other than `f_xxx` has norm at most `m`, in the combined\nform below, then `T (1, b) (1, b) (1, a) ≥ f_xxx - m((1 + ‖b‖)²(1 + ‖a‖) - 1)`. With `‖a‖, ‖b‖ ≤ u`\nthis is SP's adverse bound `m u (3 + 3u + u²)`. -/\ntheorem trilinear_lower {T : ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {m : ℝ}\n (hT : ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁|" + }, + { + "kind": "theorem", + "unqualified_name": "l12_constants", + "line": 1903, + "source_header": ") - m * ((1 + ‖b‖) * (1 + ‖b‖) * (1 + ‖a‖) - 1) ≤ T (1, b) (1, b) (1, a) := by\n have h := (abs_le.mp (hT 1 1 1 b b a)).1\n simp only [abs_one, one_mul, mul_one] at h\n linarith\n\n/-- **SP's constants close L12.** With `m ≥ 2`, `δ > rm(8m - 5)` and `u = 2s + 2s²`, `s = mr/δ`\n(L9's bound on `‖h'‖`): `7/4 - m((1 + u)³ - 1) ≥ 1/4`. SP's exact value at `k = 11` is\n`7/4 - 2554128/1771561 = 0.308… > 1/" + }, + { + "kind": "theorem", + "unqualified_name": "transverse_hessian_eq", + "line": 1936, + "source_header": "have h4 : (m * u) * (3 + 3 * u + u ^ 2) ≤ (48 / 121) * (3 + 3 * (24 / 121) + (24 / 121) ^ 2) :=\n mul_le_mul hmu h3 (by positivity) (by norm_num)\n norm_num at h4 ⊢\n linarith\n\n/-- **The transverse Hessian is the transverse block of `D²f`.** If `y ↦ ∂_y f (x, y)` has\nderivative `H` at `y₀` and `Df` has derivative `D2f` at `(x, y₀)`, then\n`H v w = D²f (x, y₀) [(0, v), (0, w)]`. -/\ntheorem transverse_hessian_eq {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {H : E →L[ℝ] E →L[ℝ] ℝ}" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_second_identity", + "line": 1950, + "source_header": "p y₀ (hasFDerivAt_prodMk_right x y₀)).clm_apply\n (hasFDerivAt_const ((0 : ℝ), w) y₀)\n have h3 := h1.unique h2\n have := congrArg (fun L : E →L[ℝ] ℝ => L v) h3\n simpa using this\n\n/-- **The differentiated ridge equation.** If `∂_y f (t, h t) = 0` for `t` near `x`, `h` has\nderivative `h'` at `x` and `Df` has derivative `D2f` at `(x, h x)`, then\n`D²f (x, h x) [(1, h'), (0, ·)] = 0`, i.e. `∂_x ∇_y f + D_y² f · h' = 0` (L11's first identity). -/\ntheorem ridge_second_identity {Df : ℝ × E → ℝ × E →L[ℝ] ℝ}\n {D2f : ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ} {h : ℝ → E} {h' : E} {x : ℝ}\n (hridge : ∀ᶠ t in 𝓝 x" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_hconv", + "line": 1968, + "source_header": "have h3 : HasDerivAt (fun t => (Df (t, h t)).comp (ContinuousLinearMap.inr ℝ ℝ E)) 0 x :=\n (hasDerivAt_const x (0 : E →L[ℝ] ℝ)).congr_of_eventuallyEq hridge\n exact h2.unique h3\n\n/-- **L12 (CAP (11)–(12)): the convexity input `hconv`.** Along the ridge, let `Df`, `D2f` be the\nfirst two derivatives of `f`, with `D2f` symmetric and its transverse part `δ`-negative definite,\n`‖h'‖ ≤ u`, and for every `‖b‖ ≤ u` let `s ↦ D²f(s, h s)[(1, b), (1, b)]` have derivative `≥ 1/4`\n(SP: `f_xxx ≥ 7/4` minus the adverse part `m u (3 + 3u + u²)`; see `trilinear_lower`). Then\n`F - (x + r/2)(x - r/2)/8`, `F x = ∂_x f (x, h x)`, is convex on `[-2r, 2r]`. No second derivative of\n`h` is used: `F' = D²f[(1, h'), (1, 0)]` is the maximum of `ζ ↦ D²f[(1, ζ), (1, ζ)]` (`schur_max`),\nso `F'(x₂) - F'(x₁) ≥ D²f(x₂)[(1, η), (1, η)] - D²f(x₁)[(1, η), (1, η)] ≥ (x₂ - x₁)/4` with\n`η = h'(x₁)`. -/\ntheorem ridge_hconv {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {Φ : ℝ → E → ℝ} {h h' : ℝ → E} {U : Set ℝ} {r δ u : ℝ} (hδ : 0 < δ) (hU : IsOpen U)\n (hIU : Icc (-2 * r) (2 * r) ⊆ U)\n (hridge : ∀ x ∈ U, (Df (x, h x)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0)\n (hh : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt h (h' x) x)\n (hD2 : ∀ x ∈ Icc (-2 * r) (2 * r), HasFDerivAt Df (D2f (x, h x)) (x, h x))\n (hsym : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v w, D2f (x, h x) v w = D2f (x, h x) w v)\n (hneg : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v : E, D2f (x, h x) (0, v) (0, v) ≤ -δ * ‖v‖ ^ 2)\n (hu : ∀ x ∈ Icc (-2 * r) (2 * r), ‖h' x‖ ≤ u)\n (hΦ : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ b : E,\n HasDerivAt (fun s => D2f (s, h s) (1, b) (1, b)) (Φ x b" + }, + { + "kind": "theorem", + "unqualified_name": "dx_grad_increment", + "line": 2041, + "source_header": "iableWithinAt) ?_\n intro x1 hx1 x2 hx2 hle\n rw [(hF x1 (interior_subset hx1)).deriv, (hF x2 (interior_subset hx2)).deriv]\n exact hmono (interior_subset hx1) (interior_subset hx2) hle\n\n\n/-- **L3 in `y` for `∂_x ∇_y f`.** If along the segment `s ↦ (x, s • y)` the third derivatives\nsatisfy `|T (1, 0) (0, v) (0, y)| ≤ m ‖v‖ ‖y‖` (the block `f_xyy`), then\n`‖∂_x ∇_y f (x, y) - ∂_x ∇_y f (x, 0)‖ ≤ m ‖y‖`. -/\ntheorem dx_grad_increment {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {x m : ℝ} {y : E} (hm : 0 ≤ m)\n (hD3 : ∀ s ∈ Icc (0 : ℝ) 1, ∀ a b : ℝ × E,\n HasFDerivAt (fun q => D2f q a b) (T3 (x, s • y) a b) (x, s • y))\n (hT : ∀ s ∈ Icc (0 : ℝ) 1, ∀ v : E, |T3 (x" + }, + { + "kind": "theorem", + "unqualified_name": "l9_arith", + "line": 2070, + "source_header": "ontinuousLinearMap.comp_apply,\n ContinuousLinearMap.inr_apply]\n calc ‖(D2f (x, y)) (1, 0) (0, v) - (D2f (x, 0)) (1, 0) (0, v)‖ ≤ m * ‖v‖ * ‖y‖ := this\n _ = m * ‖y‖ * ‖v‖ := by ring\n\n/-- **L9's arithmetic.** From `δ ‖h'‖ ≤ ‖∂_x∇_y f(x, h)‖ ≤ 2mr + m‖h‖` and `δ ‖h‖ ≤ 2mr²`:\n`‖h'‖ ≤ 2s + 2s²` with `s = mr/δ` (SP: `u = 2/k + 2/k²`). -" + }, + { + "kind": "theorem", + "unqualified_name": "l12_lower", + "line": 2082, + "source_header": "nlinarith\n have hrhs : 2 * (m * r / δ) + 2 * (m * r / δ) ^ 2 =\n (2 * m * r * δ + 2 * m * m * r ^ 2) / (δ * δ) := by\n field_simp\n rw [hrhs, le_div_iff₀ (by positivity)]\n linarith\n\n/-- **L12's bound at one point.** With the combined block bound, `f_xxx ≥ 7/4`, `‖a‖, ‖b‖ ≤ u`\nand `7/4 - m((1 + u)³ - 1) ≥ 1/4` (`l12_constants`): `T (1, b) (1, b) (1, a) ≥ 1/4`. -/\ntheorem l12_lower {T : ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {m u : ℝ} {a b : E} (hm : 0 ≤ m)\n (hT : ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_source_facts", + "line": 2103, + "source_header": "(mul_le_mul hb1 hb1 (by linarith) (by linarith)) ha1 (by linarith)\n (mul_nonneg (by linarith) (by linarith))\n have h5 := mul_le_mul_of_nonneg_left (sub_le_sub_right h4 1) hm\n linarith\n\n/-- **The ridge facts from SP's source data.** Under the hypotheses of `ridge_capHyp_source`, for a\nridge `h` on the collar: `m ≥ 2`, `δ = λ - 5rm > rm(8m - 5)`, `h x` lies in the open ball and\n`δ ‖h x‖ ≤ 2mr²` on `[-2r, 2r]` (L5 and L8), `h` is differentiable there (L7), and the transverse\nHessian along the ridge is `δ`-negative definite (L4). -/\ntheorem ridge_source_facts [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) {h : ℝ → E}\n (hhU : ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) :\n 2 ≤ m ∧ r * m * (8 * m - 5) < lam - 5 * r * m ∧\n (∀ x ∈ Icc (-2 * r) (2 * r), h x ∈ Metric.ball (0 : E) (2 * r)) ∧\n (∀ x ∈ Icc (-2 * r) (2 * r), (lam - 5 * r * m" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_C3", + "line": 2269, + "source_header": "(hball x (hIU hx)) (hcrit x (hIU hx))\n (hslice0 x (hUX (hIU hx)))).trans (hw2 x hx),\n ⟨_, fun x hx => (hstrict x hx).hasFDerivAt.hasDerivAt⟩,\n fun x hx v => hneg _ (hridgeX x hx) v⟩\n\n\n/-- **The cap from SP's `C³` source data (L1–L20 composed; L12 proved).** As\n`ridge_capHyp_source`, with L12's `hconv` derived instead of assumed. Additionally assume, on the\ncollar: a second derivative `D2f` of `f`, third derivatives `T3 p a b` of `p ↦ D²f p [a, b]`, every\nthird-derivative block other than `f_xxx` of norm at most `m` (combined form), and `f_xxx ≥ 7/4` on\n`D = [-2r, 2r] × B̄(0, 2r)` (SP's L4, from L2 and (H2), on SP's domain). Then the ridge exists, and every ridge has `h(∓r/2) = 0` and yields\n(C1)–(C3) and (C2⁺) on the cap. Inside: L5 gives `‖w‖ ≤ 2mr²` on `[-2r, 2r]`, L8 `‖h‖ ≤ 2mr²/δ`, L6\n`‖w'‖ ≤ 2mr`, L3 in `y` `‖∂_x∇_y f(x, h)‖ ≤ ‖w'‖ + m‖h‖`, L9 `‖h'‖ ≤ 2s + 2s²` with `s = mr/δ`,\n`trilinear_lower` and `l12_constants` give `F'' ≥ 1/4` in the form of `ridge_hconv`. -/\ntheorem ridge_capHyp_C3 [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}\n {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ a b : ℝ × E, HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hT : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hxxx : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n 7 / 4 ≤ T3 p (1, 0) (1, 0) (1, 0))\n (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)" + }, + { + "kind": "theorem", + "unqualified_name": "hermite_gap_le_concave", + "line": 2420, + "source_header": "(1, b) (1, b) (1, h' x)) hδ0 isOpen_Ioo hIU\n hridgeU hhd hD2r hsym hnegD hu hΦ\n (fun x hx b hb => l12_lower hm0 (hT _ (hridgeX x hx)) (hxxx _ ⟨hx, hball x (hIU hx)⟩) hc\n (hu x hx) hb)\n\n\n/-! ### L2's second statement and (H2) (v2.0)\n\nSP's L4 lower bound `f_xxx ≥ 7/4` was the last analytic hypothesis of `ridge_capHyp_C3`. It follows\nfrom the normalization (some point of the pin interval has `f_xxx ≥ 2`, by a one-sided Hermite bound)\nand (H2) `rn ≤ 1/20` with a bound `n` on the derivative of `f_xxx`. `ridge_capHyp_C4` takes SP's\nhypotheses only. -/\n\n/-- **L1, one-sided.** As `hermite_gap_le`, from the concave half alone (`G'' ≤ m` weakly):\n`g(a) - g(c) ≤ m (c - a)³/12`. -/\ntheorem hermite_gap_le_concave {g G : ℝ → ℝ} {a c m : ℝ} (" + }, + { + "kind": "theorem", + "unqualified_name": "third_deriv_exists_two", + "line": 2466, + "source_header": "kac\n have e0 : m / 2 * ((c - a) * (a - a) ^ 2 / 2 - (a - a) ^ 3 / 3) = 0 := by ring\n have e1 : m / 2 * ((c - a) * (c - a) ^ 2 / 2 - (c - a) ^ 3 / 3) = m * (c - a) ^ 3 / 12 := by\n ring\n linarith\n\n/-- **L2, second statement.** Under SP's normalization `g(-r/2) - g(r/2) = r³/6` with critical pins,\nif `g''' = φ` is continuous on the pin interval, then `φ(x₀) ≥ 2` for some `x₀` there (SP: the\n`φ`-weighted average of `f_xxx` is `2`). -/\ntheorem third_deriv_exists_two {g G G' φ : ℝ → ℝ} {r : ℝ} (hr : 0 < r)\n (hg : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt g (G x) x)\n (hG : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt G (G' x) x)\n (hG' : ∀ x ∈ Icc (-r / 2) (r / 2), HasDeri" + }, + { + "kind": "theorem", + "unqualified_name": "fxxx_lower", + "line": 2503, + "source_header": "h1 := hermite_gap_le_concave (by linarith) hg hcc hGa hGc\n have hcr : r / 2 - -r / 2 = r := by ring\n rw [hgap, hcr] at h1\n have h2 := hcon x₁ hx₁\n have hr3 : 0 < r ^ 3 := by positivity\n nlinarith\n\n/-- **L4 (`f_xxx ≥ 7/4`).** Let `ψ = f_xxx` have derivative `Dψ` on SP's domain\n`D = [-2r, 2r] × B̄(0, 2r)`, with the two fourth-order blocks bounded by `n = M_4` there:\n`|∂_x ψ| = |Dψ (1, 0)| ≤ n` and `‖D_y ψ‖ = ‖Dψ ∘ inr‖ ≤ n`. If `ψ(x₀, 0) ≥ 2` at a point of the pin\ninterval and (H2) `rn ≤ 1/20`, then `ψ ≥ 7/4` on `D` (the proof bounds `ψ ≥ 2 - 9rn/2`; the\nstatement exports `7/4`). As in SP's L3, move first in `x`\nalong `y = 0` (`|Δx| ≤ 5r/2`), then along the ray to `y` (`‖Δy‖ ≤ 2r`); SP rounds `9r/2` up to `5r`. -/\ntheorem fxxx_lower {ψ : ℝ × E → ℝ} {Dψ : ℝ × E → ℝ × E →L[ℝ] ℝ} {r n x₀ : ℝ} (hr : 0 < r)\n (hψ : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt ψ (Dψ p) p)\n (hnx : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Dψ p (1, 0)| ≤ n)\n (hny : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Dψ p).comp" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_C4", + "line": 2561, + "source_header": "mp h1').1\n have e2 := (abs_le.mp h2').1\n have h5 : n * |x - x₀| ≤ n * (5 * r / 2) := mul_le_mul_of_nonneg_left hdx hn0\n have h6 : n * ‖y‖ ≤ n * (2 * r) := mul_le_mul_of_nonneg_left hyn hn0\n nlinarith\n\n/-- **The cap from SP's hypotheses (H1), (H2) and the derivative bounds (L1–L20 composed).** As\n`ridge_capHyp_C3`, with `f_xxx ≥ 7/4` derived instead of assumed: from a derivative `Φ4` of `f_xxx`\non `D = [-2r, 2r] × B̄(0, 2r)` whose two blocks `∂_x f_xxx` and `D_y f_xxx` are bounded by\n`n = M_4` there, as in SP, and (H2) `rn ≤ 1/20`. L2's second statement gives `f_xxx(x₀, 0) ≥ 2` on\nthe pin interval (`third_deriv_exists_two`), and `fxxx_lower` gives `f_xxx ≥ 7/4` on `D`. -/\ntheorem ridge_capHyp_C4 [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {Φ4 : ℝ × E → ℝ × E →L[ℝ] ℝ} {n : ℝ}\n {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ a b : ℝ × E, HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hT : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hD4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (Φ4 p) p)\n (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Φ4 p (1, 0)| ≤ n)\n (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Φ4 p).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ n)\n (hH2 : r * n ≤ 1 / 20)\n (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r" + }, + { + "kind": "theorem", + "unqualified_name": "hessian_x_bound", + "line": 2649, + "source_header": "xxx_lower (ψ := fun q => T3 q (1, 0) (1, 0) (1, 0)) hr hD4 hn4x hn4y hx₀ h2 hH2\n exact ridge_capHyp_C3 hr hε hεr hDf hD2 hD3 hT hxxx hGs hH hHx hHxb hHr hHrb hlam hH1 hM hS\n hG0cv hG0cc hwcv hwcc hnorm\n\n\n/-! ### The derivative bounds from the block bound, and SP's bounds on `D` (v2.1)\n\nUp to v2.0 the capstones took six derivative bounds besides the block bound `hT`:\n- `hHxb` and `hHrb`, the inputs of L3;\n- `hwcv` and `hwcc`, the envelope inputs of L5–L6;\n- `hG0cv` and `hG0cc`, the envelope inputs of L1–L2.\n\nAll six follow from `hT` and from `|f_xxx| ≤ m` on the pin segment, and `ridge_capHyp_C5` derives\nthem. Up to v2.0 the bounds `m` were also assumed on a collar `[−2r − ε, 2r + ε]` of SP's `D`.\n`ridge_capHyp_D` assumes them on `D` only, through the continuity step `block_bound_collar` (I3). -/\n\n/-- **L3's `x`-input from the block bound.** Let `y ↦ ∂_y f (t, y)` have derivative `H (t, 0)` at `0`\nand `Df` have derivative `D2f (t, 0)` at `(t, 0)` for every `t ∈ J`, where `J` is uniquely\ndifferentiable at `x ∈ J`. If `t ↦ H (t, 0)` has derivative `Hx'` at `x`, then\n`Hx' v w = T3 (x, 0) [(0, v), (0, w), (1, 0)]`, so `‖Hx'‖ ≤ m` when that block is at most\n`m ‖v‖ ‖w‖`. This derives v1.6's hypothesis `hHxb`. -/\ntheorem hessian_x_bound {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx' : E →L[ℝ] E →L[ℝ] ℝ} {J : Set ℝ} {m x : ℝ}\n (hJ : UniqueDiffWithinAt ℝ J x) (hxJ : x ∈ J) (hm : 0 ≤ m)\n (hH : ∀ t ∈ J, HasFDerivAt (fun y => (Df (t, y)).comp (ContinuousLinearMap.inr ℝ ℝ E))\n (H (t, 0)) 0)\n (hD2 : ∀ t ∈ J, HasFDerivAt Df (D2f (t, 0)) (t, 0))\n (hD" + }, + { + "kind": "theorem", + "unqualified_name": "hessian_r_bound", + "line": 2693, + "source_header": "t\n refine ContinuousLinearMap.opNorm_le_bound _ hm fun v => ?_\n refine ContinuousLinearMap.opNorm_le_bound _ (mul_nonneg hm (norm_nonneg v)) fun w => ?_\n rw [key, Real.norm_eq_abs, mul_assoc]\n exact hT v w\n\n/-- **L3's radial input from the block bound.** Along the radius `τ ↦ (x, τ y)`, `τ ∈ [0, 1]`, if\n`τ ↦ H (x, τ y)` has derivative `Hr'` at `s`, then `Hr' v w = T3 (x, s y) [(0, v), (0, w), (0, y)]`,\nso `‖Hr'‖ ≤ m ‖y‖` when that block is at most `m ‖v‖ ‖w‖ ‖y‖`. The identification uses derivatives\nwithin `[0, 1]`, so the endpoint `τ = 1` may lie on the sphere `‖y‖ = 2r`. This derives v1.6's\nhypothesis `hHrb`. -/\ntheorem hessian_r_bound {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hr' : E →L[ℝ] E →L[ℝ] ℝ} {x m s : ℝ} {y : E}\n (hm : 0 ≤ m) (hs : s ∈ Icc (0 : ℝ) 1)\n (hH : ∀ τ ∈ Icc (0 : ℝ) 1, HasFDerivAt (fun z => (Df (x, z)).comp (ContinuousLinearMap.inr ℝ ℝ E))\n (H (x, τ • y)) (τ • y))\n (hD2 : ∀ τ ∈ Icc (0 : ℝ) 1, HasFDerivAt Df (D2f (x, τ • y)) (x, τ • y))\n (hD3 : ∀ a b : ℝ × E, HasFDerivAt" + }, + { + "kind": "theorem", + "unqualified_name": "axis_convexConcave", + "line": 2730, + "source_header": "ap.opNorm_le_bound _ (mul_nonneg hmy (norm_nonneg v)) fun w => ?_\n rw [key, Real.norm_eq_abs]\n calc |T3 (x, s • y) (0, v) (0, w) (0, y)| ≤ m * (‖v‖ * ‖w‖ * ‖y‖) := hT v w\n _ = m * ‖y‖ * ‖v‖ * ‖w‖ := by ring\n\n/-- **The envelope inputs of L1 and L5–L6 from a second-derivative bound.** If the second derivative\n`T3 (t, 0) [(1, 0), u, (1, 0)]` of `t ↦ Df (t, 0) u` has absolute value at most `B` on `[a, c]`, then\n`Df (·, 0) u + (B/2) t²` is convex and `Df (·, 0) u − (B/2) t²` is concave there. With `u = (0, v)`\nand `B = m‖v‖` (from the block bound) this gives `hwcv` and `hwcc`. With `u = (1, 0)` and `B = m`\n(SP: `|f_xxx| ≤ M₃`) it gives `hG0cv` and `hG0cc`. -/\ntheorem axis_convexConcave {Df : ℝ × E → ℝ × E →L[ℝ] ℝ}\n {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {a c B : ℝ} {u : ℝ × E}\n (hD2 : ∀ t ∈ Icc a c, HasFDerivAt Df (D2f (t, 0)) (t, 0))\n (hD3 : ∀ t ∈ Icc a c, HasFDerivAt (fun q => D2f q (1, 0) u) (T3 (t," + }, + { + "kind": "theorem", + "unqualified_name": "block_nonneg", + "line": 2789, + "source_header": "t ((hg' t (hIo t ht)).sub (hlin t)).hasDerivWithinAt\n · intro t ht\n have := hB t (hIo t ht)\n have := le_abs_self (T3 (t, 0) (1, 0) u (1, 0))\n show T3 (t, 0) (1, 0) u (1, 0) - B ≤ 0\n linarith\n\n/-- The block weig" + }, + { + "kind": "theorem", + "unqualified_name": "block_bound_collar", + "line": 2799, + "source_header": "_right (norm_nonneg _)\n have a3 : |s₃| ≤ |s₃| + ‖y₃‖ := le_add_of_nonneg_right (norm_nonneg _)\n have := mul_le_mul (mul_le_mul a1 a2 (abs_nonneg _) (by positivity)) a3 (abs_nonneg _)\n (by positivity)\n linarith\n\n/-- **The continuity step of I3: the block bound from `D` to a collar.** Assume the block bound holds\nwith `m` on SP's `D = [−2r, 2r] × B̄(0, 2r)`. Assume also that on the collar\n`[−2r − ε₀, 2r + ε₀] × B̄(0, 2r)` the `x`-derivative `T4` of `T3` exists and satisfies the same block\nbound with some `K ≥ 0` (SP: `f ∈ C⁴` near `D`, so `‖D⁴ f‖` is bounded on a compact collar). Then the\nblock bound holds with `m + Kε` on the collar of width `ε ≤ ε₀`. Each collar point `(x, y)` is\nwithin `ε` of a point `(x₀, y) ∈ D`, and the mean value inequality along `x` gives the rest. -/\ntheorem block_bound_collar {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}\n {T4 : ℝ × E → ℝ × E → ℝ × E → ℝ × E → ℝ} {r m K ε₀ ε : ℝ} (hr : 0 < r) (hK : 0 ≤ K)\n (hε : 0 ≤ ε) (hεε : ε ≤ ε₀)\n (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hD4x : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ a b c : ℝ × E, HasDerivAt (fun t => T3 (t, p.2) a b c) (T4 p a b c) p.1)\n (hT4 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T4 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T4 p (1, 0) (1, 0) (1, 0)| ≤\n K * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|)) :\n ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_C5", + "line": 2862, + "source_header": "y₃\n have hKX : 0 ≤ K * X := mul_nonneg hK hX\n have h3 : K * X * |x - x₀| ≤ K * X * ε := mul_le_mul_of_nonneg_left hxx₀ hKX\n have h4 := abs_sub_abs_le_abs_sub (g x) (g x₀)\n show |g x| ≤ (m + K * ε) * X\n nlinarith\n\n/-- **The cap from the block bound alone.** `ridge_capHyp_C4` with its six derivative-bound\nhypotheses derived. `hHxb`, `hHrb`, `hwcv` and `hwcc` come from the block bound `hT`\n(`hessian_x_bound`, `hessian_r_bound`, `axis_convexConcave`). `hG0cv` and `hG0cc` come from\n`|f_xxx| ≤ m` on the pin segment (`hTe`, SP: `|f_xxx| ≤ M₃`). The conclusion is unchanged. -/\ntheorem ridge_capHyp_C5 [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {Φ4 : ℝ × E → ℝ × E →L[ℝ] ℝ} {n : ℝ}\n {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ a b : ℝ × E, HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hT : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |T3 (x, 0) (1, 0) (1, 0) (1, 0)| ≤ m)\n (hD4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (Φ4 p) p)\n (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Φ4 p (1, 0)| ≤ n)\n (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Φ4 p).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ n)\n (hH2 : r * n ≤ 1 / 20)\n (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E)" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_D", + "line": 2948, + "source_header": "(fun t ht => hD3 _ (hpin t ht) (1, 0) (1, 0)) hTe\n exact ridge_capHyp_C4 hr hε hεr hDf hD2 hD3 hT hD4 hn4x hn4y hH2 hGs hH hHx hHxb hHr hHrb hlam\n hH1 hM hS hG0.1 hG0.2 (fun v => (hw v).1) (fun v => (hw v).2) hnorm\n\n/-- **The cap from SP's bounds on `D` (the continuity step of I3).** The quantitative hypotheses are\nassumed on SP's `D` only:\n- the block bound `m` and `|f_xxx| ≤ m` on the pin segment;\n- SP's `M₄` blocks `n`;\n- (H1) and (H2).\n\nOn a collar of some width `ε₀ > 0`, only qualitative data are assumed: the derivatives, the strict\nderivative of `∂_y f`, and some bound `K ≥ 0` on the `x`-derivative of `T3` in block form (SP:\n`f ∈ C⁴` near `D`). Because (H1) is strict, some `ε ∈ (0, ε₀]` keeps `8r(m + Kε)² < λ`.\n`ridge_capHyp_C5` then applies with `m + Kε` (`block_bound_collar`). -/\ntheorem ridge_capHyp_D [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {T4 : ℝ × E → ℝ × E → ℝ × E → ℝ × E → ℝ}\n {Φ4 : ℝ × E → ℝ × E →L[ℝ] ℝ} {n : ℝ}\n {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m K lam ε₀ : ℝ} (hr : 0 < r) (hε₀ : 0 < ε₀)\n (hK : 0 ≤ K)\n (hDf : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ a b : ℝ × E,\n HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hD4x : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ a b c : ℝ × E, HasDerivAt (fun t => T3 (t, p.2) a b c) (T4 p a b c) p.1)\n (hT4 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T4 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T4 p (1, 0) (1, 0) (1, 0)| ≤\n K * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |T3 (x, 0) (1, 0) (1, 0) (1, 0)| ≤ m)\n (hD4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (Φ4 p) p)\n (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Φ4 p (1, 0)| ≤ n)\n (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Φ4 p).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ n)\n (hH2 : r * n ≤ 1 / 20)\n (hGs : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε₀) (2 * r + ε₀), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHr : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n ∃ ε, 0 < ε ∧ ε ≤ ε₀ ∧\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 :" + }, + { + "kind": "theorem", + "unqualified_name": "block_of_norm", + "line": 3028, + "source_header": "hD4x hT4) (fun x hx => (hTe x hx).trans hmm)\n hD4 hn4x hn4y hH2 (fun p hp => hGs p (hsub p hp)) (fun p hp => hH p (hsub p hp))\n (fun x hx => hHx x (hsubI x hx)) (fun p hp => hHr p (hsub p hp)) hlam hH1' hM hS hnorm⟩\n\n\n/-! ### SP's `f ∈ C⁴` near `D` supplies the collar data (v2.2)\n\n`block_of_norm` turns a bound on the norm of a trilinear form into the block bound, and\n`collar_subset_open` finds a closed collar inside an open neighbourhood of `D`. `ridge_capHyp_E`\ntakes `f ∈ C⁴` on an open `U ⊇ D` and SP's quantitative bounds on `D`, written with the iterated\nderivatives `iteratedFDeriv ℝ k f`. It builds every derivative datum of `ridge_capHyp_D` from `f`,\nand it takes the collar width from `collar_subset_open` and `K` from the continuity of `D⁴f` on the\ncompact collar. -/\n\n/-- **The block bound from the norm.** A trilinear form `B` on `ℝ × E` with `‖B‖ ≤ K` satisfies\nthe block bound with constant `K`. For `a = (s₁, y₁)`, `b = (s₂, y₂)`, `c = (s₃, y₃)` and\n`e = (1, 0)`:\n`|B(a, b, c) - s₁s₂s₃ B(e, e, e)| ≤ K((|s₁| + ‖y₁‖)(|s₂| + ‖y₂‖)(|s₃| + ‖y₃‖) - |s₁||s₂||s₃|)`.\nReplacing one slot at a time by `sᵢ e` leaves three terms, and each has a transverse argument\n`(0, yᵢ)`. -/\ntheorem block_of_norm {B : ContinuousMultilinearMap ℝ (fun _ : Fin 3 => ℝ × E) ℝ}" + }, + { + "kind": "theorem", + "unqualified_name": "collar_subset_open", + "line": 3124, + "source_header": "0, hne, hne]\n calc _ ≤ _ := abs_add_three _ _ _\n _ ≤ K * ‖y₁‖ * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) + K * |s₁| * ‖y₂‖ * (|s₃| + ‖y₃‖) +\n K * |s₁| * |s₂| * ‖y₃‖ := by gcongr\n _ = _ := by ring\n\nomit [NormedSpace ℝ E] in\n/-- **A collar inside a neighbourhood of `D`.** If an open `U` contains\n`D = [-2r, 2r] × B̄(0, 2r)` and `E` is proper, then some closed collar\n`[-2r - ε₀, 2r + ε₀] × B̄(0, 2r)` with `ε₀ > 0` lies in `U`: `D` is compact, so a closed\nthickening of `D` lies in `U`. -/\ntheorem collar_subset_open [Prop" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_E", + "line": 3149, + "source_header": ";> linarith [hx.2]\n · exact ⟨x, ⟨by linarith, by linarith⟩, by simp [hδ.le]⟩\n refine Metric.mem_cthickening_of_dist_le (x, y) (x₀, y) δ _ ⟨hx₀, hy⟩ ?_\n rw [Prod.dist_eq, dist_self, Real.dist_eq]\n exact max_le hxx₀ hδ.le\n\n/-- **The cap from `f ∈ C⁴` near `D` and SP's bounds on `D` (I3's qualitative part).** Assume\nthat `f` is `C⁴` on an open `U ⊇ D` (SP: `f ∈ C⁴` near `D`). Assume also SP's quantitative\nhypotheses on `D`, written with `D^k f(p)[v₁, …, v_k] = iteratedFDeriv ℝ k f p ![v₁, …, v_k]` and\n`e = (1, 0)`:\n- the block bound `m` on `D³f`, and `|f_xxx| ≤ m` on the pin segment;\n- SP's `M₄` blocks `n`: `|D⁴f[e, e, e, e]| ≤ n` and `|D⁴f[(0, v), e, e, e]| ≤ n‖v‖`;\n- (H1): `D²f(M)[(0, v), (0, v)] ≤ -λ‖v‖²` with `8rm² < λ`; and (H2);\n- `M = (-r/2, 0)` and `S = (r/2, 0)` are critical, and `f(M) - f(S) = r³/6`.\n\nThen `ridge_capHyp_D` applies. Its collar width comes from `collar_subset_open`, and its derivative\ndata are the Fréchet derivatives of `f` (`T3`, `T4` and `Φ4` are slices of `D³f` and `D⁴f`). Its\n`K` bounds `‖D⁴f‖` on the compact collar. No derivative datum and no bound off `D` is assumed. -/\ntheorem ridge_capHyp_E [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}\n {r m n lam : ℝ} (hr : 0 < r) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 f U)\n (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |iteratedFDeriv ℝ 3 f p ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] -\n s₁ * s₂ * s₃ * iteratedFDeriv ℝ 3 f p ![(1, 0), (1, 0), (1, 0)]| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ m)\n (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ n)\n (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,\n |iteratedFDeriv ℝ 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ n * ‖v‖)\n (hH2 : r * n ≤ 1 / 20)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)\n (hH1 : 8 * r * m ^ 2 < lam)\n (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n ∃ ε, 0 < ε ∧\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBa" + }, + { + "kind": "def", + "unqualified_name": "toyF", + "line": 3315, + "source_header": "f := fun s : ℝ => ((p.1, s • p.2) : ℝ × E)) s (dD3 _ hmem) hp'))\n (fun v => by\n have h := hlam v\n rw [← hD2] at h\n exact h)\n hH1 hM hS hnorm\n obtain ⟨ε, hε, -, hrest⟩ := key\n exact ⟨ε, hε, hrest⟩\n\nend Slice\n\n/-! ### A concrete instance and the necessity of each hypothesis\n\nOn `ℝ`, `toyF x = max (-|x|) (x - 2)` has a local maximum `M = 0` at height `b = 0`, a\nseparating local minimum `S = 1` at height `s = -1`, and an older point `z = 3` at height `1`.\nThe cap is `[-2, 1]`. The instance sho" + }, + { + "kind": "def", + "unqualified_name": "toyRidge", + "line": 3326, + "source_header": "tisfiable (the theorems are not\nvacuous), and the three counterexamples show that dropping (C" + }, + { + "kind": "theorem", + "unqualified_name": "toy_ridge_ge", + "line": 3333, + "source_header": "ax (-|x|) (x - 2)\n\n/-- The toy ridge, `t ↦ 3t` from `0` to `3" + }, + { + "kind": "theorem", + "unqualified_name": "toy_frontier", + "line": 3342, + "source_header": ") ≤ t := t.2.1\n show -1 ≤ max (-|3 * (t : ℝ)|) (3 * (t : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "toy_capHyp", + "line": 3344, + "source_header": "t : ℝ)) 1 with h | h\n · refine le_max_of_le_left ?_\n rw [abs_of_nonneg (by linarith)]\n linarith\n · exact le_max_of_le_right (by linarith)\n\ntheorem toy_front" + }, + { + "kind": "theorem", + "unqualified_name": "toy_saddle_strict", + "line": 3363, + "source_header": "(-|(-2 : ℝ)|) ((-2 : ℝ) - 2) ≤ -1\n norm_num [abs_of_neg]\n · show max (-|(1 : ℝ)|) ((1 : ℝ) - 2) ≤ -1\n norm_num\n older := by\n show (0 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "toy_saddle_cut", + "line": 3372, + "source_header": "_saddle_strict : ∀ x ∈ frontier (Icc (-2 : ℝ) 1), x ≠ 1 → toyF x < -1 := by\n intro x hx hne\n rw [toy_frontier] at hx\n rcases hx with rfl | h\n · show max (-|(-2 : ℝ)|) ((-2 : ℝ) - 2) < -1\n norm_num [abs_of_neg]\n · exact absurd h hne\n\n/-- In the toy, removing `S = 1` from `{f ≥ -1}` disconnects `M = 0` from every olde" + }, + { + "kind": "theorem", + "unqualified_name": "toy_death_level", + "line": 3379, + "source_header": "ent. -/\ntheorem toy_saddle_cut :\n (0 : ℝ) ∈ connectedComponentIn ({x | (-1 : ℝ) ≤ toyF x} \\ {1}) 0 ∧\n ∀ w ∈" + }, + { + "kind": "theorem", + "unqualified_name": "toy_f_M", + "line": 3383, + "source_header": ") ≤ toyF x} \\ {1}) 0, toyF w ≤" + }, + { + "kind": "theorem", + "unqualified_name": "toy_f_S", + "line": 3387, + "source_header": "m)\n\n/-- The toy's elder death l" + }, + { + "kind": "theorem", + "unqualified_name": "toy_needs_C2", + "line": 3391, + "source_header": "p.joinedLevels toyF 0 0) (-1) :=\n toy_capHyp.elder_death_level\n\ntheorem toy_f_M : toyF 0 = 0 := by\n show max (-|(0 : ℝ)|) ((0 : ℝ) - 2) = 0\n norm_num\n\ntheorem toy_f_S : toyF 1 = -1 := by\n show max (-|(1 : ℝ)|) ((1 : ℝ) - 2) = -1\n norm_num\n\n/-- Necessity of (C2). At the level `s = -3/2`, (C1) and (C3) hold, (C2) fails (the frontier point\n`1` has height `-1 > -3/2`), and the maximin level is not `-3/2`. -/\ntheorem toy" + }, + { + "kind": "theorem", + "unqualified_name": "toy_needs_C1", + "line": 3409, + "source_header": "h 1 (by rw [toy_frontier]; simp)\n rw [toy_f_S] at h1\n norm_num at h1\n · rintro ⟨-, hub⟩\n have hmem : (-1 : ℝ) ∈ connectionLevels toyF 0 0 :=\n ⟨3, toyRidge, toy_capHyp.older, toy_ridge_ge⟩\n have := hub hmem\n norm_num at this\n\n/-- Necessity of (C1). At the ceiling `b = -1/2`, (C2) and (C3) hold, (C1) fails (`f M = 0 > -1/2`),\nand the constant path at `M` shows that the maximin level is not `-1`. -/\ntheorem toy_ne" + }, + { + "kind": "theorem", + "unqualified_name": "toy_needs_C3", + "line": 3427, + "source_header": "um⟩\n rw [toy_f_M] at h1\n norm_num at h1\n · rintro ⟨-, hub⟩\n have hmem : (0 : ℝ) ∈ connectionLevels toyF 0 (-1 / 2) :=\n ⟨0, Path.refl 0, by rw [toy_f_M]; norm_num, fun t => by simp [toy_f_M]⟩\n have := hub hmem\n norm_num at this\n\n/-- Necessity of (C3). At the level `s = 5`, (C1) and (C2) hold and `z` is older, but no ridge stays\nat height `≥ 5` (it starts at `f M = 0`), and the maximin level is not `5`: the barrier at the true\nlevel `-1` exclud" + }, + { + "kind": "def", + "unqualified_name": "ridgeToyF", + "line": 3445, + "source_header": ".frontier_le x hx) (by norm_num),\n toy_capHyp.older, ?_, ?_⟩\n · rintro ⟨γ, hγ⟩\n have h0 := hγ 0\n rw [Path.source, toy_f_M] at h0\n norm_num at h0\n · rintro ⟨hmem, -⟩\n have h1 := toy_capHyp.ma" + }, + { + "kind": "theorem", + "unqualified_name": "ridgeToy_capHyp", + "line": 3449, + "source_header": "m at h1\n\n/-- The ridge toy: SP's normalization at `r = 1` with one transverse coordinate,\n`f (x, y) = x³/3 - x/4 - y²`, ridge `h = 0`, ridge derivative `F x = x² - 1/4`. -/\nnoncomputable def ridgeToyF (p : ℝ × ℝ) : ℝ := p.1 ^ 3 / 3 - p.1 / 4 - p.2 ^ 2\n\n/-- The ridge hypotheses of `ridge_capHyp` are jointly satisfiable. Here the g" + }, + { + "kind": "theorem", + "unqualified_name": "ridgeToy_saddle_strict", + "line": 3485, + "source_header": "by rw [← sq_abs, hy]; norm_num\n simp only [ridgeToyF, hy2]\n nlinarith [mul_nonneg (sub_nonneg.mpr hx2) (sq_nonneg x),\n mul_nonneg (by linarith : (0 : ℝ) ≤ x + 2) (by linarith : (0 : ℝ) ≤ 2 - x)]\n · simp\n · simp only [ridgeToyF]\n norm_num\n\n/--" + }, + { + "kind": "theorem", + "unqualified_name": "ridgeToy_joint", + "line": 3523, + "source_header": "^ 2 = 4 := by rw [← sq_abs, hy]; norm_num\n simp only [ridgeToyF, hy2]\n nlinarith [mul_nonneg (sub_nonneg.mpr hx2) (sq_nonneg x),\n mul_nonneg (by linarith : (0 : ℝ) ≤ x + 2) (by linarith : (0 : ℝ) ≤ 2 - x)]\n · simp only [ridgeToyF]\n norm_num\n\n/-! ### The ridge toy through the slice route -/\n\n/-- The ridge toy's joint derivative along the ridge `y = 0` is `D x = (x² - 1/4) · dx`. Its\ntransverse part vanishes (the ridge equation), and `D x (1, 0) = x² - 1/4 = F x`. -/\ntheorem ridgeToy_joint (x : ℝ) :\n HasFDer" + }, + { + "kind": "theorem", + "unqualified_name": "ridgeToy_slices", + "line": 3546, + "source_header": "hasDerivAt_pow 2 (0 : ℝ)\n have h1 := hu.comp_hasFDerivAt ((x, (0 : ℝ)) : ℝ × ℝ) (hasFDerivAt_fst (𝕜 := ℝ))\n have h2 := hv.comp_hasFDerivAt ((x, (0 : ℝ)) : ℝ × ℝ) (hasFDerivAt_snd (𝕜 := ℝ))\n convert h1.sub h2 using 1\n · funext p; simp [ridgeToyF]\n · simp\n\n/-- **The slice route is jointly satisfiable.** The ridge toy (`r = 1`, `h = 0`) meets every\ninput of `ridge_inputs_of_joint` and `ridge_capHyp_of_slices`, with `δ = 2` (each slice is\n`-y²` plus a constant), `w = 0`, `ω = 0`, and the curvature condition\n`2δ(b - s) = 2/3 < 16 = (2rδ - ω)²`. The combined theorems re-derive (C1)–(C3) and (C2⁺). -/\ntheorem ridgeToy_slices :\n CapHyp ridgeToyF (Icc (-2 * 1) (1 / 2" + }, + { + "kind": "def", + "unqualified_name": "spToyF", + "line": 3589, + "source_header": "4) (convex_closedBall (0 : ℝ) (2 * 1))).congr ?_\n intro y _\n simp only [ridgeToyF, Real.norm_eq_abs, sq_abs]\n ring\n · intro x _\n simp\n · intro x _\n simp\n · norm_num\n · simp only [ridgeToyF]\n norm_" + }, + { + "kind": "theorem", + "unqualified_name": "spToy_capHyp", + "line": 3594, + "source_header": "um\n\n\n/-- A field that meets SP's normalized hypotheses: `f (x, y) = x³/3 - x/4 - 12 y²`, so `m = 2`\n(`f_xxx = 2`), `δ = 24 > r m (8m - 5) = 22` at `r = 1`, and gap exactly `r³/6`. -/\nnoncomputable def spToyF (p : ℝ × ℝ) : ℝ := p.1 ^ 3 / 3 - p.1 / 4 - 12 * p.2 ^ 2\n\n/-- **`ridge_capHyp_sp` is not vacuous.** `spToyF` meets every hypothesis, with `h = 0`, `w = 0`,\n`F = x² - 1/4`, `m = 2` and `δ = 24`. -/\ntheorem spToy_capHyp :\n CapHyp spToyF (Icc" + }, + { + "kind": "theorem", + "unqualified_name": "spToy_normalized", + "line": 3654, + "source_header": "veOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n intro t _\n simp only [smul_eq_mul, zero_apply]\n ring\n · simp only [spToyF]\n norm_num\n\n\n/-- **`ridge_capHyp_normalized` is not vacuous.** `spToyF` meets every hypothesis, with\n`G0 = x² - 1/4` (so `|G0''| = 2 = m`) and gap exactly `1/6`. -/\ntheorem spToy_normalized :\n CapHyp spToyF (I" + }, + { + "kind": "def", + "unqualified_name": "h1ToyF", + "line": 3722, + "source_header": "caveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n i" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_capHyp", + "line": 3727, + "source_header": "o_apply]\n ring\n · simp only [spToyF]\n norm_num\n\n\n/-- A field meeting (H1): `f (x, y) = x³/3 - x/4 - 20 y²`, so `λ = 40 > 8 r m² = 32` at `r = 1`,\n`m = 2`, and gap exactly `r³/6`. -/\nnoncomputable def h1ToyF (p : ℝ × ℝ) : ℝ := p.1 ^ 3 / 3 - p.1 / 4 - 20 * p.2 ^ 2\n\n/-- **`ridge_capHyp_H1` is not vacuous.** `h1ToyF` meets every hypothesis, with a constant\ntransverse Hessian `-40`, `h = 0`, `w = 0`, `G0 = F = x² - 1/4`, `m = 2` and `λ = 40`. -/\ntheorem h1Toy_capHyp :\n CapHyp h1Toy" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_ridge_differentiable", + "line": 3812, + "source_header": "ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n intro t _\n simp only [smul_eq_mul, zero_apply]\n ring\n · simp only [h1ToyF]\n norm_num\n\n\n/-- **`ridge_differentiable` is not vacuous.** For `h1ToyF`, with `h = 0`, transverse gradient\n`G (x, y) = -40 y`, its constant derivative `DG = -40 · snd`, `δ = 40` and `U = (-3, 3)`, the\nstatement lists every hypothesis of `ridge_differentiable` at this instance, and its last\nconjunct is that theorem's conclusion, obtained by applying it. -/\ntheorem h1Toy_ridge_differentiable :\n IsOpen (Ioo (-3 : ℝ) 3) ∧ Icc (-2 * (1 : ℝ)) (2 * 1) ⊆ Ioo (-3) 3 ∧\n (∀ x ∈ Ioo (-3 : ℝ) 3,\n StrongConcaveOn (Metric.closedBall (0 : ℝ) (2 * 1)) 40 (fun y => h1ToyF (x, y))) ∧\n (∀ x ∈ Ioo (-3 : ℝ) 3, (0 : ℝ) ∈ Metric.closedBall (0 : ℝ) (2 * 1)) ∧\n (∀ x ∈ Ioo (-3 : ℝ) 3, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0) ∧\n (∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), (0 : ℝ) ∈ Metric.ball (0 : ℝ) (2 * 1)) ∧\n (∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), ∀ᶠ v in nhds (x, (0 : ℝ)),\n HasFDerivAt (fun y => h1ToyF (v.1, y)) (ContinuousLinearMap.mul ℝ ℝ (-40 * v.2)) v.2) ∧\n (∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1),\n HasStrictFDerivAt (fun p : ℝ × ℝ => ContinuousLinearMap.mul ℝ ℝ (-40 * p.2))\n (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) (x, 0)) ∧\n (∀ v : ℝ, ((((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) ∘L\n ContinuousLinearMap.inr ℝ ℝ ℝ) v v ≤ -40 * ‖v‖ ^ 2) ∧\n ∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), HasStrictFDerivAt (fun _ : ℝ => (0 : ℝ))" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_source", + "line": 3887, + "source_header": "-40 * p.2))\n (DG := fun _ => ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ)\n (h := fun _ => (0 : ℝ)) (U := Ioo (-3) 3) (r := 1) (δ := 40) (by norm_num) isOpen_Ioo hIU\n hconc hball hcrit hint hG (fun x _ => hGs (x, 0)) (fun _ _ => hneg)\n\n/-- **`ridge_capHyp_source` is not vacuous.** `h1ToyF` meets every source hypothesis on the full\ncollar `[-5/2, 5/2] × B̄(0, 2)` (`ε = 1/2`): joint derivative `(x² - 1/4, -40y)`, transverse gradient `-40y`\nwith derivative `-40 · snd`, constant transverse Hessian `-40`, `m = 2`, `λ = 40 > 32`, pins\n`(∓1/2, 0)` and gap `1/6`. The theorem then gives the ridge, and for `h = 0`, which meets L12\n(`F = x² - 1/4`), the cap with `M = (-1/2, 0)`. -/\ntheorem h1Toy_source :\n (∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - 1 / 2 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_C3", + "line": 3987, + "source_header": "nly [smul_eq_mul]\n simp\n · intro v\n have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n intro t _\n simp only [smul_eq_mul]\n simp\n\n/-- **`ridge_capHyp_C3` is not vacuous.** `h1ToyF` meets every hypothesis of `ridge_capHyp_C3`\non the collar `ε = 1/2`: besides the data of `h1Toy_source`, second derivative\n`D²f = diag(2x, -40)`, third derivatives `T a b = 2 a₁ b₁ · fst` (only `f_xxx = 2 ≥ 7/4` is nonzero,\nso every other block vanishes). The theorem then gives the ridge and the cap with `M = (-1/2, 0)`,\nwith L12 derived rather than supplied. -/\ntheorem h1Toy_C3 :\n (∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - 1 / 2 :" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_C4", + "line": 4132, + "source_header": "only [smul_eq_mul]\n simp\n · intro v\n have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n intro t _\n simp only [smul_eq_mul]\n simp\n\n/-- **`ridge_capHyp_C4` is not vacuous.** `h1ToyF` meets every hypothesis of `ridge_capHyp_C4`\non the collar `ε = 1/2`: the data of `h1Toy_C3`, with `f_xxx = 2` constant, so its derivative is `0`,\nboth fourth-order blocks vanish and (H2) holds with `n = 0`. The theorem gives the ridge and the cap with `M = (-1/2, 0)`, with\nneither L12 nor `f_xxx ≥ 7/4` supplied. -/\ntheorem h1Toy_C4 :\n (∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - 1 / 2" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_D", + "line": 4278, + "source_header": "mp only [smul_eq_mul]\n simp\n · intro v\n have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n intro t _\n simp only [smul_eq_mul]\n simp\n\n/-- **`ridge_capHyp_D` is not vacuous.** `h1ToyF` meets every hypothesis of `ridge_capHyp_D` with\n`ε₀ = 1/2`. `T3` is constant, so `T4 = 0` and `K = 0`, and `|f_xxx| = 2 = m` on the pin segment.\nThe theorem chooses the collar width itself. It gives the ridge on `(−2 − ε, 2 + ε)` for some\n`ε > 0` and the cap with `M = (−1/2, 0)`, from hypotheses on `D` and qualitative collar data only. -/\ntheorem h1Toy_D :\n (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 *" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_E", + "line": 4400, + "source_header": "e hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by\n intro x\n have := slice_hasFDerivAt (hDf (x, 0))\n convert this using 1\n ext\n simp\n obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)\n exact ⟨⟨ε, hε, hex⟩, hC⟩\n\n\n/-- **`ridge_capHyp_E` is not vacuous.** `h1ToyF` is a polynomial, so it is `C⁴` on `U = ℝ²`.\nIts third derivative is `D³f[a, b, c] = 2 a.1 b.1 c.1` and its fourth derivative vanishes, so\n`m = 2` and `n = 0`; `D²f[(0, v), (0, v)] = -40 v²` gives `λ = 40`. From these hypotheses on `D`\nalone, the theorem gives the ridge on `(-2 - ε, 2 + ε)` for some `ε > 0` and the cap with\n`M = (-1/2, 0)`. -/\ntheorem h1Toy_E :\n (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2" + }, + { + "kind": "def", + "unqualified_name": "quarticToyF", + "line": 4503, + "source_header": "ave hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by\n intro x\n have := slice_hasFDerivAt (hDf (x, 0))\n convert this using 1\n ext\n simp\n obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)\n exact ⟨⟨ε," + }, + { + "kind": "theorem", + "unqualified_name": "quarticToy_E", + "line": 4510, + "source_header": "`q(x) = (x² - 1/4)²/480` vanishes to second\norder at both pins, so they stay critical and the gap stays `1/6`, while `f_xxx = 2 + x/20` varies\nand `D⁴f = 1/20 ≠ 0`. -/\nnoncomputable def quarticToyF (p : ℝ × ℝ) : ℝ :=\n p.1 ^ 3 / 3 - p.1 / 4 - 20 * p.2 ^ 2 + (p.1 ^ 2 - 1 / 4) ^ 2 / 480\n\n/-- **`ridge_capHyp_E` away from the degenerate face.** On `quarticToyF` the third derivative\n`f_xxx = 2 + x/20` varies, the fourth derivative `D⁴f = 1/20` is nonzero, and (H2) holds with\nequality, `rn = 1/20` (`r = 1`, `n = 1/20`); `|f_xxx| ≤ 81/40 = m` on the pin segment, and (H1) holds\nas `8m² = 32.805 < 40 = λ`. So `fxxx_lower`'s estimate is used with `n > 0` and the collar bound\n`K` is positive, unlike `h1Toy_E` (where `D⁴f = 0`). The theorem gives the ridge on\n`(-2 - ε, 2 + ε)` for some `ε > 0` and the cap with `M = (-1/2, 0)`. -/\ntheorem quarticToy_E :\n (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - ε : ℝ) (2" + }, + { + "kind": "theorem", + "unqualified_name": "of_const_mul", + "line": 4648, + "source_header": "`f(M) − f(S) = k r³`.\n`ridge_capHyp_E` is the case `k = 1/6`. A positive factor `f ↦ c f` multiplies every derivative\nbound and the transverse curvature by `c`, and changes neither the critical points nor the cap. -/\n\nnamespace Ca" + }, + { + "kind": "theorem", + "unqualified_name": "hasFDerivAt_zero_const_mul_iff", + "line": 4665, + "source_header": "e x hx := le_of_mul_le_mul_left (H.frontier_le x hx) hc\n older := lt_of_mul_lt_mul_left H.older hc.le\n ridge := by\n obtain ⟨γ, hγ⟩ := H.ridge\n exact ⟨γ, fun t => le_of_mul_le_mul_left (hγ t) hc⟩\n\nend CapHyp\n\nsection GapK\n\nvariable {E : Type" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedFDeriv_const_mul_of_isOpen", + "line": 4678, + "source_header": "t φ (0 : E →L[ℝ] ℝ) y := by\n constructor\n · intro h\n have h' := h.const_mul c⁻¹\n rw [smul_zero] at h'\n exact h'.congr_of_eventuallyEq\n (Filter.Eventually.of_forall fun y => (inv_mul_cancel_left₀ hc (φ y)).symm)\n · intro h\n have h' := h.const_mul c\n rwa [smul_zero] at h'\n\n/-- On an open set where `f ∈ C⁴`, the derivatives of order `≤" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_K", + "line": 4687, + "source_header": "f U) (c : ℝ) {i : ℕ} (hi : i ≤ 4) {p : ℝ × E} (hp : p ∈ U) :\n iteratedFDeriv ℝ i (fun q => c * f q) p = c • iteratedFDeriv ℝ i f p := by\n have hfa : ContDiffAt ℝ i f p :=\n (hf.contDiffAt (hU.mem_nhds hp)).of_le (by exact_mod_cast hi)\n exact iteratedFDeriv_const_smul_apply' (a := c) hfa\n\n/-- **The cap for every gap `k > 0`** (P §7's event `G_r`). With the pin gap\n`f(M) − f(S) = k r³`, the hypotheses `(4/(3k)) r m² < λ` and `r n ≤ 3k/10` give the conclusion of\n`ridge_capHyp_E`. That theorem is the case `k = 1/6`; the proof applies it to `f / (6k)`. -/\ntheorem ridge_capHyp_K [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}\n {r k m n lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 f U)\n (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |iteratedFDeriv ℝ 3 f p ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] -\n s₁ * s₂ * s₃ * iteratedFDeriv ℝ 3 f p ![(1, 0), (1, 0), (1, 0)]| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ m)\n (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ n)\n (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,\n |iteratedFDeriv ℝ 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ n * ‖v‖)\n (hH2 : r * n ≤ 3 * k / 10)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)\n (hH1 : 4 / (3 * k) * r * m ^ 2 < lam)\n (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :\n ∃ ε, 0 < ε ∧\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r /" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_norm_K", + "line": 4794, + "source_header": ", (hasFDerivAt_zero_const_mul_iff hc.ne').1 (hh x hx).2⟩⟩\n · intro h hh\n obtain ⟨h1, h2, hC, hfr⟩ := hcap h fun x hx =>\n ⟨(hh x hx).1, (hasFDerivAt_zero_const_mul_iff hc.ne').2 (hh x hx).2⟩\n exact ⟨h1, h2, hC.of_const_mul hc, fun x hx hne => lt_of_mul_lt_mul_left (hfr x hx hne) hc.le⟩\n\n/-- **P §7's `G_r` with operator norms.** If `‖D³f‖ ≤ M3` and `‖D⁴f‖ ≤ M4` on\n`D = [−2r, 2r] × B̄(0, 2r)`, then `(4/(3k)) r M3² < λ` and `r M4 ≤ 3k/10` give the cap. Each\npartial-block bound used by `ridge_capHyp_K` is at most the operator norm (`block_of_norm`). -/\ntheorem ridge_capHyp_norm_K [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}\n {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 f U)\n (h3 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖iteratedFDeriv ℝ 3 f p‖ ≤ M3)\n (h4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖iteratedFDeriv ℝ 4 f p‖ ≤ M4)\n (hH2 : r * M4 ≤ 3 * k / 10)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)\n (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam)\n (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :\n ∃ ε, 0 < ε ∧\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedFDeriv_three_swap₁₂", + "line": 4866, + "source_header": "ng the symmetry of\n`D³f`, which holds for `f ∈ C³` (`iteratedFDeriv_three_swap₁₂`, `iteratedFDeriv_three_swap₂₃`).\n`ridge_capHyp_blocks` then states the cap under CAP's hypotheses as written. -/\n\nsection PartialBlock\n\nopen Filter Topology\n\nvariable {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F]\n\n/-- The third derivative of a `C" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedFDeriv_three_swap₂₃", + "line": 4881, + "source_header": "eratedFDeriv ℝ 3 f p ![x, y, c] =\n iteratedFDeriv ℝ 2 (fderiv ℝ f) p ![x, y] c := by\n intro x y\n rw [iteratedFDeriv_succ_apply_right]\n have e : Fin.init ![x, y, c] = ![x, y] := by ext i; fin_cases i <;> rfl\n rw [e]\n rfl\n rw [hr, hr, IsSymmSndFDerivAt.iteratedFDeriv_cons (hf := hs)]\n\n/-- The third derivative of a `C³` function is symmetric in its last two slots: h" + }, + { + "kind": "theorem", + "unqualified_name": "block_of_partial", + "line": 4910, + "source_header": "cc_apply_left]\n have t1 : Fin.tail ![a, b, c] = ![b, c] := by ext i; fin_cases i <;> rfl\n have t2 : Fin.tail ![a, c, b] = ![c, b] := by ext i; fin_cases i <;> rfl\n simp only [Matrix.cons_val_zero, t1, t2]\n rw [← key, ← key, hev.fderiv_eq]\n\nvariable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]\n\n/-- **CAP's partial blocks give the block inequality.** For a symmetric trilinear form `B` on\n`ℝ × E`, bounds by `m` on the three partial blocks with `c = 1, 2, 3` transverse slots, namely\n`|B[(0, y), e, e]| ≤ m‖y‖`, `|B[(0, y₁), (0, y₂), e]| ≤ m‖y₁‖‖y₂‖` and\n`|B[(0, y₁), (0, y₂), (0, y₃)]| ≤ m‖y₁‖‖y₂‖‖y₃‖` with `e = (1, 0)`, give the block inequality `hT` of\n`ridge_capHyp_E` and `ridge_capHyp_K`. The proof expands `B[(s₁, y₁), (s₂, y₂), (s₃, y₃)]`\nmultilinearly: the seven mixed terms are partial blocks in some slot order, symmetry brings each to\nthe canonical order, and their bounds add up to `m(Π(|sᵢ| + ‖yᵢ‖) − Π|sᵢ|)`. No sign of `m` is\nassumed. -/\ntheorem block_of_partial {B : ContinuousMultilinearMap ℝ (fun _ : Fin 3 => ℝ × E) ℝ} {m : ℝ}\n (hs₁₂ : ∀ a b c : ℝ × E, B ![a, b, c] = B ![b, a, c])\n (hs₂₃ : ∀ a b c : ℝ × E, B ![a, b, c] = B ![a, c, b])\n (k₁ : ∀ y : E, |B ![((0 : ℝ), y), (1, 0), (1, 0)]| ≤ m * ‖y‖)\n (k₂ : ∀ y₁ y₂ : E, |B ![((0 : ℝ), y₁), (0, y₂), (1, 0)]| ≤ m" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_blocks", + "line": 5004, + "source_header": "_)\n · rw [abs_mul]; exact mul_le_mul_of_nonneg_left b₃ (abs_nonneg _)\n · exact b₄\n · rw [abs_mul, abs_mul]; exact mul_le_mul_of_nonneg_left b₅ (by positivity)\n · rw [abs_mul]; exact mul_le_mul_of_nonneg_left b₆ (abs_nonneg _)\n · rw [abs_mul, abs_mul]; exact mul_le_mul_of_nonneg_left b₇ (by positivity)\n\n/-- **The cap under CAP (1) as written.** `f ∈ C⁴` on an open `U ⊇ D`; CAP's partial-block bounds\non `D` with `M3` for `c = 1, 2, 3` transverse slots, and for `c = 0` on the pin segment only (CAP\nbounds it on all of `D`); the two partial blocks of the fourth derivative that the proof uses,\n`c = 0` and `c = 1`, with `M4`; the transverse curvature `λ` at `M`; and (1),\n`(4/(3k)) r M3² < λ` and `r M4 ≤ 3k/10`, for the pin gap `k r³`. The conclusion is that of\n`ridge_capHyp_K`. -/\ntheorem ridge_capHyp_blocks [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}\n {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 f U)\n (h30 : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ M3)\n (h31 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y : E,\n |iteratedFDeriv ℝ 3 f p ![(0, y), (1, 0), (1, 0)]| ≤ M3 * ‖y‖)\n (h32 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ : E,\n |iteratedFDeriv ℝ 3 f p ![(0, y₁), (0, y₂), (1, 0)]| ≤ M3 * ‖y₁‖ * ‖y₂‖)\n (h33 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ y₃ : E,\n |iteratedFDeriv ℝ 3 f p ![(0, y₁), (0, y₂), (0, y₃)]| ≤ M3 * ‖y₁‖ * ‖y₂‖ * ‖y₃‖)\n (h40 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ M4)\n (h41 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,\n |iteratedFDeriv ℝ 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ M4 * ‖v‖)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)\n (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam) (hH2 : r * M4 ≤ 3 * k / 10)\n (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :\n ∃ ε, 0 < ε ∧\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) =" + }, + { + "kind": "def", + "unqualified_name": "mixedToyF", + "line": 5048, + "source_header": "₃ => ?_) h30 h40 h41 hH2 hlam\n hH1 hM hS hnorm\n have hp3 : ContDiffAt ℝ 3 f p := (hf.contDiffAt (hU.mem_nhds (hDU hp))).of_le (by norm_num)\n exact block_of_partial (iteratedFD" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_blocks", + "line": 5053, + "source_header": "(h31 p hp) (h32 p hp) (h33 p hp) s₁ s₂ s₃ y₁ y₂ y₃\n\nend PartialBlock\n\n/-- A toy with a nonzero mixed block. `x³/3 − x/4 − 20y²` plus `xy²`: the pins and the gap `1/6` are\nunchanged, and `∂_x D_y² f = 2`. -/\nnoncomputable def mixedToyF (p : ℝ × ℝ) : ℝ :=\n p.1 ^ 3 / 3 - p.1 / 4 - 20 * p.2 ^ 2 + p.1 * p.2 ^ 2\n\n/-- **`ridge_capHyp_blocks` with a nonzero mixed block.** On `mixedToyF` the partial blocks of\n`D³f` are `2` (`c = 0`), `0` (`c = 1`), `2` (`c = 2`, the mixed block `∂_x D_y² f`) and `0`\n(`c = 3`), so `M3 = 2`; `D⁴f = 0`, so `M4 = 0`; and `λ = 41`. CAP (1) holds with `k = 1/6`, `r = 1`:\n`8 M3² = 32 < 41` and `r M4 = 0 ≤ 1/20`. Unlike `h1Toy_E` and `quarticToy_E`, the block inequality\n`hT` is not trivial here, since the mixed terms of `D³f` do not vanish. -/\ntheorem mixedToy_blocks :\n (∃ ε > 0, ∃ h : ℝ →" + }, + { + "kind": "theorem", + "unqualified_name": "addCircle_locallyConnectedSpace", + "line": 5184, + "source_header": "hε, hex, hcap⟩ := hsrc\n have hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => mixedToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by\n intro x\n have := slice_hasFDerivAt (hDf (x, 0))\n convert this using 1\n ext\n simp\n obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)\n exact ⟨⟨ε, hε, hex⟩, hC⟩\n\n/-! ### v2.6: the cap and the elder death level on the torus, under CAP (1)\n\nP §7 applies the cap theorem to the periodic lift of the field on `(ℝ/Lℤ)^d`, in a contact frame\nwhose first axis joins the pins. `torus_capHyp_blocks` composes `ridge_capHyp_blocks` (v2.5) with\n`CapHyp.toTorus` and `CapHyp.map_saddle` for any frame `φ : ℝ × E ≃ₜ ℝ^d`. Then\n`torus_elder_death_level_blocks` adds `elder_death_level_peak` on the torus, which is compact\n(`L > 0`) and locally connected (`torus_loca" + }, + { + "kind": "theorem", + "unqualified_name": "torus_locallyConnectedSpace", + "line": 5198, + "source_header": "ly connected: its topology is coinduced by the covering map from\n`ℝ`, and local connectedness passes to coinduced topologies. -/\ntheorem addCircle_locallyConnectedSpace (L : ℝ) : LocallyConnectedSp" + }, + { + "kind": "theorem", + "unqualified_name": "torus_capHyp_blocks", + "line": 5208, + "source_header": "cted spaces. -/\ntheorem torus_locallyConnectedSpace (L : ℝ) (d : ℕ) :\n LocallyConnectedSpace (Fin d → AddCircle L) :=\n haveI := addCircle_locallyConnectedSpace L\n Pi.locallyConnectedSpace_of_finite_not_preconnectedSpace (Set.toFinite _)\n\nsection Torus\n\nvariable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]\n\n/-- **The cap on the torus under CAP (1).** Let `φ : ℝ × E ≃ₜ ℝ^d` be any frame and let\n`g = f ∘ torusCover L d ∘ φ` be the lift of a function `f` on the torus `(ℝ/Lℤ)^d`. If `g` meets\nthe hypotheses of `ridge_capHyp_blocks` (CAP §1's (1) with its partial-block norms, in the frame\n`φ`), then `f` satisfies (C1)–(C3) on the image of the cap in the torus, with `M` and `S` the images\nof the pins, and (C2⁺): every other frontier point of the image is strictly below `f(S)`. -/\ntheorem torus_capHyp_blocks [FiniteDimensional ℝ E] {L : ℝ} {d : ℕ}\n (φ : ℝ × E ≃ₜ (Fin d → ℝ)) {f : (Fin d → AddCircle L) → ℝ} {g : ℝ × E → ℝ}\n (hg : ∀ p, g p = f (torusCover L d (φ p))) {U : Set (ℝ × E)}\n {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 g U)\n (h30 : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 g (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ M3)\n (h31 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y), (1, 0), (1, 0)]| ≤ M3 * ‖y‖)\n (h32 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (1, 0)]| ≤ M3 * ‖y₁‖ * ‖y₂‖)\n (h33 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ y₃ : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (0, y₃)]| ≤ M3 * ‖y₁‖ * ‖y₂‖ * ‖y₃‖)\n (h40 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv ℝ 4 g p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ M4)\n (h41 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,\n |iteratedFDeriv ℝ 4 g p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ M4 * ‖v‖)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 g (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)\n (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam) (hH2 : r * M4 ≤ 3 * k / 10)\n (hM : fderiv ℝ g (-r / 2, 0) = 0) (hS : fderiv ℝ g (r / 2, 0) = 0)\n (hnorm : g (-r / 2, 0) - g (r / 2, 0) = k * r ^ 3) :\n ∃ z, CapHyp f ((torusCover L d ∘ φ) '' (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)))" + }, + { + "kind": "theorem", + "unqualified_name": "torus_elder_death_level_blocks", + "line": 5251, + "source_header": "φ) := funext hg\n subst hgf\n have hK : IsCompact (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) :=\n isCompact_Icc.prod (isCompact_closedBall 0 (2 * r))\n exact ⟨_, hC.toTorus φ hK, CapHyp.map_saddle ((torusCover_continuous L d).comp φ.continuous)\n ((torusCover_isOpenMap L d).comp φ.isOpenMap) hK hSf⟩\n\n/-- **The elder death level on the torus under CAP (1).** For `L > 0` and a continuous `f` on\n`(ℝ/Lℤ)^d` whose lift in the frame `φ` meets CAP §1's (1), the largest level at which the\ncomponent of the image of `M` contains a strictly higher local maximum is `f` at the image of `S`.\nThis is `elder_death_level_peak` on the torus, which is compact and locally connected. -/\ntheorem torus_elder_death_level_blocks [FiniteDimensional ℝ E] {L : ℝ} [Fact (0 < L)] {d : ℕ}\n (φ : ℝ × E ≃ₜ (Fin d → ℝ)) {f : (Fin d → AddCircle L) → ℝ} (hfc : Continuous f)\n {g : ℝ × E → ℝ} (hg : ∀ p, g p = f (torusCover L d (φ p))) {U : Set (ℝ × E)}\n {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 g U)\n (h30 : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 g (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ M3)\n (h31 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y), (1, 0), (1, 0)]| ≤ M3 * ‖y‖)\n (h32 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (1, 0)]| ≤ M3 * ‖y₁‖ * ‖y₂‖)\n (h33 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ y₃ : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (0, y₃)]| ≤ M3 * ‖y₁‖ * ‖y₂‖ * ‖y₃‖)\n (h40 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv ℝ 4 g p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ M4)\n (h41 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,\n |iteratedFDeriv ℝ 4 g p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ M4 * ‖v‖)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 g (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖" + }, + { + "kind": "def", + "unqualified_name": "circleChart", + "line": 5285, + "source_header": "atest (CapHyp.olderPeakLevels f (torusCover L d (φ (-r / 2, 0))))\n (f (torusCover L d (φ (r / 2, 0)))) := by\n obtain ⟨z, H, -⟩ := torus_capHyp_blocks φ hg hr hk hU hDU hf h30 h31 h32 h33 h40 h41 hlam hH1\n hH2 hM hS hno" + }, + { + "kind": "theorem", + "unqualified_name": "circleChart_continuous", + "line": 5290, + "source_header": "exact H.elder_death_level_peak hfc rfl\n\nend Torus\n\n/-- A continuous chart of the circle near `0`: `circ" + }, + { + "kind": "theorem", + "unqualified_name": "circleChart_coe", + "line": 5294, + "source_header": "L/4` (`circleChart_coe`). -/\nnoncomputable def circleChart (L : ℝ) (θ : AddCircle L) : ℝ :=\n ‖θ + ((L / 4 : ℝ) : AddCircle L)‖ - L / 4\n\n/-- `circleChart` is continuous. -/\ntheor" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_hasFDerivAt", + "line": 5306, + "source_header": "have h1 := (abs_le.mp hx).1\n have h2 := (abs_le.mp hx).2\n have hn : ‖((x + L / 4 : ℝ) : AddCircle L)‖ = |x + L / 4| :=\n (AddCircle.norm_coe_eq_abs_iff L hL.ne').mpr (by\n rw [abs_of_nonneg (by linarith), abs_of_pos hL]; linarith)\n unfold circleChart\n rw [← AddCircle" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_contDiff", + "line": 5324, + "source_header": "sFDerivAt.const_mul (HasFDerivAt.pow hf 3) (1 / 3))\n (HasFDerivAt.const_mul" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_iteratedFDeriv_two", + "line": 5327, + "source_header": "nst_mul (HasFDerivAt.pow hs 2) 20))\n (HasFDerivAt.mul hf (HasFDerivAt.pow hs 2))\n convert h1 using 1\n · funext q\n simp only [mixedToyF, Pi.sub_apply, Pi.add_apply, Pi.mul_apply]\n ring\n · ext <;> simp\n ring\n\n/-- `mixedToyF` is `C⁴`. -/\ntheorem mixedToy_contDiff : ContDif" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_iteratedFDeriv_three", + "line": 5365, + "source_header": "h2.smul_const (ContinuousLinearMap.snd ℝ ℝ ℝ))\n have hfd : fderiv ℝ mixedToyF = fun p => (p.1 ^ 2 - 1 / 4 + p.2 ^ 2) •\n ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * p.2 + 2 * p.1 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ :=\n funext fun p => (mixedToy_hasFDerivAt p).fderiv\n rw [iteratedFDeriv_two_apply, hfd, hD2.fderiv]\n simp" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_iteratedFDeriv_four", + "line": 5384, + "source_header": "2 * (m 1).2 * (m 2).2) • ContinuousLinearMap.fst ℝ ℝ ℝ +\n (2 * ((m 1).1 * (m 2).2 + (m 1).2 * (m 2).1)) •\n ContinuousLinearMap.snd ℝ ℝ ℝ).hasFDerivAt" + }, + { + "kind": "def", + "unqualified_name": "torusToyF", + "line": 5398, + "source_header": "(Fin.tail m)) =\n fun _ => iteratedFDeriv ℝ 3 mixedToyF x (Fin.tail m) := by\n funext y; rw [mixedToy_iteratedFDeriv_three, mixedToy_iteratedFDeriv_three]\n have hg : HasFDerivAt (fun y => iteratedFDeriv ℝ 3 mixedToyF y (" + }, + { + "kind": "theorem", + "unqualified_name": "torusToy_elder", + "line": 5403, + "source_header": "exact hasFDerivAt_const _ _\n rw [hg.fderiv]\n simp\n\n/-- A function on the torus `(ℝ/16ℤ)²` whose lift equals `mixedToyF` on `(−4, 4)²`:\n`mixedToyF` read through `circleChart` in each coordinate. It is continuous. -/\nnoncomputable def torusToyF (θ : Fin 2 → AddCircle (16 : ℝ)) : ℝ :=\n mixedToyF (circleChart 16 (θ 0), circleChart 16 (θ 1))\n\n/-- **A concrete instance of the elder death level on the torus.** On `(ℝ/16ℤ)²`, with the standard\nframe `ℝ × ℝ ≃ₜ ℝ²`, the lift of `torusToyF` agrees with `mixedToyF` near the cap, so it meets\nCAP (1) with `r = 1`, `k = 1/6`, `M3 = 2`, `M4 = 0` and `λ = 41`. `torus_elder_death_level_blocks`\nthen gives the death level of the class born at the image of `M = (−1/2, 0)`: it is t" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:frontiers/cap_first_exit_lean_20261002", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "frontiers/cap_first_exit_lean_20261002", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "frontiers/cap_first_exit_lean_20261002/CapFirstExit.lean", + "sha256": "040aa91fcbdf25ccdaced1c828dd779318217a7c41ac928f87e8d17a8d3c3ef0", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "path_meets_frontier", + "line": 55, + "source_header": "]\n\n/-! ### First exit -/\n\n/-- First exit along a path. A path from a point of `C` to a point outside `C` meets the frontier\nof `C`. -/\ntheorem path_meets_frontier {C : Set X} {x y : X} (γ : Path x y) (hx : x ∈ C) (hy : y ∉ C) :\n ∃ t : I, γ t ∈ front" + }, + { + "kind": "theorem", + "unqualified_name": "preconnected_subset_of_frontier_disjoint", + "line": 69, + "source_header": "C ht⟩\n\n/-- First exit for connected sets. A preconnected set that contains a point of `C` and does not\nmeet the frontier of `C` lies inside `C`. No path-connectedness is needed. -/\ntheorem preconnected_subset_of_frontier_disjoint {C K : Set X} (hK : IsPreconnected K) {M : X}\n (hMK : M ∈ K) (hMC : M ∈ C) (hfr : ∀ x ∈ K, x ∉ frontier C)" + }, + { + "kind": "structure", + "unqualified_name": "CapHyp", + "line": 84, + "source_header": "t C hx)\n\n/-! ### The cap hypotheses -/\n\n/-- The cap hypotheses (C1)–(C3) for a local maximum `M` of height `b`, a separating level `s`,\nand an older point `z`. -/\nstructure CapHyp (f : X → ℝ) (C : Set X) (M z : X) (b s : ℝ) : Prop where\n /-- (C1) `M` lies in the cap. -/\n mem : M ∈ C\n /-- (C1) The ceiling: `f ≤ b` on the cap (L16). -/\n ceiling : ∀ x ∈ C, f x ≤ b\n /-- (C2) The frontier bound: `f ≤ s` on the frontier of the cap (L17–L19). -/\n frontier_le : ∀ x ∈ frontier C, f x ≤ s\n /-- (C3) The older endpoint: `f z > b` (L17). -/\n older : b < f z\n /-- (C3) The ridge: a path from `M` to `z` along which `f ≥ s` (L20). -/\n ridge : ∃ γ : Path" + }, + { + "kind": "theorem", + "unqualified_name": "s_le_f_M", + "line": 104, + "source_header": "} {M z : X} {b s : ℝ}\n\n/-- `M` itself is at height at least `s` (the ridge starts at `M`). -/\ntheorem s_le_f_M (H : CapHyp" + }, + { + "kind": "theorem", + "unqualified_name": "barrier", + "line": 109, + "source_header": "idge\n simpa using hγ 0\n\n/-! ### The maximin level `d_f(M)` (L21) -/\n\n/-- The upper barrier. Every path from `M` to a point strictly above `b` passes through a point\nof height at most `s`, whatever the path does outside `C`. -/\ntheorem barrier (H : CapHyp f C M z b s) {w : X} (hw : b < f w) (γ : Path M w)" + }, + { + "kind": "def", + "unqualified_name": "connectionLevels", + "line": 121, + "source_header": "ontier_le _ ht⟩\n\nend CapHyp\n\n/-- The connection levels of `M`: heights `m` such that some path from `M` to a point strictly\nabove `b` stays at height at least `m`. Its supremum is the maximin level `d_f(M)` of L21. -/\ndef connectionLevels (f : X" + }, + { + "kind": "theorem", + "unqualified_name": "maximin_isGreatest", + "line": 130, + "source_header": ": Set X} {M z : X} {b s : ℝ}\n\n/-- The maximin level is attained and equals `s` (L21). -/\ntheorem maximin_isGreatest (H : CapHyp f C M z b s) :\n IsGrea" + }, + { + "kind": "theorem", + "unqualified_name": "maximin_eq", + "line": 139, + "source_header": "er hw γ\n exact (hγ t).trans ht\n\n/-- `d_f(M) = s`, as a supremum (L21). -/\ntheorem maximin_eq (H : CapHyp f C M z b s) :" + }, + { + "kind": "theorem", + "unqualified_name": "component_separated", + "line": 143, + "source_header": "=\n H.maximin_isGreatest.csSup_eq\n\n/-! ### Superlevel components: the persistence filtration (L22) -/\n\n/-- Component separation. If `U` avoids the frontier of `C`, the connected component of `M` in\n`U` lies in `C`, so it contains no point strictly above `b`. -/\ntheorem component_separated (H : CapHyp f C M z b s) {U : Set X}\n (hU : ∀ x ∈ frontier C, x ∉ U) {w : X} (hw : w" + }, + { + "kind": "theorem", + "unqualified_name": "component_joined", + "line": 159, + "source_header": "entIn_subset U M hx)) hw)\n\nend CapHyp\n\n/-- Component joining. If a path from `M` to `z` stays in `U`, then `z` lies in the connected\ncomponent of `M` in `U`. -/\ntheorem component_joined {U : Set X} {M z : X} (γ : Path M z) (hγ : ∀ t, γ t" + }, + { + "kind": "theorem", + "unqualified_name": "elder_merge_iff_closed", + "line": 173, + "source_header": "X → ℝ} {C : Set X} {M z : X} {b s : ℝ}\n\n/-- **Elder merge, closed superlevel filtration `{f ≥ h}`** (the filtration of L22). The connected\ncomponent of `M` in `{f ≥ h}` contains a point strictly above `b` if and only if `h ≤ s`. -/\ntheorem elder_merge_iff_closed (H : CapHyp f C M z b s) (h : ℝ) :\n (∃ w ∈ connectedComp" + }, + { + "kind": "theorem", + "unqualified_name": "elder_merge_iff_open", + "line": 191, + "source_header": "(fun t => le_trans hhs (hγ₀ t)), H.older⟩\n\n/-- **Elder merge, open superlevel filtration `{f > h}`.** The connected component of `M` in\n`{f > h}` contains a point strictly above `b` if and only if `h < s`. -/\ntheorem elder_merge_iff_open (H : CapHyp f C M z b s) (h : ℝ) :\n (∃ w ∈ connectedCo" + }, + { + "kind": "def", + "unqualified_name": "joinedLevels", + "line": 209, + "source_header": "t => lt_of_lt_of_le hhs (hγ₀ t)), H.older⟩\n\n/-- The set of levels at which the class born at `M` is joined to an older point. -/\ndef joi" + }, + { + "kind": "theorem", + "unqualified_name": "elder_death_level", + "line": 213, + "source_header": "onnectedComponentIn {x | h ≤ f x} M, b < f w}\n\n/-- **Elder death level.** In the closed superlevel filtration, the largest level at which the\ncomponent of `M` contains an older point exists and equals `s`, whatever `f` does outside the cap.\nThis is the death level of the class born at `M` in L22. -/\ntheorem elder_death_level (H : CapHyp f" + }, + { + "kind": "theorem", + "unqualified_name": "path_through_saddle", + "line": 219, + "source_header": "fun _ hh => (H.elder_merge_iff_closed _).mp hh⟩\n\n/-! ### The merging saddle -/\n\n/-- Every path from `M` to a point strictly above `b` that stays in `{f ≥ s}` passes through `S`,\nwhen `S` is the only frontier point at height `s` (C2⁺, L19). The statement says something only when\n`M ≠ S`, as in the source, where the pins are distinct. -/\ntheorem path_through_saddle (H : CapHyp f C M z b s) {S : X}\n (hS : ∀ x ∈ frontier C, x ≠ S → f x < s) {w : X} (hw : b < f w) (γ : P" + }, + { + "kind": "theorem", + "unqualified_name": "saddle_cut", + "line": 235, + "source_header": "have h1 := hS _ ht hne\n have h2 := hγ t\n linarith\n\n/-- **`S` is a cut point at the death level.** Assume (C2⁺) and `M ≠ S`. Then `M` lies in its own\ncomponent of `{f ≥ s} \\ {S}`, so the statement is not vacuous, and that component contains no\npoint strictly above `b`. By contrast, `{f ≥ s}` itself joins `M` to an older point\n(`elder_merge_iff_closed` at `h = s`). Removing `S` therefore disconnects `M` from every older\npoint at the death level. -/\ntheorem saddle_cut (H : CapHyp f C M z b s) {S : X}\n (hS : ∀ x ∈ frontier C, x ≠ S → f x < s) (hMS : M ≠ S) :\n M ∈ connectedComponentIn ({x | s ≤ f x} \\ {S}) M ∧\n ∀ w ∈" + }, + { + "kind": "theorem", + "unqualified_name": "congr", + "line": 251, + "source_header": "h3 := hS x hx h2\n have h4 : s ≤ f x := h1\n linarith\n\n/-! ### Exterior invariance -/\n\n/-- **Exterior invariance.** Any `g` that agrees with `f` on the closure of the cap and along one\nridge path satisfies the same cap hypotheses. Every conclusion above (maximin level, elder merge\nlevels, death level, saddle cut) therefore holds for `g` with the same `s`, however `g` behaves\nelsewhere: remote saddles, high corridors and re-entries change nothing. -/\ntheorem congr {g : X → ℝ} (H : CapHyp f C M z b s) (γ₀ : Path M z) (hγ₀ : ∀ t, s ≤ f (γ₀ t))\n (hgC : ∀ x ∈ closure C, g x = f x) (hgγ : ∀ t," + }, + { + "kind": "theorem", + "unqualified_name": "isClosed_connectedComponentIn", + "line": 272, + "source_header": "ridge := ⟨γ₀, fun t => (hgγ t).symm ▸ hγ₀ t⟩\n\nend CapHyp\n\n/-! ### The elder-rule interface on a compact, locally connected space\n\nThe elder rule pairs the class born at `M` with the level at which its superlevel component first\ncontains a strictly higher local maximum (an older class). On a compact, locally connected space\nwith continuous `f` (a closed manifold, in particular the torus), the following theorems identify\nthat level as `s`. -/\n\n/-- A connected component of a closed set is closed. -/\ntheorem isClosed_connectedComponentIn {F : Set X} (hF :" + }, + { + "kind": "theorem", + "unqualified_name": "older_peak", + "line": 294, + "source_header": "CapHyp\n\nvariable {f : X → ℝ} {C : Set X} {M z : X} {b s : ℝ}\n\n/-- **An older peak below the death level.** For every level `h ≤ s`, the component of `M` in\n`{f ≥ h}` contains a point `p` with `f p > b` that maximizes `f` over the component and is a local\nmaximum of `f` on `X`: the older class that absorbs the class born at `M`. -/\ntheorem older_peak [CompactSpace X] [LocallyConnectedSpace X] (H : CapHyp f C M z b s)\n (hf : Continuous f) {h : ℝ} (hh : h ≤ s) :\n ∃ p ∈ connectedComponentIn {x | h ≤ f x} M, b < f p ∧ IsLocalMax f" + }, + { + "kind": "theorem", + "unqualified_name": "elder_alive", + "line": 319, + "source_header": "em_connectedComponentIn hpU))\n (fun x hx => hmax x (hVK hx))\n\n/-- **No older point above the death level.** For every level `h > s`, `M` is a highest point of\nits component in `{f ≥ h}`, when `b = f M`: the class born at `M` is the elder of its component. -/\ntheorem elder_alive (H : CapHyp f C M z b s) (hMb : f M = b) {h : ℝ} (hh : s" + }, + { + "kind": "def", + "unqualified_name": "olderPeakLevels", + "line": 329, + "source_header": "rd ((H.elder_merge_iff_closed h).mp ⟨w, hw, hlt⟩) (not_le.mpr hh)\n\n/-- The levels at which the component of `M` in `{f ≥ h}` contains a strictly higher local" + }, + { + "kind": "theorem", + "unqualified_name": "elder_death_level_peak", + "line": 334, + "source_header": "∈ connectedComponentIn {x | h ≤ f x} M, f M < f p ∧ IsLocalMax f p}\n\n/-- **Elder death level, peak form.** On a compact, locally connected space with continuous `f`\nand `b = f M`, the largest level at which the component of `M` contains a strictly higher local\nmaximum exists and equals `s`. This is the death level of the elder rule. -/\ntheorem elder_death_level_peak [CompactSpace X] [LocallyConnectedSpace X]\n (H : CapHyp f C M z b s) (hf : C" + }, + { + "kind": "theorem", + "unqualified_name": "frontier_image_subset", + "line": 348, + "source_header": "exact (H.elder_merge_iff_closed h).mp ⟨p, hpK, hMb ▸ hMp⟩\n\nend CapHyp\n\n/-! ### Charts: the cap on the torus and its faces\n\nThe analysis of CAP §§2–5 runs in Euclidean coordinates on the periodic lift `f ∘ e` of a field\n`f` on the torus, where `e : ℝ^d → T^d` is the covering map. The two lemmas below transport the cap\nhypotheses to the torus and list the faces of the cylinder cap. The transport needs only that `e`\nis continuous and open, that the target is Hausdorff and that the cap is compact; injectivity is\nnot used. -/\n\n/-- Frontier of a compact image. If `e` is continuous and open, `X` is Hausdorff and `C` is\ncompact, every frontier point of `e '' C` is the image of a frontier point of `C`. -/\ntheorem frontier_image_subset {Y : Type*} [TopologicalSpace Y] [T2Space X] {e : Y → X}\n (hec : Continuous e) (heo : IsOpenMap e)" + }, + { + "kind": "theorem", + "unqualified_name": "map", + "line": 372, + "source_header": "interior_subset) (heo _ isOpen_interior) ⟨y, hyi, rfl⟩\n\nnamespace CapHyp\n\n/-- **Transport along a chart.** The cap hypotheses for the lift `f ∘ e` on a compact cap `C`\ngive the cap hypotheses for `f` on `e '' C`, with the same `b` and `s`. -/\ntheorem map {Y : Type*} [TopologicalSpace Y] [T2Space X] {e : Y → X} (hec : Continuous e)\n (heo : IsOpenMap e) {f : X → ℝ} {C : Set Y} (hC : IsCompact C) {M z : Y} {b s : ℝ}\n (H" + }, + { + "kind": "theorem", + "unqualified_name": "map_saddle", + "line": 390, + "source_header": "ge := by\n obtain ⟨γ, hγ⟩ := H.ridge\n exact ⟨γ.map hec, fun t => hγ t⟩\n\n/-- Transport of (C2⁺): if only `S` attains `s` on the frontier of `C` for the lift, only `e S`\nattains it on the frontier of `e '' C`. -/\ntheorem map_saddle {Y : Type*} [TopologicalSpace Y] [T2Space X] {e : Y → X} (hec : Continuous e)\n (heo : IsOpenMap e) {f : X → ℝ} {C : Set Y} (hC : IsCompact C) {S : Y} {s : ℝ}\n (hS : ∀ y ∈ fronti" + }, + { + "kind": "theorem", + "unqualified_name": "frontier_cylinder", + "line": 402, + "source_header": "age_subset hec heo hC hx\n exact hS y hy (fun h => hne (h ▸ rfl))\n\nend CapHyp\n\n/-- **The faces of the cylinder cap** `[a, c] × B̄(0, R)`: the two end faces `{a, c} × B̄(0, R)`\nand the curved side `[a, c] × S(0, R)`. These are the faces estimated in L17–L19. -/\ntheorem frontier_cylinder {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {a c R : ℝ}\n (hac : a ≤ c) (hR : R ≠ 0) :\n frontier (Icc a c ×ˢ Metric.closedBall (0 : E) R) =\n ({a," + }, + { + "kind": "theorem", + "unqualified_name": "isCompact_cylinder", + "line": 412, + "source_header": "tier_Icc hac,\n Metric.isClosed_closedBall.closure_eq]\n exact union_comm _ _\n\n/-- The cylinder cap is compact in finite dimension. -/\ntheorem isCompact_cylinder {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [Pr" + }, + { + "kind": "def", + "unqualified_name": "torusCover", + "line": 417, + "source_header": "ˢ Metric.closedBall (0 : E) R) :=\n isCompact_Icc.prod (isCompact_closedBall 0 R)\n\n/-- The covering map of the flat torus `(" + }, + { + "kind": "theorem", + "unqualified_name": "torusCover_continuous", + "line": 421, + "source_header": ": (Fin d → ℝ) → (Fin d → AddCircle L) :=\n Pi.map fun _ => ((↑) : ℝ → AddCir" + }, + { + "kind": "theorem", + "unqualified_name": "torusCover_isOpenMap", + "line": 424, + "source_header": "Continuous (torusCover L d) :=\n Continuous.piMap fun _ => continuous_quot" + }, + { + "kind": "theorem", + "unqualified_name": "CapHyp.toTorus", + "line": 428, + "source_header": "nMap_coe)\n (Filter.Eventually.of_forall fun _ => QuotientAddGroup.mk_surjective)\n\n/-- **The cap on the torus.** Let `φ` be any coordinate frame (a homeomorphism onto `ℝ^d`), and\nsuppose the periodic lift `f ∘ torusCover L d ∘ φ` satisfies the cap hypotheses on a compact cap\n`C`. Then `f` satisfies them on the image of `C` in the torus `(ℝ / Lℤ)^d`, with the same `b` and\n`s`. No embedding radius is used. -/\ntheorem CapHyp.toTorus {Y : Type*} [TopologicalSpace Y] {L : ℝ} {d : ℕ}\n (φ : Y ≃ₜ (Fin d → ℝ)) {f : (Fin d → AddCircle L) → ℝ} {C : Set Y} (hC : IsCompact C)\n {M z : Y} {b s : ℝ} (H : CapHyp (f ∘ (torusCover L d ∘ φ)) C M z b s) :\n C" + }, + { + "kind": "theorem", + "unqualified_name": "convex_zeros_between", + "line": 461, + "source_header": "x = x³/24 - r²x/32`;\n- L19: the face assembly;\n- L20: the ridge path. -/\n\nsection Ridge\n\n/-- A convex function that vanishes at `a ≤ c` is `≤ 0` between them. -/\ntheorem convex_zeros_between {φ : ℝ → ℝ} {D : Set ℝ} (hφ : ConvexOn ℝ D φ) {a c : ℝ}\n (haD : a ∈ D) (hcD : c" + }, + { + "kind": "theorem", + "unqualified_name": "convex_zeros_right", + "line": 468, + "source_header": "e_on_segment haD hcD (by rw [segment_eq_Icc hac]; exact hx)\n rwa [ha, hc, max_self] at h\n\n/-- A convex function that vanishes at `a < c` is `≥ 0` to the right of `c`. -/\ntheorem convex_zeros_right {φ : ℝ → ℝ} {D : Set ℝ} (hφ : ConvexOn ℝ D φ) {a c : ℝ}\n (haD : a ∈ D) (" + }, + { + "kind": "theorem", + "unqualified_name": "convex_zeros_left", + "line": 479, + "source_header": "zero_div, sub_zero] at h\n rw [le_div_iff₀ (sub_pos.mpr hlt), zero_mul] at h\n exact h\n\n/-- A convex function that vanishes at `a < c` is `≥ 0` to the left of `a`. -/\ntheorem convex_zeros_left {φ : ℝ → ℝ} {D : Set ℝ} (hφ : ConvexOn ℝ D φ) {a c : ℝ}\n (hcD : c ∈ D)" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_profile", + "line": 490, + "source_header": ", zero_div, zero_sub] at h\n rw [div_le_iff₀ (sub_pos.mpr hlt), zero_mul] at h\n linarith\n\n/-- **The ridge profile (L13, L16, L17, L20).** On `D = [-2r, 2r]`, let `g' = F`, with `F`\nvanishing at the pins `∓r/2` and `F - (x + r/2)(x - r/2)/8` convex. Then:\n- `g ≤ g(-r/2)` on `[-2r, r/2]`;\n- `g ≥ g(r/2)` on `[-r/2, 2r]`;\n- `g(-2r) ≤ g(-r/2) - 9r³/32`;\n- `g(2r) ≥ g(r/2) + 9r³/32`. -/\ntheorem ridge_profile {g F : ℝ → ℝ} {r : ℝ} (hr : 0 < r)\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt g (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8)) :\n (∀ x ∈ Icc (-2 * r) (r / 2), g x ≤ g (-r / 2)) ∧\n (∀ x ∈ Icc (-r / 2) (2 * r), g (r / 2) ≤" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp", + "line": 598, + "source_header": "y [hQdef] at h\n nlinarith [h]\n\nvariable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]\n\n/-- **The cap hypotheses from the ridge (L16, L17, L19, L20).** Under the analytic inputs listed\nabove, `f` satisfies (C1)–(C3) on `C = [-2r, r/2] × B̄(0, 2r)`, with `M = (-r/2, h(-r/2))`,\n`z = (2r, h(2r))`, `b = g(-r/2)` and `s = g(r/2)`. Every input is local: `g' = F` and the convexity\nhold on `[-2r, 2r]`, and `h` is continuous on `[-r/2, 2r]`. -/\ntheorem ridge_capHyp {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {r : ℝ} (hr : 0 < r)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hT : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), f p ≤ f (p.1, h p.1))\n (hside : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.sphere (0 : E) (2 * r),\n f p ≤ f (r / 2, h (r / 2)))\n (hM : ‖h (-r / 2)‖ ≤ 2 * r)\n (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) < 9 * r ^ 3 / 32) :\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 *" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_saddle_strict", + "line": 656, + "source_header": "exact h0\n · exact hside p hp\n · linarith\n · intro t\n exact hfloor (xt t) (hxmem t)\n\n/-- **(C2⁺) from the ridge.** If, in addition, `h x` is the unique transverse maximizer on the\ncap and the curved side is strictly below `g c` (L7, L18), then `S = (r/2, h(r/2))` is the only\nfrontier point at height `s`. -/\ntheorem ridge_saddle_strict {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {r : ℝ} (hr : 0 < r)\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hT : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), f p ≤ f (p.1, h p.1))\n (hTs : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), p.2 ≠ h p.1 →\n f p < f (p.1, h p.1))\n (hside : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.sphere (0 : E) (2 * r),\n f p < f (r / 2, h (r / 2)))\n (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) < 9 * r ^ 3 / 32) :\n ∀ x ∈ frontier (Icc (-2 * r) (r /" + }, + { + "kind": "theorem", + "unqualified_name": "strongConcave_le_of_hasFDerivAt", + "line": 709, + "source_header": "/\n\nsection Slice\n\nopen Filter Topology\n\nvariable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]\n\n/-- **Strong concavity about a point with a derivative (the engine of L7, L8, L18).** If `φ` is\n`δ`-strongly concave on `K`, `p ∈ K`, and `φ` has derivative `L` at `p`, then\n`φ y ≤ φ p + L (y - p) - (δ/2)‖y - p‖²` for every `y ∈ K`. `p` need not be interior: only the\nsegment from `p` to `y`, which lies in `K`, is used. -/\ntheorem strongConcave_le_of_hasFDerivAt {K : Set E} {φ : E → ℝ} {δ : ℝ} {p : E}\n {L : E →L[ℝ] ℝ} (hφ : StrongConcaveOn K δ φ) (hp :" + }, + { + "kind": "theorem", + "unqualified_name": "slice_le", + "line": 744, + "source_header": "have := le_of_tendsto_of_tendsto hlim hslope hbound\n simp only [sub_zero, one_mul] at this\n linarith\n\n/-- **L7 (the transverse maximum).** At a critical point `p` of a `δ`-strongly concave slice,\n`φ y ≤ φ p - (δ/2)‖y - p‖²` on `K`. With `δ > 0` the maximizer is unique. -/\ntheorem slice_le {K : Set E} {φ : E → ℝ} {δ : ℝ} {p : E}\n (hφ : StrongConcaveOn K δ φ) (hp :" + }, + { + "kind": "theorem", + "unqualified_name": "slice_ridge_bound", + "line": 751, + "source_header": "y ∈ K) : φ y ≤ φ p - δ / 2 * ‖y - p‖ ^ 2 := by\n simpa using strongConcave_le_of_hasFDerivAt hφ hp hd hy\n\n/-- **L8 (the ridge bound).** If `0, p ∈ K`, `p` is critical and `w` is the derivative at `0`,\nthen `δ ‖p‖ ≤ ‖w‖`, i.e. `‖h(x)‖ ≤ ‖w(x)‖/δ`. -/\ntheorem slice_ridge_bound {K : Set E} {φ : E → ℝ} {δ : ℝ} {p : E} {w : E →L[ℝ] ℝ}\n (hφ : StrongConcaveOn K δ φ) (h0 : (0" + }, + { + "kind": "theorem", + "unqualified_name": "slice_curved", + "line": 766, + "source_header": "eg p).eq_or_lt with h | h\n · rw [← h, mul_zero]; exact norm_nonneg w\n · exact le_of_mul_le_mul_right h4 h\n\n/-- **L18 (the curved side).** On the sphere of radius `R`, the slice is strictly below `s`\nonce `φ p ≤ b`, `‖w‖ ≤ ω ≤ Rδ` and `2δ(b - s) < (Rδ - ω)²`. -/\ntheorem slice_curved {φ : E → ℝ} {δ ω R b s : ℝ} {p : E} {w : E →L[ℝ] ℝ}\n (hφ : StrongConcaveOn (Metric.closedBall (0 : E) R) δ φ) (hδ : 0 < δ)\n (hp : p ∈ Metric.closedBall (0 : E) R) (hd : HasFDerivAt φ (0 : E →L[ℝ] ℝ) p)\n (hw : HasFDerivAt φ w 0) (hω : ‖w‖ ≤ ω) (hωR : ω ≤ R * δ) (hb : φ p" + }, + { + "kind": "theorem", + "unqualified_name": "slice_hasFDerivAt", + "line": 786, + "source_header": "‖ ^ 2) := by nlinarith\n have h6 : 2 * (b - s) < δ * ‖y - p‖ ^ 2 := lt_of_mul_lt_mul_left h5 hδ.le\n linarith\n\n/-- The derivative of a slice `y ↦ f (x, y)` is the joint derivative restricted to the\ntransverse directions. -/\ntheorem slice_hasFDerivAt {f : ℝ × E → ℝ} {x : ℝ} {y : E} {D : ℝ × E →L[ℝ] ℝ}\n (" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_hasDerivAt", + "line": 793, + "source_header": "(fun y' => f (x, y')) (D.comp (ContinuousLinearMap.inr ℝ ℝ E)) y :=\n hf.comp y (hasFDerivAt_prodMk_right x y)\n\n/-- **L11 (the ridge function's derivative).** If `f` has joint derivative `D` at `(x, h x)`,\n`h` has derivative `h'` at `x`, and the transverse part of `D` vanishes (the ridge equation\n`∂_y f = 0`), then `g = f (·, h ·)` has derivative `F x = D (1, 0) = ∂_x f (x, h x)`: the\n`∂_y f · h'` term drops out. -/\ntheorem ridge_hasDerivAt {f : ℝ × E → ℝ} {h : ℝ → E} {x : ℝ} {D : ℝ × E →L[ℝ] ℝ} {h' : E}\n (hf : HasFDerivAt f D (x, h x)) (hh : HasDerivAt" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_of_slices", + "line": 812, + "source_header": "_ = D (1, 0) + D (0, h') := map_add _ _ _\n _ = D (1, 0) := by rw [h0, add_zero]\n rw [← hD]\n exact hc\n\n/-- **(C1)–(C3) and (C2⁺) from the slices.** `ridge_capHyp` and `ridge_saddle_strict` with\n`hT`, `hTs`, `hside` and `hM` derived (L7, L8, L18) from L4 (`hconc`), the critical points\n`h x ∈ B̄(0, 2r)` (`hball`, `hcrit`; L7's existence part), L5 (`hw`, `hω`) and the curvature\ncondition `2δ(b - s) < (2rδ - ω)²`, which SP's constants satisfy (`sp_curved_side_constants`). -/\ntheorem ridge_capHyp_of_slices {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {w : ℝ → E →L[ℝ] ℝ}\n {r δ ω : ℝ} (hr : 0 < r) (hδ : 0 < δ)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hconc : ∀ x ∈ Icc (-2 * r) (r / 2),\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))\n (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))\n (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))\n (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hω : ∀ x ∈ Icc (-2 * r) (r / 2), ‖w x‖ ≤ ω) (hωr : ω ≤ 2 * r * δ)\n (hcurv : 2 * δ * (f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2))) < (2 * r * δ - ω) ^ 2)\n (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) < 9 * r ^ 3 / 32) :\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))\n (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) ∧\n ∀ x ∈ frontier (Icc" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_inputs_of_joint", + "line": 861, + "source_header": "hFc hconv hT (fun p hp => (hside p hp).le) hM hgap,\n ridge_saddle_strict hr hg hFa hFc hconv hT hTs hside hgap⟩\n\n/-- **The joint form (L7, L11).** From a joint derivative `D x` of `f` along the ridge, a\ndifferentiable `h` and the ridge equation `(D x) ∘ inr = 0`, the inputs `hh`, `hg` (with\n`F x = D x (1, 0)`) and `hcrit` of `ridge_capHyp_of_slices` follow. -/\ntheorem ridge_inputs_of_joint {f : ℝ × E → ℝ} {h h' : ℝ → E} {D : ℝ → ℝ × E →L[ℝ] ℝ} {r : ℝ}\n (hr : 0 < r) (hD : ∀ x ∈ Icc (-2 * r) (2 * r), HasFDerivAt f (D x) (x, h x))\n (hh' : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt h (h' x) x)\n (hridge : ∀ x ∈ Icc (-2 * r) (2 * r), (D x).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0) :\n ContinuousOn h (Icc (-r / 2) (2 * r)) ∧\n (∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x =>" + }, + { + "kind": "theorem", + "unqualified_name": "sp_curved_side_constants", + "line": 877, + "source_header": ": x ∈ Icc (-2 * r) (2 * r) := ⟨hx.1, by linarith [hx.2]⟩\n simpa [hridge x hx'] using slice_hasFDerivAt (hD x hx')\n\n/-- **SP's constants satisfy the curvature condition (L4, L5, L18).** With `m ≥ 2`,\n`δ > r m (8m - 5)` (L4, `k = 8m - 5`), `0 ≤ ω ≤ 2 m r²` (L5) and SP's gap `b - s = r³/6`:\n`ω ≤ 2rδ` and `2δ · r³/6 < (2rδ - ω)²`. -/\ntheorem sp_curved_side_constants {r m δ ω : ℝ} (hr : 0 < r) (hm : 2 ≤ m)\n (hδ : r * m *" + }, + { + "kind": "theorem", + "unqualified_name": "convexOn_add_node", + "line": 895, + "source_header": "_left₀ hpos (by have hδ0 : 0 < δ := by linarith\n positivity) two_ne_zero\n nlinarith [hsq]\n\n/-- Adding the affine function `(m/2)((t - a)(t - c) - t²)` preserves convexity. -/\ntheorem convexOn_add_node {u : ℝ → ℝ} {D : Set ℝ} {a c m : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "two_node_bound", + "line": 911, + "source_header": "/ 2 * x ^ 2) + q * (u y + m / 2 * y ^ 2)) := by\n have hq' : q = 1 - p := by linarith\n subst hq'\n ring\n linarith\n\n/-- **L5 (two-node interpolation), scalar form.** If `u + (m/2) t²` is convex and `u - (m/2) t²` is\nconcave on `D` (the weak form of `|u''| ≤ m`) and `u` vanishes at `a < c` in `D`, then\n`|u x| ≤ (m/2) |(x - a)(x - c)|` for every `x ∈ D`, inside or outside `[a, c]`. -/\ntheorem two_node_bound {u : ℝ → ℝ} {D : Set ℝ} {a c m : ℝ}\n (hcv : ConvexOn ℝ D (fun t => u t + m / 2 * t ^ 2))\n (hcc : ConcaveOn ℝ D (fun t => u t - m / 2 * t ^ 2))\n (haD : a ∈" + }, + { + "kind": "theorem", + "unqualified_name": "slice_gradient_bound", + "line": 945, + "source_header": "= mul_nonpos_of_nonneg_of_nonpos (by linarith) (by linarith)\n rw [abs_of_nonpos hP, abs_le]\n constructor <;> linarith\n\n/-- **L5 (the transverse gradient at `y = 0`).** If the slice derivatives `w t` at `y = 0` vanish at\nthe pins `a < c` and, for every direction `v`, `t ↦ w t v` has second derivative bounded by\n`m ‖v‖` in the weak form below, then `‖w x‖ ≤ (m/2) |(x - a)(x - c)|` on `D`. -/\ntheorem slice_gradient_bound {w : ℝ → E →L[ℝ] ℝ} {D : Set ℝ} {a c m : ℝ} (hm : 0 ≤ m)\n (hcv : ∀ v : E, ConvexOn ℝ D (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))\n (hcc : ∀ v : E, ConcaveOn ℝ D (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))\n (haD : a" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_sp", + "line": 960, + "source_header": "eal.norm_eq_abs]\n calc |w x v| ≤ m * ‖v‖ / 2 * |(x - a) * (x - c)| := h\n _ = m / 2 * |(x - a) * (x - c)| * ‖v‖ := by ring\n\n/-- **The cap from SP's normalized hypotheses (L2, L4, L5, L7, L11, L12).** With `m ≥ 2` (L2),\nslices `δ`-strongly concave for some `δ > r m (8m - 5)` (L4), slice derivatives at `y = 0` with\nsecond `x`-derivative bounded by `m` in the weak form (L5), critical points `h x` with\n`h(∓r/2) = 0` (L7) and the gap `b - s ≤ r³/6`, the conclusions of `ridge_capHyp_of_slices` hold.\n`hω`, `hωr` and `hcurv` are derived: `‖w‖ ≤ 2 m r²` (`slice_gradient_bound`) and\n`sp_curved_side_constants`. -/\ntheorem ridge_capHyp_sp {f : ℝ × E → ℝ} {h : ℝ → E} {F : ℝ → ℝ} {w : ℝ → E →L[ℝ] ℝ}\n {r m δ : ℝ} (hr : 0 < r) (hm : 2 ≤ m) (hδ : r * m * (8 * m - 5) < δ)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hconc : ∀ x ∈ Icc (-2 * r) (r / 2),\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))\n (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))\n (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))\n (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)\n (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))\n (hgap : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) ≤ r ^ 3 / 6) :\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))\n (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) ∧\n ∀ x ∈ fr" + }, + { + "kind": "theorem", + "unqualified_name": "hermite_gap_le", + "line": 1015, + "source_header": "_ < _ := hcurv\n · have : r ^ 3 / 6 < 9 * r ^ 3 / 32 := by\n have : 0 < r ^ 3 := by positivity\n linarith\n linarith\n\n/-- **L1 (the Hermite identity, as a bound).** If `g' = G` on `[a, c]`, `G` vanishes at both ends\n(the pins are critical) and `|G''| ≤ m` in the weak form, then `g(a) - g(c) ≤ m (c - a)³/12`.\nSP's identity `g(c) - g(a) = -(1/2)∫ φ g'''` with `∫ φ = (c - a)³/6` gives the same bound; here it\ncomes from `two_node_bound` and monotonicity of `g + (m/2)Φ`, `Φ' = (t - a)(c - t)`. -/\ntheorem hermite_gap_le {g G : ℝ → ℝ} {a c m : ℝ} (hac : a < c)\n (hg : ∀ x ∈ Icc a c, HasDerivAt g (G x) x)\n (hcv : ConvexOn ℝ (Icc a c) (fun t => G t + m / 2 * t ^ 2))\n (hcc :" + }, + { + "kind": "theorem", + "unqualified_name": "hermite_m_ge_two", + "line": 1057, + "source_header": "= 0 := by ring\n have e1 : m / 2 * ((c - a) * (c - a) ^ 2 / 2 - (c - a) ^ 3 / 3) = m * (c - a) ^ 3 / 12 := by\n ring\n linarith\n\n/-- **L2 (`m ≥ 2`).** Under SP's normalization `g(-r/2) - g(r/2) = r³/6` on the pin interval, the\nweak bound `|g'''| ≤ m` forces `m ≥ 2`. -/\ntheorem hermite_m_ge_two {g G : ℝ → ℝ} {r m : ℝ} (hr : 0 < r)\n (hg : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt g (G x) x)\n (hcv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G t + m / 2 * t ^ 2))\n (hcc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_normalized", + "line": 1071, + "source_header": "cv hcc hGa hGc\n have hcr : r / 2 - -r / 2 = r := by ring\n rw [hgap, hcr] at h\n have hr3 : 0 < r ^ 3 := by positivity\n nlinarith\n\n/-- **The cap from SP's normalization (L1, L2 and the rest of `ridge_capHyp_sp`).** As\n`ridge_capHyp_sp`, with `m ≥ 2` derived instead of assumed: `g0 = f(·, 0)` has derivative `G0`\nvanishing at the pins with `|G0''| ≤ m` (weak form), and the gap is exactly `r³/6`. -/\ntheorem ridge_capHyp_normalized {f : ℝ × E → ℝ} {h : ℝ → E} {F G0 : ℝ → ℝ}\n {w : ℝ → E →L[ℝ] ℝ} {r m δ : ℝ} (hr : 0 < r)\n (hg0 : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt (fun x => f (x, 0)) (G0 x) x)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t - m / 2 * t ^ 2))\n (hG0a : G0 (-r / 2) = 0) (hG0c : G0 (r / 2) = 0)\n (hδ : r * m * (8 * m - 5) < δ)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hconc : ∀ x ∈ Icc (-2 * r) (r / 2),\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))\n (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))\n (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))\n (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)\n (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) = r ^ 3 / 6) :\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))\n (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2))) ∧\n ∀" + }, + { + "kind": "theorem", + "unqualified_name": "strongConcaveOn_of_hessian", + "line": 1103, + "source_header": "impa [hha, hhc] using hnorm)\n exact ridge_capHyp_sp hr hm hδ hh hg hFa hFc hconv hconc hball hcrit hha hhc hw hwcv hwcc\n hnorm.le\n\n/-- **Second-order condition for strong concavity.** If `φ` has derivative `Dφ` and `Dφ` has\nderivative `H` at every point of the convex set `K`, and `H y v v ≤ -δ ‖v‖²` there, then `φ` is\n`δ`-strongly concave on `K`. Along each segment, `φ(x + t v) + (δ/2)‖v‖² t²` has a nonpositive\nsecond derivative, so it is concave on `[0, 1]`. -/\ntheorem strongConcaveOn_of_hessian {K : Set E} {φ : E → ℝ} {Dφ : E → E →L[ℝ] ℝ}\n {H : E → E →L[ℝ] E →L[ℝ] ℝ} {δ : ℝ} (hK : Convex ℝ K)\n (hD : ∀ y ∈ K, HasFD" + }, + { + "kind": "theorem", + "unqualified_name": "transverse_hessian_le", + "line": 1158, + "source_header": "el\n rw [hxv] at key\n show a * φ x + b * φ y + a * b * (δ / 2 * ‖v‖ ^ 2) ≤ φ (x + b • v)\n rw [hab'] at key ⊢\n linear_combination key\n\n/-- **L3–L4 (the transverse Hessian bound).** If the transverse Hessian `H` satisfies\n`H(M) ≤ -λ` (SP's `λ = λ_min(-D_y² f(M))`) and its increments from `M = (-r/2, 0)` are bounded by\n`m (|Δx| + ‖Δy‖)` (L3, with `m` bounding the third-derivative blocks), then `H(p) ≤ -(λ - 5rm)`\non the cap. The increment is at most `3r/2 + 2r ≤ 5r` there; SP bounds it on all of `D` by\n`9r/2 < 5r`. -/\ntheorem transverse_hessian_le {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam : ℝ} (hr : 0 < r)\n (hm : 0 ≤ m)\n (hlip : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -la" + }, + { + "kind": "theorem", + "unqualified_name": "hessian_increment", + "line": 1191, + "source_header": "v‖ := h1\n _ ≤ 5 * r * m * ‖v‖ * ‖v‖ := by gcongr\n _ = 5 * r * m * ‖v‖ ^ 2 := by ring\n rw [hsplit]\n have := hlam v\n nlinarith\n\n/-- **L3 (increments of the transverse Hessian).** If `x ↦ H (x, 0)` has derivative `Hx x` with\n`‖Hx x‖ ≤ m` on `[-2r, r/2]` (the block `∂_x D_y² f`), and along each ray `s ↦ H (x, s • y)`,\n`s ∈ [0, 1]`, the derivative `Hr p s` has `‖Hr p s‖ ≤ m ‖y‖` (the block `D_y³ f` applied to `y`),\nthen moving first in `x` along `y = 0` and then along the ray gives `‖H p - H M‖ ≤ m (|Δx| + ‖Δy‖)`\nfrom `M = (-r/2, 0)`, by the mean value inequality. -/\ntheorem hessian_increment {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m : ℝ} (hr : 0 < r)\n (hHx : ∀ x ∈ Icc (-2 * r) (r / 2), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r) (r / 2), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,\n HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,\n ‖Hr p s‖ ≤ m" + }, + { + "kind": "theorem", + "unqualified_name": "slices_strongConcave", + "line": 1224, + "source_header": "(H (-r / 2, 0))\n _ ≤ m * ‖y‖ + m * |x - -r / 2| := add_le_add h1 h2\n _ = m * (|(x, y).1 - -r / 2| + ‖(x, y).2‖) := by simp only; ring\n\n/-- **L4 (strong concavity of the slices).** Under `transverse_hessian_le`'s hypotheses, with the\nslice derivatives `Dφ` and Hessians `H` given on the cap, every slice `y ↦ f (x, y)`,\n`x ∈ [-2r, r/2]`, is `(λ - 5rm)`-strongly concave on `B̄(0, 2r)`. -/\ntheorem slices_strongConcave {f : ℝ × E → ℝ} {Dφ : ℝ × E → E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam : ℝ} (hr : 0 < r) (hm : 0 ≤ m)\n (hD : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (p.1, y)) (Dφ p) p.2)\n (hH : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => Dφ (p.1, y)) (H p) p.2)\n (hlip : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_H1", + "line": 1244, + "source_header": ", y))\n (convex_closedBall _ _) (fun y hy => hD (x, y) ⟨hx, hy⟩) (fun y hy => hH (x, y) ⟨hx, hy⟩)\n (fun y hy v => hbd (x, y) ⟨hx, hy⟩ v)\n\n/-- **The cap from SP's hypothesis (H1) (L1–L5, L7, L8, L11, L18).** As `ridge_capHyp_normalized`,\nwith the slice strong concavity and `δ > rm(8m - 5)` derived from Hessian data: the slice\nderivatives and Hessians on the cap, the increment bound of `H` from `M` with constant `m`,\n`H(M) ≤ -λ`, and (H1) `8 r m² < λ`. Then `δ = λ - 5rm > rm(8m - 5)`. -/\ntheorem ridge_capHyp_H1 {f : ℝ × E → ℝ} {h : ℝ → E} {F G0 : ℝ → ℝ}\n {w : ℝ → E →L[ℝ] ℝ} {Dφ : ℝ × E → E →L[ℝ] ℝ} {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ}\n {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ} {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam : ℝ} (hr : 0 < r)\n (hg0 : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt (fun x => f (x, 0)) (G0 x) x)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => G0 t - m / 2 * t ^ 2))\n (hG0a : G0 (-r / 2) = 0) (hG0c : G0 (r / 2) = 0)\n (hD : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (p.1, y)) (Dφ p) p.2)\n (hH : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => Dφ (p.1, y)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r) (r / 2), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r) (r / 2), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,\n HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ s ∈ Icc (0 : ℝ) 1,\n ‖Hr p s‖ ≤ m * ‖p.2‖)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hh : ContinuousOn h (Icc (-r / 2) (2 * r)))\n (hg : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt (fun x => f (x, h x)) (F x) x)\n (hFa : F (-r / 2) = 0) (hFc : F (r / 2) = 0)\n (hconv : ConvexOn ℝ (Icc (-2 * r) (2 * r)) (fun x => F x - (x + r / 2) * (x - r / 2) / 8))\n (hball : ∀ x ∈ Icc (-2 * r) (r / 2), h x ∈ Metric.closedBall (0 : E) (2 * r))\n (hcrit : ∀ x ∈ Icc (-2 * r) (r / 2),\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))\n (hha : h (-r / 2) = 0) (hhc : h (r / 2) = 0)\n (hw : ∀ x ∈ Icc (-2 * r) (r / 2), HasFDerivAt (fun y => f (x, y)) (w x) (0 : E))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r) (r / 2)) (fun t => w t v - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, h (-r / 2)) - f (r / 2, h (r / 2)) = r ^ 3 / 6) :\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, h (-r / 2))\n (2 * r, h (2 * r)) (f (-r / 2, h (-r / 2))) (f (r / 2, h (r / 2)))" + }, + { + "kind": "theorem", + "unqualified_name": "slice_critical_unique", + "line": 1290, + "source_header": "nlinarith\n exact ridge_capHyp_normalized hr hg0 hG0cv hG0cc hG0a hG0c hδ hh hg hFa hFc hconv hconc hball\n hcrit hha hhc hw hwcv hwcc hnorm\n\n/-- **L7 (uniqueness of the transverse critical point).** A `δ`-strongly concave slice, `δ > 0`,\nhas at most one critical point in `K`. -/\ntheorem slice_critical_unique {K : Set E} {φ : E → ℝ} {δ : ℝ} (hφ : StrongConcaveOn K δ φ)" + }, + { + "kind": "theorem", + "unqualified_name": "slice_critical_exists", + "line": 1305, + "source_header": "ct le_of_mul_le_mul_left this hδ\n have h5 : ‖q - p‖ = 0 := by nlinarith [norm_nonneg (q - p)]\n exact (sub_eq_zero.mp (norm_eq_zero.mp h5)).symm\n\n/-- **L7 (existence of the transverse critical point).** If the slice is `δ`-strongly concave and\ndifferentiable on `B̄(0, R)` and its derivative at `0` has norm `< δR` (SP: `‖w‖ < δ · 2r`), the\nmaximum over the compact ball is attained in the open ball, so it is a critical point. On the\nsphere the radial derivative is `≤ w(p) - δR² < 0` (SP's L7 computation, here from the strong\nconcavity engine), which contradicts maximality. -/\ntheorem slice_critical_exists [ProperSpace E] {φ : E → ℝ} {Dφ : E → E →L[ℝ] ℝ} {δ R : ℝ}\n (hR : 0 < R) (hφ : StrongConcaveOn (Metric.closedBall (0 : E) R) δ φ)\n (hD :" + }, + { + "kind": "theorem", + "unqualified_name": "isInvertible_of_negDef", + "line": 1343, + "source_header": "sLocalMax (Metric.closedBall_mem_nhds_of_mem hpb)\n refine ⟨p, hpb, ?_⟩\n have hz := hloc.hasFDerivAt_eq_zero (hD p hp)\n rw [← hz]\n exact hD p hp\n\n/-- In finite dimension, a bilinear form `A : E →L E →L ℝ` with `A v v ≤ -δ‖v‖²`, `δ > 0`, is\ninvertible as a map `E → E*` (SP L7: \"`D_y² f` invertible\"). -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_hasStrictFDerivAt", + "line": 1364, + "source_header": ": E →ₗ[ℝ] E →L[ℝ] ℝ))).mp hinj\n refine ⟨(LinearEquiv.ofBijective (A : E →ₗ[ℝ] E →L[ℝ] ℝ) ⟨hinj, hsurj⟩).toContinuousLinearEquiv, ?_⟩\n ext v w\n rfl\n\n/-- **L7 (regularity of the ridge, pointwise).** If the transverse gradient `G` is strictly\ndifferentiable at `(x0, h x0)` with invertible transverse part, `h x0` is a critical point, and\nnear `x0` the critical point of each slice in a neighbourhood `K` of `h x0` is unique and equal to\n`h x`, then `h` agrees near `x0` with the implicit function of `G = 0` (Mathlib's\n`implicitFunctionOfProdDomain`), so `h` is strictly differentiable at `x0` with\n`h' = -(∂_y G)⁻¹ ∂_x G` (SP L9's formula). -/\ntheorem ridge_hasStrictFDerivAt [CompleteSpace E] {f : ℝ × E → ℝ} {G : ℝ × E → E →L[ℝ] ℝ}\n {DG : ℝ × E →L[ℝ] E →L[ℝ] ℝ} {h : ℝ → E} {K : Set E} {x0 : ℝ}\n (hGs : HasStrictFDerivAt G DG (x0, h x0))\n (hinv : (DG ∘L ContinuousLinearMap.inr ℝ ℝ E).IsInvertible)\n (hG : ∀ᶠ v in 𝓝 (x0, h x0), HasFDerivAt (fun y => f (v.1, y)) (G v) v.2)\n (hcrit0 : HasFDerivAt (fun y => f (x0, y)) (0 : E →L[ℝ] ℝ) (h x0)) (hK : K ∈ 𝓝 (h x0))\n (huniq : ∀ᶠ x in 𝓝 x0, ∀ y ∈ K, HasFDerivAt (fun y => f (x, y)) (0" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_differentiable", + "line": 1394, + "source_header": ":= by\n filter_upwards [hev, hGψ, hKψ, huniq] with x h1 h2 h3 h4\n rw [h1, hGu] at h2\n exact h4 (ψ x) h3 h2\n exact hψ.congr_of_eventuallyEq heq\n\n\n/-- **L7 (regularity of the ridge on `[-2r, 2r]`).** With the slices `δ`-strongly concave and `h x` a\ncritical point in `B̄(0, 2r)` for `x` in an open set `U ⊇ [-2r, 2r]` (SP: `f ∈ C⁴` near `D`), `h x`\nin the open ball on `[-2r, 2r]`, and the transverse gradient strictly differentiable along the\nridge with negative definite transverse part, `h` is strictly differentiable at every\n`x ∈ [-2r, 2r]`. Composed with `ridge_inputs_of_joint`, as `ridge_capHyp_source` does, this supplies\nits `hh'`. -/\ntheorem ridge_differentiable [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {G : ℝ × E → E →L[ℝ] ℝ}\n {DG : ℝ → ℝ × E →L[ℝ] E →L[ℝ] ℝ} {h : ℝ → E} {U : Set ℝ} {r δ : ℝ} (hδ : 0 < δ)\n (hU : IsOpen U) (hIU : Icc (-2 * r) (2 * r) ⊆ U)\n (hconc : ∀ x ∈ U,\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))\n (hball : ∀ x ∈ U, h x ∈ Metric.closedBall (0 : E) (2 * r))\n (hcrit : ∀ x ∈ U, HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x))\n (hint : ∀ x ∈ Icc (-2 * r) (2 * r), h x ∈ Metric.ball (0 : E) (2 * r))\n (hG : ∀ x ∈ Icc (-2 * r) (2 * r),\n ∀ᶠ v in 𝓝 (x, h x), HasFDerivAt (fun y => f (v.1, y)) (G v) v.2)\n (hGs : ∀ x ∈ Icc (-2 * r) (2 * r), HasStrictFDerivAt G (DG x) (x, h x))\n (hneg : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v : E,\n (DG x ∘L ContinuousLinearMap.inr ℝ ℝ E) v v ≤ -δ * ‖v‖ ^ 2) :" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_exists", + "line": 1426, + "source_header": "l x' hx') hdy (hcrit x' hx')\n exact ridge_hasStrictFDerivAt (hGs x hx) (isInvertible_of_negDef hδ (hneg x hx)) (hG x hx)\n (hcrit x (hIU hx)) hK huniq\n\n\n/-- **L7 (existence of the ridge).** If on an open set `U` of `x`-values the slices are\n`δ`-strongly concave and differentiable on `B̄(0, 2r)` with `‖∂_y f(x, 0)‖ < δ · 2r`, a map `h`\nwith `h x` a critical point in the open ball exists on `U` (by choice; unique by\n`slice_critical_unique`). -/\ntheorem ridge_exists [ProperSpace E] {f : ℝ × E → ℝ} {Dφ : ℝ → E → E →L[ℝ] ℝ} {U : Set ℝ}\n {r δ : ℝ} (hr : 0 < r)\n (hconc : ∀ x ∈ U,\n StrongConcaveOn (Metric.closedBall (0 : E) (2 * r)) δ (fun y => f (x, y)))\n (hD : ∀ x ∈ U, ∀ y ∈ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (x, y)) (Dφ x y) y)\n (hw : ∀" + }, + { + "kind": "theorem", + "unqualified_name": "hessian_increment_D", + "line": 1450, + "source_header": "hx) (hD x hx) (hw x hx)\n exact ⟨p, fun _ => ⟨hp, hdp⟩⟩\n · exact ⟨0, fun h => absurd h hx⟩\n choose h hh using hex\n exact ⟨h, fun x hx => hh x hx⟩\n\n/-! ### The full domain (v1.8)\n\nSP proves L4 on all of `D`, where the increment from `M` is at most `9r/2 < 5r`, and assumes\n`f ∈ C⁴` near `D`. The lemmas below take the source data on a collar `x ∈ [-2r - ε, 2r + ε]`,\n`0 < ε ≤ r/2`, where `|x + r/2| ≤ 3r` keeps the increment at most `5r`. So every slice over the open\nset `(-2r - ε, 2r + ε) ⊇ [-2r, 2r]` is `(λ - 5rm)`-strongly concave, which is what the L7 lemmas\nneed, and `ridge_capHyp_source` composes L7 with the cap. -/\n\n/-- **L3 on the full domain.** As `hessian_increment`, with the `x`-range `[-2r - ε, 2r + ε]`. -/\ntheorem hessian_increment_D {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1," + }, + { + "kind": "theorem", + "unqualified_name": "transverse_hessian_le_D", + "line": 1487, + "source_header": "(x, y)) (H (x, 0)) (H (-r / 2, 0))\n _ ≤ m * ‖y‖ + m * |x - -r / 2| := add_le_add h1 h2\n _ = m * (|(x, y).1 - -r / 2| + ‖(x, y).2‖) := by simp only; ring\n\n/-- **L4's Hessian bound on the full domain.** As `transverse_hessian_le`, for\n`x ∈ [-2r - ε, 2r + ε]` with `0 < ε ≤ r/2`: there `|x + r/2| ≤ 3r`, so the increment is still at\nmost `5r`. -/\ntheorem transverse_hessian_le_D {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ}\n (hm : 0 ≤ m) (hε : 0 < ε) (hεr : ε ≤ r / 2)\n (hlip : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))\n (hlam : ∀ v : E, H (-r /" + }, + { + "kind": "theorem", + "unqualified_name": "slices_strongConcave_D", + "line": 1518, + "source_header": "H (-r / 2, 0)‖ * ‖v‖ * ‖v‖ := h1\n _ ≤ 5 * r * m * ‖v‖ * ‖v‖ := by gcongr\n _ = 5 * r * m * ‖v‖ ^ 2 := by ring\n rw [hsplit]\n have := hlam v\n nlinarith\n\n/-- **L4 on the full domain.** Every slice `y ↦ f (x, y)`, `x ∈ [-2r - ε, 2r + ε]`, is\n`(λ - 5rm)`-strongly concave on `B̄(0, 2r)`. -/\ntheorem slices_strongConcave_D {f : ℝ × E → ℝ} {Dφ : ℝ × E → E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hm : 0 ≤ m) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hD : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => f (p.1, y)) (Dφ p) p.2)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => Dφ (p.1, y)) (H p) p.2)\n (hlip : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖H p - H (-r / 2, 0)‖ ≤ m * (|p.1 - -r / 2| + ‖p.2‖))\n (hlam : ∀ v : E, H (-r / 2," + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_source", + "line": 1538, + "source_header": ")) (H := fun y => H (x, y))\n (convex_closedBall _ _) (fun y hy => hD (x, y) ⟨hx, hy⟩) (fun y hy => hH (x, y) ⟨hx, hy⟩)\n (fun y hy v => hbd (x, y) ⟨hx, hy⟩ v)\n\n/-- **The cap from SP's source data (L1–L5, L7, L8, L11, L18 composed).** Fix a collar\n`0 < ε ≤ r/2` and assume, for `x ∈ [-2r - ε, 2r + ε]` and `y ∈ B̄(0, 2r)`: a joint derivative `Df` of `f`, strictly differentiable in\nits transverse part `∂_y f = Df ∘ inr` with derivative `DG`; the transverse Hessian `H` with the\nthird-derivative bounds `m` of L3; (H1) `8rm² < λ` with `H(M) ≤ -λ`; the critical pins\n`Df(∓r/2, 0) = 0`; the weak bounds `|∂_x³ f(·, 0)| ≤ m` on `[-r/2, r/2]` (L1) and\n`|∂_x² ∂_y f(·, 0)| ≤ m` on the collar (L5); and the gap `f(M) - f(S) = r³/6`. Then:\n- a ridge `h` exists: on `(-2r - ε, 2r + ε)`, `h x` is a critical point of its slice in the open\n ball;\n- for any such ridge (unique by `slice_critical_unique`) with L12's `hconv` for\n `F x = ∂_x f(x, h x)`, `h(∓r/2) = 0`, and (C1)–(C3) and (C2⁺) hold on the cap with `M = (-r/2, 0)`,\n `S = (r/2, 0)`, `b = f(M)` and `s = f(S)`.\n\nL8 puts `h` in the open ball on `[-2r, 2r]` (`‖w‖ ≤ 3mr² < 2rδ`); the implicit function theorem\n(`ridge_differentiable`) makes `h` differentiable there, with negative definite `DG ∘ inr = H`;\n`ridge_inputs_of_joint` gives L11; `ridge_capHyp_H1` gives the cap. Only L12 (`hconv`) remains an\ninput, with L6 and L9–L11's quantitative bounds that SP uses to prove it. -/\ntheorem ridge_capHyp_source [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt f (Df p) p)\n (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n ConvexOn ℝ (Icc (-2 * r) (2 * r))\n (fun x => Df (x, h x) (1, 0) - (x + r / 2) * (x - r / 2) / 8) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)\n (2 * r, h (2 * r)) (" + }, + { + "kind": "theorem", + "unqualified_name": "convex_deriv_sign", + "line": 1737, + "source_header": ".subset hcapX (convex_Icc _ _))\n (fun v => (hwcc' v).subset hcapX (convex_Icc _ _)) (by rw [hha, hhc]; exact hnorm)\n rw [hha, hhc] at key\n exact ⟨hha, hhc, key⟩\n\n\n/-! ### L6, L9 and L12 (v1.9)\n\nThe last analytic input of the cap, L12's convexity `hconv`, is derived here. L6 bounds `w'` by\nchord slopes of L5's convexity pair (no integral), L9 bounds `h'` through the differentiated ridge\nequation, and L12 uses that `F' = D²f[(1, h'), (1, 0)]` is the maximum of `ζ ↦ D²f[(1, ζ), (1, ζ)]`,\nso that no second derivative of `h` is needed. `ridge_capHyp_C3` composes them with\n`ridge_capHyp_source`. -/\n\n/-- A convex function with equal values at `a < c` has derivative `≥ 0` to the right of `c` and\n`≤ 0` to the left of `a`. -/\ntheorem convex_deriv_sign {φ : ℝ → ℝ} {D : Set ℝ} {a c x" + }, + { + "kind": "theorem", + "unqualified_name": "two_node_deriv_bound", + "line": 1772, + "source_header": "c - φ a) / (c - a) :=\n hφ.slope_mono_adjacent hx hcD h hac\n have h2 := hφ.le_slope_of_hasDerivAt hx haD h hd\n rw [slope_def_field] at h2\n linarith\n\n/-- **L6 (scalar).** If `u + (m/2)t²` is convex and `u - (m/2)t²` concave on `D` (weakly\n`|u''| ≤ m`), `u(∓r/2) = 0` and `u` has derivative `d` at `x ∈ D`, then `|d| ≤ m · max(|x|, r/2)`.\nOutside the pins the chord through them has slope `0`; between them the chord to the nearer pin and\nL5's bound on `u(x)` give `mr/2`. -/\ntheorem two_node_deriv_bound {u : ℝ → ℝ} {D : Set ℝ} {r m x d : ℝ} (hr : 0 < r) (hm : 0 ≤ m)\n (hcv : ConvexOn ℝ D (fun t => u t + m / 2 * t ^ 2))\n (hcc : ConcaveOn ℝ D (fun t => u t" + }, + { + "kind": "theorem", + "unqualified_name": "slice_gradient_deriv_bound", + "line": 1831, + "source_header": "calc |d| ≤ m / 2 * r := abs_le.mpr ⟨by linarith, hd1⟩\n _ = m * (r / 2) := by ring\n _ ≤ m * max |x| (r / 2) := mul_le_mul_of_nonneg_left (le_max_right _ _) hm\n\n\n/-- **L6 (CAP (7)).** For the slice derivatives `w t` at `y = 0` with derivative `w' x` at `x`, under\nL5's hypotheses: `‖w' x‖ ≤ m · max(|x|, r/2)`; on `[-2r, 2r]` this is SP's `‖w'‖ ≤ 2mr`. -/\ntheorem slice_gradient_deriv_bound {w : ℝ → E →L[ℝ] ℝ} {w' : E →L[ℝ] ℝ} {D : Set ℝ} {r m x : ℝ}\n (hr : 0 < r) (hm : 0 ≤ m)\n (hcv : ∀ v : E, ConvexOn ℝ D (fun t => w t v + m * ‖v‖ / 2 * t ^ 2))\n (hcc : ∀ v : E, ConcaveOn ℝ D (fun t => w t v - m *" + }, + { + "kind": "theorem", + "unqualified_name": "schur_max", + "line": 1849, + "source_header": "(hcc v) haD hcD (by simp [ha]) (by simp [hc]) hx hdv\n rw [Real.norm_eq_abs]\n calc |w' v| ≤ m * ‖v‖ * max |x| (r / 2) := h\n _ = m * max |x| (r / 2) * ‖v‖ := by ring\n\n/-- **L9 and the Schur maximum.** Let `Q` be a bilinear form on `ℝ × E` with `δ`-negative definite\ntransverse part, and let `η` satisfy the differentiated ridge equation `Q (1, η) (0, ·) = 0`. Then\n`δ ‖η‖ ≤ ‖Q (1, 0) (0, ·)‖` (L9: `‖h'‖ ≤ ‖∂_x ∇_y f‖ / δ`), `Q (1, η) (1, η) = Q (1, η) (1, 0)`, and,\nif `Q` is symmetric, `Q (1, ζ) (1, ζ) ≤ Q (1, η) (1, η)` for every `ζ`: the Schur complement\n`F' = f_xx + f_xy[h']` is the maximum of `ζ ↦ D²f[(1, ζ), (1, ζ)]`. -/\ntheorem schur_max {Q : ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ} {δ : ℝ} {η : E} (hδ : 0 < δ)\n (hneg : ∀ v : E, Q (0, v) (0, v) ≤ -δ * ‖v‖ ^ 2)\n (hridge : (Q (1, η)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0) :\n δ *" + }, + { + "kind": "theorem", + "unqualified_name": "trilinear_lower", + "line": 1889, + "source_header": "2 : Q (0, ζ - η) (1, η) = 0 := by rw [hsym]; exact h1\n have h3 := hneg (ζ - η)\n rw [hz, map_add, map_add, add_apply, add_apply, h1, h2]\n nlinarith [sq_nonneg ‖ζ - η‖]\n\n/-- **The correction terms of L12.** Let `T a b v` be the third derivative of `f` (the derivative of\n`D²f[a, b]` in direction `v`). If every block other than `f_xxx` has norm at most `m`, in the combined\nform below, then `T (1, b) (1, b) (1, a) ≥ f_xxx - m((1 + ‖b‖)²(1 + ‖a‖) - 1)`. With `‖a‖, ‖b‖ ≤ u`\nthis is SP's adverse bound `m u (3 + 3u + u²)`. -/\ntheorem trilinear_lower {T : ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {m : ℝ}\n (hT : ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁|" + }, + { + "kind": "theorem", + "unqualified_name": "l12_constants", + "line": 1903, + "source_header": ") - m * ((1 + ‖b‖) * (1 + ‖b‖) * (1 + ‖a‖) - 1) ≤ T (1, b) (1, b) (1, a) := by\n have h := (abs_le.mp (hT 1 1 1 b b a)).1\n simp only [abs_one, one_mul, mul_one] at h\n linarith\n\n/-- **SP's constants close L12.** With `m ≥ 2`, `δ > rm(8m - 5)` and `u = 2s + 2s²`, `s = mr/δ`\n(L9's bound on `‖h'‖`): `7/4 - m((1 + u)³ - 1) ≥ 1/4`. SP's exact value at `k = 11` is\n`7/4 - 2554128/1771561 = 0.308… > 1/" + }, + { + "kind": "theorem", + "unqualified_name": "transverse_hessian_eq", + "line": 1936, + "source_header": "have h4 : (m * u) * (3 + 3 * u + u ^ 2) ≤ (48 / 121) * (3 + 3 * (24 / 121) + (24 / 121) ^ 2) :=\n mul_le_mul hmu h3 (by positivity) (by norm_num)\n norm_num at h4 ⊢\n linarith\n\n/-- **The transverse Hessian is the transverse block of `D²f`.** If `y ↦ ∂_y f (x, y)` has\nderivative `H` at `y₀` and `Df` has derivative `D2f` at `(x, y₀)`, then\n`H v w = D²f (x, y₀) [(0, v), (0, w)]`. -/\ntheorem transverse_hessian_eq {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {H : E →L[ℝ] E →L[ℝ] ℝ}" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_second_identity", + "line": 1950, + "source_header": "p y₀ (hasFDerivAt_prodMk_right x y₀)).clm_apply\n (hasFDerivAt_const ((0 : ℝ), w) y₀)\n have h3 := h1.unique h2\n have := congrArg (fun L : E →L[ℝ] ℝ => L v) h3\n simpa using this\n\n/-- **The differentiated ridge equation.** If `∂_y f (t, h t) = 0` for `t` near `x`, `h` has\nderivative `h'` at `x` and `Df` has derivative `D2f` at `(x, h x)`, then\n`D²f (x, h x) [(1, h'), (0, ·)] = 0`, i.e. `∂_x ∇_y f + D_y² f · h' = 0` (L11's first identity). -/\ntheorem ridge_second_identity {Df : ℝ × E → ℝ × E →L[ℝ] ℝ}\n {D2f : ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ} {h : ℝ → E} {h' : E} {x : ℝ}\n (hridge : ∀ᶠ t in 𝓝 x" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_hconv", + "line": 1968, + "source_header": "have h3 : HasDerivAt (fun t => (Df (t, h t)).comp (ContinuousLinearMap.inr ℝ ℝ E)) 0 x :=\n (hasDerivAt_const x (0 : E →L[ℝ] ℝ)).congr_of_eventuallyEq hridge\n exact h2.unique h3\n\n/-- **L12 (CAP (11)–(12)): the convexity input `hconv`.** Along the ridge, let `Df`, `D2f` be the\nfirst two derivatives of `f`, with `D2f` symmetric and its transverse part `δ`-negative definite,\n`‖h'‖ ≤ u`, and for every `‖b‖ ≤ u` let `s ↦ D²f(s, h s)[(1, b), (1, b)]` have derivative `≥ 1/4`\n(SP: `f_xxx ≥ 7/4` minus the adverse part `m u (3 + 3u + u²)`; see `trilinear_lower`). Then\n`F - (x + r/2)(x - r/2)/8`, `F x = ∂_x f (x, h x)`, is convex on `[-2r, 2r]`. No second derivative of\n`h` is used: `F' = D²f[(1, h'), (1, 0)]` is the maximum of `ζ ↦ D²f[(1, ζ), (1, ζ)]` (`schur_max`),\nso `F'(x₂) - F'(x₁) ≥ D²f(x₂)[(1, η), (1, η)] - D²f(x₁)[(1, η), (1, η)] ≥ (x₂ - x₁)/4` with\n`η = h'(x₁)`. -/\ntheorem ridge_hconv {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {Φ : ℝ → E → ℝ} {h h' : ℝ → E} {U : Set ℝ} {r δ u : ℝ} (hδ : 0 < δ) (hU : IsOpen U)\n (hIU : Icc (-2 * r) (2 * r) ⊆ U)\n (hridge : ∀ x ∈ U, (Df (x, h x)).comp (ContinuousLinearMap.inr ℝ ℝ E) = 0)\n (hh : ∀ x ∈ Icc (-2 * r) (2 * r), HasDerivAt h (h' x) x)\n (hD2 : ∀ x ∈ Icc (-2 * r) (2 * r), HasFDerivAt Df (D2f (x, h x)) (x, h x))\n (hsym : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v w, D2f (x, h x) v w = D2f (x, h x) w v)\n (hneg : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ v : E, D2f (x, h x) (0, v) (0, v) ≤ -δ * ‖v‖ ^ 2)\n (hu : ∀ x ∈ Icc (-2 * r) (2 * r), ‖h' x‖ ≤ u)\n (hΦ : ∀ x ∈ Icc (-2 * r) (2 * r), ∀ b : E,\n HasDerivAt (fun s => D2f (s, h s) (1, b) (1, b)) (Φ x b" + }, + { + "kind": "theorem", + "unqualified_name": "dx_grad_increment", + "line": 2041, + "source_header": "iableWithinAt) ?_\n intro x1 hx1 x2 hx2 hle\n rw [(hF x1 (interior_subset hx1)).deriv, (hF x2 (interior_subset hx2)).deriv]\n exact hmono (interior_subset hx1) (interior_subset hx2) hle\n\n\n/-- **L3 in `y` for `∂_x ∇_y f`.** If along the segment `s ↦ (x, s • y)` the third derivatives\nsatisfy `|T (1, 0) (0, v) (0, y)| ≤ m ‖v‖ ‖y‖` (the block `f_xyy`), then\n`‖∂_x ∇_y f (x, y) - ∂_x ∇_y f (x, 0)‖ ≤ m ‖y‖`. -/\ntheorem dx_grad_increment {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {x m : ℝ} {y : E} (hm : 0 ≤ m)\n (hD3 : ∀ s ∈ Icc (0 : ℝ) 1, ∀ a b : ℝ × E,\n HasFDerivAt (fun q => D2f q a b) (T3 (x, s • y) a b) (x, s • y))\n (hT : ∀ s ∈ Icc (0 : ℝ) 1, ∀ v : E, |T3 (x" + }, + { + "kind": "theorem", + "unqualified_name": "l9_arith", + "line": 2070, + "source_header": "ontinuousLinearMap.comp_apply,\n ContinuousLinearMap.inr_apply]\n calc ‖(D2f (x, y)) (1, 0) (0, v) - (D2f (x, 0)) (1, 0) (0, v)‖ ≤ m * ‖v‖ * ‖y‖ := this\n _ = m * ‖y‖ * ‖v‖ := by ring\n\n/-- **L9's arithmetic.** From `δ ‖h'‖ ≤ ‖∂_x∇_y f(x, h)‖ ≤ 2mr + m‖h‖` and `δ ‖h‖ ≤ 2mr²`:\n`‖h'‖ ≤ 2s + 2s²` with `s = mr/δ` (SP: `u = 2/k + 2/k²`). -" + }, + { + "kind": "theorem", + "unqualified_name": "l12_lower", + "line": 2082, + "source_header": "nlinarith\n have hrhs : 2 * (m * r / δ) + 2 * (m * r / δ) ^ 2 =\n (2 * m * r * δ + 2 * m * m * r ^ 2) / (δ * δ) := by\n field_simp\n rw [hrhs, le_div_iff₀ (by positivity)]\n linarith\n\n/-- **L12's bound at one point.** With the combined block bound, `f_xxx ≥ 7/4`, `‖a‖, ‖b‖ ≤ u`\nand `7/4 - m((1 + u)³ - 1) ≥ 1/4` (`l12_constants`): `T (1, b) (1, b) (1, a) ≥ 1/4`. -/\ntheorem l12_lower {T : ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {m u : ℝ} {a b : E} (hm : 0 ≤ m)\n (hT : ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_source_facts", + "line": 2103, + "source_header": "(mul_le_mul hb1 hb1 (by linarith) (by linarith)) ha1 (by linarith)\n (mul_nonneg (by linarith) (by linarith))\n have h5 := mul_le_mul_of_nonneg_left (sub_le_sub_right h4 1) hm\n linarith\n\n/-- **The ridge facts from SP's source data.** Under the hypotheses of `ridge_capHyp_source`, for a\nridge `h` on the collar: `m ≥ 2`, `δ = λ - 5rm > rm(8m - 5)`, `h x` lies in the open ball and\n`δ ‖h x‖ ≤ 2mr²` on `[-2r, 2r]` (L5 and L8), `h` is differentiable there (L7), and the transverse\nHessian along the ridge is `δ`-negative definite (L4). -/\ntheorem ridge_source_facts [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) {h : ℝ → E}\n (hhU : ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) :\n 2 ≤ m ∧ r * m * (8 * m - 5) < lam - 5 * r * m ∧\n (∀ x ∈ Icc (-2 * r) (2 * r), h x ∈ Metric.ball (0 : E) (2 * r)) ∧\n (∀ x ∈ Icc (-2 * r) (2 * r), (lam - 5 * r * m" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_C3", + "line": 2269, + "source_header": "(hball x (hIU hx)) (hcrit x (hIU hx))\n (hslice0 x (hUX (hIU hx)))).trans (hw2 x hx),\n ⟨_, fun x hx => (hstrict x hx).hasFDerivAt.hasDerivAt⟩,\n fun x hx v => hneg _ (hridgeX x hx) v⟩\n\n\n/-- **The cap from SP's `C³` source data (L1–L20 composed; L12 proved).** As\n`ridge_capHyp_source`, with L12's `hconv` derived instead of assumed. Additionally assume, on the\ncollar: a second derivative `D2f` of `f`, third derivatives `T3 p a b` of `p ↦ D²f p [a, b]`, every\nthird-derivative block other than `f_xxx` of norm at most `m` (combined form), and `f_xxx ≥ 7/4` on\n`D = [-2r, 2r] × B̄(0, 2r)` (SP's L4, from L2 and (H2), on SP's domain). Then the ridge exists, and every ridge has `h(∓r/2) = 0` and yields\n(C1)–(C3) and (C2⁺) on the cap. Inside: L5 gives `‖w‖ ≤ 2mr²` on `[-2r, 2r]`, L8 `‖h‖ ≤ 2mr²/δ`, L6\n`‖w'‖ ≤ 2mr`, L3 in `y` `‖∂_x∇_y f(x, h)‖ ≤ ‖w'‖ + m‖h‖`, L9 `‖h'‖ ≤ 2s + 2s²` with `s = mr/δ`,\n`trilinear_lower` and `l12_constants` give `F'' ≥ 1/4` in the form of `ridge_hconv`. -/\ntheorem ridge_capHyp_C3 [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}\n {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ a b : ℝ × E, HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hT : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hxxx : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n 7 / 4 ≤ T3 p (1, 0) (1, 0) (1, 0))\n (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r / 2, 0)" + }, + { + "kind": "theorem", + "unqualified_name": "hermite_gap_le_concave", + "line": 2420, + "source_header": "(1, b) (1, b) (1, h' x)) hδ0 isOpen_Ioo hIU\n hridgeU hhd hD2r hsym hnegD hu hΦ\n (fun x hx b hb => l12_lower hm0 (hT _ (hridgeX x hx)) (hxxx _ ⟨hx, hball x (hIU hx)⟩) hc\n (hu x hx) hb)\n\n\n/-! ### L2's second statement and (H2) (v2.0)\n\nSP's L4 lower bound `f_xxx ≥ 7/4` was the last analytic hypothesis of `ridge_capHyp_C3`. It follows\nfrom the normalization (some point of the pin interval has `f_xxx ≥ 2`, by a one-sided Hermite bound)\nand (H2) `rn ≤ 1/20` with a bound `n` on the derivative of `f_xxx`. `ridge_capHyp_C4` takes SP's\nhypotheses only. -/\n\n/-- **L1, one-sided.** As `hermite_gap_le`, from the concave half alone (`G'' ≤ m` weakly):\n`g(a) - g(c) ≤ m (c - a)³/12`. -/\ntheorem hermite_gap_le_concave {g G : ℝ → ℝ} {a c m : ℝ} (" + }, + { + "kind": "theorem", + "unqualified_name": "third_deriv_exists_two", + "line": 2466, + "source_header": "kac\n have e0 : m / 2 * ((c - a) * (a - a) ^ 2 / 2 - (a - a) ^ 3 / 3) = 0 := by ring\n have e1 : m / 2 * ((c - a) * (c - a) ^ 2 / 2 - (c - a) ^ 3 / 3) = m * (c - a) ^ 3 / 12 := by\n ring\n linarith\n\n/-- **L2, second statement.** Under SP's normalization `g(-r/2) - g(r/2) = r³/6` with critical pins,\nif `g''' = φ` is continuous on the pin interval, then `φ(x₀) ≥ 2` for some `x₀` there (SP: the\n`φ`-weighted average of `f_xxx` is `2`). -/\ntheorem third_deriv_exists_two {g G G' φ : ℝ → ℝ} {r : ℝ} (hr : 0 < r)\n (hg : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt g (G x) x)\n (hG : ∀ x ∈ Icc (-r / 2) (r / 2), HasDerivAt G (G' x) x)\n (hG' : ∀ x ∈ Icc (-r / 2) (r / 2), HasDeri" + }, + { + "kind": "theorem", + "unqualified_name": "fxxx_lower", + "line": 2503, + "source_header": "h1 := hermite_gap_le_concave (by linarith) hg hcc hGa hGc\n have hcr : r / 2 - -r / 2 = r := by ring\n rw [hgap, hcr] at h1\n have h2 := hcon x₁ hx₁\n have hr3 : 0 < r ^ 3 := by positivity\n nlinarith\n\n/-- **L4 (`f_xxx ≥ 7/4`).** Let `ψ = f_xxx` have derivative `Dψ` on SP's domain\n`D = [-2r, 2r] × B̄(0, 2r)`, with the two fourth-order blocks bounded by `n = M_4` there:\n`|∂_x ψ| = |Dψ (1, 0)| ≤ n` and `‖D_y ψ‖ = ‖Dψ ∘ inr‖ ≤ n`. If `ψ(x₀, 0) ≥ 2` at a point of the pin\ninterval and (H2) `rn ≤ 1/20`, then `ψ ≥ 7/4` on `D` (the proof bounds `ψ ≥ 2 - 9rn/2`; the\nstatement exports `7/4`). As in SP's L3, move first in `x`\nalong `y = 0` (`|Δx| ≤ 5r/2`), then along the ray to `y` (`‖Δy‖ ≤ 2r`); SP rounds `9r/2` up to `5r`. -/\ntheorem fxxx_lower {ψ : ℝ × E → ℝ} {Dψ : ℝ × E → ℝ × E →L[ℝ] ℝ} {r n x₀ : ℝ} (hr : 0 < r)\n (hψ : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt ψ (Dψ p) p)\n (hnx : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Dψ p (1, 0)| ≤ n)\n (hny : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Dψ p).comp" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_C4", + "line": 2561, + "source_header": "mp h1').1\n have e2 := (abs_le.mp h2').1\n have h5 : n * |x - x₀| ≤ n * (5 * r / 2) := mul_le_mul_of_nonneg_left hdx hn0\n have h6 : n * ‖y‖ ≤ n * (2 * r) := mul_le_mul_of_nonneg_left hyn hn0\n nlinarith\n\n/-- **The cap from SP's hypotheses (H1), (H2) and the derivative bounds (L1–L20 composed).** As\n`ridge_capHyp_C3`, with `f_xxx ≥ 7/4` derived instead of assumed: from a derivative `Φ4` of `f_xxx`\non `D = [-2r, 2r] × B̄(0, 2r)` whose two blocks `∂_x f_xxx` and `D_y f_xxx` are bounded by\n`n = M_4` there, as in SP, and (H2) `rn ≤ 1/20`. L2's second statement gives `f_xxx(x₀, 0) ≥ 2` on\nthe pin interval (`third_deriv_exists_two`), and `fxxx_lower` gives `f_xxx ≥ 7/4` on `D`. -/\ntheorem ridge_capHyp_C4 [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {Φ4 : ℝ × E → ℝ × E →L[ℝ] ℝ} {n : ℝ}\n {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ a b : ℝ × E, HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hT : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hD4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (Φ4 p) p)\n (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Φ4 p (1, 0)| ≤ n)\n (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Φ4 p).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ n)\n (hH2 : r * n ≤ 1 / 20)\n (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHxb : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), ‖Hx x‖ ≤ m)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hHrb : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, ‖Hr p s‖ ≤ m * ‖p.2‖)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hG0cv : ConvexOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) + m / 2 * t ^ 2))\n (hG0cc : ConcaveOn ℝ (Icc (-r / 2) (r / 2)) (fun t => Df (t, 0) (1, 0) - m / 2 * t ^ 2))\n (hwcv : ∀ v : E, ConvexOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) + m * ‖v‖ / 2 * t ^ 2))\n (hwcc : ∀ v : E, ConcaveOn ℝ (Icc (-2 * r - ε) (2 * r + ε))\n (fun t => Df (t, 0) (0, v) - m * ‖v‖ / 2 * t ^ 2))\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) (-r" + }, + { + "kind": "theorem", + "unqualified_name": "hessian_x_bound", + "line": 2649, + "source_header": "xxx_lower (ψ := fun q => T3 q (1, 0) (1, 0) (1, 0)) hr hD4 hn4x hn4y hx₀ h2 hH2\n exact ridge_capHyp_C3 hr hε hεr hDf hD2 hD3 hT hxxx hGs hH hHx hHxb hHr hHrb hlam hH1 hM hS\n hG0cv hG0cc hwcv hwcc hnorm\n\n\n/-! ### The derivative bounds from the block bound, and SP's bounds on `D` (v2.1)\n\nUp to v2.0 the capstones took six derivative bounds besides the block bound `hT`:\n- `hHxb` and `hHrb`, the inputs of L3;\n- `hwcv` and `hwcc`, the envelope inputs of L5–L6;\n- `hG0cv` and `hG0cc`, the envelope inputs of L1–L2.\n\nAll six follow from `hT` and from `|f_xxx| ≤ m` on the pin segment, and `ridge_capHyp_C5` derives\nthem. Up to v2.0 the bounds `m` were also assumed on a collar `[−2r − ε, 2r + ε]` of SP's `D`.\n`ridge_capHyp_D` assumes them on `D` only, through the continuity step `block_bound_collar` (I3). -/\n\n/-- **L3's `x`-input from the block bound.** Let `y ↦ ∂_y f (t, y)` have derivative `H (t, 0)` at `0`\nand `Df` have derivative `D2f (t, 0)` at `(t, 0)` for every `t ∈ J`, where `J` is uniquely\ndifferentiable at `x ∈ J`. If `t ↦ H (t, 0)` has derivative `Hx'` at `x`, then\n`Hx' v w = T3 (x, 0) [(0, v), (0, w), (1, 0)]`, so `‖Hx'‖ ≤ m` when that block is at most\n`m ‖v‖ ‖w‖`. This derives v1.6's hypothesis `hHxb`. -/\ntheorem hessian_x_bound {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx' : E →L[ℝ] E →L[ℝ] ℝ} {J : Set ℝ} {m x : ℝ}\n (hJ : UniqueDiffWithinAt ℝ J x) (hxJ : x ∈ J) (hm : 0 ≤ m)\n (hH : ∀ t ∈ J, HasFDerivAt (fun y => (Df (t, y)).comp (ContinuousLinearMap.inr ℝ ℝ E))\n (H (t, 0)) 0)\n (hD2 : ∀ t ∈ J, HasFDerivAt Df (D2f (t, 0)) (t, 0))\n (hD" + }, + { + "kind": "theorem", + "unqualified_name": "hessian_r_bound", + "line": 2693, + "source_header": "t\n refine ContinuousLinearMap.opNorm_le_bound _ hm fun v => ?_\n refine ContinuousLinearMap.opNorm_le_bound _ (mul_nonneg hm (norm_nonneg v)) fun w => ?_\n rw [key, Real.norm_eq_abs, mul_assoc]\n exact hT v w\n\n/-- **L3's radial input from the block bound.** Along the radius `τ ↦ (x, τ y)`, `τ ∈ [0, 1]`, if\n`τ ↦ H (x, τ y)` has derivative `Hr'` at `s`, then `Hr' v w = T3 (x, s y) [(0, v), (0, w), (0, y)]`,\nso `‖Hr'‖ ≤ m ‖y‖` when that block is at most `m ‖v‖ ‖w‖ ‖y‖`. The identification uses derivatives\nwithin `[0, 1]`, so the endpoint `τ = 1` may lie on the sphere `‖y‖ = 2r`. This derives v1.6's\nhypothesis `hHrb`. -/\ntheorem hessian_r_bound {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hr' : E →L[ℝ] E →L[ℝ] ℝ} {x m s : ℝ} {y : E}\n (hm : 0 ≤ m) (hs : s ∈ Icc (0 : ℝ) 1)\n (hH : ∀ τ ∈ Icc (0 : ℝ) 1, HasFDerivAt (fun z => (Df (x, z)).comp (ContinuousLinearMap.inr ℝ ℝ E))\n (H (x, τ • y)) (τ • y))\n (hD2 : ∀ τ ∈ Icc (0 : ℝ) 1, HasFDerivAt Df (D2f (x, τ • y)) (x, τ • y))\n (hD3 : ∀ a b : ℝ × E, HasFDerivAt" + }, + { + "kind": "theorem", + "unqualified_name": "axis_convexConcave", + "line": 2730, + "source_header": "ap.opNorm_le_bound _ (mul_nonneg hmy (norm_nonneg v)) fun w => ?_\n rw [key, Real.norm_eq_abs]\n calc |T3 (x, s • y) (0, v) (0, w) (0, y)| ≤ m * (‖v‖ * ‖w‖ * ‖y‖) := hT v w\n _ = m * ‖y‖ * ‖v‖ * ‖w‖ := by ring\n\n/-- **The envelope inputs of L1 and L5–L6 from a second-derivative bound.** If the second derivative\n`T3 (t, 0) [(1, 0), u, (1, 0)]` of `t ↦ Df (t, 0) u` has absolute value at most `B` on `[a, c]`, then\n`Df (·, 0) u + (B/2) t²` is convex and `Df (·, 0) u − (B/2) t²` is concave there. With `u = (0, v)`\nand `B = m‖v‖` (from the block bound) this gives `hwcv` and `hwcc`. With `u = (1, 0)` and `B = m`\n(SP: `|f_xxx| ≤ M₃`) it gives `hG0cv` and `hG0cc`. -/\ntheorem axis_convexConcave {Df : ℝ × E → ℝ × E →L[ℝ] ℝ}\n {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {a c B : ℝ} {u : ℝ × E}\n (hD2 : ∀ t ∈ Icc a c, HasFDerivAt Df (D2f (t, 0)) (t, 0))\n (hD3 : ∀ t ∈ Icc a c, HasFDerivAt (fun q => D2f q (1, 0) u) (T3 (t," + }, + { + "kind": "theorem", + "unqualified_name": "block_nonneg", + "line": 2789, + "source_header": "t ((hg' t (hIo t ht)).sub (hlin t)).hasDerivWithinAt\n · intro t ht\n have := hB t (hIo t ht)\n have := le_abs_self (T3 (t, 0) (1, 0) u (1, 0))\n show T3 (t, 0) (1, 0) u (1, 0) - B ≤ 0\n linarith\n\n/-- The block weig" + }, + { + "kind": "theorem", + "unqualified_name": "block_bound_collar", + "line": 2799, + "source_header": "_right (norm_nonneg _)\n have a3 : |s₃| ≤ |s₃| + ‖y₃‖ := le_add_of_nonneg_right (norm_nonneg _)\n have := mul_le_mul (mul_le_mul a1 a2 (abs_nonneg _) (by positivity)) a3 (abs_nonneg _)\n (by positivity)\n linarith\n\n/-- **The continuity step of I3: the block bound from `D` to a collar.** Assume the block bound holds\nwith `m` on SP's `D = [−2r, 2r] × B̄(0, 2r)`. Assume also that on the collar\n`[−2r − ε₀, 2r + ε₀] × B̄(0, 2r)` the `x`-derivative `T4` of `T3` exists and satisfies the same block\nbound with some `K ≥ 0` (SP: `f ∈ C⁴` near `D`, so `‖D⁴ f‖` is bounded on a compact collar). Then the\nblock bound holds with `m + Kε` on the collar of width `ε ≤ ε₀`. Each collar point `(x, y)` is\nwithin `ε` of a point `(x₀, y) ∈ D`, and the mean value inequality along `x` gives the rest. -/\ntheorem block_bound_collar {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ}\n {T4 : ℝ × E → ℝ × E → ℝ × E → ℝ × E → ℝ} {r m K ε₀ ε : ℝ} (hr : 0 < r) (hK : 0 ≤ K)\n (hε : 0 ≤ ε) (hεε : ε ≤ ε₀)\n (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hD4x : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ a b c : ℝ × E, HasDerivAt (fun t => T3 (t, p.2) a b c) (T4 p a b c) p.1)\n (hT4 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T4 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T4 p (1, 0) (1, 0) (1, 0)| ≤\n K * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|)) :\n ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_C5", + "line": 2862, + "source_header": "y₃\n have hKX : 0 ≤ K * X := mul_nonneg hK hX\n have h3 : K * X * |x - x₀| ≤ K * X * ε := mul_le_mul_of_nonneg_left hxx₀ hKX\n have h4 := abs_sub_abs_le_abs_sub (g x) (g x₀)\n show |g x| ≤ (m + K * ε) * X\n nlinarith\n\n/-- **The cap from the block bound alone.** `ridge_capHyp_C4` with its six derivative-bound\nhypotheses derived. `hHxb`, `hHrb`, `hwcv` and `hwcc` come from the block bound `hT`\n(`hessian_x_bound`, `hessian_r_bound`, `axis_convexConcave`). `hG0cv` and `hG0cc` come from\n`|f_xxx| ≤ m` on the pin segment (`hTe`, SP: `|f_xxx| ≤ M₃`). The conclusion is unchanged. -/\ntheorem ridge_capHyp_C5 [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {Φ4 : ℝ × E → ℝ × E →L[ℝ] ℝ} {n : ℝ}\n {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m lam ε : ℝ} (hr : 0 < r) (hε : 0 < ε)\n (hεr : ε ≤ r / 2)\n (hDf : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ a b : ℝ × E, HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hT : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |T3 (x, 0) (1, 0) (1, 0) (1, 0)| ≤ m)\n (hD4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (Φ4 p) p)\n (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Φ4 p (1, 0)| ≤ n)\n (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Φ4 p).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ n)\n (hH2 : r * n ≤ 1 / 20)\n (hGs : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε) (2 * r + ε), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHr : ∀ p ∈ Icc (-2 * r - ε) (2 * r + ε) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E)" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_D", + "line": 2948, + "source_header": "(fun t ht => hD3 _ (hpin t ht) (1, 0) (1, 0)) hTe\n exact ridge_capHyp_C4 hr hε hεr hDf hD2 hD3 hT hD4 hn4x hn4y hH2 hGs hH hHx hHxb hHr hHrb hlam\n hH1 hM hS hG0.1 hG0.2 (fun v => (hw v).1) (fun v => (hw v).2) hnorm\n\n/-- **The cap from SP's bounds on `D` (the continuity step of I3).** The quantitative hypotheses are\nassumed on SP's `D` only:\n- the block bound `m` and `|f_xxx| ≤ m` on the pin segment;\n- SP's `M₄` blocks `n`;\n- (H1) and (H2).\n\nOn a collar of some width `ε₀ > 0`, only qualitative data are assumed: the derivatives, the strict\nderivative of `∂_y f`, and some bound `K ≥ 0` on the `x`-derivative of `T3` in block form (SP:\n`f ∈ C⁴` near `D`). Because (H1) is strict, some `ε ∈ (0, ε₀]` keeps `8r(m + Kε)² < λ`.\n`ridge_capHyp_C5` then applies with `m + Kε` (`block_bound_collar`). -/\ntheorem ridge_capHyp_D [FiniteDimensional ℝ E] {f : ℝ × E → ℝ}\n {Df : ℝ × E → ℝ × E →L[ℝ] ℝ} {D2f : ℝ × E → ℝ × E →L[ℝ] ℝ × E →L[ℝ] ℝ}\n {T3 : ℝ × E → ℝ × E → ℝ × E → ℝ × E →L[ℝ] ℝ} {T4 : ℝ × E → ℝ × E → ℝ × E → ℝ × E → ℝ}\n {Φ4 : ℝ × E → ℝ × E →L[ℝ] ℝ} {n : ℝ}\n {DG : ℝ × E → ℝ × E →L[ℝ] E →L[ℝ] ℝ}\n {H : ℝ × E → E →L[ℝ] E →L[ℝ] ℝ} {Hx : ℝ → E →L[ℝ] E →L[ℝ] ℝ}\n {Hr : ℝ × E → ℝ → E →L[ℝ] E →L[ℝ] ℝ} {r m K lam ε₀ : ℝ} (hr : 0 < r) (hε₀ : 0 < ε₀)\n (hK : 0 ≤ K)\n (hDf : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt f (Df p) p)\n (hD2 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r), HasFDerivAt Df (D2f p) p)\n (hD3 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ a b : ℝ × E,\n HasFDerivAt (fun q => D2f q a b) (T3 p a b) p)\n (hD4x : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ a b c : ℝ × E, HasDerivAt (fun t => T3 (t, p.2) a b c) (T4 p a b c) p.1)\n (hT4 : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T4 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T4 p (1, 0) (1, 0) (1, 0)| ≤\n K * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |T3 p (s₁, y₁) (s₂, y₂) (s₃, y₃) - s₁ * s₂ * s₃ * T3 p (1, 0) (1, 0) (1, 0)| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |T3 (x, 0) (1, 0) (1, 0) (1, 0)| ≤ m)\n (hD4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun q => T3 q (1, 0) (1, 0) (1, 0)) (Φ4 p) p)\n (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), |Φ4 p (1, 0)| ≤ n)\n (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ‖(Φ4 p).comp (ContinuousLinearMap.inr ℝ ℝ E)‖ ≤ n)\n (hH2 : r * n ≤ 1 / 20)\n (hGs : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasStrictFDerivAt (fun q => (Df q).comp (ContinuousLinearMap.inr ℝ ℝ E)) (DG p) p)\n (hH : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n HasFDerivAt (fun y => (Df (p.1, y)).comp (ContinuousLinearMap.inr ℝ ℝ E)) (H p) p.2)\n (hHx : ∀ x ∈ Icc (-2 * r - ε₀) (2 * r + ε₀), HasDerivAt (fun t => H (t, 0)) (Hx x) x)\n (hHr : ∀ p ∈ Icc (-2 * r - ε₀) (2 * r + ε₀) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ s ∈ Icc (0 : ℝ) 1, HasDerivAt (fun s : ℝ => H (p.1, s • p.2)) (Hr p s) s)\n (hlam : ∀ v : E, H (-r / 2, 0) v v ≤ -lam * ‖v‖ ^ 2) (hH1 : 8 * r * m ^ 2 < lam)\n (hM : Df (-r / 2, 0) = 0) (hS : Df (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n ∃ ε, 0 < ε ∧ ε ≤ ε₀ ∧\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 :" + }, + { + "kind": "theorem", + "unqualified_name": "block_of_norm", + "line": 3028, + "source_header": "hD4x hT4) (fun x hx => (hTe x hx).trans hmm)\n hD4 hn4x hn4y hH2 (fun p hp => hGs p (hsub p hp)) (fun p hp => hH p (hsub p hp))\n (fun x hx => hHx x (hsubI x hx)) (fun p hp => hHr p (hsub p hp)) hlam hH1' hM hS hnorm⟩\n\n\n/-! ### SP's `f ∈ C⁴` near `D` supplies the collar data (v2.2)\n\n`block_of_norm` turns a bound on the norm of a trilinear form into the block bound, and\n`collar_subset_open` finds a closed collar inside an open neighbourhood of `D`. `ridge_capHyp_E`\ntakes `f ∈ C⁴` on an open `U ⊇ D` and SP's quantitative bounds on `D`, written with the iterated\nderivatives `iteratedFDeriv ℝ k f`. It builds every derivative datum of `ridge_capHyp_D` from `f`,\nand it takes the collar width from `collar_subset_open` and `K` from the continuity of `D⁴f` on the\ncompact collar. -/\n\n/-- **The block bound from the norm.** A trilinear form `B` on `ℝ × E` with `‖B‖ ≤ K` satisfies\nthe block bound with constant `K`. For `a = (s₁, y₁)`, `b = (s₂, y₂)`, `c = (s₃, y₃)` and\n`e = (1, 0)`:\n`|B(a, b, c) - s₁s₂s₃ B(e, e, e)| ≤ K((|s₁| + ‖y₁‖)(|s₂| + ‖y₂‖)(|s₃| + ‖y₃‖) - |s₁||s₂||s₃|)`.\nReplacing one slot at a time by `sᵢ e` leaves three terms, and each has a transverse argument\n`(0, yᵢ)`. -/\ntheorem block_of_norm {B : ContinuousMultilinearMap ℝ (fun _ : Fin 3 => ℝ × E) ℝ}" + }, + { + "kind": "theorem", + "unqualified_name": "collar_subset_open", + "line": 3124, + "source_header": "0, hne, hne]\n calc _ ≤ _ := abs_add_three _ _ _\n _ ≤ K * ‖y₁‖ * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) + K * |s₁| * ‖y₂‖ * (|s₃| + ‖y₃‖) +\n K * |s₁| * |s₂| * ‖y₃‖ := by gcongr\n _ = _ := by ring\n\nomit [NormedSpace ℝ E] in\n/-- **A collar inside a neighbourhood of `D`.** If an open `U` contains\n`D = [-2r, 2r] × B̄(0, 2r)` and `E` is proper, then some closed collar\n`[-2r - ε₀, 2r + ε₀] × B̄(0, 2r)` with `ε₀ > 0` lies in `U`: `D` is compact, so a closed\nthickening of `D` lies in `U`. -/\ntheorem collar_subset_open [Prop" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_E", + "line": 3149, + "source_header": ";> linarith [hx.2]\n · exact ⟨x, ⟨by linarith, by linarith⟩, by simp [hδ.le]⟩\n refine Metric.mem_cthickening_of_dist_le (x, y) (x₀, y) δ _ ⟨hx₀, hy⟩ ?_\n rw [Prod.dist_eq, dist_self, Real.dist_eq]\n exact max_le hxx₀ hδ.le\n\n/-- **The cap from `f ∈ C⁴` near `D` and SP's bounds on `D` (I3's qualitative part).** Assume\nthat `f` is `C⁴` on an open `U ⊇ D` (SP: `f ∈ C⁴` near `D`). Assume also SP's quantitative\nhypotheses on `D`, written with `D^k f(p)[v₁, …, v_k] = iteratedFDeriv ℝ k f p ![v₁, …, v_k]` and\n`e = (1, 0)`:\n- the block bound `m` on `D³f`, and `|f_xxx| ≤ m` on the pin segment;\n- SP's `M₄` blocks `n`: `|D⁴f[e, e, e, e]| ≤ n` and `|D⁴f[(0, v), e, e, e]| ≤ n‖v‖`;\n- (H1): `D²f(M)[(0, v), (0, v)] ≤ -λ‖v‖²` with `8rm² < λ`; and (H2);\n- `M = (-r/2, 0)` and `S = (r/2, 0)` are critical, and `f(M) - f(S) = r³/6`.\n\nThen `ridge_capHyp_D` applies. Its collar width comes from `collar_subset_open`, and its derivative\ndata are the Fréchet derivatives of `f` (`T3`, `T4` and `Φ4` are slices of `D³f` and `D⁴f`). Its\n`K` bounds `‖D⁴f‖` on the compact collar. No derivative datum and no bound off `D` is assumed. -/\ntheorem ridge_capHyp_E [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}\n {r m n lam : ℝ} (hr : 0 < r) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 f U)\n (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |iteratedFDeriv ℝ 3 f p ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] -\n s₁ * s₂ * s₃ * iteratedFDeriv ℝ 3 f p ![(1, 0), (1, 0), (1, 0)]| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ m)\n (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ n)\n (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,\n |iteratedFDeriv ℝ 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ n * ‖v‖)\n (hH2 : r * n ≤ 1 / 20)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)\n (hH1 : 8 * r * m ^ 2 < lam)\n (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = r ^ 3 / 6) :\n ∃ ε, 0 < ε ∧\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r / 2) = 0 ∧\n CapHyp f (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBa" + }, + { + "kind": "def", + "unqualified_name": "toyF", + "line": 3315, + "source_header": "f := fun s : ℝ => ((p.1, s • p.2) : ℝ × E)) s (dD3 _ hmem) hp'))\n (fun v => by\n have h := hlam v\n rw [← hD2] at h\n exact h)\n hH1 hM hS hnorm\n obtain ⟨ε, hε, -, hrest⟩ := key\n exact ⟨ε, hε, hrest⟩\n\nend Slice\n\n/-! ### A concrete instance and the necessity of each hypothesis\n\nOn `ℝ`, `toyF x = max (-|x|) (x - 2)` has a local maximum `M = 0` at height `b = 0`, a\nseparating local minimum `S = 1` at height `s = -1`, and an older point `z = 3` at height `1`.\nThe cap is `[-2, 1]`. The instance sho" + }, + { + "kind": "def", + "unqualified_name": "toyRidge", + "line": 3326, + "source_header": "tisfiable (the theorems are not\nvacuous), and the three counterexamples show that dropping (C" + }, + { + "kind": "theorem", + "unqualified_name": "toy_ridge_ge", + "line": 3333, + "source_header": "ax (-|x|) (x - 2)\n\n/-- The toy ridge, `t ↦ 3t` from `0` to `3" + }, + { + "kind": "theorem", + "unqualified_name": "toy_frontier", + "line": 3342, + "source_header": ") ≤ t := t.2.1\n show -1 ≤ max (-|3 * (t : ℝ)|) (3 * (t : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "toy_capHyp", + "line": 3344, + "source_header": "t : ℝ)) 1 with h | h\n · refine le_max_of_le_left ?_\n rw [abs_of_nonneg (by linarith)]\n linarith\n · exact le_max_of_le_right (by linarith)\n\ntheorem toy_front" + }, + { + "kind": "theorem", + "unqualified_name": "toy_saddle_strict", + "line": 3363, + "source_header": "(-|(-2 : ℝ)|) ((-2 : ℝ) - 2) ≤ -1\n norm_num [abs_of_neg]\n · show max (-|(1 : ℝ)|) ((1 : ℝ) - 2) ≤ -1\n norm_num\n older := by\n show (0 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "toy_saddle_cut", + "line": 3372, + "source_header": "_saddle_strict : ∀ x ∈ frontier (Icc (-2 : ℝ) 1), x ≠ 1 → toyF x < -1 := by\n intro x hx hne\n rw [toy_frontier] at hx\n rcases hx with rfl | h\n · show max (-|(-2 : ℝ)|) ((-2 : ℝ) - 2) < -1\n norm_num [abs_of_neg]\n · exact absurd h hne\n\n/-- In the toy, removing `S = 1` from `{f ≥ -1}` disconnects `M = 0` from every olde" + }, + { + "kind": "theorem", + "unqualified_name": "toy_death_level", + "line": 3379, + "source_header": "ent. -/\ntheorem toy_saddle_cut :\n (0 : ℝ) ∈ connectedComponentIn ({x | (-1 : ℝ) ≤ toyF x} \\ {1}) 0 ∧\n ∀ w ∈" + }, + { + "kind": "theorem", + "unqualified_name": "toy_f_M", + "line": 3383, + "source_header": ") ≤ toyF x} \\ {1}) 0, toyF w ≤" + }, + { + "kind": "theorem", + "unqualified_name": "toy_f_S", + "line": 3387, + "source_header": "m)\n\n/-- The toy's elder death l" + }, + { + "kind": "theorem", + "unqualified_name": "toy_needs_C2", + "line": 3391, + "source_header": "p.joinedLevels toyF 0 0) (-1) :=\n toy_capHyp.elder_death_level\n\ntheorem toy_f_M : toyF 0 = 0 := by\n show max (-|(0 : ℝ)|) ((0 : ℝ) - 2) = 0\n norm_num\n\ntheorem toy_f_S : toyF 1 = -1 := by\n show max (-|(1 : ℝ)|) ((1 : ℝ) - 2) = -1\n norm_num\n\n/-- Necessity of (C2). At the level `s = -3/2`, (C1) and (C3) hold, (C2) fails (the frontier point\n`1` has height `-1 > -3/2`), and the maximin level is not `-3/2`. -/\ntheorem toy" + }, + { + "kind": "theorem", + "unqualified_name": "toy_needs_C1", + "line": 3409, + "source_header": "h 1 (by rw [toy_frontier]; simp)\n rw [toy_f_S] at h1\n norm_num at h1\n · rintro ⟨-, hub⟩\n have hmem : (-1 : ℝ) ∈ connectionLevels toyF 0 0 :=\n ⟨3, toyRidge, toy_capHyp.older, toy_ridge_ge⟩\n have := hub hmem\n norm_num at this\n\n/-- Necessity of (C1). At the ceiling `b = -1/2`, (C2) and (C3) hold, (C1) fails (`f M = 0 > -1/2`),\nand the constant path at `M` shows that the maximin level is not `-1`. -/\ntheorem toy_ne" + }, + { + "kind": "theorem", + "unqualified_name": "toy_needs_C3", + "line": 3427, + "source_header": "um⟩\n rw [toy_f_M] at h1\n norm_num at h1\n · rintro ⟨-, hub⟩\n have hmem : (0 : ℝ) ∈ connectionLevels toyF 0 (-1 / 2) :=\n ⟨0, Path.refl 0, by rw [toy_f_M]; norm_num, fun t => by simp [toy_f_M]⟩\n have := hub hmem\n norm_num at this\n\n/-- Necessity of (C3). At the level `s = 5`, (C1) and (C2) hold and `z` is older, but no ridge stays\nat height `≥ 5` (it starts at `f M = 0`), and the maximin level is not `5`: the barrier at the true\nlevel `-1` exclud" + }, + { + "kind": "def", + "unqualified_name": "ridgeToyF", + "line": 3445, + "source_header": ".frontier_le x hx) (by norm_num),\n toy_capHyp.older, ?_, ?_⟩\n · rintro ⟨γ, hγ⟩\n have h0 := hγ 0\n rw [Path.source, toy_f_M] at h0\n norm_num at h0\n · rintro ⟨hmem, -⟩\n have h1 := toy_capHyp.ma" + }, + { + "kind": "theorem", + "unqualified_name": "ridgeToy_capHyp", + "line": 3449, + "source_header": "m at h1\n\n/-- The ridge toy: SP's normalization at `r = 1` with one transverse coordinate,\n`f (x, y) = x³/3 - x/4 - y²`, ridge `h = 0`, ridge derivative `F x = x² - 1/4`. -/\nnoncomputable def ridgeToyF (p : ℝ × ℝ) : ℝ := p.1 ^ 3 / 3 - p.1 / 4 - p.2 ^ 2\n\n/-- The ridge hypotheses of `ridge_capHyp` are jointly satisfiable. Here the g" + }, + { + "kind": "theorem", + "unqualified_name": "ridgeToy_saddle_strict", + "line": 3485, + "source_header": "by rw [← sq_abs, hy]; norm_num\n simp only [ridgeToyF, hy2]\n nlinarith [mul_nonneg (sub_nonneg.mpr hx2) (sq_nonneg x),\n mul_nonneg (by linarith : (0 : ℝ) ≤ x + 2) (by linarith : (0 : ℝ) ≤ 2 - x)]\n · simp\n · simp only [ridgeToyF]\n norm_num\n\n/--" + }, + { + "kind": "theorem", + "unqualified_name": "ridgeToy_joint", + "line": 3523, + "source_header": "^ 2 = 4 := by rw [← sq_abs, hy]; norm_num\n simp only [ridgeToyF, hy2]\n nlinarith [mul_nonneg (sub_nonneg.mpr hx2) (sq_nonneg x),\n mul_nonneg (by linarith : (0 : ℝ) ≤ x + 2) (by linarith : (0 : ℝ) ≤ 2 - x)]\n · simp only [ridgeToyF]\n norm_num\n\n/-! ### The ridge toy through the slice route -/\n\n/-- The ridge toy's joint derivative along the ridge `y = 0` is `D x = (x² - 1/4) · dx`. Its\ntransverse part vanishes (the ridge equation), and `D x (1, 0) = x² - 1/4 = F x`. -/\ntheorem ridgeToy_joint (x : ℝ) :\n HasFDer" + }, + { + "kind": "theorem", + "unqualified_name": "ridgeToy_slices", + "line": 3546, + "source_header": "hasDerivAt_pow 2 (0 : ℝ)\n have h1 := hu.comp_hasFDerivAt ((x, (0 : ℝ)) : ℝ × ℝ) (hasFDerivAt_fst (𝕜 := ℝ))\n have h2 := hv.comp_hasFDerivAt ((x, (0 : ℝ)) : ℝ × ℝ) (hasFDerivAt_snd (𝕜 := ℝ))\n convert h1.sub h2 using 1\n · funext p; simp [ridgeToyF]\n · simp\n\n/-- **The slice route is jointly satisfiable.** The ridge toy (`r = 1`, `h = 0`) meets every\ninput of `ridge_inputs_of_joint` and `ridge_capHyp_of_slices`, with `δ = 2` (each slice is\n`-y²` plus a constant), `w = 0`, `ω = 0`, and the curvature condition\n`2δ(b - s) = 2/3 < 16 = (2rδ - ω)²`. The combined theorems re-derive (C1)–(C3) and (C2⁺). -/\ntheorem ridgeToy_slices :\n CapHyp ridgeToyF (Icc (-2 * 1) (1 / 2" + }, + { + "kind": "def", + "unqualified_name": "spToyF", + "line": 3589, + "source_header": "4) (convex_closedBall (0 : ℝ) (2 * 1))).congr ?_\n intro y _\n simp only [ridgeToyF, Real.norm_eq_abs, sq_abs]\n ring\n · intro x _\n simp\n · intro x _\n simp\n · norm_num\n · simp only [ridgeToyF]\n norm_" + }, + { + "kind": "theorem", + "unqualified_name": "spToy_capHyp", + "line": 3594, + "source_header": "um\n\n\n/-- A field that meets SP's normalized hypotheses: `f (x, y) = x³/3 - x/4 - 12 y²`, so `m = 2`\n(`f_xxx = 2`), `δ = 24 > r m (8m - 5) = 22` at `r = 1`, and gap exactly `r³/6`. -/\nnoncomputable def spToyF (p : ℝ × ℝ) : ℝ := p.1 ^ 3 / 3 - p.1 / 4 - 12 * p.2 ^ 2\n\n/-- **`ridge_capHyp_sp` is not vacuous.** `spToyF` meets every hypothesis, with `h = 0`, `w = 0`,\n`F = x² - 1/4`, `m = 2` and `δ = 24`. -/\ntheorem spToy_capHyp :\n CapHyp spToyF (Icc" + }, + { + "kind": "theorem", + "unqualified_name": "spToy_normalized", + "line": 3654, + "source_header": "veOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n intro t _\n simp only [smul_eq_mul, zero_apply]\n ring\n · simp only [spToyF]\n norm_num\n\n\n/-- **`ridge_capHyp_normalized` is not vacuous.** `spToyF` meets every hypothesis, with\n`G0 = x² - 1/4` (so `|G0''| = 2 = m`) and gap exactly `1/6`. -/\ntheorem spToy_normalized :\n CapHyp spToyF (I" + }, + { + "kind": "def", + "unqualified_name": "h1ToyF", + "line": 3722, + "source_header": "caveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n i" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_capHyp", + "line": 3727, + "source_header": "o_apply]\n ring\n · simp only [spToyF]\n norm_num\n\n\n/-- A field meeting (H1): `f (x, y) = x³/3 - x/4 - 20 y²`, so `λ = 40 > 8 r m² = 32` at `r = 1`,\n`m = 2`, and gap exactly `r³/6`. -/\nnoncomputable def h1ToyF (p : ℝ × ℝ) : ℝ := p.1 ^ 3 / 3 - p.1 / 4 - 20 * p.2 ^ 2\n\n/-- **`ridge_capHyp_H1` is not vacuous.** `h1ToyF` meets every hypothesis, with a constant\ntransverse Hessian `-40`, `h = 0`, `w = 0`, `G0 = F = x² - 1/4`, `m = 2` and `λ = 40`. -/\ntheorem h1Toy_capHyp :\n CapHyp h1Toy" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_ridge_differentiable", + "line": 3812, + "source_header": "ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n intro t _\n simp only [smul_eq_mul, zero_apply]\n ring\n · simp only [h1ToyF]\n norm_num\n\n\n/-- **`ridge_differentiable` is not vacuous.** For `h1ToyF`, with `h = 0`, transverse gradient\n`G (x, y) = -40 y`, its constant derivative `DG = -40 · snd`, `δ = 40` and `U = (-3, 3)`, the\nstatement lists every hypothesis of `ridge_differentiable` at this instance, and its last\nconjunct is that theorem's conclusion, obtained by applying it. -/\ntheorem h1Toy_ridge_differentiable :\n IsOpen (Ioo (-3 : ℝ) 3) ∧ Icc (-2 * (1 : ℝ)) (2 * 1) ⊆ Ioo (-3) 3 ∧\n (∀ x ∈ Ioo (-3 : ℝ) 3,\n StrongConcaveOn (Metric.closedBall (0 : ℝ) (2 * 1)) 40 (fun y => h1ToyF (x, y))) ∧\n (∀ x ∈ Ioo (-3 : ℝ) 3, (0 : ℝ) ∈ Metric.closedBall (0 : ℝ) (2 * 1)) ∧\n (∀ x ∈ Ioo (-3 : ℝ) 3, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0) ∧\n (∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), (0 : ℝ) ∈ Metric.ball (0 : ℝ) (2 * 1)) ∧\n (∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), ∀ᶠ v in nhds (x, (0 : ℝ)),\n HasFDerivAt (fun y => h1ToyF (v.1, y)) (ContinuousLinearMap.mul ℝ ℝ (-40 * v.2)) v.2) ∧\n (∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1),\n HasStrictFDerivAt (fun p : ℝ × ℝ => ContinuousLinearMap.mul ℝ ℝ (-40 * p.2))\n (((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) (x, 0)) ∧\n (∀ v : ℝ, ((((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ) ∘L\n ContinuousLinearMap.inr ℝ ℝ ℝ) v v ≤ -40 * ‖v‖ ^ 2) ∧\n ∀ x ∈ Icc (-2 * (1 : ℝ)) (2 * 1), HasStrictFDerivAt (fun _ : ℝ => (0 : ℝ))" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_source", + "line": 3887, + "source_header": "-40 * p.2))\n (DG := fun _ => ((-40 : ℝ) • ContinuousLinearMap.mul ℝ ℝ) ∘L ContinuousLinearMap.snd ℝ ℝ ℝ)\n (h := fun _ => (0 : ℝ)) (U := Ioo (-3) 3) (r := 1) (δ := 40) (by norm_num) isOpen_Ioo hIU\n hconc hball hcrit hint hG (fun x _ => hGs (x, 0)) (fun _ _ => hneg)\n\n/-- **`ridge_capHyp_source` is not vacuous.** `h1ToyF` meets every source hypothesis on the full\ncollar `[-5/2, 5/2] × B̄(0, 2)` (`ε = 1/2`): joint derivative `(x² - 1/4, -40y)`, transverse gradient `-40y`\nwith derivative `-40 · snd`, constant transverse Hessian `-40`, `m = 2`, `λ = 40 > 32`, pins\n`(∓1/2, 0)` and gap `1/6`. The theorem then gives the ridge, and for `h = 0`, which meets L12\n(`F = x² - 1/4`), the cap with `M = (-1/2, 0)`. -/\ntheorem h1Toy_source :\n (∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - 1 / 2 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_C3", + "line": 3987, + "source_header": "nly [smul_eq_mul]\n simp\n · intro v\n have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n intro t _\n simp only [smul_eq_mul]\n simp\n\n/-- **`ridge_capHyp_C3` is not vacuous.** `h1ToyF` meets every hypothesis of `ridge_capHyp_C3`\non the collar `ε = 1/2`: besides the data of `h1Toy_source`, second derivative\n`D²f = diag(2x, -40)`, third derivatives `T a b = 2 a₁ b₁ · fst` (only `f_xxx = 2 ≥ 7/4` is nonzero,\nso every other block vanishes). The theorem then gives the ridge and the cap with `M = (-1/2, 0)`,\nwith L12 derived rather than supplied. -/\ntheorem h1Toy_C3 :\n (∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - 1 / 2 :" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_C4", + "line": 4132, + "source_header": "only [smul_eq_mul]\n simp\n · intro v\n have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n intro t _\n simp only [smul_eq_mul]\n simp\n\n/-- **`ridge_capHyp_C4` is not vacuous.** `h1ToyF` meets every hypothesis of `ridge_capHyp_C4`\non the collar `ε = 1/2`: the data of `h1Toy_C3`, with `f_xxx = 2` constant, so its derivative is `0`,\nboth fourth-order blocks vanish and (H2) holds with `n = 0`. The theorem gives the ridge and the cap with `M = (-1/2, 0)`, with\nneither L12 nor `f_xxx ≥ 7/4` supplied. -/\ntheorem h1Toy_C4 :\n (∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - 1 / 2" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_D", + "line": 4278, + "source_header": "mp only [smul_eq_mul]\n simp\n · intro v\n have hc : ConcaveOn ℝ univ (fun t : ℝ => -(‖v‖ • t ^ 2)) :=\n ((even_two.convexOn_pow).smul (norm_nonneg v)).neg\n refine (hc.subset (subset_univ _) (convex_Icc _ _)).congr ?_\n intro t _\n simp only [smul_eq_mul]\n simp\n\n/-- **`ridge_capHyp_D` is not vacuous.** `h1ToyF` meets every hypothesis of `ridge_capHyp_D` with\n`ε₀ = 1/2`. `T3` is constant, so `T4 = 0` and `K = 0`, and `|f_xxx| = 2 = m` on the pin segment.\nThe theorem chooses the collar width itself. It gives the ridge on `(−2 − ε, 2 + ε)` for some\n`ε > 0` and the cap with `M = (−1/2, 0)`, from hypotheses on `D` and qualitative collar data only. -/\ntheorem h1Toy_D :\n (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 *" + }, + { + "kind": "theorem", + "unqualified_name": "h1Toy_E", + "line": 4400, + "source_header": "e hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by\n intro x\n have := slice_hasFDerivAt (hDf (x, 0))\n convert this using 1\n ext\n simp\n obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)\n exact ⟨⟨ε, hε, hex⟩, hC⟩\n\n\n/-- **`ridge_capHyp_E` is not vacuous.** `h1ToyF` is a polynomial, so it is `C⁴` on `U = ℝ²`.\nIts third derivative is `D³f[a, b, c] = 2 a.1 b.1 c.1` and its fourth derivative vanishes, so\n`m = 2` and `n = 0`; `D²f[(0, v), (0, v)] = -40 v²` gives `λ = 40`. From these hypotheses on `D`\nalone, the theorem gives the ridge on `(-2 - ε, 2 + ε)` for some `ε > 0` and the cap with\n`M = (-1/2, 0)`. -/\ntheorem h1Toy_E :\n (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2" + }, + { + "kind": "def", + "unqualified_name": "quarticToyF", + "line": 4503, + "source_header": "ave hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => h1ToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by\n intro x\n have := slice_hasFDerivAt (hDf (x, 0))\n convert this using 1\n ext\n simp\n obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)\n exact ⟨⟨ε," + }, + { + "kind": "theorem", + "unqualified_name": "quarticToy_E", + "line": 4510, + "source_header": "`q(x) = (x² - 1/4)²/480` vanishes to second\norder at both pins, so they stay critical and the gap stays `1/6`, while `f_xxx = 2 + x/20` varies\nand `D⁴f = 1/20 ≠ 0`. -/\nnoncomputable def quarticToyF (p : ℝ × ℝ) : ℝ :=\n p.1 ^ 3 / 3 - p.1 / 4 - 20 * p.2 ^ 2 + (p.1 ^ 2 - 1 / 4) ^ 2 / 480\n\n/-- **`ridge_capHyp_E` away from the degenerate face.** On `quarticToyF` the third derivative\n`f_xxx = 2 + x/20` varies, the fourth derivative `D⁴f = 1/20` is nonzero, and (H2) holds with\nequality, `rn = 1/20` (`r = 1`, `n = 1/20`); `|f_xxx| ≤ 81/40 = m` on the pin segment, and (H1) holds\nas `8m² = 32.805 < 40 = λ`. So `fxxx_lower`'s estimate is used with `n > 0` and the collar bound\n`K` is positive, unlike `h1Toy_E` (where `D⁴f = 0`). The theorem gives the ridge on\n`(-2 - ε, 2 + ε)` for some `ε > 0` and the cap with `M = (-1/2, 0)`. -/\ntheorem quarticToy_E :\n (∃ ε > 0, ∃ h : ℝ → ℝ, ∀ x ∈ Ioo (-2 * 1 - ε : ℝ) (2" + }, + { + "kind": "theorem", + "unqualified_name": "of_const_mul", + "line": 4648, + "source_header": "`f(M) − f(S) = k r³`.\n`ridge_capHyp_E` is the case `k = 1/6`. A positive factor `f ↦ c f` multiplies every derivative\nbound and the transverse curvature by `c`, and changes neither the critical points nor the cap. -/\n\nnamespace Ca" + }, + { + "kind": "theorem", + "unqualified_name": "hasFDerivAt_zero_const_mul_iff", + "line": 4665, + "source_header": "e x hx := le_of_mul_le_mul_left (H.frontier_le x hx) hc\n older := lt_of_mul_lt_mul_left H.older hc.le\n ridge := by\n obtain ⟨γ, hγ⟩ := H.ridge\n exact ⟨γ, fun t => le_of_mul_le_mul_left (hγ t) hc⟩\n\nend CapHyp\n\nsection GapK\n\nvariable {E : Type" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedFDeriv_const_mul_of_isOpen", + "line": 4678, + "source_header": "t φ (0 : E →L[ℝ] ℝ) y := by\n constructor\n · intro h\n have h' := h.const_mul c⁻¹\n rw [smul_zero] at h'\n exact h'.congr_of_eventuallyEq\n (Filter.Eventually.of_forall fun y => (inv_mul_cancel_left₀ hc (φ y)).symm)\n · intro h\n have h' := h.const_mul c\n rwa [smul_zero] at h'\n\n/-- On an open set where `f ∈ C⁴`, the derivatives of order `≤" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_K", + "line": 4687, + "source_header": "f U) (c : ℝ) {i : ℕ} (hi : i ≤ 4) {p : ℝ × E} (hp : p ∈ U) :\n iteratedFDeriv ℝ i (fun q => c * f q) p = c • iteratedFDeriv ℝ i f p := by\n have hfa : ContDiffAt ℝ i f p :=\n (hf.contDiffAt (hU.mem_nhds hp)).of_le (by exact_mod_cast hi)\n exact iteratedFDeriv_const_smul_apply' (a := c) hfa\n\n/-- **The cap for every gap `k > 0`** (P §7's event `G_r`). With the pin gap\n`f(M) − f(S) = k r³`, the hypotheses `(4/(3k)) r m² < λ` and `r n ≤ 3k/10` give the conclusion of\n`ridge_capHyp_E`. That theorem is the case `k = 1/6`; the proof applies it to `f / (6k)`. -/\ntheorem ridge_capHyp_K [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}\n {r k m n lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 f U)\n (hT : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ∀ (s₁ s₂ s₃ : ℝ) (y₁ y₂ y₃ : E),\n |iteratedFDeriv ℝ 3 f p ![(s₁, y₁), (s₂, y₂), (s₃, y₃)] -\n s₁ * s₂ * s₃ * iteratedFDeriv ℝ 3 f p ![(1, 0), (1, 0), (1, 0)]| ≤\n m * ((|s₁| + ‖y₁‖) * (|s₂| + ‖y₂‖) * (|s₃| + ‖y₃‖) - |s₁| * |s₂| * |s₃|))\n (hTe : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ m)\n (hn4x : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ n)\n (hn4y : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,\n |iteratedFDeriv ℝ 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ n * ‖v‖)\n (hH2 : r * n ≤ 3 * k / 10)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)\n (hH1 : 4 / (3 * k) * r * m ^ 2 < lam)\n (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :\n ∃ ε, 0 < ε ∧\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r /" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_norm_K", + "line": 4794, + "source_header": ", (hasFDerivAt_zero_const_mul_iff hc.ne').1 (hh x hx).2⟩⟩\n · intro h hh\n obtain ⟨h1, h2, hC, hfr⟩ := hcap h fun x hx =>\n ⟨(hh x hx).1, (hasFDerivAt_zero_const_mul_iff hc.ne').2 (hh x hx).2⟩\n exact ⟨h1, h2, hC.of_const_mul hc, fun x hx hne => lt_of_mul_lt_mul_left (hfr x hx hne) hc.le⟩\n\n/-- **P §7's `G_r` with operator norms.** If `‖D³f‖ ≤ M3` and `‖D⁴f‖ ≤ M4` on\n`D = [−2r, 2r] × B̄(0, 2r)`, then `(4/(3k)) r M3² < λ` and `r M4 ≤ 3k/10` give the cap. Each\npartial-block bound used by `ridge_capHyp_K` is at most the operator norm (`block_of_norm`). -/\ntheorem ridge_capHyp_norm_K [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}\n {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 f U)\n (h3 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖iteratedFDeriv ℝ 3 f p‖ ≤ M3)\n (h4 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n ‖iteratedFDeriv ℝ 4 f p‖ ≤ M4)\n (hH2 : r * M4 ≤ 3 * k / 10)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)\n (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam)\n (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :\n ∃ ε, 0 < ε ∧\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) = 0 ∧ h (r" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedFDeriv_three_swap₁₂", + "line": 4866, + "source_header": "ng the symmetry of\n`D³f`, which holds for `f ∈ C³` (`iteratedFDeriv_three_swap₁₂`, `iteratedFDeriv_three_swap₂₃`).\n`ridge_capHyp_blocks` then states the cap under CAP's hypotheses as written. -/\n\nsection PartialBlock\n\nopen Filter Topology\n\nvariable {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F]\n\n/-- The third derivative of a `C" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedFDeriv_three_swap₂₃", + "line": 4881, + "source_header": "eratedFDeriv ℝ 3 f p ![x, y, c] =\n iteratedFDeriv ℝ 2 (fderiv ℝ f) p ![x, y] c := by\n intro x y\n rw [iteratedFDeriv_succ_apply_right]\n have e : Fin.init ![x, y, c] = ![x, y] := by ext i; fin_cases i <;> rfl\n rw [e]\n rfl\n rw [hr, hr, IsSymmSndFDerivAt.iteratedFDeriv_cons (hf := hs)]\n\n/-- The third derivative of a `C³` function is symmetric in its last two slots: h" + }, + { + "kind": "theorem", + "unqualified_name": "block_of_partial", + "line": 4910, + "source_header": "cc_apply_left]\n have t1 : Fin.tail ![a, b, c] = ![b, c] := by ext i; fin_cases i <;> rfl\n have t2 : Fin.tail ![a, c, b] = ![c, b] := by ext i; fin_cases i <;> rfl\n simp only [Matrix.cons_val_zero, t1, t2]\n rw [← key, ← key, hev.fderiv_eq]\n\nvariable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]\n\n/-- **CAP's partial blocks give the block inequality.** For a symmetric trilinear form `B` on\n`ℝ × E`, bounds by `m` on the three partial blocks with `c = 1, 2, 3` transverse slots, namely\n`|B[(0, y), e, e]| ≤ m‖y‖`, `|B[(0, y₁), (0, y₂), e]| ≤ m‖y₁‖‖y₂‖` and\n`|B[(0, y₁), (0, y₂), (0, y₃)]| ≤ m‖y₁‖‖y₂‖‖y₃‖` with `e = (1, 0)`, give the block inequality `hT` of\n`ridge_capHyp_E` and `ridge_capHyp_K`. The proof expands `B[(s₁, y₁), (s₂, y₂), (s₃, y₃)]`\nmultilinearly: the seven mixed terms are partial blocks in some slot order, symmetry brings each to\nthe canonical order, and their bounds add up to `m(Π(|sᵢ| + ‖yᵢ‖) − Π|sᵢ|)`. No sign of `m` is\nassumed. -/\ntheorem block_of_partial {B : ContinuousMultilinearMap ℝ (fun _ : Fin 3 => ℝ × E) ℝ} {m : ℝ}\n (hs₁₂ : ∀ a b c : ℝ × E, B ![a, b, c] = B ![b, a, c])\n (hs₂₃ : ∀ a b c : ℝ × E, B ![a, b, c] = B ![a, c, b])\n (k₁ : ∀ y : E, |B ![((0 : ℝ), y), (1, 0), (1, 0)]| ≤ m * ‖y‖)\n (k₂ : ∀ y₁ y₂ : E, |B ![((0 : ℝ), y₁), (0, y₂), (1, 0)]| ≤ m" + }, + { + "kind": "theorem", + "unqualified_name": "ridge_capHyp_blocks", + "line": 5004, + "source_header": "_)\n · rw [abs_mul]; exact mul_le_mul_of_nonneg_left b₃ (abs_nonneg _)\n · exact b₄\n · rw [abs_mul, abs_mul]; exact mul_le_mul_of_nonneg_left b₅ (by positivity)\n · rw [abs_mul]; exact mul_le_mul_of_nonneg_left b₆ (abs_nonneg _)\n · rw [abs_mul, abs_mul]; exact mul_le_mul_of_nonneg_left b₇ (by positivity)\n\n/-- **The cap under CAP (1) as written.** `f ∈ C⁴` on an open `U ⊇ D`; CAP's partial-block bounds\non `D` with `M3` for `c = 1, 2, 3` transverse slots, and for `c = 0` on the pin segment only (CAP\nbounds it on all of `D`); the two partial blocks of the fourth derivative that the proof uses,\n`c = 0` and `c = 1`, with `M4`; the transverse curvature `λ` at `M`; and (1),\n`(4/(3k)) r M3² < λ` and `r M4 ≤ 3k/10`, for the pin gap `k r³`. The conclusion is that of\n`ridge_capHyp_K`. -/\ntheorem ridge_capHyp_blocks [FiniteDimensional ℝ E] {f : ℝ × E → ℝ} {U : Set (ℝ × E)}\n {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 f U)\n (h30 : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 f (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ M3)\n (h31 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y : E,\n |iteratedFDeriv ℝ 3 f p ![(0, y), (1, 0), (1, 0)]| ≤ M3 * ‖y‖)\n (h32 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ : E,\n |iteratedFDeriv ℝ 3 f p ![(0, y₁), (0, y₂), (1, 0)]| ≤ M3 * ‖y₁‖ * ‖y₂‖)\n (h33 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ y₃ : E,\n |iteratedFDeriv ℝ 3 f p ![(0, y₁), (0, y₂), (0, y₃)]| ≤ M3 * ‖y₁‖ * ‖y₂‖ * ‖y₃‖)\n (h40 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv ℝ 4 f p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ M4)\n (h41 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,\n |iteratedFDeriv ℝ 4 f p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ M4 * ‖v‖)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 f (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)\n (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam) (hH2 : r * M4 ≤ 3 * k / 10)\n (hM : fderiv ℝ f (-r / 2, 0) = 0) (hS : fderiv ℝ f (r / 2, 0) = 0)\n (hnorm : f (-r / 2, 0) - f (r / 2, 0) = k * r ^ 3) :\n ∃ ε, 0 < ε ∧\n (∃ h : ℝ → E, ∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε), h x ∈ Metric.ball (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) ∧\n ∀ h : ℝ → E, (∀ x ∈ Ioo (-2 * r - ε) (2 * r + ε),\n h x ∈ Metric.closedBall (0 : E) (2 * r) ∧\n HasFDerivAt (fun y => f (x, y)) (0 : E →L[ℝ] ℝ) (h x)) →\n h (-r / 2) =" + }, + { + "kind": "def", + "unqualified_name": "mixedToyF", + "line": 5048, + "source_header": "₃ => ?_) h30 h40 h41 hH2 hlam\n hH1 hM hS hnorm\n have hp3 : ContDiffAt ℝ 3 f p := (hf.contDiffAt (hU.mem_nhds (hDU hp))).of_le (by norm_num)\n exact block_of_partial (iteratedFD" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_blocks", + "line": 5053, + "source_header": "(h31 p hp) (h32 p hp) (h33 p hp) s₁ s₂ s₃ y₁ y₂ y₃\n\nend PartialBlock\n\n/-- A toy with a nonzero mixed block. `x³/3 − x/4 − 20y²` plus `xy²`: the pins and the gap `1/6` are\nunchanged, and `∂_x D_y² f = 2`. -/\nnoncomputable def mixedToyF (p : ℝ × ℝ) : ℝ :=\n p.1 ^ 3 / 3 - p.1 / 4 - 20 * p.2 ^ 2 + p.1 * p.2 ^ 2\n\n/-- **`ridge_capHyp_blocks` with a nonzero mixed block.** On `mixedToyF` the partial blocks of\n`D³f` are `2` (`c = 0`), `0` (`c = 1`), `2` (`c = 2`, the mixed block `∂_x D_y² f`) and `0`\n(`c = 3`), so `M3 = 2`; `D⁴f = 0`, so `M4 = 0`; and `λ = 41`. CAP (1) holds with `k = 1/6`, `r = 1`:\n`8 M3² = 32 < 41` and `r M4 = 0 ≤ 1/20`. Unlike `h1Toy_E` and `quarticToy_E`, the block inequality\n`hT` is not trivial here, since the mixed terms of `D³f` do not vanish. -/\ntheorem mixedToy_blocks :\n (∃ ε > 0, ∃ h : ℝ →" + }, + { + "kind": "theorem", + "unqualified_name": "addCircle_locallyConnectedSpace", + "line": 5184, + "source_header": "hε, hex, hcap⟩ := hsrc\n have hcrit0 : ∀ x : ℝ, HasFDerivAt (fun y => mixedToyF (x, y)) (0 : ℝ →L[ℝ] ℝ) 0 := by\n intro x\n have := slice_hasFDerivAt (hDf (x, 0))\n convert this using 1\n ext\n simp\n obtain ⟨-, -, hC, -⟩ := hcap (fun _ => 0) (fun x _ => ⟨by simp, hcrit0 x⟩)\n exact ⟨⟨ε, hε, hex⟩, hC⟩\n\n/-! ### v2.6: the cap and the elder death level on the torus, under CAP (1)\n\nP §7 applies the cap theorem to the periodic lift of the field on `(ℝ/Lℤ)^d`, in a contact frame\nwhose first axis joins the pins. `torus_capHyp_blocks` composes `ridge_capHyp_blocks` (v2.5) with\n`CapHyp.toTorus` and `CapHyp.map_saddle` for any frame `φ : ℝ × E ≃ₜ ℝ^d`. Then\n`torus_elder_death_level_blocks` adds `elder_death_level_peak` on the torus, which is compact\n(`L > 0`) and locally connected (`torus_loca" + }, + { + "kind": "theorem", + "unqualified_name": "torus_locallyConnectedSpace", + "line": 5198, + "source_header": "ly connected: its topology is coinduced by the covering map from\n`ℝ`, and local connectedness passes to coinduced topologies. -/\ntheorem addCircle_locallyConnectedSpace (L : ℝ) : LocallyConnectedSp" + }, + { + "kind": "theorem", + "unqualified_name": "torus_capHyp_blocks", + "line": 5208, + "source_header": "cted spaces. -/\ntheorem torus_locallyConnectedSpace (L : ℝ) (d : ℕ) :\n LocallyConnectedSpace (Fin d → AddCircle L) :=\n haveI := addCircle_locallyConnectedSpace L\n Pi.locallyConnectedSpace_of_finite_not_preconnectedSpace (Set.toFinite _)\n\nsection Torus\n\nvariable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]\n\n/-- **The cap on the torus under CAP (1).** Let `φ : ℝ × E ≃ₜ ℝ^d` be any frame and let\n`g = f ∘ torusCover L d ∘ φ` be the lift of a function `f` on the torus `(ℝ/Lℤ)^d`. If `g` meets\nthe hypotheses of `ridge_capHyp_blocks` (CAP §1's (1) with its partial-block norms, in the frame\n`φ`), then `f` satisfies (C1)–(C3) on the image of the cap in the torus, with `M` and `S` the images\nof the pins, and (C2⁺): every other frontier point of the image is strictly below `f(S)`. -/\ntheorem torus_capHyp_blocks [FiniteDimensional ℝ E] {L : ℝ} {d : ℕ}\n (φ : ℝ × E ≃ₜ (Fin d → ℝ)) {f : (Fin d → AddCircle L) → ℝ} {g : ℝ × E → ℝ}\n (hg : ∀ p, g p = f (torusCover L d (φ p))) {U : Set (ℝ × E)}\n {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 g U)\n (h30 : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 g (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ M3)\n (h31 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y), (1, 0), (1, 0)]| ≤ M3 * ‖y‖)\n (h32 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (1, 0)]| ≤ M3 * ‖y₁‖ * ‖y₂‖)\n (h33 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ y₃ : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (0, y₃)]| ≤ M3 * ‖y₁‖ * ‖y₂‖ * ‖y₃‖)\n (h40 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv ℝ 4 g p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ M4)\n (h41 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,\n |iteratedFDeriv ℝ 4 g p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ M4 * ‖v‖)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 g (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖v‖ ^ 2)\n (hH1 : 4 / (3 * k) * r * M3 ^ 2 < lam) (hH2 : r * M4 ≤ 3 * k / 10)\n (hM : fderiv ℝ g (-r / 2, 0) = 0) (hS : fderiv ℝ g (r / 2, 0) = 0)\n (hnorm : g (-r / 2, 0) - g (r / 2, 0) = k * r ^ 3) :\n ∃ z, CapHyp f ((torusCover L d ∘ φ) '' (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)))" + }, + { + "kind": "theorem", + "unqualified_name": "torus_elder_death_level_blocks", + "line": 5251, + "source_header": "φ) := funext hg\n subst hgf\n have hK : IsCompact (Icc (-2 * r) (r / 2) ×ˢ Metric.closedBall (0 : E) (2 * r)) :=\n isCompact_Icc.prod (isCompact_closedBall 0 (2 * r))\n exact ⟨_, hC.toTorus φ hK, CapHyp.map_saddle ((torusCover_continuous L d).comp φ.continuous)\n ((torusCover_isOpenMap L d).comp φ.isOpenMap) hK hSf⟩\n\n/-- **The elder death level on the torus under CAP (1).** For `L > 0` and a continuous `f` on\n`(ℝ/Lℤ)^d` whose lift in the frame `φ` meets CAP §1's (1), the largest level at which the\ncomponent of the image of `M` contains a strictly higher local maximum is `f` at the image of `S`.\nThis is `elder_death_level_peak` on the torus, which is compact and locally connected. -/\ntheorem torus_elder_death_level_blocks [FiniteDimensional ℝ E] {L : ℝ} [Fact (0 < L)] {d : ℕ}\n (φ : ℝ × E ≃ₜ (Fin d → ℝ)) {f : (Fin d → AddCircle L) → ℝ} (hfc : Continuous f)\n {g : ℝ × E → ℝ} (hg : ∀ p, g p = f (torusCover L d (φ p))) {U : Set (ℝ × E)}\n {r k M3 M4 lam : ℝ} (hr : 0 < r) (hk : 0 < k) (hU : IsOpen U)\n (hDU : Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r) ⊆ U)\n (hf : ContDiffOn ℝ 4 g U)\n (h30 : ∀ x ∈ Icc (-r / 2) (r / 2), |iteratedFDeriv ℝ 3 g (x, 0) ![(1, 0), (1, 0), (1, 0)]| ≤ M3)\n (h31 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y), (1, 0), (1, 0)]| ≤ M3 * ‖y‖)\n (h32 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (1, 0)]| ≤ M3 * ‖y₁‖ * ‖y₂‖)\n (h33 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ y₁ y₂ y₃ : E,\n |iteratedFDeriv ℝ 3 g p ![(0, y₁), (0, y₂), (0, y₃)]| ≤ M3 * ‖y₁‖ * ‖y₂‖ * ‖y₃‖)\n (h40 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r),\n |iteratedFDeriv ℝ 4 g p ![(1, 0), (1, 0), (1, 0), (1, 0)]| ≤ M4)\n (h41 : ∀ p ∈ Icc (-2 * r) (2 * r) ×ˢ Metric.closedBall (0 : E) (2 * r), ∀ v : E,\n |iteratedFDeriv ℝ 4 g p ![(0, v), (1, 0), (1, 0), (1, 0)]| ≤ M4 * ‖v‖)\n (hlam : ∀ v : E, iteratedFDeriv ℝ 2 g (-r / 2, 0) ![(0, v), (0, v)] ≤ -lam * ‖" + }, + { + "kind": "def", + "unqualified_name": "circleChart", + "line": 5285, + "source_header": "atest (CapHyp.olderPeakLevels f (torusCover L d (φ (-r / 2, 0))))\n (f (torusCover L d (φ (r / 2, 0)))) := by\n obtain ⟨z, H, -⟩ := torus_capHyp_blocks φ hg hr hk hU hDU hf h30 h31 h32 h33 h40 h41 hlam hH1\n hH2 hM hS hno" + }, + { + "kind": "theorem", + "unqualified_name": "circleChart_continuous", + "line": 5290, + "source_header": "exact H.elder_death_level_peak hfc rfl\n\nend Torus\n\n/-- A continuous chart of the circle near `0`: `circ" + }, + { + "kind": "theorem", + "unqualified_name": "circleChart_coe", + "line": 5294, + "source_header": "L/4` (`circleChart_coe`). -/\nnoncomputable def circleChart (L : ℝ) (θ : AddCircle L) : ℝ :=\n ‖θ + ((L / 4 : ℝ) : AddCircle L)‖ - L / 4\n\n/-- `circleChart` is continuous. -/\ntheor" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_hasFDerivAt", + "line": 5306, + "source_header": "have h1 := (abs_le.mp hx).1\n have h2 := (abs_le.mp hx).2\n have hn : ‖((x + L / 4 : ℝ) : AddCircle L)‖ = |x + L / 4| :=\n (AddCircle.norm_coe_eq_abs_iff L hL.ne').mpr (by\n rw [abs_of_nonneg (by linarith), abs_of_pos hL]; linarith)\n unfold circleChart\n rw [← AddCircle" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_contDiff", + "line": 5324, + "source_header": "sFDerivAt.const_mul (HasFDerivAt.pow hf 3) (1 / 3))\n (HasFDerivAt.const_mul" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_iteratedFDeriv_two", + "line": 5327, + "source_header": "nst_mul (HasFDerivAt.pow hs 2) 20))\n (HasFDerivAt.mul hf (HasFDerivAt.pow hs 2))\n convert h1 using 1\n · funext q\n simp only [mixedToyF, Pi.sub_apply, Pi.add_apply, Pi.mul_apply]\n ring\n · ext <;> simp\n ring\n\n/-- `mixedToyF` is `C⁴`. -/\ntheorem mixedToy_contDiff : ContDif" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_iteratedFDeriv_three", + "line": 5365, + "source_header": "h2.smul_const (ContinuousLinearMap.snd ℝ ℝ ℝ))\n have hfd : fderiv ℝ mixedToyF = fun p => (p.1 ^ 2 - 1 / 4 + p.2 ^ 2) •\n ContinuousLinearMap.fst ℝ ℝ ℝ + (-40 * p.2 + 2 * p.1 * p.2) • ContinuousLinearMap.snd ℝ ℝ ℝ :=\n funext fun p => (mixedToy_hasFDerivAt p).fderiv\n rw [iteratedFDeriv_two_apply, hfd, hD2.fderiv]\n simp" + }, + { + "kind": "theorem", + "unqualified_name": "mixedToy_iteratedFDeriv_four", + "line": 5384, + "source_header": "2 * (m 1).2 * (m 2).2) • ContinuousLinearMap.fst ℝ ℝ ℝ +\n (2 * ((m 1).1 * (m 2).2 + (m 1).2 * (m 2).1)) •\n ContinuousLinearMap.snd ℝ ℝ ℝ).hasFDerivAt" + }, + { + "kind": "def", + "unqualified_name": "torusToyF", + "line": 5398, + "source_header": "(Fin.tail m)) =\n fun _ => iteratedFDeriv ℝ 3 mixedToyF x (Fin.tail m) := by\n funext y; rw [mixedToy_iteratedFDeriv_three, mixedToy_iteratedFDeriv_three]\n have hg : HasFDerivAt (fun y => iteratedFDeriv ℝ 3 mixedToyF y (" + }, + { + "kind": "theorem", + "unqualified_name": "torusToy_elder", + "line": 5403, + "source_header": "exact hasFDerivAt_const _ _\n rw [hg.fderiv]\n simp\n\n/-- A function on the torus `(ℝ/16ℤ)²` whose lift equals `mixedToyF` on `(−4, 4)²`:\n`mixedToyF` read through `circleChart` in each coordinate. It is continuous. -/\nnoncomputable def torusToyF (θ : Fin 2 → AddCircle (16 : ℝ)) : ℝ :=\n mixedToyF (circleChart 16 (θ 0), circleChart 16 (θ 1))\n\n/-- **A concrete instance of the elder death level on the torus.** On `(ℝ/16ℤ)²`, with the standard\nframe `ℝ × ℝ ≃ₜ ℝ²`, the lift of `torusToyF` agrees with `mixedToyF` near the cap, so it meets\nCAP (1) with `r = 1`, `k = 1/6`, `M3 = 2`, `M4 = 0` and `λ = 41`. `torus_elder_death_level_blocks`\nthen gives the death level of the class born at the image of `M = (−1/2, 0)`: it is t" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:frontiers/compact_morse_elder_adapter_20261018", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeGeometry.lean", + "sha256": "8ec4b18959055f20d849337e44a70d0c5b39b7959b54cb4d7b6c2a473ee0612d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeField.lean", + "sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/C291/inputs/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/TorusTopology.lean", + "sha256": "ddb145b3f791c181d4f2a51e54e711937297bd6476ba55bcd5252b7ddb57cfe1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean", + "sha256": "3d6b0d6b53413c484b1d010bccf0d53ae7f75becb2d747868f22dbd673fe0a88" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean", + "sha256": "8a2470431c3fda5e98859aa9372cbb8866ed5c5c722cea5dfc28cb577840bbad" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean", + "sha256": "346eea948e18d5904422904006827930e27d3141ccbc19ee8ac2c24bcf65a4a9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/specifications/lean_statements_20261010/Specifications/Field.lean", + "sha256": "f22c91e082cd7e738ba47c9c3534e47ac687d066f0b78586d15103cf1132535e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean", + "sha256": "3dab19342c307f6b70f4fa05ac913b4ead083742a56408db71b45276c0acb9ab" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean", + "sha256": "6b0be1116f6b357b0ffbda202c572c27c2788b98bee639e228375a5ebeea1fa9" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean", + "sha256": "d3d78472881059546402218cc77792eeef00755c222bb02499d69abd3b5cd57e" + } + ], + "source_record_sha256": "de3564eada24e13b50c694374606567c1d9055f624718c4dd14a7bca4b7e273d", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "frontiers/compact_morse_elder_adapter_20261018", + "source_files": [ + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeGeometry.lean", + "sha256": "8ec4b18959055f20d849337e44a70d0c5b39b7959b54cb4d7b6c2a473ee0612d", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "coordinates", + "line": 14, + "source_header": "d\n\ndef coordinates (d : ℕ) : E d ≃L[ℝ] (Fin d → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "coordinates_latticeVec", + "line": 20, + "source_header": "l\n\ntheorem coordinates_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :\n coordinates d (latticeVec d L n) = fun i => L * (n i : ℝ" + }, + { + "kind": "def", + "unqualified_name": "actualField", + "line": 25, + "source_header": "]\n\n/-- The same carrier, same law, and same literal source; only spatial coordinates change. -/\ndef actualField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : E d)" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_smooth", + "line": 29, + "source_header": "x)\n\ntheorem actualField_smooth (d : ℕ) {L : ℝ} (hL : 0 < L)\n (ω : SmoothSample d L) : IsSmooth d (actualField d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_periodic", + "line": 35, + "source_header": "iff\n\ntheorem actualField_periodic (d : ℕ) {L : ℝ} (hL : 0 < L)\n (ω : SmoothSample d L) : IsLPeriodic d L (actualField d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_eval_measurable", + "line": 43, + "source_header": "x)\n\ntheorem actualField_eval_measurable (d : ℕ) (L : ℝ) (x : E d) :\n Measurable (fun ω => actualField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_eval_hasGaussianLaw", + "line": 48, + "source_header": "L)\n\ntheorem actualField_eval_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x : E d) : HasGaussianLaw (fun ω => actualField d L ω x) (smoothLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_measurable", + "line": 53, + "source_header": "l 0\n\ntheorem actualField_linearCombination_measurable (d : ℕ) (L : ℝ) {m : ℕ}\n (x : Fin m → E d) (a : Fin m → ℝ) :\n Measurable (fun ω => ∑ i, a i * actualField d L ω (x" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_hasGaussianLaw", + "line": 59, + "source_header": ")))\n\ntheorem actualField_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ}\n (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n HasGaussianLaw (fun ω => ∑ i, a i * actualField d L ω (x i)) (smoothLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_integral_zero", + "line": 73, + "source_header": "map\n\ntheorem actualField_integral_zero (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n ∫ ω, actualField d L ω x ∂smoothLaw d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_integral_zero", + "line": 82, + "source_header": "x)\n\ntheorem actualField_linearCombination_integral_zero (d : ℕ) {L : ℝ}\n (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n ∫ ω, (∑ i, a i * actualField d L ω (x i)) ∂smoothLaw d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_covariance_spectral", + "line": 90, + "source_header": "ro]\n\ntheorem actualField_covariance_spectral (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =\n I4Kernel.sourceSpectralKernel d L (coordinates d (x -" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeField.lean", + "sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "actualField_covariance", + "line": 15, + "source_header": "d\n\ntheorem actualField_covariance (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =\n periodicCovariance d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_raw_second_moment", + "line": 22, + "source_header": ")\n\ntheorem actualField_raw_second_moment (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n ∫ ω, actualField d L ω x * actualField d L ω y ∂smoothLaw d L =\n periodicCovariance d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_variance", + "line": 29, + "source_header": "y\n\ntheorem actualField_linearCombination_variance (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n Var[fun ω => ∑ i, a i * actualField d L ω (x i); smoothLaw d L] =\n covQuadForm d L x" + }, + { + "kind": "theorem", + "unqualified_name": "covQuadForm_nonneg", + "line": 44, + "source_header": "g\n\ntheorem covQuadForm_nonneg (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n 0 ≤ covQuadForm d L x" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_map", + "line": 50, + "source_header": "_\n\ntheorem actualField_linearCombination_map (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n (smoothLaw d L).map (fun ω => ∑ i, a i * actualField d L ω (x i)) =\n gaussianReal 0 ⟨covQuadForm d L x a, covQuadForm_nonneg d hL x a" + }, + { + "kind": "def", + "unqualified_name": "actualGaussianFieldInterface", + "line": 61, + "source_header": ")\n\n/-- The original target on the unchanged coefficient carrier and preserved source law. -/\ndef actualGaussianFieldInterface (d : ℕ) (L : ℝ) (hL : 0 < L) :\n GaussianFieldInterface d L where" + }, + { + "kind": "theorem", + "unqualified_name": "actualGaussianFieldInterface_exists", + "line": 76, + "source_header": "hL\n\ntheorem actualGaussianFieldInterface_exists (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Nonempty (GaussianFieldInterface d" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/C291/inputs/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 65, + "source_header": "y\n\n/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this\nnamespace). The duplication is deliberate: modules of this packet import only Mathlib. -/\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 77, + "source_header": "in d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 86, + "source_header": "i : ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 97, + "source_header": "^ 2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 109, + "source_header": "taSum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : F" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 120, + "source_header": "L (x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g :" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 129, + "source_header": "ec d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 138, + "source_header": "ℕ, ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 180, + "source_header": "y ∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 190, + "source_header": ": ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoi" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 199, + "source_header": "ℝ) (x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 215, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNon" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 225, + "source_header": "iticalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsInd" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 235, + "source_header": "alPoint d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 244, + "source_header": ": ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnon" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 253, + "source_header": "nS (d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence modul" + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 283, + "source_header": "tGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsC" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 302, + "source_header": "NondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the sourc" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 315, + "source_header": "IsCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNond" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 351, + "source_header": "gMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 363, + "source_header": "p :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pai" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 374, + "source_header": "ndDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d :" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 385, + "source_header": "E d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gau" + }, + { + "kind": "def", + "unqualified_name": "IsWindowPair", + "line": 407, + "source_header": "A ∧\n ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)\n\n/-! ### Populations of pairs -/\n\n/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with\n`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none beyond the shared predicates.\nDoes not claim: anything about the off-diagonal (far) population separately (Section" + }, + { + "kind": "structure", + "unqualified_name": "PairLawInterface", + "line": 442, + "source_header": ": ℝ) (g : E d → ℝ) (M S : E d) : Prop :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S\n\n/-! ### The typed pair law as an interface -/\n\n/-- Interface for the weighted regression (typed pair) law: the only object consumed by the\nstatements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death\npartner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the\nlaw `Q^W = (W_r/Z_r) Q_{r,b,k,R}` with `W_r = |det H_M det H_S| 1{H_M<0, index(H_S)=d-1}`.\nThat law, its weight, its normalizer and the regression construction are informal in the\nsource and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark\n`k` and orthonormal frame `R` with values in `[0, 1]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S.\"\nInterface: `p` is given; its only hypothesis fields are the bounds `0 ≤ p ≤ 1`. The parameters `G` and `I` record which field and which elder relation the law refers to; no field ties `p` to them.\nDoes not claim: existence of the regression law, the typed weight, the full normalizer `Z_r > 0`, or that `p` is the probability of any event under any measure declared here; that `p` depends on `G` or `I` in any way (no field mentions them; they only record which field and elder relation the law is meant to refer to). -/\nstructure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)\n (I : SuperlevelBarInterface d L) where\n /-- Section 1 clause: \"Let p_r(b,k,R) be the Q^W probability that the global ordinary\n superlevel elder death partner of M is S.\" -/\n p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R\n /-- `p` is a proba" + }, + { + "kind": "def", + "unqualified_name": "ParentUniformSelectionA", + "line": 466, + "source_header": "ility: at most one. -/\n p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1\n\n/-! ### The parent statements (1.1), (1.2), (1.3) -/\n\n/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`\nand `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)\nsuch that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all\northonormal frames `R`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There exist r_*>0 and C 0` and\nwindows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a\nconstant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and\nelder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,\n`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),\"\nInterface: `G` and `I` are given; \"versions\" are any `νc`, `νe` satisfying `IsLifetimeDensityVersion` (integral identity), not a Kac-Rice representation; the coefficient `c_{B,K}` is existential, not the Gaussian integral (11.3).\nDoes not claim: the parent result or its proof; the exact coefficient formula (11.3); existence of the versions; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef ParentCompactWindowDensityB (d :" + }, + { + "kind": "def", + "unqualified_name": "IsUnrestrictedLeadingCoefficient", + "line": 510, + "source_header": "r : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.\nThe essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the\nconclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,\nnot by the integral (13.6)/(15.2).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There is a positive finite constant c_{d,L} such that\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the explicit Gaussian/angular representation (15.2) of `c_{d,L}`; uniqueness of `c` (which follows from the asymptotics but is not stated); existence of versions. -/\ndef IsUnrestrictedLeadingC" + }, + { + "kind": "def", + "unqualified_name": "ParentUnrestrictedLeadingDensityC", + "line": 531, + "source_header": "∧\n Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe\n (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the\nunrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth\nheights, all positive gap marks, all separations; essential global maximum excluded) admit\nversions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the parent result or its proof (dominated convergence of Section 13, off-diagonal bound (14.1)); the representation (15.2); the compact-window `O(ell^(2/3))` difference for the unrestricted densities; any numerical enclosure of `c_{d,L}` (the SIDE24 coefficient track is separate); nonauthor review or acceptance. -/\ndef ParentUnrestr" + }, + { + "kind": "def", + "unqualified_name": "RemainderBoundedR1", + "line": 545, + "source_header": "(I : SuperlevelBarInterface d L) : Prop :=\n 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c\n\n/-! ### The bounded remainder (R1) -/\n\n/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed\n`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here\nby `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of\nthe unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,\n`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.\nThe `O(1)` remainder is stated with an explicit absolute-value bound.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a\nAnchor: \"|nu_cand(ell)-c ell^(-1/3)| <= C,\"\nInterface: `G` and `I` are given; `c` is any real satisfying the parent leading-coefficient property (the source says the coefficient \"is exactly the parent's equation (15.2)\"; that integral is not transcribed, so `c` is pinned through (1.3) instead); versions are characterised by the integral identity only. The statement does not mention the typed pair law: Theorem R does not consume (1.1).\nDoes not claim: the result or its proof (quadratic determinant cancellation (R7), coupling (R4), cap-loss bound (R12)); convergence of the remainder; a second coefficient; numerical `C` or `ell_*`; the compact-window `O(ell^(2/3))` difference without cutoffs; the parent interfaces it imports (D1-A-E); nonauthor review or acceptance. If no `c` satisfies the parent property the statement holds vacuously; that is a transcription of its dependency on (1.3), not a claim. -" + }, + { + "kind": "def", + "unqualified_name": "PlanarElderLowerE2", + "line": 569, + "source_header": "c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧\n |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C\n\n/-! ### Planar elder lower bound and density gap (d = 2) -/\n\n/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with\nbirth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging\nover `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all\n`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \"1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff\n`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the\ncompact-window candidate and ordinary elder densities satisfy\n`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper\ninput is an explicit hypothesis, not folded into the conclusion. The lower half, which the\nsource derives from (E2) alone, is stated under the same hypothesis because the source displays\n(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower\nhalf, recorded here as such.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \" <= C_{B,K} ell^(2/3). (E11)\"\nInterface: `G`, `I` and `PL` are given; the hypothesis `ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi` is the consumed parent upper input (a statement shape, not the parent result); versions are characterised by the integral identity only; the weighted Kac-Rice / radial ledger of [LP, Sections 9-11] that the source consumes is not transcribed. The interface does not determine `p` or the field: the Prop is a predicate on the interface objects, not a closed statement about the source's objects; nothing is asserted about its universal closure over all inhabitants, and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the result or its proof; the upper half independently of the parent (1.1); the parent (1.1) itself; the lower half without the hypothesis (the source has it from (E2) alone); sharpness of the `O(1)` remainder of (R1); removal of the compact-mark restriction; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef PlanarDensityGapE11 (L : ℝ) (G :" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/TorusTopology.lean", + "sha256": "ddb145b3f791c181d4f2a51e54e711937297bd6476ba55bcd5252b7ddb57cfe1", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "torus_E", + "line": 21, + "source_header": "n\nabbrev torus_E (d : ℕ" + }, + { + "kind": "def", + "unqualified_name": "torus_latticeVec", + "line": 22, + "source_header": ")\n\n/-- The exact `Field.latticeVec` formula, retained without any coordinate rescaling. -/\ndef torus_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : torus_" + }, + { + "kind": "theorem", + "unqualified_name": "torus_field_latticeVec_formula", + "line": 26, + "source_header": "ℝ))\n\ntheorem torus_field_latticeVec_formula (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :\n torus_latticeVec d L n = ∑ i, EuclideanSpace.single i (L * (n i :" + }, + { + "kind": "def", + "unqualified_name": "torus_periodBasis", + "line": 29, + "source_header": "rfl\n\ndef torus_periodBasis (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Module.Basis (Fin d) ℝ (torus_E" + }, + { + "kind": "def", + "unqualified_name": "torus_periodLattice", + "line": 34, + "source_header": "e')\n\ndef torus_periodLattice (d : ℕ) (L : ℝ) (hL : 0 < L) : Submodule ℤ (torus_E" + }, + { + "kind": "abbrev", + "unqualified_name": "torus_quotient", + "line": 37, + "source_header": "L))\n\nabbrev torus_quotient (d : ℕ) (L : ℝ) (hL : 0 <" + }, + { + "kind": "def", + "unqualified_name": "torus_proj", + "line": 40, + "source_header": "oup\n\ndef torus_proj (d : ℕ) (L : ℝ) (hL : 0 < L) : torus_E d → torus_quotient d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_basis_sum_eq_latticeVec", + "line": 43, + "source_header": ".mk\n\n/-- Concrete adapter from integer basis coefficients to Field's exact vector formula. -/\ntheorem torus_basis_sum_eq_latticeVec (d : ℕ) (L : ℝ) (hL : 0 < L)\n (n : Fin d → ℤ) :\n ∑ i, n i • torus_periodBasis d L hL i = torus_latticeVec" + }, + { + "kind": "theorem", + "unqualified_name": "torus_lattice_mem_iff", + "line": 61, + "source_header": "hij]\n\ntheorem torus_lattice_mem_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x : torus_E d) :\n x ∈ torus_periodLattice d L hL ↔ ∃ n : Fin d → ℤ, torus_latticeVec d L" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_discrete", + "line": 68, + "source_header": "eVec]\n\ninstance torus_lattice_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :\n DiscreteTopology (torus_periodLattice d" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_addSubgroup_discrete", + "line": 73, + "source_header": "tance\n\ninstance torus_lattice_addSubgroup_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :\n DiscreteTopology (torus_periodLattice d L hL).toAddSub" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_isZLattice", + "line": 78, + "source_header": "tance\n\ninstance torus_lattice_isZLattice (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsZLattice ℝ (torus_periodLattice d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_surjective", + "line": 83, + "source_header": "tance\n\ntheorem torus_proj_surjective (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Function.Surjective (torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_continuous", + "line": 86, + "source_header": "ctive\n\ntheorem torus_proj_continuous (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Continuous (torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_eq_iff", + "line": 89, + "source_header": "t_mk'\n\ntheorem torus_proj_eq_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x y : torus_E d) :\n torus_proj d L hL x = torus_proj d L hL y ↔\n ∃ n : Fin d → ℤ, y = x + torus_latticeVec" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_lattice_translate", + "line": 102, + "source_header": "abel⟩\n\n/-- Duplicate representatives have exactly the same quotient image. -/\ntheorem torus_control_lattice_translate (d : ℕ) (L : ℝ) (hL : 0 < L)\n (x : torus_E d) (n : Fin d → ℤ) :\n torus_proj d L hL (x + torus_latticeVec d L n) = torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_isCoveringMap", + "line": 108, + "source_header": "⟩).symm\n\ntheorem torus_proj_isCoveringMap (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsCoveringMap (torus_proj" + }, + { + "kind": "theorem", + "unqualified_name": "torus_compact", + "line": 114, + "source_header": "ringMap\n\ntheorem torus_compact (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsCompact (Set.univ : Set (torus_quotient d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_pathConnectedSpace", + "line": 121, + "source_header": "] at hc\n\ntheorem torus_pathConnectedSpace (d : ℕ) (L : ℝ) (hL : 0 < L) :\n PathConnectedSpace (torus_quotient" + }, + { + "kind": "def", + "unqualified_name": "torus_isPeriodic", + "line": 125, + "source_header": "ient _)\n\n/-- Exact Field periodicity predicate with the literal lattice-vector adapter above. -/\ndef torus_isPeriodic (d : ℕ) (L : ℝ) (g : torus_E d →" + }, + { + "kind": "theorem", + "unqualified_name": "torus_field_periodic_formula", + "line": 129, + "source_header": "n) = g x\n\ntheorem torus_field_periodic_formula (d : ℕ) (L : ℝ) (g : torus_E d → ℝ) :\n torus_isPeriodic d L g ↔\n ∀ (x : EuclideanSpace ℝ (Fin d)) (n : Fin d → ℤ),\n g (x + ∑ i, EuclideanSpace.single i (L * (n i : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "torus_periodic_respects", + "line": 134, + "source_header": "= Iff.rfl\n\ntheorem torus_periodic_respects (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x y : torus_E d)\n (hxy : QuotientAddGroup.leftRel (torus_periodLattice d L hL).toAddSubgroup x y) :" + }, + { + "kind": "def", + "unqualified_name": "torus_descend", + "line": 142, + "source_header": "x n).symm\n\ndef torus_descend (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) : torus_quotient d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_descend_proj", + "line": 146, + "source_header": "hL g hg)\n\ntheorem torus_descend_proj (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x : torus_E d) :\n torus_descend d L hL g hg (torus_proj d L hL" + }, + { + "kind": "theorem", + "unqualified_name": "torus_descend_continuous", + "line": 150, + "source_header": "x := rfl\n\ntheorem torus_descend_continuous (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (hgc : Continuous g) :\n Continuous (torus_descend d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_path_lift_from", + "line": 155, + "source_header": "hL g hg)\n\n/-- Lift from a prescribed representative; the endpoint is determined existentially. -/\ntheorem torus_path_lift_from (d : ℕ) (L : ℝ) (hL : 0 < L)\n {M : torus_E d} {y : torus_quotient d L hL}\n (γ : Path (torus_proj d L hL M) y) :\n ∃ z : torus_E d, ∃ Γ : Path M z,\n torus_proj d L hL z = y ∧\n ∀ t : unitInterval, torus_proj d L hL" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_constant_path_endpoint", + "line": 169, + "source_header": "γ.source) t\n\n/-- Control: a constant projected path cannot be lifted from M to a different lift.\nThis refutes replacing the existential endpoint by an arbitrary chosen representative. -/\ntheorem torus_control_constant_path_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)\n {M z : torus_E d} (Γ : Path M z)\n (hΓ : ∀ t : unitInterval, torus_proj d L hL (Γ t) = torus_proj d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_no_arbitrary_endpoint", + "line": 179, + "source_header": "ngrFun heq 1)\n\n/-- Combining the duplicate-image and uniqueness controls gives a direct rejection\nof any different preselected endpoint for a constant quotient path. -/\ntheorem torus_control_no_arbitrary_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)\n (M : torus_E d) (n : Fin d → ℤ) (hn : torus_latticeVec d L n ≠ 0) :\n torus_proj d L hL (M + torus_latticeVec d L n) = torus_proj d L hL M ∧\n ¬ ∃ Γ : Path M (M + torus_latticeVec d L n),\n ∀ t : unitInterval, torus_proj d L hL (Γ t) = toru" + }, + { + "kind": "theorem", + "unqualified_name": "torus_higher_path_iff", + "line": 192, + "source_header": "impa using heq)\n\n/-- Higher-endpoint compatibility for any scalar path predicate, including strict\nand closed thresholds. No conclusion here asserts critical-level attainment. -/\ntheorem torus_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (P : ℝ → Prop) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, P (g (γ t))) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, P (torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_strict_higher_path_iff", + "line": 216, + "source_header": "ht\n exact ht\n\ntheorem torus_strict_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, h < torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_closed_higher_path_iff", + "line": 225, + "source_header": "(fun a => h < a)\n\ntheorem torus_closed_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h ≤ g (γ t)) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, h ≤ torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_global_max_iff", + "line": 234, + "source_header": "(fun a => h ≤ a)\n\ntheorem torus_global_max_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) :\n (∀ y : torus_E d, g y ≤ g M) ↔\n ∀ y : torus_quotient d L hL,\n torus_descend d L hL g hg y ≤ torus_descend d L hL g hg (tor" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean", + "sha256": "3d6b0d6b53413c484b1d010bccf0d53ae7f75becb2d747868f22dbd673fe0a88", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentFunctor", + "line": 44, + "source_header": "n\n\n/-- Proves: actual path-component quotients form a functor on topological spaces.\nMethod: use the existing continuous-map quotient map and its identity/composition laws.\nDoes not establish: equality of connected and path-connected components. -/\ndef ordinaryH0_componentFunctor : TopCat.{w} ⥤ Type w where\n ob" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentCoproductFunctor", + "line": 61, + "source_header": "C]\n\n/-- Proves: the component-indexed coproduct construction is a functor.\nMethod: compose the actual component functor with the categorical coproduct functor.\nDoes not establish: an identification with homology until naturality is proved below. -/\ndef ordinaryH0_componentCoproductFunctor (R : C) : TopCat.{w" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentCoproductMap_iota", + "line": 67, + "source_header": "obj R\n\n/-- Proves: a coproduct generator maps to the component of its continuous image.\nMethod: the universal coproduct map sends each inclusion to its indexed image.\nDoes not establish: that distinct source components stay distinct. -/\ntheorem ordinaryH0_componentCoproductMap_iota (R : C) {X Y : TopCat.{w}}\n (f : X ⟶ Y) (q : ZerothHomotopy X) :\n Sigma.ι (fun _ : ZerothHomotopy X => R) q ≫\n (ordinaryH0_componentCoproductFunctor R).map f =\n Sigma.ι (fun _ : ZerothHomotopy Y => R) (superlevel_componentMap f" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentFiltration", + "line": 77, + "source_header": "aConst]\n\n/-- Proves: the existing closed-superlevel family has a component-indexed coproduct filtration.\nMethod: compose its actual continuous inclusions with the proved component coproduct functor.\nDoes not establish: regularity, finite dimensionality, or Morse hypotheses for the height function. -/\ndef ordinaryH0_componentFiltration {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentFiltration_map_iota", + "line": 84, + "source_header": "Functor R\n\n/-- Proves: a filtration component generator maps by the existing actual component inclusion.\nMethod: specialize the coproduct generator map formula to a closed-superlevel inclusion.\nDoes not establish: a reverse inclusion or endpoint deletion. -/\ntheorem ordinaryH0_componentFiltration_map_iota {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t)\n (q : ZerothHomotopy (superlevel_set g s)) :\n Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g s) => R) q ≫\n (ordinaryH0_componentFiltration g R).map (homOfLE hst) =\n Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g t) => R)\n (superlevel_componentInclusi" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_simplicialPointClass", + "line": 99, + "source_header": "Homology C]\n\n/-- Proves: a zero-simplex defines a morphism into actual simplicial homology.\nMethod: include its chain generator, lift through the zero differential, then take its class.\nDoes not establish: a replacement definition of homology or any naturality premise. -/\ndef ordinaryH0_simplicialPointClass (S : SSet.{w}) (R : C) (x : S _⦋0⦌) :\n R ⟶ S" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_simplicialPointClass_iso", + "line": 107, + "source_header": ").homologyπ 0\n\n/-- Proves: the existing simplicial H0 isomorphism sends a point class to its component.\nMethod: apply Mathlib's zero-cycle generator formula.\nDoes not establish: naturality merely from the existence of the objectwise isomorphism. -/\ntheorem ordinaryH0_simplicialPointClass_iso (S : SSet.{w}) (R : C)\n (x : S _⦋0⦌) :\n ordinaryH0_simplicialPointClass S R x ≫ (S.homology₀Iso R).hom =\n Sigma.ι (fun _ : S.π₀ => R)" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_simplicialPointClass_map", + "line": 117, + "source_header": "y₀Iso_hom S R x\n\n/-- Proves: the actual simplicial homology map carries a point class to its image class.\nMethod: homology projection naturality, cycle-lift naturality, and the chain generator formula.\nDoes not establish: a transported or postulated substitute for the actual homology map. -/\ntheorem ordinaryH0_simplicialPointClass_map (R : C) {S T : SSet.{w}}\n (f : S ⟶ T) (x : S _⦋0⦌) :\n ordinaryH0_simplicialPointClass S R x ≫ SSet.homologyMap f R 0 =\n ordinaryH0_simplicialPointClas" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_toSSet_pointMap", + "line": 128, + "source_header": "hainComplexMap_f]\n\n/-- Proves: the singular zero-simplex of a point maps to that of its continuous image.\nMethod: unfold the point/simplex correspondence and the singular-set map.\nDoes not establish: a chain or homology identification by itself. -/\ntheorem ordinaryH0_toSSet_pointMap {X Y : TopCat.{w}} (f : X ⟶ Y) (x : X) :\n (TopCat.toSSet.map f).app _ (TopCat.toSSetObj₀Equiv.symm x) =\n TopCat.toSSetO" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_pointClass", + "line": 136, + "source_header": "m (f x) := by\n rfl\n\n/-- Proves: each point has its actual ordinary singular zero-homology class morphism.\nMethod: use the actual singular zero-simplex and the cycle/projection construction above.\nDoes not establish: a free-module definition standing in for singular H0. -/\ndef ordinaryH0_pointClass (X : TopCat.{w}) (R : C) (x : X) :\n R ⟶ ((singularHomologyFunc" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_map", + "line": 144, + "source_header": "SSetObj₀Equiv.symm x)\n\n/-- Proves: actual continuous-map-induced singular H0 maps transport point classes.\nMethod: specialize the proved simplicial generator naturality to the singular-set functor.\nDoes not establish: injectivity of the induced map. -/\ntheorem ordinaryH0_pointClass_map (R : C) {X Y : TopCat.{w}}\n (f : X ⟶ Y) (x : X) :\n ordinaryH0_pointClass X R x ≫ ((singularHomologyFunctor C 0).obj R).map f =\n ordinary" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_iso", + "line": 158, + "source_header": "naryH0_toSSet_pointMap]\n\n/-- Proves: Mathlib's existing topological comparison sends actual point classes to components.\nMethod: combine the simplicial generator formula with the actual path-component equivalence.\nDoes not establish: any connected-component substitution. -/\ntheorem ordinaryH0_pointClass_iso (X : TopCat.{w}) (R : C) (x : X) :\n ordinaryH0_pointClass X R x ≫ (TopCat.singularHomology₀Iso X R).hom =\n Sigma.ι (fun _ : ZerothHomotopy X =>" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentIota_isoInv", + "line": 171, + "source_header": "_iso]\n simp [sigmaConst]\n\n/-- Proves: inverse comparison takes each component generator to any representing point class.\nMethod: cancel the comparison isomorphism and use the point-class formula.\nDoes not establish: a choice of distinguished geometric representative. -/\ntheorem ordinaryH0_componentIota_isoInv (X : TopCat.{w}) (R : C) (x : X) :\n Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) ≫\n (TopCat.singularHomology₀Iso X R).inv =" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_hom_ext", + "line": 180, + "source_header": "ordinaryH0_pointClass_iso]\n\n/-- Proves: morphisms out of actual singular H0 agree if they agree on all point classes.\nMethod: cancel the inverse comparison, use coproduct extensionality and quotient surjectivity.\nDoes not establish: a basis of geometric maxima or finiteness of components. -/\ntheorem ordinaryH0_hom_ext (X : TopCat.{w}) (R : C) {A : C}\n {f g : ((singularHomologyFunctor C 0).obj R).obj X ⟶ A}\n (h : ∀ x : X, ordinaryH0_pointClass X R x ≫ f = ordinaryH0_poin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_iso_naturality", + "line": 193, + "source_header": "mponentIota_isoInv] using h x\n\n/-- Proves: the existing actual singular H0 comparison commutes with every continuous map.\nMethod: test both composites on actual point classes, transport them, and compare component images.\nDoes not establish: naturality by adding an assumption or a compatibility record. -/\ntheorem ordinaryH0_iso_naturality (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) :\n ((singularHomologyFunctor C 0).obj R).map f ≫\n (TopCat.singularHomology₀Iso Y R).hom =\n (TopCat.singularHomology₀Iso X R).hom ≫\n (ordinaryH0_com" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_naturalIso", + "line": 209, + "source_header": "mponentCoproductMap_iota]\n rfl\n\n/-- Proves: actual ordinary singular H0 is naturally isomorphic to component-indexed coproducts.\nMethod: assemble the existing objectwise isomorphisms using the commuting square proved above.\nDoes not establish: an interval decomposition or persistence-bar classification. -/\ndef ordinaryH0_naturalIso (R : C) :\n (singularHomologyFunctor C 0).obj R ≅ ordin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_augmentation", + "line": 217, + "source_header": "=> ordinaryH0_iso_naturality R f)\n\n/-- Proves: ordinary augmentation sends every actual point-class morphism to the coefficient identity.\nMethod: use the comparison's augmentation formula and the coproduct universal property.\nDoes not establish: reduced-H0 vanishing; this retains the ordinary point class. -/\ntheorem ordinaryH0_pointClass_augmentation (X : TopCat.{w}) (R : C) (x : X) :\n ordinaryH0_pointClass X R x ≫" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_ne_zero", + "line": 226, + "source_header": "ordinaryH0_pointClass_iso]\n simp\n\n/-- Proves: an actual point class is nonzero for a coefficient object with nonzero identity.\nMethod: compose a proposed zero class with ordinary augmentation.\nDoes not establish: nonzero classes for a zero coefficient object. -/\ntheorem ordinaryH0_pointClass_ne_zero (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x :" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_eq_of_component_eq", + "line": 236, + "source_header": ", zero_comp] at hε\n exact hR hε.symm\n\n/-- Proves: points in the same actual path component give equal ordinary H0 class morphisms.\nMethod: cancel the objectwise comparison and compare their component indices.\nDoes not establish: a converse for zero coefficients. -/\ntheorem ordinaryH0_pointClass_eq_of_component_eq (X : TopCat.{w}) (R : C)\n (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :\n ordinaryH0_pointCl" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_sameComponent_difference_zero", + "line": 245, + "source_header": "lass_iso, ordinaryH0_pointClass_iso, h]\n\n/-- Proves: the difference of same-component point classes is zero for arbitrary coefficients.\nMethod: subtract the equality proved from actual path-component equality.\nDoes not establish: that either individual point class dies. -/\ntheorem ordinaryH0_sameComponent_difference_zero (X : TopCat.{w}) (R : C)\n (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :\n ordinaryH0_pointClas" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_ne_of_component_ne", + "line": 253, + "source_header": "s_eq_of_component_eq X R x y h, sub_self]\n\n/-- Proves: distinct actual path components have distinct ordinary H0 class morphisms if coefficients are nonzero.\nMethod: separate the two coproduct injections by an identity/zero component projection.\nDoes not establish: distinction with zero coefficients or distinction of points within one component. -/\ntheorem ordinaryH0_pointClass_ne_of_component_ne (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X)\n (hxy : ZerothHomotopy.mk x ≠ ZerothHomotopy.mk y) :\n ordinaryH0_poi" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_eq_iff", + "line": 271, + "source_header": "ymm hxy] using congrArg (fun k => k ≫ p) hc\n\n/-- Proves: with nonzero coefficients, actual point-class equality is exactly path-component equality.\nMethod: combine the same-component formula with the separating projection control.\nDoes not establish: equality of geometric points or connected components. -/\ntheorem ordinaryH0_pointClass_eq_iff (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X) :\n ordinaryH0_pointClass X R x = ordinaryH0_pointClass X R y ↔" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_difference_map", + "line": 284, + "source_header": "inaryH0_pointClass_eq_of_component_eq X R x y\n\n/-- Proves: the actual H0 map sends a difference of point classes to the difference of image classes.\nMethod: distribute composition over subtraction and use proved actual point-class transport.\nDoes not establish: death of the individual ordinary point classes. -/\ntheorem ordinaryH0_difference_map (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫\n ((singularHomologyFunctor C 0).obj R).map f =\n ordinaryH0_pointCl" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_difference_map_eq_zero_iff", + "line": 293, + "source_header": "ryH0_pointClass_map, ordinaryH0_pointClass_map]\n\n/-- Proves: with nonzero coefficients, a mapped difference vanishes exactly when the image points merge in path components.\nMethod: actual homology-map transport, subtraction cancellation, and the component equality criterion.\nDoes not establish: a Morse merger event, elder selection, death height, or barcode. -/\ntheorem ordinaryH0_difference_map_eq_zero_iff (R : C) (hR : (𝟙 R : R ⟶ R) ≠ 0)\n {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫\n ((singularHomologyFunctor C 0).obj R).map f = 0 ↔" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_filtrationIso", + "line": 303, + "source_header": "sub_eq_zero, ordinaryH0_pointClass_eq_iff Y R hR]\n\n/-- Proves: the existing actual singular H0 filtration is naturally isomorphic to its component coproduct filtration.\nMethod: restrict the proved natural comparison along the existing topological filtration.\nDoes not establish: the later interval, elder, maximum/saddle, count, Field, or stochastic bridges. -/\ndef ordinaryH0_filtrationIso {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) :\n superlevel_h0" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_filtration_naturality", + "line": 311, + "source_header": "(superlevel_filtration g) (ordinaryH0_naturalIso R)\n\n/-- Proves: all ordered closed-superlevel inclusion maps satisfy the actual H0/component square.\nMethod: read the naturality of the proved filtration isomorphism at the preorder morphism.\nDoes not establish: strict-level conventions or any unproved geometric persistence hypothesis. -/\ntheorem ordinaryH0_filtration_naturality {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t) :\n (superlevel_h0Filtration g R).map (homOfLE hst) ≫\n (ordinaryH0_filtrationIso g R).hom.app t =\n (ordinaryH0_filtrationIso g R).hom.app s ≫\n (" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_filtration_difference_zero_iff_joinedIn", + "line": 322, + "source_header": "aryH0_filtrationIso g R).hom.naturality (homOfLE hst)\n\n/-- Proves: under a closed-superlevel inclusion, a difference vanishes exactly when the two included points are joined in the target closed superlevel.\nMethod: apply the actual H0 difference control and the existing component/JoinedIn equivalence.\nDoes not establish: attainment of a critical death threshold or an elder/barcode theorem. -/\ntheorem ordinaryH0_filtration_difference_zero_iff_joinedIn\n {X : Type w} [TopologicalSpace X] (g : X → ℝ) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) {s t : ℝ} (hst : s ≤ t)\n (x y : superlevel_set g s) :\n (ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R x -\n ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R y) ≫\n (superlevel_h0Filtration g R).map (homOfLE hst" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean", + "sha256": "8a2470431c3fda5e98859aa9372cbb8866ed5c5c722cea5dfc28cb577840bbad", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_continuous", + "line": 49, + "source_header": "n\n\n/-- Proves: a smooth height in the Field sense is continuous.\nMethod: the `n = 0` instance of `IsSmooth` and `ContDiff.continuous`.\nDoes not establish: any regularity beyond continuity. -/\ntheorem superlevelBarField_continuous {d : ℕ} {g : E d → ℝ} (hg : IsSmooth d g) :\n Continuou" + }, + { + "kind": "def", + "unqualified_name": "superlevelBarField_interface", + "line": 56, + "source_header": "ous\n\n/-- Proves: the C263 data inhabit the Field interface for every dimension and period.\nMethod: death height and essentiality are the C263 definitions, the maximin clause is\n`superlevelBar_strict_cut`, and the elder relation is the right-hand side of its clause.\nDoes not establish: a persistence-module elder rule; `elderPartner_iff` holds by\ndefinition, and periodicity and `L` are not used. -/\ndef superlevelBarField_interface (d : ℕ) (L : ℝ) : SuperlevelBarInterface d L where\n deathH" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_nonempty", + "line": 72, + "source_header": "f.rfl\n\n/-- Proves: the Field superlevel-bar interface is inhabited for every `d` and `L`.\nMethod: the record above. Does not establish: that any inhabitant is the source's\nsuperlevel H0 object. -/\ntheorem superlevelBarField_nonempty (d : ℕ) (L : ℝ) :\n Nonempty (SuperlevelBarInterfa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_deathHeight_eq", + "line": 79, + "source_header": "ce d L⟩\n\n/-- Proves: the death height of the record is the C263 death height.\nMethod: `rfl`. Does not establish: a finite death for an essential point. -/\ntheorem superlevelBarField_deathHeight_eq {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :\n (superlevelBarField_interface d L).deathHeight g M = superlevelBar_deathH" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_isEssential_iff", + "line": 85, + "source_header": ":=\n rfl\n\n/-- Proves: essentiality in the record is global maximality.\nMethod: `Iff.rfl`. Does not establish: agreement with a persistence essential class. -/\ntheorem superlevelBarField_isEssential_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :\n (superlevelBarField_interface d L).IsEssential g M ↔ ∀ y" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_elderPartner_iff", + "line": 91, + "source_header": "=\n Iff.rfl\n\n/-- Proves: the elder relation of the record is, for every height, the right-hand side\nof the interface clause. Method: `Iff.rfl`, since it is defined that way.\nDoes not establish: that this relation is ordinary elder death in any persistence sense. -/\ntheorem superlevelBarField_elderPartner_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M S : E d) :\n (superlevelBarField_interface d L).ElderPartner g M S ↔\n (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ superlevelBar_isEssential g M ∧\n superlevelBar_deathHeig" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_essential_unique", + "line": 100, + "source_header": ":=\n Iff.rfl\n\n/-- Proves: on smooth periodic heights every inhabitant's essentiality is global maximality.\nMethod: its own `essential_iff` clause. Does not establish: anything off that locus. -/\ntheorem superlevelBarField_essential_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d) :\n I.IsEssential g M ↔ superlevelBar_" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_deathHeight_unique", + "line": 107, + "source_header": "l_iff g hs hp M\n\n/-- Proves: on smooth periodic heights every inhabitant's death height at a nonessential\npoint is the C263 death height. Method: its maximin clause is a strict cut for the\nclearance set, and `superlevelBar_cut_unique` leaves one such number.\nDoes not establish: agreement at essential points (see the control below). -/\ntheorem superlevelBarField_deathHeight_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d)\n (hM : ¬ I.IsEssential g M) :\n I.deathHeight g M = superlevelBa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_elderPartner_unique", + "line": 120, + "source_header": "n g hs hp M hM h)\n\n/-- Proves: on the Morse distinct-value locus of smooth periodic heights every inhabitant's\nelder relation is the record's. Method: both are their clause's right-hand side, whose\nessentiality and death-height terms agree by the two uniqueness theorems above.\nDoes not establish: agreement off the Morse distinct-value locus, where the interface\nconstrains no elder relation. -/\ntheorem superlevelBarField_elderPartner_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (hm : IsMorseDistinct d L g)\n (M S : E d) :\n I.ElderPartner g M S ↔ (superlevelBarField_interface d L)" + }, + { + "kind": "def", + "unqualified_name": "superlevelBarField_shift", + "line": 139, + "source_header": "hne').trans hdeath⟩\n\n/-- Proves: a second record, equal to the first except that its death height is the\nconstant `c` at essential points, also inhabits the interface. Method: off the essential\npoints it is the C263 death height, so the same strict cut applies; its elder relation is\nagain its clause's right-hand side. Does not establish: any preferred value at essential\npoints. -/\ndef superlevelBarField_shift (d : ℕ) (L c : ℝ) : SuperlevelBarInterface d" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_shift_deathHeight_const", + "line": 160, + "source_header": "_ _ _ _ _ => Iff.rfl\n\n/-- Proves: at a constant height the shifted record's death height is `c`.\nMethod: every point of a constant height is essential. Does not establish: a finite bar\nfor a constant height. -/\ntheorem superlevelBarField_shift_deathHeight_const (d : ℕ) (L c b : ℝ) (M : E d) :\n (superlevelBarField_shift d L c).deathHe" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_const_smooth", + "line": 171, + "source_header": "l\n rw [ite_eq_left hM]\n\n/-- Proves: constant heights are smooth. Method: `contDiff_const`.\nDoes not establish: anything about nonconstant heights. -/\ntheorem superlevelBarField_const_smooth (d : ℕ) (b : ℝ) : IsSm" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_const_periodic", + "line": 176, + "source_header": "fun _ => contDiff_const\n\n/-- Proves: constant heights are `L`-periodic. Method: both sides are the constant.\nDoes not establish: anything about the lattice. -/\ntheorem superlevelBarField_const_periodic (d : ℕ) (L b : ℝ) :\n IsLPeri" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_control_essential_free", + "line": 182, + "source_header": "d => b) :=\n fun _ _ => rfl\n\n/-- Proves: the nonessential hypothesis of `superlevelBarField_deathHeight_unique` cannot\nbe dropped: at the smooth periodic constant height `0` every point is essential for both\nrecords, the record's death height there is `0`, its shift by `1` has death height `1`,\nand the two differ. Method: `superlevelBar_death_const` and the shifted value.\nDoes not establish: anything about nonessential points, where all inhabitants agree. -/\ntheorem superlevelBarField_control_essential_free (d : ℕ) (L : ℝ) (M : E d) :\n IsSmooth d (fun _ : E d => (0 : ℝ)) ∧ IsLPeriodic d L (fun _ : E d => (0 : ℝ)) ∧\n (superlevelBarField_interface d L).IsEssential (fun _ => (0 : ℝ)) M ∧\n (superlevelBarField_shift d L 1).IsEssential (fun _ => (0 : ℝ)) M ∧\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M = 0 ∧\n (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : ℝ)) M = 1 ∧\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M ≠\n (superlevelBarField_shift d L 1).dea" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean", + "sha256": "346eea948e18d5904422904006827930e27d3141ccbc19ee8ac2c24bcf65a4a9", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "superlevelBar_E", + "line": 38, + "source_header": "n\n\n/-- Proves: the ambient type is real Euclidean space in the stated dimension.\nMethod: a type abbreviation. Does not establish: a positive-dimensional or\nperiodic quotient-space hypothesis. -/\nabbrev superlevelBar_E (d :" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_isEssential", + "line": 43, + "source_header": "d)\n\n/-- Proves: the essentiality datum is total. Method: global order comparison.\nDoes not establish: an actual persistence interpretation off the guarded locus. -/\ndef superlevelBar_isEssential {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) :" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_clearanceSet", + "line": 49, + "source_header": "≤ g M\n\n/-- Proves: a total strict-clearance set with the source's existential endpoint.\nMethod: quantify over actual paths and every parameter, including endpoints.\nDoes not establish: a path attaining the supremum with closed inequalities. -/\ndef superlevelBar_clearanceSet {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d)" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_deathHeight", + "line": 56, + "source_header": "(γ t)}\n\n/-- Proves: the death datum is a total real number with explicit empty default.\nMethod: nonempty conditional supremum; boundedness is proved below.\nDoes not establish: a finite death for an essential class. -/\ndef superlevelBar_deathHeight {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_essential_iff", + "line": 65, + "source_header": "M) else 0\n\n/-- Proves: essentiality is exactly global maximality for these total data.\nMethod: unfold the defining proposition. Does not establish: agreement with\nan independently defined essential persistence class. -/\ntheorem superlevelBar_essential_iff {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) :\n superlevelBar_isEssential g M ↔ ∀ y" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_mem_lt_start", + "line": 72, + "source_header": ":= Iff.rfl\n\n/-- Proves: an unconditional strict bound on each clearance member.\nMethod: evaluate its path at zero. Does not establish: an unconditional bound\non the default death value when the clearance set is empty. -/\ntheorem superlevelBar_mem_lt_start {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) {h : ℝ} (hh : h ∈ superlevelBar_clearanceSet g M)" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_bddAbove", + "line": 82, + "source_header": "] using hzero\n\n/-- Proves: the clearance set is bounded above, including when empty.\nMethod: the initial height bounds each member. Does not establish: that the\nempty-set default death value obeys the same bound. -/\ntheorem superlevelBar_clearance_bddAbove {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) : BddAbove (superlevelBar_cl" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_empty_of_essential", + "line": 89, + "source_header": "art g M hh).le⟩\n\n/-- Proves: essentiality forces the clearance set to be empty.\nMethod: contradict the required strictly higher endpoint.\nDoes not establish: a converse for arbitrary discontinuous heights. -/\ntheorem superlevelBar_clearance_empty_of_essential {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hM : superlevelBar_isEssential g M) : superlevelBar_cle" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_zero_of_empty", + "line": 102, + "source_header": "act False.elim hh\n\n/-- Proves: an empty clearance set selects the declared real value zero.\nMethod: simplify the conditional definition. Does not establish: a geometric\ndeath event or finite persistence interval at that zero. -/\ntheorem superlevelBar_death_eq_zero_of_empty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (he : superlevelBar_clearanceSet g M = ∅) : superlevelBar_" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_zero_of_essential", + "line": 111, + "source_header": "ar_deathHeight, he]\n\n/-- Proves: essential inputs have the declared zero default.\nMethod: essentiality implies empty clearance, then use the empty branch.\nDoes not establish: an essential-bar death height. -/\ntheorem superlevelBar_death_eq_zero_of_essential {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hM : superlevelBar_isEssential g M) : superlevelBa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_sSup_of_nonempty", + "line": 120, + "source_header": "_of_essential g M hM)\n\n/-- Proves: nonempty clearance selects its real supremum in the total data.\nMethod: simplify the nonempty conditional branch. Does not establish:\nnonemptiness without a witness or a regularity hypothesis. -/\ntheorem superlevelBar_death_eq_sSup_of_nonempty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hne : (superlevelBar_clearanceSet g M).Nonempty) :\n superlevelBar_deathHeight g M = sSup (superlev" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_path_minimum", + "line": 130, + "source_header": "eight, ite_eq_left hne]\n\n/-- Proves: a continuous height attains a minimum along each actual path.\nMethod: compact unit interval and the extreme-value theorem.\nDoes not establish: a minimum over all paths or an optimal path. -/\ntheorem superlevelBar_path_minimum {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) {M y : superlevelBar_E d} (γ : Path M y) :\n ∃ t₀ : unitInterval, ∀ t : unitInt" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_nonempty", + "line": 142, + "source_header": "=> hmin (Set.mem_univ t)⟩\n\n/-- Proves: nonessential continuous inputs have a nonempty clearance set.\nMethod: a higher endpoint, Path.segment, and minimum minus one.\nDoes not establish: compactness of the whole Euclidean domain. -/\ntheorem superlevelBar_clearance_nonempty {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n (superlevelBar" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_nonempty_iff", + "line": 163, + "source_header": "ave ht := hmin t\n linarith\n\n/-- Proves: for continuous heights, clearance is nonempty exactly off the\nessential locus. Method: the higher witness endpoint and the straight-path\nconstruction. Does not establish: this equivalence without continuity. -/\ntheorem superlevelBar_clearance_nonempty_iff {d : ℕ}\n (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d) :\n (superlevelBar_clearanceSet g M).Nonempty ↔ ¬" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_downward", + "line": 174, + "source_header": "Bar_clearance_nonempty g hg M\n\n/-- Proves: any smaller threshold than an existing clearance is a clearance.\nMethod: reuse the same endpoint and path and compose strict inequalities.\nDoes not establish: strict improvement to a larger threshold. -/\ntheorem superlevelBar_clearance_downward {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) {h c : ℝ} (hhc : h < c)\n (hc : c ∈ superlevelBar_clearanceSet g M) : h ∈" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_improve", + "line": 183, + "source_header": ", γ, fun t => hhc.trans (hγ t)⟩\n\n/-- Proves: each strict witness has a larger strict witness on its same path.\nMethod: attained minimum and a midpoint below it.\nDoes not establish: a witness with clearance strictly above the supremum. -/\ntheorem superlevelBar_clearance_improve {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d) {h : ℝ}\n (hh : h ∈ superlevelBar_clearanceSet g M) :\n ∃ c : ℝ, h < c ∧ c" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_strict_cut", + "line": 199, + "source_header": "have ht := hmin t\n linarith\n\n/-- Proves: the exact strict cut for continuous nonessential inputs.\nMethod: least-upper-bound property, downward closure and strict improvement.\nDoes not establish: closed-threshold attainment at the death height. -/\ntheorem superlevelBar_strict_cut {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) (h : ℝ) :\n h < superlevelBar_deathHeight g M ↔" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_le_start_of_nonempty", + "line": 223, + "source_header": "evelBar_clearance_bddAbove g M) hc)\n\n/-- Proves: the death value is at most the initial height when clearance is\nnonempty. Method: the supremum is at most this upper bound.\nDoes not establish: the bound on the empty default branch. -/\ntheorem superlevelBar_death_le_start_of_nonempty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hne : (superlevelBar_clearanceSet g M).Nonempty) :" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_le_start", + "line": 233, + "source_header": "uperlevelBar_mem_lt_start g M hh).le)\n\n/-- Proves: the death upper bound for continuous nonessential inputs.\nMethod: establish nonempty clearance and apply its guarded supremum bound.\nDoes not establish: a strict inequality or an attained optimal path. -/\ntheorem superlevelBar_death_le_start {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_eq_Iio", + "line": 242, + "source_header": "rlevelBar_clearance_nonempty g hg M hM)\n\n/-- Proves: the clearance set is the open lower interval below death on the\ncontinuous nonessential locus. Method: extensionality and the strict cut.\nDoes not establish: a closed-threshold path at the excluded endpoint. -/\ntheorem superlevelBar_clearance_eq_Iio {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n superlevelBar_clearanceSet g M" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_not_mem_clearance", + "line": 252, + "source_header": "uperlevelBar_strict_cut g hg M hM h).symm\n\n/-- Proves: death is not a strict clearance for continuous nonessential inputs.\nMethod: the cut would otherwise imply that death is strictly below itself.\nDoes not establish: failure or success of closed-threshold attainment. -/\ntheorem superlevelBar_death_not_mem_clearance {d : ℕ}\n (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n superlevelBar_death" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_cut_unique", + "line": 263, + "source_header": "Height g M)).2 hh\n exact (lt_irrefl _) hlt\n\n/-- Proves: uniqueness of a real number with this strict cut on the valid locus.\nMethod: evaluate either cut at the competing endpoint.\nDoes not establish: equality of arbitrary total interface records off that locus. -/\ntheorem superlevelBar_cut_unique {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) (a : ℝ)\n (ha : ∀ h : ℝ, h < a ↔ h ∈ superlevelBar_clearanceSet" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_const", + "line": 280, + "source_header": ").1 hlt\n exact (lt_irrefl a) ((ha a).2 hc)\n\n/-- Proves: any constant height selects the zero default at every point.\nMethod: every point is globally maximal, hence essential in these data.\nDoes not establish: any finite ordinary bar for that constant height. -/\ntheorem superlevelBar_death_const (d : ℕ) (b : ℝ) (M : superlevelBar_E d) :\n superlevelBar_dea" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_control_negative_essential", + "line": 289, + "source_header": "h_eq_zero_of_essential\n intro y\n exact le_rfl\n\n/-- Proves: the essential default forbids an unconditional death/start bound.\nMethod: constant height minus one has empty clearance and death zero.\nDoes not establish: any finite ordinary bar on a constant field. -/\ntheorem superlevelBar_control_negative_essential (d : ℕ) (M : superlevelBar_E d) :\n superlevelBar_deathHeight (fun _ : superlevelBar_E d => (-1 : ℝ)) M = 0 ∧\n ¬ superlevelBar_deathHeight (fu" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/specifications/lean_statements_20261010/Specifications/Field.lean", + "sha256": "f22c91e082cd7e738ba47c9c3534e47ac687d066f0b78586d15103cf1132535e", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 40, + "source_header": "y\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) : T" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 49, + "source_header": "d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 58, + "source_header": ": ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 69, + "source_header": "2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 81, + "source_header": "Sum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 92, + "source_header": "(x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g : E" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 101, + "source_header": "d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g :" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 110, + "source_header": "ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 152, + "source_header": "∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian (d" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 162, + "source_header": "ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoint" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 171, + "source_header": "(x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d :" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 187, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNonde" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 197, + "source_header": "icalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsIndex" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 207, + "source_header": "Point d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnoncomp" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 216, + "source_header": "ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 225, + "source_header": "(d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module." + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 255, + "source_header": "ap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsCan" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 274, + "source_header": "ndegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the source)" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 287, + "source_header": "sCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNondeg" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 323, + "source_header": "ax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d :" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 335, + "source_header": ":=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pair" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 346, + "source_header": "Domain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d : ℕ" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 357, + "source_header": "d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gauss" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean", + "sha256": "3dab19342c307f6b70f4fa05ac913b4ead083742a56408db71b45276c0acb9ab", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "elderActive", + "line": 19, + "source_header": "u\n\n/-- Increasing parameter `t=-height`: closed birth and open death. -/\ndef elderActive (m d t : ℝ) : P" + }, + { + "kind": "def", + "unqualified_name": "elderFiber", + "line": 24, + "source_header": "k]\n\n/-- The fiber is k on the interval and the zero submodule elsewhere. -/\ndef elderFiber (m d t : ℝ) : Submodule k k where\n ca" + }, + { + "kind": "theorem", + "unqualified_name": "elderFiber_eq_zero", + "line": 31, + "source_header": "hb h]\n\ntheorem elderFiber_eq_zero {m d t : ℝ} (ht : ¬ elderActive m d t)\n (x : elderFiber k m d t) :" + }, + { + "kind": "def", + "unqualified_name": "elderFiberMap", + "line": 36, + "source_header": "ty ht\n\ndef elderFiberMap (m d : ℝ) {s t : ℝ} (hst : s ≤ t) :\n elderFiber k m d s →ₗ[k] elderFiber k m d t where\n to" + }, + { + "kind": "def", + "unqualified_name": "elderInterval", + "line": 53, + "source_header": "= rfl\n\n/-- The actual interval persistence functor; no maps are assumed. -/\ndef elderInterval (m d : ℝ) : ℝ ⥤ ModuleCat k where" + }, + { + "kind": "def", + "unqualified_name": "elderFiberLift", + "line": 79, + "source_header": "mp [ht]\n\n/-- A canonical lift of a coefficient to any active interval fiber. -/\ndef elderFiberLift {m d t : ℝ} (ht : elderActive m d t) :\n k →ₗ[k] elderFiber k m d t where" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_birth", + "line": 89, + "source_header": "a := rfl\n\n/-- Endpoint control: birth is included. -/\ntheorem elder_control_birth {m d : ℝ} (hdm : d < m) : elderActi" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_death", + "line": 93, + "source_header": ";> linarith\n\n/-- Endpoint control: death is excluded, despite closed superlevels. -/\ntheorem elder_control_death (m d : ℝ) : ¬ elderAc" + }, + { + "kind": "structure", + "unqualified_name": "ElderTrap", + "line": 100, + "source_header": "X) (m d : ℝ)\n\n/-- The topological consequences of the asymmetric ridge trap. No H0 maps or\nsplitting conclusions occur among the premises. The path at d is actual closed\nsuperlevel connectivity, while active cuts are clopen. -/\nstructure ElderTrap (D : Set X) : Prop where\n death_lt_birth : d < m\n maximum_height : g M = m\n older_height : m < g P\n maximum_inside : M ∈ D\n older_outside : P ∉ D\n height_ceiling : ∀ x ∈ D, g x ≤ m\n active_clopen : ∀ t, elderActive m d t →\n IsClopen {x : superlevel_set g t | x.val ∈ D}\n closed_path : JoinedIn (superlevel" + }, + { + "kind": "theorem", + "unqualified_name": "ElderTrap.maximum_mem", + "line": 116, + "source_header": "d} {D : Set X}\n\ntheorem ElderTrap.maximum_mem (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : M ∈ sup" + }, + { + "kind": "theorem", + "unqualified_name": "ElderTrap.older_mem", + "line": 122, + "source_header": "linarith [ht.1]\n\ntheorem ElderTrap.older_mem (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : P ∈ sup" + }, + { + "kind": "theorem", + "unqualified_name": "elder_clopen_path_iff", + "line": 127, + "source_header": "T.older_height]\n\n/-- Clopen cuts are constant on actual path components, with no local path\nconnectivity assumption on the ambient space. -/\ntheorem elder_clopen_path_iff {Y : Type u} [TopologicalSpace Y] {U : Set Y}\n (hU : IsClopen U) {x y : Y} (p : Path x y" + }, + { + "kind": "def", + "unqualified_name": "ElderTrap.componentInside", + "line": 138, + "source_header": "nt_subset hy hyx⟩\n\n/-- The D indicator is genuinely descended to the path-component quotient. -/\ndef ElderTrap.componentInside (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : ZerothHomotopy (superle" + }, + { + "kind": "def", + "unqualified_name": "elderDifference", + "line": 150, + "source_header": "f.rfl\n\nvariable {k}\n\n/-- The actual singular-H0 point-class difference on an active level. -/\ndef elderDifference (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :\n ModuleCat.of k k ⟶ (superlevel_h0Filtration g (Mod" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_map", + "line": 159, + "source_header": "⟨P, T.older_mem ht⟩\n\ntheorem elderDifference_map (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_map_dead", + "line": 168, + "source_header": "⟩ ⟨P, T.older_mem hs⟩\n\ntheorem elderDifference_map_dead (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : -d ≤ t) (hst : s ≤ t) :" + }, + { + "kind": "def", + "unqualified_name": "elderProjection", + "line": 178, + "source_header": "superlevel_mono g ht)\n\n/-- The component indicator transported by the existing actual H0 comparison. -/\ndef elderProjection (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).o" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_point", + "line": 186, + "source_header": "e ht q then 𝟙 _ else 0)\n\ntheorem elderProjection_point (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) (x : superlevel_set g t) :\n ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k) x ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_projection", + "line": 198, + "source_header": "igma.ι_comp_desc]\n rfl\n\ntheorem elderDifference_projection (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :" + }, + { + "kind": "def", + "unqualified_name": "elderSectionApp", + "line": 207, + "source_header": "nside, T.older_outside]\n\ndef elderSectionApp (T : ElderTrap g M P m d D) (t : ℝ) :\n (elderInterval k m d).obj t ⟶\n (superlevel_h0Filtration g (M" + }, + { + "kind": "def", + "unqualified_name": "elderRetractionApp", + "line": 214, + "source_header": "rDifference T ht else 0\n\ndef elderRetractionApp (T : ElderTrap g M P m d D) (t : ℝ) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).obj t ⟶\n (eld" + }, + { + "kind": "theorem", + "unqualified_name": "elderSectionApp_naturality", + "line": 221, + "source_header": "rFiberLift k ht) else 0\n\ntheorem elderSectionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}\n (hst : s ≤ t) :\n (elderInterval k m d).map (homOfLE hst) ≫ elderSectionApp T t =\n elderSectionApp T s ≫\n (superlevel_h0Filtration g (ModuleCat.of" + }, + { + "kind": "def", + "unqualified_name": "elderSection", + "line": 246, + "source_header": "ro k hs x\n simp [hx]\n\n/-- Section from the interval to actual singular H0. -/\ndef elderSection (T : ElderTrap g M P m d D) :\n elderInterval k m d ⟶ superlevel_h0Filtration g (Modu" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_naturality_active", + "line": 254, + "source_header": "_naturality T (leOfHom f)\n\ntheorem elderProjection_naturality_active (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_prebirth", + "line": 266, + "source_header": "erProjection_point]\n rfl\n\n/-- The birth-crossing square follows from the geometric height ceiling:\nthere is no source point in D above m. It is not an assumed naturality field. -/\ntheorem elderProjection_prebirth (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : s < -m) (ht : elderActive m d t) (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderRetractionApp_naturality", + "line": 287, + "source_header": "right hx]\n erw [comp_zero]\n\ntheorem elderRetractionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}\n (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫\n elderRetractionApp T t =\n elderRetractionApp T s ≫ (elderInterv" + }, + { + "kind": "def", + "unqualified_name": "elderRetraction", + "line": 328, + "source_header": "simp [htd]\n · simp [hs]\n\n/-- Retraction from actual singular H0 to the interval, using component descent. -/\ndef elderRetraction (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k k) ⟶ el" + }, + { + "kind": "theorem", + "unqualified_name": "elderSection_retraction", + "line": 339, + "source_header": "r. -/\n@[reassoc (attr := simp)]\ntheorem elderSection_retraction (T : ElderTrap g M" + }, + { + "kind": "def", + "unqualified_name": "elderKernelProjection", + "line": 354, + "source_header": "er_eq_zero k ht x\n simp [hx]\n\ndef elderKernelProjection (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k" + }, + { + "kind": "def", + "unqualified_name": "elderDirectSummand", + "line": 361, + "source_header": "n, Category.comp_id, sub_self])\n\n/-- An actual natural direct-sum isomorphism, not a postulated decomposition.\nIts maps are v ↦ (qv,v-jqv) and (c,w) ↦ jc+w. -/\ndef elderDirectSummand (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k k) ≅\n elderInterval k" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_ordinary_point_survives", + "line": 381, + "source_header": "gory.assoc, Preadditive.comp_sub]\n\n/-- Ordinary individual point classes remain nonzero; the dying section uses\ntheir difference. This is valid independently of characteristic. -/\ntheorem elder_control_ordinary_point_survives (t : ℝ) (x : superlevel_set g t) :\n ordinaryH0_pointClass (TopCat.of (superlevel" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean", + "sha256": "6b0be1116f6b357b0ffbda202c572c27c2788b98bee639e228375a5ebeea1fa9", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "elderTrap_closedTrace_isClopen", + "line": 15, + "source_header": "u\n\n/-- Every active closed level includes continuously into the strict level\nabove d. Pulling back the proved strict separation gives closed-level separation. -/\ntheorem elderTrap_closedTrace_isClopen {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d t : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d)) (ht : t < -d) :\n IsClopen {x : superlevel_set g t | x.val ∈" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_of_boundary", + "line": 27, + "source_header": "hi\n\n/-- Actual geometric boundary, ceiling and closed path data inhabit the interval\ntrap. There is no H0 equation, interval split, clearance or death among inputs. -/\ntheorem elderTrap_of_boundary {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n ElderTrap g M P m d D where\n death_lt_" + }, + { + "kind": "def", + "unqualified_name": "elderBoundaryDirectSummand", + "line": 52, + "source_header": "hγ t\n\n/-- The constructed singular-H0 direct summand, instantiated from geometric\ninputs, rather than a premise asserting that a persistence summand exists. -/\ndef elderBoundaryDirectSummand (k : Type u) [Field k]\n {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevel_h0Filtration g (ModuleCat.of k k) ≅\n elderInterval k m d ⊞ kernel (elderRetrac" + }, + { + "kind": "theorem", + "unqualified_name": "elderBoundary_death_eq", + "line": 67, + "source_header": "P γ hγ)\n\n/-- On Euclidean heights the same geometric inputs also give the literal C263\ndeath. This is a proved join, not identification of an abstract death field. -/\ntheorem elderBoundary_death_eq {n : ℕ}\n (g : superlevelBar_E n → ℝ) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (m d : ℝ) (M P : superlevelBar_E n)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_deathHeigh" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean", + "sha256": "d3d78472881059546402218cc77792eeef00755c222bb02499d69abd3b5cd57e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "elderTrap_strictTrace", + "line": 19, + "source_header": "n\n\n/-- The trace of a geometric domain in the strict superlevel above d. -/\ndef elderTrap_strictTrace {X : Type*} (g : X → ℝ) (D : Set X) (d : ℝ) :\n Set {x : X // d < g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_strictTrace_isClopen", + "line": 23, + "source_header": "D}\n\n/-- A boundary height bound makes the trace clopen in the strict superlevel.\nThis derives separation from a geometric domain; it does not assume a path cut. -/\ntheorem elderTrap_strictTrace_isClopen {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ) (hD : IsClosed D)\n (hboundary : ∀ x ∈ frontier D, g x ≤ d) :\n IsClopen (elderTrap_strictTrace g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_path_stays", + "line": 47, + "source_header": "e_val\n\n/-- A path strictly above the exit threshold cannot leave the geometric trap. -/\ntheorem elderTrap_path_stays {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n {M y : X} (hM : M ∈ D) (γ : Path M y)\n (hγ : ∀ t : unitInterval, d < g (γ t))" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_higher_path_meets_threshold", + "line": 66, + "source_header": "ng hone\n\n/-- Every higher-endpoint path must meet or fall below the exit threshold.\nThe conclusion quantifies over all ambient paths, including remote detours. -/\ntheorem elderTrap_higher_path_meets_threshold {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)\n {y : X} (hy : g M < g y) (γ : Path M y) :\n ∃ t : unitInterval, g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_clearance_eq_Iio", + "line": 79, + "source_header": "hyD)) hy\n\n/-- The literal C263 clearance is exactly the strict interval below d.\nThe closed path is supplied by the geometric construction, rather than inferred\nfrom a supremum over paths or from a compactness assertion about path space. -/\ntheorem elderTrap_clearance_eq_Iio {n : ℕ}\n (g : superlevelBar_E n → ℝ) (D : Set (superlevelBar_E n)) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ g M)\n (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_clearanceSet g M" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_death_eq", + "line": 98, + "source_header": "hh (hγ t)⟩\n\n/-- With continuity, the new geometric cut identifies the existing C263 death.\nNonessentiality is derived from the actual higher point P. -/\ntheorem elderTrap_death_eq {n : ℕ}\n (g : superlevelBar_E n → ℝ) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ g M)\n (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_deathH" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_closed_path_attains", + "line": 116, + "source_header": "P γ hγ]\n rfl\n\n/-- The displayed closed path actually attains d. This does not replace strict\nclearance by a closed inequality or infer an optimal path from a supremum. -/\ntheorem elderTrap_closed_path_attains {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)\n {P : X} (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n ∃ t : unitInterv" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:frontiers/compact_morse_elder_adapter_20261018", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "frontiers/compact_morse_elder_adapter_20261018", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeGeometry.lean", + "sha256": "8ec4b18959055f20d849337e44a70d0c5b39b7959b54cb4d7b6c2a473ee0612d", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "coordinates", + "line": 14, + "source_header": "d\n\ndef coordinates (d : ℕ) : E d ≃L[ℝ] (Fin d → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "coordinates_latticeVec", + "line": 20, + "source_header": "l\n\ntheorem coordinates_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :\n coordinates d (latticeVec d L n) = fun i => L * (n i : ℝ" + }, + { + "kind": "def", + "unqualified_name": "actualField", + "line": 25, + "source_header": "]\n\n/-- The same carrier, same law, and same literal source; only spatial coordinates change. -/\ndef actualField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : E d)" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_smooth", + "line": 29, + "source_header": "x)\n\ntheorem actualField_smooth (d : ℕ) {L : ℝ} (hL : 0 < L)\n (ω : SmoothSample d L) : IsSmooth d (actualField d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_periodic", + "line": 35, + "source_header": "iff\n\ntheorem actualField_periodic (d : ℕ) {L : ℝ} (hL : 0 < L)\n (ω : SmoothSample d L) : IsLPeriodic d L (actualField d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_eval_measurable", + "line": 43, + "source_header": "x)\n\ntheorem actualField_eval_measurable (d : ℕ) (L : ℝ) (x : E d) :\n Measurable (fun ω => actualField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_eval_hasGaussianLaw", + "line": 48, + "source_header": "L)\n\ntheorem actualField_eval_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x : E d) : HasGaussianLaw (fun ω => actualField d L ω x) (smoothLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_measurable", + "line": 53, + "source_header": "l 0\n\ntheorem actualField_linearCombination_measurable (d : ℕ) (L : ℝ) {m : ℕ}\n (x : Fin m → E d) (a : Fin m → ℝ) :\n Measurable (fun ω => ∑ i, a i * actualField d L ω (x" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_hasGaussianLaw", + "line": 59, + "source_header": ")))\n\ntheorem actualField_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ}\n (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n HasGaussianLaw (fun ω => ∑ i, a i * actualField d L ω (x i)) (smoothLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_integral_zero", + "line": 73, + "source_header": "map\n\ntheorem actualField_integral_zero (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n ∫ ω, actualField d L ω x ∂smoothLaw d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_integral_zero", + "line": 82, + "source_header": "x)\n\ntheorem actualField_linearCombination_integral_zero (d : ℕ) {L : ℝ}\n (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n ∫ ω, (∑ i, a i * actualField d L ω (x i)) ∂smoothLaw d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_covariance_spectral", + "line": 90, + "source_header": "ro]\n\ntheorem actualField_covariance_spectral (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =\n I4Kernel.sourceSpectralKernel d L (coordinates d (x -" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/C291/SourceLifetimeField.lean", + "sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "actualField_covariance", + "line": 15, + "source_header": "d\n\ntheorem actualField_covariance (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =\n periodicCovariance d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_raw_second_moment", + "line": 22, + "source_header": ")\n\ntheorem actualField_raw_second_moment (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n ∫ ω, actualField d L ω x * actualField d L ω y ∂smoothLaw d L =\n periodicCovariance d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_variance", + "line": 29, + "source_header": "y\n\ntheorem actualField_linearCombination_variance (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n Var[fun ω => ∑ i, a i * actualField d L ω (x i); smoothLaw d L] =\n covQuadForm d L x" + }, + { + "kind": "theorem", + "unqualified_name": "covQuadForm_nonneg", + "line": 44, + "source_header": "g\n\ntheorem covQuadForm_nonneg (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n 0 ≤ covQuadForm d L x" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_map", + "line": 50, + "source_header": "_\n\ntheorem actualField_linearCombination_map (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n (smoothLaw d L).map (fun ω => ∑ i, a i * actualField d L ω (x i)) =\n gaussianReal 0 ⟨covQuadForm d L x a, covQuadForm_nonneg d hL x a" + }, + { + "kind": "def", + "unqualified_name": "actualGaussianFieldInterface", + "line": 61, + "source_header": ")\n\n/-- The original target on the unchanged coefficient carrier and preserved source law. -/\ndef actualGaussianFieldInterface (d : ℕ) (L : ℝ) (hL : 0 < L) :\n GaussianFieldInterface d L where" + }, + { + "kind": "theorem", + "unqualified_name": "actualGaussianFieldInterface_exists", + "line": 76, + "source_header": "hL\n\ntheorem actualGaussianFieldInterface_exists (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Nonempty (GaussianFieldInterface d" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/C291/inputs/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 65, + "source_header": "y\n\n/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this\nnamespace). The duplication is deliberate: modules of this packet import only Mathlib. -/\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 77, + "source_header": "in d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 86, + "source_header": "i : ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 97, + "source_header": "^ 2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 109, + "source_header": "taSum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : F" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 120, + "source_header": "L (x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g :" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 129, + "source_header": "ec d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 138, + "source_header": "ℕ, ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 180, + "source_header": "y ∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 190, + "source_header": ": ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoi" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 199, + "source_header": "ℝ) (x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 215, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNon" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 225, + "source_header": "iticalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsInd" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 235, + "source_header": "alPoint d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 244, + "source_header": ": ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnon" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 253, + "source_header": "nS (d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence modul" + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 283, + "source_header": "tGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsC" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 302, + "source_header": "NondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the sourc" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 315, + "source_header": "IsCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNond" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 351, + "source_header": "gMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 363, + "source_header": "p :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pai" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 374, + "source_header": "ndDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d :" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 385, + "source_header": "E d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gau" + }, + { + "kind": "def", + "unqualified_name": "IsWindowPair", + "line": 407, + "source_header": "A ∧\n ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)\n\n/-! ### Populations of pairs -/\n\n/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with\n`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none beyond the shared predicates.\nDoes not claim: anything about the off-diagonal (far) population separately (Section" + }, + { + "kind": "structure", + "unqualified_name": "PairLawInterface", + "line": 442, + "source_header": ": ℝ) (g : E d → ℝ) (M S : E d) : Prop :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S\n\n/-! ### The typed pair law as an interface -/\n\n/-- Interface for the weighted regression (typed pair) law: the only object consumed by the\nstatements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death\npartner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the\nlaw `Q^W = (W_r/Z_r) Q_{r,b,k,R}` with `W_r = |det H_M det H_S| 1{H_M<0, index(H_S)=d-1}`.\nThat law, its weight, its normalizer and the regression construction are informal in the\nsource and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark\n`k` and orthonormal frame `R` with values in `[0, 1]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S.\"\nInterface: `p` is given; its only hypothesis fields are the bounds `0 ≤ p ≤ 1`. The parameters `G` and `I` record which field and which elder relation the law refers to; no field ties `p` to them.\nDoes not claim: existence of the regression law, the typed weight, the full normalizer `Z_r > 0`, or that `p` is the probability of any event under any measure declared here; that `p` depends on `G` or `I` in any way (no field mentions them; they only record which field and elder relation the law is meant to refer to). -/\nstructure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)\n (I : SuperlevelBarInterface d L) where\n /-- Section 1 clause: \"Let p_r(b,k,R) be the Q^W probability that the global ordinary\n superlevel elder death partner of M is S.\" -/\n p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R\n /-- `p` is a proba" + }, + { + "kind": "def", + "unqualified_name": "ParentUniformSelectionA", + "line": 466, + "source_header": "ility: at most one. -/\n p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1\n\n/-! ### The parent statements (1.1), (1.2), (1.3) -/\n\n/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`\nand `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)\nsuch that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all\northonormal frames `R`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There exist r_*>0 and C 0` and\nwindows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a\nconstant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and\nelder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,\n`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),\"\nInterface: `G` and `I` are given; \"versions\" are any `νc`, `νe` satisfying `IsLifetimeDensityVersion` (integral identity), not a Kac-Rice representation; the coefficient `c_{B,K}` is existential, not the Gaussian integral (11.3).\nDoes not claim: the parent result or its proof; the exact coefficient formula (11.3); existence of the versions; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef ParentCompactWindowDensityB (d :" + }, + { + "kind": "def", + "unqualified_name": "IsUnrestrictedLeadingCoefficient", + "line": 510, + "source_header": "r : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.\nThe essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the\nconclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,\nnot by the integral (13.6)/(15.2).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There is a positive finite constant c_{d,L} such that\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the explicit Gaussian/angular representation (15.2) of `c_{d,L}`; uniqueness of `c` (which follows from the asymptotics but is not stated); existence of versions. -/\ndef IsUnrestrictedLeadingC" + }, + { + "kind": "def", + "unqualified_name": "ParentUnrestrictedLeadingDensityC", + "line": 531, + "source_header": "∧\n Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe\n (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the\nunrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth\nheights, all positive gap marks, all separations; essential global maximum excluded) admit\nversions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the parent result or its proof (dominated convergence of Section 13, off-diagonal bound (14.1)); the representation (15.2); the compact-window `O(ell^(2/3))` difference for the unrestricted densities; any numerical enclosure of `c_{d,L}` (the SIDE24 coefficient track is separate); nonauthor review or acceptance. -/\ndef ParentUnrestr" + }, + { + "kind": "def", + "unqualified_name": "RemainderBoundedR1", + "line": 545, + "source_header": "(I : SuperlevelBarInterface d L) : Prop :=\n 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c\n\n/-! ### The bounded remainder (R1) -/\n\n/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed\n`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here\nby `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of\nthe unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,\n`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.\nThe `O(1)` remainder is stated with an explicit absolute-value bound.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a\nAnchor: \"|nu_cand(ell)-c ell^(-1/3)| <= C,\"\nInterface: `G` and `I` are given; `c` is any real satisfying the parent leading-coefficient property (the source says the coefficient \"is exactly the parent's equation (15.2)\"; that integral is not transcribed, so `c` is pinned through (1.3) instead); versions are characterised by the integral identity only. The statement does not mention the typed pair law: Theorem R does not consume (1.1).\nDoes not claim: the result or its proof (quadratic determinant cancellation (R7), coupling (R4), cap-loss bound (R12)); convergence of the remainder; a second coefficient; numerical `C` or `ell_*`; the compact-window `O(ell^(2/3))` difference without cutoffs; the parent interfaces it imports (D1-A-E); nonauthor review or acceptance. If no `c` satisfies the parent property the statement holds vacuously; that is a transcription of its dependency on (1.3), not a claim. -" + }, + { + "kind": "def", + "unqualified_name": "PlanarElderLowerE2", + "line": 569, + "source_header": "c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧\n |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C\n\n/-! ### Planar elder lower bound and density gap (d = 2) -/\n\n/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with\nbirth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging\nover `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all\n`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \"1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff\n`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the\ncompact-window candidate and ordinary elder densities satisfy\n`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper\ninput is an explicit hypothesis, not folded into the conclusion. The lower half, which the\nsource derives from (E2) alone, is stated under the same hypothesis because the source displays\n(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower\nhalf, recorded here as such.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \" <= C_{B,K} ell^(2/3). (E11)\"\nInterface: `G`, `I` and `PL` are given; the hypothesis `ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi` is the consumed parent upper input (a statement shape, not the parent result); versions are characterised by the integral identity only; the weighted Kac-Rice / radial ledger of [LP, Sections 9-11] that the source consumes is not transcribed. The interface does not determine `p` or the field: the Prop is a predicate on the interface objects, not a closed statement about the source's objects; nothing is asserted about its universal closure over all inhabitants, and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the result or its proof; the upper half independently of the parent (1.1); the parent (1.1) itself; the lower half without the hypothesis (the source has it from (E2) alone); sharpness of the `O(1)` remainder of (R1); removal of the compact-mark restriction; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef PlanarDensityGapE11 (L : ℝ) (G :" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/TorusTopology.lean", + "sha256": "ddb145b3f791c181d4f2a51e54e711937297bd6476ba55bcd5252b7ddb57cfe1", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "torus_E", + "line": 21, + "source_header": "n\nabbrev torus_E (d : ℕ" + }, + { + "kind": "def", + "unqualified_name": "torus_latticeVec", + "line": 22, + "source_header": ")\n\n/-- The exact `Field.latticeVec` formula, retained without any coordinate rescaling. -/\ndef torus_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) : torus_" + }, + { + "kind": "theorem", + "unqualified_name": "torus_field_latticeVec_formula", + "line": 26, + "source_header": "ℝ))\n\ntheorem torus_field_latticeVec_formula (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :\n torus_latticeVec d L n = ∑ i, EuclideanSpace.single i (L * (n i :" + }, + { + "kind": "def", + "unqualified_name": "torus_periodBasis", + "line": 29, + "source_header": "rfl\n\ndef torus_periodBasis (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Module.Basis (Fin d) ℝ (torus_E" + }, + { + "kind": "def", + "unqualified_name": "torus_periodLattice", + "line": 34, + "source_header": "e')\n\ndef torus_periodLattice (d : ℕ) (L : ℝ) (hL : 0 < L) : Submodule ℤ (torus_E" + }, + { + "kind": "abbrev", + "unqualified_name": "torus_quotient", + "line": 37, + "source_header": "L))\n\nabbrev torus_quotient (d : ℕ) (L : ℝ) (hL : 0 <" + }, + { + "kind": "def", + "unqualified_name": "torus_proj", + "line": 40, + "source_header": "oup\n\ndef torus_proj (d : ℕ) (L : ℝ) (hL : 0 < L) : torus_E d → torus_quotient d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_basis_sum_eq_latticeVec", + "line": 43, + "source_header": ".mk\n\n/-- Concrete adapter from integer basis coefficients to Field's exact vector formula. -/\ntheorem torus_basis_sum_eq_latticeVec (d : ℕ) (L : ℝ) (hL : 0 < L)\n (n : Fin d → ℤ) :\n ∑ i, n i • torus_periodBasis d L hL i = torus_latticeVec" + }, + { + "kind": "theorem", + "unqualified_name": "torus_lattice_mem_iff", + "line": 61, + "source_header": "hij]\n\ntheorem torus_lattice_mem_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x : torus_E d) :\n x ∈ torus_periodLattice d L hL ↔ ∃ n : Fin d → ℤ, torus_latticeVec d L" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_discrete", + "line": 68, + "source_header": "eVec]\n\ninstance torus_lattice_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :\n DiscreteTopology (torus_periodLattice d" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_addSubgroup_discrete", + "line": 73, + "source_header": "tance\n\ninstance torus_lattice_addSubgroup_discrete (d : ℕ) (L : ℝ) (hL : 0 < L) :\n DiscreteTopology (torus_periodLattice d L hL).toAddSub" + }, + { + "kind": "instance", + "unqualified_name": "torus_lattice_isZLattice", + "line": 78, + "source_header": "tance\n\ninstance torus_lattice_isZLattice (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsZLattice ℝ (torus_periodLattice d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_surjective", + "line": 83, + "source_header": "tance\n\ntheorem torus_proj_surjective (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Function.Surjective (torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_continuous", + "line": 86, + "source_header": "ctive\n\ntheorem torus_proj_continuous (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Continuous (torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_eq_iff", + "line": 89, + "source_header": "t_mk'\n\ntheorem torus_proj_eq_iff (d : ℕ) (L : ℝ) (hL : 0 < L) (x y : torus_E d) :\n torus_proj d L hL x = torus_proj d L hL y ↔\n ∃ n : Fin d → ℤ, y = x + torus_latticeVec" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_lattice_translate", + "line": 102, + "source_header": "abel⟩\n\n/-- Duplicate representatives have exactly the same quotient image. -/\ntheorem torus_control_lattice_translate (d : ℕ) (L : ℝ) (hL : 0 < L)\n (x : torus_E d) (n : Fin d → ℤ) :\n torus_proj d L hL (x + torus_latticeVec d L n) = torus_proj d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_proj_isCoveringMap", + "line": 108, + "source_header": "⟩).symm\n\ntheorem torus_proj_isCoveringMap (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsCoveringMap (torus_proj" + }, + { + "kind": "theorem", + "unqualified_name": "torus_compact", + "line": 114, + "source_header": "ringMap\n\ntheorem torus_compact (d : ℕ) (L : ℝ) (hL : 0 < L) :\n IsCompact (Set.univ : Set (torus_quotient d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_pathConnectedSpace", + "line": 121, + "source_header": "] at hc\n\ntheorem torus_pathConnectedSpace (d : ℕ) (L : ℝ) (hL : 0 < L) :\n PathConnectedSpace (torus_quotient" + }, + { + "kind": "def", + "unqualified_name": "torus_isPeriodic", + "line": 125, + "source_header": "ient _)\n\n/-- Exact Field periodicity predicate with the literal lattice-vector adapter above. -/\ndef torus_isPeriodic (d : ℕ) (L : ℝ) (g : torus_E d →" + }, + { + "kind": "theorem", + "unqualified_name": "torus_field_periodic_formula", + "line": 129, + "source_header": "n) = g x\n\ntheorem torus_field_periodic_formula (d : ℕ) (L : ℝ) (g : torus_E d → ℝ) :\n torus_isPeriodic d L g ↔\n ∀ (x : EuclideanSpace ℝ (Fin d)) (n : Fin d → ℤ),\n g (x + ∑ i, EuclideanSpace.single i (L * (n i : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "torus_periodic_respects", + "line": 134, + "source_header": "= Iff.rfl\n\ntheorem torus_periodic_respects (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x y : torus_E d)\n (hxy : QuotientAddGroup.leftRel (torus_periodLattice d L hL).toAddSubgroup x y) :" + }, + { + "kind": "def", + "unqualified_name": "torus_descend", + "line": 142, + "source_header": "x n).symm\n\ndef torus_descend (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) : torus_quotient d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_descend_proj", + "line": 146, + "source_header": "hL g hg)\n\ntheorem torus_descend_proj (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (x : torus_E d) :\n torus_descend d L hL g hg (torus_proj d L hL" + }, + { + "kind": "theorem", + "unqualified_name": "torus_descend_continuous", + "line": 150, + "source_header": "x := rfl\n\ntheorem torus_descend_continuous (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (hgc : Continuous g) :\n Continuous (torus_descend d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_path_lift_from", + "line": 155, + "source_header": "hL g hg)\n\n/-- Lift from a prescribed representative; the endpoint is determined existentially. -/\ntheorem torus_path_lift_from (d : ℕ) (L : ℝ) (hL : 0 < L)\n {M : torus_E d} {y : torus_quotient d L hL}\n (γ : Path (torus_proj d L hL M) y) :\n ∃ z : torus_E d, ∃ Γ : Path M z,\n torus_proj d L hL z = y ∧\n ∀ t : unitInterval, torus_proj d L hL" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_constant_path_endpoint", + "line": 169, + "source_header": "γ.source) t\n\n/-- Control: a constant projected path cannot be lifted from M to a different lift.\nThis refutes replacing the existential endpoint by an arbitrary chosen representative. -/\ntheorem torus_control_constant_path_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)\n {M z : torus_E d} (Γ : Path M z)\n (hΓ : ∀ t : unitInterval, torus_proj d L hL (Γ t) = torus_proj d L" + }, + { + "kind": "theorem", + "unqualified_name": "torus_control_no_arbitrary_endpoint", + "line": 179, + "source_header": "ngrFun heq 1)\n\n/-- Combining the duplicate-image and uniqueness controls gives a direct rejection\nof any different preselected endpoint for a constant quotient path. -/\ntheorem torus_control_no_arbitrary_endpoint (d : ℕ) (L : ℝ) (hL : 0 < L)\n (M : torus_E d) (n : Fin d → ℤ) (hn : torus_latticeVec d L n ≠ 0) :\n torus_proj d L hL (M + torus_latticeVec d L n) = torus_proj d L hL M ∧\n ¬ ∃ Γ : Path M (M + torus_latticeVec d L n),\n ∀ t : unitInterval, torus_proj d L hL (Γ t) = toru" + }, + { + "kind": "theorem", + "unqualified_name": "torus_higher_path_iff", + "line": 192, + "source_header": "impa using heq)\n\n/-- Higher-endpoint compatibility for any scalar path predicate, including strict\nand closed thresholds. No conclusion here asserts critical-level attainment. -/\ntheorem torus_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (P : ℝ → Prop) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, P (g (γ t))) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, P (torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_strict_higher_path_iff", + "line": 216, + "source_header": "ht\n exact ht\n\ntheorem torus_strict_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, h < torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_closed_higher_path_iff", + "line": 225, + "source_header": "(fun a => h < a)\n\ntheorem torus_closed_higher_path_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) (h : ℝ) :\n (∃ y : torus_E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h ≤ g (γ t)) ↔\n (∃ y : torus_quotient d L hL,\n torus_descend d L hL g hg (torus_proj d L hL M) < torus_descend d L hL g hg y ∧\n ∃ γ : Path (torus_proj d L hL M) y,\n ∀ t : unitInterval, h ≤ torus_descend d" + }, + { + "kind": "theorem", + "unqualified_name": "torus_global_max_iff", + "line": 234, + "source_header": "(fun a => h ≤ a)\n\ntheorem torus_global_max_iff (d : ℕ) (L : ℝ) (hL : 0 < L)\n (g : torus_E d → ℝ) (hg : torus_isPeriodic d L g) (M : torus_E d) :\n (∀ y : torus_E d, g y ≤ g M) ↔\n ∀ y : torus_quotient d L hL,\n torus_descend d L hL g hg y ≤ torus_descend d L hL g hg (tor" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/OrdinaryH0.lean", + "sha256": "3d6b0d6b53413c484b1d010bccf0d53ae7f75becb2d747868f22dbd673fe0a88", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentFunctor", + "line": 44, + "source_header": "n\n\n/-- Proves: actual path-component quotients form a functor on topological spaces.\nMethod: use the existing continuous-map quotient map and its identity/composition laws.\nDoes not establish: equality of connected and path-connected components. -/\ndef ordinaryH0_componentFunctor : TopCat.{w} ⥤ Type w where\n ob" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentCoproductFunctor", + "line": 61, + "source_header": "C]\n\n/-- Proves: the component-indexed coproduct construction is a functor.\nMethod: compose the actual component functor with the categorical coproduct functor.\nDoes not establish: an identification with homology until naturality is proved below. -/\ndef ordinaryH0_componentCoproductFunctor (R : C) : TopCat.{w" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentCoproductMap_iota", + "line": 67, + "source_header": "obj R\n\n/-- Proves: a coproduct generator maps to the component of its continuous image.\nMethod: the universal coproduct map sends each inclusion to its indexed image.\nDoes not establish: that distinct source components stay distinct. -/\ntheorem ordinaryH0_componentCoproductMap_iota (R : C) {X Y : TopCat.{w}}\n (f : X ⟶ Y) (q : ZerothHomotopy X) :\n Sigma.ι (fun _ : ZerothHomotopy X => R) q ≫\n (ordinaryH0_componentCoproductFunctor R).map f =\n Sigma.ι (fun _ : ZerothHomotopy Y => R) (superlevel_componentMap f" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_componentFiltration", + "line": 77, + "source_header": "aConst]\n\n/-- Proves: the existing closed-superlevel family has a component-indexed coproduct filtration.\nMethod: compose its actual continuous inclusions with the proved component coproduct functor.\nDoes not establish: regularity, finite dimensionality, or Morse hypotheses for the height function. -/\ndef ordinaryH0_componentFiltration {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentFiltration_map_iota", + "line": 84, + "source_header": "Functor R\n\n/-- Proves: a filtration component generator maps by the existing actual component inclusion.\nMethod: specialize the coproduct generator map formula to a closed-superlevel inclusion.\nDoes not establish: a reverse inclusion or endpoint deletion. -/\ntheorem ordinaryH0_componentFiltration_map_iota {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t)\n (q : ZerothHomotopy (superlevel_set g s)) :\n Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g s) => R) q ≫\n (ordinaryH0_componentFiltration g R).map (homOfLE hst) =\n Sigma.ι (fun _ : ZerothHomotopy (superlevel_set g t) => R)\n (superlevel_componentInclusi" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_simplicialPointClass", + "line": 99, + "source_header": "Homology C]\n\n/-- Proves: a zero-simplex defines a morphism into actual simplicial homology.\nMethod: include its chain generator, lift through the zero differential, then take its class.\nDoes not establish: a replacement definition of homology or any naturality premise. -/\ndef ordinaryH0_simplicialPointClass (S : SSet.{w}) (R : C) (x : S _⦋0⦌) :\n R ⟶ S" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_simplicialPointClass_iso", + "line": 107, + "source_header": ").homologyπ 0\n\n/-- Proves: the existing simplicial H0 isomorphism sends a point class to its component.\nMethod: apply Mathlib's zero-cycle generator formula.\nDoes not establish: naturality merely from the existence of the objectwise isomorphism. -/\ntheorem ordinaryH0_simplicialPointClass_iso (S : SSet.{w}) (R : C)\n (x : S _⦋0⦌) :\n ordinaryH0_simplicialPointClass S R x ≫ (S.homology₀Iso R).hom =\n Sigma.ι (fun _ : S.π₀ => R)" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_simplicialPointClass_map", + "line": 117, + "source_header": "y₀Iso_hom S R x\n\n/-- Proves: the actual simplicial homology map carries a point class to its image class.\nMethod: homology projection naturality, cycle-lift naturality, and the chain generator formula.\nDoes not establish: a transported or postulated substitute for the actual homology map. -/\ntheorem ordinaryH0_simplicialPointClass_map (R : C) {S T : SSet.{w}}\n (f : S ⟶ T) (x : S _⦋0⦌) :\n ordinaryH0_simplicialPointClass S R x ≫ SSet.homologyMap f R 0 =\n ordinaryH0_simplicialPointClas" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_toSSet_pointMap", + "line": 128, + "source_header": "hainComplexMap_f]\n\n/-- Proves: the singular zero-simplex of a point maps to that of its continuous image.\nMethod: unfold the point/simplex correspondence and the singular-set map.\nDoes not establish: a chain or homology identification by itself. -/\ntheorem ordinaryH0_toSSet_pointMap {X Y : TopCat.{w}} (f : X ⟶ Y) (x : X) :\n (TopCat.toSSet.map f).app _ (TopCat.toSSetObj₀Equiv.symm x) =\n TopCat.toSSetO" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_pointClass", + "line": 136, + "source_header": "m (f x) := by\n rfl\n\n/-- Proves: each point has its actual ordinary singular zero-homology class morphism.\nMethod: use the actual singular zero-simplex and the cycle/projection construction above.\nDoes not establish: a free-module definition standing in for singular H0. -/\ndef ordinaryH0_pointClass (X : TopCat.{w}) (R : C) (x : X) :\n R ⟶ ((singularHomologyFunc" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_map", + "line": 144, + "source_header": "SSetObj₀Equiv.symm x)\n\n/-- Proves: actual continuous-map-induced singular H0 maps transport point classes.\nMethod: specialize the proved simplicial generator naturality to the singular-set functor.\nDoes not establish: injectivity of the induced map. -/\ntheorem ordinaryH0_pointClass_map (R : C) {X Y : TopCat.{w}}\n (f : X ⟶ Y) (x : X) :\n ordinaryH0_pointClass X R x ≫ ((singularHomologyFunctor C 0).obj R).map f =\n ordinary" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_iso", + "line": 158, + "source_header": "naryH0_toSSet_pointMap]\n\n/-- Proves: Mathlib's existing topological comparison sends actual point classes to components.\nMethod: combine the simplicial generator formula with the actual path-component equivalence.\nDoes not establish: any connected-component substitution. -/\ntheorem ordinaryH0_pointClass_iso (X : TopCat.{w}) (R : C) (x : X) :\n ordinaryH0_pointClass X R x ≫ (TopCat.singularHomology₀Iso X R).hom =\n Sigma.ι (fun _ : ZerothHomotopy X =>" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_componentIota_isoInv", + "line": 171, + "source_header": "_iso]\n simp [sigmaConst]\n\n/-- Proves: inverse comparison takes each component generator to any representing point class.\nMethod: cancel the comparison isomorphism and use the point-class formula.\nDoes not establish: a choice of distinguished geometric representative. -/\ntheorem ordinaryH0_componentIota_isoInv (X : TopCat.{w}) (R : C) (x : X) :\n Sigma.ι (fun _ : ZerothHomotopy X => R) (ZerothHomotopy.mk x) ≫\n (TopCat.singularHomology₀Iso X R).inv =" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_hom_ext", + "line": 180, + "source_header": "ordinaryH0_pointClass_iso]\n\n/-- Proves: morphisms out of actual singular H0 agree if they agree on all point classes.\nMethod: cancel the inverse comparison, use coproduct extensionality and quotient surjectivity.\nDoes not establish: a basis of geometric maxima or finiteness of components. -/\ntheorem ordinaryH0_hom_ext (X : TopCat.{w}) (R : C) {A : C}\n {f g : ((singularHomologyFunctor C 0).obj R).obj X ⟶ A}\n (h : ∀ x : X, ordinaryH0_pointClass X R x ≫ f = ordinaryH0_poin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_iso_naturality", + "line": 193, + "source_header": "mponentIota_isoInv] using h x\n\n/-- Proves: the existing actual singular H0 comparison commutes with every continuous map.\nMethod: test both composites on actual point classes, transport them, and compare component images.\nDoes not establish: naturality by adding an assumption or a compatibility record. -/\ntheorem ordinaryH0_iso_naturality (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) :\n ((singularHomologyFunctor C 0).obj R).map f ≫\n (TopCat.singularHomology₀Iso Y R).hom =\n (TopCat.singularHomology₀Iso X R).hom ≫\n (ordinaryH0_com" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_naturalIso", + "line": 209, + "source_header": "mponentCoproductMap_iota]\n rfl\n\n/-- Proves: actual ordinary singular H0 is naturally isomorphic to component-indexed coproducts.\nMethod: assemble the existing objectwise isomorphisms using the commuting square proved above.\nDoes not establish: an interval decomposition or persistence-bar classification. -/\ndef ordinaryH0_naturalIso (R : C) :\n (singularHomologyFunctor C 0).obj R ≅ ordin" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_augmentation", + "line": 217, + "source_header": "=> ordinaryH0_iso_naturality R f)\n\n/-- Proves: ordinary augmentation sends every actual point-class morphism to the coefficient identity.\nMethod: use the comparison's augmentation formula and the coproduct universal property.\nDoes not establish: reduced-H0 vanishing; this retains the ordinary point class. -/\ntheorem ordinaryH0_pointClass_augmentation (X : TopCat.{w}) (R : C) (x : X) :\n ordinaryH0_pointClass X R x ≫" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_ne_zero", + "line": 226, + "source_header": "ordinaryH0_pointClass_iso]\n simp\n\n/-- Proves: an actual point class is nonzero for a coefficient object with nonzero identity.\nMethod: compose a proposed zero class with ordinary augmentation.\nDoes not establish: nonzero classes for a zero coefficient object. -/\ntheorem ordinaryH0_pointClass_ne_zero (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x :" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_eq_of_component_eq", + "line": 236, + "source_header": ", zero_comp] at hε\n exact hR hε.symm\n\n/-- Proves: points in the same actual path component give equal ordinary H0 class morphisms.\nMethod: cancel the objectwise comparison and compare their component indices.\nDoes not establish: a converse for zero coefficients. -/\ntheorem ordinaryH0_pointClass_eq_of_component_eq (X : TopCat.{w}) (R : C)\n (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :\n ordinaryH0_pointCl" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_sameComponent_difference_zero", + "line": 245, + "source_header": "lass_iso, ordinaryH0_pointClass_iso, h]\n\n/-- Proves: the difference of same-component point classes is zero for arbitrary coefficients.\nMethod: subtract the equality proved from actual path-component equality.\nDoes not establish: that either individual point class dies. -/\ntheorem ordinaryH0_sameComponent_difference_zero (X : TopCat.{w}) (R : C)\n (x y : X) (h : ZerothHomotopy.mk x = ZerothHomotopy.mk y) :\n ordinaryH0_pointClas" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_ne_of_component_ne", + "line": 253, + "source_header": "s_eq_of_component_eq X R x y h, sub_self]\n\n/-- Proves: distinct actual path components have distinct ordinary H0 class morphisms if coefficients are nonzero.\nMethod: separate the two coproduct injections by an identity/zero component projection.\nDoes not establish: distinction with zero coefficients or distinction of points within one component. -/\ntheorem ordinaryH0_pointClass_ne_of_component_ne (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X)\n (hxy : ZerothHomotopy.mk x ≠ ZerothHomotopy.mk y) :\n ordinaryH0_poi" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_pointClass_eq_iff", + "line": 271, + "source_header": "ymm hxy] using congrArg (fun k => k ≫ p) hc\n\n/-- Proves: with nonzero coefficients, actual point-class equality is exactly path-component equality.\nMethod: combine the same-component formula with the separating projection control.\nDoes not establish: equality of geometric points or connected components. -/\ntheorem ordinaryH0_pointClass_eq_iff (X : TopCat.{w}) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) (x y : X) :\n ordinaryH0_pointClass X R x = ordinaryH0_pointClass X R y ↔" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_difference_map", + "line": 284, + "source_header": "inaryH0_pointClass_eq_of_component_eq X R x y\n\n/-- Proves: the actual H0 map sends a difference of point classes to the difference of image classes.\nMethod: distribute composition over subtraction and use proved actual point-class transport.\nDoes not establish: death of the individual ordinary point classes. -/\ntheorem ordinaryH0_difference_map (R : C) {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫\n ((singularHomologyFunctor C 0).obj R).map f =\n ordinaryH0_pointCl" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_difference_map_eq_zero_iff", + "line": 293, + "source_header": "ryH0_pointClass_map, ordinaryH0_pointClass_map]\n\n/-- Proves: with nonzero coefficients, a mapped difference vanishes exactly when the image points merge in path components.\nMethod: actual homology-map transport, subtraction cancellation, and the component equality criterion.\nDoes not establish: a Morse merger event, elder selection, death height, or barcode. -/\ntheorem ordinaryH0_difference_map_eq_zero_iff (R : C) (hR : (𝟙 R : R ⟶ R) ≠ 0)\n {X Y : TopCat.{w}} (f : X ⟶ Y) (x y : X) :\n (ordinaryH0_pointClass X R x - ordinaryH0_pointClass X R y) ≫\n ((singularHomologyFunctor C 0).obj R).map f = 0 ↔" + }, + { + "kind": "def", + "unqualified_name": "ordinaryH0_filtrationIso", + "line": 303, + "source_header": "sub_eq_zero, ordinaryH0_pointClass_eq_iff Y R hR]\n\n/-- Proves: the existing actual singular H0 filtration is naturally isomorphic to its component coproduct filtration.\nMethod: restrict the proved natural comparison along the existing topological filtration.\nDoes not establish: the later interval, elder, maximum/saddle, count, Field, or stochastic bridges. -/\ndef ordinaryH0_filtrationIso {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) :\n superlevel_h0" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_filtration_naturality", + "line": 311, + "source_header": "(superlevel_filtration g) (ordinaryH0_naturalIso R)\n\n/-- Proves: all ordered closed-superlevel inclusion maps satisfy the actual H0/component square.\nMethod: read the naturality of the proved filtration isomorphism at the preorder morphism.\nDoes not establish: strict-level conventions or any unproved geometric persistence hypothesis. -/\ntheorem ordinaryH0_filtration_naturality {X : Type w} [TopologicalSpace X]\n (g : X → ℝ) (R : C) {s t : ℝ} (hst : s ≤ t) :\n (superlevel_h0Filtration g R).map (homOfLE hst) ≫\n (ordinaryH0_filtrationIso g R).hom.app t =\n (ordinaryH0_filtrationIso g R).hom.app s ≫\n (" + }, + { + "kind": "theorem", + "unqualified_name": "ordinaryH0_filtration_difference_zero_iff_joinedIn", + "line": 322, + "source_header": "aryH0_filtrationIso g R).hom.naturality (homOfLE hst)\n\n/-- Proves: under a closed-superlevel inclusion, a difference vanishes exactly when the two included points are joined in the target closed superlevel.\nMethod: apply the actual H0 difference control and the existing component/JoinedIn equivalence.\nDoes not establish: attainment of a critical death threshold or an elder/barcode theorem. -/\ntheorem ordinaryH0_filtration_difference_zero_iff_joinedIn\n {X : Type w} [TopologicalSpace X] (g : X → ℝ) (R : C)\n (hR : (𝟙 R : R ⟶ R) ≠ 0) {s t : ℝ} (hst : s ≤ t)\n (x y : superlevel_set g s) :\n (ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R x -\n ordinaryH0_pointClass (TopCat.of (superlevel_set g s)) R y) ≫\n (superlevel_h0Filtration g R).map (homOfLE hst" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBarField.lean", + "sha256": "8a2470431c3fda5e98859aa9372cbb8866ed5c5c722cea5dfc28cb577840bbad", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_continuous", + "line": 49, + "source_header": "n\n\n/-- Proves: a smooth height in the Field sense is continuous.\nMethod: the `n = 0` instance of `IsSmooth` and `ContDiff.continuous`.\nDoes not establish: any regularity beyond continuity. -/\ntheorem superlevelBarField_continuous {d : ℕ} {g : E d → ℝ} (hg : IsSmooth d g) :\n Continuou" + }, + { + "kind": "def", + "unqualified_name": "superlevelBarField_interface", + "line": 56, + "source_header": "ous\n\n/-- Proves: the C263 data inhabit the Field interface for every dimension and period.\nMethod: death height and essentiality are the C263 definitions, the maximin clause is\n`superlevelBar_strict_cut`, and the elder relation is the right-hand side of its clause.\nDoes not establish: a persistence-module elder rule; `elderPartner_iff` holds by\ndefinition, and periodicity and `L` are not used. -/\ndef superlevelBarField_interface (d : ℕ) (L : ℝ) : SuperlevelBarInterface d L where\n deathH" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_nonempty", + "line": 72, + "source_header": "f.rfl\n\n/-- Proves: the Field superlevel-bar interface is inhabited for every `d` and `L`.\nMethod: the record above. Does not establish: that any inhabitant is the source's\nsuperlevel H0 object. -/\ntheorem superlevelBarField_nonempty (d : ℕ) (L : ℝ) :\n Nonempty (SuperlevelBarInterfa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_deathHeight_eq", + "line": 79, + "source_header": "ce d L⟩\n\n/-- Proves: the death height of the record is the C263 death height.\nMethod: `rfl`. Does not establish: a finite death for an essential point. -/\ntheorem superlevelBarField_deathHeight_eq {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :\n (superlevelBarField_interface d L).deathHeight g M = superlevelBar_deathH" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_isEssential_iff", + "line": 85, + "source_header": ":=\n rfl\n\n/-- Proves: essentiality in the record is global maximality.\nMethod: `Iff.rfl`. Does not establish: agreement with a persistence essential class. -/\ntheorem superlevelBarField_isEssential_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M : E d) :\n (superlevelBarField_interface d L).IsEssential g M ↔ ∀ y" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_elderPartner_iff", + "line": 91, + "source_header": "=\n Iff.rfl\n\n/-- Proves: the elder relation of the record is, for every height, the right-hand side\nof the interface clause. Method: `Iff.rfl`, since it is defined that way.\nDoes not establish: that this relation is ordinary elder death in any persistence sense. -/\ntheorem superlevelBarField_elderPartner_iff {d : ℕ} {L : ℝ} (g : E d → ℝ) (M S : E d) :\n (superlevelBarField_interface d L).ElderPartner g M S ↔\n (IsNondegMax d g M ∧ IsIndexSaddle d g S ∧ ¬ superlevelBar_isEssential g M ∧\n superlevelBar_deathHeig" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_essential_unique", + "line": 100, + "source_header": ":=\n Iff.rfl\n\n/-- Proves: on smooth periodic heights every inhabitant's essentiality is global maximality.\nMethod: its own `essential_iff` clause. Does not establish: anything off that locus. -/\ntheorem superlevelBarField_essential_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d) :\n I.IsEssential g M ↔ superlevelBar_" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_deathHeight_unique", + "line": 107, + "source_header": "l_iff g hs hp M\n\n/-- Proves: on smooth periodic heights every inhabitant's death height at a nonessential\npoint is the C263 death height. Method: its maximin clause is a strict cut for the\nclearance set, and `superlevelBar_cut_unique` leaves one such number.\nDoes not establish: agreement at essential points (see the control below). -/\ntheorem superlevelBarField_deathHeight_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (M : E d)\n (hM : ¬ I.IsEssential g M) :\n I.deathHeight g M = superlevelBa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_elderPartner_unique", + "line": 120, + "source_header": "n g hs hp M hM h)\n\n/-- Proves: on the Morse distinct-value locus of smooth periodic heights every inhabitant's\nelder relation is the record's. Method: both are their clause's right-hand side, whose\nessentiality and death-height terms agree by the two uniqueness theorems above.\nDoes not establish: agreement off the Morse distinct-value locus, where the interface\nconstrains no elder relation. -/\ntheorem superlevelBarField_elderPartner_unique {d : ℕ} {L : ℝ} (I : SuperlevelBarInterface d L)\n (g : E d → ℝ) (hs : IsSmooth d g) (hp : IsLPeriodic d L g) (hm : IsMorseDistinct d L g)\n (M S : E d) :\n I.ElderPartner g M S ↔ (superlevelBarField_interface d L)" + }, + { + "kind": "def", + "unqualified_name": "superlevelBarField_shift", + "line": 139, + "source_header": "hne').trans hdeath⟩\n\n/-- Proves: a second record, equal to the first except that its death height is the\nconstant `c` at essential points, also inhabits the interface. Method: off the essential\npoints it is the C263 death height, so the same strict cut applies; its elder relation is\nagain its clause's right-hand side. Does not establish: any preferred value at essential\npoints. -/\ndef superlevelBarField_shift (d : ℕ) (L c : ℝ) : SuperlevelBarInterface d" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_shift_deathHeight_const", + "line": 160, + "source_header": "_ _ _ _ _ => Iff.rfl\n\n/-- Proves: at a constant height the shifted record's death height is `c`.\nMethod: every point of a constant height is essential. Does not establish: a finite bar\nfor a constant height. -/\ntheorem superlevelBarField_shift_deathHeight_const (d : ℕ) (L c b : ℝ) (M : E d) :\n (superlevelBarField_shift d L c).deathHe" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_const_smooth", + "line": 171, + "source_header": "l\n rw [ite_eq_left hM]\n\n/-- Proves: constant heights are smooth. Method: `contDiff_const`.\nDoes not establish: anything about nonconstant heights. -/\ntheorem superlevelBarField_const_smooth (d : ℕ) (b : ℝ) : IsSm" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_const_periodic", + "line": 176, + "source_header": "fun _ => contDiff_const\n\n/-- Proves: constant heights are `L`-periodic. Method: both sides are the constant.\nDoes not establish: anything about the lattice. -/\ntheorem superlevelBarField_const_periodic (d : ℕ) (L b : ℝ) :\n IsLPeri" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBarField_control_essential_free", + "line": 182, + "source_header": "d => b) :=\n fun _ _ => rfl\n\n/-- Proves: the nonessential hypothesis of `superlevelBarField_deathHeight_unique` cannot\nbe dropped: at the smooth periodic constant height `0` every point is essential for both\nrecords, the record's death height there is `0`, its shift by `1` has death height `1`,\nand the two differ. Method: `superlevelBar_death_const` and the shifted value.\nDoes not establish: anything about nonessential points, where all inhabitants agree. -/\ntheorem superlevelBarField_control_essential_free (d : ℕ) (L : ℝ) (M : E d) :\n IsSmooth d (fun _ : E d => (0 : ℝ)) ∧ IsLPeriodic d L (fun _ : E d => (0 : ℝ)) ∧\n (superlevelBarField_interface d L).IsEssential (fun _ => (0 : ℝ)) M ∧\n (superlevelBarField_shift d L 1).IsEssential (fun _ => (0 : ℝ)) M ∧\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M = 0 ∧\n (superlevelBarField_shift d L 1).deathHeight (fun _ => (0 : ℝ)) M = 1 ∧\n (superlevelBarField_interface d L).deathHeight (fun _ => (0 : ℝ)) M ≠\n (superlevelBarField_shift d L 1).dea" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/companions/torus_filtration_20261011/SuperlevelBar.lean", + "sha256": "346eea948e18d5904422904006827930e27d3141ccbc19ee8ac2c24bcf65a4a9", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "superlevelBar_E", + "line": 38, + "source_header": "n\n\n/-- Proves: the ambient type is real Euclidean space in the stated dimension.\nMethod: a type abbreviation. Does not establish: a positive-dimensional or\nperiodic quotient-space hypothesis. -/\nabbrev superlevelBar_E (d :" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_isEssential", + "line": 43, + "source_header": "d)\n\n/-- Proves: the essentiality datum is total. Method: global order comparison.\nDoes not establish: an actual persistence interpretation off the guarded locus. -/\ndef superlevelBar_isEssential {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) :" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_clearanceSet", + "line": 49, + "source_header": "≤ g M\n\n/-- Proves: a total strict-clearance set with the source's existential endpoint.\nMethod: quantify over actual paths and every parameter, including endpoints.\nDoes not establish: a path attaining the supremum with closed inequalities. -/\ndef superlevelBar_clearanceSet {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d)" + }, + { + "kind": "def", + "unqualified_name": "superlevelBar_deathHeight", + "line": 56, + "source_header": "(γ t)}\n\n/-- Proves: the death datum is a total real number with explicit empty default.\nMethod: nonempty conditional supremum; boundedness is proved below.\nDoes not establish: a finite death for an essential class. -/\ndef superlevelBar_deathHeight {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_essential_iff", + "line": 65, + "source_header": "M) else 0\n\n/-- Proves: essentiality is exactly global maximality for these total data.\nMethod: unfold the defining proposition. Does not establish: agreement with\nan independently defined essential persistence class. -/\ntheorem superlevelBar_essential_iff {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) :\n superlevelBar_isEssential g M ↔ ∀ y" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_mem_lt_start", + "line": 72, + "source_header": ":= Iff.rfl\n\n/-- Proves: an unconditional strict bound on each clearance member.\nMethod: evaluate its path at zero. Does not establish: an unconditional bound\non the default death value when the clearance set is empty. -/\ntheorem superlevelBar_mem_lt_start {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) {h : ℝ} (hh : h ∈ superlevelBar_clearanceSet g M)" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_bddAbove", + "line": 82, + "source_header": "] using hzero\n\n/-- Proves: the clearance set is bounded above, including when empty.\nMethod: the initial height bounds each member. Does not establish: that the\nempty-set default death value obeys the same bound. -/\ntheorem superlevelBar_clearance_bddAbove {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) : BddAbove (superlevelBar_cl" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_empty_of_essential", + "line": 89, + "source_header": "art g M hh).le⟩\n\n/-- Proves: essentiality forces the clearance set to be empty.\nMethod: contradict the required strictly higher endpoint.\nDoes not establish: a converse for arbitrary discontinuous heights. -/\ntheorem superlevelBar_clearance_empty_of_essential {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hM : superlevelBar_isEssential g M) : superlevelBar_cle" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_zero_of_empty", + "line": 102, + "source_header": "act False.elim hh\n\n/-- Proves: an empty clearance set selects the declared real value zero.\nMethod: simplify the conditional definition. Does not establish: a geometric\ndeath event or finite persistence interval at that zero. -/\ntheorem superlevelBar_death_eq_zero_of_empty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (he : superlevelBar_clearanceSet g M = ∅) : superlevelBar_" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_zero_of_essential", + "line": 111, + "source_header": "ar_deathHeight, he]\n\n/-- Proves: essential inputs have the declared zero default.\nMethod: essentiality implies empty clearance, then use the empty branch.\nDoes not establish: an essential-bar death height. -/\ntheorem superlevelBar_death_eq_zero_of_essential {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hM : superlevelBar_isEssential g M) : superlevelBa" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_eq_sSup_of_nonempty", + "line": 120, + "source_header": "_of_essential g M hM)\n\n/-- Proves: nonempty clearance selects its real supremum in the total data.\nMethod: simplify the nonempty conditional branch. Does not establish:\nnonemptiness without a witness or a regularity hypothesis. -/\ntheorem superlevelBar_death_eq_sSup_of_nonempty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hne : (superlevelBar_clearanceSet g M).Nonempty) :\n superlevelBar_deathHeight g M = sSup (superlev" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_path_minimum", + "line": 130, + "source_header": "eight, ite_eq_left hne]\n\n/-- Proves: a continuous height attains a minimum along each actual path.\nMethod: compact unit interval and the extreme-value theorem.\nDoes not establish: a minimum over all paths or an optimal path. -/\ntheorem superlevelBar_path_minimum {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) {M y : superlevelBar_E d} (γ : Path M y) :\n ∃ t₀ : unitInterval, ∀ t : unitInt" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_nonempty", + "line": 142, + "source_header": "=> hmin (Set.mem_univ t)⟩\n\n/-- Proves: nonessential continuous inputs have a nonempty clearance set.\nMethod: a higher endpoint, Path.segment, and minimum minus one.\nDoes not establish: compactness of the whole Euclidean domain. -/\ntheorem superlevelBar_clearance_nonempty {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n (superlevelBar" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_nonempty_iff", + "line": 163, + "source_header": "ave ht := hmin t\n linarith\n\n/-- Proves: for continuous heights, clearance is nonempty exactly off the\nessential locus. Method: the higher witness endpoint and the straight-path\nconstruction. Does not establish: this equivalence without continuity. -/\ntheorem superlevelBar_clearance_nonempty_iff {d : ℕ}\n (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d) :\n (superlevelBar_clearanceSet g M).Nonempty ↔ ¬" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_downward", + "line": 174, + "source_header": "Bar_clearance_nonempty g hg M\n\n/-- Proves: any smaller threshold than an existing clearance is a clearance.\nMethod: reuse the same endpoint and path and compose strict inequalities.\nDoes not establish: strict improvement to a larger threshold. -/\ntheorem superlevelBar_clearance_downward {d : ℕ} (g : superlevelBar_E d → ℝ)\n (M : superlevelBar_E d) {h c : ℝ} (hhc : h < c)\n (hc : c ∈ superlevelBar_clearanceSet g M) : h ∈" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_improve", + "line": 183, + "source_header": ", γ, fun t => hhc.trans (hγ t)⟩\n\n/-- Proves: each strict witness has a larger strict witness on its same path.\nMethod: attained minimum and a midpoint below it.\nDoes not establish: a witness with clearance strictly above the supremum. -/\ntheorem superlevelBar_clearance_improve {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d) {h : ℝ}\n (hh : h ∈ superlevelBar_clearanceSet g M) :\n ∃ c : ℝ, h < c ∧ c" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_strict_cut", + "line": 199, + "source_header": "have ht := hmin t\n linarith\n\n/-- Proves: the exact strict cut for continuous nonessential inputs.\nMethod: least-upper-bound property, downward closure and strict improvement.\nDoes not establish: closed-threshold attainment at the death height. -/\ntheorem superlevelBar_strict_cut {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) (h : ℝ) :\n h < superlevelBar_deathHeight g M ↔" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_le_start_of_nonempty", + "line": 223, + "source_header": "evelBar_clearance_bddAbove g M) hc)\n\n/-- Proves: the death value is at most the initial height when clearance is\nnonempty. Method: the supremum is at most this upper bound.\nDoes not establish: the bound on the empty default branch. -/\ntheorem superlevelBar_death_le_start_of_nonempty {d : ℕ}\n (g : superlevelBar_E d → ℝ) (M : superlevelBar_E d)\n (hne : (superlevelBar_clearanceSet g M).Nonempty) :" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_le_start", + "line": 233, + "source_header": "uperlevelBar_mem_lt_start g M hh).le)\n\n/-- Proves: the death upper bound for continuous nonessential inputs.\nMethod: establish nonempty clearance and apply its guarded supremum bound.\nDoes not establish: a strict inequality or an attained optimal path. -/\ntheorem superlevelBar_death_le_start {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_clearance_eq_Iio", + "line": 242, + "source_header": "rlevelBar_clearance_nonempty g hg M hM)\n\n/-- Proves: the clearance set is the open lower interval below death on the\ncontinuous nonessential locus. Method: extensionality and the strict cut.\nDoes not establish: a closed-threshold path at the excluded endpoint. -/\ntheorem superlevelBar_clearance_eq_Iio {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n superlevelBar_clearanceSet g M" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_not_mem_clearance", + "line": 252, + "source_header": "uperlevelBar_strict_cut g hg M hM h).symm\n\n/-- Proves: death is not a strict clearance for continuous nonessential inputs.\nMethod: the cut would otherwise imply that death is strictly below itself.\nDoes not establish: failure or success of closed-threshold attainment. -/\ntheorem superlevelBar_death_not_mem_clearance {d : ℕ}\n (g : superlevelBar_E d → ℝ) (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) :\n superlevelBar_death" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_cut_unique", + "line": 263, + "source_header": "Height g M)).2 hh\n exact (lt_irrefl _) hlt\n\n/-- Proves: uniqueness of a real number with this strict cut on the valid locus.\nMethod: evaluate either cut at the competing endpoint.\nDoes not establish: equality of arbitrary total interface records off that locus. -/\ntheorem superlevelBar_cut_unique {d : ℕ} (g : superlevelBar_E d → ℝ)\n (hg : Continuous g) (M : superlevelBar_E d)\n (hM : ¬ superlevelBar_isEssential g M) (a : ℝ)\n (ha : ∀ h : ℝ, h < a ↔ h ∈ superlevelBar_clearanceSet" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_death_const", + "line": 280, + "source_header": ").1 hlt\n exact (lt_irrefl a) ((ha a).2 hc)\n\n/-- Proves: any constant height selects the zero default at every point.\nMethod: every point is globally maximal, hence essential in these data.\nDoes not establish: any finite ordinary bar for that constant height. -/\ntheorem superlevelBar_death_const (d : ℕ) (b : ℝ) (M : superlevelBar_E d) :\n superlevelBar_dea" + }, + { + "kind": "theorem", + "unqualified_name": "superlevelBar_control_negative_essential", + "line": 289, + "source_header": "h_eq_zero_of_essential\n intro y\n exact le_rfl\n\n/-- Proves: the essential default forbids an unconditional death/start bound.\nMethod: constant height minus one has empty clearance and death zero.\nDoes not establish: any finite ordinary bar on a constant field. -/\ntheorem superlevelBar_control_negative_essential (d : ℕ) (M : superlevelBar_E d) :\n superlevelBar_deathHeight (fun _ : superlevelBar_E d => (-1 : ℝ)) M = 0 ∧\n ¬ superlevelBar_deathHeight (fu" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/specifications/lean_statements_20261010/Specifications/Field.lean", + "sha256": "f22c91e082cd7e738ba47c9c3534e47ac687d066f0b78586d15103cf1132535e", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 40, + "source_header": "y\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) : T" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 49, + "source_header": "d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 58, + "source_header": ": ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 69, + "source_header": "2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 81, + "source_header": "Sum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 92, + "source_header": "(x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g : E" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 101, + "source_header": "d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g :" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 110, + "source_header": "ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 152, + "source_header": "∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian (d" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 162, + "source_header": "ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoint" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 171, + "source_header": "(x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d :" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 187, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNonde" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 197, + "source_header": "icalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsIndex" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 207, + "source_header": "Point d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnoncomp" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 216, + "source_header": "ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 225, + "source_header": "(d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module." + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 255, + "source_header": "ap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsCan" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 274, + "source_header": "ndegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the source)" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 287, + "source_header": "sCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNondeg" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 323, + "source_header": "ax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d :" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 335, + "source_header": ":=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pair" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 346, + "source_header": "Domain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d : ℕ" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 357, + "source_header": "d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gauss" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderInterval.lean", + "sha256": "3dab19342c307f6b70f4fa05ac913b4ead083742a56408db71b45276c0acb9ab", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "elderActive", + "line": 19, + "source_header": "u\n\n/-- Increasing parameter `t=-height`: closed birth and open death. -/\ndef elderActive (m d t : ℝ) : P" + }, + { + "kind": "def", + "unqualified_name": "elderFiber", + "line": 24, + "source_header": "k]\n\n/-- The fiber is k on the interval and the zero submodule elsewhere. -/\ndef elderFiber (m d t : ℝ) : Submodule k k where\n ca" + }, + { + "kind": "theorem", + "unqualified_name": "elderFiber_eq_zero", + "line": 31, + "source_header": "hb h]\n\ntheorem elderFiber_eq_zero {m d t : ℝ} (ht : ¬ elderActive m d t)\n (x : elderFiber k m d t) :" + }, + { + "kind": "def", + "unqualified_name": "elderFiberMap", + "line": 36, + "source_header": "ty ht\n\ndef elderFiberMap (m d : ℝ) {s t : ℝ} (hst : s ≤ t) :\n elderFiber k m d s →ₗ[k] elderFiber k m d t where\n to" + }, + { + "kind": "def", + "unqualified_name": "elderInterval", + "line": 53, + "source_header": "= rfl\n\n/-- The actual interval persistence functor; no maps are assumed. -/\ndef elderInterval (m d : ℝ) : ℝ ⥤ ModuleCat k where" + }, + { + "kind": "def", + "unqualified_name": "elderFiberLift", + "line": 79, + "source_header": "mp [ht]\n\n/-- A canonical lift of a coefficient to any active interval fiber. -/\ndef elderFiberLift {m d t : ℝ} (ht : elderActive m d t) :\n k →ₗ[k] elderFiber k m d t where" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_birth", + "line": 89, + "source_header": "a := rfl\n\n/-- Endpoint control: birth is included. -/\ntheorem elder_control_birth {m d : ℝ} (hdm : d < m) : elderActi" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_death", + "line": 93, + "source_header": ";> linarith\n\n/-- Endpoint control: death is excluded, despite closed superlevels. -/\ntheorem elder_control_death (m d : ℝ) : ¬ elderAc" + }, + { + "kind": "structure", + "unqualified_name": "ElderTrap", + "line": 100, + "source_header": "X) (m d : ℝ)\n\n/-- The topological consequences of the asymmetric ridge trap. No H0 maps or\nsplitting conclusions occur among the premises. The path at d is actual closed\nsuperlevel connectivity, while active cuts are clopen. -/\nstructure ElderTrap (D : Set X) : Prop where\n death_lt_birth : d < m\n maximum_height : g M = m\n older_height : m < g P\n maximum_inside : M ∈ D\n older_outside : P ∉ D\n height_ceiling : ∀ x ∈ D, g x ≤ m\n active_clopen : ∀ t, elderActive m d t →\n IsClopen {x : superlevel_set g t | x.val ∈ D}\n closed_path : JoinedIn (superlevel" + }, + { + "kind": "theorem", + "unqualified_name": "ElderTrap.maximum_mem", + "line": 116, + "source_header": "d} {D : Set X}\n\ntheorem ElderTrap.maximum_mem (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : M ∈ sup" + }, + { + "kind": "theorem", + "unqualified_name": "ElderTrap.older_mem", + "line": 122, + "source_header": "linarith [ht.1]\n\ntheorem ElderTrap.older_mem (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : P ∈ sup" + }, + { + "kind": "theorem", + "unqualified_name": "elder_clopen_path_iff", + "line": 127, + "source_header": "T.older_height]\n\n/-- Clopen cuts are constant on actual path components, with no local path\nconnectivity assumption on the ambient space. -/\ntheorem elder_clopen_path_iff {Y : Type u} [TopologicalSpace Y] {U : Set Y}\n (hU : IsClopen U) {x y : Y} (p : Path x y" + }, + { + "kind": "def", + "unqualified_name": "ElderTrap.componentInside", + "line": 138, + "source_header": "nt_subset hy hyx⟩\n\n/-- The D indicator is genuinely descended to the path-component quotient. -/\ndef ElderTrap.componentInside (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) : ZerothHomotopy (superle" + }, + { + "kind": "def", + "unqualified_name": "elderDifference", + "line": 150, + "source_header": "f.rfl\n\nvariable {k}\n\n/-- The actual singular-H0 point-class difference on an active level. -/\ndef elderDifference (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :\n ModuleCat.of k k ⟶ (superlevel_h0Filtration g (Mod" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_map", + "line": 159, + "source_header": "⟨P, T.older_mem ht⟩\n\ntheorem elderDifference_map (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_map_dead", + "line": 168, + "source_header": "⟩ ⟨P, T.older_mem hs⟩\n\ntheorem elderDifference_map_dead (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : -d ≤ t) (hst : s ≤ t) :" + }, + { + "kind": "def", + "unqualified_name": "elderProjection", + "line": 178, + "source_header": "superlevel_mono g ht)\n\n/-- The component indicator transported by the existing actual H0 comparison. -/\ndef elderProjection (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).o" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_point", + "line": 186, + "source_header": "e ht q then 𝟙 _ else 0)\n\ntheorem elderProjection_point (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) (x : superlevel_set g t) :\n ordinaryH0_pointClass (TopCat.of (superlevel_set g t)) (ModuleCat.of k k) x ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderDifference_projection", + "line": 198, + "source_header": "igma.ι_comp_desc]\n rfl\n\ntheorem elderDifference_projection (T : ElderTrap g M P m d D) {t : ℝ}\n (ht : elderActive m d t) :" + }, + { + "kind": "def", + "unqualified_name": "elderSectionApp", + "line": 207, + "source_header": "nside, T.older_outside]\n\ndef elderSectionApp (T : ElderTrap g M P m d D) (t : ℝ) :\n (elderInterval k m d).obj t ⟶\n (superlevel_h0Filtration g (M" + }, + { + "kind": "def", + "unqualified_name": "elderRetractionApp", + "line": 214, + "source_header": "rDifference T ht else 0\n\ndef elderRetractionApp (T : ElderTrap g M P m d D) (t : ℝ) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).obj t ⟶\n (eld" + }, + { + "kind": "theorem", + "unqualified_name": "elderSectionApp_naturality", + "line": 221, + "source_header": "rFiberLift k ht) else 0\n\ntheorem elderSectionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}\n (hst : s ≤ t) :\n (elderInterval k m d).map (homOfLE hst) ≫ elderSectionApp T t =\n elderSectionApp T s ≫\n (superlevel_h0Filtration g (ModuleCat.of" + }, + { + "kind": "def", + "unqualified_name": "elderSection", + "line": 246, + "source_header": "ro k hs x\n simp [hx]\n\n/-- Section from the interval to actual singular H0. -/\ndef elderSection (T : ElderTrap g M P m d D) :\n elderInterval k m d ⟶ superlevel_h0Filtration g (Modu" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_naturality_active", + "line": 254, + "source_header": "_naturality T (leOfHom f)\n\ntheorem elderProjection_naturality_active (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : elderActive m d s) (ht : elderActive m d t) (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderProjection_prebirth", + "line": 266, + "source_header": "erProjection_point]\n rfl\n\n/-- The birth-crossing square follows from the geometric height ceiling:\nthere is no source point in D above m. It is not an assumed naturality field. -/\ntheorem elderProjection_prebirth (T : ElderTrap g M P m d D) {s t : ℝ}\n (hs : s < -m) (ht : elderActive m d t) (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫" + }, + { + "kind": "theorem", + "unqualified_name": "elderRetractionApp_naturality", + "line": 287, + "source_header": "right hx]\n erw [comp_zero]\n\ntheorem elderRetractionApp_naturality (T : ElderTrap g M P m d D) {s t : ℝ}\n (hst : s ≤ t) :\n (superlevel_h0Filtration g (ModuleCat.of k k)).map (homOfLE hst) ≫\n elderRetractionApp T t =\n elderRetractionApp T s ≫ (elderInterv" + }, + { + "kind": "def", + "unqualified_name": "elderRetraction", + "line": 328, + "source_header": "simp [htd]\n · simp [hs]\n\n/-- Retraction from actual singular H0 to the interval, using component descent. -/\ndef elderRetraction (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k k) ⟶ el" + }, + { + "kind": "theorem", + "unqualified_name": "elderSection_retraction", + "line": 339, + "source_header": "r. -/\n@[reassoc (attr := simp)]\ntheorem elderSection_retraction (T : ElderTrap g M" + }, + { + "kind": "def", + "unqualified_name": "elderKernelProjection", + "line": 354, + "source_header": "er_eq_zero k ht x\n simp [hx]\n\ndef elderKernelProjection (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k" + }, + { + "kind": "def", + "unqualified_name": "elderDirectSummand", + "line": 361, + "source_header": "n, Category.comp_id, sub_self])\n\n/-- An actual natural direct-sum isomorphism, not a postulated decomposition.\nIts maps are v ↦ (qv,v-jqv) and (c,w) ↦ jc+w. -/\ndef elderDirectSummand (T : ElderTrap g M P m d D) :\n superlevel_h0Filtration g (ModuleCat.of k k) ≅\n elderInterval k" + }, + { + "kind": "theorem", + "unqualified_name": "elder_control_ordinary_point_survives", + "line": 381, + "source_header": "gory.assoc, Preadditive.comp_sub]\n\n/-- Ordinary individual point classes remain nonzero; the dying section uses\ntheir difference. This is valid independently of characteristic. -/\ntheorem elder_control_ordinary_point_survives (t : ℝ) (x : superlevel_set g t) :\n ordinaryH0_pointClass (TopCat.of (superlevel" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderBridge.lean", + "sha256": "6b0be1116f6b357b0ffbda202c572c27c2788b98bee639e228375a5ebeea1fa9", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "elderTrap_closedTrace_isClopen", + "line": 15, + "source_header": "u\n\n/-- Every active closed level includes continuously into the strict level\nabove d. Pulling back the proved strict separation gives closed-level separation. -/\ntheorem elderTrap_closedTrace_isClopen {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d t : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d)) (ht : t < -d) :\n IsClopen {x : superlevel_set g t | x.val ∈" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_of_boundary", + "line": 27, + "source_header": "hi\n\n/-- Actual geometric boundary, ceiling and closed path data inhabit the interval\ntrap. There is no H0 equation, interval split, clearance or death among inputs. -/\ntheorem elderTrap_of_boundary {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n ElderTrap g M P m d D where\n death_lt_" + }, + { + "kind": "def", + "unqualified_name": "elderBoundaryDirectSummand", + "line": 52, + "source_header": "hγ t\n\n/-- The constructed singular-H0 direct summand, instantiated from geometric\ninputs, rather than a premise asserting that a persistence summand exists. -/\ndef elderBoundaryDirectSummand (k : Type u) [Field k]\n {X : Type u} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (m d : ℝ) (M P : X)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hdm : d < m) (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevel_h0Filtration g (ModuleCat.of k k) ≅\n elderInterval k m d ⊞ kernel (elderRetrac" + }, + { + "kind": "theorem", + "unqualified_name": "elderBoundary_death_eq", + "line": 67, + "source_header": "P γ hγ)\n\n/-- On Euclidean heights the same geometric inputs also give the literal C263\ndeath. This is a proved join, not identification of an abstract death field. -/\ntheorem elderBoundary_death_eq {n : ℕ}\n (g : superlevelBar_E n → ℝ) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (m d : ℝ) (M P : superlevelBar_E n)\n (hD : IsClosed D) (hboundary : ∀ x ∈ frontier D, g x ≤ d)\n (hMheight : g M = m) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ m) (hP : m < g P)\n (γ : Path M P) (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_deathHeigh" + } + ] + }, + { + "path": "frontiers/compact_morse_elder_adapter_20261018/inputs/Math-/frontiers/asymmetric_elder_bridge_20261017/ElderClearance.lean", + "sha256": "d3d78472881059546402218cc77792eeef00755c222bb02499d69abd3b5cd57e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "elderTrap_strictTrace", + "line": 19, + "source_header": "n\n\n/-- The trace of a geometric domain in the strict superlevel above d. -/\ndef elderTrap_strictTrace {X : Type*} (g : X → ℝ) (D : Set X) (d : ℝ) :\n Set {x : X // d < g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_strictTrace_isClopen", + "line": 23, + "source_header": "D}\n\n/-- A boundary height bound makes the trace clopen in the strict superlevel.\nThis derives separation from a geometric domain; it does not assume a path cut. -/\ntheorem elderTrap_strictTrace_isClopen {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ) (hD : IsClosed D)\n (hboundary : ∀ x ∈ frontier D, g x ≤ d) :\n IsClopen (elderTrap_strictTrace g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_path_stays", + "line": 47, + "source_header": "e_val\n\n/-- A path strictly above the exit threshold cannot leave the geometric trap. -/\ntheorem elderTrap_path_stays {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n {M y : X} (hM : M ∈ D) (γ : Path M y)\n (hγ : ∀ t : unitInterval, d < g (γ t))" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_higher_path_meets_threshold", + "line": 66, + "source_header": "ng hone\n\n/-- Every higher-endpoint path must meet or fall below the exit threshold.\nThe conclusion quantifies over all ambient paths, including remote detours. -/\ntheorem elderTrap_higher_path_meets_threshold {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)\n {y : X} (hy : g M < g y) (γ : Path M y) :\n ∃ t : unitInterval, g" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_clearance_eq_Iio", + "line": 79, + "source_header": "hyD)) hy\n\n/-- The literal C263 clearance is exactly the strict interval below d.\nThe closed path is supplied by the geometric construction, rather than inferred\nfrom a supremum over paths or from a compactness assertion about path space. -/\ntheorem elderTrap_clearance_eq_Iio {n : ℕ}\n (g : superlevelBar_E n → ℝ) (D : Set (superlevelBar_E n)) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ g M)\n (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_clearanceSet g M" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_death_eq", + "line": 98, + "source_header": "hh (hγ t)⟩\n\n/-- With continuity, the new geometric cut identifies the existing C263 death.\nNonessentiality is derived from the actual higher point P. -/\ntheorem elderTrap_death_eq {n : ℕ}\n (g : superlevelBar_E n → ℝ) (hg : Continuous g)\n (D : Set (superlevelBar_E n)) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : superlevelBar_E n) (hM : M ∈ D)\n (hheight : ∀ x ∈ D, g x ≤ g M)\n (P : superlevelBar_E n) (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n superlevelBar_deathH" + }, + { + "kind": "theorem", + "unqualified_name": "elderTrap_closed_path_attains", + "line": 116, + "source_header": "P γ hγ]\n rfl\n\n/-- The displayed closed path actually attains d. This does not replace strict\nclearance by a closed inequality or infer an optimal path from a supremum. -/\ntheorem elderTrap_closed_path_attains {X : Type*} [TopologicalSpace X]\n (g : X → ℝ) (D : Set X) (d : ℝ)\n (htrace : IsClopen (elderTrap_strictTrace g D d))\n (M : X) (hM : M ∈ D) (hheight : ∀ x ∈ D, g x ≤ g M)\n {P : X} (hP : g M < g P) (γ : Path M P)\n (hγ : ∀ t : unitInterval, d ≤ g (γ t)) :\n ∃ t : unitInterv" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:frontiers/determinant_moment_20261025", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1.lean", + "sha256": "15e6b160ea4dcd0b95d9bf56afe318d0292e2421659637cb6754e18eee1e4364" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean", + "sha256": "dbc42b17797be688fecec790f32fcfd0004d98ac776cbbe0471c62c3f506aa41" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizerLimit.lean", + "sha256": "12c98054b5bcf47f4619c624ef5e91c37f316d7c4848f560279d1f1e96fe0049" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointNormalizerBridge.lean", + "sha256": "36eab3b805fcba5160cb7e286dbd7f96940b0c6a85b464aad5fdad2f624ceb7e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointGaussianMoments.lean", + "sha256": "c6351881326491ce30f1a266ea60e44c5adb8b3a1e5882c90575c67e459479d1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/PalmReweighting.lean", + "sha256": "d34e422693f1d449bfcaf9c844c99c8fef4f19503312d3677ca525bd2d67c4d6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianJetMoments.lean", + "sha256": "f2e785975aee6915848fe78dc3ecde02b8f13a0a1fb56ae3771e4c727c723360" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianRegressionKernel.lean", + "sha256": "66d4fbee044a1a0c0b434bcd7614e220fad21d1ac275ce9b01070a66c5780460" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianCoupling.lean", + "sha256": "426a53c139215650e961601c12f3cc1e09069520c5ebb96234a29483280551bb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizer.lean", + "sha256": "32b7202cba2a9a0e0ed603d1a6db9ba2031714375b4e955614d5a40826a14aeb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianScalarMoments.lean", + "sha256": "71ce88ad2c97891858a5196f3293907bdffdd2341dfbace24204f2318c7510df" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/NormalizerFloor.lean", + "sha256": "428eefd71b8c64fc4bcb208d9f73658058f29765f01a01c591f20a2d2359ec3e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/DeterminantMoment.lean", + "sha256": "661b73c3f21c6d2529f5e09ce426d89c01939ab27a5cc868db3802c7e66ea82d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/determinant_moment_20261025/ResearchFormalCoreR1/AlgebraV2.lean", + "sha256": "71e4327df9f7d6979f1467f7e0d880e0ab0a70ab6d234802d8c7a1624b9ce2d9" + } + ], + "source_record_sha256": "405f156207b11e3423a96c28ddeafad4797e37563dbbfcacfe79b3299bf89cbb", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "frontiers/determinant_moment_20261025", + "source_files": [ + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1.lean", + "sha256": "15e6b160ea4dcd0b95d9bf56afe318d0292e2421659637cb6754e18eee1e4364", + "declarations_lexical": [] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean", + "sha256": "dbc42b17797be688fecec790f32fcfd0004d98ac776cbbe0471c62c3f506aa41", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "p02_lm008_r2_cancel", + "line": 11, + "source_header": "/-- P02-LM-008 algebraic companion: exact cancellation of the `r²` factor\n after the Cauchy–Schwarz numerator bound and the normalizer lower bound\n have been established in the surrounding probability theorem. -/\ntheorem p02_lm008_r2_cancel\n (r cW cZ q : ℝ) (hr : r ≠ 0) (hcZ : cZ ≠ 0) :\n (Real.sqrt cW * r ^ 2 * Real.sqrt q) / (cZ * r ^ 2) =\n (Real.sqrt cW / cZ) * Real.sqrt" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_cross_multiplied", + "line": 20, + "source_header": "]\n\n/-- P02-LM-008 cross-multiplied transfer companion. This theorem starts\n from an already supplied Cauchy–Schwarz numerator estimate and an exact\n normalizer lower bound. It does not formalize the measure-theoretic\n Cauchy–Schwarz step itself. -/\ntheorem p02_lm008_cross_multiplied\n (n z r cW cZ q : ℝ)\n (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)\n (hz : cZ * r ^ 2 ≤ z)\n (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n * (cZ * r ^ 2) ≤\n (Real.sqrt cW * r ^ 2 * Real.sqrt q)" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_quotient_bound", + "line": 42, + "source_header": "num\n\n/-- P02-LM-008 quotient companion. With positive denominators, the\n cross-multiplied inequality and exact `r²` cancellation yield the Palm\n square-root transfer coefficient. -/\ntheorem p02_lm008_quotient_bound\n (n z r cW cZ q : ℝ)\n (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)\n (hzpos : 0 < z) (hz : cZ * r ^ 2 ≤ z)\n (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n / z ≤ (Real.sqrt cW / cZ) * Real.s" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_bad_event_threshold", + "line": 58, + "source_header": "cross\n\n/-- P02-LM-009 deterministic threshold companion. Failure of\n `r * R^5 ≤ ε` implies the fifth-power threshold used before Markov's\n inequality. -/\ntheorem p02_lm009_bad_event_threshold\n (r R ε : ℝ) (hr : 0 < r) (hbad : ε < r * R ^ 5) :\n ε / r" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_power40_identity", + "line": 66, + "source_header": "g hbad)\n\n/-- The fixed exponent identity used when the 40th moment is selected in\n the P02-LM-009 application. -/\ntheorem p02_lm009_power40_identity (R : ℝ) :\n (R ^ 5) ^ 8" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_r4_le_r3", + "line": 72, + "source_header": "by\n ring\n\n/-- In the final P0.2 power ledger, an `O(r^4)` Palm tail is also `O(r^3)`\n on `0 ≤ r ≤ 1`. -/\ntheorem p02_lm009_r4_le_r3\n (r : ℝ) (hr0 : 0 ≤ r) (hr1 : r ≤ 1) :\n r" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_palm_r4_to_r3", + "line": 81, + "source_header": "nlinarith\n\n/-- Conditional rate companion: once the Palm square-root transfer has\n produced a uniform `C r^4` bound, the cubic target follows on `r ≤ 1`. -/\ntheorem p02_lm009_palm_r4_to_r3\n (p C r : ℝ) (hC : 0 ≤ C) (hr0 : 0 ≤ r) (hr1 : r ≤ 1)\n (hp : p ≤ C * r ^ 4) :" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizerLimit.lean", + "sha256": "12c98054b5bcf47f4619c624ef5e91c37f316d7c4848f560279d1f1e96fe0049", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "gnl_contact_relations", + "line": 21, + "source_header": "e\n\nprivate theorem gnl_contact_relations (m : EuclideanSpace ℝ (Fin 6)) (S : Matrix (Fin 6) (Fin 6) ℝ)\n (hS : S.PosSemidef)\n (hm0 : m 0 = -1) (hm1 : m 1 = 1)\n (hm23 : m 2 + m 3 = 0) (hm45 : m 4 - m 5 = 0)\n (hS0 : S 0 0 = 0) (hS1 : S 1 1 = 0)\n (hS23 : S 2 2 + 2*S 2 3 + S 3 3 = 0)\n (hS45 : S 4 4 - 2*S 4 5 + S 5 5 = 0) :\n ∀ᵐ x ∂multivariateGaussian m S,\n x 0 = -1 ∧ x 1 = 1 ∧ x 2 + x 3 = 0 ∧ x 4 - x 5 =" + }, + { + "kind": "lemma", + "unqualified_name": "gnl_positivePart_memLp", + "line": 64, + "source_header": "⟩\n\nprivate lemma gnl_positivePart_memLp {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {f : Ω → ℝ} {p : ℝ≥0∞} (hf : MemLp f p P) :\n MemLp (fun x => max (f x) 0) p" + }, + { + "kind": "lemma", + "unqualified_name": "gnl_gaussian_weight_integrable", + "line": 72, + "source_header": ")\n\nprivate lemma gnl_gaussian_weight_integrable (r : ℝ) (m : EuclideanSpace ℝ (Fin 6))\n (S : Matrix (Fin 6) (Fin 6) ℝ) (hS : S.PosSemidef) :\n Integrable (fun x : EuclideanSpace ℝ (Fin 6) => gn_normalizedWeight r (ofLp x))\n (multivariateGaussian m S" + }, + { + "kind": "theorem", + "unqualified_name": "gnl_normalizer_floor_of_parameter_limits", + "line": 105, + "source_header": "T\n\n\n/-- Gaussian endpoint parameter convergence and concrete contact moments supply\none positive physical normalizer coefficient at every sufficiently small radius.\nThe covariance may be singular; the transverse reference mean is unrestricted. -/\ntheorem gnl_normalizer_floor_of_parameter_limits\n (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)\n (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)\n (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))\n (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))\n (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)\n (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)\n (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)\n (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)\n (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)\n (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤\n ∫ x : EuclideanSpace ℝ (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)\n ∂multivariateGaussian (m r) (S" + }, + { + "kind": "theorem", + "unqualified_name": "gnl_physical_normalizer_floor_of_parameter_limits", + "line": 174, + "source_header": "op)\n\n\n/-- The same Gaussian parameter limit gives the full literal typed endpoint\nnormalizer, after the explicit permutation back to physical endpoint order. -/\ntheorem gnl_physical_normalizer_floor_of_parameter_limits\n (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)\n (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)\n (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))\n (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))\n (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)\n (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)\n (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)\n (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)\n (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)\n (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤\n ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]\n ∂multivariateGaussian (m r)" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointNormalizerBridge.lean", + "sha256": "36eab3b805fcba5160cb7e286dbd7f96940b0c6a85b464aad5fdad2f624ceb7e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "enb_permutation", + "line": 19, + "source_header": "e\n\n/-- Convert the actual six endpoint entries to the continuous weight's order. -/\ndef enb_permutation (j : Fin 6 → ℝ) : Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "enb_permutation_continuous", + "line": 23, + "source_header": "5]\n\ntheorem enb_permutation_continuous : Continuous enb_permutat" + }, + { + "kind": "theorem", + "unqualified_name": "enb_maximum_factor", + "line": 27, + "source_header": "rop\n\nprivate theorem enb_maximum_factor (r a b c : ℝ) (hr : 0 < r) :\n max (max (-a) 0 * max (-c) 0 - r * b ^ 2) 0 =\n if a < 0 ∧ 0 < a * c - r * b ^ 2 then a * c - r * b ^ 2 els" + }, + { + "kind": "theorem", + "unqualified_name": "enb_maximum_iff", + "line": 53, + "source_header": ")))\n\n/-- Strict negative definiteness in actual endpoint coordinates, with no\nassumed sign of the other diagonal entry or omission of singular boundaries. -/\ntheorem enb_maximum_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n dm2Negative (egm_HM r j) ↔ j 0 < 0 ∧ 0 < j 0 * j 2 - r * j" + }, + { + "kind": "theorem", + "unqualified_name": "enb_saddle_iff", + "line": 64, + "source_header": "t hr]\n\n/-- The literal strict saddle condition is the sign of its factored determinant. -/\ntheorem enb_saddle_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n (egm_HS r j).det < 0 ↔ j 3 * j 5 - r * j 4" + }, + { + "kind": "theorem", + "unqualified_name": "enb_weight_identity", + "line": 73, + "source_header": "inarith\n\n/-- Exact bridge from the literal typed physical endpoint weight to the\ncontinuous expression. All excluded types and all zero boundaries give zero. -/\ntheorem enb_weight_identity (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n egm_weight r j = r ^ 2 * gn_normalizedWeight r (enb_permu" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integral_identity", + "line": 109, + "source_header": "ring\n\n/-- The physical and continuous normalizers are the same integral up to the\nexact radius factor, for any common random six-vector and any measure. -/\ntheorem enb_integral_identity {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :\n (∫ ω, egm_weight r (J ω) ∂P) =\n r ^ 2 * ∫ ω, gn_normalizedWeight r (enb_permutatio" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integrable_iff", + "line": 120, + "source_header": "nst_mul _ _\n\n/-- Positive radius makes the exact scaling nonzero, so either weight is\nintegrable precisely when the other is. -/\ntheorem enb_integrable_iff {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :\n Integrable (fun ω => egm_weight r (J ω)) P ↔\n Integrable (fun ω => gn_normalizedWeight r (enb_permutat" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integrable_of_integrable_sq", + "line": 131, + "source_header": "o 2 hr.ne'))]\n\n/-- On a finite measure, the actual endpoint second-moment theorem supplies\nthe first-moment hypotheses needed by the normalizer join. -/\ntheorem enb_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsFiniteMeasure P]\n (J : Ω → Fin 6 → ℝ) (hJ : Measurable J) (r : ℝ) (hr : 0 < r)\n (hsq : Integrable (fun ω => egm_weight r (J ω) ^ 2) P) :\n Integrable (fun ω => egm_weight r (J ω)) P ∧\n Integrable (fun ω => gn_normalizedWeight r (enb_permut" + }, + { + "kind": "theorem", + "unqualified_name": "enb_normalizer_floor_of_common_coupling", + "line": 149, + "source_header": ").mp hphysical⟩\n\n/-- The proved common-coupling normalizer floor transfers to the literal\nphysical endpoint weight, with its own actual coordinate order. Current\nphysical integrability and the conditioned-field convergence remain inputs. -/\ntheorem enb_normalizer_floor_of_common_coupling\n {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P]\n (J : ℝ → Ω → Fin 6 → ℝ) (hJ : ∀ r, Measurable (J r))\n (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => J r ω) (𝓝[>] (0 : ℝ))\n (𝓝 ![-1,-A ω/2,Q ω,1,A ω/2,Q ω]))\n (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),\n Integrable (fun ω => egm_weight r (J r ω)) P) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n c * r ^ 2 ≤ ∫ ω, egm_we" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointGaussianMoments.lean", + "sha256": "c6351881326491ce30f1a266ea60e44c5adb8b3a1e5882c90575c67e459479d1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "egm_HM", + "line": 13, + "source_header": "e\n\ndef egm_HM (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2)" + }, + { + "kind": "def", + "unqualified_name": "egm_HS", + "line": 16, + "source_header": "]\n\ndef egm_HS (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2)" + }, + { + "kind": "def", + "unqualified_name": "egm_weight", + "line": 19, + "source_header": "]\n\nnoncomputable def egm_weight (r : ℝ) (j : Fin 6 → ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "egm_weight_measurable", + "line": 24, + "source_header": "0\n\n/-- The maximum condition is the original strict quadratic-form condition;\nno null-boundary assumption is needed for measurable typing. -/\ntheorem egm_weight_measurable (r : ℝ) : Measurable (egm_weight" + }, + { + "kind": "theorem", + "unqualified_name": "egm_coordinate_bound", + "line": 49, + "source_header": "nst\n\nprivate theorem egm_coordinate_bound (j : Fin 6 → ℝ) (i : Fin 6) :\n |j i| ≤ gm8Radiu" + }, + { + "kind": "theorem", + "unqualified_name": "egm_factor_bound", + "line": 56, + "source_header": "ith\n\nprivate theorem egm_factor_bound (r a b c R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)\n (hR : 0 ≤ R) (ha : |a| ≤ R) (hb : |b| ≤ R) (hc : |c| ≤ R) :\n |a * c - r * b ^ 2| ≤ 2 * R" + }, + { + "kind": "theorem", + "unqualified_name": "egm_untyped", + "line": 68, + "source_header": "th)\n\nprivate theorem egm_untyped (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :\n ((egm_HM r j).det * (egm_HS r j).det) ^ 2 ≤\n 16 * r ^ 4 * gm8Radius j" + }, + { + "kind": "theorem", + "unqualified_name": "egm_pointwise", + "line": 97, + "source_header": "ing\n\n/-- Exact endpoint determinant domination in the actual normalized six-vector.\nThe type indicators can only reduce the nonnegative determinant product. -/\ntheorem egm_pointwise (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :\n egm_weight r j ^ 2 ≤ 16 * r ^ 4 * gm8Radius" + }, + { + "kind": "theorem", + "unqualified_name": "egm_gaussian_moment", + "line": 108, + "source_header": "vity)\n\n/-- Genuine Gaussian marginal laws of the actual normalized endpoint vector\nsupply both integrability and its determinant second moment. The derivative-map,\nconditioning law and uniform parameter bounds remain explicit model inputs. -/\ntheorem egm_gaussian_moment {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin 6 → ℝ)\n (hJ : Measurable J) (m : Fin 6 → ℝ) (v : Fin 6 → ℝ≥0)\n (B V r : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V) (hr : 0 < r) (hr1 : r ≤ 1)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => egm_weight r (J x) ^ 2) μ ∧\n (∫ x, egm_weight r (J x) ^ 2 ∂μ) ≤ 16 * gm8FiniteM8 6 B V" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/PalmReweighting.lean", + "sha256": "d34e422693f1d449bfcaf9c844c99c8fef4f19503312d3677ca525bd2d67c4d6", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "prwMeasure", + "line": 26, + "source_header": "e\n\n/-- The literal normalized nonnegative real density, defined for every input. -/\nnoncomputable def prwMeasure {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) : Measur" + }, + { + "kind": "theorem", + "unqualified_name": "prw_integrable_of_integrable_sq", + "line": 31, + "source_header": "μ))\n\n/-- On a finite measure, a measurable square-integrable real weight is integrable. -/\ntheorem prw_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hsq : Integrable (fun ω => W ω ^ 2) μ) : Integrabl" + }, + { + "kind": "theorem", + "unqualified_name": "prw_measure_apply", + "line": 42, + "source_header": "W ω)]\n\n/-- The actual event mass is the normalized set integral, in extended reals. -/\ntheorem prw_measure_apply {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n prwMeasure μ W E = ENNReal.ofReal ((∫ x in E, W x ∂μ) / ∫ x," + }, + { + "kind": "theorem", + "unqualified_name": "prw_isProbabilityMeasure", + "line": 55, + "source_header": "al_div]\n\n/-- Positive finite normalizer makes the literal density a probability law. -/\ntheorem prw_isProbabilityMeasure {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ) :\n IsProbabilityMeasure (prwMea" + }, + { + "kind": "theorem", + "unqualified_name": "prw_measure_real", + "line": 64, + "source_header": "[hZ.ne']\n\n/-- The event identity is proved for the constructed law, not assumed. -/\ntheorem prw_measure_real {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n (prwMeasure μ W).real E = (∫ x in E, W x ∂μ) /" + }, + { + "kind": "theorem", + "unqualified_name": "prw_numerator_bound", + "line": 73, + "source_header": "W0) hZ.le)]\n\n/-- Integral Cauchy–Schwarz against the event indicator, including null events. -/\ntheorem prw_numerator_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n (∫ x in E, W x ∂μ) ≤\n Real.sqrt (∫ x, W x ^ 2 ∂μ) * Real.sq" + }, + { + "kind": "theorem", + "unqualified_name": "prw_square_root_event_bound", + "line": 105, + "source_header": "ow] using hCS\n\n/-- The exact `r^4` second moment and `r^2` normalizer cancel in the literal\nweighted probability. No event probability is assumed positive. -/\ntheorem prw_square_root_event_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)\n (C c r : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)\n (hmoment : (∫ x, W x ^ 2 ∂μ) ≤ C * r ^ 4)\n (hfloor : c * r ^ 2 ≤ ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n IsProbabilityMeasure (prwMeasure μ W) ∧\n (prwMeasure μ W).real E ≤ (Real.sqrt C / c) * Real." + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianJetMoments.lean", + "sha256": "f2e785975aee6915848fe78dc3ecde02b8f13a0a1fb56ae3771e4c727c723360", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gm8Radius", + "line": 12, + "source_header": "/-- Radius for a finite vector, including its constant one. -/\ndef gm8Radius {n : ℕ} (j : Fin n → ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "gm8FiniteM8", + "line": 15, + "source_header": "|\n\n/-- One finite-dimensional Gaussian radius moment constant. -/\nnoncomputable def gm8FiniteM8 (n : ℕ) (B V : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "gm8FiniteM8_nonneg", + "line": 19, + "source_header": "8))\n\ntheorem gm8FiniteM8_nonneg (n : ℕ) (B V : ℝ) : 0 ≤ gm8FiniteM8 n" + }, + { + "kind": "def", + "unqualified_name": "gm8M8", + "line": 24, + "source_header": "ity\n\n/-- The source's exact fixed nine-coordinate constant. -/\nnoncomputable def gm8M8 (B V : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "gm8M8_nonneg", + "line": 28, + "source_header": "8C8))\n\ntheorem gm8M8_nonneg (B V : ℝ) : 0 ≤ gm8M" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_finite_radius_power_bound", + "line": 31, + "source_header": "9 B V\n\ntheorem gm8_finite_radius_power_bound (n : ℕ) (j : Fin n → ℝ) :\n gm8Radius j ^ 8 ≤ ((n+1 : ℕ) : ℝ)^7 * (1 + ∑ i, |j" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_finite_integrable_bound", + "line": 41, + "source_header": "ing h\n\ntheorem gm8_finite_integrable_bound (n : ℕ) {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin n → ℝ)\n (hJ : Measurable J) (m : Fin n → ℝ) (v : Fin n → ℝ≥0)\n (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => gm8Radius (J x)^8) μ ∧\n (∫ x, gm8Radius (J x)^8 ∂μ) ≤ gm8FiniteM8" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_radius_power_bound", + "line": 82, + "source_header": "ssoc]\n\n/-- The exact DM2 radius is the nine-dimensional specialization. -/\ntheorem gm8_radius_power_bound (j : DM2Jet) :\n dm2Radius j ^ 8 ≤ (10 : ℝ)^7 * (1 + ∑ i, |" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_jet_integrable_bound", + "line": 87, + "source_header": "und 9 j\n\n/-- The nine-jet Gaussian marginal moment interface, with no independence or\nmoment conclusion assumed. -/\ntheorem gm8_jet_integrable_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → DM2Jet)\n (hJ : Measurable J) (m : Fin 9 → ℝ) (v : Fin 9 → ℝ≥0)\n (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => dm2Radius (J x)^8) μ ∧\n (∫ x, dm2Radius (J x)^8 ∂μ) ≤" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_family_weight_moment", + "line": 100, + "source_header": "hvar hlaw\n\n/-- The same B,V give one determinant second-moment coefficient throughout\n0 J r x i) (gaussianReal (m r i) (v r i)) (μ r)) :\n 0 ≤ 16*gm8M8 B V ∧ ∀ r, 0 < r → r ≤ r0 →\n Integrable (fun x => dm2Weight r (J r x)^2) (μ r) ∧\n (∫ x, dm2Weight r (J r x)^2 ∂μ r) ≤ (16*gm8" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianRegressionKernel.lean", + "sha256": "66d4fbee044a1a0c0b434bcd7614e220fad21d1ac275ce9b01070a66c5780460", + "declarations_lexical": [ + { + "kind": "lemma", + "unqualified_name": "regression_compProd_id_const", + "line": 28, + "source_header": "1\n\n/-- Copying the first coordinate and retaining an independent second coordinate. -/\nlemma regression_compProd_id_const {α β : Type*} [MeasurableSpace α] [MeasurableSpace β]\n (μ : Measure α) (ν : Measure β) [SFinite μ] [SFinite ν] :\n μ ⊗ₘ (Kernel.id ×ₖ Kernel.const α ν) =\n (μ.prod ν).map (fun p : α × β => (p.1," + }, + { + "kind": "lemma", + "unqualified_name": "regression_pair_hasCondDistrib", + "line": 41, + "source_header": "rfl\n\n/-- An independent residual paired with the observation has the explicit product kernel. -/\nlemma regression_pair_hasCondDistrib {Ω α β : Type*} [MeasurableSpace Ω]\n [MeasurableSpace α] [MeasurableSpace β] {P : Measure Ω} [IsProbabilityMeasure P]\n {X : Ω → α} {R : Ω → β} (hX : AEMeasurable X P) (hR : AEMeasurable R P)\n (hXR : IndepFun X R P) :\n HasCondDistrib (fun ω => (X ω, R ω)) X\n (Kernel.id ×ₖ Kernel.const α (P.map" + }, + { + "kind": "def", + "unqualified_name": "regressionReconstruction", + "line": 59, + "source_header": ".symm\n\n\n/-- Affine reconstruction of the target from the observation and the regression residual. -/\ndef regressionReconstruction {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (p : (Fin n → ℝ) × (Fin k → ℝ)) : Fi" + }, + { + "kind": "lemma", + "unqualified_name": "regressionReconstruction_measurable", + "line": 66, + "source_header": "1 - mX)\n\nlemma regressionReconstruction_measurable {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Measurable (regressionReconstruction B" + }, + { + "kind": "def", + "unqualified_name": "regressionKernel", + "line": 72, + "source_header": "un_prop\n\n/-- The canonical regression law is specified at every observation, including null pins. -/\nnoncomputable def regressionKernel {n k : ℕ} (ν : Measure (Fin k → ℝ))\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Kernel (Fin n → ℝ) (F" + }, + { + "kind": "instance", + "unqualified_name": "regressionKernel_isMarkov", + "line": 79, + "source_header": "B mX mY)\n\ninstance regressionKernel_isMarkov {n k : ℕ} (ν : Measure (Fin k → ℝ))\n [IsProbabilityMeasure ν] (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ))\n (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n IsMarkovKernel (regressionKernel ν" + }, + { + "kind": "lemma", + "unqualified_name": "regressionKernel_apply", + "line": 86, + "source_header": "B mX mY)\n\nlemma regressionKernel_apply {n k : ℕ} (ν : Measure (Fin k → ℝ)) [SFinite ν]\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (x : Fin n → ℝ) :\n regressionKernel ν B mX mY x = ν.map (fun r => r + mY + B" + }, + { + "kind": "lemma", + "unqualified_name": "independentResidual_hasCondDistrib", + "line": 95, + "source_header": "p)]\n rfl\n\n/-- Affine reconstruction from an independent residual has the canonical conditional kernel. -/\nlemma independentResidual_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}\n {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hX : AEMeasurable X P) (hR : AEMeasurable R P) (hXR : IndepFun X R P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P.map R)" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_hasCondDistrib", + "line": 106, + "source_header": "le B mX mY)\n\n/-- Joint Gaussianity and vanishing observation/residual cross-covariance give the canonical\nconditional law, without choosing an almost-everywhere version at a prescribed observation. -/\ntheorem gaussianRegression_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)\n (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P.map" + }, + { + "kind": "lemma", + "unqualified_name": "regressionKernel_measurable", + "line": 119, + "source_header": "zero) B mX mY\n\n/-- Kernel measurability is pointwise in the observation and does not require a Gaussian law. -/\nlemma regressionKernel_measurable {n k : ℕ} (ν : Measure (Fin k → ℝ))\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Measurable (regressionKe" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegressionKernel_spec", + "line": 125, + "source_header": "el.measurable _\n\n/-- All parts of the canonical Gaussian conditional-law construction, including the literal\npushforward at every prescribed observation. Zero-dimensional and degenerate laws are allowed. -/\ntheorem gaussianRegressionKernel_spec {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)\n (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n IsMarkovKernel (regressionKernel (P.map R) B mX mY) ∧\n Measurable (regressionKernel (P.map R) B mX mY) ∧\n (∀ x, regressionKernel (P.map R) B mX mY x =\n (P.map R).map (fun r => r + mY + B (x - mX))) ∧\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P." + }, + { + "kind": "lemma", + "unqualified_name": "regression_map_coordinate", + "line": 142, + "source_header": "XR hzero B mX mY⟩\n\n/-- Coordinates of a finite-vector continuous linear map in the standard basis. -/\nlemma regression_map_coordinate {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (v : Fin n → ℝ) (j : Fin k) :\n B v j = ∑ l, B (Pi." + }, + { + "kind": "lemma", + "unqualified_name": "regression_covariance_map", + "line": 152, + "source_header": "[map_sum, mul_comm]\n\n/-- The covariance of a centered finite-vector linear predictor is its normal-equation sum. -/\nlemma regression_covariance_map {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}\n {X : Ω → Fin n → ℝ} (hX : HasGaussianLaw X P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ)\n (i : Fin n) (j : Fin k) :\n covariance (fun ω => X ω i) (fun ω => B (X ω - mX) j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω" + }, + { + "kind": "lemma", + "unqualified_name": "regression_residual_zero_covariance", + "line": 172, + "source_header": "(hX.eval i).memLp_two\n\n/-- The actual regression residual has zero observation cross-covariance by the normal equations. -/\nlemma regression_residual_zero_covariance {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n ∀ i j, covariance (fun ω => X ω i)\n (fun ω => (Y ω - mY -" + }, + { + "kind": "lemma", + "unqualified_name": "regression_residual_jointGaussian", + "line": 198, + "source_header": "hnormal i j, sub_self]\n\n/-- The observation and the actual affine residual are jointly Gaussian. -/\nlemma regression_residual_jointGaussian {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} {n k : ℕ}\n {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasGaussianLaw (fun ω => (X ω, Y" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_observed_hasCondDistrib", + "line": 227, + "source_header": "rw [map_sub]\n abel\n\n\n\n/-- The actual target has the explicit regression conditional law when the coefficient map\nsatisfies the coordinate normal equations. The residual hypotheses are derived. -/\ntheorem gaussianRegression_observed_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n HasCondDistrib Y X\n (regressionKernel (P.map (fun ω => Y ω - mY" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_observed_spec", + "line": 246, + "source_header": "d using 1\n funext ω\n abel\n\n/-- The canonical conditional-law specification for the actual jointly Gaussian target.\nThe residual Gaussianity and its zero cross-covariance are conclusions of the construction. -/\ntheorem gaussianRegression_observed_spec {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n IsMarkovKernel\n (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧\n Measurable\n (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧\n (∀ x, regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY x =\n (P.map (fun ω => Y ω - mY - B (X ω - mX))).map\n (fun r => r + mY + B (x - mX))) ∧\n HasCondDistrib Y X\n (regressionKernel (P.map (fun ω => Y ω - m" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianCoupling.lean", + "sha256": "426a53c139215650e961601c12f3cc1e09069520c5ebb96234a29483280551bb", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "gc_matrix_eval_tendsto", + "line": 18, + "source_header": "e\n\nprivate theorem gc_matrix_eval_tendsto {ι R : Type*} [Fintype ι] [DecidableEq ι]\n {u : Filter R} {S : R → Matrix ι ι ℝ} {S0 : Matrix ι ι ℝ}\n (hS : Tendsto S u (𝓝 S0)) (z : EuclideanSpace ℝ ι) :\n Tendsto (fun r => Matrix.toEuclideanCLM (" + }, + { + "kind": "def", + "unqualified_name": "gc_coupledVector", + "line": 35, + "source_header": "c\n\n/-- The canonical affine vector on one common standard Gaussian space. -/\nnoncomputable def gc_coupledVector {ι : Type*} [Fintype ι] [DecidableEq ι]\n (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) (z : EuclideanSpace ℝ ι) :\n EuclideanSpace" + }, + { + "kind": "theorem", + "unqualified_name": "gc_coupledVector_hasLaw", + "line": 40, + "source_header": ") z\n\n/-- Exact marginal law; this is the pinned multivariateGaussian definition. -/\ntheorem gc_coupledVector_hasLaw {ι : Type*} [Fintype ι] [DecidableEq ι]\n (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) :\n HasLaw (gc_coupledVector m S) (multivariateGaussian m S)\n (stdGaussian (EuclideanSpace ℝ ι)) where\n aemeasu" + }, + { + "kind": "theorem", + "unqualified_name": "gc_coupledVector_tendsto", + "line": 48, + "source_header": "= rfl\n\n/-- Every common Gaussian coordinate converges when means and PSD covariances\nconverge. No invertibility, fixed rank, or square-root Lipschitz estimate. -/\ntheorem gc_coupledVector_tendsto {ι κ : Type*} [Fintype ι] [DecidableEq ι]\n (u : Filter κ) (m : κ → EuclideanSpace ℝ ι) (S : κ → Matrix ι ι ℝ)\n (m0 : EuclideanSpace ℝ ι) (S0 : Matrix ι ι ℝ)\n (hm : Tendsto m u (𝓝 m0)) (hS : Tendsto S u (𝓝 S0))\n (hPSD : ∀ᶠ t in u, (S t).PosSemidef) (hPSD0 : S0.PosSemidef)\n (z : EuclideanSpace ℝ ι) :\n Tendsto (fun t => gc_coupledVector (m t) (S t) z) u\n (𝓝 (gc_coupledVector m0" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizer.lean", + "sha256": "32b7202cba2a9a0e0ed603d1a6db9ba2031714375b4e955614d5a40826a14aeb", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gn_normalizedWeight", + "line": 24, + "source_header": "e\n\n/-- The six coordinates are aM,aS,bM,bS,cM,cS. For physical positive radius,\nthe source identifies this continuous expression with its typed W_r/r². -/\nnoncomputable def gn_normalizedWeight (r : ℝ) (v : Fin 6 → ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "gn_gaussian_reference_integrable_pos", + "line": 30, + "source_header": ") 0\n\n/-- The contact negative-curvature reference has an integrable, strictly\npositive squared negative part, with arbitrary mean and nonzero variance. -/\ntheorem gn_gaussian_reference_integrable_pos (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0) :\n Integrable (fun q : ℝ => (max (-q) 0)^2) (gaussianReal m v) ∧\n 0 < ∫ q : ℝ, (max (-q) 0)^2 ∂gaussianRea" + }, + { + "kind": "theorem", + "unqualified_name": "gn_open_box_floor", + "line": 67, + "source_header": "hmass\n\n/-- An explicit open endpoint box has a uniform positive normalized weight.\nThis is a pointwise component, with no claimed probability mass for the box. -/\ntheorem gn_open_box_floor\n (r K : ℝ) (v : Fin 6 → ℝ)\n (hr : 0 ≤ r) (hK : 0 < K) (hsmall : r * K^2 ≤ 1/4)\n (haM : v 0 ∈ Set.Ioo (-5/4) (-3/4))\n (haS : v 1 ∈ Set.Ioo (3/4) (5/4))\n (hbM : |v 2| < K) (_hbS : |v 3| < K)\n (hcM : v 4 ∈ Set.Ioo (-2) (-1))\n (hcS : v 5 ∈ Set.Ioo (-2) (-1)) :\n (3 : ℝ)/8 ≤ gn_normalizedWei" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianScalarMoments.lean", + "sha256": "71ce88ad2c97891858a5196f3293907bdffdd2341dfbace24204f2318c7510df", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gm8C8", + "line": 16, + "source_header": "e\n\nnoncomputable def gm8C8 :" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_standard_integrable", + "line": 18, + "source_header": "1\n\ntheorem gm8_standard_integrable :\n Integrable (fun z : ℝ => |z| ^ 8) (gaussianReal 0 1" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_standard_nonneg", + "line": 24, + "source_header": ")\n\ntheorem gm8_standard_nonneg : 0 ≤ gm8C" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_integrable", + "line": 27, + "source_header": ")\n\nprivate theorem gm8_integrable (m : ℝ) (v : ℝ≥0) :\n Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_sqrt_pow", + "line": 33, + "source_header": ")\n\nprivate theorem gm8_sqrt_pow (V : ℝ) (hV : 0 ≤ V) :\n (Real.sqrt V) ^ 8 = V ^" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_affine_map", + "line": 39, + "source_header": "]\n\nprivate theorem gm8_affine_map (m : ℝ) (v : ℝ≥0) :\n (gaussianReal 0 1).map (fun z : ℝ => m + Real.sqrt (v : ℝ) * z) =\n gaussianReal m" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_affine_bound", + "line": 54, + "source_header": "y\n\nprivate theorem gm8_affine_bound (m B V : ℝ) (v : ℝ≥0) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) (z : ℝ) :\n |m + Real.sqrt (v : ℝ) * z| ^ 8 ≤ 128 * (B ^ 8 + V ^ 4 * |z| ^ 8" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_scalar_integrable_bound", + "line": 72, + "source_header": "]\n\n/-- Bounded means and variances give a uniform eighth-moment bound, including\nzero variance and nonzero means. No eighth-moment hypothesis is assumed. -/\ntheorem gm8_scalar_integrable_bound (m B V : ℝ) (v : ℝ≥0)\n (hB : 0 ≤ B) (hV : 0 ≤ V) (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) :\n Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v) ∧\n (∫ x : ℝ, |x| ^ 8 ∂gaussianReal m v) ≤\n 128 * (B ^ 8 + V ^ 4 * gm8" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/NormalizerFloor.lean", + "sha256": "428eefd71b8c64fc4bcb208d9f73658058f29765f01a01c591f20a2d2359ec3e", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "nfloor_eventually_lower_of_fatou", + "line": 23, + "source_header": "e\n\nprivate theorem nfloor_eventually_lower_of_fatou {Ω ι : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (u : Filter ι) [IsCountablyGenerated u] [NeBot u]\n (f : ι → Ω → ℝ) (g : Ω → ℝ)\n (hmeas : ∀ r, Measurable (f r))\n (hnonneg : ∀ r ω, 0 ≤ f r ω)\n (hg : Integrable g P) (hgpos : 0 < ∫ ω, g ω ∂P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => f r ω) u (𝓝 (g ω)))\n (hfint : ∀ᶠ r in u, Integrable (f r) P) :\n ∀ᶠ r in u, (∫ ω, g ω ∂P)/2 ≤ ∫ ω, f r ω ∂" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_weight_continuous", + "line": 52, + "source_header": "e\n\nprivate theorem nfloor_weight_continuous :\n Continuous (fun p : ℝ × (Fin 6 → ℝ) => gn_normalizedWeight p.1 p.2" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_contact_value", + "line": 57, + "source_header": "p\nprivate theorem nfloor_contact_value (a q : ℝ) :\n gn_normalizedWeight 0 ![-1,1,-a/2,a/2,q,q] = (max (-q) 0)^" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_weight_limit", + "line": 60, + "source_header": "]\nprivate theorem nfloor_weight_limit (X : ℝ → Fin 6 → ℝ) (a q : ℝ)\n (hX : Tendsto X (𝓝[>] (0:ℝ)) (𝓝 ![-1,1,-a/2,a/2,q,q])) :\n Tendsto (fun r => gn_normalizedWeight r (X r)) (𝓝[>] (0:ℝ))\n (𝓝 ((max (-q) 0)^2)" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_reference", + "line": 68, + "source_header": ")\nprivate theorem nfloor_reference {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hlaw : HasLaw Q (gaussianReal m v) P) :\n Integrable (fun ω => (max (-Q ω) 0)^2) P ∧\n 0 < ∫ ω, (max (-Q ω) 0)^2 ∂" + }, + { + "kind": "theorem", + "unqualified_name": "gn_normalizer_floor_of_common_coupling", + "line": 78, + "source_header": "s\n\n/-- The actual integral of the physical r²-scaled continuous endpoint weight\nhas a positive lower constant at every sufficiently small positive radius.\nThe common coupling and current integrability are explicit premises; its\npositive reference integral and the lower bound are proved, not premises. -/\ntheorem gn_normalizer_floor_of_common_coupling\n {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P]\n (X : ℝ → Ω → Fin 6 → ℝ) (hX : ∀ r, Measurable (X r))\n (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => X r ω) (𝓝[>] (0 : ℝ))\n (𝓝 ![-1,1,-A ω/2,A ω/2,Q ω,Q ω]))\n (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),\n Integrable (fun ω => gn_normalizedWeight r (X r ω)) P) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n c * r^2 ≤ ∫ ω, r^2 * gn_normalizedWeight r (X r ω)" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/DeterminantMoment.lean", + "sha256": "661b73c3f21c6d2529f5e09ce426d89c01939ab27a5cc868db3802c7e66ea82d", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "DM2Jet", + "line": 20, + "source_header": "abbrev DM2Jet" + }, + { + "kind": "def", + "unqualified_name": "dm2Radius", + "line": 22, + "source_header": "def dm2Radius (j : DM2Jet) : ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2HM", + "line": 24, + "source_header": "noncomputable def dm2HM (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2HS", + "line": 28, + "source_header": "noncomputable def dm2HS (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2Negative", + "line": 32, + "source_header": "/-- The source's negative-definite condition, stated as the quadratic form. -/\ndef dm2Negative (H : Matrix (Fin 2) (Fin 2) ℝ) : Pro" + }, + { + "kind": "def", + "unqualified_name": "dm2Weight", + "line": 36, + "source_header": "0\n\nnoncomputable def dm2Weight (r : ℝ) (j : DM2Jet) :" + }, + { + "kind": "lemma", + "unqualified_name": "dm2_scale", + "line": 41, + "source_header": "0\n\nprivate lemma dm2_scale (r x : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1) :\n |r*x| ≤ |x" + }, + { + "kind": "lemma", + "unqualified_name": "dm2_factors", + "line": 46, + "source_header": "]\n\nprivate lemma dm2_factors (r A B C R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)\n (hR : 0 ≤ R) (hA : |A| ≤ R) (hB : |B| ≤ R) (hC : |C| ≤ R) :\n |A*C-r*B^2| ≤ 2*R^" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_untyped", + "line": 58, + "source_header": ")\n\n/-- Exact untyped determinant domination; no jet-coordinate or type assumptions. -/\ntheorem dm2_untyped (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :\n ((dm2HM r j).det * (dm2HS r j).det)^2 ≤ 16*r^4*dm2Radius" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_pointwise", + "line": 127, + "source_header": "ing\n\n/-- P02-LM-002 section 2, with the literal quadratic-form type indicator. -/\ntheorem dm2_pointwise (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :\n dm2Weight r j ^ 2 ≤ 16*r^4*dm2Radiu" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_negative_iff", + "line": 137, + "source_header": "vity)\n\n/-- Two-dimensional Sylvester criterion for the literal quadratic-form definition. -/\ntheorem dm2_negative_iff (a b c : ℝ) :\n dm2Negative !![a,b;b,c] ↔ a < 0 ∧ 0 <" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_weight_measurable", + "line": 170, + "source_header": "inarith\n\n/-- Measurability of the exact typed weight, with no assumed type-null boundary. -/\ntheorem dm2_weight_measurable (r : ℝ) : Measurable (dm2" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_moment", + "line": 191, + "source_header": "ble_const\n\n/-- P02-LM-002's expectation step: eighth-moment control supplies integrability\nand the second moment, rather than presupposing that second moment. -/\ntheorem dm2_moment {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω)\n (J : Ω → DM2Jet) (hJ : Measurable J) (r M8 : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)\n (h8 : MeasureTheory.Integrable (fun x => dm2Radius (J x)^8) μ)\n (hM8 : (∫ x, dm2Radius (J x)^8 ∂μ) ≤ M8) :\n MeasureTheory.Integrable (fun x => dm2Weight r (J x)^2) μ ∧\n (∫ x, dm2Weight r (J x)^2 ∂μ)" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/AlgebraV2.lean", + "sha256": "71e4327df9f7d6979f1467f7e0d880e0ab0a70ab6d234802d8c7a1624b9ce2d9", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "foldPotential", + "line": 9, + "source_header": "/-- Canonical A₂ normal-form potential, parameterized by `s` with λ = s². -/\nnoncomputable def foldPotential (s x : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "ec005_fold_gap", + "line": 12, + "source_header": "x\n\n/-- EC-005: exact canonical fold-gap identity in the normalized coordinate. -/\ntheorem ec005_fold_gap (s : ℝ) :\n foldPotential s s - foldPotential s (-s) = (2 * s) ^ 3" + }, + { + "kind": "theorem", + "unqualified_name": "ec008_factor_expansion", + "line": 18, + "source_header": "ing\n\n/-- EC-008: scalar polynomial companion for the planar collision-Gram determinant.\n This is not the matrix-construction theorem. -/\ntheorem ec008_factor_expansion (c s : ℝ) :\n 2 * s ^ 2 *\n ((s ^ 2 * (3 * c ^ 4 + 3 * c ^ 2 * s ^ 2 + s ^ 4) / 24) *\n (s ^ 2 * (4 * c ^ 2 + s ^ 2) / 2) -\n (-c * s ^ 2 * (2 * c ^ 2 + s ^ 2) / 4) ^ 2) =\n s ^ 8 * (c ^ 2 + s ^ 2) * (3 * c ^ 2 + s ^ 2)" + }, + { + "kind": "theorem", + "unqualified_name": "ec010_generic", + "line": 28, + "source_header": "ring\n\n/-- EC-010, generic chart: declared convex-combination polynomial identity. -/\ntheorem ec010_generic (α K c η : ℝ) :\n (K + 8 * α * c * η) ^ 2 + 64 * α * (1 - α) * c ^ 2 * η ^ 2 =\n (1 - α) * K ^ 2 + α * (K + 8 * c *" + }, + { + "kind": "theorem", + "unqualified_name": "ec010_transverse", + "line": 34, + "source_header": "ring\n\n/-- EC-010, transverse chart: declared convex-combination polynomial identity. -/\ntheorem ec010_transverse (α a η : ℝ) :\n (a + (1 - 2 * α) * η) ^ 2 + 4 * α * (1 - α) * η ^ 2 =\n (1 - α) * (a + η) ^ 2 + α * (a" + }, + { + "kind": "theorem", + "unqualified_name": "ec011_scalar_cancellation", + "line": 40, + "source_header": "by\n ring\n\n/-- EC-011: scalar cancellation companion to the adjoint-orbit calculation.\n It does not formalize the ODE, Hessian symmetry, or section normalization. -/\ntheorem ec011_scalar_cancellation (h w g : ℝ) :\n (-h * w) * g + w *" + }, + { + "kind": "theorem", + "unqualified_name": "ec014_contact_power", + "line": 46, + "source_header": "= by\n ring\n\n/-- EC-014: exact contact-power scalar identity for nonzero separation.\n It does not formalize the six-pin matrix determinant or density transform. -/\ntheorem ec014_contact_power (r : ℝ) (hr : r ≠ 0) :\n (r ^ 3 / 6) * (1 / r ^ 5) * r ^ 2" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:frontiers/determinant_moment_20261025", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "frontiers/determinant_moment_20261025", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1.lean", + "sha256": "15e6b160ea4dcd0b95d9bf56afe318d0292e2421659637cb6754e18eee1e4364", + "declarations_lexical": [] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/ProbabilityCompanionsV2.lean", + "sha256": "dbc42b17797be688fecec790f32fcfd0004d98ac776cbbe0471c62c3f506aa41", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "p02_lm008_r2_cancel", + "line": 11, + "source_header": "/-- P02-LM-008 algebraic companion: exact cancellation of the `r²` factor\n after the Cauchy–Schwarz numerator bound and the normalizer lower bound\n have been established in the surrounding probability theorem. -/\ntheorem p02_lm008_r2_cancel\n (r cW cZ q : ℝ) (hr : r ≠ 0) (hcZ : cZ ≠ 0) :\n (Real.sqrt cW * r ^ 2 * Real.sqrt q) / (cZ * r ^ 2) =\n (Real.sqrt cW / cZ) * Real.sqrt" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_cross_multiplied", + "line": 20, + "source_header": "]\n\n/-- P02-LM-008 cross-multiplied transfer companion. This theorem starts\n from an already supplied Cauchy–Schwarz numerator estimate and an exact\n normalizer lower bound. It does not formalize the measure-theoretic\n Cauchy–Schwarz step itself. -/\ntheorem p02_lm008_cross_multiplied\n (n z r cW cZ q : ℝ)\n (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)\n (hz : cZ * r ^ 2 ≤ z)\n (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n * (cZ * r ^ 2) ≤\n (Real.sqrt cW * r ^ 2 * Real.sqrt q)" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm008_quotient_bound", + "line": 42, + "source_header": "num\n\n/-- P02-LM-008 quotient companion. With positive denominators, the\n cross-multiplied inequality and exact `r²` cancellation yield the Palm\n square-root transfer coefficient. -/\ntheorem p02_lm008_quotient_bound\n (n z r cW cZ q : ℝ)\n (hr : 0 < r) (hcW : 0 ≤ cW) (hcZ : 0 < cZ) (hq : 0 ≤ q)\n (hzpos : 0 < z) (hz : cZ * r ^ 2 ≤ z)\n (hn : n ≤ Real.sqrt cW * r ^ 2 * Real.sqrt q) :\n n / z ≤ (Real.sqrt cW / cZ) * Real.s" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_bad_event_threshold", + "line": 58, + "source_header": "cross\n\n/-- P02-LM-009 deterministic threshold companion. Failure of\n `r * R^5 ≤ ε` implies the fifth-power threshold used before Markov's\n inequality. -/\ntheorem p02_lm009_bad_event_threshold\n (r R ε : ℝ) (hr : 0 < r) (hbad : ε < r * R ^ 5) :\n ε / r" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_power40_identity", + "line": 66, + "source_header": "g hbad)\n\n/-- The fixed exponent identity used when the 40th moment is selected in\n the P02-LM-009 application. -/\ntheorem p02_lm009_power40_identity (R : ℝ) :\n (R ^ 5) ^ 8" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_r4_le_r3", + "line": 72, + "source_header": "by\n ring\n\n/-- In the final P0.2 power ledger, an `O(r^4)` Palm tail is also `O(r^3)`\n on `0 ≤ r ≤ 1`. -/\ntheorem p02_lm009_r4_le_r3\n (r : ℝ) (hr0 : 0 ≤ r) (hr1 : r ≤ 1) :\n r" + }, + { + "kind": "theorem", + "unqualified_name": "p02_lm009_palm_r4_to_r3", + "line": 81, + "source_header": "nlinarith\n\n/-- Conditional rate companion: once the Palm square-root transfer has\n produced a uniform `C r^4` bound, the cubic target follows on `r ≤ 1`. -/\ntheorem p02_lm009_palm_r4_to_r3\n (p C r : ℝ) (hC : 0 ≤ C) (hr0 : 0 ≤ r) (hr1 : r ≤ 1)\n (hp : p ≤ C * r ^ 4) :" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizerLimit.lean", + "sha256": "12c98054b5bcf47f4619c624ef5e91c37f316d7c4848f560279d1f1e96fe0049", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "gnl_contact_relations", + "line": 21, + "source_header": "e\n\nprivate theorem gnl_contact_relations (m : EuclideanSpace ℝ (Fin 6)) (S : Matrix (Fin 6) (Fin 6) ℝ)\n (hS : S.PosSemidef)\n (hm0 : m 0 = -1) (hm1 : m 1 = 1)\n (hm23 : m 2 + m 3 = 0) (hm45 : m 4 - m 5 = 0)\n (hS0 : S 0 0 = 0) (hS1 : S 1 1 = 0)\n (hS23 : S 2 2 + 2*S 2 3 + S 3 3 = 0)\n (hS45 : S 4 4 - 2*S 4 5 + S 5 5 = 0) :\n ∀ᵐ x ∂multivariateGaussian m S,\n x 0 = -1 ∧ x 1 = 1 ∧ x 2 + x 3 = 0 ∧ x 4 - x 5 =" + }, + { + "kind": "lemma", + "unqualified_name": "gnl_positivePart_memLp", + "line": 64, + "source_header": "⟩\n\nprivate lemma gnl_positivePart_memLp {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {f : Ω → ℝ} {p : ℝ≥0∞} (hf : MemLp f p P) :\n MemLp (fun x => max (f x) 0) p" + }, + { + "kind": "lemma", + "unqualified_name": "gnl_gaussian_weight_integrable", + "line": 72, + "source_header": ")\n\nprivate lemma gnl_gaussian_weight_integrable (r : ℝ) (m : EuclideanSpace ℝ (Fin 6))\n (S : Matrix (Fin 6) (Fin 6) ℝ) (hS : S.PosSemidef) :\n Integrable (fun x : EuclideanSpace ℝ (Fin 6) => gn_normalizedWeight r (ofLp x))\n (multivariateGaussian m S" + }, + { + "kind": "theorem", + "unqualified_name": "gnl_normalizer_floor_of_parameter_limits", + "line": 105, + "source_header": "T\n\n\n/-- Gaussian endpoint parameter convergence and concrete contact moments supply\none positive physical normalizer coefficient at every sufficiently small radius.\nThe covariance may be singular; the transverse reference mean is unrestricted. -/\ntheorem gnl_normalizer_floor_of_parameter_limits\n (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)\n (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)\n (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))\n (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))\n (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)\n (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)\n (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)\n (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)\n (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)\n (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤\n ∫ x : EuclideanSpace ℝ (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)\n ∂multivariateGaussian (m r) (S" + }, + { + "kind": "theorem", + "unqualified_name": "gnl_physical_normalizer_floor_of_parameter_limits", + "line": 174, + "source_header": "op)\n\n\n/-- The same Gaussian parameter limit gives the full literal typed endpoint\nnormalizer, after the explicit permutation back to physical endpoint order. -/\ntheorem gnl_physical_normalizer_floor_of_parameter_limits\n (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)\n (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)\n (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))\n (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))\n (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)\n (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)\n (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)\n (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)\n (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)\n (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤\n ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]\n ∂multivariateGaussian (m r)" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointNormalizerBridge.lean", + "sha256": "36eab3b805fcba5160cb7e286dbd7f96940b0c6a85b464aad5fdad2f624ceb7e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "enb_permutation", + "line": 19, + "source_header": "e\n\n/-- Convert the actual six endpoint entries to the continuous weight's order. -/\ndef enb_permutation (j : Fin 6 → ℝ) : Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "enb_permutation_continuous", + "line": 23, + "source_header": "5]\n\ntheorem enb_permutation_continuous : Continuous enb_permutat" + }, + { + "kind": "theorem", + "unqualified_name": "enb_maximum_factor", + "line": 27, + "source_header": "rop\n\nprivate theorem enb_maximum_factor (r a b c : ℝ) (hr : 0 < r) :\n max (max (-a) 0 * max (-c) 0 - r * b ^ 2) 0 =\n if a < 0 ∧ 0 < a * c - r * b ^ 2 then a * c - r * b ^ 2 els" + }, + { + "kind": "theorem", + "unqualified_name": "enb_maximum_iff", + "line": 53, + "source_header": ")))\n\n/-- Strict negative definiteness in actual endpoint coordinates, with no\nassumed sign of the other diagonal entry or omission of singular boundaries. -/\ntheorem enb_maximum_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n dm2Negative (egm_HM r j) ↔ j 0 < 0 ∧ 0 < j 0 * j 2 - r * j" + }, + { + "kind": "theorem", + "unqualified_name": "enb_saddle_iff", + "line": 64, + "source_header": "t hr]\n\n/-- The literal strict saddle condition is the sign of its factored determinant. -/\ntheorem enb_saddle_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n (egm_HS r j).det < 0 ↔ j 3 * j 5 - r * j 4" + }, + { + "kind": "theorem", + "unqualified_name": "enb_weight_identity", + "line": 73, + "source_header": "inarith\n\n/-- Exact bridge from the literal typed physical endpoint weight to the\ncontinuous expression. All excluded types and all zero boundaries give zero. -/\ntheorem enb_weight_identity (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n egm_weight r j = r ^ 2 * gn_normalizedWeight r (enb_permu" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integral_identity", + "line": 109, + "source_header": "ring\n\n/-- The physical and continuous normalizers are the same integral up to the\nexact radius factor, for any common random six-vector and any measure. -/\ntheorem enb_integral_identity {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :\n (∫ ω, egm_weight r (J ω) ∂P) =\n r ^ 2 * ∫ ω, gn_normalizedWeight r (enb_permutatio" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integrable_iff", + "line": 120, + "source_header": "nst_mul _ _\n\n/-- Positive radius makes the exact scaling nonzero, so either weight is\nintegrable precisely when the other is. -/\ntheorem enb_integrable_iff {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :\n Integrable (fun ω => egm_weight r (J ω)) P ↔\n Integrable (fun ω => gn_normalizedWeight r (enb_permutat" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integrable_of_integrable_sq", + "line": 131, + "source_header": "o 2 hr.ne'))]\n\n/-- On a finite measure, the actual endpoint second-moment theorem supplies\nthe first-moment hypotheses needed by the normalizer join. -/\ntheorem enb_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsFiniteMeasure P]\n (J : Ω → Fin 6 → ℝ) (hJ : Measurable J) (r : ℝ) (hr : 0 < r)\n (hsq : Integrable (fun ω => egm_weight r (J ω) ^ 2) P) :\n Integrable (fun ω => egm_weight r (J ω)) P ∧\n Integrable (fun ω => gn_normalizedWeight r (enb_permut" + }, + { + "kind": "theorem", + "unqualified_name": "enb_normalizer_floor_of_common_coupling", + "line": 149, + "source_header": ").mp hphysical⟩\n\n/-- The proved common-coupling normalizer floor transfers to the literal\nphysical endpoint weight, with its own actual coordinate order. Current\nphysical integrability and the conditioned-field convergence remain inputs. -/\ntheorem enb_normalizer_floor_of_common_coupling\n {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P]\n (J : ℝ → Ω → Fin 6 → ℝ) (hJ : ∀ r, Measurable (J r))\n (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => J r ω) (𝓝[>] (0 : ℝ))\n (𝓝 ![-1,-A ω/2,Q ω,1,A ω/2,Q ω]))\n (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),\n Integrable (fun ω => egm_weight r (J r ω)) P) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n c * r ^ 2 ≤ ∫ ω, egm_we" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/EndpointGaussianMoments.lean", + "sha256": "c6351881326491ce30f1a266ea60e44c5adb8b3a1e5882c90575c67e459479d1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "egm_HM", + "line": 13, + "source_header": "e\n\ndef egm_HM (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2)" + }, + { + "kind": "def", + "unqualified_name": "egm_HS", + "line": 16, + "source_header": "]\n\ndef egm_HS (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2)" + }, + { + "kind": "def", + "unqualified_name": "egm_weight", + "line": 19, + "source_header": "]\n\nnoncomputable def egm_weight (r : ℝ) (j : Fin 6 → ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "egm_weight_measurable", + "line": 24, + "source_header": "0\n\n/-- The maximum condition is the original strict quadratic-form condition;\nno null-boundary assumption is needed for measurable typing. -/\ntheorem egm_weight_measurable (r : ℝ) : Measurable (egm_weight" + }, + { + "kind": "theorem", + "unqualified_name": "egm_coordinate_bound", + "line": 49, + "source_header": "nst\n\nprivate theorem egm_coordinate_bound (j : Fin 6 → ℝ) (i : Fin 6) :\n |j i| ≤ gm8Radiu" + }, + { + "kind": "theorem", + "unqualified_name": "egm_factor_bound", + "line": 56, + "source_header": "ith\n\nprivate theorem egm_factor_bound (r a b c R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)\n (hR : 0 ≤ R) (ha : |a| ≤ R) (hb : |b| ≤ R) (hc : |c| ≤ R) :\n |a * c - r * b ^ 2| ≤ 2 * R" + }, + { + "kind": "theorem", + "unqualified_name": "egm_untyped", + "line": 68, + "source_header": "th)\n\nprivate theorem egm_untyped (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :\n ((egm_HM r j).det * (egm_HS r j).det) ^ 2 ≤\n 16 * r ^ 4 * gm8Radius j" + }, + { + "kind": "theorem", + "unqualified_name": "egm_pointwise", + "line": 97, + "source_header": "ing\n\n/-- Exact endpoint determinant domination in the actual normalized six-vector.\nThe type indicators can only reduce the nonnegative determinant product. -/\ntheorem egm_pointwise (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :\n egm_weight r j ^ 2 ≤ 16 * r ^ 4 * gm8Radius" + }, + { + "kind": "theorem", + "unqualified_name": "egm_gaussian_moment", + "line": 108, + "source_header": "vity)\n\n/-- Genuine Gaussian marginal laws of the actual normalized endpoint vector\nsupply both integrability and its determinant second moment. The derivative-map,\nconditioning law and uniform parameter bounds remain explicit model inputs. -/\ntheorem egm_gaussian_moment {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin 6 → ℝ)\n (hJ : Measurable J) (m : Fin 6 → ℝ) (v : Fin 6 → ℝ≥0)\n (B V r : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V) (hr : 0 < r) (hr1 : r ≤ 1)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => egm_weight r (J x) ^ 2) μ ∧\n (∫ x, egm_weight r (J x) ^ 2 ∂μ) ≤ 16 * gm8FiniteM8 6 B V" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/PalmReweighting.lean", + "sha256": "d34e422693f1d449bfcaf9c844c99c8fef4f19503312d3677ca525bd2d67c4d6", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "prwMeasure", + "line": 26, + "source_header": "e\n\n/-- The literal normalized nonnegative real density, defined for every input. -/\nnoncomputable def prwMeasure {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) : Measur" + }, + { + "kind": "theorem", + "unqualified_name": "prw_integrable_of_integrable_sq", + "line": 31, + "source_header": "μ))\n\n/-- On a finite measure, a measurable square-integrable real weight is integrable. -/\ntheorem prw_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hsq : Integrable (fun ω => W ω ^ 2) μ) : Integrabl" + }, + { + "kind": "theorem", + "unqualified_name": "prw_measure_apply", + "line": 42, + "source_header": "W ω)]\n\n/-- The actual event mass is the normalized set integral, in extended reals. -/\ntheorem prw_measure_apply {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n prwMeasure μ W E = ENNReal.ofReal ((∫ x in E, W x ∂μ) / ∫ x," + }, + { + "kind": "theorem", + "unqualified_name": "prw_isProbabilityMeasure", + "line": 55, + "source_header": "al_div]\n\n/-- Positive finite normalizer makes the literal density a probability law. -/\ntheorem prw_isProbabilityMeasure {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ) :\n IsProbabilityMeasure (prwMea" + }, + { + "kind": "theorem", + "unqualified_name": "prw_measure_real", + "line": 64, + "source_header": "[hZ.ne']\n\n/-- The event identity is proved for the constructed law, not assumed. -/\ntheorem prw_measure_real {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n (prwMeasure μ W).real E = (∫ x in E, W x ∂μ) /" + }, + { + "kind": "theorem", + "unqualified_name": "prw_numerator_bound", + "line": 73, + "source_header": "W0) hZ.le)]\n\n/-- Integral Cauchy–Schwarz against the event indicator, including null events. -/\ntheorem prw_numerator_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n (∫ x in E, W x ∂μ) ≤\n Real.sqrt (∫ x, W x ^ 2 ∂μ) * Real.sq" + }, + { + "kind": "theorem", + "unqualified_name": "prw_square_root_event_bound", + "line": 105, + "source_header": "ow] using hCS\n\n/-- The exact `r^4` second moment and `r^2` normalizer cancel in the literal\nweighted probability. No event probability is assumed positive. -/\ntheorem prw_square_root_event_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)\n (C c r : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)\n (hmoment : (∫ x, W x ^ 2 ∂μ) ≤ C * r ^ 4)\n (hfloor : c * r ^ 2 ≤ ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n IsProbabilityMeasure (prwMeasure μ W) ∧\n (prwMeasure μ W).real E ≤ (Real.sqrt C / c) * Real." + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianJetMoments.lean", + "sha256": "f2e785975aee6915848fe78dc3ecde02b8f13a0a1fb56ae3771e4c727c723360", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gm8Radius", + "line": 12, + "source_header": "/-- Radius for a finite vector, including its constant one. -/\ndef gm8Radius {n : ℕ} (j : Fin n → ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "gm8FiniteM8", + "line": 15, + "source_header": "|\n\n/-- One finite-dimensional Gaussian radius moment constant. -/\nnoncomputable def gm8FiniteM8 (n : ℕ) (B V : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "gm8FiniteM8_nonneg", + "line": 19, + "source_header": "8))\n\ntheorem gm8FiniteM8_nonneg (n : ℕ) (B V : ℝ) : 0 ≤ gm8FiniteM8 n" + }, + { + "kind": "def", + "unqualified_name": "gm8M8", + "line": 24, + "source_header": "ity\n\n/-- The source's exact fixed nine-coordinate constant. -/\nnoncomputable def gm8M8 (B V : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "gm8M8_nonneg", + "line": 28, + "source_header": "8C8))\n\ntheorem gm8M8_nonneg (B V : ℝ) : 0 ≤ gm8M" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_finite_radius_power_bound", + "line": 31, + "source_header": "9 B V\n\ntheorem gm8_finite_radius_power_bound (n : ℕ) (j : Fin n → ℝ) :\n gm8Radius j ^ 8 ≤ ((n+1 : ℕ) : ℝ)^7 * (1 + ∑ i, |j" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_finite_integrable_bound", + "line": 41, + "source_header": "ing h\n\ntheorem gm8_finite_integrable_bound (n : ℕ) {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin n → ℝ)\n (hJ : Measurable J) (m : Fin n → ℝ) (v : Fin n → ℝ≥0)\n (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => gm8Radius (J x)^8) μ ∧\n (∫ x, gm8Radius (J x)^8 ∂μ) ≤ gm8FiniteM8" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_radius_power_bound", + "line": 82, + "source_header": "ssoc]\n\n/-- The exact DM2 radius is the nine-dimensional specialization. -/\ntheorem gm8_radius_power_bound (j : DM2Jet) :\n dm2Radius j ^ 8 ≤ (10 : ℝ)^7 * (1 + ∑ i, |" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_jet_integrable_bound", + "line": 87, + "source_header": "und 9 j\n\n/-- The nine-jet Gaussian marginal moment interface, with no independence or\nmoment conclusion assumed. -/\ntheorem gm8_jet_integrable_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → DM2Jet)\n (hJ : Measurable J) (m : Fin 9 → ℝ) (v : Fin 9 → ℝ≥0)\n (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => dm2Radius (J x)^8) μ ∧\n (∫ x, dm2Radius (J x)^8 ∂μ) ≤" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_family_weight_moment", + "line": 100, + "source_header": "hvar hlaw\n\n/-- The same B,V give one determinant second-moment coefficient throughout\n0 J r x i) (gaussianReal (m r i) (v r i)) (μ r)) :\n 0 ≤ 16*gm8M8 B V ∧ ∀ r, 0 < r → r ≤ r0 →\n Integrable (fun x => dm2Weight r (J r x)^2) (μ r) ∧\n (∫ x, dm2Weight r (J r x)^2 ∂μ r) ≤ (16*gm8" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianRegressionKernel.lean", + "sha256": "66d4fbee044a1a0c0b434bcd7614e220fad21d1ac275ce9b01070a66c5780460", + "declarations_lexical": [ + { + "kind": "lemma", + "unqualified_name": "regression_compProd_id_const", + "line": 28, + "source_header": "1\n\n/-- Copying the first coordinate and retaining an independent second coordinate. -/\nlemma regression_compProd_id_const {α β : Type*} [MeasurableSpace α] [MeasurableSpace β]\n (μ : Measure α) (ν : Measure β) [SFinite μ] [SFinite ν] :\n μ ⊗ₘ (Kernel.id ×ₖ Kernel.const α ν) =\n (μ.prod ν).map (fun p : α × β => (p.1," + }, + { + "kind": "lemma", + "unqualified_name": "regression_pair_hasCondDistrib", + "line": 41, + "source_header": "rfl\n\n/-- An independent residual paired with the observation has the explicit product kernel. -/\nlemma regression_pair_hasCondDistrib {Ω α β : Type*} [MeasurableSpace Ω]\n [MeasurableSpace α] [MeasurableSpace β] {P : Measure Ω} [IsProbabilityMeasure P]\n {X : Ω → α} {R : Ω → β} (hX : AEMeasurable X P) (hR : AEMeasurable R P)\n (hXR : IndepFun X R P) :\n HasCondDistrib (fun ω => (X ω, R ω)) X\n (Kernel.id ×ₖ Kernel.const α (P.map" + }, + { + "kind": "def", + "unqualified_name": "regressionReconstruction", + "line": 59, + "source_header": ".symm\n\n\n/-- Affine reconstruction of the target from the observation and the regression residual. -/\ndef regressionReconstruction {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (p : (Fin n → ℝ) × (Fin k → ℝ)) : Fi" + }, + { + "kind": "lemma", + "unqualified_name": "regressionReconstruction_measurable", + "line": 66, + "source_header": "1 - mX)\n\nlemma regressionReconstruction_measurable {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Measurable (regressionReconstruction B" + }, + { + "kind": "def", + "unqualified_name": "regressionKernel", + "line": 72, + "source_header": "un_prop\n\n/-- The canonical regression law is specified at every observation, including null pins. -/\nnoncomputable def regressionKernel {n k : ℕ} (ν : Measure (Fin k → ℝ))\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Kernel (Fin n → ℝ) (F" + }, + { + "kind": "instance", + "unqualified_name": "regressionKernel_isMarkov", + "line": 79, + "source_header": "B mX mY)\n\ninstance regressionKernel_isMarkov {n k : ℕ} (ν : Measure (Fin k → ℝ))\n [IsProbabilityMeasure ν] (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ))\n (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n IsMarkovKernel (regressionKernel ν" + }, + { + "kind": "lemma", + "unqualified_name": "regressionKernel_apply", + "line": 86, + "source_header": "B mX mY)\n\nlemma regressionKernel_apply {n k : ℕ} (ν : Measure (Fin k → ℝ)) [SFinite ν]\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (x : Fin n → ℝ) :\n regressionKernel ν B mX mY x = ν.map (fun r => r + mY + B" + }, + { + "kind": "lemma", + "unqualified_name": "independentResidual_hasCondDistrib", + "line": 95, + "source_header": "p)]\n rfl\n\n/-- Affine reconstruction from an independent residual has the canonical conditional kernel. -/\nlemma independentResidual_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}\n {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hX : AEMeasurable X P) (hR : AEMeasurable R P) (hXR : IndepFun X R P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P.map R)" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_hasCondDistrib", + "line": 106, + "source_header": "le B mX mY)\n\n/-- Joint Gaussianity and vanishing observation/residual cross-covariance give the canonical\nconditional law, without choosing an almost-everywhere version at a prescribed observation. -/\ntheorem gaussianRegression_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)\n (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P.map" + }, + { + "kind": "lemma", + "unqualified_name": "regressionKernel_measurable", + "line": 119, + "source_header": "zero) B mX mY\n\n/-- Kernel measurability is pointwise in the observation and does not require a Gaussian law. -/\nlemma regressionKernel_measurable {n k : ℕ} (ν : Measure (Fin k → ℝ))\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Measurable (regressionKe" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegressionKernel_spec", + "line": 125, + "source_header": "el.measurable _\n\n/-- All parts of the canonical Gaussian conditional-law construction, including the literal\npushforward at every prescribed observation. Zero-dimensional and degenerate laws are allowed. -/\ntheorem gaussianRegressionKernel_spec {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)\n (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n IsMarkovKernel (regressionKernel (P.map R) B mX mY) ∧\n Measurable (regressionKernel (P.map R) B mX mY) ∧\n (∀ x, regressionKernel (P.map R) B mX mY x =\n (P.map R).map (fun r => r + mY + B (x - mX))) ∧\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P." + }, + { + "kind": "lemma", + "unqualified_name": "regression_map_coordinate", + "line": 142, + "source_header": "XR hzero B mX mY⟩\n\n/-- Coordinates of a finite-vector continuous linear map in the standard basis. -/\nlemma regression_map_coordinate {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (v : Fin n → ℝ) (j : Fin k) :\n B v j = ∑ l, B (Pi." + }, + { + "kind": "lemma", + "unqualified_name": "regression_covariance_map", + "line": 152, + "source_header": "[map_sum, mul_comm]\n\n/-- The covariance of a centered finite-vector linear predictor is its normal-equation sum. -/\nlemma regression_covariance_map {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}\n {X : Ω → Fin n → ℝ} (hX : HasGaussianLaw X P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ)\n (i : Fin n) (j : Fin k) :\n covariance (fun ω => X ω i) (fun ω => B (X ω - mX) j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω" + }, + { + "kind": "lemma", + "unqualified_name": "regression_residual_zero_covariance", + "line": 172, + "source_header": "(hX.eval i).memLp_two\n\n/-- The actual regression residual has zero observation cross-covariance by the normal equations. -/\nlemma regression_residual_zero_covariance {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n ∀ i j, covariance (fun ω => X ω i)\n (fun ω => (Y ω - mY -" + }, + { + "kind": "lemma", + "unqualified_name": "regression_residual_jointGaussian", + "line": 198, + "source_header": "hnormal i j, sub_self]\n\n/-- The observation and the actual affine residual are jointly Gaussian. -/\nlemma regression_residual_jointGaussian {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} {n k : ℕ}\n {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasGaussianLaw (fun ω => (X ω, Y" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_observed_hasCondDistrib", + "line": 227, + "source_header": "rw [map_sub]\n abel\n\n\n\n/-- The actual target has the explicit regression conditional law when the coefficient map\nsatisfies the coordinate normal equations. The residual hypotheses are derived. -/\ntheorem gaussianRegression_observed_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n HasCondDistrib Y X\n (regressionKernel (P.map (fun ω => Y ω - mY" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_observed_spec", + "line": 246, + "source_header": "d using 1\n funext ω\n abel\n\n/-- The canonical conditional-law specification for the actual jointly Gaussian target.\nThe residual Gaussianity and its zero cross-covariance are conclusions of the construction. -/\ntheorem gaussianRegression_observed_spec {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n IsMarkovKernel\n (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧\n Measurable\n (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧\n (∀ x, regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY x =\n (P.map (fun ω => Y ω - mY - B (X ω - mX))).map\n (fun r => r + mY + B (x - mX))) ∧\n HasCondDistrib Y X\n (regressionKernel (P.map (fun ω => Y ω - m" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianCoupling.lean", + "sha256": "426a53c139215650e961601c12f3cc1e09069520c5ebb96234a29483280551bb", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "gc_matrix_eval_tendsto", + "line": 18, + "source_header": "e\n\nprivate theorem gc_matrix_eval_tendsto {ι R : Type*} [Fintype ι] [DecidableEq ι]\n {u : Filter R} {S : R → Matrix ι ι ℝ} {S0 : Matrix ι ι ℝ}\n (hS : Tendsto S u (𝓝 S0)) (z : EuclideanSpace ℝ ι) :\n Tendsto (fun r => Matrix.toEuclideanCLM (" + }, + { + "kind": "def", + "unqualified_name": "gc_coupledVector", + "line": 35, + "source_header": "c\n\n/-- The canonical affine vector on one common standard Gaussian space. -/\nnoncomputable def gc_coupledVector {ι : Type*} [Fintype ι] [DecidableEq ι]\n (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) (z : EuclideanSpace ℝ ι) :\n EuclideanSpace" + }, + { + "kind": "theorem", + "unqualified_name": "gc_coupledVector_hasLaw", + "line": 40, + "source_header": ") z\n\n/-- Exact marginal law; this is the pinned multivariateGaussian definition. -/\ntheorem gc_coupledVector_hasLaw {ι : Type*} [Fintype ι] [DecidableEq ι]\n (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) :\n HasLaw (gc_coupledVector m S) (multivariateGaussian m S)\n (stdGaussian (EuclideanSpace ℝ ι)) where\n aemeasu" + }, + { + "kind": "theorem", + "unqualified_name": "gc_coupledVector_tendsto", + "line": 48, + "source_header": "= rfl\n\n/-- Every common Gaussian coordinate converges when means and PSD covariances\nconverge. No invertibility, fixed rank, or square-root Lipschitz estimate. -/\ntheorem gc_coupledVector_tendsto {ι κ : Type*} [Fintype ι] [DecidableEq ι]\n (u : Filter κ) (m : κ → EuclideanSpace ℝ ι) (S : κ → Matrix ι ι ℝ)\n (m0 : EuclideanSpace ℝ ι) (S0 : Matrix ι ι ℝ)\n (hm : Tendsto m u (𝓝 m0)) (hS : Tendsto S u (𝓝 S0))\n (hPSD : ∀ᶠ t in u, (S t).PosSemidef) (hPSD0 : S0.PosSemidef)\n (z : EuclideanSpace ℝ ι) :\n Tendsto (fun t => gc_coupledVector (m t) (S t) z) u\n (𝓝 (gc_coupledVector m0" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianNormalizer.lean", + "sha256": "32b7202cba2a9a0e0ed603d1a6db9ba2031714375b4e955614d5a40826a14aeb", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gn_normalizedWeight", + "line": 24, + "source_header": "e\n\n/-- The six coordinates are aM,aS,bM,bS,cM,cS. For physical positive radius,\nthe source identifies this continuous expression with its typed W_r/r². -/\nnoncomputable def gn_normalizedWeight (r : ℝ) (v : Fin 6 → ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "gn_gaussian_reference_integrable_pos", + "line": 30, + "source_header": ") 0\n\n/-- The contact negative-curvature reference has an integrable, strictly\npositive squared negative part, with arbitrary mean and nonzero variance. -/\ntheorem gn_gaussian_reference_integrable_pos (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0) :\n Integrable (fun q : ℝ => (max (-q) 0)^2) (gaussianReal m v) ∧\n 0 < ∫ q : ℝ, (max (-q) 0)^2 ∂gaussianRea" + }, + { + "kind": "theorem", + "unqualified_name": "gn_open_box_floor", + "line": 67, + "source_header": "hmass\n\n/-- An explicit open endpoint box has a uniform positive normalized weight.\nThis is a pointwise component, with no claimed probability mass for the box. -/\ntheorem gn_open_box_floor\n (r K : ℝ) (v : Fin 6 → ℝ)\n (hr : 0 ≤ r) (hK : 0 < K) (hsmall : r * K^2 ≤ 1/4)\n (haM : v 0 ∈ Set.Ioo (-5/4) (-3/4))\n (haS : v 1 ∈ Set.Ioo (3/4) (5/4))\n (hbM : |v 2| < K) (_hbS : |v 3| < K)\n (hcM : v 4 ∈ Set.Ioo (-2) (-1))\n (hcS : v 5 ∈ Set.Ioo (-2) (-1)) :\n (3 : ℝ)/8 ≤ gn_normalizedWei" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/GaussianScalarMoments.lean", + "sha256": "71ce88ad2c97891858a5196f3293907bdffdd2341dfbace24204f2318c7510df", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gm8C8", + "line": 16, + "source_header": "e\n\nnoncomputable def gm8C8 :" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_standard_integrable", + "line": 18, + "source_header": "1\n\ntheorem gm8_standard_integrable :\n Integrable (fun z : ℝ => |z| ^ 8) (gaussianReal 0 1" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_standard_nonneg", + "line": 24, + "source_header": ")\n\ntheorem gm8_standard_nonneg : 0 ≤ gm8C" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_integrable", + "line": 27, + "source_header": ")\n\nprivate theorem gm8_integrable (m : ℝ) (v : ℝ≥0) :\n Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_sqrt_pow", + "line": 33, + "source_header": ")\n\nprivate theorem gm8_sqrt_pow (V : ℝ) (hV : 0 ≤ V) :\n (Real.sqrt V) ^ 8 = V ^" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_affine_map", + "line": 39, + "source_header": "]\n\nprivate theorem gm8_affine_map (m : ℝ) (v : ℝ≥0) :\n (gaussianReal 0 1).map (fun z : ℝ => m + Real.sqrt (v : ℝ) * z) =\n gaussianReal m" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_affine_bound", + "line": 54, + "source_header": "y\n\nprivate theorem gm8_affine_bound (m B V : ℝ) (v : ℝ≥0) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) (z : ℝ) :\n |m + Real.sqrt (v : ℝ) * z| ^ 8 ≤ 128 * (B ^ 8 + V ^ 4 * |z| ^ 8" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_scalar_integrable_bound", + "line": 72, + "source_header": "]\n\n/-- Bounded means and variances give a uniform eighth-moment bound, including\nzero variance and nonzero means. No eighth-moment hypothesis is assumed. -/\ntheorem gm8_scalar_integrable_bound (m B V : ℝ) (v : ℝ≥0)\n (hB : 0 ≤ B) (hV : 0 ≤ V) (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) :\n Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v) ∧\n (∫ x : ℝ, |x| ^ 8 ∂gaussianReal m v) ≤\n 128 * (B ^ 8 + V ^ 4 * gm8" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/NormalizerFloor.lean", + "sha256": "428eefd71b8c64fc4bcb208d9f73658058f29765f01a01c591f20a2d2359ec3e", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "nfloor_eventually_lower_of_fatou", + "line": 23, + "source_header": "e\n\nprivate theorem nfloor_eventually_lower_of_fatou {Ω ι : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (u : Filter ι) [IsCountablyGenerated u] [NeBot u]\n (f : ι → Ω → ℝ) (g : Ω → ℝ)\n (hmeas : ∀ r, Measurable (f r))\n (hnonneg : ∀ r ω, 0 ≤ f r ω)\n (hg : Integrable g P) (hgpos : 0 < ∫ ω, g ω ∂P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => f r ω) u (𝓝 (g ω)))\n (hfint : ∀ᶠ r in u, Integrable (f r) P) :\n ∀ᶠ r in u, (∫ ω, g ω ∂P)/2 ≤ ∫ ω, f r ω ∂" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_weight_continuous", + "line": 52, + "source_header": "e\n\nprivate theorem nfloor_weight_continuous :\n Continuous (fun p : ℝ × (Fin 6 → ℝ) => gn_normalizedWeight p.1 p.2" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_contact_value", + "line": 57, + "source_header": "p\nprivate theorem nfloor_contact_value (a q : ℝ) :\n gn_normalizedWeight 0 ![-1,1,-a/2,a/2,q,q] = (max (-q) 0)^" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_weight_limit", + "line": 60, + "source_header": "]\nprivate theorem nfloor_weight_limit (X : ℝ → Fin 6 → ℝ) (a q : ℝ)\n (hX : Tendsto X (𝓝[>] (0:ℝ)) (𝓝 ![-1,1,-a/2,a/2,q,q])) :\n Tendsto (fun r => gn_normalizedWeight r (X r)) (𝓝[>] (0:ℝ))\n (𝓝 ((max (-q) 0)^2)" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_reference", + "line": 68, + "source_header": ")\nprivate theorem nfloor_reference {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hlaw : HasLaw Q (gaussianReal m v) P) :\n Integrable (fun ω => (max (-Q ω) 0)^2) P ∧\n 0 < ∫ ω, (max (-Q ω) 0)^2 ∂" + }, + { + "kind": "theorem", + "unqualified_name": "gn_normalizer_floor_of_common_coupling", + "line": 78, + "source_header": "s\n\n/-- The actual integral of the physical r²-scaled continuous endpoint weight\nhas a positive lower constant at every sufficiently small positive radius.\nThe common coupling and current integrability are explicit premises; its\npositive reference integral and the lower bound are proved, not premises. -/\ntheorem gn_normalizer_floor_of_common_coupling\n {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P]\n (X : ℝ → Ω → Fin 6 → ℝ) (hX : ∀ r, Measurable (X r))\n (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => X r ω) (𝓝[>] (0 : ℝ))\n (𝓝 ![-1,1,-A ω/2,A ω/2,Q ω,Q ω]))\n (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),\n Integrable (fun ω => gn_normalizedWeight r (X r ω)) P) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n c * r^2 ≤ ∫ ω, r^2 * gn_normalizedWeight r (X r ω)" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/DeterminantMoment.lean", + "sha256": "661b73c3f21c6d2529f5e09ce426d89c01939ab27a5cc868db3802c7e66ea82d", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "DM2Jet", + "line": 20, + "source_header": "abbrev DM2Jet" + }, + { + "kind": "def", + "unqualified_name": "dm2Radius", + "line": 22, + "source_header": "def dm2Radius (j : DM2Jet) : ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2HM", + "line": 24, + "source_header": "noncomputable def dm2HM (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2HS", + "line": 28, + "source_header": "noncomputable def dm2HS (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2Negative", + "line": 32, + "source_header": "/-- The source's negative-definite condition, stated as the quadratic form. -/\ndef dm2Negative (H : Matrix (Fin 2) (Fin 2) ℝ) : Pro" + }, + { + "kind": "def", + "unqualified_name": "dm2Weight", + "line": 36, + "source_header": "0\n\nnoncomputable def dm2Weight (r : ℝ) (j : DM2Jet) :" + }, + { + "kind": "lemma", + "unqualified_name": "dm2_scale", + "line": 41, + "source_header": "0\n\nprivate lemma dm2_scale (r x : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1) :\n |r*x| ≤ |x" + }, + { + "kind": "lemma", + "unqualified_name": "dm2_factors", + "line": 46, + "source_header": "]\n\nprivate lemma dm2_factors (r A B C R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)\n (hR : 0 ≤ R) (hA : |A| ≤ R) (hB : |B| ≤ R) (hC : |C| ≤ R) :\n |A*C-r*B^2| ≤ 2*R^" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_untyped", + "line": 58, + "source_header": ")\n\n/-- Exact untyped determinant domination; no jet-coordinate or type assumptions. -/\ntheorem dm2_untyped (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :\n ((dm2HM r j).det * (dm2HS r j).det)^2 ≤ 16*r^4*dm2Radius" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_pointwise", + "line": 127, + "source_header": "ing\n\n/-- P02-LM-002 section 2, with the literal quadratic-form type indicator. -/\ntheorem dm2_pointwise (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :\n dm2Weight r j ^ 2 ≤ 16*r^4*dm2Radiu" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_negative_iff", + "line": 137, + "source_header": "vity)\n\n/-- Two-dimensional Sylvester criterion for the literal quadratic-form definition. -/\ntheorem dm2_negative_iff (a b c : ℝ) :\n dm2Negative !![a,b;b,c] ↔ a < 0 ∧ 0 <" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_weight_measurable", + "line": 170, + "source_header": "inarith\n\n/-- Measurability of the exact typed weight, with no assumed type-null boundary. -/\ntheorem dm2_weight_measurable (r : ℝ) : Measurable (dm2" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_moment", + "line": 191, + "source_header": "ble_const\n\n/-- P02-LM-002's expectation step: eighth-moment control supplies integrability\nand the second moment, rather than presupposing that second moment. -/\ntheorem dm2_moment {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω)\n (J : Ω → DM2Jet) (hJ : Measurable J) (r M8 : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)\n (h8 : MeasureTheory.Integrable (fun x => dm2Radius (J x)^8) μ)\n (hM8 : (∫ x, dm2Radius (J x)^8 ∂μ) ≤ M8) :\n MeasureTheory.Integrable (fun x => dm2Weight r (J x)^2) μ ∧\n (∫ x, dm2Weight r (J x)^2 ∂μ)" + } + ] + }, + { + "path": "frontiers/determinant_moment_20261025/ResearchFormalCoreR1/AlgebraV2.lean", + "sha256": "71e4327df9f7d6979f1467f7e0d880e0ab0a70ab6d234802d8c7a1624b9ce2d9", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "foldPotential", + "line": 9, + "source_header": "/-- Canonical A₂ normal-form potential, parameterized by `s` with λ = s². -/\nnoncomputable def foldPotential (s x : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "ec005_fold_gap", + "line": 12, + "source_header": "x\n\n/-- EC-005: exact canonical fold-gap identity in the normalized coordinate. -/\ntheorem ec005_fold_gap (s : ℝ) :\n foldPotential s s - foldPotential s (-s) = (2 * s) ^ 3" + }, + { + "kind": "theorem", + "unqualified_name": "ec008_factor_expansion", + "line": 18, + "source_header": "ing\n\n/-- EC-008: scalar polynomial companion for the planar collision-Gram determinant.\n This is not the matrix-construction theorem. -/\ntheorem ec008_factor_expansion (c s : ℝ) :\n 2 * s ^ 2 *\n ((s ^ 2 * (3 * c ^ 4 + 3 * c ^ 2 * s ^ 2 + s ^ 4) / 24) *\n (s ^ 2 * (4 * c ^ 2 + s ^ 2) / 2) -\n (-c * s ^ 2 * (2 * c ^ 2 + s ^ 2) / 4) ^ 2) =\n s ^ 8 * (c ^ 2 + s ^ 2) * (3 * c ^ 2 + s ^ 2)" + }, + { + "kind": "theorem", + "unqualified_name": "ec010_generic", + "line": 28, + "source_header": "ring\n\n/-- EC-010, generic chart: declared convex-combination polynomial identity. -/\ntheorem ec010_generic (α K c η : ℝ) :\n (K + 8 * α * c * η) ^ 2 + 64 * α * (1 - α) * c ^ 2 * η ^ 2 =\n (1 - α) * K ^ 2 + α * (K + 8 * c *" + }, + { + "kind": "theorem", + "unqualified_name": "ec010_transverse", + "line": 34, + "source_header": "ring\n\n/-- EC-010, transverse chart: declared convex-combination polynomial identity. -/\ntheorem ec010_transverse (α a η : ℝ) :\n (a + (1 - 2 * α) * η) ^ 2 + 4 * α * (1 - α) * η ^ 2 =\n (1 - α) * (a + η) ^ 2 + α * (a" + }, + { + "kind": "theorem", + "unqualified_name": "ec011_scalar_cancellation", + "line": 40, + "source_header": "by\n ring\n\n/-- EC-011: scalar cancellation companion to the adjoint-orbit calculation.\n It does not formalize the ODE, Hessian symmetry, or section normalization. -/\ntheorem ec011_scalar_cancellation (h w g : ℝ) :\n (-h * w) * g + w *" + }, + { + "kind": "theorem", + "unqualified_name": "ec014_contact_power", + "line": 46, + "source_header": "= by\n ring\n\n/-- EC-014: exact contact-power scalar identity for nonzero separation.\n It does not formalize the six-pin matrix determinant or density transform. -/\ntheorem ec014_contact_power (r : ℝ) (hr : r ≠ 0) :\n (r ^ 3 / 6) * (1 / r ^ 5) * r ^ 2" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:frontiers/regular_superlevel_geometry_20261020", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelAxiomAudit.lean", + "sha256": "807de09540b9f7f4f4e14c3408f1f82cb08b1e4232c68c04da5a2355cec02f9e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevel.lean", + "sha256": "0db6ce3ea7358a59c089680d774a6806f0fb747c24d9828850377458156e2f02" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelLiteral.lean", + "sha256": "334759063a3ae58b42b8cd4a45e3bfd6f3a31b668d18526aa6fdcb5ea65c13d3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/project/RegularPointChart.lean", + "sha256": "5568c8d6e03f7064cd5924ebe2814ae746100505ae31789d5c975902528f9fa2" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f.lean", + "sha256": "0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/development/b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d.lean", + "sha256": "b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutRegularOrInterior.lean", + "sha256": "d3c12e33718a00be343d0e2b3cbbd9a1cdf08e8a2062eb3bfeb7026fb47a543d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutCoordinateIdentity.lean", + "sha256": "167d0afb49457303a61fac6927784e4f0157ed5725739903bf5e33224974b081" + } + ], + "source_record_sha256": "df80deeeac19a182d4ba6818367b3be4d78b9f6d2dbf7babf797e9fdd9183747", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "frontiers/regular_superlevel_geometry_20261020", + "source_files": [ + { + "path": "frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelAxiomAudit.lean", + "sha256": "807de09540b9f7f4f4e14c3408f1f82cb08b1e4232c68c04da5a2355cec02f9e", + "declarations_lexical": [] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevel.lean", + "sha256": "0db6ce3ea7358a59c089680d774a6806f0fb747c24d9828850377458156e2f02", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_openEmbedding", + "line": 15, + "source_header": "l\n\n/-- An open embedding carries a path-connected neighborhood basis to its image point. -/\ntheorem path_connected_basis_of_openEmbedding\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n [LocallyPathConnectedSpace X] {e : X → Y}\n (he : IsOpenEmbedding e) (x : X) :\n (𝓝 (e x)).HasBasis\n (fun V : Set Y => V ∈ 𝓝 (e x) ∧ IsPathConnected V)" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_open", + "line": 30, + "source_header": "hVU\n\n/-- An LPC open neighborhood supplies the required basis in the ambient space. -/\ntheorem path_connected_basis_of_open\n {X : Type*} [TopologicalSpace X] {U : Set X}\n (hU : IsOpen U) [LocallyPathConnectedSpace U] {x : X} (hx : x ∈ U) :\n (𝓝 x).HasBasis (fun V : Set X => V ∈ 𝓝 x ∧ IsPathConnected" + }, + { + "kind": "def", + "unqualified_name": "relative_chart_homeomorph", + "line": 37, + "source_header": ", hx⟩\n\n/-- Restrict a chart to two corresponding subsets, using their relative open\nsource and target. Neither subset is required to be open in its original ambient space. -/\ndef relative_chart_homeomorph\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T) :\n {y : S // y.val ∈ p.source} ≃ₜ {z : T // z.val ∈ p.target} where" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_relative_chart", + "line": 69, + "source_header": "operty)\n\n/-- Relative chart transport derives a neighborhood basis in the source subset\nfrom LPC of the model subset. This helper is consumed with a proved convex halfspace. -/\ntheorem path_connected_basis_of_relative_chart\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n [LocallyPathConnectedSpace T]\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T)\n (x : S) (hx : x.val ∈ p.source) :\n (𝓝 x).HasBasis (fun V : Set S => V ∈ 𝓝 x ∧ IsPathConnec" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_basis_of_chart", + "line": 87, + "source_header": "pen hU hx\n\n/-- A scalar chart supplies the actual closed-superlevel neighborhood basis.\n\nThe coordinate identity is needed only on the chart source. This theorem proves\nthe relative-topology step; the separately owned literal regular-point constructor\nmust supply `p`, `hx`, and `hcoord` before a noncritical-point corollary is claimed. -/\ntheorem closed_superlevel_basis_of_chart\n {d : ℕ} {g : E d → ℝ} {F : Type*}\n [NormedAddCommGroup F] [NormedSpace ℝ F]\n (a : ℝ) (x : {y : E d // a ≤ g y})\n (p : OpenPartialHomeomorph (E d) (ℝ × F))\n (hx : x.val ∈ p.source)\n (hcoord : ∀ y ∈ p.source, (p y).fst = g y) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConn" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_interior_basis", + "line": 116, + "source_header": "coord y hy]\n\n/-- A point strictly above the level has a path-connected neighborhood basis in\nthe closed superlevel, with continuity alone and no regularity assumption. -/\ntheorem closed_superlevel_interior_basis\n {d : ℕ} {g : E d → ℝ} (hg : Continuous g)\n (a : ℝ) (x : {y : E d // a ≤ g y}) (hx : a < g x.val) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathCo" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelLiteral.lean", + "sha256": "334759063a3ae58b42b8cd4a45e3bfd6f3a31b668d18526aa6fdcb5ea65c13d3", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_regular_basis", + "line": 23, + "source_header": "l\n\n/-- At a literal noncritical point, the closed superlevel has a neighborhood\nbasis of path-connected sets. The supplied smoothness and noncriticality\nconstruct the chart through the separately owned regular-point module. -/\ntheorem closed_superlevel_regular_basis\n {d : ℕ} {g : E d → ℝ}\n (hsmooth : IsSmooth d g)\n (a : ℝ) (x : {y : E d // a ≤ g y})\n (hregular : ¬ IsCriticalPoint d g x.val) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} =>\n V ∈ 𝓝 x ∧ IsPathConnected V)" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_path_connected_basis", + "line": 39, + "source_header": "y)\n\n/-- The pointwise basis required for eventual global LPC holds at every\nstrict-interior or literal regular point of the closed superlevel.\nNo chart or LPC hypothesis appears in this public interface. -/\ntheorem closed_superlevel_path_connected_basis\n {d : ℕ} {g : E d → ℝ}\n (hsmooth : IsSmooth d g)\n (a : ℝ) (x : {y : E d // a ≤ g y})\n (hx : a < g x.val ∨ ¬ IsCriticalPoint d g x.val) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} =>\n V ∈ 𝓝 x ∧ IsPathConnected" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/project/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 65, + "source_header": "y\n\n/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this\nnamespace). The duplication is deliberate: modules of this packet import only Mathlib. -/\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 77, + "source_header": "in d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 86, + "source_header": "i : ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 97, + "source_header": "^ 2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 109, + "source_header": "taSum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : F" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 120, + "source_header": "L (x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g :" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 129, + "source_header": "ec d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 138, + "source_header": "ℕ, ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 180, + "source_header": "y ∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 190, + "source_header": ": ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoi" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 199, + "source_header": "ℝ) (x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 215, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNon" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 225, + "source_header": "iticalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsInd" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 235, + "source_header": "alPoint d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 244, + "source_header": ": ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnon" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 253, + "source_header": "nS (d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence modul" + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 283, + "source_header": "tGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsC" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 302, + "source_header": "NondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the sourc" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 315, + "source_header": "IsCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNond" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 351, + "source_header": "gMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 363, + "source_header": "p :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pai" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 374, + "source_header": "ndDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d :" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 385, + "source_header": "E d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gau" + }, + { + "kind": "def", + "unqualified_name": "IsWindowPair", + "line": 407, + "source_header": "A ∧\n ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)\n\n/-! ### Populations of pairs -/\n\n/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with\n`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none beyond the shared predicates.\nDoes not claim: anything about the off-diagonal (far) population separately (Section" + }, + { + "kind": "structure", + "unqualified_name": "PairLawInterface", + "line": 442, + "source_header": ": ℝ) (g : E d → ℝ) (M S : E d) : Prop :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S\n\n/-! ### The typed pair law as an interface -/\n\n/-- Interface for the weighted regression (typed pair) law: the only object consumed by the\nstatements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death\npartner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the\nlaw `Q^W = (W_r/Z_r) Q_{r,b,k,R}` with `W_r = |det H_M det H_S| 1{H_M<0, index(H_S)=d-1}`.\nThat law, its weight, its normalizer and the regression construction are informal in the\nsource and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark\n`k` and orthonormal frame `R` with values in `[0, 1]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S.\"\nInterface: `p` is given; its only hypothesis fields are the bounds `0 ≤ p ≤ 1`. The parameters `G` and `I` record which field and which elder relation the law refers to; no field ties `p` to them.\nDoes not claim: existence of the regression law, the typed weight, the full normalizer `Z_r > 0`, or that `p` is the probability of any event under any measure declared here; that `p` depends on `G` or `I` in any way (no field mentions them; they only record which field and elder relation the law is meant to refer to). -/\nstructure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)\n (I : SuperlevelBarInterface d L) where\n /-- Section 1 clause: \"Let p_r(b,k,R) be the Q^W probability that the global ordinary\n superlevel elder death partner of M is S.\" -/\n p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R\n /-- `p` is a proba" + }, + { + "kind": "def", + "unqualified_name": "ParentUniformSelectionA", + "line": 466, + "source_header": "ility: at most one. -/\n p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1\n\n/-! ### The parent statements (1.1), (1.2), (1.3) -/\n\n/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`\nand `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)\nsuch that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all\northonormal frames `R`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There exist r_*>0 and C 0` and\nwindows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a\nconstant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and\nelder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,\n`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),\"\nInterface: `G` and `I` are given; \"versions\" are any `νc`, `νe` satisfying `IsLifetimeDensityVersion` (integral identity), not a Kac-Rice representation; the coefficient `c_{B,K}` is existential, not the Gaussian integral (11.3).\nDoes not claim: the parent result or its proof; the exact coefficient formula (11.3); existence of the versions; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef ParentCompactWindowDensityB (d :" + }, + { + "kind": "def", + "unqualified_name": "IsUnrestrictedLeadingCoefficient", + "line": 510, + "source_header": "r : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.\nThe essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the\nconclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,\nnot by the integral (13.6)/(15.2).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There is a positive finite constant c_{d,L} such that\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the explicit Gaussian/angular representation (15.2) of `c_{d,L}`; uniqueness of `c` (which follows from the asymptotics but is not stated); existence of versions. -/\ndef IsUnrestrictedLeadingC" + }, + { + "kind": "def", + "unqualified_name": "ParentUnrestrictedLeadingDensityC", + "line": 531, + "source_header": "∧\n Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe\n (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the\nunrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth\nheights, all positive gap marks, all separations; essential global maximum excluded) admit\nversions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the parent result or its proof (dominated convergence of Section 13, off-diagonal bound (14.1)); the representation (15.2); the compact-window `O(ell^(2/3))` difference for the unrestricted densities; any numerical enclosure of `c_{d,L}` (the SIDE24 coefficient track is separate); nonauthor review or acceptance. -/\ndef ParentUnrestr" + }, + { + "kind": "def", + "unqualified_name": "RemainderBoundedR1", + "line": 545, + "source_header": "(I : SuperlevelBarInterface d L) : Prop :=\n 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c\n\n/-! ### The bounded remainder (R1) -/\n\n/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed\n`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here\nby `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of\nthe unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,\n`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.\nThe `O(1)` remainder is stated with an explicit absolute-value bound.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a\nAnchor: \"|nu_cand(ell)-c ell^(-1/3)| <= C,\"\nInterface: `G` and `I` are given; `c` is any real satisfying the parent leading-coefficient property (the source says the coefficient \"is exactly the parent's equation (15.2)\"; that integral is not transcribed, so `c` is pinned through (1.3) instead); versions are characterised by the integral identity only. The statement does not mention the typed pair law: Theorem R does not consume (1.1).\nDoes not claim: the result or its proof (quadratic determinant cancellation (R7), coupling (R4), cap-loss bound (R12)); convergence of the remainder; a second coefficient; numerical `C` or `ell_*`; the compact-window `O(ell^(2/3))` difference without cutoffs; the parent interfaces it imports (D1-A-E); nonauthor review or acceptance. If no `c` satisfies the parent property the statement holds vacuously; that is a transcription of its dependency on (1.3), not a claim. -" + }, + { + "kind": "def", + "unqualified_name": "PlanarElderLowerE2", + "line": 569, + "source_header": "c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧\n |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C\n\n/-! ### Planar elder lower bound and density gap (d = 2) -/\n\n/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with\nbirth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging\nover `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all\n`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \"1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff\n`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the\ncompact-window candidate and ordinary elder densities satisfy\n`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper\ninput is an explicit hypothesis, not folded into the conclusion. The lower half, which the\nsource derives from (E2) alone, is stated under the same hypothesis because the source displays\n(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower\nhalf, recorded here as such.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \" <= C_{B,K} ell^(2/3). (E11)\"\nInterface: `G`, `I` and `PL` are given; the hypothesis `ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi` is the consumed parent upper input (a statement shape, not the parent result); versions are characterised by the integral identity only; the weighted Kac-Rice / radial ledger of [LP, Sections 9-11] that the source consumes is not transcribed. The interface does not determine `p` or the field: the Prop is a predicate on the interface objects, not a closed statement about the source's objects; nothing is asserted about its universal closure over all inhabitants, and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the result or its proof; the upper half independently of the parent (1.1); the parent (1.1) itself; the lower half without the hypothesis (the source has it from (E2) alone); sharpness of the `O(1)` remainder of (R1); removal of the compact-mark restriction; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef PlanarDensityGapE11 (L : ℝ) (G :" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/project/RegularPointChart.lean", + "sha256": "5568c8d6e03f7064cd5924ebe2814ae746100505ae31789d5c975902528f9fa2", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "regularPointDerivative_range_eq_top", + "line": 14, + "source_header": "}\n\n/-- At a noncritical point, the scalar derivative has full range. -/\ntheorem regularPointDerivative_range_eq_top (hx : ¬ IsCriticalPoint d g x) :\n (fderiv ℝ g x).range" + }, + { + "kind": "theorem", + "unqualified_name": "regularPointHasStrictFDerivAt", + "line": 26, + "source_header": "hne\n\n/-- Smoothness supplies the strict derivative used by the chart. -/\ntheorem regularPointHasStrictFDerivAt (hg : IsSmooth d g) :\n HasStrictFDerivAt g (fderiv ℝ g" + }, + { + "kind": "def", + "unqualified_name": "regularPointChart", + "line": 31, + "source_header": "_num)\n\n/-- The literal local scalar chart at a noncritical point. -/\nnoncomputable def regularPointChart (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :\n OpenPartialHomeomorph (E d) (ℝ × (fderiv ℝ g" + }, + { + "kind": "theorem", + "unqualified_name": "regularPointChart_fst", + "line": 40, + "source_header": "/\n@[simp]\ntheorem regularPointChart_fst (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) (y : E d) :\n (regularPointChart hg hx y" + }, + { + "kind": "theorem", + "unqualified_name": "regularPointChart_self", + "line": 47, + "source_header": "-/\n@[simp]\ntheorem regularPointChart_self (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :\n regularPointChart hg hx x" + }, + { + "kind": "theorem", + "unqualified_name": "mem_regularPointChart_source", + "line": 51, + "source_header": "_eq_top hx)\n\n/-- The base point belongs to the chart source. -/\ntheorem mem_regularPointChart_source (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :\n x ∈ (regularPointChart" + }, + { + "kind": "theorem", + "unqualified_name": "mem_regularPointChart_target", + "line": 57, + "source_header": "ge_eq_top hx)\n\n/-- The image base point belongs to the chart target. -/\ntheorem mem_regularPointChart_target (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :\n (g x, 0) ∈ (regularPointChar" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/development/0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f.lean", + "sha256": "0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_openEmbedding", + "line": 15, + "source_header": "l\n\n/-- An open embedding carries a path-connected neighborhood basis to its image point. -/\ntheorem path_connected_basis_of_openEmbedding\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n [LocallyPathConnectedSpace X] {e : X → Y}\n (he : IsOpenEmbedding e) (x : X) :\n (𝓝 (e x)).HasBasis\n (fun V : Set Y => V ∈ 𝓝 (e x) ∧ IsPathConnected V)" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_open", + "line": 30, + "source_header": "hVU\n\n/-- An LPC open neighborhood supplies the required basis in the ambient space. -/\ntheorem path_connected_basis_of_open\n {X : Type*} [TopologicalSpace X] {U : Set X}\n (hU : IsOpen U) [LocallyPathConnectedSpace U] {x : X} (hx : x ∈ U) :\n (𝓝 x).HasBasis (fun V : Set X => V ∈ 𝓝 x ∧ IsPathConnected" + }, + { + "kind": "def", + "unqualified_name": "relative_chart_homeomorph", + "line": 37, + "source_header": ", hx⟩\n\n/-- Restrict a chart to two corresponding subsets, using their relative open\nsource and target. Neither subset is required to be open in its original ambient space. -/\ndef relative_chart_homeomorph\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T) :\n {y : S // y.val ∈ p.source} ≃ₜ {z : T // z.val ∈ p.target} where" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_relative_chart", + "line": 69, + "source_header": "operty)\n\n/-- Relative chart transport derives a neighborhood basis in the source subset\nfrom LPC of the model subset. This helper is consumed with a proved convex halfspace. -/\ntheorem path_connected_basis_of_relative_chart\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n [LocallyPathConnectedSpace T]\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T)\n (x : S) (hx : x.val ∈ p.source) :\n (𝓝 x).HasBasis (fun V : Set S => V ∈ 𝓝 x ∧ IsPathConnec" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_basis_of_chart", + "line": 87, + "source_header": "pen hU hx\n\n/-- A scalar chart supplies the actual closed-superlevel neighborhood basis.\n\nThe coordinate identity is needed only on the chart source. This theorem proves\nthe relative-topology step; the separately owned literal regular-point constructor\nmust supply `p`, `hx`, and `hcoord` before a noncritical-point corollary is claimed. -/\ntheorem closed_superlevel_basis_of_chart\n {d : ℕ} {g : E d → ℝ} {F : Type*}\n [NormedAddCommGroup F] [NormedSpace ℝ F]\n (a : ℝ) (x : {y : E d // a ≤ g y})\n (p : OpenPartialHomeomorph (E d) (ℝ × F))\n (hx : x.val ∈ p.source)\n (hcoord : ∀ y ∈ p.source, (p y).fst = g y) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConn" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_interior_basis", + "line": 116, + "source_header": "coord y hy]\n\n/-- A point strictly above the level has a path-connected neighborhood basis in\nthe closed superlevel, with continuity alone and no regularity assumption. -/\ntheorem closed_superlevel_interior_basis\n {d : ℕ} {g : E d → ℝ} (hg : Continuous g)\n (a : ℝ) (x : {y : E d // a ≤ g y}) (hx : a < g x.val) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathCo" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/development/b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d.lean", + "sha256": "b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_openEmbedding", + "line": 15, + "source_header": "l\n\n/-- An open embedding carries a path-connected neighborhood basis to its image point. -/\ntheorem path_connected_basis_of_openEmbedding\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n [LocallyPathConnectedSpace X] {e : X → Y}\n (he : IsOpenEmbedding e) (x : X) :\n (𝓝 (e x)).HasBasis\n (fun V : Set Y => V ∈ 𝓝 (e x) ∧ IsPathConnected V)" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_open", + "line": 30, + "source_header": "hVU\n\n/-- An LPC open neighborhood supplies the required basis in the ambient space. -/\ntheorem path_connected_basis_of_open\n {X : Type*} [TopologicalSpace X] {U : Set X}\n (hU : IsOpen U) [LocallyPathConnectedSpace U] {x : X} (hx : x ∈ U) :\n (𝓝 x).HasBasis (fun V : Set X => V ∈ 𝓝 x ∧ IsPathConnected" + }, + { + "kind": "def", + "unqualified_name": "relative_chart_homeomorph", + "line": 37, + "source_header": ", hx⟩\n\n/-- Restrict a chart to two corresponding subsets, using their relative open\nsource and target. Neither subset is required to be open in its original ambient space. -/\ndef relative_chart_homeomorph\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T) :\n {y : S // y.val ∈ p.source} ≃ₜ {z : T // z.val ∈ p.target} where" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_relative_chart", + "line": 69, + "source_header": "operty)\n\n/-- Relative chart transport derives a neighborhood basis in the source subset\nfrom LPC of the model subset. This helper is consumed with a proved convex halfspace. -/\ntheorem path_connected_basis_of_relative_chart\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n [LocallyPathConnectedSpace T]\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T)\n (x : S) (hx : x.val ∈ p.source) :\n (𝓝 x).HasBasis (fun V : Set S => V ∈ 𝓝 x ∧ IsPathConnec" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_basis_of_chart", + "line": 87, + "source_header": "pen hU hx\n\n/-- A scalar chart supplies the actual closed-superlevel neighborhood basis.\n\nThe coordinate identity is needed only on the chart source. This theorem proves\nthe relative-topology step; the separately owned literal regular-point constructor\nmust supply `p`, `hx`, and `hcoord` before a noncritical-point corollary is claimed. -/\ntheorem closed_superlevel_basis_of_chart\n {d : ℕ} {g : E d → ℝ} {F : Type*}\n [NormedAddCommGroup F] [NormedSpace ℝ F]\n (a : ℝ) (x : {y : E d // a ≤ g y})\n (p : OpenPartialHomeomorph (E d) (ℝ × F))\n (hx : x.val ∈ p.source)\n (hcoord : ∀ y ∈ p.source, (p y).fst = g y) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConn" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_interior_basis", + "line": 116, + "source_header": "coord y hy]\n\n/-- A point strictly above the level has a path-connected neighborhood basis in\nthe closed superlevel, with continuity alone and no regularity assumption. -/\ntheorem closed_superlevel_interior_basis\n {d : ℕ} {g : E d → ℝ} (hg : Continuous g)\n (a : ℝ) (x : {y : E d // a ≤ g y}) (hx : a < g x.val) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathCo" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutRegularOrInterior.lean", + "sha256": "d3c12e33718a00be343d0e2b3cbbd9a1cdf08e8a2062eb3bfeb7026fb47a543d", + "declarations_lexical": [] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutCoordinateIdentity.lean", + "sha256": "167d0afb49457303a61fac6927784e4f0157ed5725739903bf5e33224974b081", + "declarations_lexical": [] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:frontiers/regular_superlevel_geometry_20261020", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "frontiers/regular_superlevel_geometry_20261020", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelAxiomAudit.lean", + "sha256": "807de09540b9f7f4f4e14c3408f1f82cb08b1e4232c68c04da5a2355cec02f9e", + "declarations_lexical": [] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevel.lean", + "sha256": "0db6ce3ea7358a59c089680d774a6806f0fb747c24d9828850377458156e2f02", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_openEmbedding", + "line": 15, + "source_header": "l\n\n/-- An open embedding carries a path-connected neighborhood basis to its image point. -/\ntheorem path_connected_basis_of_openEmbedding\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n [LocallyPathConnectedSpace X] {e : X → Y}\n (he : IsOpenEmbedding e) (x : X) :\n (𝓝 (e x)).HasBasis\n (fun V : Set Y => V ∈ 𝓝 (e x) ∧ IsPathConnected V)" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_open", + "line": 30, + "source_header": "hVU\n\n/-- An LPC open neighborhood supplies the required basis in the ambient space. -/\ntheorem path_connected_basis_of_open\n {X : Type*} [TopologicalSpace X] {U : Set X}\n (hU : IsOpen U) [LocallyPathConnectedSpace U] {x : X} (hx : x ∈ U) :\n (𝓝 x).HasBasis (fun V : Set X => V ∈ 𝓝 x ∧ IsPathConnected" + }, + { + "kind": "def", + "unqualified_name": "relative_chart_homeomorph", + "line": 37, + "source_header": ", hx⟩\n\n/-- Restrict a chart to two corresponding subsets, using their relative open\nsource and target. Neither subset is required to be open in its original ambient space. -/\ndef relative_chart_homeomorph\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T) :\n {y : S // y.val ∈ p.source} ≃ₜ {z : T // z.val ∈ p.target} where" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_relative_chart", + "line": 69, + "source_header": "operty)\n\n/-- Relative chart transport derives a neighborhood basis in the source subset\nfrom LPC of the model subset. This helper is consumed with a proved convex halfspace. -/\ntheorem path_connected_basis_of_relative_chart\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n [LocallyPathConnectedSpace T]\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T)\n (x : S) (hx : x.val ∈ p.source) :\n (𝓝 x).HasBasis (fun V : Set S => V ∈ 𝓝 x ∧ IsPathConnec" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_basis_of_chart", + "line": 87, + "source_header": "pen hU hx\n\n/-- A scalar chart supplies the actual closed-superlevel neighborhood basis.\n\nThe coordinate identity is needed only on the chart source. This theorem proves\nthe relative-topology step; the separately owned literal regular-point constructor\nmust supply `p`, `hx`, and `hcoord` before a noncritical-point corollary is claimed. -/\ntheorem closed_superlevel_basis_of_chart\n {d : ℕ} {g : E d → ℝ} {F : Type*}\n [NormedAddCommGroup F] [NormedSpace ℝ F]\n (a : ℝ) (x : {y : E d // a ≤ g y})\n (p : OpenPartialHomeomorph (E d) (ℝ × F))\n (hx : x.val ∈ p.source)\n (hcoord : ∀ y ∈ p.source, (p y).fst = g y) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConn" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_interior_basis", + "line": 116, + "source_header": "coord y hy]\n\n/-- A point strictly above the level has a path-connected neighborhood basis in\nthe closed superlevel, with continuity alone and no regularity assumption. -/\ntheorem closed_superlevel_interior_basis\n {d : ℕ} {g : E d → ℝ} (hg : Continuous g)\n (a : ℝ) (x : {y : E d // a ≤ g y}) (hx : a < g x.val) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathCo" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/project/RegularSuperlevelLiteral.lean", + "sha256": "334759063a3ae58b42b8cd4a45e3bfd6f3a31b668d18526aa6fdcb5ea65c13d3", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_regular_basis", + "line": 23, + "source_header": "l\n\n/-- At a literal noncritical point, the closed superlevel has a neighborhood\nbasis of path-connected sets. The supplied smoothness and noncriticality\nconstruct the chart through the separately owned regular-point module. -/\ntheorem closed_superlevel_regular_basis\n {d : ℕ} {g : E d → ℝ}\n (hsmooth : IsSmooth d g)\n (a : ℝ) (x : {y : E d // a ≤ g y})\n (hregular : ¬ IsCriticalPoint d g x.val) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} =>\n V ∈ 𝓝 x ∧ IsPathConnected V)" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_path_connected_basis", + "line": 39, + "source_header": "y)\n\n/-- The pointwise basis required for eventual global LPC holds at every\nstrict-interior or literal regular point of the closed superlevel.\nNo chart or LPC hypothesis appears in this public interface. -/\ntheorem closed_superlevel_path_connected_basis\n {d : ℕ} {g : E d → ℝ}\n (hsmooth : IsSmooth d g)\n (a : ℝ) (x : {y : E d // a ≤ g y})\n (hx : a < g x.val ∨ ¬ IsCriticalPoint d g x.val) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} =>\n V ∈ 𝓝 x ∧ IsPathConnected" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/project/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 65, + "source_header": "y\n\n/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this\nnamespace). The duplication is deliberate: modules of this packet import only Mathlib. -/\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 77, + "source_header": "in d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 86, + "source_header": "i : ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 97, + "source_header": "^ 2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 109, + "source_header": "taSum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : F" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 120, + "source_header": "L (x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g :" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 129, + "source_header": "ec d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 138, + "source_header": "ℕ, ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 180, + "source_header": "y ∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 190, + "source_header": ": ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoi" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 199, + "source_header": "ℝ) (x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 215, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNon" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 225, + "source_header": "iticalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsInd" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 235, + "source_header": "alPoint d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 244, + "source_header": ": ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnon" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 253, + "source_header": "nS (d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence modul" + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 283, + "source_header": "tGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsC" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 302, + "source_header": "NondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the sourc" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 315, + "source_header": "IsCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNond" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 351, + "source_header": "gMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 363, + "source_header": "p :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pai" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 374, + "source_header": "ndDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d :" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 385, + "source_header": "E d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gau" + }, + { + "kind": "def", + "unqualified_name": "IsWindowPair", + "line": 407, + "source_header": "A ∧\n ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)\n\n/-! ### Populations of pairs -/\n\n/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with\n`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none beyond the shared predicates.\nDoes not claim: anything about the off-diagonal (far) population separately (Section" + }, + { + "kind": "structure", + "unqualified_name": "PairLawInterface", + "line": 442, + "source_header": ": ℝ) (g : E d → ℝ) (M S : E d) : Prop :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S\n\n/-! ### The typed pair law as an interface -/\n\n/-- Interface for the weighted regression (typed pair) law: the only object consumed by the\nstatements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death\npartner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the\nlaw `Q^W = (W_r/Z_r) Q_{r,b,k,R}` with `W_r = |det H_M det H_S| 1{H_M<0, index(H_S)=d-1}`.\nThat law, its weight, its normalizer and the regression construction are informal in the\nsource and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark\n`k` and orthonormal frame `R` with values in `[0, 1]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S.\"\nInterface: `p` is given; its only hypothesis fields are the bounds `0 ≤ p ≤ 1`. The parameters `G` and `I` record which field and which elder relation the law refers to; no field ties `p` to them.\nDoes not claim: existence of the regression law, the typed weight, the full normalizer `Z_r > 0`, or that `p` is the probability of any event under any measure declared here; that `p` depends on `G` or `I` in any way (no field mentions them; they only record which field and elder relation the law is meant to refer to). -/\nstructure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)\n (I : SuperlevelBarInterface d L) where\n /-- Section 1 clause: \"Let p_r(b,k,R) be the Q^W probability that the global ordinary\n superlevel elder death partner of M is S.\" -/\n p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R\n /-- `p` is a proba" + }, + { + "kind": "def", + "unqualified_name": "ParentUniformSelectionA", + "line": 466, + "source_header": "ility: at most one. -/\n p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1\n\n/-! ### The parent statements (1.1), (1.2), (1.3) -/\n\n/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`\nand `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)\nsuch that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all\northonormal frames `R`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There exist r_*>0 and C 0` and\nwindows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a\nconstant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and\nelder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,\n`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),\"\nInterface: `G` and `I` are given; \"versions\" are any `νc`, `νe` satisfying `IsLifetimeDensityVersion` (integral identity), not a Kac-Rice representation; the coefficient `c_{B,K}` is existential, not the Gaussian integral (11.3).\nDoes not claim: the parent result or its proof; the exact coefficient formula (11.3); existence of the versions; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef ParentCompactWindowDensityB (d :" + }, + { + "kind": "def", + "unqualified_name": "IsUnrestrictedLeadingCoefficient", + "line": 510, + "source_header": "r : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.\nThe essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the\nconclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,\nnot by the integral (13.6)/(15.2).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There is a positive finite constant c_{d,L} such that\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the explicit Gaussian/angular representation (15.2) of `c_{d,L}`; uniqueness of `c` (which follows from the asymptotics but is not stated); existence of versions. -/\ndef IsUnrestrictedLeadingC" + }, + { + "kind": "def", + "unqualified_name": "ParentUnrestrictedLeadingDensityC", + "line": 531, + "source_header": "∧\n Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe\n (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the\nunrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth\nheights, all positive gap marks, all separations; essential global maximum excluded) admit\nversions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the parent result or its proof (dominated convergence of Section 13, off-diagonal bound (14.1)); the representation (15.2); the compact-window `O(ell^(2/3))` difference for the unrestricted densities; any numerical enclosure of `c_{d,L}` (the SIDE24 coefficient track is separate); nonauthor review or acceptance. -/\ndef ParentUnrestr" + }, + { + "kind": "def", + "unqualified_name": "RemainderBoundedR1", + "line": 545, + "source_header": "(I : SuperlevelBarInterface d L) : Prop :=\n 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c\n\n/-! ### The bounded remainder (R1) -/\n\n/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed\n`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here\nby `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of\nthe unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,\n`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.\nThe `O(1)` remainder is stated with an explicit absolute-value bound.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a\nAnchor: \"|nu_cand(ell)-c ell^(-1/3)| <= C,\"\nInterface: `G` and `I` are given; `c` is any real satisfying the parent leading-coefficient property (the source says the coefficient \"is exactly the parent's equation (15.2)\"; that integral is not transcribed, so `c` is pinned through (1.3) instead); versions are characterised by the integral identity only. The statement does not mention the typed pair law: Theorem R does not consume (1.1).\nDoes not claim: the result or its proof (quadratic determinant cancellation (R7), coupling (R4), cap-loss bound (R12)); convergence of the remainder; a second coefficient; numerical `C` or `ell_*`; the compact-window `O(ell^(2/3))` difference without cutoffs; the parent interfaces it imports (D1-A-E); nonauthor review or acceptance. If no `c` satisfies the parent property the statement holds vacuously; that is a transcription of its dependency on (1.3), not a claim. -" + }, + { + "kind": "def", + "unqualified_name": "PlanarElderLowerE2", + "line": 569, + "source_header": "c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧\n |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C\n\n/-! ### Planar elder lower bound and density gap (d = 2) -/\n\n/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with\nbirth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging\nover `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all\n`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \"1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff\n`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the\ncompact-window candidate and ordinary elder densities satisfy\n`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper\ninput is an explicit hypothesis, not folded into the conclusion. The lower half, which the\nsource derives from (E2) alone, is stated under the same hypothesis because the source displays\n(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower\nhalf, recorded here as such.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \" <= C_{B,K} ell^(2/3). (E11)\"\nInterface: `G`, `I` and `PL` are given; the hypothesis `ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi` is the consumed parent upper input (a statement shape, not the parent result); versions are characterised by the integral identity only; the weighted Kac-Rice / radial ledger of [LP, Sections 9-11] that the source consumes is not transcribed. The interface does not determine `p` or the field: the Prop is a predicate on the interface objects, not a closed statement about the source's objects; nothing is asserted about its universal closure over all inhabitants, and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the result or its proof; the upper half independently of the parent (1.1); the parent (1.1) itself; the lower half without the hypothesis (the source has it from (E2) alone); sharpness of the `O(1)` remainder of (R1); removal of the compact-mark restriction; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef PlanarDensityGapE11 (L : ℝ) (G :" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/project/RegularPointChart.lean", + "sha256": "5568c8d6e03f7064cd5924ebe2814ae746100505ae31789d5c975902528f9fa2", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "regularPointDerivative_range_eq_top", + "line": 14, + "source_header": "}\n\n/-- At a noncritical point, the scalar derivative has full range. -/\ntheorem regularPointDerivative_range_eq_top (hx : ¬ IsCriticalPoint d g x) :\n (fderiv ℝ g x).range" + }, + { + "kind": "theorem", + "unqualified_name": "regularPointHasStrictFDerivAt", + "line": 26, + "source_header": "hne\n\n/-- Smoothness supplies the strict derivative used by the chart. -/\ntheorem regularPointHasStrictFDerivAt (hg : IsSmooth d g) :\n HasStrictFDerivAt g (fderiv ℝ g" + }, + { + "kind": "def", + "unqualified_name": "regularPointChart", + "line": 31, + "source_header": "_num)\n\n/-- The literal local scalar chart at a noncritical point. -/\nnoncomputable def regularPointChart (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :\n OpenPartialHomeomorph (E d) (ℝ × (fderiv ℝ g" + }, + { + "kind": "theorem", + "unqualified_name": "regularPointChart_fst", + "line": 40, + "source_header": "/\n@[simp]\ntheorem regularPointChart_fst (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) (y : E d) :\n (regularPointChart hg hx y" + }, + { + "kind": "theorem", + "unqualified_name": "regularPointChart_self", + "line": 47, + "source_header": "-/\n@[simp]\ntheorem regularPointChart_self (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :\n regularPointChart hg hx x" + }, + { + "kind": "theorem", + "unqualified_name": "mem_regularPointChart_source", + "line": 51, + "source_header": "_eq_top hx)\n\n/-- The base point belongs to the chart source. -/\ntheorem mem_regularPointChart_source (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :\n x ∈ (regularPointChart" + }, + { + "kind": "theorem", + "unqualified_name": "mem_regularPointChart_target", + "line": 57, + "source_header": "ge_eq_top hx)\n\n/-- The image base point belongs to the chart target. -/\ntheorem mem_regularPointChart_target (hg : IsSmooth d g) (hx : ¬ IsCriticalPoint d g x) :\n (g x, 0) ∈ (regularPointChar" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/development/0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f.lean", + "sha256": "0758454e88cb02ad56483face96483d8a878afe5eaa72f1ea629f0ca5a29760f", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_openEmbedding", + "line": 15, + "source_header": "l\n\n/-- An open embedding carries a path-connected neighborhood basis to its image point. -/\ntheorem path_connected_basis_of_openEmbedding\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n [LocallyPathConnectedSpace X] {e : X → Y}\n (he : IsOpenEmbedding e) (x : X) :\n (𝓝 (e x)).HasBasis\n (fun V : Set Y => V ∈ 𝓝 (e x) ∧ IsPathConnected V)" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_open", + "line": 30, + "source_header": "hVU\n\n/-- An LPC open neighborhood supplies the required basis in the ambient space. -/\ntheorem path_connected_basis_of_open\n {X : Type*} [TopologicalSpace X] {U : Set X}\n (hU : IsOpen U) [LocallyPathConnectedSpace U] {x : X} (hx : x ∈ U) :\n (𝓝 x).HasBasis (fun V : Set X => V ∈ 𝓝 x ∧ IsPathConnected" + }, + { + "kind": "def", + "unqualified_name": "relative_chart_homeomorph", + "line": 37, + "source_header": ", hx⟩\n\n/-- Restrict a chart to two corresponding subsets, using their relative open\nsource and target. Neither subset is required to be open in its original ambient space. -/\ndef relative_chart_homeomorph\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T) :\n {y : S // y.val ∈ p.source} ≃ₜ {z : T // z.val ∈ p.target} where" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_relative_chart", + "line": 69, + "source_header": "operty)\n\n/-- Relative chart transport derives a neighborhood basis in the source subset\nfrom LPC of the model subset. This helper is consumed with a proved convex halfspace. -/\ntheorem path_connected_basis_of_relative_chart\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n [LocallyPathConnectedSpace T]\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T)\n (x : S) (hx : x.val ∈ p.source) :\n (𝓝 x).HasBasis (fun V : Set S => V ∈ 𝓝 x ∧ IsPathConnec" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_basis_of_chart", + "line": 87, + "source_header": "pen hU hx\n\n/-- A scalar chart supplies the actual closed-superlevel neighborhood basis.\n\nThe coordinate identity is needed only on the chart source. This theorem proves\nthe relative-topology step; the separately owned literal regular-point constructor\nmust supply `p`, `hx`, and `hcoord` before a noncritical-point corollary is claimed. -/\ntheorem closed_superlevel_basis_of_chart\n {d : ℕ} {g : E d → ℝ} {F : Type*}\n [NormedAddCommGroup F] [NormedSpace ℝ F]\n (a : ℝ) (x : {y : E d // a ≤ g y})\n (p : OpenPartialHomeomorph (E d) (ℝ × F))\n (hx : x.val ∈ p.source)\n (hcoord : ∀ y ∈ p.source, (p y).fst = g y) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConn" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_interior_basis", + "line": 116, + "source_header": "coord y hy]\n\n/-- A point strictly above the level has a path-connected neighborhood basis in\nthe closed superlevel, with continuity alone and no regularity assumption. -/\ntheorem closed_superlevel_interior_basis\n {d : ℕ} {g : E d → ℝ} (hg : Continuous g)\n (a : ℝ) (x : {y : E d // a ≤ g y}) (hx : a < g x.val) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathCo" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/development/b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d.lean", + "sha256": "b5733777504470cc1a2edfff780d0d7b7f271fdfc3db377cdb093f7e356f946d", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_openEmbedding", + "line": 15, + "source_header": "l\n\n/-- An open embedding carries a path-connected neighborhood basis to its image point. -/\ntheorem path_connected_basis_of_openEmbedding\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n [LocallyPathConnectedSpace X] {e : X → Y}\n (he : IsOpenEmbedding e) (x : X) :\n (𝓝 (e x)).HasBasis\n (fun V : Set Y => V ∈ 𝓝 (e x) ∧ IsPathConnected V)" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_open", + "line": 30, + "source_header": "hVU\n\n/-- An LPC open neighborhood supplies the required basis in the ambient space. -/\ntheorem path_connected_basis_of_open\n {X : Type*} [TopologicalSpace X] {U : Set X}\n (hU : IsOpen U) [LocallyPathConnectedSpace U] {x : X} (hx : x ∈ U) :\n (𝓝 x).HasBasis (fun V : Set X => V ∈ 𝓝 x ∧ IsPathConnected" + }, + { + "kind": "def", + "unqualified_name": "relative_chart_homeomorph", + "line": 37, + "source_header": ", hx⟩\n\n/-- Restrict a chart to two corresponding subsets, using their relative open\nsource and target. Neither subset is required to be open in its original ambient space. -/\ndef relative_chart_homeomorph\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T) :\n {y : S // y.val ∈ p.source} ≃ₜ {z : T // z.val ∈ p.target} where" + }, + { + "kind": "theorem", + "unqualified_name": "path_connected_basis_of_relative_chart", + "line": 69, + "source_header": "operty)\n\n/-- Relative chart transport derives a neighborhood basis in the source subset\nfrom LPC of the model subset. This helper is consumed with a proved convex halfspace. -/\ntheorem path_connected_basis_of_relative_chart\n {X Y : Type*} [TopologicalSpace X] [TopologicalSpace Y]\n (p : OpenPartialHomeomorph X Y) (S : Set X) (T : Set Y)\n [LocallyPathConnectedSpace T]\n (hmem : ∀ y ∈ p.source, y ∈ S ↔ p y ∈ T)\n (x : S) (hx : x.val ∈ p.source) :\n (𝓝 x).HasBasis (fun V : Set S => V ∈ 𝓝 x ∧ IsPathConnec" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_basis_of_chart", + "line": 87, + "source_header": "pen hU hx\n\n/-- A scalar chart supplies the actual closed-superlevel neighborhood basis.\n\nThe coordinate identity is needed only on the chart source. This theorem proves\nthe relative-topology step; the separately owned literal regular-point constructor\nmust supply `p`, `hx`, and `hcoord` before a noncritical-point corollary is claimed. -/\ntheorem closed_superlevel_basis_of_chart\n {d : ℕ} {g : E d → ℝ} {F : Type*}\n [NormedAddCommGroup F] [NormedSpace ℝ F]\n (a : ℝ) (x : {y : E d // a ≤ g y})\n (p : OpenPartialHomeomorph (E d) (ℝ × F))\n (hx : x.val ∈ p.source)\n (hcoord : ∀ y ∈ p.source, (p y).fst = g y) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathConn" + }, + { + "kind": "theorem", + "unqualified_name": "closed_superlevel_interior_basis", + "line": 116, + "source_header": "coord y hy]\n\n/-- A point strictly above the level has a path-connected neighborhood basis in\nthe closed superlevel, with continuity alone and no regularity assumption. -/\ntheorem closed_superlevel_interior_basis\n {d : ℕ} {g : E d → ℝ} (hg : Continuous g)\n (a : ℝ) (x : {y : E d // a ≤ g y}) (hx : a < g x.val) :\n (𝓝 x).HasBasis\n (fun V : Set {y : E d // a ≤ g y} => V ∈ 𝓝 x ∧ IsPathCo" + } + ] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutRegularOrInterior.lean", + "sha256": "d3c12e33718a00be343d0e2b3cbbd9a1cdf08e8a2062eb3bfeb7026fb47a543d", + "declarations_lexical": [] + }, + { + "path": "frontiers/regular_superlevel_geometry_20261020/negative-project/WithoutCoordinateIdentity.lean", + "sha256": "167d0afb49457303a61fac6927784e4f0157ed5725739903bf5e33224974b081", + "declarations_lexical": [] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:frontiers/source_derivative_gaussian_20261025", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ContactJetCovariance.lean", + "sha256": "50df0281c580ac7af018713a38c6bdd5dd34b52e3834b573165045bc64acd49d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointEstimates.lean", + "sha256": "d1f08d80d06d1ac08afbdd700370059fd8eaf0d4e483916e742efcdd1f664598" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianRegressionLimits.lean", + "sha256": "26c403ea1104fbce89f5c2833f603edd4d2703669d8a94a77b2c9a2a06b572be" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentPins.lean", + "sha256": "41e1ea1ef4f9960307552a8271a5c04d2b72d94736b98eb601b51669ed603c3f" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothPalm.lean", + "sha256": "1b1d47b640b541195dad1472a07fa9490f203bd1619b1759b29587a0effe631d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConditionalMajorant.lean", + "sha256": "07ae7796e461a2ee59a757b37a3e64f7ed31c76d26a3b40825f23170fcb4e691" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/ConfluentIntegralIdentities.lean", + "sha256": "0324d7556d485cd360a513587199354fa1f3863d15cf06b52c86e362de5e56b8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactEndpointParameters.lean", + "sha256": "da5337a7814a008eaa8b8a98c0df4daf3efb1bc347789a2f75efc63c9c258d01" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceSmoothConditionalKernel.lean", + "sha256": "664892acb12d40e5bf20075e1ef633efdd4a54ae1308c714308eab3a4deaa517" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointRegression.lean", + "sha256": "67e68553e004adc3b1b6beb987b3e7ad477b4541d96fec22ee481facd2038fce" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeContinuity.lean", + "sha256": "552511e0aee227133b7d067faeceaab9c43c0094b07d68b8eddab0ab2419775e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceDerivativeGaussian.lean", + "sha256": "c9754debcbf2aab7ff8d9604f2c13726723e8a8c1921ae68f83349205e43885d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceConfluentLimits.lean", + "sha256": "1635a05bbd5b56608bc0a1a04eb4404c2df4601f1255f5846c1342a597bf5b0b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceEndpointParameters.lean", + "sha256": "efc88ac59217ab1960d5518abcd9f16a71b42080a2810f1e337eeb2f686c1e3a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactSchur.lean", + "sha256": "2fe122a50ec1889b579558d80086251d87ed0cec2420d268ab1d04f6bfff4409" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourceContactCovariance.lean", + "sha256": "4189cbaf4c18c55f21e3af2c96b0b2842d83161f44596eb691c507dcc1a439c8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/SourcePhysicalEndpointKernel.lean", + "sha256": "689ced2a760b38333b0224f19af52812d0057527d5a790ba50116cb5f07b7e3a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/GaussianWeightedMajorants.lean", + "sha256": "3bde84aa83d02b364ca17f242cc5dbca83908c02f2f75649075d7da6a3d1bfd0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmooth.lean", + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceSmoothCarrier.lean", + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceKernel.lean", + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorus.lean", + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SpectralWeights.lean", + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceFourierSeries.lean", + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceCovariance.lean", + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceGaussianLaw.lean", + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/GaussianSeriesFoundation.lean", + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceTorusC4.lean", + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceC4.lean", + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/SourceLattice.lean", + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizerLimit.lean", + "sha256": "12c98054b5bcf47f4619c624ef5e91c37f316d7c4848f560279d1f1e96fe0049" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointNormalizerBridge.lean", + "sha256": "36eab3b805fcba5160cb7e286dbd7f96940b0c6a85b464aad5fdad2f624ceb7e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointGaussianMoments.lean", + "sha256": "c6351881326491ce30f1a266ea60e44c5adb8b3a1e5882c90575c67e459479d1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/PalmReweighting.lean", + "sha256": "d34e422693f1d449bfcaf9c844c99c8fef4f19503312d3677ca525bd2d67c4d6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianJetMoments.lean", + "sha256": "f2e785975aee6915848fe78dc3ecde02b8f13a0a1fb56ae3771e4c727c723360" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianRegressionKernel.lean", + "sha256": "66d4fbee044a1a0c0b434bcd7614e220fad21d1ac275ce9b01070a66c5780460" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianCoupling.lean", + "sha256": "426a53c139215650e961601c12f3cc1e09069520c5ebb96234a29483280551bb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizer.lean", + "sha256": "32b7202cba2a9a0e0ed603d1a6db9ba2031714375b4e955614d5a40826a14aeb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianScalarMoments.lean", + "sha256": "71ce88ad2c97891858a5196f3293907bdffdd2341dfbace24204f2318c7510df" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/NormalizerFloor.lean", + "sha256": "428eefd71b8c64fc4bcb208d9f73658058f29765f01a01c591f20a2d2359ec3e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/DeterminantMoment.lean", + "sha256": "661b73c3f21c6d2529f5e09ce426d89c01939ab27a5cc868db3802c7e66ea82d" + } + ], + "source_record_sha256": "1b7dcbf3dcbb9bee4ee5aa793fae51e0a97e8d508e0e9811c736578ad970cc91", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "frontiers/source_derivative_gaussian_20261025", + "source_files": [ + { + "path": "frontiers/source_derivative_gaussian_20261025/ContactJetCovariance.lean", + "sha256": "50df0281c580ac7af018713a38c6bdd5dd34b52e3834b573165045bc64acd49d", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "contactWitness", + "line": 26, + "source_header": "m\n\ndef contactWitness (c : ℝ) : Matrix (Fin 7) (Fin 7)" + }, + { + "kind": "lemma", + "unqualified_name": "contactWitness_transpose_mulVec_eq_zero", + "line": 35, + "source_header": "]\n\nlemma contactWitness_transpose_mulVec_eq_zero {c : ℝ} (hc : c ≠ 0)\n (z : Fin 7 → ℝ) (h : (contactWitness c)ᵀ *ᵥ z = 0) : z =" + }, + { + "kind": "lemma", + "unqualified_name": "contactWitness_transpose_injective", + "line": 58, + "source_header": "n\n\nlemma contactWitness_transpose_injective {c : ℝ} (hc : c ≠ 0) :\n Function.Injective ((contactWitness c)ᵀ).mulVe" + }, + { + "kind": "lemma", + "unqualified_name": "contactWitness_amplitude_transpose_injective", + "line": 65, + "source_header": "]\n\nlemma contactWitness_amplitude_transpose_injective {c : ℝ} (hc : c ≠ 0)\n (a : Fin 7 → ℝ) (ha : ∀ s, a s ≠ 0) :\n Function.Injective ((contactWitness c * diagonal a)ᵀ).mulVe" + }, + { + "kind": "def", + "unqualified_name": "coefficientGram", + "line": 76, + "source_header": "s\n\nnoncomputable def coefficientGram {ι : Type*} {n : ℕ} (coeff : Fin n → ι → ℝ) :\n Matrix (Fin n) (Fin n)" + }, + { + "kind": "lemma", + "unqualified_name": "coefficient_product_summable", + "line": 79, + "source_header": "m\n\nlemma coefficient_product_summable {ι : Type*} {a b : ι → ℝ}\n (ha : Summable a) (hb : Summable b) : Summable (fun m => a m * b m" + }, + { + "kind": "lemma", + "unqualified_name": "coefficientGram_quadratic_hasSum", + "line": 86, + "source_header": ")\n\nlemma coefficientGram_quadratic_hasSum {ι : Type*} {n : ℕ} (coeff : Fin n → ι → ℝ)\n (hc : ∀ i, Summable (coeff i)) (z : Fin n → ℝ) :\n HasSum (fun m => (∑ i, z i * coeff i m)^2)\n (star z ⬝ᵥ (coefficientGram coeff *ᵥ z)" + }, + { + "kind": "lemma", + "unqualified_name": "coefficientGram_posDef_of_separating", + "line": 104, + "source_header": "]\n\nlemma coefficientGram_posDef_of_separating {ι : Type*} {n : ℕ}\n (coeff : Fin n → ι → ℝ) (hc : ∀ i, Summable (coeff i))\n (hsep : ∀ z : Fin n → ℝ, z ≠ 0 → ∃ m, (∑ i, z i * coeff i m) ≠ 0) :\n (coefficientGram coeff).PosDe" + }, + { + "kind": "theorem", + "unqualified_name": "contact_coefficientGram_posDef", + "line": 120, + "source_header": ")\n\n/-- Seven explicit independent mode columns force positivity of the entire infinite Gram sum.\nNo positive-definiteness or invertibility conclusion is an input premise. -/\ntheorem contact_coefficientGram_posDef {ι : Type*} (coeff : Fin 7 → ι → ℝ)\n (hcoeff : ∀ i, Summable (coeff i)) {c : ℝ} (hc : c ≠ 0)\n (mode : Fin 7 → ι) (a : Fin 7 → ℝ) (ha : ∀ s, a s ≠ 0)\n (hcolumns : ∀ i s, coeff i (mode s) = a s * contactWitness c i s) :\n (coefficientGram coeff).Pos" + }, + { + "kind": "theorem", + "unqualified_name": "contact_schur_pos", + "line": 143, + "source_header": "hm\n\n/-- A positive-definite six-plus-one block covariance has strictly positive scalar Schur complement. -/\ntheorem contact_schur_pos (A : Matrix (Fin 6) (Fin 6) ℝ)\n (B : Matrix (Fin 6) Unit ℝ) (D : Matrix Unit Unit ℝ)\n (hG : (Matrix.fromBlocks A B Bᴴ D).PosDef) :\n A.PosDef ∧ 0 < (D - Bᴴ * A⁻¹ * B)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceEndpointEstimates.lean", + "sha256": "d1f08d80d06d1ac08afbdd700370059fd8eaf0d4e483916e742efcdd1f664598", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sourcePhysicalCoordinates", + "line": 28, + "source_header": "s\n\n/-- LM006 `(aM,aS,bM,bS,cM,cS)` to actual `(aM,bM,cM,aS,bS,cS)` order. -/\ndef sourcePhysicalCoordinates (v : Fin 6 → ℝ) : Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourcePhysicalIndex", + "line": 32, + "source_header": "5]\n\ndef sourcePhysicalIndex : Fin 6 → Fi" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalCoordinates_apply", + "line": 34, + "source_header": ",5]\n\ntheorem sourcePhysicalCoordinates_apply (v : Fin 6 → ℝ) (i : Fin 6) :\n sourcePhysicalCoordinates v i = v (sourcePhysicalIndex" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalCoordinates_continuous", + "line": 38, + "source_header": "rfl\n\ntheorem sourcePhysicalCoordinates_continuous : Continuous sourcePhysicalCoordina" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalCoordinates_inverse", + "line": 42, + "source_header": "rop\n\ntheorem sourcePhysicalCoordinates_inverse (v : Fin 6 → ℝ) :\n enb_permutation (sourcePhysicalCoordinates v)" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointWeight", + "line": 47, + "source_header": "rfl\n\n/-- The literal strict typed physical endpoint determinant weight. -/\ndef sourceEndpointWeight (r : ℝ) (v : Fin 6 → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointWeight_measurable", + "line": 51, + "source_header": "es v)\n\ntheorem sourceEndpointWeight_measurable (r : ℝ) : Measurable (sourceEndpointWeig" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointWeight_nonneg", + "line": 54, + "source_header": "rable\n\ntheorem sourceEndpointWeight_nonneg (r : ℝ) (v : Fin 6 → ℝ) :\n 0 ≤ sourceEndpointWeigh" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointWeight_eq_continuous", + "line": 61, + "source_header": "e_rfl\n\ntheorem sourceEndpointWeight_eq_continuous (r : ℝ) (hr : 0 < r) (v : Fin 6 → ℝ) :\n sourceEndpointWeight r v = r^2 * gn_normalizedWeigh" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointLaw", + "line": 66, + "source_header": "v) hr\n\ndef sourceEndpointLaw (L r b : ℝ) : Measure (Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointMean", + "line": 69, + "source_header": "r b)\n\ndef sourceEndpointMean (L r b : ℝ) : Fin" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_isProbabilityMeasure", + "line": 72, + "source_header": "r b)\n\ntheorem sourceEndpointLaw_isProbabilityMeasure {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n IsProbabilityMeasure (sourceEndpointLaw L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_euclidean_hasLaw", + "line": 78, + "source_header": "tance\n\n/-- The actual canonical every-pin kernel has the derived finite Gaussian law. -/\ntheorem sourceEndpointLaw_euclidean_hasLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasLaw (toLp 2) (multivariateGaussian (toLp 2 (sourceEndpointMean L r b))\n (sourceEndpointSchurAt L r)) (sourceEndpointLaw L r b) where\n aemea" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_physical_marginal", + "line": 86, + "source_header": "ns r b)\n\n/-- Every physical coordinate marginal is derived from the actual kernel,\nincluding singular residual covariances and noncentered prescribed heights. -/\ntheorem sourceEndpointLaw_physical_marginal {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (i : Fin 6) :\n HasLaw (fun v => sourcePhysicalCoordinates v i)\n (gaussianReal (sourceEndpointMean L r b (sourcePhysicalIndex i))\n ((sourceEndpointSchurAt L r) (sourcePhysicalIndex i) (sourcePhysicalIndex i)).toNNReal)\n (sourceEndpointL" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_weight_integral", + "line": 100, + "source_header": "ply v i))\n\n/-- Integrals of the literal physical weight transfer to the exact finite\nGaussian parameter law without an assumed integral representation. -/\ntheorem sourceEndpointLaw_weight_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b) =\n ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]\n ∂multivariateGaussian (toLp 2 (sourceEndpointMean L r b)) (sourceEndpointS" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_second_moment_of_parameter_bounds", + "line": 116, + "source_header": "Lp] using h\n\n/-- Per-radius moment composition from explicit parameter bounds. The later\nactual-source family theorem derives these bounds from the actual block limits. -/\ntheorem sourceEndpointLaw_second_moment_of_parameter_bounds {L : ℝ} (hL : L ≠ 0)\n (r b B V : ℝ) (hG : IsUnit (sourcePinCovarianceAt L r))\n (hB : 0 ≤ B) (hV : 0 ≤ V) (hr : 0 < r) (hr1 : r ≤ 1)\n (hmean : ∀ i, |sourceEndpointMean L r b i| ≤ B)\n (hvar : ∀ i, |sourceEndpointSchurAt L r i i| ≤ V) :\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) ∧\n (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤\n 16 * gm8FiniteM8" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_weight_square_integrable", + "line": 139, + "source_header": "nal hL r b hG\n\n/-- Actual physical square integrability needs no supplied parameter bound.\nFinite current Gaussian parameters provide their own finite coordinate bounds. -/\ntheorem sourceEndpointLaw_weight_square_integrable {L : ℝ} (hL : L ≠ 0)\n (r b : ℝ) (hG : IsUnit (sourcePinCovarianceAt L r)) (hr : 0 < r) (hr1 : r ≤ 1) :\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEnd" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_weight_integrable", + "line": 153, + "source_header": "urAt L r i i) i\n\ntheorem sourceEndpointLaw_weight_integrable {L : ℝ} (hL : L ≠ 0)\n (r b : ℝ) (hG : IsUnit (sourcePinCovarianceAt L r)) (hr : 0 < r) (hr1 : r ≤ 1) :\n Integrable (sourceEndpointWeight r) (sourceEnd" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePrescribedPins_tendsto", + "line": 160, + "source_header": "r b hG hr hr1)\n\n/-- The literal prescribed height has the actual contact pin as its right limit. -/\ntheorem sourcePrescribedPins_tendsto (b : ℝ) :\n Tendsto (fun r => sourcePrescribedPins r b) (𝓝[>] (0 : ℝ))\n (" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointWeightedProbability", + "line": 169, + "source_header": "hdsWithin_le_nhds\n\n/-- Explicit endpoint probability with the literal normalized weight density. -/\ndef sourceEndpointWeightedProbability (L r b : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_weighted_event_bound_of_estimates", + "line": 173, + "source_header": "ceEndpointWeight r)\n\n/-- Endpoint reweighting glue; its estimates are derived in the final actual\nsource theorem after the actual covariance-limit exports are available. -/\ntheorem sourceEndpoint_weighted_event_bound_of_estimates {L : ℝ} (hL : L ≠ 0)\n (r b C c : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)\n (hsq : Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b))\n (hmoment : (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤ C*r^4)\n (hfloor : c*r^2 ≤ ∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b)\n (E : Set (Fin 6 → ℝ)) (hE : MeasurableSet E) :\n IsProbabilityMeasure (sourceEndpointWeightedProbability L r b) ∧\n (sourceEndpointWeightedProbability L r b).real E ≤\n (Real.sqrt C/c) * Real.sqrt ((sourceEndpo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_parameter_limits", + "line": 191, + "source_header": "ssianRegressionLimits\n\ntheorem sourceEndpoint_parameter_limits {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n (∀ᶠ r in 𝓝[>] (0 : ℝ), IsUnit (sourcePinCovarianceAt L r)) ∧\n Tendsto (fun r => toLp 2 (sourceEndpointMean L r b)) (𝓝[>] (0 : ℝ))\n (𝓝 (toLp 2 (sourceContactEndpointMean L b))) ∧\n Tendsto (sourceEndpointSchurAt L) (𝓝[>] (0 : ℝ))\n (𝓝 (sourceCon" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_uniform_parameter_bounds", + "line": 216, + "source_header": "hm\n · exact hp.2.2.2\n\ntheorem sourceEndpoint_uniform_parameter_bounds {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ M V δ : ℝ, 0 ≤ M ∧ 0 ≤ V ∧ 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → IsUnit (sourcePinCovarianceAt L r) ∧\n (∀ i, |sourceEndpointMean L r b i| ≤ M) ∧\n (∀ i, |sourceEndpoint" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_normalizer_floor", + "line": 239, + "source_header": "ntSchurAt] using hcov\n\n\n/- Normalizer assembly coauthored by actual OpenAI/Codex helper\n/root/dm2_landed_composition/peano_strategy; author-side only. -/\n/-- The actual every-pin source law has a positive small-radius physical\nnormalizer coefficient, with arbitrary fixed real prescribed height. -/\ntheorem sourceEndpoint_normalizer_floor {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n c * r^2 ≤ ∫ v, sourceEndpointWeight r v" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_estimates", + "line": 270, + "source_header": "le hrδ (min_le_left _ _))\n\ntheorem sourceEndpoint_estimates {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ →\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) ∧\n (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤ C*r^4 ∧\n c*r^2 ≤ ∫ v, sourceEndpointWeight r v" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_estimates_and_weighted_events", + "line": 291, + "source_header": "q,hbound,hfloor r hr hrF⟩\n\ntheorem sourceEndpoint_estimates_and_weighted_events {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ →\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) ∧\n (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤ C*r^4 ∧\n c*r^2 ≤ (∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b) ∧\n IsProbabilityMeasure (sourceEndpointWeightedProbability L r b) ∧\n ∀ E : Set (Fin 6 → ℝ), MeasurableSet E →\n (sourceEndpointWeightedProbability L r b).real E ≤\n (Real.sqrt C/c) * Real.sqrt ((sourceE" + }, + { + "kind": "def", + "unqualified_name": "sourcePhysicalEndpointLaw", + "line": 315, + "source_header": "rcePhysicalEndpointKernel\n\n/-- The canonical kernel of the actual physical normalized Hessian entries. -/\ndef sourcePhysicalEndpointLaw (L r b" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointLaw_eq", + "line": 319, + "source_header": "(sourcePrescribedPins r b)\n\n/-- Literal equality of the specified kernels at the prescribed pins, derived\nfrom their common residual law and the proved zero correction there. -/\ntheorem sourcePhysicalEndpointLaw_eq {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n sourcePhysicalEndpointLaw L" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointLaw_isProbabilityMeasure", + "line": 325, + "source_header": "ntKernel_at_prescribed hL r b\n\ntheorem sourcePhysicalEndpointLaw_isProbabilityMeasure {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n IsProbabilityMeasure (sou" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_eventually_hasCondDistrib", + "line": 330, + "source_header": "w_isProbabilityMeasure hL r b\n\n/-- Actual block limits supply current invertibility, hence the physical\nkernel is a conditional law at every sufficiently small positive radius. -/\ntheorem sourcePhysicalEndpointKernel_eventually_hasCondDistrib {L : ℝ} (hL : L ≠ 0) :\n ∀ᶠ r in 𝓝[>] (0 : ℝ),\n HasCondDistrib (sourceNormalizedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourcePhysicalEndp" + }, + { + "kind": "def", + "unqualified_name": "sourcePhysicalEndpointWeightedProbability", + "line": 339, + "source_header": "ntKernel_hasCondDistrib hL r hr\n\n/-- The explicit probability is weighted from the actual physical endpoint law. -/\ndef sourcePhysicalEndpointWeightedProbability" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointWeightedProbability_eq", + "line": 343, + "source_header": "w L r b) (sourceEndpointWeight r)\n\ntheorem sourcePhysicalEndpointWeightedProbability_eq {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n sourcePhysicalEndpointWeightedProbability L r b = source" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpoint_estimates_and_weighted_events", + "line": 348, + "source_header": "rcePhysicalEndpointLaw_eq hL r b]\n\n/-- Actual physical canonical endpoint moment, normalizer and measurable-event\nestimates, at arbitrary fixed height. No desired law, covariance limit,\nparameter bound or positive normalizer is a premise. -/\ntheorem sourcePhysicalEndpoint_estimates_and_weighted_events {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ →\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourcePhysicalEndpointLaw L r b) ∧\n (∫ v, sourceEndpointWeight r v ^ 2 ∂sourcePhysicalEndpointLaw L r b) ≤ C*r^4 ∧\n c*r^2 ≤ (∫ v, sourceEndpointWeight r v ∂sourcePhysicalEndpointLaw L r b) ∧\n IsProbabilityMeasure (sourcePhysicalEndpointWeightedProbability L r b) ∧\n ∀ E : Set (Fin 6 → ℝ), MeasurableSet E →\n (sourcePhysicalEndpointWeightedProbability L r b).real E ≤\n (Real.sqrt C/c) * Real.sqrt ((sourc" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/GaussianRegressionLimits.lean", + "sha256": "26c403ea1104fbce89f5c2833f603edd4d2703669d8a94a77b2c9a2a06b572be", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "regressionMean", + "line": 26, + "source_header": "e\n\n/-- The actual regression mean for a centered prior and target d. -/\ndef regressionMean {p t : Type*} [Fintype p] [DecidableEq p]\n (G : Matrix p p ℝ) (C : Matrix t p ℝ) (d : p → ℝ) : t" + }, + { + "kind": "def", + "unqualified_name": "regressionCovariance", + "line": 31, + "source_header": "ᵥ d\n\n/-- The Schur covariance; no inverse of this target block is taken. -/\ndef regressionCovariance {p t : Type*} [Fintype p] [DecidableEq p]\n (G : Matrix p p ℝ) (C : Matrix t p ℝ) (B : Matrix t t ℝ) : Matrix" + }, + { + "kind": "theorem", + "unqualified_name": "tendsto_matrix_mul_explicit", + "line": 36, + "source_header": "spose\n\nprivate theorem tendsto_matrix_mul_explicit {α p t q : Type*} [Fintype t]\n {u : Filter α} {A : α → Matrix p t ℝ} {A0 : Matrix p t ℝ}\n {B : α → Matrix t q ℝ} {B0 : Matrix t q ℝ}\n (hA : Tendsto A u (𝓝 A0)) (hB : Tendsto B u (𝓝 B0)) :\n Tendsto (fun r => A r * B r) u (𝓝 (A0 *" + }, + { + "kind": "theorem", + "unqualified_name": "tendsto_matrix_mulVec_explicit", + "line": 53, + "source_header": "k j))\n\nprivate theorem tendsto_matrix_mulVec_explicit {α p t : Type*} [Fintype t]\n {u : Filter α} {A : α → Matrix p t ℝ} {A0 : Matrix p t ℝ}\n {b : α → (t → ℝ)} {b0 : t → ℝ}\n (hA : Tendsto A u (𝓝 A0)) (hb : Tendsto b u (𝓝 b0)) :\n Tendsto (fun r => A r *ᵥ b r) u (𝓝 (A0 *ᵥ" + }, + { + "kind": "theorem", + "unqualified_name": "regression_parameter_limits", + "line": 67, + "source_header": "i j))\n\n/-- Continuous pin/target blocks give current invertibility and convergence\nof the inverse, noncentered regression mean and possibly singular covariance. -/\ntheorem regression_parameter_limits\n {p t a : Type*} [Fintype p] [DecidableEq p] [Fintype t]\n (u : Filter a)\n (G : a → Matrix p p ℝ) (C : a → Matrix t p ℝ)\n (B : a → Matrix t t ℝ) (d : a → p → ℝ)\n (G0 : Matrix p p ℝ) (C0 : Matrix t p ℝ) (B0 : Matrix t t ℝ) (d0 : p → ℝ)\n (hG : Tendsto G u (𝓝 G0)) (hC : Tendsto C u (𝓝 C0))\n (hB : Tendsto B u (𝓝 B0)) (hd : Tendsto d u (𝓝 d0)) (hG0 : IsUnit G0) :\n (∀ᶠ r in u, IsUnit (G r)) ∧\n Tendsto (fun r => (G r)⁻¹) u (𝓝 G0⁻¹) ∧\n Tendsto (fun r => regressionMean (G r) (C r) (d r)) u\n (𝓝 (regressionMean G0 C0 d0)) ∧\n Tendsto (fun r => regressionCovariance (G r) (C r) (B r)) u\n (𝓝 (regressionCovariance G0" + }, + { + "kind": "theorem", + "unqualified_name": "bounds_from_limits", + "line": 104, + "source_header": ", hcov⟩\n\nprivate theorem bounds_from_limits {ι : Type*} [Fintype ι]\n (f : ℝ → (ι → ℝ)) (g : ℝ → Matrix ι ι ℝ)\n (f0 : ι → ℝ) (g0 : Matrix ι ι ℝ)\n (hf : Tendsto f (𝓝[>] (0 : ℝ)) (𝓝 f0))\n (hg : Tendsto g (𝓝[>] (0 : ℝ)) (𝓝 g0)) :\n ∃ B V δ : ℝ, 0 ≤ B ∧ 0 ≤ V ∧ 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n (∀ i, |f r i| ≤ B) ∧ (∀ i, |g r i" + }, + { + "kind": "theorem", + "unqualified_name": "regression_uniform_bounds", + "line": 130, + "source_header": "hb.2.le\n\n\n/-- One small-radius interval supplies current invertibility and simultaneous\nmean/diagonal-covariance bounds, derived solely from the block limits. -/\ntheorem regression_uniform_bounds\n {p t : Type*} [Fintype p] [DecidableEq p] [Fintype t]\n (G : ℝ → Matrix p p ℝ) (C : ℝ → Matrix t p ℝ)\n (B : ℝ → Matrix t t ℝ) (d : ℝ → p → ℝ)\n (G0 : Matrix p p ℝ) (C0 : Matrix t p ℝ) (B0 : Matrix t t ℝ) (d0 : p → ℝ)\n (hG : Tendsto G (𝓝[>] (0 : ℝ)) (𝓝 G0))\n (hC : Tendsto C (𝓝[>] (0 : ℝ)) (𝓝 C0))\n (hB : Tendsto B (𝓝[>] (0 : ℝ)) (𝓝 B0))\n (hd : Tendsto d (𝓝[>] (0 : ℝ)) (𝓝 d0)) (hG0 : IsUnit G0) :\n ∃ M V δ : ℝ, 0 ≤ M ∧ 0 ≤ V ∧ 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → IsUnit (G r) ∧\n (∀ i, |regressionMean (G r) (C r) (d r) i| ≤ M) ∧\n (∀ i, |regressionCovariance (G r) (C r) (B r)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceConfluentPins.lean", + "sha256": "41e1ea1ef4f9960307552a8271a5c04d2b72d94736b98eb601b51669ed603c3f", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "confluentTransform", + "line": 21, + "source_header": "s\n\n/-- Literal raw-to-confluent transform, defined also at zero for notation. -/\ndef confluentTransform (r : ℝ) (v : Fin 6 → ℝ) : Fin 6" + }, + { + "kind": "def", + "unqualified_name": "rawTransform", + "line": 27, + "source_header": "r)]\n\n/-- The literal inverse, with the cubic correction to the two field values. -/\ndef rawTransform (r : ℝ) (p : Fin 6 → ℝ) : Fin" + }, + { + "kind": "theorem", + "unqualified_name": "rawTransform_confluentTransform", + "line": 34, + "source_header": "/ 2]\n\ntheorem rawTransform_confluentTransform (r : ℝ) (hr : r ≠ 0) (v : Fin 6 → ℝ) :\n rawTransform r (confluentTransform r v" + }, + { + "kind": "theorem", + "unqualified_name": "confluentTransform_rawTransform", + "line": 41, + "source_header": "ring\n\ntheorem confluentTransform_rawTransform (r : ℝ) (hr : r ≠ 0) (p : Fin 6 → ℝ) :\n confluentTransform r (rawTransform r p" + }, + { + "kind": "def", + "unqualified_name": "confluentEquiv", + "line": 48, + "source_header": "ring\n\n/-- For every nonzero separation, the confluent frame is an actual continuous\nlinear equivalence. No covariance invertibility is assumed or asserted. -/\ndef confluentEquiv (r : ℝ) (hr : r ≠ 0) : (Fin 6 → ℝ) ≃L[ℝ] (Fin 6 → ℝ) where" + }, + { + "kind": "theorem", + "unqualified_name": "prescribed_target", + "line": 70, + "source_header": ":= rfl\n\n/-- The literal prescribed raw pins keep arbitrary height and have zero first\nconfluent derivative. The normalized third confluent pin is exactly two. -/\ntheorem prescribed_target (r b : ℝ) (hr : r ≠ 0) :\n confluentEquiv r hr ![b, b - r ^ 3 / 6, 0, 0, 0, 0] =\n ![b - r ^ 3 / 12, 0, 0," + }, + { + "kind": "def", + "unqualified_name": "endpointM", + "line": 78, + "source_header": "<;> ring\n\ndef endpointM (r : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "endpointS", + "line": 80, + "source_header": "r / 2, 0]\ndef endpointS (r : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "directionX", + "line": 81, + "source_header": "r / 2, 0]\ndef directionX :" + }, + { + "kind": "def", + "unqualified_name": "directionY", + "line": 82, + "source_header": "= ![1, 0]\ndef directionY :" + }, + { + "kind": "def", + "unqualified_name": "rawPins", + "line": 83, + "source_header": "= ![0, 1]\n\n/-- Actual field values and actual directional x/y first derivatives of the\nunchanged smooth Fourier source, in the literal raw pin order. -/\ndef rawPins (L r : ℝ) (ω : SmoothSample 2 L)" + }, + { + "kind": "theorem", + "unqualified_name": "rawPins_hasGaussianLaw", + "line": 93, + "source_header": "directionY]\n\n/-- Joint Gaussianity is derived from one heterogeneous vector of actual\norder-zero and order-one observations; no observation independence is used. -/\ntheorem rawPins_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n HasGaussianLaw (rawPins L r) (s" + }, + { + "kind": "def", + "unqualified_name": "confluentPins", + "line": 109, + "source_header": "v_one_apply _\n\n/-- Actual confluent observations are the proved linear image of raw pins. -/\ndef confluentPins (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2" + }, + { + "kind": "theorem", + "unqualified_name": "confluentPins_hasGaussianLaw", + "line": 113, + "source_header": "(rawPins L r ω)\n\ntheorem confluentPins_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n HasGaussianLaw (confluentPins L r hr)" + }, + { + "kind": "def", + "unqualified_name": "rawPinsWithHessians", + "line": 117, + "source_header": "uentEquiv r hr)\n\n/-- One literal vector containing the raw six pins followed by endpoint Hessian\nentries `(fxxM,fxyM,fyyM,fxxS,fxyS,fyyS)`. No r-dependent midpoint jet is used. -/\ndef rawPinsWithHessians (L r : ℝ) (ω : SmoothSample" + }, + { + "kind": "theorem", + "unqualified_name": "rawPinsWithHessians_hasGaussianLaw", + "line": 129, + "source_header": "onY, directionY]]\n\n/-- The pin and Hessian observations are jointly Gaussian, derived together\nfrom their single actual derivative vector rather than separate marginal laws. -/\ntheorem rawPinsWithHessians_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n HasGaussianLaw (rawPinsWithHessians L" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceSmoothPalm.lean", + "sha256": "1b1d47b640b541195dad1472a07fa9490f203bd1619b1759b29587a0effe631d", + "declarations_lexical": [ + { + "kind": "lemma", + "unqualified_name": "withDensity_map_comp", + "line": 27, + "source_header": "m\n\nlemma withDensity_map_comp {Ω E : Type*} [MeasurableSpace Ω] [MeasurableSpace E]\n (μ : Measure Ω) (F : Ω → E) (w : E → ℝ≥0∞) (hF : Measurable F)\n (hw : Measurable w) :\n (μ.withDensity (fun ω => w (F ω))).map F = (μ.map F).withDensity" + }, + { + "kind": "theorem", + "unqualified_name": "prwMeasure_map_comp", + "line": 35, + "source_header": "]\n\n/-- Normalized weighting commutes exactly with a measurable pushforward.\nThe two normalizers are derived to be equal; no positivity or integrability premise is needed. -/\ntheorem prwMeasure_map_comp {Ω E : Type*} [MeasurableSpace Ω] [MeasurableSpace E]\n (μ : Measure Ω) (F : Ω → E) (W : E → ℝ) (hF : Measurable F)\n (hW : Measurable W) :\n (prwMeasure μ (W ∘ F)).map F = prwMeasure (μ.map F" + }, + { + "kind": "lemma", + "unqualified_name": "prwMeasure_absolutelyContinuous", + "line": 48, + "source_header": "op)\n\nlemma prwMeasure_absolutelyContinuous {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) : prwMeasure μ W" + }, + { + "kind": "lemma", + "unqualified_name": "prwMeasure_ae_of_ae", + "line": 52, + "source_header": "_ _\n\nlemma prwMeasure_ae_of_ae {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) {p : Ω → Prop} (hp : ∀ᵐ ω ∂μ, p ω) :\n ∀ᵐ ω ∂prwMeasure μ W," + }, + { + "kind": "lemma", + "unqualified_name": "prwMeasure_ae_weight_pos", + "line": 57, + "source_header": "hp\n\nlemma prwMeasure_ae_weight_pos {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Measurable W)\n (hZ : 0 < ∫ ω, W ω ∂μ) :\n ∀ᵐ ω ∂prwMeasure μ W, 0 <" + }, + { + "kind": "def", + "unqualified_name": "sourceSmoothLaw", + "line": 67, + "source_header": "hd\n\ndef sourceSmoothLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ) : Measure (SmoothSample 2" + }, + { + "kind": "instance", + "unqualified_name": "sourceSmoothLaw_isProbabilityMeasure", + "line": 70, + "source_header": "b)\n\ninstance sourceSmoothLaw_isProbabilityMeasure {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n IsProbabilityMeasure (sourceSmoothLaw hL r" + }, + { + "kind": "lemma", + "unqualified_name": "rawPins_prescribed_iff", + "line": 75, + "source_header": "nce\n\nlemma rawPins_prescribed_iff {L : ℝ} (r b : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :\n rawPins L r ω = ![b,b-r^3/6,0,0,0,0] ↔\n sourceConfluentPinsAt L r ω = sourcePrescribedPins" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_raw_pin_fiber", + "line": 83, + "source_header": "ymm\n\ntheorem sourceSmoothLaw_raw_pin_fiber {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n sourceSmoothLaw hL r b {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]}" + }, + { + "kind": "lemma", + "unqualified_name": "sourceRawPins_measurable", + "line": 93, + "source_header": "b)\n\nlemma sourceRawPins_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n Measurable (rawPins L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_raw_pin_fiber_ae", + "line": 104, + "source_header": "r)\n\ntheorem sourceSmoothLaw_raw_pin_fiber_ae {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n ∀ᵐ ω ∂sourceSmoothLaw hL r b, rawPins L r ω = ![b,b-r^3/6,0,0,0" + }, + { + "kind": "theorem", + "unqualified_name": "raw_pin_fiber_of_absolutelyContinuous", + "line": 111, + "source_header": "hG\n\n/-- Every probability measure absolutely continuous with respect to the actual conditioned\ncarrier law retains its exact prescribed raw values and zero gradients. -/\ntheorem raw_pin_fiber_of_absolutelyContinuous {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))\n (ν : Measure (SmoothSample 2 L)) [IsProbabilityMeasure ν]\n (hν : ν ≪ sourceSmoothLaw hL r b) :\n ν {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]" + }, + { + "kind": "theorem", + "unqualified_name": "prwMeasure_raw_pin_fiber", + "line": 122, + "source_header": "r hG)\n\ntheorem prwMeasure_raw_pin_fiber {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) (W : SmoothSample 2 L → ℝ)\n [IsProbabilityMeasure (prwMeasure (sourceSmoothLaw hL r b) W)] :\n prwMeasure (sourceSmoothLaw hL r b) W\n {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]" + }, + { + "kind": "def", + "unqualified_name": "sourceRawHM", + "line": 130, + "source_header": "s _ _\n\n/-- Literal actual symmetric endpoint Hessian entries at M. -/\ndef sourceRawHM (L r : ℝ) (ω : SmoothSample 2 L) : Matrix (Fin 2) (F" + }, + { + "kind": "def", + "unqualified_name": "sourceRawHS", + "line": 135, + "source_header": "7,v 8]\n\n/-- Literal actual symmetric endpoint Hessian entries at S. -/\ndef sourceRawHS (L r : ℝ) (ω : SmoothSample 2 L) : Matrix (Fin 2)" + }, + { + "kind": "def", + "unqualified_name": "sourceSmoothTyped", + "line": 140, + "source_header": "10,v 11]\n\ndef sourceSmoothTyped (L r : ℝ) (ω : SmoothSample 2" + }, + { + "kind": "def", + "unqualified_name": "sourceSmoothWeight", + "line": 143, + "source_header": ").det < 0\n\n/-- Strict maximum/saddle determinant weight of the actual field at its two endpoints. -/\ndef sourceSmoothWeight (L r : ℝ) (ω : SmoothSamp" + }, + { + "kind": "lemma", + "unqualified_name": "sourceRawHM_eq_normalized", + "line": 148, + "source_header": "det| else 0\n\nlemma sourceRawHM_eq_normalized (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :\n sourceRawHM L r ω = egm_HM r (sourcePhysicalCoordinates (sourceNormalizedEndpoi" + }, + { + "kind": "lemma", + "unqualified_name": "sourceRawHS_eq_normalized", + "line": 155, + "source_header": "d_simp [hr]\n\nlemma sourceRawHS_eq_normalized (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :\n sourceRawHS L r ω = egm_HS r (sourcePhysicalCoordinates (sourceNormalizedEndpoi" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeight_eq", + "line": 162, + "source_header": "d_simp [hr]\n\ntheorem sourceSmoothWeight_eq (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :\n sourceSmoothWeight L r ω = sourceEndpointWeight r (sourceNormalizedEndpo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeight_nonneg", + "line": 168, + "source_header": "ifs <;> rfl\n\ntheorem sourceSmoothWeight_nonneg (L r : ℝ) (ω : SmoothSample 2 L) :\n 0 ≤ sourceSmoothW" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeight_measurable", + "line": 175, + "source_header": "xact le_rfl\n\ntheorem sourceSmoothWeight_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n Measurable (sourceSmooth" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeight_pos_iff", + "line": 182, + "source_header": "rable hL r)\n\ntheorem sourceSmoothWeight_pos_iff (L r : ℝ) (ω : SmoothSample 2 L) :\n 0 < sourceSmoothWeight L r ω ↔ sourceSmooth" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothTyped_measurableSet", + "line": 195, + "source_header": "Weight, ht]\n\ntheorem sourceSmoothTyped_measurableSet {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n MeasurableSet {ω : SmoothSample 2 L | sourceSmoothT" + }, + { + "kind": "def", + "unqualified_name": "sourceSmoothWeightedLaw", + "line": 204, + "source_header": "le hL r hr)\n\n/-- The whole-carrier probability defined by the literal normalized actual determinant density. -/\ndef sourceSmoothWeightedLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ) : Measure (Smoo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_endpoint_hasLaw", + "line": 208, + "source_header": "thWeight L r)\n\ntheorem sourceSmoothLaw_endpoint_hasLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasLaw (sourceNormalizedEndpoints L r) (sourcePhysicalEndpointLaw L r b)\n (sourceSmoo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_weight_square_integrable", + "line": 215, + "source_header": "map hL r b hG\n\ntheorem sourceSmoothLaw_weight_square_integrable {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))\n (hsq : Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourcePhysicalEndpointLaw L r b)) :\n Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_weight_integral", + "line": 222, + "source_header": "able_comp hsq\n\ntheorem sourceSmoothLaw_weight_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) =\n ∫ v, sourceEndpointWeight r v ∂sourcePhysicalEndp" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_weight_square_integral", + "line": 230, + "source_header": "glyMeasurable\n\ntheorem sourceSmoothLaw_weight_square_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) =\n ∫ v, sourceEndpointWeight r v ^ 2 ∂sourcePhysicalEndp" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeightedLaw_endpoint_map", + "line": 238, + "source_header": "glyMeasurable\n\n/-- Exact endpoint pushforward of the literal weighted whole-carrier law. -/\ntheorem sourceSmoothWeightedLaw_endpoint_map {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (sourceSmoothWeightedLaw hL r b).map (sourceNormalizedEndpoints L r) =\n sourcePhysicalEndpointWeightedPr" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmooth_weighted_event_bound_of_estimates", + "line": 249, + "source_header": "r b hG).map_eq]\n\n/-- The event estimate applies to every measurable event of the actual smooth carrier. -/\ntheorem sourceSmooth_weighted_event_bound_of_estimates {L : ℝ} (hL : L ≠ 0)\n (r b C c : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)\n (hsq : Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoothLaw hL r b))\n (hmoment : (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) ≤ C*r^4)\n (hfloor : c*r^2 ≤ ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b)\n (E : Set (SmoothSample 2 L)) (hE : MeasurableSet E) :\n IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧\n (sourceSmoothWeightedLaw hL r b).real E ≤\n (Real.sqrt C/c) * Real.sqrt ((sourceSmoothLa" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeightedLaw_typed", + "line": 263, + "source_header": "oment hfloor E hE\n\n/-- The literal density is positive only on the strict maximum/saddle type, which has full mass. -/\ntheorem sourceSmoothWeightedLaw_typed {L : ℝ} (hL : L ≠ 0) (r b : ℝ) (hr : r ≠ 0)\n [IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)]\n (hZ : 0 < ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) :\n sourceSmoothWeightedLaw hL r b {ω | sourceSmo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeightedLaw_raw_pins", + "line": 274, + "source_header": "os_iff L r ω).mp hω\n\n/-- The density preserves the exact raw prescribed values and all four zero first derivatives. -/\ntheorem sourceSmoothWeightedLaw_raw_pins {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))\n [IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)] :\n sourceSmoothWeightedLaw hL r b {ω | rawPins L r ω = ![b," + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothPalm_estimates", + "line": 283, + "source_header": "urceSmoothWeight L r)\n\n/-- Actual whole-carrier determinant moments, normalizer, probability and event transfer.\nOnly the period and fixed prescribed height are inputs; actual covariance limits supply\nall sufficiently-small-radius invertibility needed by the literal endpoint marginal. -/\ntheorem sourceSmoothPalm_estimates {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ →\n Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoothLaw hL r b) ∧\n (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) ≤ C*r^4 ∧\n c*r^2 ≤ (∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) ∧\n IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧\n (∀ E : Set (SmoothSample 2 L), MeasurableSet E →\n (sourceSmoothWeightedLaw hL r b).real E ≤\n (Real.sqrt C/c) * Real.sqrt ((sourceSmoothLaw hL r b).real E)) ∧\n (sourceSmoothWeightedLaw hL r b).map (sourceNormalizedEndpoints L r) =\n sourcePhysicalEndpointWeightedProbability L r b ∧\n sourceSmoothWeightedLaw hL r b\n {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 ∧\n sourceSmoothWeightedLaw hL r b {ω | sourc" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceConditionalMajorant.lean", + "sha256": "07ae7796e461a2ee59a757b37a3e64f7ed31c76d26a3b40825f23170fcb4e691", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sampleMajorant", + "line": 26, + "source_header": "t\n\ndef sampleMajorant {L : ℝ} (w : SourceMode 2 → ℝ) (ω : SmoothSample 2 L) :" + }, + { + "kind": "def", + "unqualified_name": "sourceDerivativeMajorant", + "line": 29, + "source_header": "|\n\ndef sourceDerivativeMajorant (L : ℝ) (k : ℕ) (ω : SmoothSample 2 L) :" + }, + { + "kind": "theorem", + "unqualified_name": "sampleMajorant_nonneg", + "line": 32, + "source_header": "ω\n\ntheorem sampleMajorant_nonneg {L : ℝ} (w : SourceMode 2 → ℝ)\n (hw : ∀ m, 0 ≤ w m) (ω : SmoothSample 2 L) : 0 ≤ sampleMajorant w" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeMajorant_weighted_summable", + "line": 36, + "source_header": ")\n\ntheorem derivativeMajorant_weighted_summable {L : ℝ} (ω : SmoothSample 2 L)\n (k : ℕ) (u : Fin k → (Fin 2 → ℝ)) :\n Summable (fun m => derivativeMajorant 2 L k u m * |ω.val m|" + }, + { + "kind": "theorem", + "unqualified_name": "confluentMajorant_weighted_summable", + "line": 42, + "source_header": "h\n\ntheorem confluentMajorant_weighted_summable {L : ℝ} (ω : SmoothSample 2 L) :\n Summable (fun m => confluentModeMajorant L m * |ω.val m|" + }, + { + "kind": "theorem", + "unqualified_name": "pinCoefficient_abs_le", + "line": 52, + "source_header": "]\n\ntheorem pinCoefficient_abs_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)\n (i : Fin 6) (m : SourceMode 2) : |pinCoefficient L r i m| ≤ confluentModeMajorant L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPins_abs_le", + "line": 57, + "source_header": "m\n\ntheorem sourceConfluentPins_abs_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)\n (ω : SmoothSample 2 L) (i : Fin 6) :\n |sourceConfluentPinsAt L r ω i| ≤ sampleMajorant (confluentModeMajorant L)" + }, + { + "kind": "theorem", + "unqualified_name": "six_mulVec_abs_le", + "line": 69, + "source_header": "h\n\nprivate theorem six_mulVec_abs_le (M : Matrix (Fin 6) (Fin 6) ℝ)\n (K T : ℝ) (hK : 0 ≤ K) (_hT : 0 ≤ T)\n (hM : ∀ i j, |M i j| ≤ K) (y : Fin 6 → ℝ) (hy : ∀ j, |y j| ≤ T) (i : Fin 6) :\n |(M *ᵥ y) i| ≤ 6*K*" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_abs_le", + "line": 80, + "source_header": "g\n\ntheorem pinLift_abs_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)\n (K D : ℝ) (hK : 0 ≤ K) (hD : 0 ≤ D)\n (hInv : ∀ i j, |(sourcePinCovarianceAt L r)⁻¹ i j| ≤ K)\n (x : Fin 6 → ℝ) (hx : ∀ i, |x i| ≤ D) (ω : SmoothSample 2 L) (m : SourceMode 2) :\n |pinLift L r (x - sourceConfluentPinsAt L r ω) m| ≤\n 36*K*confluentModeMajorant L m *\n (D + sampleMajorant (confluentModeMajorant L) ω" + }, + { + "kind": "theorem", + "unqualified_name": "posterior_sampleMajorant_le", + "line": 106, + "source_header": "g\n\n/-- The deterministic posterior bound includes every required summability\npremise for a general weight. Source derivative weights supply it pointwise. -/\ntheorem posterior_sampleMajorant_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)\n (w : SourceMode 2 → ℝ) (hw0 : ∀ m, 0 ≤ w m)\n (hwA : Summable (fun m => w m * confluentModeMajorant L m))\n (K D : ℝ) (hK : 0 ≤ K) (hD : 0 ≤ D)\n (hInv : ∀ i j, |(sourcePinCovarianceAt L r)⁻¹ i j| ≤ K)\n (x : Fin 6 → ℝ) (hx : ∀ i, |x i| ≤ D) (ω : SmoothSample 2 L)\n (hwω : Summable (fun m => w m * |ω.val m|)) :\n Summable (fun m => w m * |(posteriorSample hL r x ω).val m|) ∧\n sampleMajorant w (posteriorSample hL r x ω) ≤ sampleMajorant w ω +\n 36*K*(∑' m, w m * confluentModeMajorant L m)*\n (D + sampleMajorant (confluentModeMajorant L)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceInverse_prescribed_uniform_bounds", + "line": 145, + "source_header": "ing\n\n/-- Actual inverse continuity and the actual prescribed pin limit derive the\nuniform constants used by the posterior bound; neither is a model premise. -/\ntheorem sourceInverse_prescribed_uniform_bounds {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ K D δ : ℝ, 0 ≤ K ∧ 0 ≤ D ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ →\n (∀ i j, |(sourcePinCovarianceAt L r)⁻¹ i j| ≤ K) ∧\n (∀ i, |sourcePrescribedPins r b i|" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_global_derivative_bound", + "line": 184, + "source_header": ".2.le\n\n/-- Every actual derivative is bounded globally in its evaluation point by\nthe literal all-order Fourier absolute majorant on the smooth carrier. -/\ntheorem smoothSourceField_global_derivative_bound {L : ℝ} (hL : L ≠ 0)\n (k : ℕ) (ω : SmoothSample 2 L) (x : Fin 2 → ℝ) :\n ‖iteratedFDeriv ℝ k (smoothSourceField 2 L ω) x‖ ≤ sourceDerivativeMajoran" + }, + { + "kind": "theorem", + "unqualified_name": "sampleMajorant_measurable", + "line": 204, + "source_header": "using h\n\ntheorem sampleMajorant_measurable (L : ℝ) (w : SourceMode 2 → ℝ) :\n Measurable (sampleMajo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceDerivativeMajorant_measurable", + "line": 209, + "source_header": "pe_coe)\n\ntheorem sourceDerivativeMajorant_measurable (L : ℝ) (k : ℕ) :\n Measurable (sourceDerivativeMajora" + }, + { + "kind": "theorem", + "unqualified_name": "sampleMajorant_add", + "line": 212, + "source_header": "ble L _\n\ntheorem sampleMajorant_add {L : ℝ} (w v : SourceMode 2 → ℝ) (ω : SmoothSample 2 L)\n (hw : Summable (fun m => w m * |ω.val m|))\n (hv : Summable (fun m => v m * |ω.val m|)) :\n sampleMajorant (fun m => w m+v m) ω = sampleMajorant w ω + sampleMajor" + }, + { + "kind": "theorem", + "unqualified_name": "sampleMajorant_const_mul", + "line": 220, + "source_header": "_add hv\n\ntheorem sampleMajorant_const_mul {L : ℝ} (c : ℝ) (w : SourceMode 2 → ℝ)\n (ω : SmoothSample 2 L) :\n sampleMajorant (fun m => c*w m) ω = c*sampleMajor" + }, + { + "kind": "theorem", + "unqualified_name": "sourceDerivativeMajorant_uniform_domination", + "line": 227, + "source_header": "ul_left\n\n/-- The posterior is dominated by one fixed positive summable weight plus\nits retained drift, uniformly at every sufficiently small positive radius. -/\ntheorem sourceDerivativeMajorant_uniform_domination {L : ℝ} (hL : L ≠ 0)\n (b : ℝ) (k : ℕ) :\n ∃ a : ℝ, ∃ w : SourceMode 2 → ℝ, ∃ δ : ℝ,\n 0 ≤ a ∧ (∀ m, 0 ≤ w m) ∧ Summable w ∧ 0 < ∑' m, w m ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ → ∀ ω : SmoothSample 2 L,\n sourceDerivativeMajorant L k (posteriorSample hL r (sourcePrescribedPins r b) ω) ≤\n a + sampleMaj" + }, + { + "kind": "theorem", + "unqualified_name": "source_coordinate_hasLaw", + "line": 275, + "source_header": "w0]; ring\n\ntheorem source_coordinate_hasLaw {L : ℝ} (hL : L ≠ 0) (m : SourceMode 2) :\n HasLaw (fun ω : SmoothSample 2 L => ω.val m) (gaussianReal 0 1) (smoothLaw 2 L) where\n aem" + }, + { + "kind": "theorem", + "unqualified_name": "sampleMajorant_prior_moment", + "line": 280, + "source_header": "al 2 hL m\n\ntheorem sampleMajorant_prior_moment {L : ℝ} (hL : L ≠ 0)\n (w : SourceMode 2 → ℝ) (hw0 : ∀ m, 0 ≤ w m) (hw : Summable w) (n : ℕ) :\n Integrable (fun ω : SmoothSample 2 L => sampleMajorant w ω ^ n) (smoothLaw 2 L) ∧\n (∫ ω, sampleMajorant w ω ^ n ∂smoothLaw 2 L) ≤\n (∑' m, w m)^n * standardAb" + }, + { + "kind": "theorem", + "unqualified_name": "drift_majorant_integrable_pow", + "line": 291, + "source_header": "Law hL) n\n\nprivate theorem drift_majorant_integrable_pow {L : ℝ} (hL : L ≠ 0)\n (a : ℝ) (ha : 0 ≤ a) (w : SourceMode 2 → ℝ) (hw0 : ∀ m, 0 ≤ w m)\n (hw : Summable w) (n : ℕ) :\n Integrable (fun ω : SmoothSample 2 L => (a+sampleMajorant w ω)^n) (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConditionalDerivative_moments", + "line": 305, + "source_header": "hw0 ω) n\n\n/-- Every natural conditional derivative-majorant moment is derived from the\nactual posterior sampling map; the common small-radius interval is uniform in n. -/\ntheorem sourceConditionalDerivative_moments {L : ℝ} (hL : L ≠ 0) (b : ℝ) (k : ℕ) :\n ∃ δ : ℝ, 0 < δ ∧ δ ≤ 1 ∧ ∀ n : ℕ, ∃ M : ℝ, 0 ≤ M ∧\n ∀ r : ℝ, 0 < r → r < δ →\n Integrable (fun ω => sourceDerivativeMajorant L k ω ^ n)\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)) ∧\n (∫ ω, sourceDerivativeMajorant L k ω ^ n\n ∂sourceSmoothKernel hL r (sourcePrescribedPin" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConditionalDerivative_cutoff_tail", + "line": 344, + "source_header": "t hF hpoint\n\n/-- Markov gives every polynomial rate for the literal measurable majorant\ncutoff. This event certifies the global derivative bound without a supremum. -/\ntheorem sourceConditionalDerivative_cutoff_tail {L : ℝ} (hL : L ≠ 0)\n (b : ℝ) (k n : ℕ) :\n ∃ M δ : ℝ, 0 ≤ M ∧ 0 < δ ∧ δ ≤ 1 ∧ ∀ r : ℝ, 0 < r → r < δ →\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)).real\n {ω | r⁻¹ < sourceDerivativeMajorant L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConditionalDerivative_gaussian_upper_tail", + "line": 375, + "source_header": "nneg hr.le n)\n\n/-- A genuine Gaussian upper tail follows from the independently proved\nfolded-Gaussian exponential estimate, with the posterior drift retained. -/\ntheorem sourceConditionalDerivative_gaussian_upper_tail {L : ℝ} (hL : L ≠ 0)\n (b : ℝ) (k : ℕ) :\n ∃ a s δ : ℝ, 0 ≤ a ∧ 0 < s ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ → ∀ R : ℝ, 0 ≤ R →\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)).real\n {ω | a+R ≤ sourceDerivativeMajorant L k ω} ≤\n 2*Real.exp (" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeightedDerivative_cutoff_tail", + "line": 411, + "source_header": "_ ≤ _ := htail\n\n/-- The same measurable cutoff has every polynomial rate under the actual\nwhole-carrier endpoint-weighted law. This is an explicit weighted probability,\nwith no identification with a geometric Kac–Rice/Palm law asserted. -/\ntheorem sourceWeightedDerivative_cutoff_tail {L : ℝ} (hL : L ≠ 0)\n (b : ℝ) (k n : ℕ) :\n ∃ M δ : ℝ, 0 ≤ M ∧ 0 < δ ∧ δ ≤ 1 ∧ ∀ r : ℝ, 0 < r → r < δ →\n IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧\n (sourceSmoothWeightedLaw hL r b).real\n {ω | r⁻¹ < sourceDerivativeMajora" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/ConfluentIntegralIdentities.lean", + "sha256": "0324d7556d485cd360a513587199354fa1f3863d15cf06b52c86e362de5e56b8", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "pin3", + "line": 23, + "source_header": "s\n\ndef pin3 (F : ℝ → ℝ) (r : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "pin4", + "line": 26, + "source_header": "r\n\ndef pin4 (H : ℝ → ℝ) (r : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "pin5", + "line": 29, + "source_header": "r\n\ndef pin5 (F : ℝ → ℝ) (r : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "scaled_hasDerivAt", + "line": 33, + "source_header": ")\n\nprivate theorem scaled_hasDerivAt (g g' : ℝ → ℝ)\n (hg : ∀ x, HasDerivAt g (g' x) x) (r u : ℝ) :\n HasDerivAt (fun u => g (r * u)) (r * g' (r * u))" + }, + { + "kind": "theorem", + "unqualified_name": "average_identity", + "line": 40, + "source_header": "]\n\nprivate theorem average_identity (g g' : ℝ → ℝ)\n (hg : ∀ x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : ℝ) (hr : r ≠ 0) :\n (g (r / 2) - g (-r / 2)) / r =\n ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), g' (r * u" + }, + { + "kind": "theorem", + "unqualified_name": "left_endpoint_identity", + "line": 56, + "source_header": "]\n\nprivate theorem left_endpoint_identity (g g' : ℝ → ℝ)\n (hg : ∀ x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : ℝ) (hr : r ≠ 0) :\n (g (-r/2) - ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), g (r*u)) / r =\n -(∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/2-u) * g' (r*u)" + }, + { + "kind": "theorem", + "unqualified_name": "right_endpoint_identity", + "line": 82, + "source_header": "]\n\nprivate theorem right_endpoint_identity (g g' : ℝ → ℝ)\n (hg : ∀ x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : ℝ) (hr : r ≠ 0) :\n (g (r/2) - ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), g (r*u)) / r =\n ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (u+1/2) * g' (r*u" + }, + { + "kind": "theorem", + "unqualified_name": "peano_identity", + "line": 107, + "source_header": "]\n\nprivate theorem peano_identity (f f1 f2 f3 : ℝ → ℝ)\n (h0 : ∀ x, HasDerivAt f (f1 x) x)\n (h1 : ∀ x, HasDerivAt f1 (f2 x) x)\n (h2 : ∀ x, HasDerivAt f2 (f3 x) x) (hc3 : Continuous f3)\n (r : ℝ) (hr : r ≠ 0) :\n (12 / r ^ 2) * ((f1 (r/2) + f1 (-r/2))/2 - (f (r/2) - f (-r/2))/r) =\n 6 * ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/4-u^2) * f3 (r*u" + }, + { + "kind": "theorem", + "unqualified_name": "iterated_hasDerivAt", + "line": 140, + "source_header": "]\n\nprivate theorem iterated_hasDerivAt {F : ℝ → ℝ} {n : ℕ}\n (hF : ContDiff ℝ n F) (k : ℕ) (hk : k < n) (x : ℝ) :\n HasDerivAt (iteratedDeriv k F) (iteratedDeriv (k+1) F x)" + }, + { + "kind": "theorem", + "unqualified_name": "pin3_integral", + "line": 146, + "source_header": "t\n\n/-- The x-derivative divided difference is the exact average second derivative. -/\ntheorem pin3_integral (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :\n pin3 F r = ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), iteratedDeriv 2 F (r" + }, + { + "kind": "theorem", + "unqualified_name": "pin4_integral", + "line": 153, + "source_header": "hr\n\n/-- H is the y-derivative curve: the pin uses H itself, not its derivative. -/\ntheorem pin4_integral (H : ℝ → ℝ) (hH : ContDiff ℝ 2 H) (r : ℝ) (hr : r ≠ 0) :\n pin4 H r = ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), deriv H" + }, + { + "kind": "theorem", + "unqualified_name": "pin5_integral", + "line": 160, + "source_header": "r hr\n\n/-- The exact cubic confluent pin is its normalized Peano-kernel integral. -/\ntheorem pin5_integral (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :\n pin5 F r = 6 * ∫ u in (-1/2 : ℝ)..(1/2 : ℝ),\n (1/4-u^2) * iteratedDeriv 3" + }, + { + "kind": "theorem", + "unqualified_name": "adjusted_second_left", + "line": 171, + "source_header": ")) r hr\n\ntheorem adjusted_second_left (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :\n (iteratedDeriv 2 F (-r/2) - pin3 F r) / r =\n -(∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/2-u) * iteratedDeriv 3 F" + }, + { + "kind": "theorem", + "unqualified_name": "adjusted_second_right", + "line": 179, + "source_header": ")) r hr\n\ntheorem adjusted_second_right (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :\n (iteratedDeriv 2 F (r/2) - pin3 F r) / r =\n ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (u+1/2) * iteratedDeriv 3" + }, + { + "kind": "theorem", + "unqualified_name": "adjusted_transverse_left", + "line": 187, + "source_header": ")) r hr\n\ntheorem adjusted_transverse_left (H : ℝ → ℝ) (hH : ContDiff ℝ 2 H) (r : ℝ) (hr : r ≠ 0) :\n (deriv H (-r/2) - pin4 H r) / r =\n -(∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/2-u) * iteratedDeriv 2 H" + }, + { + "kind": "theorem", + "unqualified_name": "adjusted_transverse_right", + "line": 195, + "source_header": ")) r hr\n\ntheorem adjusted_transverse_right (H : ℝ → ℝ) (hH : ContDiff ℝ 2 H) (r : ℝ) (hr : r ≠ 0) :\n (deriv H (r/2) - pin4 H r) / r =\n ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (u+1/2) * iteratedDeriv 2" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceContactEndpointParameters.lean", + "sha256": "da5337a7814a008eaa8b8a98c0df4daf3efb1bc347789a2f75efc63c9c258d01", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sourceContactA", + "line": 22, + "source_header": "t\n\n/-- The literal mixed third derivative A=fxxy at the origin. -/\ndef sourceContactA (L : ℝ) (ω : SmoothSample 2 L)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointVector", + "line": 26, + "source_header": "E1]\n\n/-- The actual limiting adjusted endpoints, in the normalizer's six-coordinate order. -/\ndef sourceContactEndpointVector (L : ℝ) (ω : SmoothSample 2 L) : Fin" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointCrossCovariance", + "line": 32, + "source_header": "L ω]\n\n/-- Literal limiting endpoint/pin cross covariance C0. -/\ndef sourceContactEndpointCrossCovariance (L : ℝ) : Matrix (Fin 6) (F" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointCovariance", + "line": 37, + "source_header": "aw 2 L)\n\n/-- Literal limiting endpoint covariance B0. -/\ndef sourceContactEndpointCovariance (L : ℝ) : Matrix (Fin 6)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointRegression", + "line": 42, + "source_header": "hLaw 2 L)\n\ndef sourceContactEndpointRegression (L : ℝ) : Matrix (Fin 6)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactPinValue", + "line": 45, + "source_header": "ance L)⁻¹\n\n/-- The prescribed limiting pin retains an arbitrary level b. -/\ndef sourceContactPinValue (b : ℝ)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointMean", + "line": 48, + "source_header": ",0,0,0,0,2]\n\ndef sourceContactEndpointMean (L b : ℝ)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointSchur", + "line": 51, + "source_header": "tPinValue b\n\ndef sourceContactEndpointSchur (L : ℝ) : Matrix (Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointResidual", + "line": 56, + "source_header": "ariance L)ᵀ\n\ndef sourceContactEndpointResidual (L : ℝ) (ω : SmoothSample 2 L)" + }, + { + "kind": "theorem", + "unqualified_name": "contact_generic_residual_covariance", + "line": 60, + "source_header": "nVector L ω\n\nprivate theorem contact_generic_residual_covariance {Ω ι κ : Type*} [MeasurableSpace Ω]\n [Fintype ι] [DecidableEq ι] [Fintype κ] [DecidableEq κ]\n {P : Measure Ω} [IsFiniteMeasure P]\n (J : Ω → ι → ℝ) (T : Ω → κ → ℝ)\n (hJ : ∀ i, MemLp (fun ω => J ω i) 2 P)\n (hT : ∀ i, MemLp (fun ω => T ω i) 2 P)\n (hG : IsUnit (Matrix.of (fun i j => covariance (fun ω => J ω i) (fun ω => J ω j) P) : Matrix ι ι ℝ)) :\n let G : M" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactA_memLp", + "line": 129, + "source_header": "m] using hp\n\nprivate theorem sourceContactA_memLp {L : ℝ} (hL : L ≠ 0) :\n MemLp (sourceContactA L) 2 (smo" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePin_memLp", + "line": 134, + "source_header": ").memLp_two\n\nprivate theorem sourcePin_memLp {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :\n MemLp (fun ω => sourcePinVector L ω i) 2 (smo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpoint_memLp", + "line": 138, + "source_header": ").memLp_two\n\nprivate theorem sourceContactEndpoint_memLp {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :\n MemLp (fun ω => sourceContactEndpointVector L ω i) 2 (smo" + }, + { + "kind": "theorem", + "unqualified_name": "cross_row_zero", + "line": 153, + "source_header": "· exact hQ\n\nprivate theorem cross_row_zero (L : ℝ) (j : Fin 6) :\n sourceContactEndpointCrossCovariance L 0 j = -sourcePinCovarianc" + }, + { + "kind": "theorem", + "unqualified_name": "cross_row_one", + "line": 160, + "source_header": "left]\n rfl\n\nprivate theorem cross_row_one (L : ℝ) (j : Fin 6) :\n sourceContactEndpointCrossCovariance L 1 j = sourcePinCovarianc" + }, + { + "kind": "theorem", + "unqualified_name": "cross_row_two", + "line": 167, + "source_header": "left]\n rfl\n\nprivate theorem cross_row_two (L : ℝ) (j : Fin 6) :\n sourceContactEndpointCrossCovariance L 2 j =\n -sourceContactEndpointCrossCovar" + }, + { + "kind": "theorem", + "unqualified_name": "cross_row_four", + "line": 177, + "source_header": "eft]\n ring\n\nprivate theorem cross_row_four (L : ℝ) (j : Fin 6) :\n sourceContactEndpointCrossCovariance L 4 j =\n sourceContactEndpointCrossCovar" + }, + { + "kind": "theorem", + "unqualified_name": "regression_pin_coordinates", + "line": 181, + "source_header": "5 j := rfl\n\nprivate theorem regression_pin_coordinates {L : ℝ} (hL : L ≠ 0) (x : Fin 6 → ℝ) :\n (sourceContactEndpointRegression L *ᵥ x) 0 = -x 5 / 2 ∧\n (sourceContactEndpointRegression L *ᵥ x)" + }, + { + "kind": "theorem", + "unqualified_name": "regression_other_coordinates", + "line": 214, + "source_header": "[hc]; ring\n\nprivate theorem regression_other_coordinates (L : ℝ) (x : Fin 6 → ℝ) :\n (sourceContactEndpointRegression L *ᵥ x) 2 =\n -(sourceContactEndpointRegression L *ᵥ x) 3 ∧\n (sourceContactEndpointRegression L *ᵥ x) 4 =\n (sourceContactEndpointRegressio" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointMean_contact", + "line": 224, + "source_header": "s_row_four]\n\ntheorem sourceContactEndpointMean_contact {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n sourceContactEndpointMean L b 0 = -1 ∧\n sourceContactEndpointMean L b 1 = 1 ∧\n sourceContactEndpointMean L b 2 + sourceContactEndpointMean L b 3 = 0 ∧\n sourceContactEndpointMean L b 4 - sourceContactEndpointMea" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointResidual_contact", + "line": 239, + "source_header": "ho.2]; ring\n\nprivate theorem sourceContactEndpointResidual_contact {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample 2 L) :\n sourceContactEndpointResidual L ω 0 = 0 ∧\n sourceContactEndpointResidual L ω 1 = 0 ∧\n sourceContactEndpointResidual L ω 2 = -sourceContactEndpointResidual L ω 3 ∧\n sourceContactEndpointResidual L ω 4 = sourceContactEndpointRes" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointSchur_covariance", + "line": 255, + "source_header": "· rw [ho.2]\n\n/-- The limiting Schur matrix is the actual least-squares endpoint residual covariance. -/\ntheorem sourceContactEndpointSchur_covariance {L : ℝ} (hL : L ≠ 0) :\n (∀ i j, covariance (fun ω => sourceContactEndpointResidual L ω i)\n (fun ω => sourceContactEndpointResidual L ω j) (smoothLaw 2 L) =\n sourceContactEndpointSchur L i j) ∧ (sourceContactEndpointSchur" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointSchur_posSemidef", + "line": 270, + "source_header": "_memLp hL) hG\n\ntheorem sourceContactEndpointSchur_posSemidef {L : ℝ} (hL : L ≠ 0) :\n (sourceContactEndpointSchur" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointSchur_contact", + "line": 274, + "source_header": "ariance hL).2\n\n/-- The deterministic endpoint relations become exactly the four required zero variances. -/\ntheorem sourceContactEndpointSchur_contact {L : ℝ} (hL : L ≠ 0) :\n sourceContactEndpointSchur L 0 0 = 0 ∧\n sourceContactEndpointSchur L 1 1 = 0 ∧\n sourceContactEndpointSchur L 2 2 + 2 * sourceContactEndpointSchur L 2 3 +\n sourceContactEndpointSchur L 3 3 = 0 ∧\n sourceContactEndpointSchur L 4 4 - 2 * sourceContactEndpointSchur L 4 5 +\n sourceContactEndpoint" + }, + { + "kind": "theorem", + "unqualified_name": "cross_row_Q", + "line": 302, + "source_header": "hfour]\n ring\n\nprivate theorem cross_row_Q (L : ℝ) (j : Fin 6) :\n sourceContactEndpointCrossCovariance L 4 j = sourceC" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointSchur_four_four_eq_schur", + "line": 306, + "source_header": "riance_comm _ _\n\n/-- The reference entry is the already established actual torus curvature Schur variance. -/\ntheorem sourceContactEndpointSchur_four_four_eq_schur (L : ℝ) :\n sourceContactEndpointSchur L 4 4 = sou" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointSchur_referenceVariance_pos", + "line": 319, + "source_header": "L - _\n rw [heq]\n\ntheorem sourceContactEndpointSchur_referenceVariance_pos {L : ℝ} (hL : L ≠ 0) :\n 0 < sourceContactEn" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceSmoothConditionalKernel.lean", + "sha256": "664892acb12d40e5bf20075e1ef633efdd4a54ae1308c714308eab3a4deaa517", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "zeroSample", + "line": 29, + "source_header": "l\n\ndef zeroSample (d : ℕ) (L : ℝ) : SmoothSample d" + }, + { + "kind": "theorem", + "unqualified_name": "exists_measurable_sampleProjection", + "line": 35, + "source_header": "⟩\n\ntheorem exists_measurable_sampleProjection (d : ℕ) (L : ℝ) :\n ∃ q : (SourceMode d → ℝ) → SmoothSample d L,\n Measurable q ∧ ∀ ω : SmoothSample d L, q (sampleInclusion d L ω) =" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_add", + "line": 41, + "source_header": "⟩\n\ntheorem goodSample_add {d : ℕ} {L : ℝ}\n (ω η : SourceMode d → ℝ) (hω : goodSample d L ω) (hη : goodSample d L η) :\n goodSample d L (ω + η" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_neg", + "line": 53, + "source_header": ")\n\ntheorem goodSample_neg {d : ℕ} {L : ℝ}\n (ω : SourceMode d → ℝ) (hω : goodSample d L ω) : goodSample d L (-ω" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_weighted_summable", + "line": 58, + "source_header": "n\n\n\ntheorem derivativeCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample 2 L) (k : ℕ) (x : Fin 2 → ℝ) (u : Fin k → (Fin 2 → ℝ)) :\n Summable (fun m => derivativeCoefficient 2 L k x u m * sampleInclusion 2 L ω m" + }, + { + "kind": "theorem", + "unqualified_name": "finiteCoefficient_weighted_summable", + "line": 72, + "source_header": "g\n\ntheorem finiteCoefficient_weighted_summable {ι : Type*} {n q : ℕ}\n (a : Fin n → ι → ℝ) (ω : ι → ℝ)\n (ha : ∀ i, Summable (fun m => a i m * ω m))\n (T : (Fin n → ℝ) →L[ℝ] (Fin q → ℝ)) (j : Fin q) :\n Summable (fun m => T (fun i => a i m) j * ω m" + }, + { + "kind": "theorem", + "unqualified_name": "pinCoefficient_weighted_summable", + "line": 89, + "source_header": "_\n\ntheorem pinCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) (i : Fin 6) :\n Summable (fun m => pinCoefficient L r i m * sampleInclusion 2 L ω m" + }, + { + "kind": "theorem", + "unqualified_name": "adjustedCoefficient_weighted_summable", + "line": 97, + "source_header": "i\n\ntheorem adjustedCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) (i : Fin 6) :\n Summable (fun m => adjustedCoefficient L r i m * sampleInclusion 2 L ω m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPinsAt_measurable", + "line": 105, + "source_header": "i\n\ntheorem sourceConfluentPinsAt_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (sourceConfluentPinsAt L r" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_measurable", + "line": 115, + "source_header": ")\n\ntheorem sourceAdjustedEndpoints_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (sourceAdjustedEndpoints L r" + }, + { + "kind": "def", + "unqualified_name": "pinLift", + "line": 125, + "source_header": ")\n\ndef pinLift (L r : ℝ) (y : Fin 6 → ℝ) (m : SourceMode 2) :" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_zero", + "line": 128, + "source_header": ")\n\ntheorem pinLift_zero (L r : ℝ) : pinLift L r 0 =" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_add", + "line": 132, + "source_header": "]\n\ntheorem pinLift_add (L r : ℝ) (x y : Fin 6 → ℝ) :\n pinLift L r (x + y) = pinLift L r x + pinLift L r" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_neg", + "line": 137, + "source_header": "]\n\ntheorem pinLift_neg (L r : ℝ) (x : Fin 6 → ℝ) :\n pinLift L r (-x) = -pinLift L r" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_goodSample", + "line": 142, + "source_header": "]\n\ntheorem pinLift_goodSample {L : ℝ} (hL : L ≠ 0) (r : ℝ) (y : Fin 6 → ℝ) :\n goodSample 2 L (pinLift L r y" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_measurable", + "line": 162, + "source_header": "]\n\ntheorem pinLift_measurable (L r : ℝ) : Measurable (pinLift L r" + }, + { + "kind": "def", + "unqualified_name": "addLift", + "line": 168, + "source_header": "p\n\ndef addLift {L : ℝ} (hL : L ≠ 0) (r : ℝ) (y : Fin 6 → ℝ)\n (ω : SmoothSample 2 L) : SmoothSample 2" + }, + { + "kind": "theorem", + "unqualified_name": "addLift_measurable", + "line": 177, + "source_header": "l\n\ntheorem addLift_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (fun p : (Fin 6 → ℝ) × SmoothSample 2 L => addLift hL r p.1 p.2" + }, + { + "kind": "def", + "unqualified_name": "posteriorSample", + "line": 184, + "source_header": ")\n\ndef posteriorSample {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ)\n (ω : SmoothSample 2 L) : SmoothSample 2" + }, + { + "kind": "theorem", + "unqualified_name": "posteriorSample_measurable", + "line": 193, + "source_header": "l\n\ntheorem posteriorSample_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (fun p : (Fin 6 → ℝ) × SmoothSample 2 L => posteriorSample hL r p.1 p.2" + }, + { + "kind": "lemma", + "unqualified_name": "scalarSeries_add_finiteShift", + "line": 203, + "source_header": "l\n\nlemma scalarSeries_add_finiteShift {ι : Type*} {n : ℕ}\n (a : ι → ℝ) (b : Fin n → ι → ℝ) (ω : ι → ℝ) (c : Fin n → ℝ)\n (ha : Summable a) (hb : ∀ j, Summable (b j))\n (hω : Summable (fun m => a m * ω m)) :\n scalarSeries a (fun m => ω m + ∑ j, b j m * c j) =\n scalarSeries a ω + ∑ j, (∑' m, a m * b j m) * c" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPinsAt_addLift", + "line": 229, + "source_header": "l\n\ntheorem sourceConfluentPinsAt_addLift {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (y : Fin 6 → ℝ) (ω : SmoothSample 2 L) :\n sourceConfluentPinsAt L r (addLift hL r y ω) = sourceConfluentPinsAt L r ω +\n sourcePinCovarianceAt L r *ᵥ ((sourcePinCovarianceAt L r)⁻¹ *ᵥ y" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_addLift", + "line": 245, + "source_header": "l\n\ntheorem sourceAdjustedEndpoints_addLift {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (y : Fin 6 → ℝ) (ω : SmoothSample 2 L) :\n sourceAdjustedEndpoints L r (addLift hL r y ω) = sourceAdjustedEndpoints L r ω +\n sourceRegressionMapAt L r" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPinsAt_posteriorSample", + "line": 263, + "source_header": "l\n\ntheorem sourceConfluentPinsAt_posteriorSample {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ)\n (ω : SmoothSample 2 L) :\n sourceConfluentPinsAt L r (posteriorSample hL r x ω) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_posteriorSample", + "line": 272, + "source_header": "l\n\ntheorem sourceAdjustedEndpoints_posteriorSample {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) (ω : SmoothSample 2 L) :\n sourceAdjustedEndpoints L r (posteriorSample hL r x ω) =\n sourceAdjustedEndpoints L r ω +\n sourceRegressionMapAt L r (x - sourceConfluentPinsAt L r ω" + }, + { + "kind": "def", + "unqualified_name": "sourceSmoothKernel", + "line": 286, + "source_header": "l\n\n/-- The literal coefficient-shift law, specified at every pin value. -/\ndef sourceSmoothKernel {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Kernel (Fin 6 → ℝ) (SmoothSample 2" + }, + { + "kind": "instance", + "unqualified_name": "sourceSmoothKernel_isMarkov", + "line": 293, + "source_header": ".2)\n\ninstance sourceSmoothKernel_isMarkov {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n IsMarkovKernel (sourceSmoothKernel hL" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_measurable", + "line": 298, + "source_header": "r)\n\ntheorem sourceSmoothKernel_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (sourceSmoothKernel hL" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_apply", + "line": 301, + "source_header": "e _\n\n/-- Exact sampling formula, including every probability-zero pin. -/\ntheorem sourceSmoothKernel_apply {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :\n sourceSmoothKernel hL r x = (smoothLaw 2 L).map (posteriorSample hL" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_pin_map", + "line": 310, + "source_header": "rfl\n\ntheorem sourceSmoothKernel_pin_map {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :\n (sourceSmoothKernel hL r x).map (sourceConfluentPinsAt L r) = Measure.di" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_pin_fiber", + "line": 324, + "source_header": "simp\n\ntheorem sourceSmoothKernel_pin_fiber {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :\n sourceSmoothKernel hL r x {ω | sourceConfluentPinsAt L r ω = x" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_endpoint_map", + "line": 334, + "source_header": "simp\n\n/-- The actual endpoint kernel is the marginal of the full coefficient shift\nat every pin, including prescribed null pins. -/\ntheorem sourceSmoothKernel_endpoint_map {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) :\n (sourceSmoothKernel hL r x).map (sourceAdjustedEndpoints L r) =\n sourceEndpointKerne" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_finite_hasGaussianLaw", + "line": 362, + "source_header": "nditional\n\ntheorem scalarSeries_finite_hasGaussianLaw {ι τ : Type*} [Countable ι] [Fintype τ]\n (a : τ → ι → ℝ) (ha : ∀ j, Summable (a j)) :\n HasGaussianLaw (fun η j => scalarSeries (a j) η) (coeffici" + }, + { + "kind": "def", + "unqualified_name": "residualCoefficient", + "line": 373, + "source_header": "using hG\n\ndef residualCoefficient (L r : ℝ) (ω : SmoothSample 2 L) (m : SourceMo" + }, + { + "kind": "lemma", + "unqualified_name": "scalarSeries_single", + "line": 376, + "source_header": "L r ω) m\n\nlemma scalarSeries_single {ι : Type*} [DecidableEq ι] (m : ι) (η : ι → ℝ) :\n scalarSeries (Pi.single m (1 : ℝ)" + }, + { + "kind": "lemma", + "unqualified_name": "scalarSeries_coordinate_covariance", + "line": 380, + "source_header": "le_apply]\n\nlemma scalarSeries_coordinate_covariance {ι : Type*} [Countable ι]\n (a : ι → ℝ) (ha : Summable a) (m : ι) :\n covariance (scalarSeries a) (fun ω : ι → ℝ => ω m) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "pin_coefficient_covariance", + "line": 395, + "source_header": "mul_ite]\n\ntheorem pin_coefficient_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (i : Fin 6) (m : SourceMode 2) :\n covariance (fun ω => sourceConfluentPinsAt L r ω i)\n (fun ω : SmoothSample 2 L => ω.val m) (smoothLaw 2 L) = pinCoefficien" + }, + { + "kind": "theorem", + "unqualified_name": "pin_finite_coefficients_hasGaussianLaw", + "line": 407, + "source_header": "hL r i) m\n\n\ntheorem pin_finite_coefficients_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (I : Finset (SourceMode 2)) :\n HasGaussianLaw (fun ω : SmoothSample 2 L =>\n (sourceConfluentPinsAt L r ω, fun m : I => ω.val m)) (smoot" + }, + { + "kind": "def", + "unqualified_name": "finiteLift", + "line": 444, + "source_header": "val ω.val\n\ndef finiteLift (L r : ℝ) (I : Finset (SourceMode 2)) :\n (Fin 6 → ℝ) →L[ℝ" + }, + { + "kind": "lemma", + "unqualified_name": "finiteLift_apply", + "line": 449, + "source_header": "LinearMap\n\nlemma finiteLift_apply (L r : ℝ) (I : Finset (SourceMode 2)) (y : Fin 6 → ℝ) (m : I) :\n finiteLift L r I y m = pinLift L" + }, + { + "kind": "theorem", + "unqualified_name": "pin_residual_finite_hasGaussianLaw", + "line": 456, + "source_header": "ec]\n rfl\n\ntheorem pin_residual_finite_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (I : Finset (SourceMode 2)) :\n HasGaussianLaw (fun ω : SmoothSample 2 L =>\n (sourceConfluentPinsAt L r ω, fun m : I => residualCoefficient L r ω m.val))\n (smoot" + }, + { + "kind": "lemma", + "unqualified_name": "coefficient_hasGaussianLaw", + "line": 474, + "source_header": "]\n rfl\n\nlemma coefficient_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (m : SourceMode 2) :\n HasGaussianLaw (fun ω : SmoothSample 2 L => ω.val m) (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "residualCoefficient_zero_covariance", + "line": 481, + "source_header": "_instance\n\ntheorem residualCoefficient_zero_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (i : Fin 6) (m : SourceMode 2) :\n covariance (fun ω => sourceConfluentPinsAt L r ω i)\n (fun ω => residualCoefficient L r ω m) (smoothLaw" + }, + { + "kind": "theorem", + "unqualified_name": "residualCoefficient_finite_indepFun", + "line": 523, + "source_header": "sub_self]\n\ntheorem residualCoefficient_finite_indepFun {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (I : Finset (SourceMode 2)) :\n IndepFun (sourceConfluentPinsAt L r)\n (fun (ω : SmoothSample 2 L) (m : I) => residualCoefficient L r ω m.val) (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "residualCoefficient_indepFun", + "line": 530, + "source_header": "i m.val)\n\ntheorem residualCoefficient_indepFun {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IndepFun (sourceConfluentPinsAt L r) (fun ω m => residualCoefficient L r ω m)\n (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "sourceNormalizedEndpoints_measurable", + "line": 551, + "source_header": "nditional\n\ntheorem sourceNormalizedEndpoints_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (sourceNormalizedEndpo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_physical_endpoint_map", + "line": 561, + "source_header": "le hL r))\n\n/-- The literal physical endpoint kernel is also an all-pin marginal of the\nwhole-carrier conditional sampling law. -/\ntheorem sourceSmoothKernel_physical_endpoint_map {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :\n (sourceSmoothKernel hL r x).map (sourceNormalizedEndpoints L r) =\n sourcePhysicalEndpointK" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_physical_prescribed_map", + "line": 587, + "source_header": "sub]\n abel\n\n/-- Prescribed null pins select exactly the physical endpoint law already used\nby the completed endpoint estimates. -/\ntheorem sourceSmoothKernel_physical_prescribed_map {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)).map (sourceNormalizedEndpoints L r) =\n sourcePhysicalEndp" + }, + { + "kind": "theorem", + "unqualified_name": "posteriorSample_self", + "line": 603, + "source_header": "oothConditional\n\ntheorem posteriorSample_self {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n posteriorSample hL r (sourceConfluentPins" + }, + { + "kind": "theorem", + "unqualified_name": "posteriorSample_eq_addLift_residual", + "line": 610, + "source_header": "pply, add_zero]\n\ntheorem posteriorSample_eq_addLift_residual {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) (ω : SmoothSample 2 L) :\n addLift hL r x (posteriorSample hL r 0 ω) = posterior" + }, + { + "kind": "theorem", + "unqualified_name": "addLift_observation_residual", + "line": 619, + "source_header": "g_apply]\n abel\n\ntheorem addLift_observation_residual {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n addLift hL r (sourceConfluentPinsAt L r ω) (posteriorSampl" + }, + { + "kind": "theorem", + "unqualified_name": "posteriorSample_zero_inclusion", + "line": 624, + "source_header": "iorSample_self]\n\ntheorem posteriorSample_zero_inclusion {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n sampleInclusion 2 L (posteriorSample hL r 0 ω) = residualCo" + }, + { + "kind": "theorem", + "unqualified_name": "posteriorSample_zero_indepFun", + "line": 632, + "source_header": ", Pi.neg_apply]\n\ntheorem posteriorSample_zero_indepFun {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IndepFun (sourceConfluentPinsAt L r) (posteriorSample hL r 0)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_hasCondDistrib", + "line": 642, + "source_header": ", heq] using hi\n\ntheorem sourceSmoothKernel_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasCondDistrib (id : SmoothSample 2 L → SmoothSample 2 L)\n (sourceConfluentPinsAt L r) (sourceSmoothKernel hL r)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_map_hasCondDistrib", + "line": 677, + "source_header": "oothConditional\n\n/-- Every measurable functional of the actual carrier inherits this specified\nconditional kernel. -/\ntheorem sourceSmoothKernel_map_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) {E : Type*} [MeasurableSpace E]\n (F : SmoothSample 2 L → E) (hF : Measurable F) :\n HasCondDistrib F (sourceConfluentPinsAt L r) ((sourceSmoothKernel hL r).map F)" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_measurable", + "line": 688, + "source_header": "hG).comp_left hF\n\n/-- The literal smooth field is measurable for the coordinate product sigma\nalgebra on functions. No additional topological function-space law is chosen. -/\ntheorem smoothSourceField_measurable (d : ℕ) (L : ℝ) :\n Measurable (smo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_field_hasCondDistrib", + "line": 696, + "source_header": "ion_measurable d L)\n\ntheorem sourceSmoothKernel_field_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasCondDistrib (smoothSourceField 2 L) (sourceConfluentPinsAt L r)\n ((sourceSmoothKernel hL r).map (smoothSourceField 2" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_eventually_hasCondDistrib", + "line": 702, + "source_header": "eld_measurable 2 L)\n\n/-- The completed actual covariance limits supply invertibility. The final\nwhole-carrier conditioning statement retains only the actual scale hypothesis. -/\ntheorem sourceSmoothKernel_eventually_hasCondDistrib {L : ℝ} (hL : L ≠ 0) :\n ∀ᶠ r in 𝓝[>] (0 : ℝ),\n HasCondDistrib (id : SmoothSample 2 L → SmoothSample 2 L)\n (sourceConfluentPinsAt L r) (sourceSmoothKernel" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_eventually_map_hasCondDistrib", + "line": 711, + "source_header": "asCondDistrib hL r hG\n\ntheorem sourceSmoothKernel_eventually_map_hasCondDistrib {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (F : SmoothSample 2 L → E) (hF : Measurable F) :\n ∀ᶠ r in 𝓝[>] (0 : ℝ),\n HasCondDistrib F (sourceConfluentPinsAt L r) ((sourceSmoothKernel hL r).map F)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceEndpointRegression.lean", + "sha256": "67e68553e004adc3b1b6beb987b3e7ad477b4541d96fec22ee481facd2038fce", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sourceConfluentPinsAt", + "line": 28, + "source_header": "n\n\n/-- Actual confluent observations as a nondependent family in r. -/\ndef sourceConfluentPinsAt (L r : ℝ) (ω : SmoothSample 2 L) : Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourceAdjustedEndpoints", + "line": 35, + "source_header": "rfl\n\n/-- LM006 order `(xxM,xxS,xyM,xyS,yyM,yyS)`, with the confluent xx/xy pins subtracted. -/\ndef sourceAdjustedEndpoints (L r : ℝ) (ω : SmoothSample 2 L) : Fin" + }, + { + "kind": "def", + "unqualified_name": "sourcePinCovarianceAt", + "line": 41, + "source_header": "v 11]\n\n/-- The actual pin covariance G. -/\ndef sourcePinCovarianceAt (L r : ℝ) : Matrix (Fin 6) (F" + }, + { + "kind": "def", + "unqualified_name": "sourceCrossCovarianceAt", + "line": 46, + "source_header": "aw 2 L)\n\n/-- The actual adjusted-endpoint/pin cross covariance C, with endpoint rows. -/\ndef sourceCrossCovarianceAt (L r : ℝ) : Matrix (Fin 6)" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointCovarianceAt", + "line": 51, + "source_header": "hLaw 2 L)\n\n/-- The actual adjusted endpoint covariance, without an assumed limiting model. -/\ndef sourceEndpointCovarianceAt (L r : ℝ) : Matrix (Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourceRegressionMatrixAt", + "line": 56, + "source_header": "othLaw 2 L)\n\ndef sourceRegressionMatrixAt (L r : ℝ) : Matrix (Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourceRegressionMapAt", + "line": 59, + "source_header": "ceAt L r)⁻¹\n\ndef sourceRegressionMapAt (L r : ℝ) : (Fin 6 → ℝ) →L[ℝ]" + }, + { + "kind": "def", + "unqualified_name": "endpointObservationMap", + "line": 62, + "source_header": "usLinearMap\n\n/-- Deterministic twelve-observation map: no observation law is built into its definition. -/\ndef endpointObservationMap (r : ℝ) :\n (Fin 12 → ℝ) →L[ℝ] ((Fin 6 → ℝ) × (Fin 6 → ℝ)) wh" + }, + { + "kind": "lemma", + "unqualified_name": "endpointObservationMap_actual", + "line": 76, + "source_header": "fun_prop\n\nlemma endpointObservationMap_actual (L r : ℝ) (ω : SmoothSample 2 L) :\n endpointObservationMap r (rawPinsWithHessians L r ω) =\n (sourceConfluentPinsAt L r ω, sourceAdjustedEnd" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePins_adjusted_hasGaussianLaw", + "line": 87, + "source_header": "ly [hp]\n rfl\n\n/-- The actual joint Gaussian law is a proved image of the actual twelve derivative observations. -/\ntheorem sourcePins_adjusted_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n HasGaussianLaw (fun ω => (sourceConfluentPinsAt L r ω, sourceAdjustedEndpoints L r ω))" + }, + { + "kind": "theorem", + "unqualified_name": "sourceRegression_normal_equations", + "line": 103, + "source_header": "egressionMapAt]\n\n/-- The matrix inverse derives the regression normal equations for these actual observations. -/\ntheorem sourceRegression_normal_equations (L r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n ∀ i j, covariance (fun ω => sourceConfluentPinsAt L r ω i)\n (fun ω => sourceAdjustedEndpoints L r ω j) (smoothLaw 2 L) =\n ∑ l, sourceRegressionMapAt L r (Pi.single l 1) j *\n covariance (fun ω => sourceConfluentPinsAt L r ω i)\n (fun ω => sourceConfluentPinsAt L r ω l" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointResidual", + "line": 131, + "source_header": "variance_comm _ _\n\n/-- The actual affine regression residual, with no assumed residual law. -/\ndef sourceEndpointResidual (L r : ℝ) (ω : SmoothSamp" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointKernel", + "line": 135, + "source_header": "fluentPinsAt L r ω)\n\n/-- The canonical actual endpoint kernel, specified at every pin value. -/\ndef sourceEndpointKernel (L r : ℝ) : Kernel (F" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_markov", + "line": 140, + "source_header": "ressionMapAt L r) 0 0\n\ntheorem sourceEndpointKernel_markov {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n IsMarkovKernel (sour" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_measurable", + "line": 146, + "source_header": "rnel\n infer_instance\n\ntheorem sourceEndpointKernel_measurable (L r : ℝ) : Measurable (sour" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_apply", + "line": 149, + "source_header": "Kernel.measurable _\n\n/-- The all-pin pushforward identity includes every probability-zero prescribed pin vector. -/\ntheorem sourceEndpointKernel_apply {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :\n sourceEndpointKernel L r x =\n ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map\n (fun v => v + sourc" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_hasCondDistrib", + "line": 159, + "source_header": "ressionMapAt L r) 0 0 x\n\n/-- The actual target's conditional law, with Gaussian residual hypotheses derived rather than assumed.\nCurrent pin-covariance invertibility is the sole algebraic premise. -/\ntheorem sourceEndpointKernel_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasCondDistrib (sourceAdjustedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourceEndpointKe" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_spec", + "line": 171, + "source_header": "ly [sub_zero] using hcond\n\n/-- Combined canonical law for the actual pins and adjusted endpoint vector. -/\ntheorem sourceEndpointKernel_spec {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IsMarkovKernel (sourceEndpointKernel L r) ∧\n Measurable (sourceEndpointKernel L r) ∧\n (∀ x, sourceEndpointKernel L r x =\n ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map\n (fun v => v + sourceRegressionMapAt L r x)) ∧\n HasCondDistrib (sourceAdjustedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourceEndpoint" + }, + { + "kind": "def", + "unqualified_name": "sourceNormalizedEndpoints", + "line": 184, + "source_header": "nel_hasCondDistrib hL r hG⟩\n\n/-- The literal physical normalized endpoint vector in LM006 order. -/\ndef sourceNormalizedEndpoints (L r : ℝ) (ω :" + }, + { + "kind": "def", + "unqualified_name": "sourcePrescribedPins", + "line": 189, + "source_header": "/r, v 7/r, v 10/r, v 8, v 11]\n\ndef sourcePrescri" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_on_pin_fiber", + "line": 191, + "source_header": "→ ℝ := ![b-r^3/12,0,0,0,0,2]\n\n/-- On the two zero xx/xy pin coordinates, adjusted entries are exactly physical normalized entries. -/\ntheorem sourceAdjustedEndpoints_on_pin_fiber (L r : ℝ) (ω : SmoothSample 2 L)\n (h3 : sourceConfluentPinsAt L r ω 3 = 0) (h4 : sourceConfluentPinsAt L r ω 4 = 0) :\n sourceAdjustedEndpoints L r ω =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_on_prescribed", + "line": 197, + "source_header": "rceNormalizedEndpoints, h3, h4]\n\n/-- Exact deterministic reconstruction at the prescribed pin fiber, without choosing an arbitrary RCD. -/\ntheorem sourceAdjustedEndpoints_on_prescribed (L r b : ℝ) (ω : SmoothSample 2 L)\n (hp : sourceConfluentPinsAt L r ω = sourcePrescribedPins r b) :\n sourceAdjustedEndpoints L r ω" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceDerivativeContinuity.lean", + "sha256": "552511e0aee227133b7d067faeceaab9c43c0094b07d68b8eddab0ab2419775e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "derivativeMajorant", + "line": 14, + "source_header": "y\n\n/-- A global, point-independent bound for a fixed directional derivative mode. -/\ndef derivativeMajorant (d : ℕ) (L : ℝ) (k : ℕ) (u : Fin k → (Fin d → ℝ))\n (m : SourceMode d)" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeMajorant_nonneg", + "line": 19, + "source_header": "j‖\n\ntheorem derivativeMajorant_nonneg (d : ℕ) (L : ℝ) (k : ℕ)\n (u : Fin k → (Fin d → ℝ)) (m : SourceMode d) :\n 0 ≤ derivativeMajorant d L k" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeMajorant_summable", + "line": 25, + "source_header": "_))\n\ntheorem derivativeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin d → ℝ)) : Summable (derivativeMajorant d L k" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_bound", + "line": 29, + "source_header": "t _\n\ntheorem derivativeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin d → ℝ)) (m : SourceMode d) (x : Fin d → ℝ) :\n ‖derivativeCoefficient d L k x u m‖ ≤ derivativeMajorant d L k" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_continuous", + "line": 36, + "source_header": ")))\n\ntheorem derivativeCoefficient_continuous (d : ℕ) (L : ℝ) (k : ℕ)\n (u : Fin k → (Fin d → ℝ)) (m : SourceMode d) :\n Continuous (fun x => derivativeCoefficient d L k x u" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeMajorant_product_summable", + "line": 54, + "source_header": "fl)\n\nprivate theorem derivativeMajorant_product_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k l : ℕ) (u : Fin k → (Fin d → ℝ)) (v : Fin l → (Fin d → ℝ)) :\n Summable (fun m => derivativeMajorant d L k u m * derivativeMajorant d L l v" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivative_covariance_continuous", + "line": 64, + "source_header": "h)\n\n/-- The covariance of two actual fixed-order directional derivatives is\ncontinuous in their two evaluation points, including coincident points. -/\ntheorem smoothSourceField_derivative_covariance_continuous (d : ℕ) {L : ℝ}\n (hL : L ≠ 0) (k l : ℕ) (u : Fin k → (Fin d → ℝ))\n (v : Fin l → (Fin d → ℝ)) :\n Continuous (fun xy : (Fin d → ℝ) × (Fin d → ℝ) =>\n cov[fun ω => iteratedFDeriv ℝ k (smoothSourceField d L ω) xy.1 u,\n fun ω => iteratedFDeriv ℝ l (smoothSourceField d L ω) xy.2 v; smoothLaw" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivative_integral_zero", + "line": 84, + "source_header": "u m)\n\n/-- Every actual directional derivative is centered under the unchanged source\nlaw. Noncentered conditional means are not identified with these means. -/\ntheorem smoothSourceField_derivative_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ℕ) (x : Fin d → ℝ) (u : Fin k → (Fin d → ℝ)) :\n (∫ ω, iteratedFDeriv ℝ k (smoothSourceField d L ω) x u ∂smoothLaw d" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceDerivativeGaussian.lean", + "sha256": "c9754debcbf2aab7ff8d9604f2c13726723e8a8c1921ae68f83349205e43885d", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_smooth", + "line": 17, + "source_header": "n\n\nprivate theorem modeCoefficient_smooth (d : ℕ) (L : ℝ) (m : SourceMode d) :\n ContDiff ℝ (⊤ : ℕ∞) (modeCoefficient d L m" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_iteratedFDeriv", + "line": 31, + "source_header": "p\n\nprivate theorem weighted_iteratedFDeriv (d : ℕ) (L : ℝ) (m : SourceMode d)\n (c : ℝ) (k : ℕ) (x : Fin d → ℝ) :\n iteratedFDeriv ℝ k (fun y => modeCoefficient d L m y * c) x =\n c • iteratedFDeriv ℝ k (modeCoefficient d L m)" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_iteratedFDeriv_bound", + "line": 43, + "source_header": "]\n\nprivate theorem weighted_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (c : ℝ) (k : ℕ) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ k (fun y => modeCoefficient d L m y * c) x‖ ≤\n orderModeBound k d L m * |c" + }, + { + "kind": "def", + "unqualified_name": "derivativeCoefficient", + "line": 51, + "source_header": ")\n\n/-- Deterministic Fourier coefficient for an actual directional derivative. -/\ndef derivativeCoefficient (d : ℕ) (L : ℝ) (k : ℕ) (x : Fin d → ℝ)\n (u : Fin k → (Fin d → ℝ)) (m : SourceMode d)" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_summable", + "line": 56, + "source_header": "x u\n\ntheorem derivativeCoefficient_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ℕ) (x : Fin d → ℝ) (u : Fin k → (Fin d → ℝ)) :\n Summable (derivativeCoefficient d L k x" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivative_series", + "line": 69, + "source_header": "_))\n\n/-- This is a literal identity for every sample in the existing smooth carrier,\nincluding order zero. It is not a finite-mode approximation or a new field. -/\ntheorem smoothSourceField_derivative_series (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) (k : ℕ) (x : Fin d → ℝ)\n (u : Fin k → (Fin d → ℝ)) :\n iteratedFDeriv ℝ k (smoothSourceField d L ω) x u =\n scalarSeries (derivativeCoefficient d L k x u) (sampleInclusion d" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_linearCombination_hasGaussianLaw", + "line": 100, + "source_header": "m _ _\n\nprivate theorem scalarSeries_linearCombination_hasGaussianLaw\n {ι : Type*} [Countable ι] (n : ℕ) (a : Fin n → ι → ℝ)\n (ha : ∀ j, Summable (a j)) (c : Fin n → ℝ) :\n HasGaussianLaw (fun ω => ∑ j, c j * scalarSeries (a j) ω) (coefficientL" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_finiteVector_hasGaussianLaw", + "line": 120, + "source_header": "heq)\n\n/-- Arbitrary finite arrays of summable coefficient series are jointly Gaussian.\nNo independence of the resulting observations is asserted or assumed. -/\ntheorem scalarSeries_finiteVector_hasGaussianLaw\n {ι : Type*} [Countable ι] (n : ℕ) (a : Fin n → ι → ℝ)\n (ha : ∀ j, Summable (a j)) :\n HasGaussianLaw (fun ω j => scalarSeries (a j) ω) (coefficien" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivativeVector_hasGaussianLaw", + "line": 150, + "source_header": "ianReal\n\n/-- Heterogeneous derivative orders, points and directions of the actual smooth\nfield are jointly Gaussian under its unchanged literal law. Empty families,\norder zero and repeated observations are retained. -/\ntheorem smoothSourceField_derivativeVector_hasGaussianLaw (d : ℕ) {L : ℝ}\n (hL : L ≠ 0) (n : ℕ) (k : Fin n → ℕ) (x : Fin n → (Fin d → ℝ))\n (u : ∀ j, Fin (k j) → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j =>\n iteratedFDeriv ℝ (k j) (smoothSourceField d L ω) (x j) (u j)) (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivative_covariance", + "line": 173, + "source_header": "j)).symm\n\n/-- Actual derivative covariance as a convergent Fourier coefficient pairing.\nThis does not yet identify the pairing with derivatives of the theta kernel. -/\ntheorem smoothSourceField_derivative_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k l : ℕ) (x y : Fin d → ℝ) (u : Fin k → (Fin d → ℝ))\n (v : Fin l → (Fin d → ℝ)) :\n cov[fun ω => iteratedFDeriv ℝ k (smoothSourceField d L ω) x u,\n fun ω => iteratedFDeriv ℝ l (smoothSourceField d L ω) y v; smoothLaw d L] =\n ∑' m, derivativeCoefficient d L k x u m * derivativeCoefficient" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceConfluentLimits.lean", + "sha256": "1635a05bbd5b56608bc0a1a04eb4404c2df4601f1255f5846c1342a597bf5b0b", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "rawDerivativeOrder", + "line": 23, + "source_header": "s\n\nabbrev rawDerivativeOrder : Fin 12 →" + }, + { + "kind": "def", + "unqualified_name": "rawDerivativePoint", + "line": 25, + "source_header": "]\n\ndef rawDerivativePoint (r : ℝ) : Fin 12 → (Fin 2 → ℝ" + }, + { + "kind": "def", + "unqualified_name": "rawDerivativeDirections", + "line": 29, + "source_header": "]\n\ndef rawDerivativeDirections : (i : Fin 12) → Fin (rawDerivativeOrder i) → (Fin 2 → ℝ" + }, + { + "kind": "def", + "unqualified_name": "rawDerivativeCoefficient", + "line": 34, + "source_header": "Y\n\ndef rawDerivativeCoefficient (L r : ℝ) (i : Fin 12) (m : SourceMode 2) :" + }, + { + "kind": "def", + "unqualified_name": "pinObservationMap", + "line": 38, + "source_header": "m\n\ndef pinObservationMap (r : ℝ) : (Fin 12 → ℝ) →L[ℝ] (Fin 6 → ℝ" + }, + { + "kind": "def", + "unqualified_name": "adjustedObservationMap", + "line": 41, + "source_header": ")\n\ndef adjustedObservationMap (r : ℝ) : (Fin 12 → ℝ) →L[ℝ] (Fin 6 → ℝ" + }, + { + "kind": "def", + "unqualified_name": "pinCoefficient", + "line": 44, + "source_header": ")\n\ndef pinCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode 2) :" + }, + { + "kind": "def", + "unqualified_name": "adjustedCoefficient", + "line": 47, + "source_header": "i\n\ndef adjustedCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode 2) :" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_weighted_summable", + "line": 50, + "source_header": "i\n\nprivate theorem derivativeCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample 2 L) (k : ℕ) (x : Fin 2 → ℝ) (u : Fin k → (Fin 2 → ℝ)) :\n Summable (fun m => derivativeCoefficient 2 L k x u m * sampleInclusion 2 L ω m" + }, + { + "kind": "theorem", + "unqualified_name": "finiteSeries_map", + "line": 63, + "source_header": "g\n\nprivate theorem finiteSeries_map {ι : Type*} {n q : ℕ}\n (a : Fin n → ι → ℝ) (ω : ι → ℝ)\n (ha : ∀ i, Summable (fun m => a i m * ω m))\n (T : (Fin n → ℝ) →L[ℝ] (Fin q → ℝ)) :\n T (fun i => scalarSeries (a i) ω) =\n (fun j => scalarSeries (fun m => T (fun i => a i m) j) ω" + }, + { + "kind": "theorem", + "unqualified_name": "finiteCoefficient_map_summable", + "line": 86, + "source_header": "m\n\nprivate theorem finiteCoefficient_map_summable {ι : Type*} {n q : ℕ}\n (a : Fin n → ι → ℝ) (ha : ∀ i, Summable (a i))\n (T : (Fin n → ℝ) →L[ℝ] (Fin q → ℝ)) (j : Fin q) :\n Summable (fun m => T (fun i => a i m) j" + }, + { + "kind": "theorem", + "unqualified_name": "rawPinsWithHessians_series", + "line": 94, + "source_header": "e\n\ntheorem rawPinsWithHessians_series {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n rawPinsWithHessians L r ω =\n (fun i => scalarSeries (rawDerivativeCoefficient L r i) (sampleInclusion 2 L ω)" + }, + { + "kind": "theorem", + "unqualified_name": "pinCoefficient_summable", + "line": 117, + "source_header": "l\n\ntheorem pinCoefficient_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i : Fin 6) :\n Summable (pinCoefficient L r i" + }, + { + "kind": "theorem", + "unqualified_name": "adjustedCoefficient_summable", + "line": 123, + "source_header": "i\n\ntheorem adjustedCoefficient_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i : Fin 6) :\n Summable (adjustedCoefficient L r i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPinsAt_series", + "line": 129, + "source_header": "i\n\ntheorem sourceConfluentPinsAt_series {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n sourceConfluentPinsAt L r ω =\n (fun i => scalarSeries (pinCoefficient L r i) (sampleInclusion 2 L ω)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_series", + "line": 141, + "source_header": ")\n\ntheorem sourceAdjustedEndpoints_series {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n sourceAdjustedEndpoints L r ω =\n (fun i => scalarSeries (adjustedCoefficient L r i) (sampleInclusion 2 L ω)" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovarianceAt_coefficient", + "line": 153, + "source_header": ")\n\ntheorem sourcePinCovarianceAt_coefficient {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i j : Fin 6) :\n sourcePinCovarianceAt L r i j = ∑' m, pinCoefficient L r i m * pinCoefficient L r j" + }, + { + "kind": "theorem", + "unqualified_name": "sourceCrossCovarianceAt_coefficient", + "line": 162, + "source_header": ")\n\ntheorem sourceCrossCovarianceAt_coefficient {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i j : Fin 6) :\n sourceCrossCovarianceAt L r i j =\n ∑' m, adjustedCoefficient L r i m * pinCoefficient L r j" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointCovarianceAt_coefficient", + "line": 172, + "source_header": ")\n\ntheorem sourceEndpointCovarianceAt_coefficient {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i j : Fin 6) :\n sourceEndpointCovarianceAt L r i j =\n ∑' m, adjustedCoefficient L r i m * adjustedCoefficient L r j" + }, + { + "kind": "def", + "unqualified_name": "axisMap", + "line": 194, + "source_header": "ins\n\ndef axisMap : ℝ →L[ℝ] (Fin 2 → ℝ) where\n toFu" + }, + { + "kind": "theorem", + "unqualified_name": "mode_smooth", + "line": 200, + "source_header": "rop\n\ntheorem mode_smooth (L : ℝ) (m : SourceMode 2) :\n ContDiff ℝ (⊤ : ℕ∞) (modeCoefficient 2 L" + }, + { + "kind": "theorem", + "unqualified_name": "axis_iteratedDeriv", + "line": 214, + "source_header": "rop\n\ntheorem axis_iteratedDeriv (f : (Fin 2 → ℝ) → ℝ)\n (hf : ContDiff ℝ (⊤ : ℕ∞) f) (k : ℕ) (t : ℝ) :\n iteratedDeriv k (fun s => f ![s,0]) t =\n iteratedFDeriv ℝ k f ![t,0] (fun _ => directio" + }, + { + "kind": "theorem", + "unqualified_name": "axis_transverse_smooth", + "line": 224, + "source_header": "hh\n\ntheorem axis_transverse_smooth (f : (Fin 2 → ℝ) → ℝ)\n (hf : ContDiff ℝ (⊤ : ℕ∞) f) :\n ContDiff ℝ (⊤ : ℕ∞) (fun t => fderiv ℝ f ![t,0] directio" + }, + { + "kind": "theorem", + "unqualified_name": "axis_transverse_iteratedDeriv", + "line": 230, + "source_header": "iff\n\ntheorem axis_transverse_iteratedDeriv (f : (Fin 2 → ℝ) → ℝ)\n (hf : ContDiff ℝ (⊤ : ℕ∞) f) (k : ℕ) (t : ℝ) :\n iteratedDeriv k (fun s => fderiv ℝ f ![s,0] directionY) t =\n iteratedFDeriv ℝ (k+1) f ![t,0] (Fin.snoc (fun _ => directionX) directio" + }, + { + "kind": "def", + "unqualified_name": "modeF", + "line": 245, + "source_header": "st]\n\ndef modeF (L : ℝ) (m : SourceMode 2) (t : ℝ)" + }, + { + "kind": "def", + "unqualified_name": "modeH", + "line": 247, + "source_header": ",0]\ndef modeH (L : ℝ) (m : SourceMode 2) (t : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "modeH_eq", + "line": 249, + "source_header": "] m\n\ntheorem modeH_eq (L : ℝ) (m : SourceMode 2) :\n modeH L m = fun t => fderiv ℝ (modeCoefficient 2 L m) ![t,0] directi" + }, + { + "kind": "theorem", + "unqualified_name": "modeF_C3", + "line": 254, + "source_header": "y _\n\ntheorem modeF_C3 (L : ℝ) (m : SourceMode 2) : ContDiff ℝ 3 (modeF L" + }, + { + "kind": "theorem", + "unqualified_name": "modeH_C2", + "line": 257, + "source_header": "mp)\n\ntheorem modeH_C2 (L : ℝ) (m : SourceMode 2) : ContDiff ℝ 2 (modeH L" + }, + { + "kind": "theorem", + "unqualified_name": "modeF_deriv", + "line": 261, + "source_header": "mp)\n\ntheorem modeF_deriv (L : ℝ) (m : SourceMode 2) (t : ℝ) :\n deriv (modeF L m) t = derivativeCoefficient 2 L 1 ![t,0] ![directionX" + }, + { + "kind": "theorem", + "unqualified_name": "modeF_second", + "line": 267, + "source_header": "g h\n\ntheorem modeF_second (L : ℝ) (m : SourceMode 2) (t : ℝ) :\n iteratedDeriv 2 (modeF L m) t =\n derivativeCoefficient 2 L 2 ![t,0] ![directionX,directionX" + }, + { + "kind": "theorem", + "unqualified_name": "modeF_third", + "line": 276, + "source_header": "g h\n\ntheorem modeF_third (L : ℝ) (m : SourceMode 2) (t : ℝ) :\n iteratedDeriv 3 (modeF L m) t =\n derivativeCoefficient 2 L 3 ![t,0] ![directionX,directionX,directionX" + }, + { + "kind": "theorem", + "unqualified_name": "modeH_deriv", + "line": 285, + "source_header": "g h\n\ntheorem modeH_deriv (L : ℝ) (m : SourceMode 2) (t : ℝ) :\n deriv (modeH L m) t = derivativeCoefficient 2 L 2 ![t,0] ![directionX,directionY" + }, + { + "kind": "theorem", + "unqualified_name": "modeH_second", + "line": 293, + "source_header": "g h\n\ntheorem modeH_second (L : ℝ) (m : SourceMode 2) (t : ℝ) :\n iteratedDeriv 2 (modeH L m) t =\n derivativeCoefficient 2 L 3 ![t,0] ![directionX,directionX,directionY" + }, + { + "kind": "def", + "unqualified_name": "modeYY", + "line": 308, + "source_header": "ins\n\ndef modeYY (L : ℝ) (m : SourceMode 2) (t : ℝ)" + }, + { + "kind": "def", + "unqualified_name": "modeRawValues", + "line": 311, + "source_header": "] m\n\ndef modeRawValues (L r : ℝ) (m : SourceMode 2) : Fin 12" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections2", + "line": 318, + "source_header": "2)]\n\nprivate theorem rawDirections2 : rawDerivativeDirections 2 = ![directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections3", + "line": 323, + "source_header": "rfl\n\nprivate theorem rawDirections3 : rawDerivativeDirections 3 = ![directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections4", + "line": 328, + "source_header": "rfl\n\nprivate theorem rawDirections4 : rawDerivativeDirections 4 = ![directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections5", + "line": 333, + "source_header": "rfl\n\nprivate theorem rawDirections5 : rawDerivativeDirections 5 = ![directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections6", + "line": 338, + "source_header": "rfl\n\nprivate theorem rawDirections6 : rawDerivativeDirections 6 = ![directionX,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections7", + "line": 342, + "source_header": "rfl\n\nprivate theorem rawDirections7 : rawDerivativeDirections 7 = ![directionX,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections8", + "line": 346, + "source_header": "rfl\n\nprivate theorem rawDirections8 : rawDerivativeDirections 8 = ![directionY,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections9", + "line": 350, + "source_header": "rfl\n\nprivate theorem rawDirections9 : rawDerivativeDirections 9 = ![directionX,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections10", + "line": 354, + "source_header": "rfl\n\nprivate theorem rawDirections10 : rawDerivativeDirections 10 = ![directionX,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections11", + "line": 358, + "source_header": "rfl\n\nprivate theorem rawDirections11 : rawDerivativeDirections 11 = ![directionY,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDerivativeCoefficient_explicit", + "line": 362, + "source_header": "rfl\n\ntheorem rawDerivativeCoefficient_explicit (L r : ℝ) (m : SourceMode 2) :\n (fun i => rawDerivativeCoefficient L r i m) = modeRawValues L" + }, + { + "kind": "def", + "unqualified_name": "modePinValues", + "line": 394, + "source_header": "rfl\n\ndef modePinValues (L r : ℝ) (m : SourceMode 2) : Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "pinCoefficient_explicit", + "line": 400, + "source_header": "r]\n\ntheorem pinCoefficient_explicit (L r : ℝ) (m : SourceMode 2) :\n (fun i => pinCoefficient L r i m) = modePinValues L" + }, + { + "kind": "def", + "unqualified_name": "modeAdjustedValues", + "line": 409, + "source_header": "mm]\n\ndef modeAdjustedValues (L r : ℝ) (m : SourceMode 2) : Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "adjustedCoefficient_explicit", + "line": 416, + "source_header": "2)]\n\ntheorem adjustedCoefficient_explicit (L r : ℝ) (m : SourceMode 2) :\n (fun i => adjustedCoefficient L r i m) = modeAdjustedValues L" + }, + { + "kind": "def", + "unqualified_name": "weightedDerivativeIntegral", + "line": 438, + "source_header": "grals\n\ndef weightedDerivativeIntegral (L : ℝ) (k : ℕ) (u : Fin k → (Fin 2 → ℝ))\n (m : SourceMode 2) (w : ℝ → ℝ) (r : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_integrand_bound", + "line": 442, + "source_header": "] u m\n\ntheorem weighted_integrand_bound {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ)\n (K : ℝ) (hK : 0 ≤ K)\n (hwbound : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ K)\n (r t : ℝ) (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) :\n ‖w t * derivativeCoefficient 2 L k ![r*t,0] u m‖ ≤\n K * derivativeMajorant 2 L" + }, + { + "kind": "theorem", + "unqualified_name": "weightedDerivativeIntegral_continuous", + "line": 453, + "source_header": "_) hK\n\ntheorem weightedDerivativeIntegral_continuous {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ) (hw : Continuous w)\n (K : ℝ) (hK : 0 ≤ K)\n (hwbound : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ K) :\n Continuous (weightedDerivativeIntegral L k u" + }, + { + "kind": "theorem", + "unqualified_name": "weightedDerivativeIntegral_norm_le", + "line": 472, + "source_header": "op)))\n\ntheorem weightedDerivativeIntegral_norm_le {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ)\n (K : ℝ) (hK : 0 ≤ K)\n (hwbound : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ K) (r : ℝ) :\n ‖weightedDerivativeIntegral L k u m w r‖ ≤ K * derivativeMajorant 2 L" + }, + { + "kind": "theorem", + "unqualified_name": "weightedDerivativeIntegral_zero", + "line": 482, + "source_header": "ing h\n\ntheorem weightedDerivativeIntegral_zero (L : ℝ) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ) :\n weightedDerivativeIntegral L k u m w 0 =\n (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), w t) * derivativeCoefficient 2 L k" + }, + { + "kind": "def", + "unqualified_name": "peanoLeft", + "line": 497, + "source_header": "grals\n\ndef peanoLeft (t : ℝ" + }, + { + "kind": "def", + "unqualified_name": "peanoRight", + "line": 499, + "source_header": "1/2-t\ndef peanoRight (t : ℝ" + }, + { + "kind": "def", + "unqualified_name": "peanoCubic", + "line": 500, + "source_header": "t+1/2\ndef peanoCubic (t : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "peano_one_bound", + "line": 501, + "source_header": "4-t^2\n\nprivate theorem peano_one_bound (t : ℝ)\n (_ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |(1 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "peano_left_bound", + "line": 504, + "source_header": "m_num\n\nprivate theorem peano_left_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoLeft t" + }, + { + "kind": "theorem", + "unqualified_name": "peano_right_bound", + "line": 510, + "source_header": "t.1]⟩\n\nprivate theorem peano_right_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoRight t" + }, + { + "kind": "theorem", + "unqualified_name": "peano_cubic_bound", + "line": 516, + "source_header": "t.2]⟩\n\nprivate theorem peano_cubic_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoCubic t" + }, + { + "kind": "theorem", + "unqualified_name": "peano_kernel_masses", + "line": 525, + "source_header": "g t]⟩\n\ntheorem peano_kernel_masses :\n (∫ _t in (-1/2 : ℝ)..(1/2 : ℝ), (1 : ℝ)) = 1 ∧\n (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), peanoLeft t) = 1/2 ∧\n (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), peanoRight t) = 1/2 ∧\n 6 * (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), peanoCubic t" + }, + { + "kind": "def", + "unqualified_name": "regularizedPinCoefficient", + "line": 545, + "source_header": "_pow]\n\n/-- The Peano formulas define a genuine continuous extension of each pin mode,\nwhile preserving the singular raw formulas at every nonzero radius. -/\ndef regularizedPinCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode" + }, + { + "kind": "def", + "unqualified_name": "regularizedAdjustedCoefficient", + "line": 555, + "source_header": "ic r] i\n\ndef regularizedAdjustedCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode" + }, + { + "kind": "theorem", + "unqualified_name": "pinCoefficient_eq_regularized", + "line": 562, + "source_header": "r/2)] i\n\ntheorem pinCoefficient_eq_regularized (L r : ℝ) (hr : r ≠ 0) (i : Fin 6)\n (m : SourceMode 2) : pinCoefficient L r i m = regularizedPinCoefficient" + }, + { + "kind": "theorem", + "unqualified_name": "adjustedCoefficient_eq_regularized", + "line": 583, + "source_header": "rfl\n\ntheorem adjustedCoefficient_eq_regularized (L r : ℝ) (hr : r ≠ 0) (i : Fin 6)\n (m : SourceMode 2) : adjustedCoefficient L r i m = regularizedAdjustedCoefficient" + }, + { + "kind": "def", + "unqualified_name": "contactPinCoefficient", + "line": 620, + "source_header": "entLimits\n\ndef contactPinCoefficient (L : ℝ) (i : Fin 6) (m : SourceMo" + }, + { + "kind": "def", + "unqualified_name": "contactAdjustedCoefficient", + "line": 623, + "source_header": "astSucc m\n\ndef contactAdjustedCoefficient (L : ℝ) (i : Fin 6) (m : SourceMo" + }, + { + "kind": "theorem", + "unqualified_name": "contactPinCoefficient_summable", + "line": 631, + "source_header": "onY] m] i\n\ntheorem contactPinCoefficient_summable {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :\n Summable (contactPinCoeffic" + }, + { + "kind": "theorem", + "unqualified_name": "contactAdjustedCoefficient_summable", + "line": 635, + "source_header": ".castSucc\n\ntheorem contactAdjustedCoefficient_summable {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :\n Summable (contactAdjustedCoeffic" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinVector_eq_contactSeries", + "line": 653, + "source_header": "exact hq\n\ntheorem sourcePinVector_eq_contactSeries {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample 2 L) (i : Fin 6) :\n sourcePinVector L ω i =\n scalarSeries (contactPinCoefficient L i) (sampleInclusi" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_div", + "line": 660, + "source_header": "castSucc)\n\nprivate theorem scalarSeries_div {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ) (c : ℝ) :\n scalarSeries (fun m => a m / c) ω = scalarSerie" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_neg", + "line": 664, + "source_header": "iv_const]\n\nprivate theorem scalarSeries_neg {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ) :\n scalarSeries (fun m => -a m) ω = -scalarS" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointVector_eq_contactSeries", + "line": 668, + "source_header": "tsum_neg]\n\ntheorem sourceContactEndpointVector_eq_contactSeries {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample 2 L) (i : Fin 6) :\n sourceContactEndpointVector L ω i =\n scalarSeries (contactAdjustedCoefficient L i) (sampleInclusi" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovariance_eq_contactCoefficientGram", + "line": 701, + "source_header": "exact hq\n\ntheorem sourcePinCovariance_eq_contactCoefficientGram {L : ℝ} (hL : L ≠ 0)\n (i j : Fin 6) : sourcePinCovariance L i j =\n ∑' m, contactPinCoefficient L i m * contactPinCoeffici" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointCrossCovariance_eq_contactCoefficientGram", + "line": 712, + "source_header": "ble hL j)\n\ntheorem sourceContactEndpointCrossCovariance_eq_contactCoefficientGram {L : ℝ}\n (hL : L ≠ 0) (i j : Fin 6) : sourceContactEndpointCrossCovariance L i j =\n ∑' m, contactAdjustedCoefficient L i m * contactPinCoeffici" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointCovariance_eq_contactCoefficientGram", + "line": 722, + "source_header": "ble hL j)\n\ntheorem sourceContactEndpointCovariance_eq_contactCoefficientGram {L : ℝ}\n (hL : L ≠ 0) (i j : Fin 6) : sourceContactEndpointCovariance L i j =\n ∑' m, contactAdjustedCoefficient L i m * contactAdjustedCoeffici" + }, + { + "kind": "def", + "unqualified_name": "modeComponentMajorant", + "line": 738, + "source_header": "entLimits\n\ndef modeComponentMajorant (L : ℝ) (m : SourceMode 2) :" + }, + { + "kind": "def", + "unqualified_name": "confluentModeMajorant", + "line": 748, + "source_header": "tionY] m]\n\ndef confluentModeMajorant (L : ℝ) (m : SourceMo" + }, + { + "kind": "theorem", + "unqualified_name": "modeComponentMajorant_nonneg", + "line": 751, + "source_header": "ant L m s\n\nprivate theorem modeComponentMajorant_nonneg (L : ℝ) (m : SourceMode 2) (s : Fin 8) :\n 0 ≤ modeComponentMajor" + }, + { + "kind": "theorem", + "unqualified_name": "confluentModeMajorant_nonneg", + "line": 756, + "source_header": "2 L _ _ m\n\ntheorem confluentModeMajorant_nonneg (L : ℝ) (m : SourceMode 2) :\n 0 ≤ confluentModeMaj" + }, + { + "kind": "theorem", + "unqualified_name": "confluentModeMajorant_summable", + "line": 760, + "source_header": "g L m s))\n\ntheorem confluentModeMajorant_summable {L : ℝ} (hL : L ≠ 0) :\n Summable (confluentModeMa" + }, + { + "kind": "theorem", + "unqualified_name": "six_component_le_majorant", + "line": 768, + "source_header": "2 hL _ _\n\nprivate theorem six_component_le_majorant (L : ℝ) (m : SourceMode 2) (s : Fin 8) :\n 6 * modeComponentMajorant L m s ≤ confluentModeMaj" + }, + { + "kind": "theorem", + "unqualified_name": "component_le_majorant", + "line": 773, + "source_header": "m_univ s)\n\nprivate theorem component_le_majorant (L : ℝ) (m : SourceMode 2) (s : Fin 8) :\n modeComponentMajorant L m s ≤ confluentModeMaj" + }, + { + "kind": "theorem", + "unqualified_name": "average_norm_le", + "line": 779, + "source_header": "linarith\n\nprivate theorem average_norm_le (a b M : ℝ) (ha : ‖a‖ ≤ M) (hb : ‖b‖ ≤ M) :\n ‖(a+" + }, + { + "kind": "theorem", + "unqualified_name": "integral_bound_one", + "line": 787, + "source_header": "= by ring\n\nprivate theorem integral_bound_one {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ)\n (hw : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ 1) (r : ℝ) :\n ‖weightedDerivativeIntegral L k u m w r‖ ≤ derivativeMajorant" + }, + { + "kind": "theorem", + "unqualified_name": "modeF_norm_bound", + "line": 794, + "source_header": "] using h\n\nprivate theorem modeF_norm_bound {L : ℝ} (hL : L ≠ 0) (m : SourceMode 2) (t : ℝ) :\n ‖modeF L m t‖ ≤ derivativeMajorant 2" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedPinCoefficient_bound", + "line": 799, + "source_header": "m ![t,0]\n\ntheorem regularizedPinCoefficient_bound {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (i : Fin 6) (m : SourceMode 2) :\n ‖regularizedPinCoefficient L r i m‖ ≤ confluentModeMaj" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedAdjustedCoefficient_bound", + "line": 826, + "source_header": "ant L m 5\n\ntheorem regularizedAdjustedCoefficient_bound {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (i : Fin 6) (m : SourceMode 2) :\n ‖regularizedAdjustedCoefficient L r i m‖ ≤ confluentModeMaj" + }, + { + "kind": "theorem", + "unqualified_name": "helper_left_bound", + "line": 864, + "source_header": "luentLimits\n\nprivate theorem helper_left_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peano" + }, + { + "kind": "theorem", + "unqualified_name": "helper_right_bound", + "line": 870, + "source_header": "ith [ht.1]⟩\n\nprivate theorem helper_right_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoR" + }, + { + "kind": "theorem", + "unqualified_name": "helper_cubic_bound", + "line": 876, + "source_header": "ith [ht.2]⟩\n\nprivate theorem helper_cubic_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoC" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedPinCoefficient_continuous", + "line": 885, + "source_header": "_nonneg t]⟩\n\ntheorem regularizedPinCoefficient_continuous {L : ℝ} (hL : L ≠ 0)\n (i : Fin 6) (m : SourceMode 2) :\n Continuous (fun r => regularizedPinCoefficie" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedAdjustedCoefficient_continuous", + "line": 908, + "source_header": "const_mul 6\n\ntheorem regularizedAdjustedCoefficient_continuous {L : ℝ} (hL : L ≠ 0)\n (i : Fin 6) (m : SourceMode 2) :\n Continuous (fun r => regularizedAdjustedCoefficie" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedPinCoefficient_zero", + "line": 940, + "source_header": "nfluentLimits\n\ntheorem regularizedPinCoefficient_zero (L : ℝ) (i : Fin 6) (m : SourceMode 2) :\n regularizedPinCoefficient L 0 i m = contactPinCoef" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedAdjustedCoefficient_zero", + "line": 966, + "source_header": "2.2, one_mul]\n\ntheorem regularizedAdjustedCoefficient_zero (L : ℝ) (i : Fin 6) (m : SourceMode 2) :\n regularizedAdjustedCoefficient L 0 i m = contactAdjustedCoef" + }, + { + "kind": "def", + "unqualified_name": "regularizedPinCovariance", + "line": 998, + "source_header": "ficientLimits\n\ndef regularizedPinCovariance (L r : ℝ) : Matrix (Fin" + }, + { + "kind": "def", + "unqualified_name": "regularizedCrossCovariance", + "line": 1001, + "source_header": "cient L r j m\n\ndef regularizedCrossCovariance (L r : ℝ) : Matrix (Fin" + }, + { + "kind": "def", + "unqualified_name": "regularizedEndpointCovariance", + "line": 1004, + "source_header": "cient L r j m\n\ndef regularizedEndpointCovariance (L r : ℝ) : Matrix (Fin" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedGram_continuous", + "line": 1007, + "source_header": "cient L r j m\n\nprivate theorem regularizedGram_continuous {L : ℝ} (hL : L ≠ 0)\n (a b : ℝ → Fin 6 → SourceMode 2 → ℝ)\n (ha : ∀ i m, Continuous (fun r => a r i m))\n (hb : ∀ i m, Continuous (fun r => b r i m))\n (hba : ∀ r i m, ‖a r i m‖ ≤ confluentModeMajorant L m)\n (hbb : ∀ r i m, ‖b r i m‖ ≤ confluentModeMajorant L m) :\n Continuous (fun r => (fun i j => ∑' m, a r i m * b r j m : Matrix (Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedPinCovariance_continuous", + "line": 1028, + "source_header": "t_nonneg L m)\n\ntheorem regularizedPinCovariance_continuous {L : ℝ} (hL : L ≠ 0) :\n Continuous (regularizedPin" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedCrossCovariance_continuous", + "line": 1034, + "source_header": "ent_bound hL)\n\ntheorem regularizedCrossCovariance_continuous {L : ℝ} (hL : L ≠ 0) :\n Continuous (regularizedCross" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedEndpointCovariance_continuous", + "line": 1040, + "source_header": "ent_bound hL)\n\ntheorem regularizedEndpointCovariance_continuous {L : ℝ} (hL : L ≠ 0) :\n Continuous (regularizedEndpoint" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovarianceAt_eq_regularized", + "line": 1046, + "source_header": "ent_bound hL)\n\ntheorem sourcePinCovarianceAt_eq_regularized {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n sourcePinCovarianceAt L r = regularizedPinC" + }, + { + "kind": "theorem", + "unqualified_name": "sourceCrossCovarianceAt_eq_regularized", + "line": 1055, + "source_header": "d L r hr j m]\n\ntheorem sourceCrossCovarianceAt_eq_regularized {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n sourceCrossCovarianceAt L r = regularizedCrossC" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointCovarianceAt_eq_regularized", + "line": 1064, + "source_header": "d L r hr j m]\n\ntheorem sourceEndpointCovarianceAt_eq_regularized {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n sourceEndpointCovarianceAt L r = regularizedEndpointC" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedPinCovariance_zero", + "line": 1073, + "source_header": "d L r hr j m]\n\ntheorem regularizedPinCovariance_zero {L : ℝ} (hL : L ≠ 0) :\n regularizedPinCovariance L 0 = sourcePi" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedCrossCovariance_zero", + "line": 1080, + "source_header": "ficient_zero]\n\ntheorem regularizedCrossCovariance_zero {L : ℝ} (hL : L ≠ 0) :\n regularizedCrossCovariance L 0 = sourceContactEndpointCros" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedEndpointCovariance_zero", + "line": 1087, + "source_header": "ficient_zero]\n\ntheorem regularizedEndpointCovariance_zero {L : ℝ} (hL : L ≠ 0) :\n regularizedEndpointCovariance L 0 = sourceContactEndpoin" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovarianceAt_tendsto", + "line": 1094, + "source_header": "ficient_zero]\n\n/-- The actual confluent six-pin covariance converges to the literal contact\npin covariance. Only the source period is assumed nonzero. -/\ntheorem sourcePinCovarianceAt_tendsto {L : ℝ} (hL : L ≠ 0) :\n Tendsto (sourcePinCovarianceAt L) (𝓝[>] (0 : ℝ)) (𝓝 (sourcePi" + }, + { + "kind": "theorem", + "unqualified_name": "sourceCrossCovarianceAt_tendsto", + "line": 1104, + "source_header": "of_gt hr)).symm\n\n/-- The actual adjusted-endpoint/pin cross covariance has the stated literal\ncontact limit, with the pin corrections retained before division. -/\ntheorem sourceCrossCovarianceAt_tendsto {L : ℝ} (hL : L ≠ 0) :\n Tendsto (sourceCrossCovarianceAt L) (𝓝[>] (0 : ℝ))\n (𝓝 (sourceContactEndpointCr" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointCovarianceAt_tendsto", + "line": 1115, + "source_header": "e_of_gt hr)).symm\n\n/-- The actual pin-adjusted endpoint covariance converges to Cov(T,T), where\nT=(-fxxx/2,fxxx/2,-fxxy/2,fxxy/2,fyy,fyy) at the origin. -/\ntheorem sourceEndpointCovarianceAt_tendsto {L : ℝ} (hL : L ≠ 0) :\n Tendsto (sourceEndpointCovarianceAt L) (𝓝[>] (0 : ℝ))\n (𝓝 (sourceContactEnd" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceEndpointParameters.lean", + "sha256": "efc88ac59217ab1960d5518abcd9f16a71b42080a2810f1e337eeb2f686c1e3a", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivative_integral_zero", + "line": 29, + "source_header": "s\n\ntheorem smoothSourceField_derivative_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ℕ) (x : Fin d → ℝ) (u : Fin k → (Fin d → ℝ)) :\n (∫ ω, iteratedFDeriv ℝ k (smoothSourceField d L ω) x u ∂smoothLaw d L) =" + }, + { + "kind": "theorem", + "unqualified_name": "rawPinsWithHessians_integral_zero", + "line": 39, + "source_header": ")\n\ntheorem rawPinsWithHessians_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i : Fin 12) :\n (∫ ω, rawPinsWithHessians L r ω i ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "rawPinsWithHessians_integral_vector_zero", + "line": 52, + "source_header": "]\n\ntheorem rawPinsWithHessians_integral_vector_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n (∫ ω, rawPinsWithHessians L r ω ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePins_adjusted_integral_zero", + "line": 63, + "source_header": "i\n\ntheorem sourcePins_adjusted_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n (∫ ω, (sourceConfluentPinsAt L r ω, sourceAdjustedEndpoints L r ω) ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPinsAt_integral_zero", + "line": 71, + "source_header": "h\n\ntheorem sourceConfluentPinsAt_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n (∫ ω, sourceConfluentPinsAt L r ω ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_integral_zero", + "line": 77, + "source_header": "h\n\ntheorem sourceAdjustedEndpoints_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n (∫ ω, sourceAdjustedEndpoints L r ω ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointResidual_integral_zero", + "line": 83, + "source_header": "h\n\ntheorem sourceEndpointResidual_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n (∫ ω, sourceEndpointResidual L r ω ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointResidual_covariance", + "line": 92, + "source_header": "]\n\ntheorem sourceEndpointResidual_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (i j : Fin 6) :\n covariance (fun ω => sourceEndpointResidual L r ω i)\n (fun ω => sourceEndpointResidual L r ω j) (smoothLaw 2 L) =\n sourceEndpointCovarianceAt L r i j -\n (sourceCrossCovarianceAt L r * (sourcePinCovarianceAt L r)⁻¹ *\n (sourceCrossCovarianceAt L r)ᵀ) i" + }, + { + "kind": "lemma", + "unqualified_name": "finiteGaussian_law_parameters", + "line": 149, + "source_header": "l\n\nlemma finiteGaussian_law_parameters {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n : ℕ} {Z : Ω → Fin n → ℝ}\n (hZ : HasGaussianLaw Z P) (m : Fin n → ℝ) (hm : (∫ ω, Z ω ∂P) = m)\n (S : Matrix (Fin n) (Fin n) ℝ)\n (hcov : ∀ i j, covariance (fun ω => Z ω i) (fun ω => Z ω j) P = S i j) :\n S.PosSemidef ∧ P.map (fun ω => toLp 2 (Z ω)) = multivariateGaussian (toLp 2 m)" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointSchurAt", + "line": 190, + "source_header": "j\n\n/-- The actual adjusted-endpoint Schur covariance. -/\ndef sourceEndpointSchurAt (L r : ℝ) : Matrix (Fin 6) (Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointResidual_hasGaussianLaw", + "line": 195, + "source_header": "r)ᵀ\n\n/-- Gaussianity is inherited from the actual jointly Gaussian pin/endpoint vector. -/\ntheorem sourceEndpointResidual_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n HasGaussianLaw (sourceEndpointResidual L r) (smoothLaw" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointPosterior", + "line": 203, + "source_header": "ng hR\n\n/-- A literal posterior sample at a prescribed pin. -/\ndef sourceEndpointPosterior (L r : ℝ) (x : Fin 6 → ℝ) (ω : SmoothSample 2 L) : Fi" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointPosterior_hasGaussianLaw", + "line": 207, + "source_header": "t L r x\n\ntheorem sourceEndpointPosterior_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) : HasGaussianLaw (sourceEndpointPosterior L r x) (smoothL" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointPosterior_integral", + "line": 217, + "source_header": "]\n rfl\n\ntheorem sourceEndpointPosterior_integral {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) : (∫ ω, sourceEndpointPosterior L r x ω ∂smoothLaw 2 L) =\n sourceRegressionMapA" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointPosterior_covariance", + "line": 226, + "source_header": "simp\n\ntheorem sourceEndpointPosterior_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) (i j : Fin 6) :\n covariance (fun ω => sourceEndpointPosterior L r x ω i)\n (fun ω => sourceEndpointPosterior L r x ω j) (smoothLaw 2 L) =\n sourceEndpointSchurAt" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_eq_map_posterior", + "line": 239, + "source_header": "hG i j\n\n/-- The canonical all-pin law is the literal posterior sampling map. -/\ntheorem sourceEndpointKernel_eq_map_posterior {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) : sourceEndpointKernel L r x =\n (smoothLaw 2 L).map (sourceEndpointPosteri" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_isGaussian", + "line": 248, + "source_header": "le]\n rfl\n\ntheorem sourceEndpointKernel_isGaussian {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) : IsGaussian (sourceEndpointKern" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointSchurAt_posSemidef", + "line": 253, + "source_header": "ssian_map\n\n/-- Positive semidefiniteness follows from the actual residual covariance, including singular cases. -/\ntheorem sourceEndpointSchurAt_posSemidef {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) : (sourceEndpointSchurAt L r)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_eq_multivariateGaussian", + "line": 260, + "source_header": "r hG 0)).1\n\n/-- Exact literal multivariate Gaussian law at every prescribed pin, with no residual PSD premise. -/\ntheorem sourceEndpointKernel_eq_multivariateGaussian {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :\n (sourceEndpointKernel L r x).map (toLp 2) =\n multivariateGaussian (toLp 2 (sourceRegressionMapAt L r x)) (sourceEndpoin" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_integral", + "line": 272, + "source_header": "hL r hG x)).2\n\n/-- The original Pi-space kernel mean is the actual regression mean. -/\ntheorem sourceEndpointKernel_integral {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) : (∫ v, v ∂sourceEndpointKernel L r x) = sourceRegres" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_covariance", + "line": 279, + "source_header": "integral hL r x\n\n/-- The original Pi-space kernel covariance is the derived actual Schur covariance. -/\ntheorem sourceEndpointKernel_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) (i j : Fin 6) :\n covariance (fun v => v i) (fun v => v j) (sourceEndpointKernel L r x) =\n sourceEndpoi" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceContactSchur.lean", + "sha256": "2fe122a50ec1889b579558d80086251d87ed0cec2420d268ab1d04f6bfff4409", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sourcePinVector", + "line": 25, + "source_header": "t\n\n/-- Literal six-pin observations in their source order. -/\ndef sourcePinVector (L : ℝ) (ω : SmoothSample 2 L) (i : Fin 6)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactQ", + "line": 29, + "source_header": "ucc\n\n/-- Literal remaining curvature coordinate Q=fyy. -/\ndef sourceContactQ (L : ℝ) (ω : SmoothSample 2 L" + }, + { + "kind": "def", + "unqualified_name": "sourcePinCovariance", + "line": 33, + "source_header": "L ω 6\n\n/-- Principal covariance of the literal six origin pin coordinates. -/\ndef sourcePinCovariance (L : ℝ) : Matrix (Fin 6) (F" + }, + { + "kind": "def", + "unqualified_name": "sourceContactCross", + "line": 37, + "source_header": "astSucc\n\n/-- Covariance of each literal pin coordinate with the remaining curvature Q=fyy. -/\ndef sourceContactCross (L : ℝ) (i : F" + }, + { + "kind": "def", + "unqualified_name": "sourceContactQVariance", + "line": 41, + "source_header": "astSucc 6\n\n/-- Literal Q covariance with itself. -/\ndef sourceContactQVariance" + }, + { + "kind": "def", + "unqualified_name": "sourceContactCrossMatrix", + "line": 44, + "source_header": "iance L 6 6\n\ndef sourceContactCrossMatrix (L : ℝ) : Matrix (Fi" + }, + { + "kind": "def", + "unqualified_name": "sourceContactQMatrix", + "line": 47, + "source_header": "ctCross L i\n\ndef sourceContactQMatrix (L : ℝ) : Matrix" + }, + { + "kind": "def", + "unqualified_name": "sourceContactSchur", + "line": 50, + "source_header": "QVariance L\n\n/-- The scalar Schur complement of the actual six-pin covariance. -/\ndef sourceContactSchu" + }, + { + "kind": "def", + "unqualified_name": "sourceContactBlockEquiv", + "line": 55, + "source_header": "ntactCross L)\n\n/-- Exact 6+1 splitting of the source's seven origin coordinates. -/\ndef sourceContactBlockEquiv : (Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactCovariance_block_identity", + "line": 67, + "source_header": "cases u\n rfl\n\n/-- The literal covariance equals the stated six-pin/Q blocks under the exact coordinate split. -/\ntheorem sourceContactCovariance_block_identity (L : ℝ) :\n (sourceContactCovariance L).submatrix sourceContactBlockEquiv sourceContactBlockEquiv =\n Matrix.fromBlocks (sourcePinCovariance L) (sourceContactCrossMatrix L)\n (sourceContactCrossMatrix L)ᴴ (source" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovariance_posDef", + "line": 89, + "source_header": "v => cases v; rfl\n\ntheorem sourcePinCovariance_posDef {L : ℝ} (hL : L ≠ 0) :\n (sourcePinCov" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovariance_isUnit", + "line": 93, + "source_header": "Succ_injective 6)\n\ntheorem sourcePinCovariance_isUnit {L : ℝ} (hL : L ≠ 0) :\n IsUnit (sourc" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactQVariance_eq_variance", + "line": 102, + "source_header": "Unit hL).invertible\n\ntheorem sourceContactQVariance_eq_variance {L : ℝ} (hL : L ≠ 0) :\n sourceContactQVariance L =\n Var[fun ω => sourceContactVector L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactSchur_pos", + "line": 107, + "source_header": "val 6).aemeasurable\n\n/-- Strict positivity of the actual curvature Schur variance follows from the literal contact law. -/\ntheorem sourceContactSchur_pos {L : ℝ} (hL : L ≠ 0) :\n 0 <" + }, + { + "kind": "lemma", + "unqualified_name": "contact_residual_variance_of_isUnit_covariance", + "line": 129, + "source_header": "heq] at hs\n exact hs\n\n/-- Finite Gaussian applications use this L² covariance identity; its normal equations are derived. -/\nlemma contact_residual_variance_of_isUnit_covariance {Ω ι : Type*} [MeasurableSpace Ω]\n [Fintype ι] [DecidableEq ι] {P : Measure Ω} [IsFiniteMeasure P]\n (J : Ω → ι → ℝ) (Q : Ω → ℝ)\n (hJ : ∀ i, MemLp (fun ω => J ω i) 2 P) (hQ : MemLp Q 2 P)\n (hG : IsUnit (Matrix.of (fun i j =>\n covariance (fun ω => J ω i) (fun ω => J ω j) P) : Matrix ι ι ℝ)) :" + }, + { + "kind": "def", + "unqualified_name": "sourceContactResidual", + "line": 173, + "source_header": "roduct_comm b a]\n ring\n\n/-- The actual least-squares curvature residual, without replacing the torus covariance. -/\ndef sourceContactResidual (L : ℝ) (" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactResidual_variance", + "line": 178, + "source_header": "L) ⬝ᵥ sourcePinVector L ω\n\n/-- The strictly positive Schur complement is the actual curvature residual variance. -/\ntheorem sourceContactResidual_variance {L : ℝ} (hL : L ≠ 0) :\n Var[sourceContactResidual L; smoothLaw" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactResidual_variance_pos", + "line": 200, + "source_header": "_eq_variance hL]\n exact hv\n\ntheorem sourceContactResidual_variance_pos {L : ℝ} (hL : L ≠ 0) :\n 0 < Var[sourceContac" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceContactCovariance.lean", + "sha256": "4189cbaf4c18c55f21e3af2c96b0b2842d83161f44596eb691c507dcc1a439c8", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "contactOrder", + "line": 17, + "source_header": "t\n\ndef contactOrder : Fin 7 →" + }, + { + "kind": "def", + "unqualified_name": "contactE0", + "line": 19, + "source_header": "]\n\ndef contactE0 : Fin 2 →" + }, + { + "kind": "def", + "unqualified_name": "contactE1", + "line": 21, + "source_header": "]\ndef contactE1 : Fin 2 →" + }, + { + "kind": "def", + "unqualified_name": "contactDirections", + "line": 22, + "source_header": "]\n\ndef contactDirections : (i : Fin 7) → Fin (contactOrder i) → (Fin 2 → ℝ" + }, + { + "kind": "def", + "unqualified_name": "sourceContactVector", + "line": 31, + "source_header": ")\n\ndef sourceContactVector (L : ℝ) (ω : SmoothSample 2 L) (i : Fin 7) :" + }, + { + "kind": "def", + "unqualified_name": "sourceContactCoefficient", + "line": 34, + "source_header": ")\n\ndef sourceContactCoefficient (L : ℝ) (i : Fin 7) (m : SourceMode 2) :" + }, + { + "kind": "def", + "unqualified_name": "sourceContactCovariance", + "line": 37, + "source_header": "m\n\ndef sourceContactCovariance (L : ℝ) : Matrix (Fin 7) (Fin 7)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactVector_hasGaussianLaw", + "line": 41, + "source_header": "]\n\ntheorem sourceContactVector_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) :\n HasGaussianLaw (sourceContactVector L) (smoothLaw 2 L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactCoefficient_summable", + "line": 46, + "source_header": "s\n\ntheorem sourceContactCoefficient_summable {L : ℝ} (hL : L ≠ 0) (i : Fin 7) :\n Summable (sourceContactCoefficient L i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactCovariance_eq_coefficientGram", + "line": 50, + "source_header": ")\n\ntheorem sourceContactCovariance_eq_coefficientGram {L : ℝ} (hL : L ≠ 0) :\n sourceContactCovariance L = coefficientGram (sourceContactCoefficient L" + }, + { + "kind": "def", + "unqualified_name": "frequency10", + "line": 56, + "source_header": ")\n\nprivate def frequency10 : ↥(halfLattice 2" + }, + { + "kind": "def", + "unqualified_name": "frequency01", + "line": 61, + "source_header": "⟩\n\nprivate def frequency01 : ↥(halfLattice 2" + }, + { + "kind": "def", + "unqualified_name": "frequency11", + "line": 66, + "source_header": "⟩\n\nprivate def frequency11 : ↥(halfLattice 2" + }, + { + "kind": "def", + "unqualified_name": "frequency20", + "line": 71, + "source_header": "⟩\n\nprivate def frequency20 : ↥(halfLattice 2" + }, + { + "kind": "def", + "unqualified_name": "sourceContactMode", + "line": 76, + "source_header": "⟩\n\n/-- DC, cos(1,0), cos(0,1), cos(1,1), sin(1,0), sin(2,0), sin(0,1).\nThe frequency subtypes retain the canonical half-lattice membership proofs. -/\ndef sourceContactMode : Fin 7 → SourceMod" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactMode_nonzero_frequency", + "line": 82, + "source_header": "e)]\n\ntheorem sourceContactMode_nonzero_frequency (s : Fin 7) :\n match sourceContactMode s with\n | none => True\n | some (k, _) => (k : Fin 2 → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "sourceModeAmplitude", + "line": 90, + "source_header": "rty\n\ndef sourceModeAmplitude (L : ℝ) (m : SourceMode 2)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactAmplitude", + "line": 94, + "source_header": "L)\n\ndef sourceContactAmplitude (L : ℝ) (s : Fin 7)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactAmplitude_pos", + "line": 97, + "source_header": "s)\n\ntheorem sourceContactAmplitude_pos {L : ℝ} (hL : L ≠ 0) (s : Fin 7) :\n 0 < sourceContactAmplitude" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_none", + "line": 109, + "source_header": "s _\n\nprivate theorem derivativeCoefficient_none (L : ℝ) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) :\n derivativeCoefficient 2 L k 0 u none = if k = 0 then Real.sqrt (1 / sourceZ 2 L) els" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_some", + "line": 121, + "source_header": "rfl\n\nprivate theorem derivativeCoefficient_some (L : ℝ) (k : ↥(halfLattice 2)) (b : Bool)\n (n : ℕ) (u : Fin n → (Fin 2 → ℝ)) :\n derivativeCoefficient 2 L n 0 u (some (k,b)) =\n Real.sqrt (2 * sourceWeight 2 L k / sourceZ 2 L) *\n ((∏ j, phaseCLM 2 L k (u j)) *\n iteratedDeriv n (if b then Real.sin else Real.cos)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContact_selected_columns", + "line": 145, + "source_header": "in\n/-- These are literal differentiated source columns, with the actual Fourier\namplitudes, rather than assumed witness columns or a finite-mode replacement. -/\ntheorem sourceContact_selected_columns (L : ℝ) (i s : Fin 7) :\n sourceContactCoefficient L i (sourceContactMode s) =\n sourceContactAmplitude L s * contactWitness (sourceC L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactCovariance_posDef", + "line": 166, + "source_header": "simp\n\n/-- Positive definiteness of the actual contact covariance, obtained from its\ninfinite coefficient Gram sum and seven proved canonical source columns. -/\ntheorem sourceContactCovariance_posDef {L : ℝ} (hL : L ≠ 0) :\n (sourceContactCovariance L)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourcePhysicalEndpointKernel.lean", + "sha256": "689ced2a760b38333b0224f19af52812d0057527d5a790ba50116cb5f07b7e3a", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sourcePhysicalCorrection", + "line": 22, + "source_header": "l\n\n/-- The literal correction from adjusted entries to physical normalized endpoint entries. -/\ndef sourcePhysicalCorrection (r : ℝ) : (Fin 6 → ℝ) →L[ℝ] (Fin 6 → ℝ) where\n toFu" + }, + { + "kind": "def", + "unqualified_name": "sourcePhysicalRegressionMap", + "line": 29, + "source_header": "rop\n\ndef sourcePhysicalRegressionMap (L r : ℝ) : (Fin 6 → ℝ) →L[ℝ] (Fin 6 →" + }, + { + "kind": "theorem", + "unqualified_name": "sourceNormalizedEndpoints_eq_adjusted", + "line": 32, + "source_header": "n r\n\n/-- A pointwise identity for the actual source observations, at every separation. -/\ntheorem sourceNormalizedEndpoints_eq_adjusted (L r : ℝ) (ω : SmoothSample 2 L) :\n sourceNormalizedEndpoints L r ω =\n sourceAdjustedEndpoints L r ω + sourcePhysicalCorrection r (sourceConfluentPinsAt L" + }, + { + "kind": "def", + "unqualified_name": "sourcePhysicalEndpointKernel", + "line": 40, + "source_header": "ring\n\n/-- The physical canonical kernel retains exactly the same actual adjusted residual law. -/\ndef sourcePhysicalEndpointKernel (L r : ℝ) : Kernel (Fin 6 → ℝ) (Fin" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_markov", + "line": 45, + "source_header": "r) 0 0\n\ntheorem sourcePhysicalEndpointKernel_markov {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n IsMarkovKernel (sourcePhysicalEndpointKern" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_measurable", + "line": 51, + "source_header": "nstance\n\ntheorem sourcePhysicalEndpointKernel_measurable (L r : ℝ) :\n Measurable (sourcePhysicalEndpointKern" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_apply", + "line": 54, + "source_header": "rable _\n\n/-- Its all-pin pushforward is literal, rather than an almost-everywhere kernel identity. -/\ntheorem sourcePhysicalEndpointKernel_apply {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :\n sourcePhysicalEndpointKernel L r x =\n ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map\n (fun v => v + sourceRegressionMapAt L r x + sourcePhysicalCorrec" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_hasCondDistrib", + "line": 65, + "source_header": "r) 0 0 x\n\n/-- The physical observations have this canonical conditional law, derived from the actual residual. -/\ntheorem sourcePhysicalEndpointKernel_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasCondDistrib (sourceNormalizedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourcePhysicalEndpointKernel L r) (smo" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalCorrection_prescribed", + "line": 89, + "source_header": "ply]\n abel\n\n/-- The explicit physical correction is zero at every prescribed pin, for arbitrary height. -/\ntheorem sourcePhysicalCorrection_prescribed (r b : ℝ) :\n sourcePhysicalCorrection r (sourcePrescribed" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_at_prescribed", + "line": 95, + "source_header": "escribedPins]\n\n/-- Equality at the prescribed null pin is equality of the two literal canonical measures. -/\ntheorem sourcePhysicalEndpointKernel_at_prescribed {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n sourcePhysicalEndpointKernel L r (sourcePrescribedPins r b) =\n sourceEndpointKernel L r (sourcePres" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_integral", + "line": 103, + "source_header": "only [add_zero]\n\n/-- The physical kernel has the extra pin-dependent correction in its mean away from the prescribed fiber. -/\ntheorem sourcePhysicalEndpointKernel_integral {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :\n (∫ v, v ∂sourcePhysicalEndpointKernel L r x) =\n sourceRegressionMapAt L r x + sourcePhysi" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_spec", + "line": 117, + "source_header": "zero hL r]\n simp\n\n/-- All-point physical kernel specification; no residual hypothesis is assumed. -/\ntheorem sourcePhysicalEndpointKernel_spec {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IsMarkovKernel (sourcePhysicalEndpointKernel L r) ∧\n Measurable (sourcePhysicalEndpointKernel L r) ∧\n (∀ x, sourcePhysicalEndpointKernel L r x =\n ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map\n (fun v => v + sourceRegressionMapAt L r x + sourcePhysicalCorrection r x)) ∧\n HasCondDistrib (sourceNormalizedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourcePhysicalEndpointKernel L" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/GaussianWeightedMajorants.lean", + "sha256": "3bde84aa83d02b364ca17f242cc5dbca83908c02f2f75649075d7da6a3d1bfd0", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "weightedAbsSeries", + "line": 26, + "source_header": "t\n\ndef weightedAbsSeries {I Ω : Type*} (w : I → ℝ) (U : I → Ω → ℝ) (ω : Ω) :" + }, + { + "kind": "def", + "unqualified_name": "standardAbsMoment", + "line": 29, + "source_header": "|\n\ndef standardAbsMoment (n : ℕ) :" + }, + { + "kind": "theorem", + "unqualified_name": "standardAbsMoment_integrable", + "line": 31, + "source_header": "1\n\ntheorem standardAbsMoment_integrable (n : ℕ) :\n Integrable (fun z : ℝ => |z| ^ n) (gaussianReal 0 1" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_nonneg", + "line": 36, + "source_header": "'\n\ntheorem weightedAbsSeries_nonneg {I Ω : Type*} (w : I → ℝ) (U : I → Ω → ℝ)\n (hw0 : ∀ i, 0 ≤ w i) (ω : Ω) : 0 ≤ weightedAbsSeries w U" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_measurable", + "line": 40, + "source_header": ")\n\ntheorem weightedAbsSeries_measurable {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (w : I → ℝ) (U : I → Ω → ℝ) (hU : ∀ i, Measurable (U i)) :\n Measurable (weightedAbsSeries w U" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_eLpNorm", + "line": 45, + "source_header": ")\n\nprivate theorem coordinate_eLpNorm {I Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)\n (w : I → ℝ) (U : I → Ω → ℝ) (hw0 : ∀ i, 0 ≤ w i)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P) (p : ℝ≥0∞) (i : I) :\n eLpNorm (fun ω => w i * |U i ω|) p P =\n ENNReal.ofReal (w i) * eLpNorm id p (gaussianReal 0 1" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_memLp_bound", + "line": 67, + "source_header": "]\n\ntheorem weightedAbsSeries_memLp_bound {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)\n (p : ℝ≥0) (hp : 1 ≤ p) :\n MemLp (weightedAbsSeries w U) p P ∧\n eLpNorm (weightedAbsSeries w U) p P ≤\n ENNReal.ofReal (∑' i, w i) * eLpNorm id p (gaussianReal 0 1" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_ae_summable", + "line": 110, + "source_header": "⟩\n\ntheorem weightedAbsSeries_ae_summable {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (_hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P) :\n ∀ᵐ ω ∂P, Summable (fun i => w i * |U i ω|" + }, + { + "kind": "theorem", + "unqualified_name": "eLpNorm_nat_pow_integral", + "line": 124, + "source_header": "ω\n\nprivate theorem eLpNorm_nat_pow_integral {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (f : Ω → ℝ) (hf : AEStronglyMeasurable f P)\n (hnonneg : ∀ ω, 0 ≤ f ω) (n : ℕ) (hn : n ≠ 0)\n (hint : Integrable (fun ω => f ω ^ n) P) :\n eLpNorm f n P ^ n = ENNReal.ofReal (∫ ω, f ω ^ n ∂P" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_moment", + "line": 138, + "source_header": "]\n\ntheorem weightedAbsSeries_moment {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P) (n : ℕ) :\n Integrable (fun ω => weightedAbsSeries w U ω ^ n) P ∧\n (∫ ω, weightedAbsSeries w U ω ^ n ∂P) ≤\n (∑' i, w i) ^ n * standardAbsMoment" + }, + { + "kind": "lemma", + "unqualified_name": "exp_mul_abs_le", + "line": 173, + "source_header": "w\n\n/- Exponential support coauthored by\n/root/normalizer_palm_research/gaussian_reference_probe. -/\n\nprivate lemma exp_mul_abs_le (s x : ℝ) :\n Real.exp (s * |x|) ≤ Real.exp (s*x) + Real.exp ((-s)" + }, + { + "kind": "theorem", + "unqualified_name": "foldedGaussian_exp", + "line": 186, + "source_header": "x)]\n\nprivate theorem foldedGaussian_exp (s : ℝ) :\n Integrable (fun z : ℝ => Real.exp (s * |z|)) (gaussianReal 0 1) ∧\n (∫ z : ℝ, Real.exp (s * |z|) ∂gaussianReal 0 1) ≤ 2*Real.exp (s^2" + }, + { + "kind": "lemma", + "unqualified_name": "finite_exp_jensen", + "line": 208, + "source_header": "ing\n\nprivate lemma finite_exp_jensen {I : Type*} (s : Finset I) (w x : I → ℝ)\n (W t : ℝ) (hW : 0 < W) (hw : ∀ i, 0 ≤ w i)\n (hsum : ∑ i ∈ s, w i ≤ W) :\n Real.exp (t * ∑ i ∈ s, w i * |x i|) ≤\n (1-∑ i ∈ s, w i/W) + ∑ i ∈ s, (w i/W)*Real.exp (t*W*|x" + }, + { + "kind": "lemma", + "unqualified_name": "finite_exp_integrable_bound", + "line": 229, + "source_header": "hj\n\nprivate lemma finite_exp_integrable_bound {I Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (s : Finset I) (w : I → ℝ)\n (U : I → Ω → ℝ) (hmeas : ∀ i, Measurable (U i))\n (W t K : ℝ) (hW : 0 < W) (hw : ∀ i, 0 ≤ w i)\n (hsum : ∑ i ∈ s, w i ≤ W) (hK : 1 ≤ K)\n (hUi : ∀ i, Integrable (fun ω => Real.exp (t*W*|U i ω|)) P)\n (hUb : ∀ i, (∫ ω, Real.exp (t*W*|U i ω|) ∂P) ≤ K) :\n Integrable (fun ω => Real.exp (t*∑ i ∈ s, w i*|U i ω|)) P ∧\n (∫ ω, Real.exp (t*∑ i ∈ s, w i*|U i ω|) ∂P)" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_exp_posWeight", + "line": 269, + "source_header": "ith\n\n\nprivate theorem weightedAbsSeries_exp_posWeight {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (hmeas : ∀ i, Measurable (U i)) (hw : ∀ i, 0 ≤ w i) (hws : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)\n (haesum : ∀ᵐ ω ∂P, Summable (fun i => w i*|U i ω|))\n (hW : 0 < ∑' i, w i) (t : ℝ) :\n Integrable (fun ω => Real.exp (t*weightedAbsSeries w U ω)) P ∧\n (∫ ω, Real.exp (t*weightedAbsSeries w U ω) ∂P) ≤\n 2*Real.exp (t^2*(∑' i, w i)^2" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_exp_bound", + "line": 334, + "source_header": "W]\n\n\ntheorem weightedAbsSeries_exp_bound {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (hmeas : ∀ i, Measurable (U i)) (hw : ∀ i, 0 ≤ w i) (hws : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)\n (t : ℝ) :\n Integrable (fun ω => Real.exp (t*weightedAbsSeries w U ω)) P ∧\n (∫ ω, Real.exp (t*weightedAbsSeries w U ω) ∂P) ≤\n 2*Real.exp (t^2*(∑' i, w i)^2" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_upper_tail", + "line": 357, + "source_header": ") t\n\n\n/-- Exponential Markov with t=R/W² gives the Gaussian upper tail without independence. -/\ntheorem weightedAbsSeries_upper_tail {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)\n (hW : 0 < ∑' i, w i) (R : ℝ) (hR : 0 ≤ R) :\n P.real {ω | R ≤ weightedAbsSeries w U ω} ≤\n 2 * Real.exp (-(R ^ 2) / (2 * (∑' i, w i)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceSmooth.lean", + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "orderCoordinateBound", + "line": 24, + "source_header": "h\n\ndef orderCoordinateBound (n : ℕ) (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderProductBound", + "line": 27, + "source_header": "n\n\ndef orderProductBound (n d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderPairedBound", + "line": 30, + "source_header": ")\n\ndef orderPairedBound (n d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderModeBound", + "line": 33, + "source_header": "k\n\ndef orderModeBound (n d : ℕ) (L : ℝ) (m : SourceMode d) :" + }, + { + "kind": "theorem", + "unqualified_name": "orderCoordinateBound_summable", + "line": 38, + "source_header": "k\n\ntheorem orderCoordinateBound_summable (n : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderCoordinateBound n a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderProductBound_summable", + "line": 59, + "source_header": "g\n\ntheorem orderProductBound_summable (n d : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderProductBound n d a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_summable", + "line": 64, + "source_header": "d\n\ntheorem orderPairedBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderPairedBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_eq_amplitude", + "line": 68, + "source_header": "_\n\ntheorem orderPairedBound_eq_amplitude (n d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : Fin d → ℤ) :\n orderPairedBound n d L k =\n Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_nonneg", + "line": 92, + "source_header": "g\n\ntheorem orderModeBound_nonneg (n d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_summable", + "line": 100, + "source_header": "y\n\ntheorem orderModeBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_four", + "line": 115, + "source_header": "e\n\ntheorem orderModeBound_four (d : ℕ) (L : ℝ) (m : SourceMode d) :\n orderModeBound 4 d L m = modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_order_bound", + "line": 119, + "source_header": "l\n\ntheorem modeCoefficient_iteratedFDeriv_order_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ orderModeBound j d L" + }, + { + "kind": "def", + "unqualified_name": "goodSample", + "line": 179, + "source_header": "]\n\n/-- One explicit coefficient event, shared by every derivative order. -/\ndef goodSample (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : P" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_ae", + "line": 183, + "source_header": "m|)\n\ntheorem goodSample_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, goodSample d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_of_goodSample", + "line": 190, + "source_header": "hL)\n\ntheorem sourceField_smooth_of_goodSample (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (hω : goodSample d L ω) :\n ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_ae", + "line": 222, + "source_header": "m))\n\ntheorem sourceField_smooth_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_congr_cofinite", + "line": 227, + "source_header": "hω\n\n/-- The carrier depends only on the coefficient tail; finite coordinate changes\ncannot destroy any derivative-order summability condition. -/\ntheorem goodSample_congr_cofinite (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (hωη : ω =ᶠ[Filter.cofinite] η) :\n goodSample d L ω ↔ goodSample" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_finite_change_iff", + "line": 242, + "source_header": "[hm]\n\ntheorem goodSample_finite_change_iff (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))\n (hωη : ∀ m ∉ s, ω m = η m) :\n goodSample d L ω ↔ goodSample" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceSmoothCarrier.lean", + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "goodSet", + "line": 30, + "source_header": "r\n\n/-- The actual common coefficient event, with no smoothness premise added. -/\ndef goodSet (d : ℕ) (L : ℝ) : Set (SourceMode d →" + }, + { + "kind": "def", + "unqualified_name": "orderAbsNN", + "line": 34, + "source_header": "ω}\n\nprivate def orderAbsNN (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ)\n (m : SourceMode d) :" + }, + { + "kind": "def", + "unqualified_name": "orderAbsTotal", + "line": 39, + "source_header": "_)⟩\n\nprivate def orderAbsTotal (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_ne_top_iff", + "line": 42, + "source_header": "0∞)\n\nprivate theorem orderAbsTotal_ne_top_iff (n d : ℕ) (L : ℝ)\n (ω : SourceMode d → ℝ) :\n orderAbsTotal n d L ω ≠ ∞ ↔\n Summable (fun m => orderModeBound n d L m * |ω" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_measurable", + "line": 48, + "source_header": "ω)\n\nprivate theorem orderAbsTotal_measurable (n d : ℕ) (L : ℝ) :\n Measurable (orderAbsTotal n d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measurable", + "line": 62, + "source_header": "eal\n\ntheorem goodSet_measurable (d : ℕ) (L : ℝ) : MeasurableSet (goodSet d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_ae", + "line": 75, + "source_header": "imp\n\ntheorem goodSet_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ω ∈ goodSet" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measure_one", + "line": 79, + "source_header": "hL\n\ntheorem goodSet_measure_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceLaw d (goodSet d L)" + }, + { + "kind": "abbrev", + "unqualified_name": "SmoothSample", + "line": 83, + "source_header": "hL)\n\n/-- A coefficient sample on the explicit all-order summability carrier. -/\nabbrev SmoothSample (d : ℕ) (L" + }, + { + "kind": "def", + "unqualified_name": "sampleInclusion", + "line": 86, + "source_header": "d L)\n\n/-- Literal inclusion, retaining every coefficient of the original sample. -/\ndef sampleInclusion (d : ℕ) (L : ℝ) : SmoothSample d L → (SourceMode" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurable", + "line": 90, + "source_header": "ype.val\n\ntheorem sampleInclusion_measurable (d : ℕ) (L : ℝ) :\n Measurable (sampleInclusi" + }, + { + "kind": "def", + "unqualified_name": "smoothLaw", + "line": 94, + "source_header": "ype_coe\n\n/-- Pull back the original product law; no normalization or new law is chosen. -/\ndef smoothLaw (d : ℕ) (L : ℝ) : Measure (SmoothSa" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_map", + "line": 98, + "source_header": "sion d L)\n\ntheorem sampleInclusion_map (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n (smoothLaw d L).map (sampleInclusion d L) = so" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurePreserving", + "line": 105, + "source_header": "ae d hL)]\n\ntheorem sampleInclusion_measurePreserving (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothLaw_isProbabilityMeasure", + "line": 109, + "source_header": "map d hL⟩\n\ntheorem smoothLaw_isProbabilityMeasure (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsProbabilityMeasure (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "observation_map_eq", + "line": 114, + "source_header": "t_ae d hL\n\n/-- Every measurable observation has exactly its original pushforward law. -/\ntheorem observation_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :\n (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceL" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 121, + "source_header": "n_map d hL]\n\ntheorem coordinate_marginal (d : ℕ) {L : ℝ} (hL : L ≠ 0) (m : SourceMode d) :\n (smoothLaw d L).map (fun ω => sampleInclusion d L ω m) = gauss" + }, + { + "kind": "theorem", + "unqualified_name": "finiteCoordinate_map_eq", + "line": 126, + "source_header": "_marginal m\n\ntheorem finiteCoordinate_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (m : Fin n → SourceMode d) :\n (smoothLaw d L).map (fun ω j => sampleInclusion d L ω (m j)) =\n (sourceLaw d).map (fun ω j" + }, + { + "kind": "def", + "unqualified_name": "smoothSourceField", + "line": 132, + "source_header": "ply (m j)))\n\n/-- The unchanged literal real-cover field, evaluated on the carrier. -/\ndef smoothSourceField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : F" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_contDiff", + "line": 136, + "source_header": "sion d L ω) x\n\ntheorem smoothSourceField_contDiff (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) (n : ℕ) : ContDiff ℝ n (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_smooth", + "line": 140, + "source_header": "ω.property n\n\ntheorem smoothSourceField_smooth (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ (⊤ : ℕ∞) (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_map_eq", + "line": 144, + "source_header": "tDiff d hL ω)\n\ntheorem smoothSourceField_finiteVector_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n (smoothLaw d L).map (fun ω j => smoothSourceField d L ω (x j)) =\n (sourceLaw d).map (fun ω j => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_hasGaussianLaw", + "line": 151, + "source_header": "e d L (x j)))\n\ntheorem smoothSourceField_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => smoothSourceField d L ω (x j)) (s" + }, + { + "kind": "theorem", + "unqualified_name": "covariance_comp_inclusion", + "line": 161, + "source_header": "sGaussian_map\n\ntheorem covariance_comp_inclusion (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (X Y : (SourceMode d → ℝ) → ℝ) (hX : Measurable X) (hY : Measurable Y) :\n cov[fun ω => X (sampleInclusion d L ω), fun ω => Y (sampleInclusion d L ω); smoothLaw d L] =\n cov[X, Y;" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_covariance", + "line": 171, + "source_header": "exact h.symm\n\ntheorem smoothSourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (x y : Fin d → ℝ) :\n cov[fun ω => smoothSourceField d L ω x, fun ω => smoothSourceField d L ω y; smoothLaw d L] =\n sourceSpectralKerne" + }, + { + "kind": "def", + "unqualified_name": "smoothTorusSourceField", + "line": 181, + "source_header": "ance d hL x y\n\n/-- The unchanged literal torus descent of the same coefficient sample. -/\ndef smoothTorusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) (q : Sourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_smooth", + "line": 188, + "source_header": "ualChartedSpace\n\ntheorem smoothTorusSourceField_smooth (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) :\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) (⊤ : ℕ∞) (smoothTorusSou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_finiteVector_hasGaussianLaw", + "line": 205, + "source_header": "ontDiffWithinAt\n\ntheorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ)\n [Fact (0 < L)] (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => smoothTorusSourceField d L ω (q j))" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_covariance", + "line": 218, + "source_header": ".isGaussian_map\n\ntheorem smoothTorusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => smoothTorusSourceField d L ω q, fun ω => smoothTorusSourceField d L ω p;\n smoothLaw d L] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepres" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceKernel.lean", + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "frequencyEquiv", + "line": 8, + "source_header": "def frequencyEquiv (d : ℕ) : SourceMode d ≃ (Fin d → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "sourceSpectralKernel", + "line": 11, + "source_header": "/-- The prescribed normalized full-lattice real Fourier kernel; image/Poisson linkage is separate. -/\ndef sourceSpectralKernel (d : ℕ) (L : ℝ) (z : Fin d → ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "tsum_mode", + "line": 15, + "source_header": ")\n\nprivate theorem tsum_mode (d : ℕ) (f : SourceMode d → ℝ) (hf : Summable f) :\n (∑' m, f m) = f none + ∑' k : ↥(halfLattice d),\n (f (some (k,false)) + f (some (k,true))" + }, + { + "kind": "theorem", + "unqualified_name": "modeProduct_summable", + "line": 33, + "source_header": "g\n\ntheorem modeProduct_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n Summable (fun m => modeCoefficient d L m x * modeCoefficient d L m y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_summable", + "line": 46, + "source_header": ")\n\ntheorem spectralKernel_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (z : Fin d → ℝ) :\n Summable (fun k : Fin d → ℤ =>\n sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)" + }, + { + "kind": "theorem", + "unqualified_name": "coefficientKernel_eq_fullLattice", + "line": 58, + "source_header": "q\n\ntheorem coefficientKernel_eq_fullLattice (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =\n sourceSpectralKernel d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_zero", + "line": 103, + "source_header": "m\n\ntheorem spectralKernel_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceSpectralKernel d L 0 =" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceTorus.lean", + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "SourceTorus", + "line": 13, + "source_header": "s\n\nabbrev SourceTorus (d : ℕ) (L : ℝ" + }, + { + "kind": "def", + "unqualified_name": "torusProjection", + "line": 15, + "source_header": "L\n\ndef torusProjection (d : ℕ) (L : ℝ) (x : Fin d → ℝ) : SourceTorus d" + }, + { + "kind": "def", + "unqualified_name": "torusRepresentative", + "line": 18, + "source_header": ")\n\ndef torusRepresentative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "torusSourceField", + "line": 22, + "source_header": "1\n\ndef torusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (q : SourceTorus d L) :" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_measurable", + "line": 26, + "source_header": ")\n\ntheorem torusProjection_measurable (d : ℕ) (L : ℝ) : Measurable (torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusRepresentative_measurable", + "line": 29, + "source_header": ")\n\ntheorem torusRepresentative_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (torusRepresentative d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_representative", + "line": 34, + "source_header": ")\n\ntheorem torusProjection_representative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : torusProjection d L (torusRepresentative d L q) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eq_of_torusProjection_eq", + "line": 39, + "source_header": ")\n\ntheorem sourceField_eq_of_torusProjection_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (x y : Fin d → ℝ)\n (h : torusProjection d L x = torusProjection d L y) :\n sourceField d L ω x = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_pullback", + "line": 57, + "source_header": "m\n\ntheorem torusSourceField_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (x : Fin d → ℝ) :\n torusSourceField d L ω (torusProjection d L x) = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_eval_measurable", + "line": 64, + "source_header": ")\n\ntheorem torusSourceField_eval_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Measurable (fun ω => torusSourceField d L ω q" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_joint_measurable", + "line": 68, + "source_header": ")\n\ntheorem torusSourceField_joint_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (fun p : (SourceMode d → ℝ) × SourceTorus d L =>\n torusSourceField d L p.1 p.2" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_finiteVector_hasGaussianLaw", + "line": 84, + "source_header": ")\n\ntheorem torusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => torusSourceField d L ω (q j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_isGaussianProcess", + "line": 90, + "source_header": ")\n\ntheorem torusSourceField_isGaussianProcess (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsGaussianProcess (fun q ω => torusSourceField d L ω q) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance", + "line": 95, + "source_header": ")\n\ntheorem torusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance_pullback", + "line": 102, + "source_header": ")\n\ntheorem torusSourceField_covariance_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (x y : Fin d → ℝ) :\n cov[fun ω => torusSourceField d L ω (torusProjection d L x),\n fun ω => torusSourceField d L ω (torusProjection d L y); sourceLaw d] =\n sourceSpectralKernel d L (x - y" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SpectralWeights.lean", + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "decay", + "line": 14, + "source_header": "s\n\ndef decay (a : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "coordinateBound", + "line": 16, + "source_header": ")\ndef coordinateBound (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productDecay", + "line": 18, + "source_header": "4\ndef productDecay (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productBound", + "line": 20, + "source_header": ")\ndef productBound (d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceA", + "line": 22, + "source_header": ")\ndef sourceA (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceC", + "line": 23, + "source_header": "2\ndef sourceC (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceWeight", + "line": 24, + "source_header": "L\ndef sourceWeight (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceZ", + "line": 26, + "source_header": "k\ndef sourceZ (d : ℕ) (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "pairedBound", + "line": 27, + "source_header": "k\ndef pairedBound (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "theorem", + "unqualified_name": "summable_decay_pow", + "line": 29, + "source_header": "k\n\ntheorem summable_decay_pow {a : ℝ} (ha : 0 < a) (n : ℕ) :\n Summable (fun k : ℤ => decay a k * |(k : ℝ)| ^ n" + }, + { + "kind": "theorem", + "unqualified_name": "coordinateBound_summable", + "line": 40, + "source_header": "b\n\ntheorem coordinateBound_summable {a c : ℝ} (ha : 0 < a) :\n Summable (coordinateBound a c" + }, + { + "kind": "theorem", + "unqualified_name": "finite_product_summable", + "line": 52, + "source_header": "n\ntheorem finite_product_summable {f : ℤ → ℝ} (hf : Summable f) (hn : ∀ k, 0 ≤ f k)\n (d : ℕ) : Summable (fun k : Fin d → ℤ => ∏ i, f (k i)" + }, + { + "kind": "theorem", + "unqualified_name": "productBound_summable", + "line": 72, + "source_header": "p\n\ntheorem productBound_summable {a c : ℝ} (ha : 0 < a) (d : ℕ) :\n Summable (productBound d a c" + }, + { + "kind": "theorem", + "unqualified_name": "productDecay_eq_exp", + "line": 77, + "source_header": "d\n\ntheorem productDecay_eq_exp (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :\n productDecay d a k = exp (-a * ∑ i, (k i : ℝ) ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "frequency_l1_le_product", + "line": 82, + "source_header": "]\n\ntheorem frequency_l1_le_product (d : ℕ) (v : Fin d → ℝ) (hv : ∀ i, 0 ≤ v i) :\n 1 + ∑ i, v i ≤ ∏ i, (1 + v i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceA_pos", + "line": 98, + "source_header": "v\n\ntheorem sourceA_pos {L : ℝ} (hL : L ≠ 0) : 0 < sourceA" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_eq_physical", + "line": 102, + "source_header": "y\n\ntheorem sourceWeight_eq_physical (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L k = exp (-(∑ i, (sourceC L * (k i : ℝ)) ^ 2) / 2" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_summable", + "line": 117, + "source_header": "g\n\ntheorem sourceWeight_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (sourceWeight d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceZ_pos", + "line": 124, + "source_header": "d\n\ntheorem sourceZ_pos (d : ℕ) {L : ℝ} (hL : L ≠ 0) : 0 < sourceZ d" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_eq_amplitude", + "line": 129, + "source_header": "]\n\ntheorem pairedBound_eq_amplitude (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : Fin d → ℤ) :\n pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_summable", + "line": 151, + "source_header": "g\n\ntheorem pairedBound_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (pairedBound d L" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_subtype_summable", + "line": 155, + "source_header": "_\n\ntheorem pairedBound_subtype_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (S : Set (Fin d → ℤ)) : Summable (fun k : S => pairedBound d L k" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceFourierSeries.lean", + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "halfLattice", + "line": 14, + "source_header": "e\n\n/-- The representative whose first nonzero coordinate is positive. -/\ndef halfLattice (d : ℕ) : Set (Fin d →" + }, + { + "kind": "abbrev", + "unqualified_name": "SourceMode", + "line": 18, + "source_header": "0}\n\nabbrev SourceMode (d :" + }, + { + "kind": "abbrev", + "unqualified_name": "sourceLaw", + "line": 20, + "source_header": "ol)\n\n/-- The actual common law, with independent variance-one real coefficients. -/\nabbrev sourceLaw (d : ℕ) : Measure (SourceMode d" + }, + { + "kind": "def", + "unqualified_name": "phase", + "line": 24, + "source_header": "de d)\n\ndef phase (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ" + }, + { + "kind": "def", + "unqualified_name": "modeCoefficient", + "line": 27, + "source_header": "* x i\n\n/-- False is the cosine coefficient and true the independent sine coefficient. -/\ndef modeCoefficient (d : ℕ) (L : ℝ) (m : SourceMode d) (x : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "modeMajorant", + "line": 34, + "source_header": "L k x)\n\ndef modeMajorant (d : ℕ) (L : ℝ) (m : SourceMode" + }, + { + "kind": "def", + "unqualified_name": "sourceField", + "line": 39, + "source_header": "d d L k\n\n/-- Literal normalized real Fourier sum on the common coefficient samples. -/\ndef sourceField (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) (x : Fin d" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_nonneg", + "line": 43, + "source_header": "L m x) ω\n\ntheorem modeMajorant_nonneg (d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_summable", + "line": 52, + "source_header": "ositivity\n\ntheorem modeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (modeMajo" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_bound", + "line": 66, + "source_header": ".summable\n\ntheorem modeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (x : Fin d → ℝ) :\n |modeCoefficient d L m x| ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eval_measurable", + "line": 98, + "source_header": "rans hamp\n\ntheorem sourceField_eval_measurable (d : ℕ) (L : ℝ) (x : Fin d → ℝ) :\n Measurable (fun ω => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "sourceMajorant_ae", + "line": 102, + "source_header": "surable _\n\ntheorem sourceMajorant_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Summable (fun m => modeMajorant d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAbs_uniform_ae", + "line": 106, + "source_header": "ble d hL)\n\ntheorem sourceAbs_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => |modeCoefficient d L m x * ω m|)\n (fun x => ∑' m, |modeCoefficient d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_uniform_ae", + "line": 117, + "source_header": "nonneg _)\n\ntheorem sourceField_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => modeCoefficient d L m x * ω m)\n (sourceFie" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_continuous_ae", + "line": 128, + "source_header": "nonneg _)\n\ntheorem sourceField_continuous_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Continuous (sourceFie" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceCovariance.lean", + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "scalarSeries_covariance", + "line": 12, + "source_header": "theorem scalarSeries_covariance (a b : ι → ℝ) (ha : Summable a) (hb : Summable b) :\n cov[scalarSeries a, scalarSeries b; coefficientLaw ι] = ∑' i, a i * b i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_integral_zero", + "line": 51, + "source_header": "theorem sourceField_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n ∫ ω, sourceField d L ω x ∂sourceLaw d = 0" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_covariance", + "line": 58, + "source_header": "theorem sourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] =\n sourceSpectralKernel d L (x - y)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_variance_one", + "line": 68, + "source_header": "theorem sourceField_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n Var[fun ω => sourceField d L ω x; sourceLaw d] = 1" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceGaussianLaw.lean", + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "summable_square", + "line": 18, + "source_header": "}\n\nprivate theorem summable_square (a : ι → ℝ) (ha : Summable a) :\n Summable (fun i => a i ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "partial_charFun", + "line": 29, + "source_header": "n\nprivate theorem partial_charFun (a : ι → ℝ) (s : Finset ι) (t : ℝ) :\n charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =\n Complex.exp (-((∑ i ∈ s, a i ^ 2 : ℝ) : ℂ) * (t : ℂ) ^ 2 / 2" + }, + { + "kind": "theorem", + "unqualified_name": "charFun_partial_tendsto", + "line": 55, + "source_header": "]\n\nprivate theorem charFun_partial_tendsto (a : ι → ℝ) (ha : Summable a) (t : ℝ) :\n Filter.Tendsto\n (fun s : Finset ι => charFun ((coefficientLaw ι).map\n (fun ω => ∑ i ∈ s, a i * ω i)) t)\n Filter.atTop (𝓝 (charFun ((coefficientLaw ι).map (scalarSeries a)) t)" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_map_gaussian", + "line": 90, + "source_header": "ω\n\ntheorem scalarSeries_map_gaussian (a : ι → ℝ) (ha : Summable a) :\n (coefficientLaw ι).map (scalarSeries a) =\n gaussianReal 0 (∑' i, a i ^ 2).toNNRea" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_integral_zero", + "line": 109, + "source_header": "g\n\ntheorem scalarSeries_integral_zero (a : ι → ℝ) (ha : Summable a) :\n ∫ ω, scalarSeries a ω ∂coefficientLaw ι =" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_variance", + "line": 116, + "source_header": "h\n\ntheorem scalarSeries_variance (a : ι → ℝ) (ha : Summable a) :\n Var[scalarSeries a; coefficientLaw ι] = ∑' i, a i ^" + }, + { + "kind": "theorem", + "unqualified_name": "source_linearCombination_hasGaussianLaw", + "line": 122, + "source_header": ")\n\ntheorem source_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) (c : Fin n → ℝ) :\n HasGaussianLaw (fun ω => ∑ j, c j * sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "source_finiteVector_hasGaussianLaw", + "line": 147, + "source_header": ")\n\ntheorem source_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_isGaussianProcess", + "line": 174, + "source_header": "l\n\ntheorem sourceField_isGaussianProcess (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsGaussianProcess (fun x ω => sourceField d L ω x) (sourceLaw d" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/GaussianSeriesFoundation.lean", + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "coefficientLaw", + "line": 15, + "source_header": "n\n\n/-- The same actual probability measure used for every coefficient and series assertion. -/\ndef coefficientLaw (ι : Type*) : Measure (ι →" + }, + { + "kind": "instance", + "unqualified_name": "coefficientLaw_isProbabilityMeasure", + "line": 19, + "source_header": "1)\n\ninstance coefficientLaw_isProbabilityMeasure (ι : Type*) :\n IsProbabilityMeasure (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_measurePreserving", + "line": 24, + "source_header": "nce\n\ntheorem coordinate_measurePreserving {ι : Type*} (i : ι) :\n MeasurePreserving (fun ω : ι → ℝ => ω i) (coefficientLaw ι)\n (gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 29, + "source_header": ") i\n\ntheorem coordinate_marginal {ι : Type*} (i : ι) :\n (coefficientLaw ι).map (fun ω => ω i) = gaussianReal" + }, + { + "kind": "theorem", + "unqualified_name": "coordinates_independent", + "line": 33, + "source_header": "_eq\n\ntheorem coordinates_independent (ι : Type*) :\n iIndepFun (fun i (ω : ι → ℝ) => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_memLp", + "line": 38, + "source_header": "id)\n\ntheorem coordinate_memLp {ι : Type*} (i : ι) (p : ℝ≥0∞) (hp : p ≠ ∞) :\n MemLp (fun ω : ι → ℝ => ω i) p (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_integrable", + "line": 43, + "source_header": "i)\n\ntheorem coordinate_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_abs_integrable", + "line": 47, + "source_header": "p))\n\ntheorem coordinate_abs_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => |ω i|) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_abs_summable_ae", + "line": 51, + "source_header": "orm\n\ntheorem weighted_abs_summable_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (ha : ∀ i, 0 ≤ a i) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, Summable (fun i => a i * |ω" + }, + { + "kind": "def", + "unqualified_name": "scalarSeries", + "line": 75, + "source_header": "hω\n\n/-- The actual scalar sum; its convergence is proved separately on the product law. -/\ndef scalarSeries {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_measurable", + "line": 79, + "source_header": "* ω i\n\ntheorem scalarSeries_measurable {ι : Type*} [Countable ι] (a : ι → ℝ) :\n Measurable (scalarSeri" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_hasSum_ae", + "line": 86, + "source_header": "ly i)\n\ntheorem scalarSeries_hasSum_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, HasSum (fun i => a i * ω i) (scalarSeries" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceTorusC4.lean", + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "quotientChart", + "line": 12, + "source_header": "def quotientChart (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n OpenPartialHomeomorph (SourceTorus d L) (Fin d → ℝ)" + }, + { + "kind": "def", + "unqualified_name": "chartCenter", + "line": 16, + "source_header": "def chartCenter (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) : Fin d → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "quotientChart_symm", + "line": 19, + "source_header": "theorem quotientChart_symm (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n (quotientChart d L a).symm = torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "centered_chart_covers", + "line": 23, + "source_header": "theorem centered_chart_covers (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) :\n q ∈ (quotientChart d L (chartCenter d L q)).source" + }, + { + "kind": "theorem", + "unqualified_name": "chart_transition_contDiff", + "line": 51, + "source_header": "theorem chart_transition_contDiff (d : ℕ) (L : ℝ) [Fact (0 < L)] (a b : Fin d → ℝ) :\n ContDiffOn ℝ ∞ ((quotientChart d L a).symm.trans (quotientChart d L b))\n ((quotientChart d L a).symm.trans (quotientChart d L b)).source" + }, + { + "kind": "theorem", + "unqualified_name": "torus_isManifold", + "line": 98, + "source_header": "theorem torus_isManifold (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsManifold 𝓘(ℝ, Fin d → ℝ) ∞ (SourceTorus d L)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_contMDiff_ae", + "line": 110, + "source_header": "theorem torusSourceField_contMDiff_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d,\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) 4 (torusSourceField d L sample)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_weakSuperlevel_closed_ae", + "line": 126, + "source_header": "theorem torusSourceField_weakSuperlevel_closed_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d, ∀ h : ℝ,\n IsClosed {q : SourceTorus d L | h ≤ torusSourceField d L sample q}" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceC4.lean", + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "phaseCLM", + "line": 13, + "source_header": "4\n\ndef phaseCLM (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : (Fin d → ℝ) →L[ℝ]" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_apply", + "line": 16, + "source_header": "i\n\ntheorem phaseCLM_apply (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) :\n phaseCLM d L k x = phase d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_norm_le", + "line": 20, + "source_header": "]\n\ntheorem phaseCLM_norm_le (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n ‖phaseCLM d L k‖ ≤ ∑ i, |sourceC L * (k i : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_bound", + "line": 35, + "source_header": "]\n\ntheorem modeCoefficient_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (hj : j ≤ 4) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_ae", + "line": 102, + "source_header": "]\n\ntheorem sourceField_contDiff_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ContDiff ℝ 4 (sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_affine_ae", + "line": 133, + "source_header": ")\n\ntheorem sourceField_contDiff_affine_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ (T : (Fin d → ℝ) →L[ℝ] (Fin d → ℝ)) (a : Fin d → ℝ),\n ContDiff ℝ 4 (fun x => sourceField d L ω (a + T x)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceLattice.lean", + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "latticeFrequency", + "line": 8, + "source_header": "def latticeFrequency (d : ℕ) (m : SourceMode d) : Fin d → ℤ" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_ne_zero", + "line": 13, + "source_header": "theorem halfLattice_ne_zero (d : ℕ) {k : Fin d → ℤ} (hk : k ∈ halfLattice d) :\n k ≠ 0" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_partition", + "line": 20, + "source_header": "theorem halfLattice_partition (d : ℕ) {k : Fin d → ℤ} (hk : k ≠ 0) :\n (k ∈ halfLattice d ∨ -k ∈ halfLattice d) ∧\n ¬ (k ∈ halfLattice d ∧ -k ∈ halfLattice d)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_neg", + "line": 59, + "source_header": "theorem sourceWeight_neg (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L (-k) = sourceWeight d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phase_lattice_shift", + "line": 64, + "source_header": "theorem phase_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k n : Fin d → ℤ) (x : Fin d → ℝ) :\n phase d L k (fun i => x i + L * (n i : ℝ)) =\n phase d L k x + ((∑ i, k i * n i : ℤ) : ℝ) * (2 * Real.pi)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_lattice_shift", + "line": 78, + "source_header": "theorem modeCoefficient_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) =\n modeCoefficient d L m x" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_lattice_shift", + "line": 90, + "source_header": "theorem sourceField_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n sourceField d L ω (fun i => x i + L * (n i : ℝ)) = sourceField d L ω x" + }, + { + "kind": "theorem", + "unqualified_name": "pairedCoefficient_kernel", + "line": 100, + "source_header": "theorem pairedCoefficient_kernel (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ↥(halfLattice d)) (x y : Fin d → ℝ) :\n (∑ b : Bool, modeCoefficient d L (some (k,b)) x *\n modeCoefficient d L (some (k,b)) y) =\n (2 * sourceWeight d L k / sourceZ d L) * Real.cos (phase d L k (x - y))" + }, + { + "kind": "theorem", + "unqualified_name": "latticeFrequency_bijective", + "line": 120, + "source_header": "theorem latticeFrequency_bijective (d : ℕ) : Function.Bijective (latticeFrequency d)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizerLimit.lean", + "sha256": "12c98054b5bcf47f4619c624ef5e91c37f316d7c4848f560279d1f1e96fe0049", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "gnl_contact_relations", + "line": 21, + "source_header": "e\n\nprivate theorem gnl_contact_relations (m : EuclideanSpace ℝ (Fin 6)) (S : Matrix (Fin 6) (Fin 6) ℝ)\n (hS : S.PosSemidef)\n (hm0 : m 0 = -1) (hm1 : m 1 = 1)\n (hm23 : m 2 + m 3 = 0) (hm45 : m 4 - m 5 = 0)\n (hS0 : S 0 0 = 0) (hS1 : S 1 1 = 0)\n (hS23 : S 2 2 + 2*S 2 3 + S 3 3 = 0)\n (hS45 : S 4 4 - 2*S 4 5 + S 5 5 = 0) :\n ∀ᵐ x ∂multivariateGaussian m S,\n x 0 = -1 ∧ x 1 = 1 ∧ x 2 + x 3 = 0 ∧ x 4 - x 5 =" + }, + { + "kind": "lemma", + "unqualified_name": "gnl_positivePart_memLp", + "line": 64, + "source_header": "⟩\n\nprivate lemma gnl_positivePart_memLp {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {f : Ω → ℝ} {p : ℝ≥0∞} (hf : MemLp f p P) :\n MemLp (fun x => max (f x) 0) p" + }, + { + "kind": "lemma", + "unqualified_name": "gnl_gaussian_weight_integrable", + "line": 72, + "source_header": ")\n\nprivate lemma gnl_gaussian_weight_integrable (r : ℝ) (m : EuclideanSpace ℝ (Fin 6))\n (S : Matrix (Fin 6) (Fin 6) ℝ) (hS : S.PosSemidef) :\n Integrable (fun x : EuclideanSpace ℝ (Fin 6) => gn_normalizedWeight r (ofLp x))\n (multivariateGaussian m S" + }, + { + "kind": "theorem", + "unqualified_name": "gnl_normalizer_floor_of_parameter_limits", + "line": 105, + "source_header": "T\n\n\n/-- Gaussian endpoint parameter convergence and concrete contact moments supply\none positive physical normalizer coefficient at every sufficiently small radius.\nThe covariance may be singular; the transverse reference mean is unrestricted. -/\ntheorem gnl_normalizer_floor_of_parameter_limits\n (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)\n (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)\n (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))\n (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))\n (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)\n (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)\n (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)\n (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)\n (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)\n (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤\n ∫ x : EuclideanSpace ℝ (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)\n ∂multivariateGaussian (m r) (S" + }, + { + "kind": "theorem", + "unqualified_name": "gnl_physical_normalizer_floor_of_parameter_limits", + "line": 174, + "source_header": "op)\n\n\n/-- The same Gaussian parameter limit gives the full literal typed endpoint\nnormalizer, after the explicit permutation back to physical endpoint order. -/\ntheorem gnl_physical_normalizer_floor_of_parameter_limits\n (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)\n (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)\n (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))\n (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))\n (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)\n (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)\n (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)\n (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)\n (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)\n (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤\n ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]\n ∂multivariateGaussian (m r)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointNormalizerBridge.lean", + "sha256": "36eab3b805fcba5160cb7e286dbd7f96940b0c6a85b464aad5fdad2f624ceb7e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "enb_permutation", + "line": 19, + "source_header": "e\n\n/-- Convert the actual six endpoint entries to the continuous weight's order. -/\ndef enb_permutation (j : Fin 6 → ℝ) : Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "enb_permutation_continuous", + "line": 23, + "source_header": "5]\n\ntheorem enb_permutation_continuous : Continuous enb_permutat" + }, + { + "kind": "theorem", + "unqualified_name": "enb_maximum_factor", + "line": 27, + "source_header": "rop\n\nprivate theorem enb_maximum_factor (r a b c : ℝ) (hr : 0 < r) :\n max (max (-a) 0 * max (-c) 0 - r * b ^ 2) 0 =\n if a < 0 ∧ 0 < a * c - r * b ^ 2 then a * c - r * b ^ 2 els" + }, + { + "kind": "theorem", + "unqualified_name": "enb_maximum_iff", + "line": 53, + "source_header": ")))\n\n/-- Strict negative definiteness in actual endpoint coordinates, with no\nassumed sign of the other diagonal entry or omission of singular boundaries. -/\ntheorem enb_maximum_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n dm2Negative (egm_HM r j) ↔ j 0 < 0 ∧ 0 < j 0 * j 2 - r * j" + }, + { + "kind": "theorem", + "unqualified_name": "enb_saddle_iff", + "line": 64, + "source_header": "t hr]\n\n/-- The literal strict saddle condition is the sign of its factored determinant. -/\ntheorem enb_saddle_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n (egm_HS r j).det < 0 ↔ j 3 * j 5 - r * j 4" + }, + { + "kind": "theorem", + "unqualified_name": "enb_weight_identity", + "line": 73, + "source_header": "inarith\n\n/-- Exact bridge from the literal typed physical endpoint weight to the\ncontinuous expression. All excluded types and all zero boundaries give zero. -/\ntheorem enb_weight_identity (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n egm_weight r j = r ^ 2 * gn_normalizedWeight r (enb_permu" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integral_identity", + "line": 109, + "source_header": "ring\n\n/-- The physical and continuous normalizers are the same integral up to the\nexact radius factor, for any common random six-vector and any measure. -/\ntheorem enb_integral_identity {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :\n (∫ ω, egm_weight r (J ω) ∂P) =\n r ^ 2 * ∫ ω, gn_normalizedWeight r (enb_permutatio" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integrable_iff", + "line": 120, + "source_header": "nst_mul _ _\n\n/-- Positive radius makes the exact scaling nonzero, so either weight is\nintegrable precisely when the other is. -/\ntheorem enb_integrable_iff {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :\n Integrable (fun ω => egm_weight r (J ω)) P ↔\n Integrable (fun ω => gn_normalizedWeight r (enb_permutat" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integrable_of_integrable_sq", + "line": 131, + "source_header": "o 2 hr.ne'))]\n\n/-- On a finite measure, the actual endpoint second-moment theorem supplies\nthe first-moment hypotheses needed by the normalizer join. -/\ntheorem enb_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsFiniteMeasure P]\n (J : Ω → Fin 6 → ℝ) (hJ : Measurable J) (r : ℝ) (hr : 0 < r)\n (hsq : Integrable (fun ω => egm_weight r (J ω) ^ 2) P) :\n Integrable (fun ω => egm_weight r (J ω)) P ∧\n Integrable (fun ω => gn_normalizedWeight r (enb_permut" + }, + { + "kind": "theorem", + "unqualified_name": "enb_normalizer_floor_of_common_coupling", + "line": 149, + "source_header": ").mp hphysical⟩\n\n/-- The proved common-coupling normalizer floor transfers to the literal\nphysical endpoint weight, with its own actual coordinate order. Current\nphysical integrability and the conditioned-field convergence remain inputs. -/\ntheorem enb_normalizer_floor_of_common_coupling\n {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P]\n (J : ℝ → Ω → Fin 6 → ℝ) (hJ : ∀ r, Measurable (J r))\n (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => J r ω) (𝓝[>] (0 : ℝ))\n (𝓝 ![-1,-A ω/2,Q ω,1,A ω/2,Q ω]))\n (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),\n Integrable (fun ω => egm_weight r (J r ω)) P) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n c * r ^ 2 ≤ ∫ ω, egm_we" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointGaussianMoments.lean", + "sha256": "c6351881326491ce30f1a266ea60e44c5adb8b3a1e5882c90575c67e459479d1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "egm_HM", + "line": 13, + "source_header": "e\n\ndef egm_HM (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2)" + }, + { + "kind": "def", + "unqualified_name": "egm_HS", + "line": 16, + "source_header": "]\n\ndef egm_HS (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2)" + }, + { + "kind": "def", + "unqualified_name": "egm_weight", + "line": 19, + "source_header": "]\n\nnoncomputable def egm_weight (r : ℝ) (j : Fin 6 → ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "egm_weight_measurable", + "line": 24, + "source_header": "0\n\n/-- The maximum condition is the original strict quadratic-form condition;\nno null-boundary assumption is needed for measurable typing. -/\ntheorem egm_weight_measurable (r : ℝ) : Measurable (egm_weight" + }, + { + "kind": "theorem", + "unqualified_name": "egm_coordinate_bound", + "line": 49, + "source_header": "nst\n\nprivate theorem egm_coordinate_bound (j : Fin 6 → ℝ) (i : Fin 6) :\n |j i| ≤ gm8Radiu" + }, + { + "kind": "theorem", + "unqualified_name": "egm_factor_bound", + "line": 56, + "source_header": "ith\n\nprivate theorem egm_factor_bound (r a b c R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)\n (hR : 0 ≤ R) (ha : |a| ≤ R) (hb : |b| ≤ R) (hc : |c| ≤ R) :\n |a * c - r * b ^ 2| ≤ 2 * R" + }, + { + "kind": "theorem", + "unqualified_name": "egm_untyped", + "line": 68, + "source_header": "th)\n\nprivate theorem egm_untyped (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :\n ((egm_HM r j).det * (egm_HS r j).det) ^ 2 ≤\n 16 * r ^ 4 * gm8Radius j" + }, + { + "kind": "theorem", + "unqualified_name": "egm_pointwise", + "line": 97, + "source_header": "ing\n\n/-- Exact endpoint determinant domination in the actual normalized six-vector.\nThe type indicators can only reduce the nonnegative determinant product. -/\ntheorem egm_pointwise (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :\n egm_weight r j ^ 2 ≤ 16 * r ^ 4 * gm8Radius" + }, + { + "kind": "theorem", + "unqualified_name": "egm_gaussian_moment", + "line": 108, + "source_header": "vity)\n\n/-- Genuine Gaussian marginal laws of the actual normalized endpoint vector\nsupply both integrability and its determinant second moment. The derivative-map,\nconditioning law and uniform parameter bounds remain explicit model inputs. -/\ntheorem egm_gaussian_moment {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin 6 → ℝ)\n (hJ : Measurable J) (m : Fin 6 → ℝ) (v : Fin 6 → ℝ≥0)\n (B V r : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V) (hr : 0 < r) (hr1 : r ≤ 1)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => egm_weight r (J x) ^ 2) μ ∧\n (∫ x, egm_weight r (J x) ^ 2 ∂μ) ≤ 16 * gm8FiniteM8 6 B V" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/PalmReweighting.lean", + "sha256": "d34e422693f1d449bfcaf9c844c99c8fef4f19503312d3677ca525bd2d67c4d6", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "prwMeasure", + "line": 26, + "source_header": "e\n\n/-- The literal normalized nonnegative real density, defined for every input. -/\nnoncomputable def prwMeasure {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) : Measur" + }, + { + "kind": "theorem", + "unqualified_name": "prw_integrable_of_integrable_sq", + "line": 31, + "source_header": "μ))\n\n/-- On a finite measure, a measurable square-integrable real weight is integrable. -/\ntheorem prw_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hsq : Integrable (fun ω => W ω ^ 2) μ) : Integrabl" + }, + { + "kind": "theorem", + "unqualified_name": "prw_measure_apply", + "line": 42, + "source_header": "W ω)]\n\n/-- The actual event mass is the normalized set integral, in extended reals. -/\ntheorem prw_measure_apply {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n prwMeasure μ W E = ENNReal.ofReal ((∫ x in E, W x ∂μ) / ∫ x," + }, + { + "kind": "theorem", + "unqualified_name": "prw_isProbabilityMeasure", + "line": 55, + "source_header": "al_div]\n\n/-- Positive finite normalizer makes the literal density a probability law. -/\ntheorem prw_isProbabilityMeasure {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ) :\n IsProbabilityMeasure (prwMea" + }, + { + "kind": "theorem", + "unqualified_name": "prw_measure_real", + "line": 64, + "source_header": "[hZ.ne']\n\n/-- The event identity is proved for the constructed law, not assumed. -/\ntheorem prw_measure_real {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n (prwMeasure μ W).real E = (∫ x in E, W x ∂μ) /" + }, + { + "kind": "theorem", + "unqualified_name": "prw_numerator_bound", + "line": 73, + "source_header": "W0) hZ.le)]\n\n/-- Integral Cauchy–Schwarz against the event indicator, including null events. -/\ntheorem prw_numerator_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n (∫ x in E, W x ∂μ) ≤\n Real.sqrt (∫ x, W x ^ 2 ∂μ) * Real.sq" + }, + { + "kind": "theorem", + "unqualified_name": "prw_square_root_event_bound", + "line": 105, + "source_header": "ow] using hCS\n\n/-- The exact `r^4` second moment and `r^2` normalizer cancel in the literal\nweighted probability. No event probability is assumed positive. -/\ntheorem prw_square_root_event_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)\n (C c r : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)\n (hmoment : (∫ x, W x ^ 2 ∂μ) ≤ C * r ^ 4)\n (hfloor : c * r ^ 2 ≤ ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n IsProbabilityMeasure (prwMeasure μ W) ∧\n (prwMeasure μ W).real E ≤ (Real.sqrt C / c) * Real." + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianJetMoments.lean", + "sha256": "f2e785975aee6915848fe78dc3ecde02b8f13a0a1fb56ae3771e4c727c723360", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gm8Radius", + "line": 12, + "source_header": "/-- Radius for a finite vector, including its constant one. -/\ndef gm8Radius {n : ℕ} (j : Fin n → ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "gm8FiniteM8", + "line": 15, + "source_header": "|\n\n/-- One finite-dimensional Gaussian radius moment constant. -/\nnoncomputable def gm8FiniteM8 (n : ℕ) (B V : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "gm8FiniteM8_nonneg", + "line": 19, + "source_header": "8))\n\ntheorem gm8FiniteM8_nonneg (n : ℕ) (B V : ℝ) : 0 ≤ gm8FiniteM8 n" + }, + { + "kind": "def", + "unqualified_name": "gm8M8", + "line": 24, + "source_header": "ity\n\n/-- The source's exact fixed nine-coordinate constant. -/\nnoncomputable def gm8M8 (B V : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "gm8M8_nonneg", + "line": 28, + "source_header": "8C8))\n\ntheorem gm8M8_nonneg (B V : ℝ) : 0 ≤ gm8M" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_finite_radius_power_bound", + "line": 31, + "source_header": "9 B V\n\ntheorem gm8_finite_radius_power_bound (n : ℕ) (j : Fin n → ℝ) :\n gm8Radius j ^ 8 ≤ ((n+1 : ℕ) : ℝ)^7 * (1 + ∑ i, |j" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_finite_integrable_bound", + "line": 41, + "source_header": "ing h\n\ntheorem gm8_finite_integrable_bound (n : ℕ) {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin n → ℝ)\n (hJ : Measurable J) (m : Fin n → ℝ) (v : Fin n → ℝ≥0)\n (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => gm8Radius (J x)^8) μ ∧\n (∫ x, gm8Radius (J x)^8 ∂μ) ≤ gm8FiniteM8" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_radius_power_bound", + "line": 82, + "source_header": "ssoc]\n\n/-- The exact DM2 radius is the nine-dimensional specialization. -/\ntheorem gm8_radius_power_bound (j : DM2Jet) :\n dm2Radius j ^ 8 ≤ (10 : ℝ)^7 * (1 + ∑ i, |" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_jet_integrable_bound", + "line": 87, + "source_header": "und 9 j\n\n/-- The nine-jet Gaussian marginal moment interface, with no independence or\nmoment conclusion assumed. -/\ntheorem gm8_jet_integrable_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → DM2Jet)\n (hJ : Measurable J) (m : Fin 9 → ℝ) (v : Fin 9 → ℝ≥0)\n (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => dm2Radius (J x)^8) μ ∧\n (∫ x, dm2Radius (J x)^8 ∂μ) ≤" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_family_weight_moment", + "line": 100, + "source_header": "hvar hlaw\n\n/-- The same B,V give one determinant second-moment coefficient throughout\n0 J r x i) (gaussianReal (m r i) (v r i)) (μ r)) :\n 0 ≤ 16*gm8M8 B V ∧ ∀ r, 0 < r → r ≤ r0 →\n Integrable (fun x => dm2Weight r (J r x)^2) (μ r) ∧\n (∫ x, dm2Weight r (J r x)^2 ∂μ r) ≤ (16*gm8" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianRegressionKernel.lean", + "sha256": "66d4fbee044a1a0c0b434bcd7614e220fad21d1ac275ce9b01070a66c5780460", + "declarations_lexical": [ + { + "kind": "lemma", + "unqualified_name": "regression_compProd_id_const", + "line": 28, + "source_header": "1\n\n/-- Copying the first coordinate and retaining an independent second coordinate. -/\nlemma regression_compProd_id_const {α β : Type*} [MeasurableSpace α] [MeasurableSpace β]\n (μ : Measure α) (ν : Measure β) [SFinite μ] [SFinite ν] :\n μ ⊗ₘ (Kernel.id ×ₖ Kernel.const α ν) =\n (μ.prod ν).map (fun p : α × β => (p.1," + }, + { + "kind": "lemma", + "unqualified_name": "regression_pair_hasCondDistrib", + "line": 41, + "source_header": "rfl\n\n/-- An independent residual paired with the observation has the explicit product kernel. -/\nlemma regression_pair_hasCondDistrib {Ω α β : Type*} [MeasurableSpace Ω]\n [MeasurableSpace α] [MeasurableSpace β] {P : Measure Ω} [IsProbabilityMeasure P]\n {X : Ω → α} {R : Ω → β} (hX : AEMeasurable X P) (hR : AEMeasurable R P)\n (hXR : IndepFun X R P) :\n HasCondDistrib (fun ω => (X ω, R ω)) X\n (Kernel.id ×ₖ Kernel.const α (P.map" + }, + { + "kind": "def", + "unqualified_name": "regressionReconstruction", + "line": 59, + "source_header": ".symm\n\n\n/-- Affine reconstruction of the target from the observation and the regression residual. -/\ndef regressionReconstruction {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (p : (Fin n → ℝ) × (Fin k → ℝ)) : Fi" + }, + { + "kind": "lemma", + "unqualified_name": "regressionReconstruction_measurable", + "line": 66, + "source_header": "1 - mX)\n\nlemma regressionReconstruction_measurable {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Measurable (regressionReconstruction B" + }, + { + "kind": "def", + "unqualified_name": "regressionKernel", + "line": 72, + "source_header": "un_prop\n\n/-- The canonical regression law is specified at every observation, including null pins. -/\nnoncomputable def regressionKernel {n k : ℕ} (ν : Measure (Fin k → ℝ))\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Kernel (Fin n → ℝ) (F" + }, + { + "kind": "instance", + "unqualified_name": "regressionKernel_isMarkov", + "line": 79, + "source_header": "B mX mY)\n\ninstance regressionKernel_isMarkov {n k : ℕ} (ν : Measure (Fin k → ℝ))\n [IsProbabilityMeasure ν] (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ))\n (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n IsMarkovKernel (regressionKernel ν" + }, + { + "kind": "lemma", + "unqualified_name": "regressionKernel_apply", + "line": 86, + "source_header": "B mX mY)\n\nlemma regressionKernel_apply {n k : ℕ} (ν : Measure (Fin k → ℝ)) [SFinite ν]\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (x : Fin n → ℝ) :\n regressionKernel ν B mX mY x = ν.map (fun r => r + mY + B" + }, + { + "kind": "lemma", + "unqualified_name": "independentResidual_hasCondDistrib", + "line": 95, + "source_header": "p)]\n rfl\n\n/-- Affine reconstruction from an independent residual has the canonical conditional kernel. -/\nlemma independentResidual_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}\n {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hX : AEMeasurable X P) (hR : AEMeasurable R P) (hXR : IndepFun X R P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P.map R)" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_hasCondDistrib", + "line": 106, + "source_header": "le B mX mY)\n\n/-- Joint Gaussianity and vanishing observation/residual cross-covariance give the canonical\nconditional law, without choosing an almost-everywhere version at a prescribed observation. -/\ntheorem gaussianRegression_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)\n (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P.map" + }, + { + "kind": "lemma", + "unqualified_name": "regressionKernel_measurable", + "line": 119, + "source_header": "zero) B mX mY\n\n/-- Kernel measurability is pointwise in the observation and does not require a Gaussian law. -/\nlemma regressionKernel_measurable {n k : ℕ} (ν : Measure (Fin k → ℝ))\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Measurable (regressionKe" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegressionKernel_spec", + "line": 125, + "source_header": "el.measurable _\n\n/-- All parts of the canonical Gaussian conditional-law construction, including the literal\npushforward at every prescribed observation. Zero-dimensional and degenerate laws are allowed. -/\ntheorem gaussianRegressionKernel_spec {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)\n (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n IsMarkovKernel (regressionKernel (P.map R) B mX mY) ∧\n Measurable (regressionKernel (P.map R) B mX mY) ∧\n (∀ x, regressionKernel (P.map R) B mX mY x =\n (P.map R).map (fun r => r + mY + B (x - mX))) ∧\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P." + }, + { + "kind": "lemma", + "unqualified_name": "regression_map_coordinate", + "line": 142, + "source_header": "XR hzero B mX mY⟩\n\n/-- Coordinates of a finite-vector continuous linear map in the standard basis. -/\nlemma regression_map_coordinate {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (v : Fin n → ℝ) (j : Fin k) :\n B v j = ∑ l, B (Pi." + }, + { + "kind": "lemma", + "unqualified_name": "regression_covariance_map", + "line": 152, + "source_header": "[map_sum, mul_comm]\n\n/-- The covariance of a centered finite-vector linear predictor is its normal-equation sum. -/\nlemma regression_covariance_map {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}\n {X : Ω → Fin n → ℝ} (hX : HasGaussianLaw X P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ)\n (i : Fin n) (j : Fin k) :\n covariance (fun ω => X ω i) (fun ω => B (X ω - mX) j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω" + }, + { + "kind": "lemma", + "unqualified_name": "regression_residual_zero_covariance", + "line": 172, + "source_header": "(hX.eval i).memLp_two\n\n/-- The actual regression residual has zero observation cross-covariance by the normal equations. -/\nlemma regression_residual_zero_covariance {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n ∀ i j, covariance (fun ω => X ω i)\n (fun ω => (Y ω - mY -" + }, + { + "kind": "lemma", + "unqualified_name": "regression_residual_jointGaussian", + "line": 198, + "source_header": "hnormal i j, sub_self]\n\n/-- The observation and the actual affine residual are jointly Gaussian. -/\nlemma regression_residual_jointGaussian {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} {n k : ℕ}\n {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasGaussianLaw (fun ω => (X ω, Y" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_observed_hasCondDistrib", + "line": 227, + "source_header": "rw [map_sub]\n abel\n\n\n\n/-- The actual target has the explicit regression conditional law when the coefficient map\nsatisfies the coordinate normal equations. The residual hypotheses are derived. -/\ntheorem gaussianRegression_observed_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n HasCondDistrib Y X\n (regressionKernel (P.map (fun ω => Y ω - mY" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_observed_spec", + "line": 246, + "source_header": "d using 1\n funext ω\n abel\n\n/-- The canonical conditional-law specification for the actual jointly Gaussian target.\nThe residual Gaussianity and its zero cross-covariance are conclusions of the construction. -/\ntheorem gaussianRegression_observed_spec {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n IsMarkovKernel\n (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧\n Measurable\n (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧\n (∀ x, regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY x =\n (P.map (fun ω => Y ω - mY - B (X ω - mX))).map\n (fun r => r + mY + B (x - mX))) ∧\n HasCondDistrib Y X\n (regressionKernel (P.map (fun ω => Y ω - m" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianCoupling.lean", + "sha256": "426a53c139215650e961601c12f3cc1e09069520c5ebb96234a29483280551bb", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "gc_matrix_eval_tendsto", + "line": 18, + "source_header": "e\n\nprivate theorem gc_matrix_eval_tendsto {ι R : Type*} [Fintype ι] [DecidableEq ι]\n {u : Filter R} {S : R → Matrix ι ι ℝ} {S0 : Matrix ι ι ℝ}\n (hS : Tendsto S u (𝓝 S0)) (z : EuclideanSpace ℝ ι) :\n Tendsto (fun r => Matrix.toEuclideanCLM (" + }, + { + "kind": "def", + "unqualified_name": "gc_coupledVector", + "line": 35, + "source_header": "c\n\n/-- The canonical affine vector on one common standard Gaussian space. -/\nnoncomputable def gc_coupledVector {ι : Type*} [Fintype ι] [DecidableEq ι]\n (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) (z : EuclideanSpace ℝ ι) :\n EuclideanSpace" + }, + { + "kind": "theorem", + "unqualified_name": "gc_coupledVector_hasLaw", + "line": 40, + "source_header": ") z\n\n/-- Exact marginal law; this is the pinned multivariateGaussian definition. -/\ntheorem gc_coupledVector_hasLaw {ι : Type*} [Fintype ι] [DecidableEq ι]\n (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) :\n HasLaw (gc_coupledVector m S) (multivariateGaussian m S)\n (stdGaussian (EuclideanSpace ℝ ι)) where\n aemeasu" + }, + { + "kind": "theorem", + "unqualified_name": "gc_coupledVector_tendsto", + "line": 48, + "source_header": "= rfl\n\n/-- Every common Gaussian coordinate converges when means and PSD covariances\nconverge. No invertibility, fixed rank, or square-root Lipschitz estimate. -/\ntheorem gc_coupledVector_tendsto {ι κ : Type*} [Fintype ι] [DecidableEq ι]\n (u : Filter κ) (m : κ → EuclideanSpace ℝ ι) (S : κ → Matrix ι ι ℝ)\n (m0 : EuclideanSpace ℝ ι) (S0 : Matrix ι ι ℝ)\n (hm : Tendsto m u (𝓝 m0)) (hS : Tendsto S u (𝓝 S0))\n (hPSD : ∀ᶠ t in u, (S t).PosSemidef) (hPSD0 : S0.PosSemidef)\n (z : EuclideanSpace ℝ ι) :\n Tendsto (fun t => gc_coupledVector (m t) (S t) z) u\n (𝓝 (gc_coupledVector m0" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizer.lean", + "sha256": "32b7202cba2a9a0e0ed603d1a6db9ba2031714375b4e955614d5a40826a14aeb", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gn_normalizedWeight", + "line": 24, + "source_header": "e\n\n/-- The six coordinates are aM,aS,bM,bS,cM,cS. For physical positive radius,\nthe source identifies this continuous expression with its typed W_r/r². -/\nnoncomputable def gn_normalizedWeight (r : ℝ) (v : Fin 6 → ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "gn_gaussian_reference_integrable_pos", + "line": 30, + "source_header": ") 0\n\n/-- The contact negative-curvature reference has an integrable, strictly\npositive squared negative part, with arbitrary mean and nonzero variance. -/\ntheorem gn_gaussian_reference_integrable_pos (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0) :\n Integrable (fun q : ℝ => (max (-q) 0)^2) (gaussianReal m v) ∧\n 0 < ∫ q : ℝ, (max (-q) 0)^2 ∂gaussianRea" + }, + { + "kind": "theorem", + "unqualified_name": "gn_open_box_floor", + "line": 67, + "source_header": "hmass\n\n/-- An explicit open endpoint box has a uniform positive normalized weight.\nThis is a pointwise component, with no claimed probability mass for the box. -/\ntheorem gn_open_box_floor\n (r K : ℝ) (v : Fin 6 → ℝ)\n (hr : 0 ≤ r) (hK : 0 < K) (hsmall : r * K^2 ≤ 1/4)\n (haM : v 0 ∈ Set.Ioo (-5/4) (-3/4))\n (haS : v 1 ∈ Set.Ioo (3/4) (5/4))\n (hbM : |v 2| < K) (_hbS : |v 3| < K)\n (hcM : v 4 ∈ Set.Ioo (-2) (-1))\n (hcS : v 5 ∈ Set.Ioo (-2) (-1)) :\n (3 : ℝ)/8 ≤ gn_normalizedWei" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianScalarMoments.lean", + "sha256": "71ce88ad2c97891858a5196f3293907bdffdd2341dfbace24204f2318c7510df", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gm8C8", + "line": 16, + "source_header": "e\n\nnoncomputable def gm8C8 :" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_standard_integrable", + "line": 18, + "source_header": "1\n\ntheorem gm8_standard_integrable :\n Integrable (fun z : ℝ => |z| ^ 8) (gaussianReal 0 1" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_standard_nonneg", + "line": 24, + "source_header": ")\n\ntheorem gm8_standard_nonneg : 0 ≤ gm8C" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_integrable", + "line": 27, + "source_header": ")\n\nprivate theorem gm8_integrable (m : ℝ) (v : ℝ≥0) :\n Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_sqrt_pow", + "line": 33, + "source_header": ")\n\nprivate theorem gm8_sqrt_pow (V : ℝ) (hV : 0 ≤ V) :\n (Real.sqrt V) ^ 8 = V ^" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_affine_map", + "line": 39, + "source_header": "]\n\nprivate theorem gm8_affine_map (m : ℝ) (v : ℝ≥0) :\n (gaussianReal 0 1).map (fun z : ℝ => m + Real.sqrt (v : ℝ) * z) =\n gaussianReal m" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_affine_bound", + "line": 54, + "source_header": "y\n\nprivate theorem gm8_affine_bound (m B V : ℝ) (v : ℝ≥0) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) (z : ℝ) :\n |m + Real.sqrt (v : ℝ) * z| ^ 8 ≤ 128 * (B ^ 8 + V ^ 4 * |z| ^ 8" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_scalar_integrable_bound", + "line": 72, + "source_header": "]\n\n/-- Bounded means and variances give a uniform eighth-moment bound, including\nzero variance and nonzero means. No eighth-moment hypothesis is assumed. -/\ntheorem gm8_scalar_integrable_bound (m B V : ℝ) (v : ℝ≥0)\n (hB : 0 ≤ B) (hV : 0 ≤ V) (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) :\n Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v) ∧\n (∫ x : ℝ, |x| ^ 8 ∂gaussianReal m v) ≤\n 128 * (B ^ 8 + V ^ 4 * gm8" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/NormalizerFloor.lean", + "sha256": "428eefd71b8c64fc4bcb208d9f73658058f29765f01a01c591f20a2d2359ec3e", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "nfloor_eventually_lower_of_fatou", + "line": 23, + "source_header": "e\n\nprivate theorem nfloor_eventually_lower_of_fatou {Ω ι : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (u : Filter ι) [IsCountablyGenerated u] [NeBot u]\n (f : ι → Ω → ℝ) (g : Ω → ℝ)\n (hmeas : ∀ r, Measurable (f r))\n (hnonneg : ∀ r ω, 0 ≤ f r ω)\n (hg : Integrable g P) (hgpos : 0 < ∫ ω, g ω ∂P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => f r ω) u (𝓝 (g ω)))\n (hfint : ∀ᶠ r in u, Integrable (f r) P) :\n ∀ᶠ r in u, (∫ ω, g ω ∂P)/2 ≤ ∫ ω, f r ω ∂" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_weight_continuous", + "line": 52, + "source_header": "e\n\nprivate theorem nfloor_weight_continuous :\n Continuous (fun p : ℝ × (Fin 6 → ℝ) => gn_normalizedWeight p.1 p.2" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_contact_value", + "line": 57, + "source_header": "p\nprivate theorem nfloor_contact_value (a q : ℝ) :\n gn_normalizedWeight 0 ![-1,1,-a/2,a/2,q,q] = (max (-q) 0)^" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_weight_limit", + "line": 60, + "source_header": "]\nprivate theorem nfloor_weight_limit (X : ℝ → Fin 6 → ℝ) (a q : ℝ)\n (hX : Tendsto X (𝓝[>] (0:ℝ)) (𝓝 ![-1,1,-a/2,a/2,q,q])) :\n Tendsto (fun r => gn_normalizedWeight r (X r)) (𝓝[>] (0:ℝ))\n (𝓝 ((max (-q) 0)^2)" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_reference", + "line": 68, + "source_header": ")\nprivate theorem nfloor_reference {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hlaw : HasLaw Q (gaussianReal m v) P) :\n Integrable (fun ω => (max (-Q ω) 0)^2) P ∧\n 0 < ∫ ω, (max (-Q ω) 0)^2 ∂" + }, + { + "kind": "theorem", + "unqualified_name": "gn_normalizer_floor_of_common_coupling", + "line": 78, + "source_header": "s\n\n/-- The actual integral of the physical r²-scaled continuous endpoint weight\nhas a positive lower constant at every sufficiently small positive radius.\nThe common coupling and current integrability are explicit premises; its\npositive reference integral and the lower bound are proved, not premises. -/\ntheorem gn_normalizer_floor_of_common_coupling\n {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P]\n (X : ℝ → Ω → Fin 6 → ℝ) (hX : ∀ r, Measurable (X r))\n (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => X r ω) (𝓝[>] (0 : ℝ))\n (𝓝 ![-1,1,-A ω/2,A ω/2,Q ω,Q ω]))\n (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),\n Integrable (fun ω => gn_normalizedWeight r (X r ω)) P) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n c * r^2 ≤ ∫ ω, r^2 * gn_normalizedWeight r (X r ω)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/DeterminantMoment.lean", + "sha256": "661b73c3f21c6d2529f5e09ce426d89c01939ab27a5cc868db3802c7e66ea82d", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "DM2Jet", + "line": 20, + "source_header": "abbrev DM2Jet" + }, + { + "kind": "def", + "unqualified_name": "dm2Radius", + "line": 22, + "source_header": "def dm2Radius (j : DM2Jet) : ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2HM", + "line": 24, + "source_header": "noncomputable def dm2HM (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2HS", + "line": 28, + "source_header": "noncomputable def dm2HS (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2Negative", + "line": 32, + "source_header": "/-- The source's negative-definite condition, stated as the quadratic form. -/\ndef dm2Negative (H : Matrix (Fin 2) (Fin 2) ℝ) : Pro" + }, + { + "kind": "def", + "unqualified_name": "dm2Weight", + "line": 36, + "source_header": "0\n\nnoncomputable def dm2Weight (r : ℝ) (j : DM2Jet) :" + }, + { + "kind": "lemma", + "unqualified_name": "dm2_scale", + "line": 41, + "source_header": "0\n\nprivate lemma dm2_scale (r x : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1) :\n |r*x| ≤ |x" + }, + { + "kind": "lemma", + "unqualified_name": "dm2_factors", + "line": 46, + "source_header": "]\n\nprivate lemma dm2_factors (r A B C R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)\n (hR : 0 ≤ R) (hA : |A| ≤ R) (hB : |B| ≤ R) (hC : |C| ≤ R) :\n |A*C-r*B^2| ≤ 2*R^" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_untyped", + "line": 58, + "source_header": ")\n\n/-- Exact untyped determinant domination; no jet-coordinate or type assumptions. -/\ntheorem dm2_untyped (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :\n ((dm2HM r j).det * (dm2HS r j).det)^2 ≤ 16*r^4*dm2Radius" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_pointwise", + "line": 127, + "source_header": "ing\n\n/-- P02-LM-002 section 2, with the literal quadratic-form type indicator. -/\ntheorem dm2_pointwise (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :\n dm2Weight r j ^ 2 ≤ 16*r^4*dm2Radiu" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_negative_iff", + "line": 137, + "source_header": "vity)\n\n/-- Two-dimensional Sylvester criterion for the literal quadratic-form definition. -/\ntheorem dm2_negative_iff (a b c : ℝ) :\n dm2Negative !![a,b;b,c] ↔ a < 0 ∧ 0 <" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_weight_measurable", + "line": 170, + "source_header": "inarith\n\n/-- Measurability of the exact typed weight, with no assumed type-null boundary. -/\ntheorem dm2_weight_measurable (r : ℝ) : Measurable (dm2" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_moment", + "line": 191, + "source_header": "ble_const\n\n/-- P02-LM-002's expectation step: eighth-moment control supplies integrability\nand the second moment, rather than presupposing that second moment. -/\ntheorem dm2_moment {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω)\n (J : Ω → DM2Jet) (hJ : Measurable J) (r M8 : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)\n (h8 : MeasureTheory.Integrable (fun x => dm2Radius (J x)^8) μ)\n (hM8 : (∫ x, dm2Radius (J x)^8 ∂μ) ≤ M8) :\n MeasureTheory.Integrable (fun x => dm2Weight r (J x)^2) μ ∧\n (∫ x, dm2Weight r (J x)^2 ∂μ)" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:frontiers/source_derivative_gaussian_20261025", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "frontiers/source_derivative_gaussian_20261025", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "frontiers/source_derivative_gaussian_20261025/ContactJetCovariance.lean", + "sha256": "50df0281c580ac7af018713a38c6bdd5dd34b52e3834b573165045bc64acd49d", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "contactWitness", + "line": 26, + "source_header": "m\n\ndef contactWitness (c : ℝ) : Matrix (Fin 7) (Fin 7)" + }, + { + "kind": "lemma", + "unqualified_name": "contactWitness_transpose_mulVec_eq_zero", + "line": 35, + "source_header": "]\n\nlemma contactWitness_transpose_mulVec_eq_zero {c : ℝ} (hc : c ≠ 0)\n (z : Fin 7 → ℝ) (h : (contactWitness c)ᵀ *ᵥ z = 0) : z =" + }, + { + "kind": "lemma", + "unqualified_name": "contactWitness_transpose_injective", + "line": 58, + "source_header": "n\n\nlemma contactWitness_transpose_injective {c : ℝ} (hc : c ≠ 0) :\n Function.Injective ((contactWitness c)ᵀ).mulVe" + }, + { + "kind": "lemma", + "unqualified_name": "contactWitness_amplitude_transpose_injective", + "line": 65, + "source_header": "]\n\nlemma contactWitness_amplitude_transpose_injective {c : ℝ} (hc : c ≠ 0)\n (a : Fin 7 → ℝ) (ha : ∀ s, a s ≠ 0) :\n Function.Injective ((contactWitness c * diagonal a)ᵀ).mulVe" + }, + { + "kind": "def", + "unqualified_name": "coefficientGram", + "line": 76, + "source_header": "s\n\nnoncomputable def coefficientGram {ι : Type*} {n : ℕ} (coeff : Fin n → ι → ℝ) :\n Matrix (Fin n) (Fin n)" + }, + { + "kind": "lemma", + "unqualified_name": "coefficient_product_summable", + "line": 79, + "source_header": "m\n\nlemma coefficient_product_summable {ι : Type*} {a b : ι → ℝ}\n (ha : Summable a) (hb : Summable b) : Summable (fun m => a m * b m" + }, + { + "kind": "lemma", + "unqualified_name": "coefficientGram_quadratic_hasSum", + "line": 86, + "source_header": ")\n\nlemma coefficientGram_quadratic_hasSum {ι : Type*} {n : ℕ} (coeff : Fin n → ι → ℝ)\n (hc : ∀ i, Summable (coeff i)) (z : Fin n → ℝ) :\n HasSum (fun m => (∑ i, z i * coeff i m)^2)\n (star z ⬝ᵥ (coefficientGram coeff *ᵥ z)" + }, + { + "kind": "lemma", + "unqualified_name": "coefficientGram_posDef_of_separating", + "line": 104, + "source_header": "]\n\nlemma coefficientGram_posDef_of_separating {ι : Type*} {n : ℕ}\n (coeff : Fin n → ι → ℝ) (hc : ∀ i, Summable (coeff i))\n (hsep : ∀ z : Fin n → ℝ, z ≠ 0 → ∃ m, (∑ i, z i * coeff i m) ≠ 0) :\n (coefficientGram coeff).PosDe" + }, + { + "kind": "theorem", + "unqualified_name": "contact_coefficientGram_posDef", + "line": 120, + "source_header": ")\n\n/-- Seven explicit independent mode columns force positivity of the entire infinite Gram sum.\nNo positive-definiteness or invertibility conclusion is an input premise. -/\ntheorem contact_coefficientGram_posDef {ι : Type*} (coeff : Fin 7 → ι → ℝ)\n (hcoeff : ∀ i, Summable (coeff i)) {c : ℝ} (hc : c ≠ 0)\n (mode : Fin 7 → ι) (a : Fin 7 → ℝ) (ha : ∀ s, a s ≠ 0)\n (hcolumns : ∀ i s, coeff i (mode s) = a s * contactWitness c i s) :\n (coefficientGram coeff).Pos" + }, + { + "kind": "theorem", + "unqualified_name": "contact_schur_pos", + "line": 143, + "source_header": "hm\n\n/-- A positive-definite six-plus-one block covariance has strictly positive scalar Schur complement. -/\ntheorem contact_schur_pos (A : Matrix (Fin 6) (Fin 6) ℝ)\n (B : Matrix (Fin 6) Unit ℝ) (D : Matrix Unit Unit ℝ)\n (hG : (Matrix.fromBlocks A B Bᴴ D).PosDef) :\n A.PosDef ∧ 0 < (D - Bᴴ * A⁻¹ * B)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceEndpointEstimates.lean", + "sha256": "d1f08d80d06d1ac08afbdd700370059fd8eaf0d4e483916e742efcdd1f664598", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sourcePhysicalCoordinates", + "line": 28, + "source_header": "s\n\n/-- LM006 `(aM,aS,bM,bS,cM,cS)` to actual `(aM,bM,cM,aS,bS,cS)` order. -/\ndef sourcePhysicalCoordinates (v : Fin 6 → ℝ) : Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourcePhysicalIndex", + "line": 32, + "source_header": "5]\n\ndef sourcePhysicalIndex : Fin 6 → Fi" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalCoordinates_apply", + "line": 34, + "source_header": ",5]\n\ntheorem sourcePhysicalCoordinates_apply (v : Fin 6 → ℝ) (i : Fin 6) :\n sourcePhysicalCoordinates v i = v (sourcePhysicalIndex" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalCoordinates_continuous", + "line": 38, + "source_header": "rfl\n\ntheorem sourcePhysicalCoordinates_continuous : Continuous sourcePhysicalCoordina" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalCoordinates_inverse", + "line": 42, + "source_header": "rop\n\ntheorem sourcePhysicalCoordinates_inverse (v : Fin 6 → ℝ) :\n enb_permutation (sourcePhysicalCoordinates v)" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointWeight", + "line": 47, + "source_header": "rfl\n\n/-- The literal strict typed physical endpoint determinant weight. -/\ndef sourceEndpointWeight (r : ℝ) (v : Fin 6 → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointWeight_measurable", + "line": 51, + "source_header": "es v)\n\ntheorem sourceEndpointWeight_measurable (r : ℝ) : Measurable (sourceEndpointWeig" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointWeight_nonneg", + "line": 54, + "source_header": "rable\n\ntheorem sourceEndpointWeight_nonneg (r : ℝ) (v : Fin 6 → ℝ) :\n 0 ≤ sourceEndpointWeigh" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointWeight_eq_continuous", + "line": 61, + "source_header": "e_rfl\n\ntheorem sourceEndpointWeight_eq_continuous (r : ℝ) (hr : 0 < r) (v : Fin 6 → ℝ) :\n sourceEndpointWeight r v = r^2 * gn_normalizedWeigh" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointLaw", + "line": 66, + "source_header": "v) hr\n\ndef sourceEndpointLaw (L r b : ℝ) : Measure (Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointMean", + "line": 69, + "source_header": "r b)\n\ndef sourceEndpointMean (L r b : ℝ) : Fin" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_isProbabilityMeasure", + "line": 72, + "source_header": "r b)\n\ntheorem sourceEndpointLaw_isProbabilityMeasure {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n IsProbabilityMeasure (sourceEndpointLaw L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_euclidean_hasLaw", + "line": 78, + "source_header": "tance\n\n/-- The actual canonical every-pin kernel has the derived finite Gaussian law. -/\ntheorem sourceEndpointLaw_euclidean_hasLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasLaw (toLp 2) (multivariateGaussian (toLp 2 (sourceEndpointMean L r b))\n (sourceEndpointSchurAt L r)) (sourceEndpointLaw L r b) where\n aemea" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_physical_marginal", + "line": 86, + "source_header": "ns r b)\n\n/-- Every physical coordinate marginal is derived from the actual kernel,\nincluding singular residual covariances and noncentered prescribed heights. -/\ntheorem sourceEndpointLaw_physical_marginal {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (i : Fin 6) :\n HasLaw (fun v => sourcePhysicalCoordinates v i)\n (gaussianReal (sourceEndpointMean L r b (sourcePhysicalIndex i))\n ((sourceEndpointSchurAt L r) (sourcePhysicalIndex i) (sourcePhysicalIndex i)).toNNReal)\n (sourceEndpointL" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_weight_integral", + "line": 100, + "source_header": "ply v i))\n\n/-- Integrals of the literal physical weight transfer to the exact finite\nGaussian parameter law without an assumed integral representation. -/\ntheorem sourceEndpointLaw_weight_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b) =\n ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]\n ∂multivariateGaussian (toLp 2 (sourceEndpointMean L r b)) (sourceEndpointS" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_second_moment_of_parameter_bounds", + "line": 116, + "source_header": "Lp] using h\n\n/-- Per-radius moment composition from explicit parameter bounds. The later\nactual-source family theorem derives these bounds from the actual block limits. -/\ntheorem sourceEndpointLaw_second_moment_of_parameter_bounds {L : ℝ} (hL : L ≠ 0)\n (r b B V : ℝ) (hG : IsUnit (sourcePinCovarianceAt L r))\n (hB : 0 ≤ B) (hV : 0 ≤ V) (hr : 0 < r) (hr1 : r ≤ 1)\n (hmean : ∀ i, |sourceEndpointMean L r b i| ≤ B)\n (hvar : ∀ i, |sourceEndpointSchurAt L r i i| ≤ V) :\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) ∧\n (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤\n 16 * gm8FiniteM8" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_weight_square_integrable", + "line": 139, + "source_header": "nal hL r b hG\n\n/-- Actual physical square integrability needs no supplied parameter bound.\nFinite current Gaussian parameters provide their own finite coordinate bounds. -/\ntheorem sourceEndpointLaw_weight_square_integrable {L : ℝ} (hL : L ≠ 0)\n (r b : ℝ) (hG : IsUnit (sourcePinCovarianceAt L r)) (hr : 0 < r) (hr1 : r ≤ 1) :\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEnd" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointLaw_weight_integrable", + "line": 153, + "source_header": "urAt L r i i) i\n\ntheorem sourceEndpointLaw_weight_integrable {L : ℝ} (hL : L ≠ 0)\n (r b : ℝ) (hG : IsUnit (sourcePinCovarianceAt L r)) (hr : 0 < r) (hr1 : r ≤ 1) :\n Integrable (sourceEndpointWeight r) (sourceEnd" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePrescribedPins_tendsto", + "line": 160, + "source_header": "r b hG hr hr1)\n\n/-- The literal prescribed height has the actual contact pin as its right limit. -/\ntheorem sourcePrescribedPins_tendsto (b : ℝ) :\n Tendsto (fun r => sourcePrescribedPins r b) (𝓝[>] (0 : ℝ))\n (" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointWeightedProbability", + "line": 169, + "source_header": "hdsWithin_le_nhds\n\n/-- Explicit endpoint probability with the literal normalized weight density. -/\ndef sourceEndpointWeightedProbability (L r b : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_weighted_event_bound_of_estimates", + "line": 173, + "source_header": "ceEndpointWeight r)\n\n/-- Endpoint reweighting glue; its estimates are derived in the final actual\nsource theorem after the actual covariance-limit exports are available. -/\ntheorem sourceEndpoint_weighted_event_bound_of_estimates {L : ℝ} (hL : L ≠ 0)\n (r b C c : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)\n (hsq : Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b))\n (hmoment : (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤ C*r^4)\n (hfloor : c*r^2 ≤ ∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b)\n (E : Set (Fin 6 → ℝ)) (hE : MeasurableSet E) :\n IsProbabilityMeasure (sourceEndpointWeightedProbability L r b) ∧\n (sourceEndpointWeightedProbability L r b).real E ≤\n (Real.sqrt C/c) * Real.sqrt ((sourceEndpo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_parameter_limits", + "line": 191, + "source_header": "ssianRegressionLimits\n\ntheorem sourceEndpoint_parameter_limits {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n (∀ᶠ r in 𝓝[>] (0 : ℝ), IsUnit (sourcePinCovarianceAt L r)) ∧\n Tendsto (fun r => toLp 2 (sourceEndpointMean L r b)) (𝓝[>] (0 : ℝ))\n (𝓝 (toLp 2 (sourceContactEndpointMean L b))) ∧\n Tendsto (sourceEndpointSchurAt L) (𝓝[>] (0 : ℝ))\n (𝓝 (sourceCon" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_uniform_parameter_bounds", + "line": 216, + "source_header": "hm\n · exact hp.2.2.2\n\ntheorem sourceEndpoint_uniform_parameter_bounds {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ M V δ : ℝ, 0 ≤ M ∧ 0 ≤ V ∧ 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → IsUnit (sourcePinCovarianceAt L r) ∧\n (∀ i, |sourceEndpointMean L r b i| ≤ M) ∧\n (∀ i, |sourceEndpoint" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_normalizer_floor", + "line": 239, + "source_header": "ntSchurAt] using hcov\n\n\n/- Normalizer assembly coauthored by actual OpenAI/Codex helper\n/root/dm2_landed_composition/peano_strategy; author-side only. -/\n/-- The actual every-pin source law has a positive small-radius physical\nnormalizer coefficient, with arbitrary fixed real prescribed height. -/\ntheorem sourceEndpoint_normalizer_floor {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n c * r^2 ≤ ∫ v, sourceEndpointWeight r v" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_estimates", + "line": 270, + "source_header": "le hrδ (min_le_left _ _))\n\ntheorem sourceEndpoint_estimates {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ →\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) ∧\n (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤ C*r^4 ∧\n c*r^2 ≤ ∫ v, sourceEndpointWeight r v" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpoint_estimates_and_weighted_events", + "line": 291, + "source_header": "q,hbound,hfloor r hr hrF⟩\n\ntheorem sourceEndpoint_estimates_and_weighted_events {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ →\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourceEndpointLaw L r b) ∧\n (∫ v, sourceEndpointWeight r v ^ 2 ∂sourceEndpointLaw L r b) ≤ C*r^4 ∧\n c*r^2 ≤ (∫ v, sourceEndpointWeight r v ∂sourceEndpointLaw L r b) ∧\n IsProbabilityMeasure (sourceEndpointWeightedProbability L r b) ∧\n ∀ E : Set (Fin 6 → ℝ), MeasurableSet E →\n (sourceEndpointWeightedProbability L r b).real E ≤\n (Real.sqrt C/c) * Real.sqrt ((sourceE" + }, + { + "kind": "def", + "unqualified_name": "sourcePhysicalEndpointLaw", + "line": 315, + "source_header": "rcePhysicalEndpointKernel\n\n/-- The canonical kernel of the actual physical normalized Hessian entries. -/\ndef sourcePhysicalEndpointLaw (L r b" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointLaw_eq", + "line": 319, + "source_header": "(sourcePrescribedPins r b)\n\n/-- Literal equality of the specified kernels at the prescribed pins, derived\nfrom their common residual law and the proved zero correction there. -/\ntheorem sourcePhysicalEndpointLaw_eq {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n sourcePhysicalEndpointLaw L" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointLaw_isProbabilityMeasure", + "line": 325, + "source_header": "ntKernel_at_prescribed hL r b\n\ntheorem sourcePhysicalEndpointLaw_isProbabilityMeasure {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n IsProbabilityMeasure (sou" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_eventually_hasCondDistrib", + "line": 330, + "source_header": "w_isProbabilityMeasure hL r b\n\n/-- Actual block limits supply current invertibility, hence the physical\nkernel is a conditional law at every sufficiently small positive radius. -/\ntheorem sourcePhysicalEndpointKernel_eventually_hasCondDistrib {L : ℝ} (hL : L ≠ 0) :\n ∀ᶠ r in 𝓝[>] (0 : ℝ),\n HasCondDistrib (sourceNormalizedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourcePhysicalEndp" + }, + { + "kind": "def", + "unqualified_name": "sourcePhysicalEndpointWeightedProbability", + "line": 339, + "source_header": "ntKernel_hasCondDistrib hL r hr\n\n/-- The explicit probability is weighted from the actual physical endpoint law. -/\ndef sourcePhysicalEndpointWeightedProbability" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointWeightedProbability_eq", + "line": 343, + "source_header": "w L r b) (sourceEndpointWeight r)\n\ntheorem sourcePhysicalEndpointWeightedProbability_eq {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n sourcePhysicalEndpointWeightedProbability L r b = source" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpoint_estimates_and_weighted_events", + "line": 348, + "source_header": "rcePhysicalEndpointLaw_eq hL r b]\n\n/-- Actual physical canonical endpoint moment, normalizer and measurable-event\nestimates, at arbitrary fixed height. No desired law, covariance limit,\nparameter bound or positive normalizer is a premise. -/\ntheorem sourcePhysicalEndpoint_estimates_and_weighted_events {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ →\n Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourcePhysicalEndpointLaw L r b) ∧\n (∫ v, sourceEndpointWeight r v ^ 2 ∂sourcePhysicalEndpointLaw L r b) ≤ C*r^4 ∧\n c*r^2 ≤ (∫ v, sourceEndpointWeight r v ∂sourcePhysicalEndpointLaw L r b) ∧\n IsProbabilityMeasure (sourcePhysicalEndpointWeightedProbability L r b) ∧\n ∀ E : Set (Fin 6 → ℝ), MeasurableSet E →\n (sourcePhysicalEndpointWeightedProbability L r b).real E ≤\n (Real.sqrt C/c) * Real.sqrt ((sourc" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/GaussianRegressionLimits.lean", + "sha256": "26c403ea1104fbce89f5c2833f603edd4d2703669d8a94a77b2c9a2a06b572be", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "regressionMean", + "line": 26, + "source_header": "e\n\n/-- The actual regression mean for a centered prior and target d. -/\ndef regressionMean {p t : Type*} [Fintype p] [DecidableEq p]\n (G : Matrix p p ℝ) (C : Matrix t p ℝ) (d : p → ℝ) : t" + }, + { + "kind": "def", + "unqualified_name": "regressionCovariance", + "line": 31, + "source_header": "ᵥ d\n\n/-- The Schur covariance; no inverse of this target block is taken. -/\ndef regressionCovariance {p t : Type*} [Fintype p] [DecidableEq p]\n (G : Matrix p p ℝ) (C : Matrix t p ℝ) (B : Matrix t t ℝ) : Matrix" + }, + { + "kind": "theorem", + "unqualified_name": "tendsto_matrix_mul_explicit", + "line": 36, + "source_header": "spose\n\nprivate theorem tendsto_matrix_mul_explicit {α p t q : Type*} [Fintype t]\n {u : Filter α} {A : α → Matrix p t ℝ} {A0 : Matrix p t ℝ}\n {B : α → Matrix t q ℝ} {B0 : Matrix t q ℝ}\n (hA : Tendsto A u (𝓝 A0)) (hB : Tendsto B u (𝓝 B0)) :\n Tendsto (fun r => A r * B r) u (𝓝 (A0 *" + }, + { + "kind": "theorem", + "unqualified_name": "tendsto_matrix_mulVec_explicit", + "line": 53, + "source_header": "k j))\n\nprivate theorem tendsto_matrix_mulVec_explicit {α p t : Type*} [Fintype t]\n {u : Filter α} {A : α → Matrix p t ℝ} {A0 : Matrix p t ℝ}\n {b : α → (t → ℝ)} {b0 : t → ℝ}\n (hA : Tendsto A u (𝓝 A0)) (hb : Tendsto b u (𝓝 b0)) :\n Tendsto (fun r => A r *ᵥ b r) u (𝓝 (A0 *ᵥ" + }, + { + "kind": "theorem", + "unqualified_name": "regression_parameter_limits", + "line": 67, + "source_header": "i j))\n\n/-- Continuous pin/target blocks give current invertibility and convergence\nof the inverse, noncentered regression mean and possibly singular covariance. -/\ntheorem regression_parameter_limits\n {p t a : Type*} [Fintype p] [DecidableEq p] [Fintype t]\n (u : Filter a)\n (G : a → Matrix p p ℝ) (C : a → Matrix t p ℝ)\n (B : a → Matrix t t ℝ) (d : a → p → ℝ)\n (G0 : Matrix p p ℝ) (C0 : Matrix t p ℝ) (B0 : Matrix t t ℝ) (d0 : p → ℝ)\n (hG : Tendsto G u (𝓝 G0)) (hC : Tendsto C u (𝓝 C0))\n (hB : Tendsto B u (𝓝 B0)) (hd : Tendsto d u (𝓝 d0)) (hG0 : IsUnit G0) :\n (∀ᶠ r in u, IsUnit (G r)) ∧\n Tendsto (fun r => (G r)⁻¹) u (𝓝 G0⁻¹) ∧\n Tendsto (fun r => regressionMean (G r) (C r) (d r)) u\n (𝓝 (regressionMean G0 C0 d0)) ∧\n Tendsto (fun r => regressionCovariance (G r) (C r) (B r)) u\n (𝓝 (regressionCovariance G0" + }, + { + "kind": "theorem", + "unqualified_name": "bounds_from_limits", + "line": 104, + "source_header": ", hcov⟩\n\nprivate theorem bounds_from_limits {ι : Type*} [Fintype ι]\n (f : ℝ → (ι → ℝ)) (g : ℝ → Matrix ι ι ℝ)\n (f0 : ι → ℝ) (g0 : Matrix ι ι ℝ)\n (hf : Tendsto f (𝓝[>] (0 : ℝ)) (𝓝 f0))\n (hg : Tendsto g (𝓝[>] (0 : ℝ)) (𝓝 g0)) :\n ∃ B V δ : ℝ, 0 ≤ B ∧ 0 ≤ V ∧ 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n (∀ i, |f r i| ≤ B) ∧ (∀ i, |g r i" + }, + { + "kind": "theorem", + "unqualified_name": "regression_uniform_bounds", + "line": 130, + "source_header": "hb.2.le\n\n\n/-- One small-radius interval supplies current invertibility and simultaneous\nmean/diagonal-covariance bounds, derived solely from the block limits. -/\ntheorem regression_uniform_bounds\n {p t : Type*} [Fintype p] [DecidableEq p] [Fintype t]\n (G : ℝ → Matrix p p ℝ) (C : ℝ → Matrix t p ℝ)\n (B : ℝ → Matrix t t ℝ) (d : ℝ → p → ℝ)\n (G0 : Matrix p p ℝ) (C0 : Matrix t p ℝ) (B0 : Matrix t t ℝ) (d0 : p → ℝ)\n (hG : Tendsto G (𝓝[>] (0 : ℝ)) (𝓝 G0))\n (hC : Tendsto C (𝓝[>] (0 : ℝ)) (𝓝 C0))\n (hB : Tendsto B (𝓝[>] (0 : ℝ)) (𝓝 B0))\n (hd : Tendsto d (𝓝[>] (0 : ℝ)) (𝓝 d0)) (hG0 : IsUnit G0) :\n ∃ M V δ : ℝ, 0 ≤ M ∧ 0 ≤ V ∧ 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → IsUnit (G r) ∧\n (∀ i, |regressionMean (G r) (C r) (d r) i| ≤ M) ∧\n (∀ i, |regressionCovariance (G r) (C r) (B r)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceConfluentPins.lean", + "sha256": "41e1ea1ef4f9960307552a8271a5c04d2b72d94736b98eb601b51669ed603c3f", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "confluentTransform", + "line": 21, + "source_header": "s\n\n/-- Literal raw-to-confluent transform, defined also at zero for notation. -/\ndef confluentTransform (r : ℝ) (v : Fin 6 → ℝ) : Fin 6" + }, + { + "kind": "def", + "unqualified_name": "rawTransform", + "line": 27, + "source_header": "r)]\n\n/-- The literal inverse, with the cubic correction to the two field values. -/\ndef rawTransform (r : ℝ) (p : Fin 6 → ℝ) : Fin" + }, + { + "kind": "theorem", + "unqualified_name": "rawTransform_confluentTransform", + "line": 34, + "source_header": "/ 2]\n\ntheorem rawTransform_confluentTransform (r : ℝ) (hr : r ≠ 0) (v : Fin 6 → ℝ) :\n rawTransform r (confluentTransform r v" + }, + { + "kind": "theorem", + "unqualified_name": "confluentTransform_rawTransform", + "line": 41, + "source_header": "ring\n\ntheorem confluentTransform_rawTransform (r : ℝ) (hr : r ≠ 0) (p : Fin 6 → ℝ) :\n confluentTransform r (rawTransform r p" + }, + { + "kind": "def", + "unqualified_name": "confluentEquiv", + "line": 48, + "source_header": "ring\n\n/-- For every nonzero separation, the confluent frame is an actual continuous\nlinear equivalence. No covariance invertibility is assumed or asserted. -/\ndef confluentEquiv (r : ℝ) (hr : r ≠ 0) : (Fin 6 → ℝ) ≃L[ℝ] (Fin 6 → ℝ) where" + }, + { + "kind": "theorem", + "unqualified_name": "prescribed_target", + "line": 70, + "source_header": ":= rfl\n\n/-- The literal prescribed raw pins keep arbitrary height and have zero first\nconfluent derivative. The normalized third confluent pin is exactly two. -/\ntheorem prescribed_target (r b : ℝ) (hr : r ≠ 0) :\n confluentEquiv r hr ![b, b - r ^ 3 / 6, 0, 0, 0, 0] =\n ![b - r ^ 3 / 12, 0, 0," + }, + { + "kind": "def", + "unqualified_name": "endpointM", + "line": 78, + "source_header": "<;> ring\n\ndef endpointM (r : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "endpointS", + "line": 80, + "source_header": "r / 2, 0]\ndef endpointS (r : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "directionX", + "line": 81, + "source_header": "r / 2, 0]\ndef directionX :" + }, + { + "kind": "def", + "unqualified_name": "directionY", + "line": 82, + "source_header": "= ![1, 0]\ndef directionY :" + }, + { + "kind": "def", + "unqualified_name": "rawPins", + "line": 83, + "source_header": "= ![0, 1]\n\n/-- Actual field values and actual directional x/y first derivatives of the\nunchanged smooth Fourier source, in the literal raw pin order. -/\ndef rawPins (L r : ℝ) (ω : SmoothSample 2 L)" + }, + { + "kind": "theorem", + "unqualified_name": "rawPins_hasGaussianLaw", + "line": 93, + "source_header": "directionY]\n\n/-- Joint Gaussianity is derived from one heterogeneous vector of actual\norder-zero and order-one observations; no observation independence is used. -/\ntheorem rawPins_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n HasGaussianLaw (rawPins L r) (s" + }, + { + "kind": "def", + "unqualified_name": "confluentPins", + "line": 109, + "source_header": "v_one_apply _\n\n/-- Actual confluent observations are the proved linear image of raw pins. -/\ndef confluentPins (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2" + }, + { + "kind": "theorem", + "unqualified_name": "confluentPins_hasGaussianLaw", + "line": 113, + "source_header": "(rawPins L r ω)\n\ntheorem confluentPins_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n HasGaussianLaw (confluentPins L r hr)" + }, + { + "kind": "def", + "unqualified_name": "rawPinsWithHessians", + "line": 117, + "source_header": "uentEquiv r hr)\n\n/-- One literal vector containing the raw six pins followed by endpoint Hessian\nentries `(fxxM,fxyM,fyyM,fxxS,fxyS,fyyS)`. No r-dependent midpoint jet is used. -/\ndef rawPinsWithHessians (L r : ℝ) (ω : SmoothSample" + }, + { + "kind": "theorem", + "unqualified_name": "rawPinsWithHessians_hasGaussianLaw", + "line": 129, + "source_header": "onY, directionY]]\n\n/-- The pin and Hessian observations are jointly Gaussian, derived together\nfrom their single actual derivative vector rather than separate marginal laws. -/\ntheorem rawPinsWithHessians_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n HasGaussianLaw (rawPinsWithHessians L" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceSmoothPalm.lean", + "sha256": "1b1d47b640b541195dad1472a07fa9490f203bd1619b1759b29587a0effe631d", + "declarations_lexical": [ + { + "kind": "lemma", + "unqualified_name": "withDensity_map_comp", + "line": 27, + "source_header": "m\n\nlemma withDensity_map_comp {Ω E : Type*} [MeasurableSpace Ω] [MeasurableSpace E]\n (μ : Measure Ω) (F : Ω → E) (w : E → ℝ≥0∞) (hF : Measurable F)\n (hw : Measurable w) :\n (μ.withDensity (fun ω => w (F ω))).map F = (μ.map F).withDensity" + }, + { + "kind": "theorem", + "unqualified_name": "prwMeasure_map_comp", + "line": 35, + "source_header": "]\n\n/-- Normalized weighting commutes exactly with a measurable pushforward.\nThe two normalizers are derived to be equal; no positivity or integrability premise is needed. -/\ntheorem prwMeasure_map_comp {Ω E : Type*} [MeasurableSpace Ω] [MeasurableSpace E]\n (μ : Measure Ω) (F : Ω → E) (W : E → ℝ) (hF : Measurable F)\n (hW : Measurable W) :\n (prwMeasure μ (W ∘ F)).map F = prwMeasure (μ.map F" + }, + { + "kind": "lemma", + "unqualified_name": "prwMeasure_absolutelyContinuous", + "line": 48, + "source_header": "op)\n\nlemma prwMeasure_absolutelyContinuous {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) : prwMeasure μ W" + }, + { + "kind": "lemma", + "unqualified_name": "prwMeasure_ae_of_ae", + "line": 52, + "source_header": "_ _\n\nlemma prwMeasure_ae_of_ae {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) {p : Ω → Prop} (hp : ∀ᵐ ω ∂μ, p ω) :\n ∀ᵐ ω ∂prwMeasure μ W," + }, + { + "kind": "lemma", + "unqualified_name": "prwMeasure_ae_weight_pos", + "line": 57, + "source_header": "hp\n\nlemma prwMeasure_ae_weight_pos {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Measurable W)\n (hZ : 0 < ∫ ω, W ω ∂μ) :\n ∀ᵐ ω ∂prwMeasure μ W, 0 <" + }, + { + "kind": "def", + "unqualified_name": "sourceSmoothLaw", + "line": 67, + "source_header": "hd\n\ndef sourceSmoothLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ) : Measure (SmoothSample 2" + }, + { + "kind": "instance", + "unqualified_name": "sourceSmoothLaw_isProbabilityMeasure", + "line": 70, + "source_header": "b)\n\ninstance sourceSmoothLaw_isProbabilityMeasure {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n IsProbabilityMeasure (sourceSmoothLaw hL r" + }, + { + "kind": "lemma", + "unqualified_name": "rawPins_prescribed_iff", + "line": 75, + "source_header": "nce\n\nlemma rawPins_prescribed_iff {L : ℝ} (r b : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :\n rawPins L r ω = ![b,b-r^3/6,0,0,0,0] ↔\n sourceConfluentPinsAt L r ω = sourcePrescribedPins" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_raw_pin_fiber", + "line": 83, + "source_header": "ymm\n\ntheorem sourceSmoothLaw_raw_pin_fiber {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n sourceSmoothLaw hL r b {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]}" + }, + { + "kind": "lemma", + "unqualified_name": "sourceRawPins_measurable", + "line": 93, + "source_header": "b)\n\nlemma sourceRawPins_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n Measurable (rawPins L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_raw_pin_fiber_ae", + "line": 104, + "source_header": "r)\n\ntheorem sourceSmoothLaw_raw_pin_fiber_ae {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n ∀ᵐ ω ∂sourceSmoothLaw hL r b, rawPins L r ω = ![b,b-r^3/6,0,0,0" + }, + { + "kind": "theorem", + "unqualified_name": "raw_pin_fiber_of_absolutelyContinuous", + "line": 111, + "source_header": "hG\n\n/-- Every probability measure absolutely continuous with respect to the actual conditioned\ncarrier law retains its exact prescribed raw values and zero gradients. -/\ntheorem raw_pin_fiber_of_absolutelyContinuous {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))\n (ν : Measure (SmoothSample 2 L)) [IsProbabilityMeasure ν]\n (hν : ν ≪ sourceSmoothLaw hL r b) :\n ν {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]" + }, + { + "kind": "theorem", + "unqualified_name": "prwMeasure_raw_pin_fiber", + "line": 122, + "source_header": "r hG)\n\ntheorem prwMeasure_raw_pin_fiber {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) (W : SmoothSample 2 L → ℝ)\n [IsProbabilityMeasure (prwMeasure (sourceSmoothLaw hL r b) W)] :\n prwMeasure (sourceSmoothLaw hL r b) W\n {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]" + }, + { + "kind": "def", + "unqualified_name": "sourceRawHM", + "line": 130, + "source_header": "s _ _\n\n/-- Literal actual symmetric endpoint Hessian entries at M. -/\ndef sourceRawHM (L r : ℝ) (ω : SmoothSample 2 L) : Matrix (Fin 2) (F" + }, + { + "kind": "def", + "unqualified_name": "sourceRawHS", + "line": 135, + "source_header": "7,v 8]\n\n/-- Literal actual symmetric endpoint Hessian entries at S. -/\ndef sourceRawHS (L r : ℝ) (ω : SmoothSample 2 L) : Matrix (Fin 2)" + }, + { + "kind": "def", + "unqualified_name": "sourceSmoothTyped", + "line": 140, + "source_header": "10,v 11]\n\ndef sourceSmoothTyped (L r : ℝ) (ω : SmoothSample 2" + }, + { + "kind": "def", + "unqualified_name": "sourceSmoothWeight", + "line": 143, + "source_header": ").det < 0\n\n/-- Strict maximum/saddle determinant weight of the actual field at its two endpoints. -/\ndef sourceSmoothWeight (L r : ℝ) (ω : SmoothSamp" + }, + { + "kind": "lemma", + "unqualified_name": "sourceRawHM_eq_normalized", + "line": 148, + "source_header": "det| else 0\n\nlemma sourceRawHM_eq_normalized (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :\n sourceRawHM L r ω = egm_HM r (sourcePhysicalCoordinates (sourceNormalizedEndpoi" + }, + { + "kind": "lemma", + "unqualified_name": "sourceRawHS_eq_normalized", + "line": 155, + "source_header": "d_simp [hr]\n\nlemma sourceRawHS_eq_normalized (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :\n sourceRawHS L r ω = egm_HS r (sourcePhysicalCoordinates (sourceNormalizedEndpoi" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeight_eq", + "line": 162, + "source_header": "d_simp [hr]\n\ntheorem sourceSmoothWeight_eq (L r : ℝ) (hr : r ≠ 0) (ω : SmoothSample 2 L) :\n sourceSmoothWeight L r ω = sourceEndpointWeight r (sourceNormalizedEndpo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeight_nonneg", + "line": 168, + "source_header": "ifs <;> rfl\n\ntheorem sourceSmoothWeight_nonneg (L r : ℝ) (ω : SmoothSample 2 L) :\n 0 ≤ sourceSmoothW" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeight_measurable", + "line": 175, + "source_header": "xact le_rfl\n\ntheorem sourceSmoothWeight_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n Measurable (sourceSmooth" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeight_pos_iff", + "line": 182, + "source_header": "rable hL r)\n\ntheorem sourceSmoothWeight_pos_iff (L r : ℝ) (ω : SmoothSample 2 L) :\n 0 < sourceSmoothWeight L r ω ↔ sourceSmooth" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothTyped_measurableSet", + "line": 195, + "source_header": "Weight, ht]\n\ntheorem sourceSmoothTyped_measurableSet {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n MeasurableSet {ω : SmoothSample 2 L | sourceSmoothT" + }, + { + "kind": "def", + "unqualified_name": "sourceSmoothWeightedLaw", + "line": 204, + "source_header": "le hL r hr)\n\n/-- The whole-carrier probability defined by the literal normalized actual determinant density. -/\ndef sourceSmoothWeightedLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ) : Measure (Smoo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_endpoint_hasLaw", + "line": 208, + "source_header": "thWeight L r)\n\ntheorem sourceSmoothLaw_endpoint_hasLaw {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasLaw (sourceNormalizedEndpoints L r) (sourcePhysicalEndpointLaw L r b)\n (sourceSmoo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_weight_square_integrable", + "line": 215, + "source_header": "map hL r b hG\n\ntheorem sourceSmoothLaw_weight_square_integrable {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))\n (hsq : Integrable (fun v => sourceEndpointWeight r v ^ 2) (sourcePhysicalEndpointLaw L r b)) :\n Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_weight_integral", + "line": 222, + "source_header": "able_comp hsq\n\ntheorem sourceSmoothLaw_weight_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) =\n ∫ v, sourceEndpointWeight r v ∂sourcePhysicalEndp" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothLaw_weight_square_integral", + "line": 230, + "source_header": "glyMeasurable\n\ntheorem sourceSmoothLaw_weight_square_integral {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) =\n ∫ v, sourceEndpointWeight r v ^ 2 ∂sourcePhysicalEndp" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeightedLaw_endpoint_map", + "line": 238, + "source_header": "glyMeasurable\n\n/-- Exact endpoint pushforward of the literal weighted whole-carrier law. -/\ntheorem sourceSmoothWeightedLaw_endpoint_map {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (sourceSmoothWeightedLaw hL r b).map (sourceNormalizedEndpoints L r) =\n sourcePhysicalEndpointWeightedPr" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmooth_weighted_event_bound_of_estimates", + "line": 249, + "source_header": "r b hG).map_eq]\n\n/-- The event estimate applies to every measurable event of the actual smooth carrier. -/\ntheorem sourceSmooth_weighted_event_bound_of_estimates {L : ℝ} (hL : L ≠ 0)\n (r b C c : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)\n (hsq : Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoothLaw hL r b))\n (hmoment : (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) ≤ C*r^4)\n (hfloor : c*r^2 ≤ ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b)\n (E : Set (SmoothSample 2 L)) (hE : MeasurableSet E) :\n IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧\n (sourceSmoothWeightedLaw hL r b).real E ≤\n (Real.sqrt C/c) * Real.sqrt ((sourceSmoothLa" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeightedLaw_typed", + "line": 263, + "source_header": "oment hfloor E hE\n\n/-- The literal density is positive only on the strict maximum/saddle type, which has full mass. -/\ntheorem sourceSmoothWeightedLaw_typed {L : ℝ} (hL : L ≠ 0) (r b : ℝ) (hr : r ≠ 0)\n [IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)]\n (hZ : 0 < ∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) :\n sourceSmoothWeightedLaw hL r b {ω | sourceSmo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothWeightedLaw_raw_pins", + "line": 274, + "source_header": "os_iff L r ω).mp hω\n\n/-- The density preserves the exact raw prescribed values and all four zero first derivatives. -/\ntheorem sourceSmoothWeightedLaw_raw_pins {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hr : r ≠ 0) (hG : IsUnit (sourcePinCovarianceAt L r))\n [IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b)] :\n sourceSmoothWeightedLaw hL r b {ω | rawPins L r ω = ![b," + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothPalm_estimates", + "line": 283, + "source_header": "urceSmoothWeight L r)\n\n/-- Actual whole-carrier determinant moments, normalizer, probability and event transfer.\nOnly the period and fixed prescribed height are inputs; actual covariance limits supply\nall sufficiently-small-radius invertibility needed by the literal endpoint marginal. -/\ntheorem sourceSmoothPalm_estimates {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ C c δ : ℝ, 0 ≤ C ∧ 0 < c ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ →\n Integrable (fun ω => sourceSmoothWeight L r ω ^ 2) (sourceSmoothLaw hL r b) ∧\n (∫ ω, sourceSmoothWeight L r ω ^ 2 ∂sourceSmoothLaw hL r b) ≤ C*r^4 ∧\n c*r^2 ≤ (∫ ω, sourceSmoothWeight L r ω ∂sourceSmoothLaw hL r b) ∧\n IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧\n (∀ E : Set (SmoothSample 2 L), MeasurableSet E →\n (sourceSmoothWeightedLaw hL r b).real E ≤\n (Real.sqrt C/c) * Real.sqrt ((sourceSmoothLaw hL r b).real E)) ∧\n (sourceSmoothWeightedLaw hL r b).map (sourceNormalizedEndpoints L r) =\n sourcePhysicalEndpointWeightedProbability L r b ∧\n sourceSmoothWeightedLaw hL r b\n {ω | rawPins L r ω = ![b,b-r^3/6,0,0,0,0]} = 1 ∧\n sourceSmoothWeightedLaw hL r b {ω | sourc" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceConditionalMajorant.lean", + "sha256": "07ae7796e461a2ee59a757b37a3e64f7ed31c76d26a3b40825f23170fcb4e691", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sampleMajorant", + "line": 26, + "source_header": "t\n\ndef sampleMajorant {L : ℝ} (w : SourceMode 2 → ℝ) (ω : SmoothSample 2 L) :" + }, + { + "kind": "def", + "unqualified_name": "sourceDerivativeMajorant", + "line": 29, + "source_header": "|\n\ndef sourceDerivativeMajorant (L : ℝ) (k : ℕ) (ω : SmoothSample 2 L) :" + }, + { + "kind": "theorem", + "unqualified_name": "sampleMajorant_nonneg", + "line": 32, + "source_header": "ω\n\ntheorem sampleMajorant_nonneg {L : ℝ} (w : SourceMode 2 → ℝ)\n (hw : ∀ m, 0 ≤ w m) (ω : SmoothSample 2 L) : 0 ≤ sampleMajorant w" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeMajorant_weighted_summable", + "line": 36, + "source_header": ")\n\ntheorem derivativeMajorant_weighted_summable {L : ℝ} (ω : SmoothSample 2 L)\n (k : ℕ) (u : Fin k → (Fin 2 → ℝ)) :\n Summable (fun m => derivativeMajorant 2 L k u m * |ω.val m|" + }, + { + "kind": "theorem", + "unqualified_name": "confluentMajorant_weighted_summable", + "line": 42, + "source_header": "h\n\ntheorem confluentMajorant_weighted_summable {L : ℝ} (ω : SmoothSample 2 L) :\n Summable (fun m => confluentModeMajorant L m * |ω.val m|" + }, + { + "kind": "theorem", + "unqualified_name": "pinCoefficient_abs_le", + "line": 52, + "source_header": "]\n\ntheorem pinCoefficient_abs_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)\n (i : Fin 6) (m : SourceMode 2) : |pinCoefficient L r i m| ≤ confluentModeMajorant L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPins_abs_le", + "line": 57, + "source_header": "m\n\ntheorem sourceConfluentPins_abs_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)\n (ω : SmoothSample 2 L) (i : Fin 6) :\n |sourceConfluentPinsAt L r ω i| ≤ sampleMajorant (confluentModeMajorant L)" + }, + { + "kind": "theorem", + "unqualified_name": "six_mulVec_abs_le", + "line": 69, + "source_header": "h\n\nprivate theorem six_mulVec_abs_le (M : Matrix (Fin 6) (Fin 6) ℝ)\n (K T : ℝ) (hK : 0 ≤ K) (_hT : 0 ≤ T)\n (hM : ∀ i j, |M i j| ≤ K) (y : Fin 6 → ℝ) (hy : ∀ j, |y j| ≤ T) (i : Fin 6) :\n |(M *ᵥ y) i| ≤ 6*K*" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_abs_le", + "line": 80, + "source_header": "g\n\ntheorem pinLift_abs_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)\n (K D : ℝ) (hK : 0 ≤ K) (hD : 0 ≤ D)\n (hInv : ∀ i j, |(sourcePinCovarianceAt L r)⁻¹ i j| ≤ K)\n (x : Fin 6 → ℝ) (hx : ∀ i, |x i| ≤ D) (ω : SmoothSample 2 L) (m : SourceMode 2) :\n |pinLift L r (x - sourceConfluentPinsAt L r ω) m| ≤\n 36*K*confluentModeMajorant L m *\n (D + sampleMajorant (confluentModeMajorant L) ω" + }, + { + "kind": "theorem", + "unqualified_name": "posterior_sampleMajorant_le", + "line": 106, + "source_header": "g\n\n/-- The deterministic posterior bound includes every required summability\npremise for a general weight. Source derivative weights supply it pointwise. -/\ntheorem posterior_sampleMajorant_le {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0)\n (w : SourceMode 2 → ℝ) (hw0 : ∀ m, 0 ≤ w m)\n (hwA : Summable (fun m => w m * confluentModeMajorant L m))\n (K D : ℝ) (hK : 0 ≤ K) (hD : 0 ≤ D)\n (hInv : ∀ i j, |(sourcePinCovarianceAt L r)⁻¹ i j| ≤ K)\n (x : Fin 6 → ℝ) (hx : ∀ i, |x i| ≤ D) (ω : SmoothSample 2 L)\n (hwω : Summable (fun m => w m * |ω.val m|)) :\n Summable (fun m => w m * |(posteriorSample hL r x ω).val m|) ∧\n sampleMajorant w (posteriorSample hL r x ω) ≤ sampleMajorant w ω +\n 36*K*(∑' m, w m * confluentModeMajorant L m)*\n (D + sampleMajorant (confluentModeMajorant L)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceInverse_prescribed_uniform_bounds", + "line": 145, + "source_header": "ing\n\n/-- Actual inverse continuity and the actual prescribed pin limit derive the\nuniform constants used by the posterior bound; neither is a model premise. -/\ntheorem sourceInverse_prescribed_uniform_bounds {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n ∃ K D δ : ℝ, 0 ≤ K ∧ 0 ≤ D ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ →\n (∀ i j, |(sourcePinCovarianceAt L r)⁻¹ i j| ≤ K) ∧\n (∀ i, |sourcePrescribedPins r b i|" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_global_derivative_bound", + "line": 184, + "source_header": ".2.le\n\n/-- Every actual derivative is bounded globally in its evaluation point by\nthe literal all-order Fourier absolute majorant on the smooth carrier. -/\ntheorem smoothSourceField_global_derivative_bound {L : ℝ} (hL : L ≠ 0)\n (k : ℕ) (ω : SmoothSample 2 L) (x : Fin 2 → ℝ) :\n ‖iteratedFDeriv ℝ k (smoothSourceField 2 L ω) x‖ ≤ sourceDerivativeMajoran" + }, + { + "kind": "theorem", + "unqualified_name": "sampleMajorant_measurable", + "line": 204, + "source_header": "using h\n\ntheorem sampleMajorant_measurable (L : ℝ) (w : SourceMode 2 → ℝ) :\n Measurable (sampleMajo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceDerivativeMajorant_measurable", + "line": 209, + "source_header": "pe_coe)\n\ntheorem sourceDerivativeMajorant_measurable (L : ℝ) (k : ℕ) :\n Measurable (sourceDerivativeMajora" + }, + { + "kind": "theorem", + "unqualified_name": "sampleMajorant_add", + "line": 212, + "source_header": "ble L _\n\ntheorem sampleMajorant_add {L : ℝ} (w v : SourceMode 2 → ℝ) (ω : SmoothSample 2 L)\n (hw : Summable (fun m => w m * |ω.val m|))\n (hv : Summable (fun m => v m * |ω.val m|)) :\n sampleMajorant (fun m => w m+v m) ω = sampleMajorant w ω + sampleMajor" + }, + { + "kind": "theorem", + "unqualified_name": "sampleMajorant_const_mul", + "line": 220, + "source_header": "_add hv\n\ntheorem sampleMajorant_const_mul {L : ℝ} (c : ℝ) (w : SourceMode 2 → ℝ)\n (ω : SmoothSample 2 L) :\n sampleMajorant (fun m => c*w m) ω = c*sampleMajor" + }, + { + "kind": "theorem", + "unqualified_name": "sourceDerivativeMajorant_uniform_domination", + "line": 227, + "source_header": "ul_left\n\n/-- The posterior is dominated by one fixed positive summable weight plus\nits retained drift, uniformly at every sufficiently small positive radius. -/\ntheorem sourceDerivativeMajorant_uniform_domination {L : ℝ} (hL : L ≠ 0)\n (b : ℝ) (k : ℕ) :\n ∃ a : ℝ, ∃ w : SourceMode 2 → ℝ, ∃ δ : ℝ,\n 0 ≤ a ∧ (∀ m, 0 ≤ w m) ∧ Summable w ∧ 0 < ∑' m, w m ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ → ∀ ω : SmoothSample 2 L,\n sourceDerivativeMajorant L k (posteriorSample hL r (sourcePrescribedPins r b) ω) ≤\n a + sampleMaj" + }, + { + "kind": "theorem", + "unqualified_name": "source_coordinate_hasLaw", + "line": 275, + "source_header": "w0]; ring\n\ntheorem source_coordinate_hasLaw {L : ℝ} (hL : L ≠ 0) (m : SourceMode 2) :\n HasLaw (fun ω : SmoothSample 2 L => ω.val m) (gaussianReal 0 1) (smoothLaw 2 L) where\n aem" + }, + { + "kind": "theorem", + "unqualified_name": "sampleMajorant_prior_moment", + "line": 280, + "source_header": "al 2 hL m\n\ntheorem sampleMajorant_prior_moment {L : ℝ} (hL : L ≠ 0)\n (w : SourceMode 2 → ℝ) (hw0 : ∀ m, 0 ≤ w m) (hw : Summable w) (n : ℕ) :\n Integrable (fun ω : SmoothSample 2 L => sampleMajorant w ω ^ n) (smoothLaw 2 L) ∧\n (∫ ω, sampleMajorant w ω ^ n ∂smoothLaw 2 L) ≤\n (∑' m, w m)^n * standardAb" + }, + { + "kind": "theorem", + "unqualified_name": "drift_majorant_integrable_pow", + "line": 291, + "source_header": "Law hL) n\n\nprivate theorem drift_majorant_integrable_pow {L : ℝ} (hL : L ≠ 0)\n (a : ℝ) (ha : 0 ≤ a) (w : SourceMode 2 → ℝ) (hw0 : ∀ m, 0 ≤ w m)\n (hw : Summable w) (n : ℕ) :\n Integrable (fun ω : SmoothSample 2 L => (a+sampleMajorant w ω)^n) (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConditionalDerivative_moments", + "line": 305, + "source_header": "hw0 ω) n\n\n/-- Every natural conditional derivative-majorant moment is derived from the\nactual posterior sampling map; the common small-radius interval is uniform in n. -/\ntheorem sourceConditionalDerivative_moments {L : ℝ} (hL : L ≠ 0) (b : ℝ) (k : ℕ) :\n ∃ δ : ℝ, 0 < δ ∧ δ ≤ 1 ∧ ∀ n : ℕ, ∃ M : ℝ, 0 ≤ M ∧\n ∀ r : ℝ, 0 < r → r < δ →\n Integrable (fun ω => sourceDerivativeMajorant L k ω ^ n)\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)) ∧\n (∫ ω, sourceDerivativeMajorant L k ω ^ n\n ∂sourceSmoothKernel hL r (sourcePrescribedPin" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConditionalDerivative_cutoff_tail", + "line": 344, + "source_header": "t hF hpoint\n\n/-- Markov gives every polynomial rate for the literal measurable majorant\ncutoff. This event certifies the global derivative bound without a supremum. -/\ntheorem sourceConditionalDerivative_cutoff_tail {L : ℝ} (hL : L ≠ 0)\n (b : ℝ) (k n : ℕ) :\n ∃ M δ : ℝ, 0 ≤ M ∧ 0 < δ ∧ δ ≤ 1 ∧ ∀ r : ℝ, 0 < r → r < δ →\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)).real\n {ω | r⁻¹ < sourceDerivativeMajorant L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConditionalDerivative_gaussian_upper_tail", + "line": 375, + "source_header": "nneg hr.le n)\n\n/-- A genuine Gaussian upper tail follows from the independently proved\nfolded-Gaussian exponential estimate, with the posterior drift retained. -/\ntheorem sourceConditionalDerivative_gaussian_upper_tail {L : ℝ} (hL : L ≠ 0)\n (b : ℝ) (k : ℕ) :\n ∃ a s δ : ℝ, 0 ≤ a ∧ 0 < s ∧ 0 < δ ∧ δ ≤ 1 ∧\n ∀ r : ℝ, 0 < r → r < δ → ∀ R : ℝ, 0 ≤ R →\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)).real\n {ω | a+R ≤ sourceDerivativeMajorant L k ω} ≤\n 2*Real.exp (" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeightedDerivative_cutoff_tail", + "line": 411, + "source_header": "_ ≤ _ := htail\n\n/-- The same measurable cutoff has every polynomial rate under the actual\nwhole-carrier endpoint-weighted law. This is an explicit weighted probability,\nwith no identification with a geometric Kac–Rice/Palm law asserted. -/\ntheorem sourceWeightedDerivative_cutoff_tail {L : ℝ} (hL : L ≠ 0)\n (b : ℝ) (k n : ℕ) :\n ∃ M δ : ℝ, 0 ≤ M ∧ 0 < δ ∧ δ ≤ 1 ∧ ∀ r : ℝ, 0 < r → r < δ →\n IsProbabilityMeasure (sourceSmoothWeightedLaw hL r b) ∧\n (sourceSmoothWeightedLaw hL r b).real\n {ω | r⁻¹ < sourceDerivativeMajora" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/ConfluentIntegralIdentities.lean", + "sha256": "0324d7556d485cd360a513587199354fa1f3863d15cf06b52c86e362de5e56b8", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "pin3", + "line": 23, + "source_header": "s\n\ndef pin3 (F : ℝ → ℝ) (r : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "pin4", + "line": 26, + "source_header": "r\n\ndef pin4 (H : ℝ → ℝ) (r : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "pin5", + "line": 29, + "source_header": "r\n\ndef pin5 (F : ℝ → ℝ) (r : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "scaled_hasDerivAt", + "line": 33, + "source_header": ")\n\nprivate theorem scaled_hasDerivAt (g g' : ℝ → ℝ)\n (hg : ∀ x, HasDerivAt g (g' x) x) (r u : ℝ) :\n HasDerivAt (fun u => g (r * u)) (r * g' (r * u))" + }, + { + "kind": "theorem", + "unqualified_name": "average_identity", + "line": 40, + "source_header": "]\n\nprivate theorem average_identity (g g' : ℝ → ℝ)\n (hg : ∀ x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : ℝ) (hr : r ≠ 0) :\n (g (r / 2) - g (-r / 2)) / r =\n ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), g' (r * u" + }, + { + "kind": "theorem", + "unqualified_name": "left_endpoint_identity", + "line": 56, + "source_header": "]\n\nprivate theorem left_endpoint_identity (g g' : ℝ → ℝ)\n (hg : ∀ x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : ℝ) (hr : r ≠ 0) :\n (g (-r/2) - ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), g (r*u)) / r =\n -(∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/2-u) * g' (r*u)" + }, + { + "kind": "theorem", + "unqualified_name": "right_endpoint_identity", + "line": 82, + "source_header": "]\n\nprivate theorem right_endpoint_identity (g g' : ℝ → ℝ)\n (hg : ∀ x, HasDerivAt g (g' x) x) (hc : Continuous g') (r : ℝ) (hr : r ≠ 0) :\n (g (r/2) - ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), g (r*u)) / r =\n ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (u+1/2) * g' (r*u" + }, + { + "kind": "theorem", + "unqualified_name": "peano_identity", + "line": 107, + "source_header": "]\n\nprivate theorem peano_identity (f f1 f2 f3 : ℝ → ℝ)\n (h0 : ∀ x, HasDerivAt f (f1 x) x)\n (h1 : ∀ x, HasDerivAt f1 (f2 x) x)\n (h2 : ∀ x, HasDerivAt f2 (f3 x) x) (hc3 : Continuous f3)\n (r : ℝ) (hr : r ≠ 0) :\n (12 / r ^ 2) * ((f1 (r/2) + f1 (-r/2))/2 - (f (r/2) - f (-r/2))/r) =\n 6 * ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/4-u^2) * f3 (r*u" + }, + { + "kind": "theorem", + "unqualified_name": "iterated_hasDerivAt", + "line": 140, + "source_header": "]\n\nprivate theorem iterated_hasDerivAt {F : ℝ → ℝ} {n : ℕ}\n (hF : ContDiff ℝ n F) (k : ℕ) (hk : k < n) (x : ℝ) :\n HasDerivAt (iteratedDeriv k F) (iteratedDeriv (k+1) F x)" + }, + { + "kind": "theorem", + "unqualified_name": "pin3_integral", + "line": 146, + "source_header": "t\n\n/-- The x-derivative divided difference is the exact average second derivative. -/\ntheorem pin3_integral (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :\n pin3 F r = ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), iteratedDeriv 2 F (r" + }, + { + "kind": "theorem", + "unqualified_name": "pin4_integral", + "line": 153, + "source_header": "hr\n\n/-- H is the y-derivative curve: the pin uses H itself, not its derivative. -/\ntheorem pin4_integral (H : ℝ → ℝ) (hH : ContDiff ℝ 2 H) (r : ℝ) (hr : r ≠ 0) :\n pin4 H r = ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), deriv H" + }, + { + "kind": "theorem", + "unqualified_name": "pin5_integral", + "line": 160, + "source_header": "r hr\n\n/-- The exact cubic confluent pin is its normalized Peano-kernel integral. -/\ntheorem pin5_integral (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :\n pin5 F r = 6 * ∫ u in (-1/2 : ℝ)..(1/2 : ℝ),\n (1/4-u^2) * iteratedDeriv 3" + }, + { + "kind": "theorem", + "unqualified_name": "adjusted_second_left", + "line": 171, + "source_header": ")) r hr\n\ntheorem adjusted_second_left (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :\n (iteratedDeriv 2 F (-r/2) - pin3 F r) / r =\n -(∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/2-u) * iteratedDeriv 3 F" + }, + { + "kind": "theorem", + "unqualified_name": "adjusted_second_right", + "line": 179, + "source_header": ")) r hr\n\ntheorem adjusted_second_right (F : ℝ → ℝ) (hF : ContDiff ℝ 3 F) (r : ℝ) (hr : r ≠ 0) :\n (iteratedDeriv 2 F (r/2) - pin3 F r) / r =\n ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (u+1/2) * iteratedDeriv 3" + }, + { + "kind": "theorem", + "unqualified_name": "adjusted_transverse_left", + "line": 187, + "source_header": ")) r hr\n\ntheorem adjusted_transverse_left (H : ℝ → ℝ) (hH : ContDiff ℝ 2 H) (r : ℝ) (hr : r ≠ 0) :\n (deriv H (-r/2) - pin4 H r) / r =\n -(∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (1/2-u) * iteratedDeriv 2 H" + }, + { + "kind": "theorem", + "unqualified_name": "adjusted_transverse_right", + "line": 195, + "source_header": ")) r hr\n\ntheorem adjusted_transverse_right (H : ℝ → ℝ) (hH : ContDiff ℝ 2 H) (r : ℝ) (hr : r ≠ 0) :\n (deriv H (r/2) - pin4 H r) / r =\n ∫ u in (-1/2 : ℝ)..(1/2 : ℝ), (u+1/2) * iteratedDeriv 2" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceContactEndpointParameters.lean", + "sha256": "da5337a7814a008eaa8b8a98c0df4daf3efb1bc347789a2f75efc63c9c258d01", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sourceContactA", + "line": 22, + "source_header": "t\n\n/-- The literal mixed third derivative A=fxxy at the origin. -/\ndef sourceContactA (L : ℝ) (ω : SmoothSample 2 L)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointVector", + "line": 26, + "source_header": "E1]\n\n/-- The actual limiting adjusted endpoints, in the normalizer's six-coordinate order. -/\ndef sourceContactEndpointVector (L : ℝ) (ω : SmoothSample 2 L) : Fin" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointCrossCovariance", + "line": 32, + "source_header": "L ω]\n\n/-- Literal limiting endpoint/pin cross covariance C0. -/\ndef sourceContactEndpointCrossCovariance (L : ℝ) : Matrix (Fin 6) (F" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointCovariance", + "line": 37, + "source_header": "aw 2 L)\n\n/-- Literal limiting endpoint covariance B0. -/\ndef sourceContactEndpointCovariance (L : ℝ) : Matrix (Fin 6)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointRegression", + "line": 42, + "source_header": "hLaw 2 L)\n\ndef sourceContactEndpointRegression (L : ℝ) : Matrix (Fin 6)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactPinValue", + "line": 45, + "source_header": "ance L)⁻¹\n\n/-- The prescribed limiting pin retains an arbitrary level b. -/\ndef sourceContactPinValue (b : ℝ)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointMean", + "line": 48, + "source_header": ",0,0,0,0,2]\n\ndef sourceContactEndpointMean (L b : ℝ)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointSchur", + "line": 51, + "source_header": "tPinValue b\n\ndef sourceContactEndpointSchur (L : ℝ) : Matrix (Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourceContactEndpointResidual", + "line": 56, + "source_header": "ariance L)ᵀ\n\ndef sourceContactEndpointResidual (L : ℝ) (ω : SmoothSample 2 L)" + }, + { + "kind": "theorem", + "unqualified_name": "contact_generic_residual_covariance", + "line": 60, + "source_header": "nVector L ω\n\nprivate theorem contact_generic_residual_covariance {Ω ι κ : Type*} [MeasurableSpace Ω]\n [Fintype ι] [DecidableEq ι] [Fintype κ] [DecidableEq κ]\n {P : Measure Ω} [IsFiniteMeasure P]\n (J : Ω → ι → ℝ) (T : Ω → κ → ℝ)\n (hJ : ∀ i, MemLp (fun ω => J ω i) 2 P)\n (hT : ∀ i, MemLp (fun ω => T ω i) 2 P)\n (hG : IsUnit (Matrix.of (fun i j => covariance (fun ω => J ω i) (fun ω => J ω j) P) : Matrix ι ι ℝ)) :\n let G : M" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactA_memLp", + "line": 129, + "source_header": "m] using hp\n\nprivate theorem sourceContactA_memLp {L : ℝ} (hL : L ≠ 0) :\n MemLp (sourceContactA L) 2 (smo" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePin_memLp", + "line": 134, + "source_header": ").memLp_two\n\nprivate theorem sourcePin_memLp {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :\n MemLp (fun ω => sourcePinVector L ω i) 2 (smo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpoint_memLp", + "line": 138, + "source_header": ").memLp_two\n\nprivate theorem sourceContactEndpoint_memLp {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :\n MemLp (fun ω => sourceContactEndpointVector L ω i) 2 (smo" + }, + { + "kind": "theorem", + "unqualified_name": "cross_row_zero", + "line": 153, + "source_header": "· exact hQ\n\nprivate theorem cross_row_zero (L : ℝ) (j : Fin 6) :\n sourceContactEndpointCrossCovariance L 0 j = -sourcePinCovarianc" + }, + { + "kind": "theorem", + "unqualified_name": "cross_row_one", + "line": 160, + "source_header": "left]\n rfl\n\nprivate theorem cross_row_one (L : ℝ) (j : Fin 6) :\n sourceContactEndpointCrossCovariance L 1 j = sourcePinCovarianc" + }, + { + "kind": "theorem", + "unqualified_name": "cross_row_two", + "line": 167, + "source_header": "left]\n rfl\n\nprivate theorem cross_row_two (L : ℝ) (j : Fin 6) :\n sourceContactEndpointCrossCovariance L 2 j =\n -sourceContactEndpointCrossCovar" + }, + { + "kind": "theorem", + "unqualified_name": "cross_row_four", + "line": 177, + "source_header": "eft]\n ring\n\nprivate theorem cross_row_four (L : ℝ) (j : Fin 6) :\n sourceContactEndpointCrossCovariance L 4 j =\n sourceContactEndpointCrossCovar" + }, + { + "kind": "theorem", + "unqualified_name": "regression_pin_coordinates", + "line": 181, + "source_header": "5 j := rfl\n\nprivate theorem regression_pin_coordinates {L : ℝ} (hL : L ≠ 0) (x : Fin 6 → ℝ) :\n (sourceContactEndpointRegression L *ᵥ x) 0 = -x 5 / 2 ∧\n (sourceContactEndpointRegression L *ᵥ x)" + }, + { + "kind": "theorem", + "unqualified_name": "regression_other_coordinates", + "line": 214, + "source_header": "[hc]; ring\n\nprivate theorem regression_other_coordinates (L : ℝ) (x : Fin 6 → ℝ) :\n (sourceContactEndpointRegression L *ᵥ x) 2 =\n -(sourceContactEndpointRegression L *ᵥ x) 3 ∧\n (sourceContactEndpointRegression L *ᵥ x) 4 =\n (sourceContactEndpointRegressio" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointMean_contact", + "line": 224, + "source_header": "s_row_four]\n\ntheorem sourceContactEndpointMean_contact {L : ℝ} (hL : L ≠ 0) (b : ℝ) :\n sourceContactEndpointMean L b 0 = -1 ∧\n sourceContactEndpointMean L b 1 = 1 ∧\n sourceContactEndpointMean L b 2 + sourceContactEndpointMean L b 3 = 0 ∧\n sourceContactEndpointMean L b 4 - sourceContactEndpointMea" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointResidual_contact", + "line": 239, + "source_header": "ho.2]; ring\n\nprivate theorem sourceContactEndpointResidual_contact {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample 2 L) :\n sourceContactEndpointResidual L ω 0 = 0 ∧\n sourceContactEndpointResidual L ω 1 = 0 ∧\n sourceContactEndpointResidual L ω 2 = -sourceContactEndpointResidual L ω 3 ∧\n sourceContactEndpointResidual L ω 4 = sourceContactEndpointRes" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointSchur_covariance", + "line": 255, + "source_header": "· rw [ho.2]\n\n/-- The limiting Schur matrix is the actual least-squares endpoint residual covariance. -/\ntheorem sourceContactEndpointSchur_covariance {L : ℝ} (hL : L ≠ 0) :\n (∀ i j, covariance (fun ω => sourceContactEndpointResidual L ω i)\n (fun ω => sourceContactEndpointResidual L ω j) (smoothLaw 2 L) =\n sourceContactEndpointSchur L i j) ∧ (sourceContactEndpointSchur" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointSchur_posSemidef", + "line": 270, + "source_header": "_memLp hL) hG\n\ntheorem sourceContactEndpointSchur_posSemidef {L : ℝ} (hL : L ≠ 0) :\n (sourceContactEndpointSchur" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointSchur_contact", + "line": 274, + "source_header": "ariance hL).2\n\n/-- The deterministic endpoint relations become exactly the four required zero variances. -/\ntheorem sourceContactEndpointSchur_contact {L : ℝ} (hL : L ≠ 0) :\n sourceContactEndpointSchur L 0 0 = 0 ∧\n sourceContactEndpointSchur L 1 1 = 0 ∧\n sourceContactEndpointSchur L 2 2 + 2 * sourceContactEndpointSchur L 2 3 +\n sourceContactEndpointSchur L 3 3 = 0 ∧\n sourceContactEndpointSchur L 4 4 - 2 * sourceContactEndpointSchur L 4 5 +\n sourceContactEndpoint" + }, + { + "kind": "theorem", + "unqualified_name": "cross_row_Q", + "line": 302, + "source_header": "hfour]\n ring\n\nprivate theorem cross_row_Q (L : ℝ) (j : Fin 6) :\n sourceContactEndpointCrossCovariance L 4 j = sourceC" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointSchur_four_four_eq_schur", + "line": 306, + "source_header": "riance_comm _ _\n\n/-- The reference entry is the already established actual torus curvature Schur variance. -/\ntheorem sourceContactEndpointSchur_four_four_eq_schur (L : ℝ) :\n sourceContactEndpointSchur L 4 4 = sou" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointSchur_referenceVariance_pos", + "line": 319, + "source_header": "L - _\n rw [heq]\n\ntheorem sourceContactEndpointSchur_referenceVariance_pos {L : ℝ} (hL : L ≠ 0) :\n 0 < sourceContactEn" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceSmoothConditionalKernel.lean", + "sha256": "664892acb12d40e5bf20075e1ef633efdd4a54ae1308c714308eab3a4deaa517", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "zeroSample", + "line": 29, + "source_header": "l\n\ndef zeroSample (d : ℕ) (L : ℝ) : SmoothSample d" + }, + { + "kind": "theorem", + "unqualified_name": "exists_measurable_sampleProjection", + "line": 35, + "source_header": "⟩\n\ntheorem exists_measurable_sampleProjection (d : ℕ) (L : ℝ) :\n ∃ q : (SourceMode d → ℝ) → SmoothSample d L,\n Measurable q ∧ ∀ ω : SmoothSample d L, q (sampleInclusion d L ω) =" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_add", + "line": 41, + "source_header": "⟩\n\ntheorem goodSample_add {d : ℕ} {L : ℝ}\n (ω η : SourceMode d → ℝ) (hω : goodSample d L ω) (hη : goodSample d L η) :\n goodSample d L (ω + η" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_neg", + "line": 53, + "source_header": ")\n\ntheorem goodSample_neg {d : ℕ} {L : ℝ}\n (ω : SourceMode d → ℝ) (hω : goodSample d L ω) : goodSample d L (-ω" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_weighted_summable", + "line": 58, + "source_header": "n\n\n\ntheorem derivativeCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample 2 L) (k : ℕ) (x : Fin 2 → ℝ) (u : Fin k → (Fin 2 → ℝ)) :\n Summable (fun m => derivativeCoefficient 2 L k x u m * sampleInclusion 2 L ω m" + }, + { + "kind": "theorem", + "unqualified_name": "finiteCoefficient_weighted_summable", + "line": 72, + "source_header": "g\n\ntheorem finiteCoefficient_weighted_summable {ι : Type*} {n q : ℕ}\n (a : Fin n → ι → ℝ) (ω : ι → ℝ)\n (ha : ∀ i, Summable (fun m => a i m * ω m))\n (T : (Fin n → ℝ) →L[ℝ] (Fin q → ℝ)) (j : Fin q) :\n Summable (fun m => T (fun i => a i m) j * ω m" + }, + { + "kind": "theorem", + "unqualified_name": "pinCoefficient_weighted_summable", + "line": 89, + "source_header": "_\n\ntheorem pinCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) (i : Fin 6) :\n Summable (fun m => pinCoefficient L r i m * sampleInclusion 2 L ω m" + }, + { + "kind": "theorem", + "unqualified_name": "adjustedCoefficient_weighted_summable", + "line": 97, + "source_header": "i\n\ntheorem adjustedCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) (i : Fin 6) :\n Summable (fun m => adjustedCoefficient L r i m * sampleInclusion 2 L ω m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPinsAt_measurable", + "line": 105, + "source_header": "i\n\ntheorem sourceConfluentPinsAt_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (sourceConfluentPinsAt L r" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_measurable", + "line": 115, + "source_header": ")\n\ntheorem sourceAdjustedEndpoints_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (sourceAdjustedEndpoints L r" + }, + { + "kind": "def", + "unqualified_name": "pinLift", + "line": 125, + "source_header": ")\n\ndef pinLift (L r : ℝ) (y : Fin 6 → ℝ) (m : SourceMode 2) :" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_zero", + "line": 128, + "source_header": ")\n\ntheorem pinLift_zero (L r : ℝ) : pinLift L r 0 =" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_add", + "line": 132, + "source_header": "]\n\ntheorem pinLift_add (L r : ℝ) (x y : Fin 6 → ℝ) :\n pinLift L r (x + y) = pinLift L r x + pinLift L r" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_neg", + "line": 137, + "source_header": "]\n\ntheorem pinLift_neg (L r : ℝ) (x : Fin 6 → ℝ) :\n pinLift L r (-x) = -pinLift L r" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_goodSample", + "line": 142, + "source_header": "]\n\ntheorem pinLift_goodSample {L : ℝ} (hL : L ≠ 0) (r : ℝ) (y : Fin 6 → ℝ) :\n goodSample 2 L (pinLift L r y" + }, + { + "kind": "theorem", + "unqualified_name": "pinLift_measurable", + "line": 162, + "source_header": "]\n\ntheorem pinLift_measurable (L r : ℝ) : Measurable (pinLift L r" + }, + { + "kind": "def", + "unqualified_name": "addLift", + "line": 168, + "source_header": "p\n\ndef addLift {L : ℝ} (hL : L ≠ 0) (r : ℝ) (y : Fin 6 → ℝ)\n (ω : SmoothSample 2 L) : SmoothSample 2" + }, + { + "kind": "theorem", + "unqualified_name": "addLift_measurable", + "line": 177, + "source_header": "l\n\ntheorem addLift_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (fun p : (Fin 6 → ℝ) × SmoothSample 2 L => addLift hL r p.1 p.2" + }, + { + "kind": "def", + "unqualified_name": "posteriorSample", + "line": 184, + "source_header": ")\n\ndef posteriorSample {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ)\n (ω : SmoothSample 2 L) : SmoothSample 2" + }, + { + "kind": "theorem", + "unqualified_name": "posteriorSample_measurable", + "line": 193, + "source_header": "l\n\ntheorem posteriorSample_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (fun p : (Fin 6 → ℝ) × SmoothSample 2 L => posteriorSample hL r p.1 p.2" + }, + { + "kind": "lemma", + "unqualified_name": "scalarSeries_add_finiteShift", + "line": 203, + "source_header": "l\n\nlemma scalarSeries_add_finiteShift {ι : Type*} {n : ℕ}\n (a : ι → ℝ) (b : Fin n → ι → ℝ) (ω : ι → ℝ) (c : Fin n → ℝ)\n (ha : Summable a) (hb : ∀ j, Summable (b j))\n (hω : Summable (fun m => a m * ω m)) :\n scalarSeries a (fun m => ω m + ∑ j, b j m * c j) =\n scalarSeries a ω + ∑ j, (∑' m, a m * b j m) * c" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPinsAt_addLift", + "line": 229, + "source_header": "l\n\ntheorem sourceConfluentPinsAt_addLift {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (y : Fin 6 → ℝ) (ω : SmoothSample 2 L) :\n sourceConfluentPinsAt L r (addLift hL r y ω) = sourceConfluentPinsAt L r ω +\n sourcePinCovarianceAt L r *ᵥ ((sourcePinCovarianceAt L r)⁻¹ *ᵥ y" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_addLift", + "line": 245, + "source_header": "l\n\ntheorem sourceAdjustedEndpoints_addLift {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (y : Fin 6 → ℝ) (ω : SmoothSample 2 L) :\n sourceAdjustedEndpoints L r (addLift hL r y ω) = sourceAdjustedEndpoints L r ω +\n sourceRegressionMapAt L r" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPinsAt_posteriorSample", + "line": 263, + "source_header": "l\n\ntheorem sourceConfluentPinsAt_posteriorSample {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ)\n (ω : SmoothSample 2 L) :\n sourceConfluentPinsAt L r (posteriorSample hL r x ω) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_posteriorSample", + "line": 272, + "source_header": "l\n\ntheorem sourceAdjustedEndpoints_posteriorSample {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) (ω : SmoothSample 2 L) :\n sourceAdjustedEndpoints L r (posteriorSample hL r x ω) =\n sourceAdjustedEndpoints L r ω +\n sourceRegressionMapAt L r (x - sourceConfluentPinsAt L r ω" + }, + { + "kind": "def", + "unqualified_name": "sourceSmoothKernel", + "line": 286, + "source_header": "l\n\n/-- The literal coefficient-shift law, specified at every pin value. -/\ndef sourceSmoothKernel {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Kernel (Fin 6 → ℝ) (SmoothSample 2" + }, + { + "kind": "instance", + "unqualified_name": "sourceSmoothKernel_isMarkov", + "line": 293, + "source_header": ".2)\n\ninstance sourceSmoothKernel_isMarkov {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n IsMarkovKernel (sourceSmoothKernel hL" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_measurable", + "line": 298, + "source_header": "r)\n\ntheorem sourceSmoothKernel_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (sourceSmoothKernel hL" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_apply", + "line": 301, + "source_header": "e _\n\n/-- Exact sampling formula, including every probability-zero pin. -/\ntheorem sourceSmoothKernel_apply {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :\n sourceSmoothKernel hL r x = (smoothLaw 2 L).map (posteriorSample hL" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_pin_map", + "line": 310, + "source_header": "rfl\n\ntheorem sourceSmoothKernel_pin_map {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :\n (sourceSmoothKernel hL r x).map (sourceConfluentPinsAt L r) = Measure.di" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_pin_fiber", + "line": 324, + "source_header": "simp\n\ntheorem sourceSmoothKernel_pin_fiber {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :\n sourceSmoothKernel hL r x {ω | sourceConfluentPinsAt L r ω = x" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_endpoint_map", + "line": 334, + "source_header": "simp\n\n/-- The actual endpoint kernel is the marginal of the full coefficient shift\nat every pin, including prescribed null pins. -/\ntheorem sourceSmoothKernel_endpoint_map {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) :\n (sourceSmoothKernel hL r x).map (sourceAdjustedEndpoints L r) =\n sourceEndpointKerne" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_finite_hasGaussianLaw", + "line": 362, + "source_header": "nditional\n\ntheorem scalarSeries_finite_hasGaussianLaw {ι τ : Type*} [Countable ι] [Fintype τ]\n (a : τ → ι → ℝ) (ha : ∀ j, Summable (a j)) :\n HasGaussianLaw (fun η j => scalarSeries (a j) η) (coeffici" + }, + { + "kind": "def", + "unqualified_name": "residualCoefficient", + "line": 373, + "source_header": "using hG\n\ndef residualCoefficient (L r : ℝ) (ω : SmoothSample 2 L) (m : SourceMo" + }, + { + "kind": "lemma", + "unqualified_name": "scalarSeries_single", + "line": 376, + "source_header": "L r ω) m\n\nlemma scalarSeries_single {ι : Type*} [DecidableEq ι] (m : ι) (η : ι → ℝ) :\n scalarSeries (Pi.single m (1 : ℝ)" + }, + { + "kind": "lemma", + "unqualified_name": "scalarSeries_coordinate_covariance", + "line": 380, + "source_header": "le_apply]\n\nlemma scalarSeries_coordinate_covariance {ι : Type*} [Countable ι]\n (a : ι → ℝ) (ha : Summable a) (m : ι) :\n covariance (scalarSeries a) (fun ω : ι → ℝ => ω m) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "pin_coefficient_covariance", + "line": 395, + "source_header": "mul_ite]\n\ntheorem pin_coefficient_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (i : Fin 6) (m : SourceMode 2) :\n covariance (fun ω => sourceConfluentPinsAt L r ω i)\n (fun ω : SmoothSample 2 L => ω.val m) (smoothLaw 2 L) = pinCoefficien" + }, + { + "kind": "theorem", + "unqualified_name": "pin_finite_coefficients_hasGaussianLaw", + "line": 407, + "source_header": "hL r i) m\n\n\ntheorem pin_finite_coefficients_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (I : Finset (SourceMode 2)) :\n HasGaussianLaw (fun ω : SmoothSample 2 L =>\n (sourceConfluentPinsAt L r ω, fun m : I => ω.val m)) (smoot" + }, + { + "kind": "def", + "unqualified_name": "finiteLift", + "line": 444, + "source_header": "val ω.val\n\ndef finiteLift (L r : ℝ) (I : Finset (SourceMode 2)) :\n (Fin 6 → ℝ) →L[ℝ" + }, + { + "kind": "lemma", + "unqualified_name": "finiteLift_apply", + "line": 449, + "source_header": "LinearMap\n\nlemma finiteLift_apply (L r : ℝ) (I : Finset (SourceMode 2)) (y : Fin 6 → ℝ) (m : I) :\n finiteLift L r I y m = pinLift L" + }, + { + "kind": "theorem", + "unqualified_name": "pin_residual_finite_hasGaussianLaw", + "line": 456, + "source_header": "ec]\n rfl\n\ntheorem pin_residual_finite_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (I : Finset (SourceMode 2)) :\n HasGaussianLaw (fun ω : SmoothSample 2 L =>\n (sourceConfluentPinsAt L r ω, fun m : I => residualCoefficient L r ω m.val))\n (smoot" + }, + { + "kind": "lemma", + "unqualified_name": "coefficient_hasGaussianLaw", + "line": 474, + "source_header": "]\n rfl\n\nlemma coefficient_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (m : SourceMode 2) :\n HasGaussianLaw (fun ω : SmoothSample 2 L => ω.val m) (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "residualCoefficient_zero_covariance", + "line": 481, + "source_header": "_instance\n\ntheorem residualCoefficient_zero_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (i : Fin 6) (m : SourceMode 2) :\n covariance (fun ω => sourceConfluentPinsAt L r ω i)\n (fun ω => residualCoefficient L r ω m) (smoothLaw" + }, + { + "kind": "theorem", + "unqualified_name": "residualCoefficient_finite_indepFun", + "line": 523, + "source_header": "sub_self]\n\ntheorem residualCoefficient_finite_indepFun {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (I : Finset (SourceMode 2)) :\n IndepFun (sourceConfluentPinsAt L r)\n (fun (ω : SmoothSample 2 L) (m : I) => residualCoefficient L r ω m.val) (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "residualCoefficient_indepFun", + "line": 530, + "source_header": "i m.val)\n\ntheorem residualCoefficient_indepFun {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IndepFun (sourceConfluentPinsAt L r) (fun ω m => residualCoefficient L r ω m)\n (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "sourceNormalizedEndpoints_measurable", + "line": 551, + "source_header": "nditional\n\ntheorem sourceNormalizedEndpoints_measurable {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n Measurable (sourceNormalizedEndpo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_physical_endpoint_map", + "line": 561, + "source_header": "le hL r))\n\n/-- The literal physical endpoint kernel is also an all-pin marginal of the\nwhole-carrier conditional sampling law. -/\ntheorem sourceSmoothKernel_physical_endpoint_map {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :\n (sourceSmoothKernel hL r x).map (sourceNormalizedEndpoints L r) =\n sourcePhysicalEndpointK" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_physical_prescribed_map", + "line": 587, + "source_header": "sub]\n abel\n\n/-- Prescribed null pins select exactly the physical endpoint law already used\nby the completed endpoint estimates. -/\ntheorem sourceSmoothKernel_physical_prescribed_map {L : ℝ} (hL : L ≠ 0) (r b : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n (sourceSmoothKernel hL r (sourcePrescribedPins r b)).map (sourceNormalizedEndpoints L r) =\n sourcePhysicalEndp" + }, + { + "kind": "theorem", + "unqualified_name": "posteriorSample_self", + "line": 603, + "source_header": "oothConditional\n\ntheorem posteriorSample_self {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n posteriorSample hL r (sourceConfluentPins" + }, + { + "kind": "theorem", + "unqualified_name": "posteriorSample_eq_addLift_residual", + "line": 610, + "source_header": "pply, add_zero]\n\ntheorem posteriorSample_eq_addLift_residual {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) (ω : SmoothSample 2 L) :\n addLift hL r x (posteriorSample hL r 0 ω) = posterior" + }, + { + "kind": "theorem", + "unqualified_name": "addLift_observation_residual", + "line": 619, + "source_header": "g_apply]\n abel\n\ntheorem addLift_observation_residual {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n addLift hL r (sourceConfluentPinsAt L r ω) (posteriorSampl" + }, + { + "kind": "theorem", + "unqualified_name": "posteriorSample_zero_inclusion", + "line": 624, + "source_header": "iorSample_self]\n\ntheorem posteriorSample_zero_inclusion {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n sampleInclusion 2 L (posteriorSample hL r 0 ω) = residualCo" + }, + { + "kind": "theorem", + "unqualified_name": "posteriorSample_zero_indepFun", + "line": 632, + "source_header": ", Pi.neg_apply]\n\ntheorem posteriorSample_zero_indepFun {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IndepFun (sourceConfluentPinsAt L r) (posteriorSample hL r 0)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_hasCondDistrib", + "line": 642, + "source_header": ", heq] using hi\n\ntheorem sourceSmoothKernel_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasCondDistrib (id : SmoothSample 2 L → SmoothSample 2 L)\n (sourceConfluentPinsAt L r) (sourceSmoothKernel hL r)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_map_hasCondDistrib", + "line": 677, + "source_header": "oothConditional\n\n/-- Every measurable functional of the actual carrier inherits this specified\nconditional kernel. -/\ntheorem sourceSmoothKernel_map_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) {E : Type*} [MeasurableSpace E]\n (F : SmoothSample 2 L → E) (hF : Measurable F) :\n HasCondDistrib F (sourceConfluentPinsAt L r) ((sourceSmoothKernel hL r).map F)" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_measurable", + "line": 688, + "source_header": "hG).comp_left hF\n\n/-- The literal smooth field is measurable for the coordinate product sigma\nalgebra on functions. No additional topological function-space law is chosen. -/\ntheorem smoothSourceField_measurable (d : ℕ) (L : ℝ) :\n Measurable (smo" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_field_hasCondDistrib", + "line": 696, + "source_header": "ion_measurable d L)\n\ntheorem sourceSmoothKernel_field_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasCondDistrib (smoothSourceField 2 L) (sourceConfluentPinsAt L r)\n ((sourceSmoothKernel hL r).map (smoothSourceField 2" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_eventually_hasCondDistrib", + "line": 702, + "source_header": "eld_measurable 2 L)\n\n/-- The completed actual covariance limits supply invertibility. The final\nwhole-carrier conditioning statement retains only the actual scale hypothesis. -/\ntheorem sourceSmoothKernel_eventually_hasCondDistrib {L : ℝ} (hL : L ≠ 0) :\n ∀ᶠ r in 𝓝[>] (0 : ℝ),\n HasCondDistrib (id : SmoothSample 2 L → SmoothSample 2 L)\n (sourceConfluentPinsAt L r) (sourceSmoothKernel" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSmoothKernel_eventually_map_hasCondDistrib", + "line": 711, + "source_header": "asCondDistrib hL r hG\n\ntheorem sourceSmoothKernel_eventually_map_hasCondDistrib {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (F : SmoothSample 2 L → E) (hF : Measurable F) :\n ∀ᶠ r in 𝓝[>] (0 : ℝ),\n HasCondDistrib F (sourceConfluentPinsAt L r) ((sourceSmoothKernel hL r).map F)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceEndpointRegression.lean", + "sha256": "67e68553e004adc3b1b6beb987b3e7ad477b4541d96fec22ee481facd2038fce", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sourceConfluentPinsAt", + "line": 28, + "source_header": "n\n\n/-- Actual confluent observations as a nondependent family in r. -/\ndef sourceConfluentPinsAt (L r : ℝ) (ω : SmoothSample 2 L) : Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourceAdjustedEndpoints", + "line": 35, + "source_header": "rfl\n\n/-- LM006 order `(xxM,xxS,xyM,xyS,yyM,yyS)`, with the confluent xx/xy pins subtracted. -/\ndef sourceAdjustedEndpoints (L r : ℝ) (ω : SmoothSample 2 L) : Fin" + }, + { + "kind": "def", + "unqualified_name": "sourcePinCovarianceAt", + "line": 41, + "source_header": "v 11]\n\n/-- The actual pin covariance G. -/\ndef sourcePinCovarianceAt (L r : ℝ) : Matrix (Fin 6) (F" + }, + { + "kind": "def", + "unqualified_name": "sourceCrossCovarianceAt", + "line": 46, + "source_header": "aw 2 L)\n\n/-- The actual adjusted-endpoint/pin cross covariance C, with endpoint rows. -/\ndef sourceCrossCovarianceAt (L r : ℝ) : Matrix (Fin 6)" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointCovarianceAt", + "line": 51, + "source_header": "hLaw 2 L)\n\n/-- The actual adjusted endpoint covariance, without an assumed limiting model. -/\ndef sourceEndpointCovarianceAt (L r : ℝ) : Matrix (Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourceRegressionMatrixAt", + "line": 56, + "source_header": "othLaw 2 L)\n\ndef sourceRegressionMatrixAt (L r : ℝ) : Matrix (Fin 6" + }, + { + "kind": "def", + "unqualified_name": "sourceRegressionMapAt", + "line": 59, + "source_header": "ceAt L r)⁻¹\n\ndef sourceRegressionMapAt (L r : ℝ) : (Fin 6 → ℝ) →L[ℝ]" + }, + { + "kind": "def", + "unqualified_name": "endpointObservationMap", + "line": 62, + "source_header": "usLinearMap\n\n/-- Deterministic twelve-observation map: no observation law is built into its definition. -/\ndef endpointObservationMap (r : ℝ) :\n (Fin 12 → ℝ) →L[ℝ] ((Fin 6 → ℝ) × (Fin 6 → ℝ)) wh" + }, + { + "kind": "lemma", + "unqualified_name": "endpointObservationMap_actual", + "line": 76, + "source_header": "fun_prop\n\nlemma endpointObservationMap_actual (L r : ℝ) (ω : SmoothSample 2 L) :\n endpointObservationMap r (rawPinsWithHessians L r ω) =\n (sourceConfluentPinsAt L r ω, sourceAdjustedEnd" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePins_adjusted_hasGaussianLaw", + "line": 87, + "source_header": "ly [hp]\n rfl\n\n/-- The actual joint Gaussian law is a proved image of the actual twelve derivative observations. -/\ntheorem sourcePins_adjusted_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n HasGaussianLaw (fun ω => (sourceConfluentPinsAt L r ω, sourceAdjustedEndpoints L r ω))" + }, + { + "kind": "theorem", + "unqualified_name": "sourceRegression_normal_equations", + "line": 103, + "source_header": "egressionMapAt]\n\n/-- The matrix inverse derives the regression normal equations for these actual observations. -/\ntheorem sourceRegression_normal_equations (L r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n ∀ i j, covariance (fun ω => sourceConfluentPinsAt L r ω i)\n (fun ω => sourceAdjustedEndpoints L r ω j) (smoothLaw 2 L) =\n ∑ l, sourceRegressionMapAt L r (Pi.single l 1) j *\n covariance (fun ω => sourceConfluentPinsAt L r ω i)\n (fun ω => sourceConfluentPinsAt L r ω l" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointResidual", + "line": 131, + "source_header": "variance_comm _ _\n\n/-- The actual affine regression residual, with no assumed residual law. -/\ndef sourceEndpointResidual (L r : ℝ) (ω : SmoothSamp" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointKernel", + "line": 135, + "source_header": "fluentPinsAt L r ω)\n\n/-- The canonical actual endpoint kernel, specified at every pin value. -/\ndef sourceEndpointKernel (L r : ℝ) : Kernel (F" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_markov", + "line": 140, + "source_header": "ressionMapAt L r) 0 0\n\ntheorem sourceEndpointKernel_markov {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n IsMarkovKernel (sour" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_measurable", + "line": 146, + "source_header": "rnel\n infer_instance\n\ntheorem sourceEndpointKernel_measurable (L r : ℝ) : Measurable (sour" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_apply", + "line": 149, + "source_header": "Kernel.measurable _\n\n/-- The all-pin pushforward identity includes every probability-zero prescribed pin vector. -/\ntheorem sourceEndpointKernel_apply {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :\n sourceEndpointKernel L r x =\n ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map\n (fun v => v + sourc" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_hasCondDistrib", + "line": 159, + "source_header": "ressionMapAt L r) 0 0 x\n\n/-- The actual target's conditional law, with Gaussian residual hypotheses derived rather than assumed.\nCurrent pin-covariance invertibility is the sole algebraic premise. -/\ntheorem sourceEndpointKernel_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasCondDistrib (sourceAdjustedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourceEndpointKe" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_spec", + "line": 171, + "source_header": "ly [sub_zero] using hcond\n\n/-- Combined canonical law for the actual pins and adjusted endpoint vector. -/\ntheorem sourceEndpointKernel_spec {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IsMarkovKernel (sourceEndpointKernel L r) ∧\n Measurable (sourceEndpointKernel L r) ∧\n (∀ x, sourceEndpointKernel L r x =\n ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map\n (fun v => v + sourceRegressionMapAt L r x)) ∧\n HasCondDistrib (sourceAdjustedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourceEndpoint" + }, + { + "kind": "def", + "unqualified_name": "sourceNormalizedEndpoints", + "line": 184, + "source_header": "nel_hasCondDistrib hL r hG⟩\n\n/-- The literal physical normalized endpoint vector in LM006 order. -/\ndef sourceNormalizedEndpoints (L r : ℝ) (ω :" + }, + { + "kind": "def", + "unqualified_name": "sourcePrescribedPins", + "line": 189, + "source_header": "/r, v 7/r, v 10/r, v 8, v 11]\n\ndef sourcePrescri" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_on_pin_fiber", + "line": 191, + "source_header": "→ ℝ := ![b-r^3/12,0,0,0,0,2]\n\n/-- On the two zero xx/xy pin coordinates, adjusted entries are exactly physical normalized entries. -/\ntheorem sourceAdjustedEndpoints_on_pin_fiber (L r : ℝ) (ω : SmoothSample 2 L)\n (h3 : sourceConfluentPinsAt L r ω 3 = 0) (h4 : sourceConfluentPinsAt L r ω 4 = 0) :\n sourceAdjustedEndpoints L r ω =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_on_prescribed", + "line": 197, + "source_header": "rceNormalizedEndpoints, h3, h4]\n\n/-- Exact deterministic reconstruction at the prescribed pin fiber, without choosing an arbitrary RCD. -/\ntheorem sourceAdjustedEndpoints_on_prescribed (L r b : ℝ) (ω : SmoothSample 2 L)\n (hp : sourceConfluentPinsAt L r ω = sourcePrescribedPins r b) :\n sourceAdjustedEndpoints L r ω" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceDerivativeContinuity.lean", + "sha256": "552511e0aee227133b7d067faeceaab9c43c0094b07d68b8eddab0ab2419775e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "derivativeMajorant", + "line": 14, + "source_header": "y\n\n/-- A global, point-independent bound for a fixed directional derivative mode. -/\ndef derivativeMajorant (d : ℕ) (L : ℝ) (k : ℕ) (u : Fin k → (Fin d → ℝ))\n (m : SourceMode d)" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeMajorant_nonneg", + "line": 19, + "source_header": "j‖\n\ntheorem derivativeMajorant_nonneg (d : ℕ) (L : ℝ) (k : ℕ)\n (u : Fin k → (Fin d → ℝ)) (m : SourceMode d) :\n 0 ≤ derivativeMajorant d L k" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeMajorant_summable", + "line": 25, + "source_header": "_))\n\ntheorem derivativeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin d → ℝ)) : Summable (derivativeMajorant d L k" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_bound", + "line": 29, + "source_header": "t _\n\ntheorem derivativeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin d → ℝ)) (m : SourceMode d) (x : Fin d → ℝ) :\n ‖derivativeCoefficient d L k x u m‖ ≤ derivativeMajorant d L k" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_continuous", + "line": 36, + "source_header": ")))\n\ntheorem derivativeCoefficient_continuous (d : ℕ) (L : ℝ) (k : ℕ)\n (u : Fin k → (Fin d → ℝ)) (m : SourceMode d) :\n Continuous (fun x => derivativeCoefficient d L k x u" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeMajorant_product_summable", + "line": 54, + "source_header": "fl)\n\nprivate theorem derivativeMajorant_product_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k l : ℕ) (u : Fin k → (Fin d → ℝ)) (v : Fin l → (Fin d → ℝ)) :\n Summable (fun m => derivativeMajorant d L k u m * derivativeMajorant d L l v" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivative_covariance_continuous", + "line": 64, + "source_header": "h)\n\n/-- The covariance of two actual fixed-order directional derivatives is\ncontinuous in their two evaluation points, including coincident points. -/\ntheorem smoothSourceField_derivative_covariance_continuous (d : ℕ) {L : ℝ}\n (hL : L ≠ 0) (k l : ℕ) (u : Fin k → (Fin d → ℝ))\n (v : Fin l → (Fin d → ℝ)) :\n Continuous (fun xy : (Fin d → ℝ) × (Fin d → ℝ) =>\n cov[fun ω => iteratedFDeriv ℝ k (smoothSourceField d L ω) xy.1 u,\n fun ω => iteratedFDeriv ℝ l (smoothSourceField d L ω) xy.2 v; smoothLaw" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivative_integral_zero", + "line": 84, + "source_header": "u m)\n\n/-- Every actual directional derivative is centered under the unchanged source\nlaw. Noncentered conditional means are not identified with these means. -/\ntheorem smoothSourceField_derivative_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ℕ) (x : Fin d → ℝ) (u : Fin k → (Fin d → ℝ)) :\n (∫ ω, iteratedFDeriv ℝ k (smoothSourceField d L ω) x u ∂smoothLaw d" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceDerivativeGaussian.lean", + "sha256": "c9754debcbf2aab7ff8d9604f2c13726723e8a8c1921ae68f83349205e43885d", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_smooth", + "line": 17, + "source_header": "n\n\nprivate theorem modeCoefficient_smooth (d : ℕ) (L : ℝ) (m : SourceMode d) :\n ContDiff ℝ (⊤ : ℕ∞) (modeCoefficient d L m" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_iteratedFDeriv", + "line": 31, + "source_header": "p\n\nprivate theorem weighted_iteratedFDeriv (d : ℕ) (L : ℝ) (m : SourceMode d)\n (c : ℝ) (k : ℕ) (x : Fin d → ℝ) :\n iteratedFDeriv ℝ k (fun y => modeCoefficient d L m y * c) x =\n c • iteratedFDeriv ℝ k (modeCoefficient d L m)" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_iteratedFDeriv_bound", + "line": 43, + "source_header": "]\n\nprivate theorem weighted_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (c : ℝ) (k : ℕ) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ k (fun y => modeCoefficient d L m y * c) x‖ ≤\n orderModeBound k d L m * |c" + }, + { + "kind": "def", + "unqualified_name": "derivativeCoefficient", + "line": 51, + "source_header": ")\n\n/-- Deterministic Fourier coefficient for an actual directional derivative. -/\ndef derivativeCoefficient (d : ℕ) (L : ℝ) (k : ℕ) (x : Fin d → ℝ)\n (u : Fin k → (Fin d → ℝ)) (m : SourceMode d)" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_summable", + "line": 56, + "source_header": "x u\n\ntheorem derivativeCoefficient_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ℕ) (x : Fin d → ℝ) (u : Fin k → (Fin d → ℝ)) :\n Summable (derivativeCoefficient d L k x" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivative_series", + "line": 69, + "source_header": "_))\n\n/-- This is a literal identity for every sample in the existing smooth carrier,\nincluding order zero. It is not a finite-mode approximation or a new field. -/\ntheorem smoothSourceField_derivative_series (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) (k : ℕ) (x : Fin d → ℝ)\n (u : Fin k → (Fin d → ℝ)) :\n iteratedFDeriv ℝ k (smoothSourceField d L ω) x u =\n scalarSeries (derivativeCoefficient d L k x u) (sampleInclusion d" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_linearCombination_hasGaussianLaw", + "line": 100, + "source_header": "m _ _\n\nprivate theorem scalarSeries_linearCombination_hasGaussianLaw\n {ι : Type*} [Countable ι] (n : ℕ) (a : Fin n → ι → ℝ)\n (ha : ∀ j, Summable (a j)) (c : Fin n → ℝ) :\n HasGaussianLaw (fun ω => ∑ j, c j * scalarSeries (a j) ω) (coefficientL" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_finiteVector_hasGaussianLaw", + "line": 120, + "source_header": "heq)\n\n/-- Arbitrary finite arrays of summable coefficient series are jointly Gaussian.\nNo independence of the resulting observations is asserted or assumed. -/\ntheorem scalarSeries_finiteVector_hasGaussianLaw\n {ι : Type*} [Countable ι] (n : ℕ) (a : Fin n → ι → ℝ)\n (ha : ∀ j, Summable (a j)) :\n HasGaussianLaw (fun ω j => scalarSeries (a j) ω) (coefficien" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivativeVector_hasGaussianLaw", + "line": 150, + "source_header": "ianReal\n\n/-- Heterogeneous derivative orders, points and directions of the actual smooth\nfield are jointly Gaussian under its unchanged literal law. Empty families,\norder zero and repeated observations are retained. -/\ntheorem smoothSourceField_derivativeVector_hasGaussianLaw (d : ℕ) {L : ℝ}\n (hL : L ≠ 0) (n : ℕ) (k : Fin n → ℕ) (x : Fin n → (Fin d → ℝ))\n (u : ∀ j, Fin (k j) → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j =>\n iteratedFDeriv ℝ (k j) (smoothSourceField d L ω) (x j) (u j)) (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivative_covariance", + "line": 173, + "source_header": "j)).symm\n\n/-- Actual derivative covariance as a convergent Fourier coefficient pairing.\nThis does not yet identify the pairing with derivatives of the theta kernel. -/\ntheorem smoothSourceField_derivative_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k l : ℕ) (x y : Fin d → ℝ) (u : Fin k → (Fin d → ℝ))\n (v : Fin l → (Fin d → ℝ)) :\n cov[fun ω => iteratedFDeriv ℝ k (smoothSourceField d L ω) x u,\n fun ω => iteratedFDeriv ℝ l (smoothSourceField d L ω) y v; smoothLaw d L] =\n ∑' m, derivativeCoefficient d L k x u m * derivativeCoefficient" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceConfluentLimits.lean", + "sha256": "1635a05bbd5b56608bc0a1a04eb4404c2df4601f1255f5846c1342a597bf5b0b", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "rawDerivativeOrder", + "line": 23, + "source_header": "s\n\nabbrev rawDerivativeOrder : Fin 12 →" + }, + { + "kind": "def", + "unqualified_name": "rawDerivativePoint", + "line": 25, + "source_header": "]\n\ndef rawDerivativePoint (r : ℝ) : Fin 12 → (Fin 2 → ℝ" + }, + { + "kind": "def", + "unqualified_name": "rawDerivativeDirections", + "line": 29, + "source_header": "]\n\ndef rawDerivativeDirections : (i : Fin 12) → Fin (rawDerivativeOrder i) → (Fin 2 → ℝ" + }, + { + "kind": "def", + "unqualified_name": "rawDerivativeCoefficient", + "line": 34, + "source_header": "Y\n\ndef rawDerivativeCoefficient (L r : ℝ) (i : Fin 12) (m : SourceMode 2) :" + }, + { + "kind": "def", + "unqualified_name": "pinObservationMap", + "line": 38, + "source_header": "m\n\ndef pinObservationMap (r : ℝ) : (Fin 12 → ℝ) →L[ℝ] (Fin 6 → ℝ" + }, + { + "kind": "def", + "unqualified_name": "adjustedObservationMap", + "line": 41, + "source_header": ")\n\ndef adjustedObservationMap (r : ℝ) : (Fin 12 → ℝ) →L[ℝ] (Fin 6 → ℝ" + }, + { + "kind": "def", + "unqualified_name": "pinCoefficient", + "line": 44, + "source_header": ")\n\ndef pinCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode 2) :" + }, + { + "kind": "def", + "unqualified_name": "adjustedCoefficient", + "line": 47, + "source_header": "i\n\ndef adjustedCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode 2) :" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_weighted_summable", + "line": 50, + "source_header": "i\n\nprivate theorem derivativeCoefficient_weighted_summable {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample 2 L) (k : ℕ) (x : Fin 2 → ℝ) (u : Fin k → (Fin 2 → ℝ)) :\n Summable (fun m => derivativeCoefficient 2 L k x u m * sampleInclusion 2 L ω m" + }, + { + "kind": "theorem", + "unqualified_name": "finiteSeries_map", + "line": 63, + "source_header": "g\n\nprivate theorem finiteSeries_map {ι : Type*} {n q : ℕ}\n (a : Fin n → ι → ℝ) (ω : ι → ℝ)\n (ha : ∀ i, Summable (fun m => a i m * ω m))\n (T : (Fin n → ℝ) →L[ℝ] (Fin q → ℝ)) :\n T (fun i => scalarSeries (a i) ω) =\n (fun j => scalarSeries (fun m => T (fun i => a i m) j) ω" + }, + { + "kind": "theorem", + "unqualified_name": "finiteCoefficient_map_summable", + "line": 86, + "source_header": "m\n\nprivate theorem finiteCoefficient_map_summable {ι : Type*} {n q : ℕ}\n (a : Fin n → ι → ℝ) (ha : ∀ i, Summable (a i))\n (T : (Fin n → ℝ) →L[ℝ] (Fin q → ℝ)) (j : Fin q) :\n Summable (fun m => T (fun i => a i m) j" + }, + { + "kind": "theorem", + "unqualified_name": "rawPinsWithHessians_series", + "line": 94, + "source_header": "e\n\ntheorem rawPinsWithHessians_series {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n rawPinsWithHessians L r ω =\n (fun i => scalarSeries (rawDerivativeCoefficient L r i) (sampleInclusion 2 L ω)" + }, + { + "kind": "theorem", + "unqualified_name": "pinCoefficient_summable", + "line": 117, + "source_header": "l\n\ntheorem pinCoefficient_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i : Fin 6) :\n Summable (pinCoefficient L r i" + }, + { + "kind": "theorem", + "unqualified_name": "adjustedCoefficient_summable", + "line": 123, + "source_header": "i\n\ntheorem adjustedCoefficient_summable {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i : Fin 6) :\n Summable (adjustedCoefficient L r i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPinsAt_series", + "line": 129, + "source_header": "i\n\ntheorem sourceConfluentPinsAt_series {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n sourceConfluentPinsAt L r ω =\n (fun i => scalarSeries (pinCoefficient L r i) (sampleInclusion 2 L ω)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_series", + "line": 141, + "source_header": ")\n\ntheorem sourceAdjustedEndpoints_series {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (ω : SmoothSample 2 L) :\n sourceAdjustedEndpoints L r ω =\n (fun i => scalarSeries (adjustedCoefficient L r i) (sampleInclusion 2 L ω)" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovarianceAt_coefficient", + "line": 153, + "source_header": ")\n\ntheorem sourcePinCovarianceAt_coefficient {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i j : Fin 6) :\n sourcePinCovarianceAt L r i j = ∑' m, pinCoefficient L r i m * pinCoefficient L r j" + }, + { + "kind": "theorem", + "unqualified_name": "sourceCrossCovarianceAt_coefficient", + "line": 162, + "source_header": ")\n\ntheorem sourceCrossCovarianceAt_coefficient {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i j : Fin 6) :\n sourceCrossCovarianceAt L r i j =\n ∑' m, adjustedCoefficient L r i m * pinCoefficient L r j" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointCovarianceAt_coefficient", + "line": 172, + "source_header": ")\n\ntheorem sourceEndpointCovarianceAt_coefficient {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i j : Fin 6) :\n sourceEndpointCovarianceAt L r i j =\n ∑' m, adjustedCoefficient L r i m * adjustedCoefficient L r j" + }, + { + "kind": "def", + "unqualified_name": "axisMap", + "line": 194, + "source_header": "ins\n\ndef axisMap : ℝ →L[ℝ] (Fin 2 → ℝ) where\n toFu" + }, + { + "kind": "theorem", + "unqualified_name": "mode_smooth", + "line": 200, + "source_header": "rop\n\ntheorem mode_smooth (L : ℝ) (m : SourceMode 2) :\n ContDiff ℝ (⊤ : ℕ∞) (modeCoefficient 2 L" + }, + { + "kind": "theorem", + "unqualified_name": "axis_iteratedDeriv", + "line": 214, + "source_header": "rop\n\ntheorem axis_iteratedDeriv (f : (Fin 2 → ℝ) → ℝ)\n (hf : ContDiff ℝ (⊤ : ℕ∞) f) (k : ℕ) (t : ℝ) :\n iteratedDeriv k (fun s => f ![s,0]) t =\n iteratedFDeriv ℝ k f ![t,0] (fun _ => directio" + }, + { + "kind": "theorem", + "unqualified_name": "axis_transverse_smooth", + "line": 224, + "source_header": "hh\n\ntheorem axis_transverse_smooth (f : (Fin 2 → ℝ) → ℝ)\n (hf : ContDiff ℝ (⊤ : ℕ∞) f) :\n ContDiff ℝ (⊤ : ℕ∞) (fun t => fderiv ℝ f ![t,0] directio" + }, + { + "kind": "theorem", + "unqualified_name": "axis_transverse_iteratedDeriv", + "line": 230, + "source_header": "iff\n\ntheorem axis_transverse_iteratedDeriv (f : (Fin 2 → ℝ) → ℝ)\n (hf : ContDiff ℝ (⊤ : ℕ∞) f) (k : ℕ) (t : ℝ) :\n iteratedDeriv k (fun s => fderiv ℝ f ![s,0] directionY) t =\n iteratedFDeriv ℝ (k+1) f ![t,0] (Fin.snoc (fun _ => directionX) directio" + }, + { + "kind": "def", + "unqualified_name": "modeF", + "line": 245, + "source_header": "st]\n\ndef modeF (L : ℝ) (m : SourceMode 2) (t : ℝ)" + }, + { + "kind": "def", + "unqualified_name": "modeH", + "line": 247, + "source_header": ",0]\ndef modeH (L : ℝ) (m : SourceMode 2) (t : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "modeH_eq", + "line": 249, + "source_header": "] m\n\ntheorem modeH_eq (L : ℝ) (m : SourceMode 2) :\n modeH L m = fun t => fderiv ℝ (modeCoefficient 2 L m) ![t,0] directi" + }, + { + "kind": "theorem", + "unqualified_name": "modeF_C3", + "line": 254, + "source_header": "y _\n\ntheorem modeF_C3 (L : ℝ) (m : SourceMode 2) : ContDiff ℝ 3 (modeF L" + }, + { + "kind": "theorem", + "unqualified_name": "modeH_C2", + "line": 257, + "source_header": "mp)\n\ntheorem modeH_C2 (L : ℝ) (m : SourceMode 2) : ContDiff ℝ 2 (modeH L" + }, + { + "kind": "theorem", + "unqualified_name": "modeF_deriv", + "line": 261, + "source_header": "mp)\n\ntheorem modeF_deriv (L : ℝ) (m : SourceMode 2) (t : ℝ) :\n deriv (modeF L m) t = derivativeCoefficient 2 L 1 ![t,0] ![directionX" + }, + { + "kind": "theorem", + "unqualified_name": "modeF_second", + "line": 267, + "source_header": "g h\n\ntheorem modeF_second (L : ℝ) (m : SourceMode 2) (t : ℝ) :\n iteratedDeriv 2 (modeF L m) t =\n derivativeCoefficient 2 L 2 ![t,0] ![directionX,directionX" + }, + { + "kind": "theorem", + "unqualified_name": "modeF_third", + "line": 276, + "source_header": "g h\n\ntheorem modeF_third (L : ℝ) (m : SourceMode 2) (t : ℝ) :\n iteratedDeriv 3 (modeF L m) t =\n derivativeCoefficient 2 L 3 ![t,0] ![directionX,directionX,directionX" + }, + { + "kind": "theorem", + "unqualified_name": "modeH_deriv", + "line": 285, + "source_header": "g h\n\ntheorem modeH_deriv (L : ℝ) (m : SourceMode 2) (t : ℝ) :\n deriv (modeH L m) t = derivativeCoefficient 2 L 2 ![t,0] ![directionX,directionY" + }, + { + "kind": "theorem", + "unqualified_name": "modeH_second", + "line": 293, + "source_header": "g h\n\ntheorem modeH_second (L : ℝ) (m : SourceMode 2) (t : ℝ) :\n iteratedDeriv 2 (modeH L m) t =\n derivativeCoefficient 2 L 3 ![t,0] ![directionX,directionX,directionY" + }, + { + "kind": "def", + "unqualified_name": "modeYY", + "line": 308, + "source_header": "ins\n\ndef modeYY (L : ℝ) (m : SourceMode 2) (t : ℝ)" + }, + { + "kind": "def", + "unqualified_name": "modeRawValues", + "line": 311, + "source_header": "] m\n\ndef modeRawValues (L r : ℝ) (m : SourceMode 2) : Fin 12" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections2", + "line": 318, + "source_header": "2)]\n\nprivate theorem rawDirections2 : rawDerivativeDirections 2 = ![directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections3", + "line": 323, + "source_header": "rfl\n\nprivate theorem rawDirections3 : rawDerivativeDirections 3 = ![directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections4", + "line": 328, + "source_header": "rfl\n\nprivate theorem rawDirections4 : rawDerivativeDirections 4 = ![directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections5", + "line": 333, + "source_header": "rfl\n\nprivate theorem rawDirections5 : rawDerivativeDirections 5 = ![directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections6", + "line": 338, + "source_header": "rfl\n\nprivate theorem rawDirections6 : rawDerivativeDirections 6 = ![directionX,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections7", + "line": 342, + "source_header": "rfl\n\nprivate theorem rawDirections7 : rawDerivativeDirections 7 = ![directionX,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections8", + "line": 346, + "source_header": "rfl\n\nprivate theorem rawDirections8 : rawDerivativeDirections 8 = ![directionY,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections9", + "line": 350, + "source_header": "rfl\n\nprivate theorem rawDirections9 : rawDerivativeDirections 9 = ![directionX,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections10", + "line": 354, + "source_header": "rfl\n\nprivate theorem rawDirections10 : rawDerivativeDirections 10 = ![directionX,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDirections11", + "line": 358, + "source_header": "rfl\n\nprivate theorem rawDirections11 : rawDerivativeDirections 11 = ![directionY,directio" + }, + { + "kind": "theorem", + "unqualified_name": "rawDerivativeCoefficient_explicit", + "line": 362, + "source_header": "rfl\n\ntheorem rawDerivativeCoefficient_explicit (L r : ℝ) (m : SourceMode 2) :\n (fun i => rawDerivativeCoefficient L r i m) = modeRawValues L" + }, + { + "kind": "def", + "unqualified_name": "modePinValues", + "line": 394, + "source_header": "rfl\n\ndef modePinValues (L r : ℝ) (m : SourceMode 2) : Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "pinCoefficient_explicit", + "line": 400, + "source_header": "r]\n\ntheorem pinCoefficient_explicit (L r : ℝ) (m : SourceMode 2) :\n (fun i => pinCoefficient L r i m) = modePinValues L" + }, + { + "kind": "def", + "unqualified_name": "modeAdjustedValues", + "line": 409, + "source_header": "mm]\n\ndef modeAdjustedValues (L r : ℝ) (m : SourceMode 2) : Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "adjustedCoefficient_explicit", + "line": 416, + "source_header": "2)]\n\ntheorem adjustedCoefficient_explicit (L r : ℝ) (m : SourceMode 2) :\n (fun i => adjustedCoefficient L r i m) = modeAdjustedValues L" + }, + { + "kind": "def", + "unqualified_name": "weightedDerivativeIntegral", + "line": 438, + "source_header": "grals\n\ndef weightedDerivativeIntegral (L : ℝ) (k : ℕ) (u : Fin k → (Fin 2 → ℝ))\n (m : SourceMode 2) (w : ℝ → ℝ) (r : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_integrand_bound", + "line": 442, + "source_header": "] u m\n\ntheorem weighted_integrand_bound {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ)\n (K : ℝ) (hK : 0 ≤ K)\n (hwbound : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ K)\n (r t : ℝ) (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) :\n ‖w t * derivativeCoefficient 2 L k ![r*t,0] u m‖ ≤\n K * derivativeMajorant 2 L" + }, + { + "kind": "theorem", + "unqualified_name": "weightedDerivativeIntegral_continuous", + "line": 453, + "source_header": "_) hK\n\ntheorem weightedDerivativeIntegral_continuous {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ) (hw : Continuous w)\n (K : ℝ) (hK : 0 ≤ K)\n (hwbound : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ K) :\n Continuous (weightedDerivativeIntegral L k u" + }, + { + "kind": "theorem", + "unqualified_name": "weightedDerivativeIntegral_norm_le", + "line": 472, + "source_header": "op)))\n\ntheorem weightedDerivativeIntegral_norm_le {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ)\n (K : ℝ) (hK : 0 ≤ K)\n (hwbound : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ K) (r : ℝ) :\n ‖weightedDerivativeIntegral L k u m w r‖ ≤ K * derivativeMajorant 2 L" + }, + { + "kind": "theorem", + "unqualified_name": "weightedDerivativeIntegral_zero", + "line": 482, + "source_header": "ing h\n\ntheorem weightedDerivativeIntegral_zero (L : ℝ) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ) :\n weightedDerivativeIntegral L k u m w 0 =\n (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), w t) * derivativeCoefficient 2 L k" + }, + { + "kind": "def", + "unqualified_name": "peanoLeft", + "line": 497, + "source_header": "grals\n\ndef peanoLeft (t : ℝ" + }, + { + "kind": "def", + "unqualified_name": "peanoRight", + "line": 499, + "source_header": "1/2-t\ndef peanoRight (t : ℝ" + }, + { + "kind": "def", + "unqualified_name": "peanoCubic", + "line": 500, + "source_header": "t+1/2\ndef peanoCubic (t : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "peano_one_bound", + "line": 501, + "source_header": "4-t^2\n\nprivate theorem peano_one_bound (t : ℝ)\n (_ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |(1 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "peano_left_bound", + "line": 504, + "source_header": "m_num\n\nprivate theorem peano_left_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoLeft t" + }, + { + "kind": "theorem", + "unqualified_name": "peano_right_bound", + "line": 510, + "source_header": "t.1]⟩\n\nprivate theorem peano_right_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoRight t" + }, + { + "kind": "theorem", + "unqualified_name": "peano_cubic_bound", + "line": 516, + "source_header": "t.2]⟩\n\nprivate theorem peano_cubic_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoCubic t" + }, + { + "kind": "theorem", + "unqualified_name": "peano_kernel_masses", + "line": 525, + "source_header": "g t]⟩\n\ntheorem peano_kernel_masses :\n (∫ _t in (-1/2 : ℝ)..(1/2 : ℝ), (1 : ℝ)) = 1 ∧\n (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), peanoLeft t) = 1/2 ∧\n (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), peanoRight t) = 1/2 ∧\n 6 * (∫ t in (-1/2 : ℝ)..(1/2 : ℝ), peanoCubic t" + }, + { + "kind": "def", + "unqualified_name": "regularizedPinCoefficient", + "line": 545, + "source_header": "_pow]\n\n/-- The Peano formulas define a genuine continuous extension of each pin mode,\nwhile preserving the singular raw formulas at every nonzero radius. -/\ndef regularizedPinCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode" + }, + { + "kind": "def", + "unqualified_name": "regularizedAdjustedCoefficient", + "line": 555, + "source_header": "ic r] i\n\ndef regularizedAdjustedCoefficient (L r : ℝ) (i : Fin 6) (m : SourceMode" + }, + { + "kind": "theorem", + "unqualified_name": "pinCoefficient_eq_regularized", + "line": 562, + "source_header": "r/2)] i\n\ntheorem pinCoefficient_eq_regularized (L r : ℝ) (hr : r ≠ 0) (i : Fin 6)\n (m : SourceMode 2) : pinCoefficient L r i m = regularizedPinCoefficient" + }, + { + "kind": "theorem", + "unqualified_name": "adjustedCoefficient_eq_regularized", + "line": 583, + "source_header": "rfl\n\ntheorem adjustedCoefficient_eq_regularized (L r : ℝ) (hr : r ≠ 0) (i : Fin 6)\n (m : SourceMode 2) : adjustedCoefficient L r i m = regularizedAdjustedCoefficient" + }, + { + "kind": "def", + "unqualified_name": "contactPinCoefficient", + "line": 620, + "source_header": "entLimits\n\ndef contactPinCoefficient (L : ℝ) (i : Fin 6) (m : SourceMo" + }, + { + "kind": "def", + "unqualified_name": "contactAdjustedCoefficient", + "line": 623, + "source_header": "astSucc m\n\ndef contactAdjustedCoefficient (L : ℝ) (i : Fin 6) (m : SourceMo" + }, + { + "kind": "theorem", + "unqualified_name": "contactPinCoefficient_summable", + "line": 631, + "source_header": "onY] m] i\n\ntheorem contactPinCoefficient_summable {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :\n Summable (contactPinCoeffic" + }, + { + "kind": "theorem", + "unqualified_name": "contactAdjustedCoefficient_summable", + "line": 635, + "source_header": ".castSucc\n\ntheorem contactAdjustedCoefficient_summable {L : ℝ} (hL : L ≠ 0) (i : Fin 6) :\n Summable (contactAdjustedCoeffic" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinVector_eq_contactSeries", + "line": 653, + "source_header": "exact hq\n\ntheorem sourcePinVector_eq_contactSeries {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample 2 L) (i : Fin 6) :\n sourcePinVector L ω i =\n scalarSeries (contactPinCoefficient L i) (sampleInclusi" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_div", + "line": 660, + "source_header": "castSucc)\n\nprivate theorem scalarSeries_div {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ) (c : ℝ) :\n scalarSeries (fun m => a m / c) ω = scalarSerie" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_neg", + "line": 664, + "source_header": "iv_const]\n\nprivate theorem scalarSeries_neg {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ) :\n scalarSeries (fun m => -a m) ω = -scalarS" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointVector_eq_contactSeries", + "line": 668, + "source_header": "tsum_neg]\n\ntheorem sourceContactEndpointVector_eq_contactSeries {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample 2 L) (i : Fin 6) :\n sourceContactEndpointVector L ω i =\n scalarSeries (contactAdjustedCoefficient L i) (sampleInclusi" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovariance_eq_contactCoefficientGram", + "line": 701, + "source_header": "exact hq\n\ntheorem sourcePinCovariance_eq_contactCoefficientGram {L : ℝ} (hL : L ≠ 0)\n (i j : Fin 6) : sourcePinCovariance L i j =\n ∑' m, contactPinCoefficient L i m * contactPinCoeffici" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointCrossCovariance_eq_contactCoefficientGram", + "line": 712, + "source_header": "ble hL j)\n\ntheorem sourceContactEndpointCrossCovariance_eq_contactCoefficientGram {L : ℝ}\n (hL : L ≠ 0) (i j : Fin 6) : sourceContactEndpointCrossCovariance L i j =\n ∑' m, contactAdjustedCoefficient L i m * contactPinCoeffici" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactEndpointCovariance_eq_contactCoefficientGram", + "line": 722, + "source_header": "ble hL j)\n\ntheorem sourceContactEndpointCovariance_eq_contactCoefficientGram {L : ℝ}\n (hL : L ≠ 0) (i j : Fin 6) : sourceContactEndpointCovariance L i j =\n ∑' m, contactAdjustedCoefficient L i m * contactAdjustedCoeffici" + }, + { + "kind": "def", + "unqualified_name": "modeComponentMajorant", + "line": 738, + "source_header": "entLimits\n\ndef modeComponentMajorant (L : ℝ) (m : SourceMode 2) :" + }, + { + "kind": "def", + "unqualified_name": "confluentModeMajorant", + "line": 748, + "source_header": "tionY] m]\n\ndef confluentModeMajorant (L : ℝ) (m : SourceMo" + }, + { + "kind": "theorem", + "unqualified_name": "modeComponentMajorant_nonneg", + "line": 751, + "source_header": "ant L m s\n\nprivate theorem modeComponentMajorant_nonneg (L : ℝ) (m : SourceMode 2) (s : Fin 8) :\n 0 ≤ modeComponentMajor" + }, + { + "kind": "theorem", + "unqualified_name": "confluentModeMajorant_nonneg", + "line": 756, + "source_header": "2 L _ _ m\n\ntheorem confluentModeMajorant_nonneg (L : ℝ) (m : SourceMode 2) :\n 0 ≤ confluentModeMaj" + }, + { + "kind": "theorem", + "unqualified_name": "confluentModeMajorant_summable", + "line": 760, + "source_header": "g L m s))\n\ntheorem confluentModeMajorant_summable {L : ℝ} (hL : L ≠ 0) :\n Summable (confluentModeMa" + }, + { + "kind": "theorem", + "unqualified_name": "six_component_le_majorant", + "line": 768, + "source_header": "2 hL _ _\n\nprivate theorem six_component_le_majorant (L : ℝ) (m : SourceMode 2) (s : Fin 8) :\n 6 * modeComponentMajorant L m s ≤ confluentModeMaj" + }, + { + "kind": "theorem", + "unqualified_name": "component_le_majorant", + "line": 773, + "source_header": "m_univ s)\n\nprivate theorem component_le_majorant (L : ℝ) (m : SourceMode 2) (s : Fin 8) :\n modeComponentMajorant L m s ≤ confluentModeMaj" + }, + { + "kind": "theorem", + "unqualified_name": "average_norm_le", + "line": 779, + "source_header": "linarith\n\nprivate theorem average_norm_le (a b M : ℝ) (ha : ‖a‖ ≤ M) (hb : ‖b‖ ≤ M) :\n ‖(a+" + }, + { + "kind": "theorem", + "unqualified_name": "integral_bound_one", + "line": 787, + "source_header": "= by ring\n\nprivate theorem integral_bound_one {L : ℝ} (hL : L ≠ 0) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) (m : SourceMode 2) (w : ℝ → ℝ)\n (hw : ∀ t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ), |w t| ≤ 1) (r : ℝ) :\n ‖weightedDerivativeIntegral L k u m w r‖ ≤ derivativeMajorant" + }, + { + "kind": "theorem", + "unqualified_name": "modeF_norm_bound", + "line": 794, + "source_header": "] using h\n\nprivate theorem modeF_norm_bound {L : ℝ} (hL : L ≠ 0) (m : SourceMode 2) (t : ℝ) :\n ‖modeF L m t‖ ≤ derivativeMajorant 2" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedPinCoefficient_bound", + "line": 799, + "source_header": "m ![t,0]\n\ntheorem regularizedPinCoefficient_bound {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (i : Fin 6) (m : SourceMode 2) :\n ‖regularizedPinCoefficient L r i m‖ ≤ confluentModeMaj" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedAdjustedCoefficient_bound", + "line": 826, + "source_header": "ant L m 5\n\ntheorem regularizedAdjustedCoefficient_bound {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (i : Fin 6) (m : SourceMode 2) :\n ‖regularizedAdjustedCoefficient L r i m‖ ≤ confluentModeMaj" + }, + { + "kind": "theorem", + "unqualified_name": "helper_left_bound", + "line": 864, + "source_header": "luentLimits\n\nprivate theorem helper_left_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peano" + }, + { + "kind": "theorem", + "unqualified_name": "helper_right_bound", + "line": 870, + "source_header": "ith [ht.1]⟩\n\nprivate theorem helper_right_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoR" + }, + { + "kind": "theorem", + "unqualified_name": "helper_cubic_bound", + "line": 876, + "source_header": "ith [ht.2]⟩\n\nprivate theorem helper_cubic_bound (t : ℝ)\n (ht : t ∈ Set.uIoc (-1/2 : ℝ) (1/2 : ℝ)) : |peanoC" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedPinCoefficient_continuous", + "line": 885, + "source_header": "_nonneg t]⟩\n\ntheorem regularizedPinCoefficient_continuous {L : ℝ} (hL : L ≠ 0)\n (i : Fin 6) (m : SourceMode 2) :\n Continuous (fun r => regularizedPinCoefficie" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedAdjustedCoefficient_continuous", + "line": 908, + "source_header": "const_mul 6\n\ntheorem regularizedAdjustedCoefficient_continuous {L : ℝ} (hL : L ≠ 0)\n (i : Fin 6) (m : SourceMode 2) :\n Continuous (fun r => regularizedAdjustedCoefficie" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedPinCoefficient_zero", + "line": 940, + "source_header": "nfluentLimits\n\ntheorem regularizedPinCoefficient_zero (L : ℝ) (i : Fin 6) (m : SourceMode 2) :\n regularizedPinCoefficient L 0 i m = contactPinCoef" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedAdjustedCoefficient_zero", + "line": 966, + "source_header": "2.2, one_mul]\n\ntheorem regularizedAdjustedCoefficient_zero (L : ℝ) (i : Fin 6) (m : SourceMode 2) :\n regularizedAdjustedCoefficient L 0 i m = contactAdjustedCoef" + }, + { + "kind": "def", + "unqualified_name": "regularizedPinCovariance", + "line": 998, + "source_header": "ficientLimits\n\ndef regularizedPinCovariance (L r : ℝ) : Matrix (Fin" + }, + { + "kind": "def", + "unqualified_name": "regularizedCrossCovariance", + "line": 1001, + "source_header": "cient L r j m\n\ndef regularizedCrossCovariance (L r : ℝ) : Matrix (Fin" + }, + { + "kind": "def", + "unqualified_name": "regularizedEndpointCovariance", + "line": 1004, + "source_header": "cient L r j m\n\ndef regularizedEndpointCovariance (L r : ℝ) : Matrix (Fin" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedGram_continuous", + "line": 1007, + "source_header": "cient L r j m\n\nprivate theorem regularizedGram_continuous {L : ℝ} (hL : L ≠ 0)\n (a b : ℝ → Fin 6 → SourceMode 2 → ℝ)\n (ha : ∀ i m, Continuous (fun r => a r i m))\n (hb : ∀ i m, Continuous (fun r => b r i m))\n (hba : ∀ r i m, ‖a r i m‖ ≤ confluentModeMajorant L m)\n (hbb : ∀ r i m, ‖b r i m‖ ≤ confluentModeMajorant L m) :\n Continuous (fun r => (fun i j => ∑' m, a r i m * b r j m : Matrix (Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedPinCovariance_continuous", + "line": 1028, + "source_header": "t_nonneg L m)\n\ntheorem regularizedPinCovariance_continuous {L : ℝ} (hL : L ≠ 0) :\n Continuous (regularizedPin" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedCrossCovariance_continuous", + "line": 1034, + "source_header": "ent_bound hL)\n\ntheorem regularizedCrossCovariance_continuous {L : ℝ} (hL : L ≠ 0) :\n Continuous (regularizedCross" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedEndpointCovariance_continuous", + "line": 1040, + "source_header": "ent_bound hL)\n\ntheorem regularizedEndpointCovariance_continuous {L : ℝ} (hL : L ≠ 0) :\n Continuous (regularizedEndpoint" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovarianceAt_eq_regularized", + "line": 1046, + "source_header": "ent_bound hL)\n\ntheorem sourcePinCovarianceAt_eq_regularized {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n sourcePinCovarianceAt L r = regularizedPinC" + }, + { + "kind": "theorem", + "unqualified_name": "sourceCrossCovarianceAt_eq_regularized", + "line": 1055, + "source_header": "d L r hr j m]\n\ntheorem sourceCrossCovarianceAt_eq_regularized {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n sourceCrossCovarianceAt L r = regularizedCrossC" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointCovarianceAt_eq_regularized", + "line": 1064, + "source_header": "d L r hr j m]\n\ntheorem sourceEndpointCovarianceAt_eq_regularized {L : ℝ} (hL : L ≠ 0) (r : ℝ) (hr : r ≠ 0) :\n sourceEndpointCovarianceAt L r = regularizedEndpointC" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedPinCovariance_zero", + "line": 1073, + "source_header": "d L r hr j m]\n\ntheorem regularizedPinCovariance_zero {L : ℝ} (hL : L ≠ 0) :\n regularizedPinCovariance L 0 = sourcePi" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedCrossCovariance_zero", + "line": 1080, + "source_header": "ficient_zero]\n\ntheorem regularizedCrossCovariance_zero {L : ℝ} (hL : L ≠ 0) :\n regularizedCrossCovariance L 0 = sourceContactEndpointCros" + }, + { + "kind": "theorem", + "unqualified_name": "regularizedEndpointCovariance_zero", + "line": 1087, + "source_header": "ficient_zero]\n\ntheorem regularizedEndpointCovariance_zero {L : ℝ} (hL : L ≠ 0) :\n regularizedEndpointCovariance L 0 = sourceContactEndpoin" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovarianceAt_tendsto", + "line": 1094, + "source_header": "ficient_zero]\n\n/-- The actual confluent six-pin covariance converges to the literal contact\npin covariance. Only the source period is assumed nonzero. -/\ntheorem sourcePinCovarianceAt_tendsto {L : ℝ} (hL : L ≠ 0) :\n Tendsto (sourcePinCovarianceAt L) (𝓝[>] (0 : ℝ)) (𝓝 (sourcePi" + }, + { + "kind": "theorem", + "unqualified_name": "sourceCrossCovarianceAt_tendsto", + "line": 1104, + "source_header": "of_gt hr)).symm\n\n/-- The actual adjusted-endpoint/pin cross covariance has the stated literal\ncontact limit, with the pin corrections retained before division. -/\ntheorem sourceCrossCovarianceAt_tendsto {L : ℝ} (hL : L ≠ 0) :\n Tendsto (sourceCrossCovarianceAt L) (𝓝[>] (0 : ℝ))\n (𝓝 (sourceContactEndpointCr" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointCovarianceAt_tendsto", + "line": 1115, + "source_header": "e_of_gt hr)).symm\n\n/-- The actual pin-adjusted endpoint covariance converges to Cov(T,T), where\nT=(-fxxx/2,fxxx/2,-fxxy/2,fxxy/2,fyy,fyy) at the origin. -/\ntheorem sourceEndpointCovarianceAt_tendsto {L : ℝ} (hL : L ≠ 0) :\n Tendsto (sourceEndpointCovarianceAt L) (𝓝[>] (0 : ℝ))\n (𝓝 (sourceContactEnd" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceEndpointParameters.lean", + "sha256": "efc88ac59217ab1960d5518abcd9f16a71b42080a2810f1e337eeb2f686c1e3a", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_derivative_integral_zero", + "line": 29, + "source_header": "s\n\ntheorem smoothSourceField_derivative_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ℕ) (x : Fin d → ℝ) (u : Fin k → (Fin d → ℝ)) :\n (∫ ω, iteratedFDeriv ℝ k (smoothSourceField d L ω) x u ∂smoothLaw d L) =" + }, + { + "kind": "theorem", + "unqualified_name": "rawPinsWithHessians_integral_zero", + "line": 39, + "source_header": ")\n\ntheorem rawPinsWithHessians_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) (i : Fin 12) :\n (∫ ω, rawPinsWithHessians L r ω i ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "rawPinsWithHessians_integral_vector_zero", + "line": 52, + "source_header": "]\n\ntheorem rawPinsWithHessians_integral_vector_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n (∫ ω, rawPinsWithHessians L r ω ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePins_adjusted_integral_zero", + "line": 63, + "source_header": "i\n\ntheorem sourcePins_adjusted_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n (∫ ω, (sourceConfluentPinsAt L r ω, sourceAdjustedEndpoints L r ω) ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceConfluentPinsAt_integral_zero", + "line": 71, + "source_header": "h\n\ntheorem sourceConfluentPinsAt_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n (∫ ω, sourceConfluentPinsAt L r ω ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAdjustedEndpoints_integral_zero", + "line": 77, + "source_header": "h\n\ntheorem sourceAdjustedEndpoints_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n (∫ ω, sourceAdjustedEndpoints L r ω ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointResidual_integral_zero", + "line": 83, + "source_header": "h\n\ntheorem sourceEndpointResidual_integral_zero {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n (∫ ω, sourceEndpointResidual L r ω ∂smoothLaw 2 L) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointResidual_covariance", + "line": 92, + "source_header": "]\n\ntheorem sourceEndpointResidual_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (i j : Fin 6) :\n covariance (fun ω => sourceEndpointResidual L r ω i)\n (fun ω => sourceEndpointResidual L r ω j) (smoothLaw 2 L) =\n sourceEndpointCovarianceAt L r i j -\n (sourceCrossCovarianceAt L r * (sourcePinCovarianceAt L r)⁻¹ *\n (sourceCrossCovarianceAt L r)ᵀ) i" + }, + { + "kind": "lemma", + "unqualified_name": "finiteGaussian_law_parameters", + "line": 149, + "source_header": "l\n\nlemma finiteGaussian_law_parameters {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n : ℕ} {Z : Ω → Fin n → ℝ}\n (hZ : HasGaussianLaw Z P) (m : Fin n → ℝ) (hm : (∫ ω, Z ω ∂P) = m)\n (S : Matrix (Fin n) (Fin n) ℝ)\n (hcov : ∀ i j, covariance (fun ω => Z ω i) (fun ω => Z ω j) P = S i j) :\n S.PosSemidef ∧ P.map (fun ω => toLp 2 (Z ω)) = multivariateGaussian (toLp 2 m)" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointSchurAt", + "line": 190, + "source_header": "j\n\n/-- The actual adjusted-endpoint Schur covariance. -/\ndef sourceEndpointSchurAt (L r : ℝ) : Matrix (Fin 6) (Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointResidual_hasGaussianLaw", + "line": 195, + "source_header": "r)ᵀ\n\n/-- Gaussianity is inherited from the actual jointly Gaussian pin/endpoint vector. -/\ntheorem sourceEndpointResidual_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n HasGaussianLaw (sourceEndpointResidual L r) (smoothLaw" + }, + { + "kind": "def", + "unqualified_name": "sourceEndpointPosterior", + "line": 203, + "source_header": "ng hR\n\n/-- A literal posterior sample at a prescribed pin. -/\ndef sourceEndpointPosterior (L r : ℝ) (x : Fin 6 → ℝ) (ω : SmoothSample 2 L) : Fi" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointPosterior_hasGaussianLaw", + "line": 207, + "source_header": "t L r x\n\ntheorem sourceEndpointPosterior_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) : HasGaussianLaw (sourceEndpointPosterior L r x) (smoothL" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointPosterior_integral", + "line": 217, + "source_header": "]\n rfl\n\ntheorem sourceEndpointPosterior_integral {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) : (∫ ω, sourceEndpointPosterior L r x ω ∂smoothLaw 2 L) =\n sourceRegressionMapA" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointPosterior_covariance", + "line": 226, + "source_header": "simp\n\ntheorem sourceEndpointPosterior_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) (i j : Fin 6) :\n covariance (fun ω => sourceEndpointPosterior L r x ω i)\n (fun ω => sourceEndpointPosterior L r x ω j) (smoothLaw 2 L) =\n sourceEndpointSchurAt" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_eq_map_posterior", + "line": 239, + "source_header": "hG i j\n\n/-- The canonical all-pin law is the literal posterior sampling map. -/\ntheorem sourceEndpointKernel_eq_map_posterior {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) : sourceEndpointKernel L r x =\n (smoothLaw 2 L).map (sourceEndpointPosteri" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_isGaussian", + "line": 248, + "source_header": "le]\n rfl\n\ntheorem sourceEndpointKernel_isGaussian {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) : IsGaussian (sourceEndpointKern" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointSchurAt_posSemidef", + "line": 253, + "source_header": "ssian_map\n\n/-- Positive semidefiniteness follows from the actual residual covariance, including singular cases. -/\ntheorem sourceEndpointSchurAt_posSemidef {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) : (sourceEndpointSchurAt L r)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_eq_multivariateGaussian", + "line": 260, + "source_header": "r hG 0)).1\n\n/-- Exact literal multivariate Gaussian law at every prescribed pin, with no residual PSD premise. -/\ntheorem sourceEndpointKernel_eq_multivariateGaussian {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) :\n (sourceEndpointKernel L r x).map (toLp 2) =\n multivariateGaussian (toLp 2 (sourceRegressionMapAt L r x)) (sourceEndpoin" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_integral", + "line": 272, + "source_header": "hL r hG x)).2\n\n/-- The original Pi-space kernel mean is the actual regression mean. -/\ntheorem sourceEndpointKernel_integral {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (x : Fin 6 → ℝ) : (∫ v, v ∂sourceEndpointKernel L r x) = sourceRegres" + }, + { + "kind": "theorem", + "unqualified_name": "sourceEndpointKernel_covariance", + "line": 279, + "source_header": "integral hL r x\n\n/-- The original Pi-space kernel covariance is the derived actual Schur covariance. -/\ntheorem sourceEndpointKernel_covariance {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) (x : Fin 6 → ℝ) (i j : Fin 6) :\n covariance (fun v => v i) (fun v => v j) (sourceEndpointKernel L r x) =\n sourceEndpoi" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceContactSchur.lean", + "sha256": "2fe122a50ec1889b579558d80086251d87ed0cec2420d268ab1d04f6bfff4409", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sourcePinVector", + "line": 25, + "source_header": "t\n\n/-- Literal six-pin observations in their source order. -/\ndef sourcePinVector (L : ℝ) (ω : SmoothSample 2 L) (i : Fin 6)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactQ", + "line": 29, + "source_header": "ucc\n\n/-- Literal remaining curvature coordinate Q=fyy. -/\ndef sourceContactQ (L : ℝ) (ω : SmoothSample 2 L" + }, + { + "kind": "def", + "unqualified_name": "sourcePinCovariance", + "line": 33, + "source_header": "L ω 6\n\n/-- Principal covariance of the literal six origin pin coordinates. -/\ndef sourcePinCovariance (L : ℝ) : Matrix (Fin 6) (F" + }, + { + "kind": "def", + "unqualified_name": "sourceContactCross", + "line": 37, + "source_header": "astSucc\n\n/-- Covariance of each literal pin coordinate with the remaining curvature Q=fyy. -/\ndef sourceContactCross (L : ℝ) (i : F" + }, + { + "kind": "def", + "unqualified_name": "sourceContactQVariance", + "line": 41, + "source_header": "astSucc 6\n\n/-- Literal Q covariance with itself. -/\ndef sourceContactQVariance" + }, + { + "kind": "def", + "unqualified_name": "sourceContactCrossMatrix", + "line": 44, + "source_header": "iance L 6 6\n\ndef sourceContactCrossMatrix (L : ℝ) : Matrix (Fi" + }, + { + "kind": "def", + "unqualified_name": "sourceContactQMatrix", + "line": 47, + "source_header": "ctCross L i\n\ndef sourceContactQMatrix (L : ℝ) : Matrix" + }, + { + "kind": "def", + "unqualified_name": "sourceContactSchur", + "line": 50, + "source_header": "QVariance L\n\n/-- The scalar Schur complement of the actual six-pin covariance. -/\ndef sourceContactSchu" + }, + { + "kind": "def", + "unqualified_name": "sourceContactBlockEquiv", + "line": 55, + "source_header": "ntactCross L)\n\n/-- Exact 6+1 splitting of the source's seven origin coordinates. -/\ndef sourceContactBlockEquiv : (Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactCovariance_block_identity", + "line": 67, + "source_header": "cases u\n rfl\n\n/-- The literal covariance equals the stated six-pin/Q blocks under the exact coordinate split. -/\ntheorem sourceContactCovariance_block_identity (L : ℝ) :\n (sourceContactCovariance L).submatrix sourceContactBlockEquiv sourceContactBlockEquiv =\n Matrix.fromBlocks (sourcePinCovariance L) (sourceContactCrossMatrix L)\n (sourceContactCrossMatrix L)ᴴ (source" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovariance_posDef", + "line": 89, + "source_header": "v => cases v; rfl\n\ntheorem sourcePinCovariance_posDef {L : ℝ} (hL : L ≠ 0) :\n (sourcePinCov" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePinCovariance_isUnit", + "line": 93, + "source_header": "Succ_injective 6)\n\ntheorem sourcePinCovariance_isUnit {L : ℝ} (hL : L ≠ 0) :\n IsUnit (sourc" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactQVariance_eq_variance", + "line": 102, + "source_header": "Unit hL).invertible\n\ntheorem sourceContactQVariance_eq_variance {L : ℝ} (hL : L ≠ 0) :\n sourceContactQVariance L =\n Var[fun ω => sourceContactVector L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactSchur_pos", + "line": 107, + "source_header": "val 6).aemeasurable\n\n/-- Strict positivity of the actual curvature Schur variance follows from the literal contact law. -/\ntheorem sourceContactSchur_pos {L : ℝ} (hL : L ≠ 0) :\n 0 <" + }, + { + "kind": "lemma", + "unqualified_name": "contact_residual_variance_of_isUnit_covariance", + "line": 129, + "source_header": "heq] at hs\n exact hs\n\n/-- Finite Gaussian applications use this L² covariance identity; its normal equations are derived. -/\nlemma contact_residual_variance_of_isUnit_covariance {Ω ι : Type*} [MeasurableSpace Ω]\n [Fintype ι] [DecidableEq ι] {P : Measure Ω} [IsFiniteMeasure P]\n (J : Ω → ι → ℝ) (Q : Ω → ℝ)\n (hJ : ∀ i, MemLp (fun ω => J ω i) 2 P) (hQ : MemLp Q 2 P)\n (hG : IsUnit (Matrix.of (fun i j =>\n covariance (fun ω => J ω i) (fun ω => J ω j) P) : Matrix ι ι ℝ)) :" + }, + { + "kind": "def", + "unqualified_name": "sourceContactResidual", + "line": 173, + "source_header": "roduct_comm b a]\n ring\n\n/-- The actual least-squares curvature residual, without replacing the torus covariance. -/\ndef sourceContactResidual (L : ℝ) (" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactResidual_variance", + "line": 178, + "source_header": "L) ⬝ᵥ sourcePinVector L ω\n\n/-- The strictly positive Schur complement is the actual curvature residual variance. -/\ntheorem sourceContactResidual_variance {L : ℝ} (hL : L ≠ 0) :\n Var[sourceContactResidual L; smoothLaw" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactResidual_variance_pos", + "line": 200, + "source_header": "_eq_variance hL]\n exact hv\n\ntheorem sourceContactResidual_variance_pos {L : ℝ} (hL : L ≠ 0) :\n 0 < Var[sourceContac" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourceContactCovariance.lean", + "sha256": "4189cbaf4c18c55f21e3af2c96b0b2842d83161f44596eb691c507dcc1a439c8", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "contactOrder", + "line": 17, + "source_header": "t\n\ndef contactOrder : Fin 7 →" + }, + { + "kind": "def", + "unqualified_name": "contactE0", + "line": 19, + "source_header": "]\n\ndef contactE0 : Fin 2 →" + }, + { + "kind": "def", + "unqualified_name": "contactE1", + "line": 21, + "source_header": "]\ndef contactE1 : Fin 2 →" + }, + { + "kind": "def", + "unqualified_name": "contactDirections", + "line": 22, + "source_header": "]\n\ndef contactDirections : (i : Fin 7) → Fin (contactOrder i) → (Fin 2 → ℝ" + }, + { + "kind": "def", + "unqualified_name": "sourceContactVector", + "line": 31, + "source_header": ")\n\ndef sourceContactVector (L : ℝ) (ω : SmoothSample 2 L) (i : Fin 7) :" + }, + { + "kind": "def", + "unqualified_name": "sourceContactCoefficient", + "line": 34, + "source_header": ")\n\ndef sourceContactCoefficient (L : ℝ) (i : Fin 7) (m : SourceMode 2) :" + }, + { + "kind": "def", + "unqualified_name": "sourceContactCovariance", + "line": 37, + "source_header": "m\n\ndef sourceContactCovariance (L : ℝ) : Matrix (Fin 7) (Fin 7)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactVector_hasGaussianLaw", + "line": 41, + "source_header": "]\n\ntheorem sourceContactVector_hasGaussianLaw {L : ℝ} (hL : L ≠ 0) :\n HasGaussianLaw (sourceContactVector L) (smoothLaw 2 L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactCoefficient_summable", + "line": 46, + "source_header": "s\n\ntheorem sourceContactCoefficient_summable {L : ℝ} (hL : L ≠ 0) (i : Fin 7) :\n Summable (sourceContactCoefficient L i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactCovariance_eq_coefficientGram", + "line": 50, + "source_header": ")\n\ntheorem sourceContactCovariance_eq_coefficientGram {L : ℝ} (hL : L ≠ 0) :\n sourceContactCovariance L = coefficientGram (sourceContactCoefficient L" + }, + { + "kind": "def", + "unqualified_name": "frequency10", + "line": 56, + "source_header": ")\n\nprivate def frequency10 : ↥(halfLattice 2" + }, + { + "kind": "def", + "unqualified_name": "frequency01", + "line": 61, + "source_header": "⟩\n\nprivate def frequency01 : ↥(halfLattice 2" + }, + { + "kind": "def", + "unqualified_name": "frequency11", + "line": 66, + "source_header": "⟩\n\nprivate def frequency11 : ↥(halfLattice 2" + }, + { + "kind": "def", + "unqualified_name": "frequency20", + "line": 71, + "source_header": "⟩\n\nprivate def frequency20 : ↥(halfLattice 2" + }, + { + "kind": "def", + "unqualified_name": "sourceContactMode", + "line": 76, + "source_header": "⟩\n\n/-- DC, cos(1,0), cos(0,1), cos(1,1), sin(1,0), sin(2,0), sin(0,1).\nThe frequency subtypes retain the canonical half-lattice membership proofs. -/\ndef sourceContactMode : Fin 7 → SourceMod" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactMode_nonzero_frequency", + "line": 82, + "source_header": "e)]\n\ntheorem sourceContactMode_nonzero_frequency (s : Fin 7) :\n match sourceContactMode s with\n | none => True\n | some (k, _) => (k : Fin 2 → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "sourceModeAmplitude", + "line": 90, + "source_header": "rty\n\ndef sourceModeAmplitude (L : ℝ) (m : SourceMode 2)" + }, + { + "kind": "def", + "unqualified_name": "sourceContactAmplitude", + "line": 94, + "source_header": "L)\n\ndef sourceContactAmplitude (L : ℝ) (s : Fin 7)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactAmplitude_pos", + "line": 97, + "source_header": "s)\n\ntheorem sourceContactAmplitude_pos {L : ℝ} (hL : L ≠ 0) (s : Fin 7) :\n 0 < sourceContactAmplitude" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_none", + "line": 109, + "source_header": "s _\n\nprivate theorem derivativeCoefficient_none (L : ℝ) (k : ℕ)\n (u : Fin k → (Fin 2 → ℝ)) :\n derivativeCoefficient 2 L k 0 u none = if k = 0 then Real.sqrt (1 / sourceZ 2 L) els" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeCoefficient_some", + "line": 121, + "source_header": "rfl\n\nprivate theorem derivativeCoefficient_some (L : ℝ) (k : ↥(halfLattice 2)) (b : Bool)\n (n : ℕ) (u : Fin n → (Fin 2 → ℝ)) :\n derivativeCoefficient 2 L n 0 u (some (k,b)) =\n Real.sqrt (2 * sourceWeight 2 L k / sourceZ 2 L) *\n ((∏ j, phaseCLM 2 L k (u j)) *\n iteratedDeriv n (if b then Real.sin else Real.cos)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContact_selected_columns", + "line": 145, + "source_header": "in\n/-- These are literal differentiated source columns, with the actual Fourier\namplitudes, rather than assumed witness columns or a finite-mode replacement. -/\ntheorem sourceContact_selected_columns (L : ℝ) (i s : Fin 7) :\n sourceContactCoefficient L i (sourceContactMode s) =\n sourceContactAmplitude L s * contactWitness (sourceC L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceContactCovariance_posDef", + "line": 166, + "source_header": "simp\n\n/-- Positive definiteness of the actual contact covariance, obtained from its\ninfinite coefficient Gram sum and seven proved canonical source columns. -/\ntheorem sourceContactCovariance_posDef {L : ℝ} (hL : L ≠ 0) :\n (sourceContactCovariance L)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/SourcePhysicalEndpointKernel.lean", + "sha256": "689ced2a760b38333b0224f19af52812d0057527d5a790ba50116cb5f07b7e3a", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "sourcePhysicalCorrection", + "line": 22, + "source_header": "l\n\n/-- The literal correction from adjusted entries to physical normalized endpoint entries. -/\ndef sourcePhysicalCorrection (r : ℝ) : (Fin 6 → ℝ) →L[ℝ] (Fin 6 → ℝ) where\n toFu" + }, + { + "kind": "def", + "unqualified_name": "sourcePhysicalRegressionMap", + "line": 29, + "source_header": "rop\n\ndef sourcePhysicalRegressionMap (L r : ℝ) : (Fin 6 → ℝ) →L[ℝ] (Fin 6 →" + }, + { + "kind": "theorem", + "unqualified_name": "sourceNormalizedEndpoints_eq_adjusted", + "line": 32, + "source_header": "n r\n\n/-- A pointwise identity for the actual source observations, at every separation. -/\ntheorem sourceNormalizedEndpoints_eq_adjusted (L r : ℝ) (ω : SmoothSample 2 L) :\n sourceNormalizedEndpoints L r ω =\n sourceAdjustedEndpoints L r ω + sourcePhysicalCorrection r (sourceConfluentPinsAt L" + }, + { + "kind": "def", + "unqualified_name": "sourcePhysicalEndpointKernel", + "line": 40, + "source_header": "ring\n\n/-- The physical canonical kernel retains exactly the same actual adjusted residual law. -/\ndef sourcePhysicalEndpointKernel (L r : ℝ) : Kernel (Fin 6 → ℝ) (Fin" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_markov", + "line": 45, + "source_header": "r) 0 0\n\ntheorem sourcePhysicalEndpointKernel_markov {L : ℝ} (hL : L ≠ 0) (r : ℝ) :\n IsMarkovKernel (sourcePhysicalEndpointKern" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_measurable", + "line": 51, + "source_header": "nstance\n\ntheorem sourcePhysicalEndpointKernel_measurable (L r : ℝ) :\n Measurable (sourcePhysicalEndpointKern" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_apply", + "line": 54, + "source_header": "rable _\n\n/-- Its all-pin pushforward is literal, rather than an almost-everywhere kernel identity. -/\ntheorem sourcePhysicalEndpointKernel_apply {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :\n sourcePhysicalEndpointKernel L r x =\n ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map\n (fun v => v + sourceRegressionMapAt L r x + sourcePhysicalCorrec" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_hasCondDistrib", + "line": 65, + "source_header": "r) 0 0 x\n\n/-- The physical observations have this canonical conditional law, derived from the actual residual. -/\ntheorem sourcePhysicalEndpointKernel_hasCondDistrib {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n HasCondDistrib (sourceNormalizedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourcePhysicalEndpointKernel L r) (smo" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalCorrection_prescribed", + "line": 89, + "source_header": "ply]\n abel\n\n/-- The explicit physical correction is zero at every prescribed pin, for arbitrary height. -/\ntheorem sourcePhysicalCorrection_prescribed (r b : ℝ) :\n sourcePhysicalCorrection r (sourcePrescribed" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_at_prescribed", + "line": 95, + "source_header": "escribedPins]\n\n/-- Equality at the prescribed null pin is equality of the two literal canonical measures. -/\ntheorem sourcePhysicalEndpointKernel_at_prescribed {L : ℝ} (hL : L ≠ 0) (r b : ℝ) :\n sourcePhysicalEndpointKernel L r (sourcePrescribedPins r b) =\n sourceEndpointKernel L r (sourcePres" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_integral", + "line": 103, + "source_header": "only [add_zero]\n\n/-- The physical kernel has the extra pin-dependent correction in its mean away from the prescribed fiber. -/\ntheorem sourcePhysicalEndpointKernel_integral {L : ℝ} (hL : L ≠ 0) (r : ℝ) (x : Fin 6 → ℝ) :\n (∫ v, v ∂sourcePhysicalEndpointKernel L r x) =\n sourceRegressionMapAt L r x + sourcePhysi" + }, + { + "kind": "theorem", + "unqualified_name": "sourcePhysicalEndpointKernel_spec", + "line": 117, + "source_header": "zero hL r]\n simp\n\n/-- All-point physical kernel specification; no residual hypothesis is assumed. -/\ntheorem sourcePhysicalEndpointKernel_spec {L : ℝ} (hL : L ≠ 0) (r : ℝ)\n (hG : IsUnit (sourcePinCovarianceAt L r)) :\n IsMarkovKernel (sourcePhysicalEndpointKernel L r) ∧\n Measurable (sourcePhysicalEndpointKernel L r) ∧\n (∀ x, sourcePhysicalEndpointKernel L r x =\n ((smoothLaw 2 L).map (sourceEndpointResidual L r)).map\n (fun v => v + sourceRegressionMapAt L r x + sourcePhysicalCorrection r x)) ∧\n HasCondDistrib (sourceNormalizedEndpoints L r) (sourceConfluentPinsAt L r)\n (sourcePhysicalEndpointKernel L" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/GaussianWeightedMajorants.lean", + "sha256": "3bde84aa83d02b364ca17f242cc5dbca83908c02f2f75649075d7da6a3d1bfd0", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "weightedAbsSeries", + "line": 26, + "source_header": "t\n\ndef weightedAbsSeries {I Ω : Type*} (w : I → ℝ) (U : I → Ω → ℝ) (ω : Ω) :" + }, + { + "kind": "def", + "unqualified_name": "standardAbsMoment", + "line": 29, + "source_header": "|\n\ndef standardAbsMoment (n : ℕ) :" + }, + { + "kind": "theorem", + "unqualified_name": "standardAbsMoment_integrable", + "line": 31, + "source_header": "1\n\ntheorem standardAbsMoment_integrable (n : ℕ) :\n Integrable (fun z : ℝ => |z| ^ n) (gaussianReal 0 1" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_nonneg", + "line": 36, + "source_header": "'\n\ntheorem weightedAbsSeries_nonneg {I Ω : Type*} (w : I → ℝ) (U : I → Ω → ℝ)\n (hw0 : ∀ i, 0 ≤ w i) (ω : Ω) : 0 ≤ weightedAbsSeries w U" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_measurable", + "line": 40, + "source_header": ")\n\ntheorem weightedAbsSeries_measurable {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (w : I → ℝ) (U : I → Ω → ℝ) (hU : ∀ i, Measurable (U i)) :\n Measurable (weightedAbsSeries w U" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_eLpNorm", + "line": 45, + "source_header": ")\n\nprivate theorem coordinate_eLpNorm {I Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)\n (w : I → ℝ) (U : I → Ω → ℝ) (hw0 : ∀ i, 0 ≤ w i)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P) (p : ℝ≥0∞) (i : I) :\n eLpNorm (fun ω => w i * |U i ω|) p P =\n ENNReal.ofReal (w i) * eLpNorm id p (gaussianReal 0 1" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_memLp_bound", + "line": 67, + "source_header": "]\n\ntheorem weightedAbsSeries_memLp_bound {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)\n (p : ℝ≥0) (hp : 1 ≤ p) :\n MemLp (weightedAbsSeries w U) p P ∧\n eLpNorm (weightedAbsSeries w U) p P ≤\n ENNReal.ofReal (∑' i, w i) * eLpNorm id p (gaussianReal 0 1" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_ae_summable", + "line": 110, + "source_header": "⟩\n\ntheorem weightedAbsSeries_ae_summable {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (_hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P) :\n ∀ᵐ ω ∂P, Summable (fun i => w i * |U i ω|" + }, + { + "kind": "theorem", + "unqualified_name": "eLpNorm_nat_pow_integral", + "line": 124, + "source_header": "ω\n\nprivate theorem eLpNorm_nat_pow_integral {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (f : Ω → ℝ) (hf : AEStronglyMeasurable f P)\n (hnonneg : ∀ ω, 0 ≤ f ω) (n : ℕ) (hn : n ≠ 0)\n (hint : Integrable (fun ω => f ω ^ n) P) :\n eLpNorm f n P ^ n = ENNReal.ofReal (∫ ω, f ω ^ n ∂P" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_moment", + "line": 138, + "source_header": "]\n\ntheorem weightedAbsSeries_moment {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P) (n : ℕ) :\n Integrable (fun ω => weightedAbsSeries w U ω ^ n) P ∧\n (∫ ω, weightedAbsSeries w U ω ^ n ∂P) ≤\n (∑' i, w i) ^ n * standardAbsMoment" + }, + { + "kind": "lemma", + "unqualified_name": "exp_mul_abs_le", + "line": 173, + "source_header": "w\n\n/- Exponential support coauthored by\n/root/normalizer_palm_research/gaussian_reference_probe. -/\n\nprivate lemma exp_mul_abs_le (s x : ℝ) :\n Real.exp (s * |x|) ≤ Real.exp (s*x) + Real.exp ((-s)" + }, + { + "kind": "theorem", + "unqualified_name": "foldedGaussian_exp", + "line": 186, + "source_header": "x)]\n\nprivate theorem foldedGaussian_exp (s : ℝ) :\n Integrable (fun z : ℝ => Real.exp (s * |z|)) (gaussianReal 0 1) ∧\n (∫ z : ℝ, Real.exp (s * |z|) ∂gaussianReal 0 1) ≤ 2*Real.exp (s^2" + }, + { + "kind": "lemma", + "unqualified_name": "finite_exp_jensen", + "line": 208, + "source_header": "ing\n\nprivate lemma finite_exp_jensen {I : Type*} (s : Finset I) (w x : I → ℝ)\n (W t : ℝ) (hW : 0 < W) (hw : ∀ i, 0 ≤ w i)\n (hsum : ∑ i ∈ s, w i ≤ W) :\n Real.exp (t * ∑ i ∈ s, w i * |x i|) ≤\n (1-∑ i ∈ s, w i/W) + ∑ i ∈ s, (w i/W)*Real.exp (t*W*|x" + }, + { + "kind": "lemma", + "unqualified_name": "finite_exp_integrable_bound", + "line": 229, + "source_header": "hj\n\nprivate lemma finite_exp_integrable_bound {I Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (s : Finset I) (w : I → ℝ)\n (U : I → Ω → ℝ) (hmeas : ∀ i, Measurable (U i))\n (W t K : ℝ) (hW : 0 < W) (hw : ∀ i, 0 ≤ w i)\n (hsum : ∑ i ∈ s, w i ≤ W) (hK : 1 ≤ K)\n (hUi : ∀ i, Integrable (fun ω => Real.exp (t*W*|U i ω|)) P)\n (hUb : ∀ i, (∫ ω, Real.exp (t*W*|U i ω|) ∂P) ≤ K) :\n Integrable (fun ω => Real.exp (t*∑ i ∈ s, w i*|U i ω|)) P ∧\n (∫ ω, Real.exp (t*∑ i ∈ s, w i*|U i ω|) ∂P)" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_exp_posWeight", + "line": 269, + "source_header": "ith\n\n\nprivate theorem weightedAbsSeries_exp_posWeight {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (hmeas : ∀ i, Measurable (U i)) (hw : ∀ i, 0 ≤ w i) (hws : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)\n (haesum : ∀ᵐ ω ∂P, Summable (fun i => w i*|U i ω|))\n (hW : 0 < ∑' i, w i) (t : ℝ) :\n Integrable (fun ω => Real.exp (t*weightedAbsSeries w U ω)) P ∧\n (∫ ω, Real.exp (t*weightedAbsSeries w U ω) ∂P) ≤\n 2*Real.exp (t^2*(∑' i, w i)^2" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_exp_bound", + "line": 334, + "source_header": "W]\n\n\ntheorem weightedAbsSeries_exp_bound {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (hmeas : ∀ i, Measurable (U i)) (hw : ∀ i, 0 ≤ w i) (hws : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)\n (t : ℝ) :\n Integrable (fun ω => Real.exp (t*weightedAbsSeries w U ω)) P ∧\n (∫ ω, Real.exp (t*weightedAbsSeries w U ω) ∂P) ≤\n 2*Real.exp (t^2*(∑' i, w i)^2" + }, + { + "kind": "theorem", + "unqualified_name": "weightedAbsSeries_upper_tail", + "line": 357, + "source_header": ") t\n\n\n/-- Exponential Markov with t=R/W² gives the Gaussian upper tail without independence. -/\ntheorem weightedAbsSeries_upper_tail {I Ω : Type*} [Countable I] [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P] (w : I → ℝ) (U : I → Ω → ℝ)\n (hU : ∀ i, Measurable (U i)) (hw0 : ∀ i, 0 ≤ w i) (hw : Summable w)\n (hlaw : ∀ i, HasLaw (U i) (gaussianReal 0 1) P)\n (hW : 0 < ∑' i, w i) (R : ℝ) (hR : 0 ≤ R) :\n P.real {ω | R ≤ weightedAbsSeries w U ω} ≤\n 2 * Real.exp (-(R ^ 2) / (2 * (∑' i, w i)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceSmooth.lean", + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "orderCoordinateBound", + "line": 24, + "source_header": "h\n\ndef orderCoordinateBound (n : ℕ) (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderProductBound", + "line": 27, + "source_header": "n\n\ndef orderProductBound (n d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderPairedBound", + "line": 30, + "source_header": ")\n\ndef orderPairedBound (n d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderModeBound", + "line": 33, + "source_header": "k\n\ndef orderModeBound (n d : ℕ) (L : ℝ) (m : SourceMode d) :" + }, + { + "kind": "theorem", + "unqualified_name": "orderCoordinateBound_summable", + "line": 38, + "source_header": "k\n\ntheorem orderCoordinateBound_summable (n : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderCoordinateBound n a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderProductBound_summable", + "line": 59, + "source_header": "g\n\ntheorem orderProductBound_summable (n d : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderProductBound n d a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_summable", + "line": 64, + "source_header": "d\n\ntheorem orderPairedBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderPairedBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_eq_amplitude", + "line": 68, + "source_header": "_\n\ntheorem orderPairedBound_eq_amplitude (n d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : Fin d → ℤ) :\n orderPairedBound n d L k =\n Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_nonneg", + "line": 92, + "source_header": "g\n\ntheorem orderModeBound_nonneg (n d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_summable", + "line": 100, + "source_header": "y\n\ntheorem orderModeBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_four", + "line": 115, + "source_header": "e\n\ntheorem orderModeBound_four (d : ℕ) (L : ℝ) (m : SourceMode d) :\n orderModeBound 4 d L m = modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_order_bound", + "line": 119, + "source_header": "l\n\ntheorem modeCoefficient_iteratedFDeriv_order_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ orderModeBound j d L" + }, + { + "kind": "def", + "unqualified_name": "goodSample", + "line": 179, + "source_header": "]\n\n/-- One explicit coefficient event, shared by every derivative order. -/\ndef goodSample (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : P" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_ae", + "line": 183, + "source_header": "m|)\n\ntheorem goodSample_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, goodSample d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_of_goodSample", + "line": 190, + "source_header": "hL)\n\ntheorem sourceField_smooth_of_goodSample (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (hω : goodSample d L ω) :\n ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_ae", + "line": 222, + "source_header": "m))\n\ntheorem sourceField_smooth_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_congr_cofinite", + "line": 227, + "source_header": "hω\n\n/-- The carrier depends only on the coefficient tail; finite coordinate changes\ncannot destroy any derivative-order summability condition. -/\ntheorem goodSample_congr_cofinite (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (hωη : ω =ᶠ[Filter.cofinite] η) :\n goodSample d L ω ↔ goodSample" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_finite_change_iff", + "line": 242, + "source_header": "[hm]\n\ntheorem goodSample_finite_change_iff (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))\n (hωη : ∀ m ∉ s, ω m = η m) :\n goodSample d L ω ↔ goodSample" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceSmoothCarrier.lean", + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "goodSet", + "line": 30, + "source_header": "r\n\n/-- The actual common coefficient event, with no smoothness premise added. -/\ndef goodSet (d : ℕ) (L : ℝ) : Set (SourceMode d →" + }, + { + "kind": "def", + "unqualified_name": "orderAbsNN", + "line": 34, + "source_header": "ω}\n\nprivate def orderAbsNN (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ)\n (m : SourceMode d) :" + }, + { + "kind": "def", + "unqualified_name": "orderAbsTotal", + "line": 39, + "source_header": "_)⟩\n\nprivate def orderAbsTotal (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_ne_top_iff", + "line": 42, + "source_header": "0∞)\n\nprivate theorem orderAbsTotal_ne_top_iff (n d : ℕ) (L : ℝ)\n (ω : SourceMode d → ℝ) :\n orderAbsTotal n d L ω ≠ ∞ ↔\n Summable (fun m => orderModeBound n d L m * |ω" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_measurable", + "line": 48, + "source_header": "ω)\n\nprivate theorem orderAbsTotal_measurable (n d : ℕ) (L : ℝ) :\n Measurable (orderAbsTotal n d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measurable", + "line": 62, + "source_header": "eal\n\ntheorem goodSet_measurable (d : ℕ) (L : ℝ) : MeasurableSet (goodSet d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_ae", + "line": 75, + "source_header": "imp\n\ntheorem goodSet_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ω ∈ goodSet" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measure_one", + "line": 79, + "source_header": "hL\n\ntheorem goodSet_measure_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceLaw d (goodSet d L)" + }, + { + "kind": "abbrev", + "unqualified_name": "SmoothSample", + "line": 83, + "source_header": "hL)\n\n/-- A coefficient sample on the explicit all-order summability carrier. -/\nabbrev SmoothSample (d : ℕ) (L" + }, + { + "kind": "def", + "unqualified_name": "sampleInclusion", + "line": 86, + "source_header": "d L)\n\n/-- Literal inclusion, retaining every coefficient of the original sample. -/\ndef sampleInclusion (d : ℕ) (L : ℝ) : SmoothSample d L → (SourceMode" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurable", + "line": 90, + "source_header": "ype.val\n\ntheorem sampleInclusion_measurable (d : ℕ) (L : ℝ) :\n Measurable (sampleInclusi" + }, + { + "kind": "def", + "unqualified_name": "smoothLaw", + "line": 94, + "source_header": "ype_coe\n\n/-- Pull back the original product law; no normalization or new law is chosen. -/\ndef smoothLaw (d : ℕ) (L : ℝ) : Measure (SmoothSa" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_map", + "line": 98, + "source_header": "sion d L)\n\ntheorem sampleInclusion_map (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n (smoothLaw d L).map (sampleInclusion d L) = so" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurePreserving", + "line": 105, + "source_header": "ae d hL)]\n\ntheorem sampleInclusion_measurePreserving (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothLaw_isProbabilityMeasure", + "line": 109, + "source_header": "map d hL⟩\n\ntheorem smoothLaw_isProbabilityMeasure (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsProbabilityMeasure (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "observation_map_eq", + "line": 114, + "source_header": "t_ae d hL\n\n/-- Every measurable observation has exactly its original pushforward law. -/\ntheorem observation_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :\n (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceL" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 121, + "source_header": "n_map d hL]\n\ntheorem coordinate_marginal (d : ℕ) {L : ℝ} (hL : L ≠ 0) (m : SourceMode d) :\n (smoothLaw d L).map (fun ω => sampleInclusion d L ω m) = gauss" + }, + { + "kind": "theorem", + "unqualified_name": "finiteCoordinate_map_eq", + "line": 126, + "source_header": "_marginal m\n\ntheorem finiteCoordinate_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (m : Fin n → SourceMode d) :\n (smoothLaw d L).map (fun ω j => sampleInclusion d L ω (m j)) =\n (sourceLaw d).map (fun ω j" + }, + { + "kind": "def", + "unqualified_name": "smoothSourceField", + "line": 132, + "source_header": "ply (m j)))\n\n/-- The unchanged literal real-cover field, evaluated on the carrier. -/\ndef smoothSourceField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : F" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_contDiff", + "line": 136, + "source_header": "sion d L ω) x\n\ntheorem smoothSourceField_contDiff (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) (n : ℕ) : ContDiff ℝ n (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_smooth", + "line": 140, + "source_header": "ω.property n\n\ntheorem smoothSourceField_smooth (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ (⊤ : ℕ∞) (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_map_eq", + "line": 144, + "source_header": "tDiff d hL ω)\n\ntheorem smoothSourceField_finiteVector_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n (smoothLaw d L).map (fun ω j => smoothSourceField d L ω (x j)) =\n (sourceLaw d).map (fun ω j => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_hasGaussianLaw", + "line": 151, + "source_header": "e d L (x j)))\n\ntheorem smoothSourceField_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => smoothSourceField d L ω (x j)) (s" + }, + { + "kind": "theorem", + "unqualified_name": "covariance_comp_inclusion", + "line": 161, + "source_header": "sGaussian_map\n\ntheorem covariance_comp_inclusion (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (X Y : (SourceMode d → ℝ) → ℝ) (hX : Measurable X) (hY : Measurable Y) :\n cov[fun ω => X (sampleInclusion d L ω), fun ω => Y (sampleInclusion d L ω); smoothLaw d L] =\n cov[X, Y;" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_covariance", + "line": 171, + "source_header": "exact h.symm\n\ntheorem smoothSourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (x y : Fin d → ℝ) :\n cov[fun ω => smoothSourceField d L ω x, fun ω => smoothSourceField d L ω y; smoothLaw d L] =\n sourceSpectralKerne" + }, + { + "kind": "def", + "unqualified_name": "smoothTorusSourceField", + "line": 181, + "source_header": "ance d hL x y\n\n/-- The unchanged literal torus descent of the same coefficient sample. -/\ndef smoothTorusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) (q : Sourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_smooth", + "line": 188, + "source_header": "ualChartedSpace\n\ntheorem smoothTorusSourceField_smooth (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) :\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) (⊤ : ℕ∞) (smoothTorusSou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_finiteVector_hasGaussianLaw", + "line": 205, + "source_header": "ontDiffWithinAt\n\ntheorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ)\n [Fact (0 < L)] (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => smoothTorusSourceField d L ω (q j))" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_covariance", + "line": 218, + "source_header": ".isGaussian_map\n\ntheorem smoothTorusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => smoothTorusSourceField d L ω q, fun ω => smoothTorusSourceField d L ω p;\n smoothLaw d L] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepres" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceKernel.lean", + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "frequencyEquiv", + "line": 8, + "source_header": "def frequencyEquiv (d : ℕ) : SourceMode d ≃ (Fin d → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "sourceSpectralKernel", + "line": 11, + "source_header": "/-- The prescribed normalized full-lattice real Fourier kernel; image/Poisson linkage is separate. -/\ndef sourceSpectralKernel (d : ℕ) (L : ℝ) (z : Fin d → ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "tsum_mode", + "line": 15, + "source_header": ")\n\nprivate theorem tsum_mode (d : ℕ) (f : SourceMode d → ℝ) (hf : Summable f) :\n (∑' m, f m) = f none + ∑' k : ↥(halfLattice d),\n (f (some (k,false)) + f (some (k,true))" + }, + { + "kind": "theorem", + "unqualified_name": "modeProduct_summable", + "line": 33, + "source_header": "g\n\ntheorem modeProduct_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n Summable (fun m => modeCoefficient d L m x * modeCoefficient d L m y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_summable", + "line": 46, + "source_header": ")\n\ntheorem spectralKernel_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (z : Fin d → ℝ) :\n Summable (fun k : Fin d → ℤ =>\n sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)" + }, + { + "kind": "theorem", + "unqualified_name": "coefficientKernel_eq_fullLattice", + "line": 58, + "source_header": "q\n\ntheorem coefficientKernel_eq_fullLattice (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =\n sourceSpectralKernel d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_zero", + "line": 103, + "source_header": "m\n\ntheorem spectralKernel_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceSpectralKernel d L 0 =" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceTorus.lean", + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "SourceTorus", + "line": 13, + "source_header": "s\n\nabbrev SourceTorus (d : ℕ) (L : ℝ" + }, + { + "kind": "def", + "unqualified_name": "torusProjection", + "line": 15, + "source_header": "L\n\ndef torusProjection (d : ℕ) (L : ℝ) (x : Fin d → ℝ) : SourceTorus d" + }, + { + "kind": "def", + "unqualified_name": "torusRepresentative", + "line": 18, + "source_header": ")\n\ndef torusRepresentative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "torusSourceField", + "line": 22, + "source_header": "1\n\ndef torusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (q : SourceTorus d L) :" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_measurable", + "line": 26, + "source_header": ")\n\ntheorem torusProjection_measurable (d : ℕ) (L : ℝ) : Measurable (torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusRepresentative_measurable", + "line": 29, + "source_header": ")\n\ntheorem torusRepresentative_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (torusRepresentative d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_representative", + "line": 34, + "source_header": ")\n\ntheorem torusProjection_representative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : torusProjection d L (torusRepresentative d L q) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eq_of_torusProjection_eq", + "line": 39, + "source_header": ")\n\ntheorem sourceField_eq_of_torusProjection_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (x y : Fin d → ℝ)\n (h : torusProjection d L x = torusProjection d L y) :\n sourceField d L ω x = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_pullback", + "line": 57, + "source_header": "m\n\ntheorem torusSourceField_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (x : Fin d → ℝ) :\n torusSourceField d L ω (torusProjection d L x) = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_eval_measurable", + "line": 64, + "source_header": ")\n\ntheorem torusSourceField_eval_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Measurable (fun ω => torusSourceField d L ω q" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_joint_measurable", + "line": 68, + "source_header": ")\n\ntheorem torusSourceField_joint_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (fun p : (SourceMode d → ℝ) × SourceTorus d L =>\n torusSourceField d L p.1 p.2" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_finiteVector_hasGaussianLaw", + "line": 84, + "source_header": ")\n\ntheorem torusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => torusSourceField d L ω (q j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_isGaussianProcess", + "line": 90, + "source_header": ")\n\ntheorem torusSourceField_isGaussianProcess (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsGaussianProcess (fun q ω => torusSourceField d L ω q) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance", + "line": 95, + "source_header": ")\n\ntheorem torusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance_pullback", + "line": 102, + "source_header": ")\n\ntheorem torusSourceField_covariance_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (x y : Fin d → ℝ) :\n cov[fun ω => torusSourceField d L ω (torusProjection d L x),\n fun ω => torusSourceField d L ω (torusProjection d L y); sourceLaw d] =\n sourceSpectralKernel d L (x - y" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SpectralWeights.lean", + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "decay", + "line": 14, + "source_header": "s\n\ndef decay (a : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "coordinateBound", + "line": 16, + "source_header": ")\ndef coordinateBound (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productDecay", + "line": 18, + "source_header": "4\ndef productDecay (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productBound", + "line": 20, + "source_header": ")\ndef productBound (d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceA", + "line": 22, + "source_header": ")\ndef sourceA (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceC", + "line": 23, + "source_header": "2\ndef sourceC (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceWeight", + "line": 24, + "source_header": "L\ndef sourceWeight (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceZ", + "line": 26, + "source_header": "k\ndef sourceZ (d : ℕ) (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "pairedBound", + "line": 27, + "source_header": "k\ndef pairedBound (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "theorem", + "unqualified_name": "summable_decay_pow", + "line": 29, + "source_header": "k\n\ntheorem summable_decay_pow {a : ℝ} (ha : 0 < a) (n : ℕ) :\n Summable (fun k : ℤ => decay a k * |(k : ℝ)| ^ n" + }, + { + "kind": "theorem", + "unqualified_name": "coordinateBound_summable", + "line": 40, + "source_header": "b\n\ntheorem coordinateBound_summable {a c : ℝ} (ha : 0 < a) :\n Summable (coordinateBound a c" + }, + { + "kind": "theorem", + "unqualified_name": "finite_product_summable", + "line": 52, + "source_header": "n\ntheorem finite_product_summable {f : ℤ → ℝ} (hf : Summable f) (hn : ∀ k, 0 ≤ f k)\n (d : ℕ) : Summable (fun k : Fin d → ℤ => ∏ i, f (k i)" + }, + { + "kind": "theorem", + "unqualified_name": "productBound_summable", + "line": 72, + "source_header": "p\n\ntheorem productBound_summable {a c : ℝ} (ha : 0 < a) (d : ℕ) :\n Summable (productBound d a c" + }, + { + "kind": "theorem", + "unqualified_name": "productDecay_eq_exp", + "line": 77, + "source_header": "d\n\ntheorem productDecay_eq_exp (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :\n productDecay d a k = exp (-a * ∑ i, (k i : ℝ) ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "frequency_l1_le_product", + "line": 82, + "source_header": "]\n\ntheorem frequency_l1_le_product (d : ℕ) (v : Fin d → ℝ) (hv : ∀ i, 0 ≤ v i) :\n 1 + ∑ i, v i ≤ ∏ i, (1 + v i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceA_pos", + "line": 98, + "source_header": "v\n\ntheorem sourceA_pos {L : ℝ} (hL : L ≠ 0) : 0 < sourceA" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_eq_physical", + "line": 102, + "source_header": "y\n\ntheorem sourceWeight_eq_physical (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L k = exp (-(∑ i, (sourceC L * (k i : ℝ)) ^ 2) / 2" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_summable", + "line": 117, + "source_header": "g\n\ntheorem sourceWeight_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (sourceWeight d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceZ_pos", + "line": 124, + "source_header": "d\n\ntheorem sourceZ_pos (d : ℕ) {L : ℝ} (hL : L ≠ 0) : 0 < sourceZ d" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_eq_amplitude", + "line": 129, + "source_header": "]\n\ntheorem pairedBound_eq_amplitude (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : Fin d → ℤ) :\n pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_summable", + "line": 151, + "source_header": "g\n\ntheorem pairedBound_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (pairedBound d L" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_subtype_summable", + "line": 155, + "source_header": "_\n\ntheorem pairedBound_subtype_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (S : Set (Fin d → ℤ)) : Summable (fun k : S => pairedBound d L k" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceFourierSeries.lean", + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "halfLattice", + "line": 14, + "source_header": "e\n\n/-- The representative whose first nonzero coordinate is positive. -/\ndef halfLattice (d : ℕ) : Set (Fin d →" + }, + { + "kind": "abbrev", + "unqualified_name": "SourceMode", + "line": 18, + "source_header": "0}\n\nabbrev SourceMode (d :" + }, + { + "kind": "abbrev", + "unqualified_name": "sourceLaw", + "line": 20, + "source_header": "ol)\n\n/-- The actual common law, with independent variance-one real coefficients. -/\nabbrev sourceLaw (d : ℕ) : Measure (SourceMode d" + }, + { + "kind": "def", + "unqualified_name": "phase", + "line": 24, + "source_header": "de d)\n\ndef phase (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ" + }, + { + "kind": "def", + "unqualified_name": "modeCoefficient", + "line": 27, + "source_header": "* x i\n\n/-- False is the cosine coefficient and true the independent sine coefficient. -/\ndef modeCoefficient (d : ℕ) (L : ℝ) (m : SourceMode d) (x : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "modeMajorant", + "line": 34, + "source_header": "L k x)\n\ndef modeMajorant (d : ℕ) (L : ℝ) (m : SourceMode" + }, + { + "kind": "def", + "unqualified_name": "sourceField", + "line": 39, + "source_header": "d d L k\n\n/-- Literal normalized real Fourier sum on the common coefficient samples. -/\ndef sourceField (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) (x : Fin d" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_nonneg", + "line": 43, + "source_header": "L m x) ω\n\ntheorem modeMajorant_nonneg (d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_summable", + "line": 52, + "source_header": "ositivity\n\ntheorem modeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (modeMajo" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_bound", + "line": 66, + "source_header": ".summable\n\ntheorem modeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (x : Fin d → ℝ) :\n |modeCoefficient d L m x| ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eval_measurable", + "line": 98, + "source_header": "rans hamp\n\ntheorem sourceField_eval_measurable (d : ℕ) (L : ℝ) (x : Fin d → ℝ) :\n Measurable (fun ω => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "sourceMajorant_ae", + "line": 102, + "source_header": "surable _\n\ntheorem sourceMajorant_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Summable (fun m => modeMajorant d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAbs_uniform_ae", + "line": 106, + "source_header": "ble d hL)\n\ntheorem sourceAbs_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => |modeCoefficient d L m x * ω m|)\n (fun x => ∑' m, |modeCoefficient d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_uniform_ae", + "line": 117, + "source_header": "nonneg _)\n\ntheorem sourceField_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => modeCoefficient d L m x * ω m)\n (sourceFie" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_continuous_ae", + "line": 128, + "source_header": "nonneg _)\n\ntheorem sourceField_continuous_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Continuous (sourceFie" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceCovariance.lean", + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "scalarSeries_covariance", + "line": 12, + "source_header": "theorem scalarSeries_covariance (a b : ι → ℝ) (ha : Summable a) (hb : Summable b) :\n cov[scalarSeries a, scalarSeries b; coefficientLaw ι] = ∑' i, a i * b i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_integral_zero", + "line": 51, + "source_header": "theorem sourceField_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n ∫ ω, sourceField d L ω x ∂sourceLaw d = 0" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_covariance", + "line": 58, + "source_header": "theorem sourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] =\n sourceSpectralKernel d L (x - y)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_variance_one", + "line": 68, + "source_header": "theorem sourceField_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n Var[fun ω => sourceField d L ω x; sourceLaw d] = 1" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceGaussianLaw.lean", + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "summable_square", + "line": 18, + "source_header": "}\n\nprivate theorem summable_square (a : ι → ℝ) (ha : Summable a) :\n Summable (fun i => a i ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "partial_charFun", + "line": 29, + "source_header": "n\nprivate theorem partial_charFun (a : ι → ℝ) (s : Finset ι) (t : ℝ) :\n charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =\n Complex.exp (-((∑ i ∈ s, a i ^ 2 : ℝ) : ℂ) * (t : ℂ) ^ 2 / 2" + }, + { + "kind": "theorem", + "unqualified_name": "charFun_partial_tendsto", + "line": 55, + "source_header": "]\n\nprivate theorem charFun_partial_tendsto (a : ι → ℝ) (ha : Summable a) (t : ℝ) :\n Filter.Tendsto\n (fun s : Finset ι => charFun ((coefficientLaw ι).map\n (fun ω => ∑ i ∈ s, a i * ω i)) t)\n Filter.atTop (𝓝 (charFun ((coefficientLaw ι).map (scalarSeries a)) t)" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_map_gaussian", + "line": 90, + "source_header": "ω\n\ntheorem scalarSeries_map_gaussian (a : ι → ℝ) (ha : Summable a) :\n (coefficientLaw ι).map (scalarSeries a) =\n gaussianReal 0 (∑' i, a i ^ 2).toNNRea" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_integral_zero", + "line": 109, + "source_header": "g\n\ntheorem scalarSeries_integral_zero (a : ι → ℝ) (ha : Summable a) :\n ∫ ω, scalarSeries a ω ∂coefficientLaw ι =" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_variance", + "line": 116, + "source_header": "h\n\ntheorem scalarSeries_variance (a : ι → ℝ) (ha : Summable a) :\n Var[scalarSeries a; coefficientLaw ι] = ∑' i, a i ^" + }, + { + "kind": "theorem", + "unqualified_name": "source_linearCombination_hasGaussianLaw", + "line": 122, + "source_header": ")\n\ntheorem source_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) (c : Fin n → ℝ) :\n HasGaussianLaw (fun ω => ∑ j, c j * sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "source_finiteVector_hasGaussianLaw", + "line": 147, + "source_header": ")\n\ntheorem source_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_isGaussianProcess", + "line": 174, + "source_header": "l\n\ntheorem sourceField_isGaussianProcess (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsGaussianProcess (fun x ω => sourceField d L ω x) (sourceLaw d" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/GaussianSeriesFoundation.lean", + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "coefficientLaw", + "line": 15, + "source_header": "n\n\n/-- The same actual probability measure used for every coefficient and series assertion. -/\ndef coefficientLaw (ι : Type*) : Measure (ι →" + }, + { + "kind": "instance", + "unqualified_name": "coefficientLaw_isProbabilityMeasure", + "line": 19, + "source_header": "1)\n\ninstance coefficientLaw_isProbabilityMeasure (ι : Type*) :\n IsProbabilityMeasure (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_measurePreserving", + "line": 24, + "source_header": "nce\n\ntheorem coordinate_measurePreserving {ι : Type*} (i : ι) :\n MeasurePreserving (fun ω : ι → ℝ => ω i) (coefficientLaw ι)\n (gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 29, + "source_header": ") i\n\ntheorem coordinate_marginal {ι : Type*} (i : ι) :\n (coefficientLaw ι).map (fun ω => ω i) = gaussianReal" + }, + { + "kind": "theorem", + "unqualified_name": "coordinates_independent", + "line": 33, + "source_header": "_eq\n\ntheorem coordinates_independent (ι : Type*) :\n iIndepFun (fun i (ω : ι → ℝ) => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_memLp", + "line": 38, + "source_header": "id)\n\ntheorem coordinate_memLp {ι : Type*} (i : ι) (p : ℝ≥0∞) (hp : p ≠ ∞) :\n MemLp (fun ω : ι → ℝ => ω i) p (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_integrable", + "line": 43, + "source_header": "i)\n\ntheorem coordinate_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_abs_integrable", + "line": 47, + "source_header": "p))\n\ntheorem coordinate_abs_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => |ω i|) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_abs_summable_ae", + "line": 51, + "source_header": "orm\n\ntheorem weighted_abs_summable_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (ha : ∀ i, 0 ≤ a i) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, Summable (fun i => a i * |ω" + }, + { + "kind": "def", + "unqualified_name": "scalarSeries", + "line": 75, + "source_header": "hω\n\n/-- The actual scalar sum; its convergence is proved separately on the product law. -/\ndef scalarSeries {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_measurable", + "line": 79, + "source_header": "* ω i\n\ntheorem scalarSeries_measurable {ι : Type*} [Countable ι] (a : ι → ℝ) :\n Measurable (scalarSeri" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_hasSum_ae", + "line": 86, + "source_header": "ly i)\n\ntheorem scalarSeries_hasSum_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, HasSum (fun i => a i * ω i) (scalarSeries" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceTorusC4.lean", + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "quotientChart", + "line": 12, + "source_header": "def quotientChart (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n OpenPartialHomeomorph (SourceTorus d L) (Fin d → ℝ)" + }, + { + "kind": "def", + "unqualified_name": "chartCenter", + "line": 16, + "source_header": "def chartCenter (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) : Fin d → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "quotientChart_symm", + "line": 19, + "source_header": "theorem quotientChart_symm (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n (quotientChart d L a).symm = torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "centered_chart_covers", + "line": 23, + "source_header": "theorem centered_chart_covers (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) :\n q ∈ (quotientChart d L (chartCenter d L q)).source" + }, + { + "kind": "theorem", + "unqualified_name": "chart_transition_contDiff", + "line": 51, + "source_header": "theorem chart_transition_contDiff (d : ℕ) (L : ℝ) [Fact (0 < L)] (a b : Fin d → ℝ) :\n ContDiffOn ℝ ∞ ((quotientChart d L a).symm.trans (quotientChart d L b))\n ((quotientChart d L a).symm.trans (quotientChart d L b)).source" + }, + { + "kind": "theorem", + "unqualified_name": "torus_isManifold", + "line": 98, + "source_header": "theorem torus_isManifold (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsManifold 𝓘(ℝ, Fin d → ℝ) ∞ (SourceTorus d L)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_contMDiff_ae", + "line": 110, + "source_header": "theorem torusSourceField_contMDiff_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d,\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) 4 (torusSourceField d L sample)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_weakSuperlevel_closed_ae", + "line": 126, + "source_header": "theorem torusSourceField_weakSuperlevel_closed_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d, ∀ h : ℝ,\n IsClosed {q : SourceTorus d L | h ≤ torusSourceField d L sample q}" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceC4.lean", + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "phaseCLM", + "line": 13, + "source_header": "4\n\ndef phaseCLM (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : (Fin d → ℝ) →L[ℝ]" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_apply", + "line": 16, + "source_header": "i\n\ntheorem phaseCLM_apply (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) :\n phaseCLM d L k x = phase d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_norm_le", + "line": 20, + "source_header": "]\n\ntheorem phaseCLM_norm_le (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n ‖phaseCLM d L k‖ ≤ ∑ i, |sourceC L * (k i : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_bound", + "line": 35, + "source_header": "]\n\ntheorem modeCoefficient_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (hj : j ≤ 4) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_ae", + "line": 102, + "source_header": "]\n\ntheorem sourceField_contDiff_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ContDiff ℝ 4 (sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_affine_ae", + "line": 133, + "source_header": ")\n\ntheorem sourceField_contDiff_affine_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ (T : (Fin d → ℝ) →L[ℝ] (Fin d → ℝ)) (a : Fin d → ℝ),\n ContDiff ℝ 4 (fun x => sourceField d L ω (a + T x)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/SourceLattice.lean", + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "latticeFrequency", + "line": 8, + "source_header": "def latticeFrequency (d : ℕ) (m : SourceMode d) : Fin d → ℤ" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_ne_zero", + "line": 13, + "source_header": "theorem halfLattice_ne_zero (d : ℕ) {k : Fin d → ℤ} (hk : k ∈ halfLattice d) :\n k ≠ 0" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_partition", + "line": 20, + "source_header": "theorem halfLattice_partition (d : ℕ) {k : Fin d → ℤ} (hk : k ≠ 0) :\n (k ∈ halfLattice d ∨ -k ∈ halfLattice d) ∧\n ¬ (k ∈ halfLattice d ∧ -k ∈ halfLattice d)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_neg", + "line": 59, + "source_header": "theorem sourceWeight_neg (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L (-k) = sourceWeight d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phase_lattice_shift", + "line": 64, + "source_header": "theorem phase_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k n : Fin d → ℤ) (x : Fin d → ℝ) :\n phase d L k (fun i => x i + L * (n i : ℝ)) =\n phase d L k x + ((∑ i, k i * n i : ℤ) : ℝ) * (2 * Real.pi)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_lattice_shift", + "line": 78, + "source_header": "theorem modeCoefficient_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) =\n modeCoefficient d L m x" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_lattice_shift", + "line": 90, + "source_header": "theorem sourceField_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n sourceField d L ω (fun i => x i + L * (n i : ℝ)) = sourceField d L ω x" + }, + { + "kind": "theorem", + "unqualified_name": "pairedCoefficient_kernel", + "line": 100, + "source_header": "theorem pairedCoefficient_kernel (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ↥(halfLattice d)) (x y : Fin d → ℝ) :\n (∑ b : Bool, modeCoefficient d L (some (k,b)) x *\n modeCoefficient d L (some (k,b)) y) =\n (2 * sourceWeight d L k / sourceZ d L) * Real.cos (phase d L k (x - y))" + }, + { + "kind": "theorem", + "unqualified_name": "latticeFrequency_bijective", + "line": 120, + "source_header": "theorem latticeFrequency_bijective (d : ℕ) : Function.Bijective (latticeFrequency d)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizerLimit.lean", + "sha256": "12c98054b5bcf47f4619c624ef5e91c37f316d7c4848f560279d1f1e96fe0049", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "gnl_contact_relations", + "line": 21, + "source_header": "e\n\nprivate theorem gnl_contact_relations (m : EuclideanSpace ℝ (Fin 6)) (S : Matrix (Fin 6) (Fin 6) ℝ)\n (hS : S.PosSemidef)\n (hm0 : m 0 = -1) (hm1 : m 1 = 1)\n (hm23 : m 2 + m 3 = 0) (hm45 : m 4 - m 5 = 0)\n (hS0 : S 0 0 = 0) (hS1 : S 1 1 = 0)\n (hS23 : S 2 2 + 2*S 2 3 + S 3 3 = 0)\n (hS45 : S 4 4 - 2*S 4 5 + S 5 5 = 0) :\n ∀ᵐ x ∂multivariateGaussian m S,\n x 0 = -1 ∧ x 1 = 1 ∧ x 2 + x 3 = 0 ∧ x 4 - x 5 =" + }, + { + "kind": "lemma", + "unqualified_name": "gnl_positivePart_memLp", + "line": 64, + "source_header": "⟩\n\nprivate lemma gnl_positivePart_memLp {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {f : Ω → ℝ} {p : ℝ≥0∞} (hf : MemLp f p P) :\n MemLp (fun x => max (f x) 0) p" + }, + { + "kind": "lemma", + "unqualified_name": "gnl_gaussian_weight_integrable", + "line": 72, + "source_header": ")\n\nprivate lemma gnl_gaussian_weight_integrable (r : ℝ) (m : EuclideanSpace ℝ (Fin 6))\n (S : Matrix (Fin 6) (Fin 6) ℝ) (hS : S.PosSemidef) :\n Integrable (fun x : EuclideanSpace ℝ (Fin 6) => gn_normalizedWeight r (ofLp x))\n (multivariateGaussian m S" + }, + { + "kind": "theorem", + "unqualified_name": "gnl_normalizer_floor_of_parameter_limits", + "line": 105, + "source_header": "T\n\n\n/-- Gaussian endpoint parameter convergence and concrete contact moments supply\none positive physical normalizer coefficient at every sufficiently small radius.\nThe covariance may be singular; the transverse reference mean is unrestricted. -/\ntheorem gnl_normalizer_floor_of_parameter_limits\n (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)\n (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)\n (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))\n (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))\n (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)\n (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)\n (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)\n (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)\n (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)\n (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤\n ∫ x : EuclideanSpace ℝ (Fin 6), r^2 * gn_normalizedWeight r (ofLp x)\n ∂multivariateGaussian (m r) (S" + }, + { + "kind": "theorem", + "unqualified_name": "gnl_physical_normalizer_floor_of_parameter_limits", + "line": 174, + "source_header": "op)\n\n\n/-- The same Gaussian parameter limit gives the full literal typed endpoint\nnormalizer, after the explicit permutation back to physical endpoint order. -/\ntheorem gnl_physical_normalizer_floor_of_parameter_limits\n (m : ℝ → EuclideanSpace ℝ (Fin 6)) (S : ℝ → Matrix (Fin 6) (Fin 6) ℝ)\n (m0 : EuclideanSpace ℝ (Fin 6)) (S0 : Matrix (Fin 6) (Fin 6) ℝ)\n (hm : Tendsto m (𝓝[>] (0 : ℝ)) (𝓝 m0))\n (hS : Tendsto S (𝓝[>] (0 : ℝ)) (𝓝 S0))\n (hPSD : ∀ᶠ r in 𝓝[>] (0 : ℝ), (S r).PosSemidef) (hPSD0 : S0.PosSemidef)\n (hm0 : m0 0 = -1) (hm1 : m0 1 = 1)\n (hm23 : m0 2 + m0 3 = 0) (hm45 : m0 4 - m0 5 = 0)\n (hS0 : S0 0 0 = 0) (hS1 : S0 1 1 = 0)\n (hS23 : S0 2 2 + 2*S0 2 3 + S0 3 3 = 0)\n (hS45 : S0 4 4 - 2*S0 4 5 + S0 5 5 = 0) (hQpos : 0 < S0 4 4) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ → c*r^2 ≤\n ∫ x : EuclideanSpace ℝ (Fin 6), egm_weight r ![x 0,x 2,x 4,x 1,x 3,x 5]\n ∂multivariateGaussian (m r)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointNormalizerBridge.lean", + "sha256": "36eab3b805fcba5160cb7e286dbd7f96940b0c6a85b464aad5fdad2f624ceb7e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "enb_permutation", + "line": 19, + "source_header": "e\n\n/-- Convert the actual six endpoint entries to the continuous weight's order. -/\ndef enb_permutation (j : Fin 6 → ℝ) : Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "enb_permutation_continuous", + "line": 23, + "source_header": "5]\n\ntheorem enb_permutation_continuous : Continuous enb_permutat" + }, + { + "kind": "theorem", + "unqualified_name": "enb_maximum_factor", + "line": 27, + "source_header": "rop\n\nprivate theorem enb_maximum_factor (r a b c : ℝ) (hr : 0 < r) :\n max (max (-a) 0 * max (-c) 0 - r * b ^ 2) 0 =\n if a < 0 ∧ 0 < a * c - r * b ^ 2 then a * c - r * b ^ 2 els" + }, + { + "kind": "theorem", + "unqualified_name": "enb_maximum_iff", + "line": 53, + "source_header": ")))\n\n/-- Strict negative definiteness in actual endpoint coordinates, with no\nassumed sign of the other diagonal entry or omission of singular boundaries. -/\ntheorem enb_maximum_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n dm2Negative (egm_HM r j) ↔ j 0 < 0 ∧ 0 < j 0 * j 2 - r * j" + }, + { + "kind": "theorem", + "unqualified_name": "enb_saddle_iff", + "line": 64, + "source_header": "t hr]\n\n/-- The literal strict saddle condition is the sign of its factored determinant. -/\ntheorem enb_saddle_iff (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n (egm_HS r j).det < 0 ↔ j 3 * j 5 - r * j 4" + }, + { + "kind": "theorem", + "unqualified_name": "enb_weight_identity", + "line": 73, + "source_header": "inarith\n\n/-- Exact bridge from the literal typed physical endpoint weight to the\ncontinuous expression. All excluded types and all zero boundaries give zero. -/\ntheorem enb_weight_identity (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) :\n egm_weight r j = r ^ 2 * gn_normalizedWeight r (enb_permu" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integral_identity", + "line": 109, + "source_header": "ring\n\n/-- The physical and continuous normalizers are the same integral up to the\nexact radius factor, for any common random six-vector and any measure. -/\ntheorem enb_integral_identity {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :\n (∫ ω, egm_weight r (J ω) ∂P) =\n r ^ 2 * ∫ ω, gn_normalizedWeight r (enb_permutatio" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integrable_iff", + "line": 120, + "source_header": "nst_mul _ _\n\n/-- Positive radius makes the exact scaling nonzero, so either weight is\nintegrable precisely when the other is. -/\ntheorem enb_integrable_iff {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (J : Ω → Fin 6 → ℝ) (r : ℝ) (hr : 0 < r) :\n Integrable (fun ω => egm_weight r (J ω)) P ↔\n Integrable (fun ω => gn_normalizedWeight r (enb_permutat" + }, + { + "kind": "theorem", + "unqualified_name": "enb_integrable_of_integrable_sq", + "line": 131, + "source_header": "o 2 hr.ne'))]\n\n/-- On a finite measure, the actual endpoint second-moment theorem supplies\nthe first-moment hypotheses needed by the normalizer join. -/\ntheorem enb_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsFiniteMeasure P]\n (J : Ω → Fin 6 → ℝ) (hJ : Measurable J) (r : ℝ) (hr : 0 < r)\n (hsq : Integrable (fun ω => egm_weight r (J ω) ^ 2) P) :\n Integrable (fun ω => egm_weight r (J ω)) P ∧\n Integrable (fun ω => gn_normalizedWeight r (enb_permut" + }, + { + "kind": "theorem", + "unqualified_name": "enb_normalizer_floor_of_common_coupling", + "line": 149, + "source_header": ").mp hphysical⟩\n\n/-- The proved common-coupling normalizer floor transfers to the literal\nphysical endpoint weight, with its own actual coordinate order. Current\nphysical integrability and the conditioned-field convergence remain inputs. -/\ntheorem enb_normalizer_floor_of_common_coupling\n {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P]\n (J : ℝ → Ω → Fin 6 → ℝ) (hJ : ∀ r, Measurable (J r))\n (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => J r ω) (𝓝[>] (0 : ℝ))\n (𝓝 ![-1,-A ω/2,Q ω,1,A ω/2,Q ω]))\n (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),\n Integrable (fun ω => egm_weight r (J r ω)) P) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n c * r ^ 2 ≤ ∫ ω, egm_we" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/EndpointGaussianMoments.lean", + "sha256": "c6351881326491ce30f1a266ea60e44c5adb8b3a1e5882c90575c67e459479d1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "egm_HM", + "line": 13, + "source_header": "e\n\ndef egm_HM (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2)" + }, + { + "kind": "def", + "unqualified_name": "egm_HS", + "line": 16, + "source_header": "]\n\ndef egm_HS (r : ℝ) (j : Fin 6 → ℝ) : Matrix (Fin 2) (Fin 2)" + }, + { + "kind": "def", + "unqualified_name": "egm_weight", + "line": 19, + "source_header": "]\n\nnoncomputable def egm_weight (r : ℝ) (j : Fin 6 → ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "egm_weight_measurable", + "line": 24, + "source_header": "0\n\n/-- The maximum condition is the original strict quadratic-form condition;\nno null-boundary assumption is needed for measurable typing. -/\ntheorem egm_weight_measurable (r : ℝ) : Measurable (egm_weight" + }, + { + "kind": "theorem", + "unqualified_name": "egm_coordinate_bound", + "line": 49, + "source_header": "nst\n\nprivate theorem egm_coordinate_bound (j : Fin 6 → ℝ) (i : Fin 6) :\n |j i| ≤ gm8Radiu" + }, + { + "kind": "theorem", + "unqualified_name": "egm_factor_bound", + "line": 56, + "source_header": "ith\n\nprivate theorem egm_factor_bound (r a b c R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)\n (hR : 0 ≤ R) (ha : |a| ≤ R) (hb : |b| ≤ R) (hc : |c| ≤ R) :\n |a * c - r * b ^ 2| ≤ 2 * R" + }, + { + "kind": "theorem", + "unqualified_name": "egm_untyped", + "line": 68, + "source_header": "th)\n\nprivate theorem egm_untyped (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :\n ((egm_HM r j).det * (egm_HS r j).det) ^ 2 ≤\n 16 * r ^ 4 * gm8Radius j" + }, + { + "kind": "theorem", + "unqualified_name": "egm_pointwise", + "line": 97, + "source_header": "ing\n\n/-- Exact endpoint determinant domination in the actual normalized six-vector.\nThe type indicators can only reduce the nonnegative determinant product. -/\ntheorem egm_pointwise (r : ℝ) (j : Fin 6 → ℝ) (hr : 0 < r) (hr1 : r ≤ 1) :\n egm_weight r j ^ 2 ≤ 16 * r ^ 4 * gm8Radius" + }, + { + "kind": "theorem", + "unqualified_name": "egm_gaussian_moment", + "line": 108, + "source_header": "vity)\n\n/-- Genuine Gaussian marginal laws of the actual normalized endpoint vector\nsupply both integrability and its determinant second moment. The derivative-map,\nconditioning law and uniform parameter bounds remain explicit model inputs. -/\ntheorem egm_gaussian_moment {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin 6 → ℝ)\n (hJ : Measurable J) (m : Fin 6 → ℝ) (v : Fin 6 → ℝ≥0)\n (B V r : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V) (hr : 0 < r) (hr1 : r ≤ 1)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => egm_weight r (J x) ^ 2) μ ∧\n (∫ x, egm_weight r (J x) ^ 2 ∂μ) ≤ 16 * gm8FiniteM8 6 B V" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/PalmReweighting.lean", + "sha256": "d34e422693f1d449bfcaf9c844c99c8fef4f19503312d3677ca525bd2d67c4d6", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "prwMeasure", + "line": 26, + "source_header": "e\n\n/-- The literal normalized nonnegative real density, defined for every input. -/\nnoncomputable def prwMeasure {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) : Measur" + }, + { + "kind": "theorem", + "unqualified_name": "prw_integrable_of_integrable_sq", + "line": 31, + "source_header": "μ))\n\n/-- On a finite measure, a measurable square-integrable real weight is integrable. -/\ntheorem prw_integrable_of_integrable_sq {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hsq : Integrable (fun ω => W ω ^ 2) μ) : Integrabl" + }, + { + "kind": "theorem", + "unqualified_name": "prw_measure_apply", + "line": 42, + "source_header": "W ω)]\n\n/-- The actual event mass is the normalized set integral, in extended reals. -/\ntheorem prw_measure_apply {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n prwMeasure μ W E = ENNReal.ofReal ((∫ x in E, W x ∂μ) / ∫ x," + }, + { + "kind": "theorem", + "unqualified_name": "prw_isProbabilityMeasure", + "line": 55, + "source_header": "al_div]\n\n/-- Positive finite normalizer makes the literal density a probability law. -/\ntheorem prw_isProbabilityMeasure {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ) :\n IsProbabilityMeasure (prwMea" + }, + { + "kind": "theorem", + "unqualified_name": "prw_measure_real", + "line": 64, + "source_header": "[hZ.ne']\n\n/-- The event identity is proved for the constructed law, not assumed. -/\ntheorem prw_measure_real {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) (W : Ω → ℝ) (hW : Integrable W μ)\n (hW0 : ∀ ω, 0 ≤ W ω) (hZ : 0 < ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n (prwMeasure μ W).real E = (∫ x in E, W x ∂μ) /" + }, + { + "kind": "theorem", + "unqualified_name": "prw_numerator_bound", + "line": 73, + "source_header": "W0) hZ.le)]\n\n/-- Integral Cauchy–Schwarz against the event indicator, including null events. -/\ntheorem prw_numerator_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsFiniteMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n (∫ x in E, W x ∂μ) ≤\n Real.sqrt (∫ x, W x ^ 2 ∂μ) * Real.sq" + }, + { + "kind": "theorem", + "unqualified_name": "prw_square_root_event_bound", + "line": 105, + "source_header": "ow] using hCS\n\n/-- The exact `r^4` second moment and `r^2` normalizer cancel in the literal\nweighted probability. No event probability is assumed positive. -/\ntheorem prw_square_root_event_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (W : Ω → ℝ) (hW : Measurable W)\n (hW0 : ∀ ω, 0 ≤ W ω) (hsq : Integrable (fun ω => W ω ^ 2) μ)\n (C c r : ℝ) (hC : 0 ≤ C) (hc : 0 < c) (hr : 0 < r)\n (hmoment : (∫ x, W x ^ 2 ∂μ) ≤ C * r ^ 4)\n (hfloor : c * r ^ 2 ≤ ∫ x, W x ∂μ)\n (E : Set Ω) (hE : MeasurableSet E) :\n IsProbabilityMeasure (prwMeasure μ W) ∧\n (prwMeasure μ W).real E ≤ (Real.sqrt C / c) * Real." + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianJetMoments.lean", + "sha256": "f2e785975aee6915848fe78dc3ecde02b8f13a0a1fb56ae3771e4c727c723360", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gm8Radius", + "line": 12, + "source_header": "/-- Radius for a finite vector, including its constant one. -/\ndef gm8Radius {n : ℕ} (j : Fin n → ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "gm8FiniteM8", + "line": 15, + "source_header": "|\n\n/-- One finite-dimensional Gaussian radius moment constant. -/\nnoncomputable def gm8FiniteM8 (n : ℕ) (B V : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "gm8FiniteM8_nonneg", + "line": 19, + "source_header": "8))\n\ntheorem gm8FiniteM8_nonneg (n : ℕ) (B V : ℝ) : 0 ≤ gm8FiniteM8 n" + }, + { + "kind": "def", + "unqualified_name": "gm8M8", + "line": 24, + "source_header": "ity\n\n/-- The source's exact fixed nine-coordinate constant. -/\nnoncomputable def gm8M8 (B V : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "gm8M8_nonneg", + "line": 28, + "source_header": "8C8))\n\ntheorem gm8M8_nonneg (B V : ℝ) : 0 ≤ gm8M" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_finite_radius_power_bound", + "line": 31, + "source_header": "9 B V\n\ntheorem gm8_finite_radius_power_bound (n : ℕ) (j : Fin n → ℝ) :\n gm8Radius j ^ 8 ≤ ((n+1 : ℕ) : ℝ)^7 * (1 + ∑ i, |j" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_finite_integrable_bound", + "line": 41, + "source_header": "ing h\n\ntheorem gm8_finite_integrable_bound (n : ℕ) {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → Fin n → ℝ)\n (hJ : Measurable J) (m : Fin n → ℝ) (v : Fin n → ℝ≥0)\n (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => gm8Radius (J x)^8) μ ∧\n (∫ x, gm8Radius (J x)^8 ∂μ) ≤ gm8FiniteM8" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_radius_power_bound", + "line": 82, + "source_header": "ssoc]\n\n/-- The exact DM2 radius is the nine-dimensional specialization. -/\ntheorem gm8_radius_power_bound (j : DM2Jet) :\n dm2Radius j ^ 8 ≤ (10 : ℝ)^7 * (1 + ∑ i, |" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_jet_integrable_bound", + "line": 87, + "source_header": "und 9 j\n\n/-- The nine-jet Gaussian marginal moment interface, with no independence or\nmoment conclusion assumed. -/\ntheorem gm8_jet_integrable_bound {Ω : Type*} [MeasurableSpace Ω]\n (μ : Measure Ω) [IsProbabilityMeasure μ] (J : Ω → DM2Jet)\n (hJ : Measurable J) (m : Fin 9 → ℝ) (v : Fin 9 → ℝ≥0)\n (B V : ℝ) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hmean : ∀ i, |m i| ≤ B) (hvar : ∀ i, (v i : ℝ) ≤ V)\n (hlaw : ∀ i, HasLaw (fun x => J x i) (gaussianReal (m i) (v i)) μ) :\n Integrable (fun x => dm2Radius (J x)^8) μ ∧\n (∫ x, dm2Radius (J x)^8 ∂μ) ≤" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_family_weight_moment", + "line": 100, + "source_header": "hvar hlaw\n\n/-- The same B,V give one determinant second-moment coefficient throughout\n0 J r x i) (gaussianReal (m r i) (v r i)) (μ r)) :\n 0 ≤ 16*gm8M8 B V ∧ ∀ r, 0 < r → r ≤ r0 →\n Integrable (fun x => dm2Weight r (J r x)^2) (μ r) ∧\n (∫ x, dm2Weight r (J r x)^2 ∂μ r) ≤ (16*gm8" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianRegressionKernel.lean", + "sha256": "66d4fbee044a1a0c0b434bcd7614e220fad21d1ac275ce9b01070a66c5780460", + "declarations_lexical": [ + { + "kind": "lemma", + "unqualified_name": "regression_compProd_id_const", + "line": 28, + "source_header": "1\n\n/-- Copying the first coordinate and retaining an independent second coordinate. -/\nlemma regression_compProd_id_const {α β : Type*} [MeasurableSpace α] [MeasurableSpace β]\n (μ : Measure α) (ν : Measure β) [SFinite μ] [SFinite ν] :\n μ ⊗ₘ (Kernel.id ×ₖ Kernel.const α ν) =\n (μ.prod ν).map (fun p : α × β => (p.1," + }, + { + "kind": "lemma", + "unqualified_name": "regression_pair_hasCondDistrib", + "line": 41, + "source_header": "rfl\n\n/-- An independent residual paired with the observation has the explicit product kernel. -/\nlemma regression_pair_hasCondDistrib {Ω α β : Type*} [MeasurableSpace Ω]\n [MeasurableSpace α] [MeasurableSpace β] {P : Measure Ω} [IsProbabilityMeasure P]\n {X : Ω → α} {R : Ω → β} (hX : AEMeasurable X P) (hR : AEMeasurable R P)\n (hXR : IndepFun X R P) :\n HasCondDistrib (fun ω => (X ω, R ω)) X\n (Kernel.id ×ₖ Kernel.const α (P.map" + }, + { + "kind": "def", + "unqualified_name": "regressionReconstruction", + "line": 59, + "source_header": ".symm\n\n\n/-- Affine reconstruction of the target from the observation and the regression residual. -/\ndef regressionReconstruction {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (p : (Fin n → ℝ) × (Fin k → ℝ)) : Fi" + }, + { + "kind": "lemma", + "unqualified_name": "regressionReconstruction_measurable", + "line": 66, + "source_header": "1 - mX)\n\nlemma regressionReconstruction_measurable {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Measurable (regressionReconstruction B" + }, + { + "kind": "def", + "unqualified_name": "regressionKernel", + "line": 72, + "source_header": "un_prop\n\n/-- The canonical regression law is specified at every observation, including null pins. -/\nnoncomputable def regressionKernel {n k : ℕ} (ν : Measure (Fin k → ℝ))\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Kernel (Fin n → ℝ) (F" + }, + { + "kind": "instance", + "unqualified_name": "regressionKernel_isMarkov", + "line": 79, + "source_header": "B mX mY)\n\ninstance regressionKernel_isMarkov {n k : ℕ} (ν : Measure (Fin k → ℝ))\n [IsProbabilityMeasure ν] (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ))\n (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n IsMarkovKernel (regressionKernel ν" + }, + { + "kind": "lemma", + "unqualified_name": "regressionKernel_apply", + "line": 86, + "source_header": "B mX mY)\n\nlemma regressionKernel_apply {n k : ℕ} (ν : Measure (Fin k → ℝ)) [SFinite ν]\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (x : Fin n → ℝ) :\n regressionKernel ν B mX mY x = ν.map (fun r => r + mY + B" + }, + { + "kind": "lemma", + "unqualified_name": "independentResidual_hasCondDistrib", + "line": 95, + "source_header": "p)]\n rfl\n\n/-- Affine reconstruction from an independent residual has the canonical conditional kernel. -/\nlemma independentResidual_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}\n {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hX : AEMeasurable X P) (hR : AEMeasurable R P) (hXR : IndepFun X R P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P.map R)" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_hasCondDistrib", + "line": 106, + "source_header": "le B mX mY)\n\n/-- Joint Gaussianity and vanishing observation/residual cross-covariance give the canonical\nconditional law, without choosing an almost-everywhere version at a prescribed observation. -/\ntheorem gaussianRegression_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)\n (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P.map" + }, + { + "kind": "lemma", + "unqualified_name": "regressionKernel_measurable", + "line": 119, + "source_header": "zero) B mX mY\n\n/-- Kernel measurability is pointwise in the observation and does not require a Gaussian law. -/\nlemma regressionKernel_measurable {n k : ℕ} (ν : Measure (Fin k → ℝ))\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n Measurable (regressionKe" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegressionKernel_spec", + "line": 125, + "source_header": "el.measurable _\n\n/-- All parts of the canonical Gaussian conditional-law construction, including the literal\npushforward at every prescribed observation. Zero-dimensional and degenerate laws are allowed. -/\ntheorem gaussianRegressionKernel_spec {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {R : Ω → Fin k → ℝ}\n (hXR : HasGaussianLaw (fun ω => (X ω, R ω)) P)\n (hzero : ∀ i j, covariance (fun ω => X ω i) (fun ω => R ω j) P = 0)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n IsMarkovKernel (regressionKernel (P.map R) B mX mY) ∧\n Measurable (regressionKernel (P.map R) B mX mY) ∧\n (∀ x, regressionKernel (P.map R) B mX mY x =\n (P.map R).map (fun r => r + mY + B (x - mX))) ∧\n HasCondDistrib (fun ω => R ω + mY + B (X ω - mX)) X\n (regressionKernel (P." + }, + { + "kind": "lemma", + "unqualified_name": "regression_map_coordinate", + "line": 142, + "source_header": "XR hzero B mX mY⟩\n\n/-- Coordinates of a finite-vector continuous linear map in the standard basis. -/\nlemma regression_map_coordinate {n k : ℕ}\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (v : Fin n → ℝ) (j : Fin k) :\n B v j = ∑ l, B (Pi." + }, + { + "kind": "lemma", + "unqualified_name": "regression_covariance_map", + "line": 152, + "source_header": "[map_sum, mul_comm]\n\n/-- The covariance of a centered finite-vector linear predictor is its normal-equation sum. -/\nlemma regression_covariance_map {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} [IsProbabilityMeasure P] {n k : ℕ}\n {X : Ω → Fin n → ℝ} (hX : HasGaussianLaw X P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ)\n (i : Fin n) (j : Fin k) :\n covariance (fun ω => X ω i) (fun ω => B (X ω - mX) j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω" + }, + { + "kind": "lemma", + "unqualified_name": "regression_residual_zero_covariance", + "line": 172, + "source_header": "(hX.eval i).memLp_two\n\n/-- The actual regression residual has zero observation cross-covariance by the normal equations. -/\nlemma regression_residual_zero_covariance {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n ∀ i j, covariance (fun ω => X ω i)\n (fun ω => (Y ω - mY -" + }, + { + "kind": "lemma", + "unqualified_name": "regression_residual_jointGaussian", + "line": 198, + "source_header": "hnormal i j, sub_self]\n\n/-- The observation and the actual affine residual are jointly Gaussian. -/\nlemma regression_residual_jointGaussian {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} {n k : ℕ}\n {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ) :\n HasGaussianLaw (fun ω => (X ω, Y" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_observed_hasCondDistrib", + "line": 227, + "source_header": "rw [map_sub]\n abel\n\n\n\n/-- The actual target has the explicit regression conditional law when the coefficient map\nsatisfies the coordinate normal equations. The residual hypotheses are derived. -/\ntheorem gaussianRegression_observed_hasCondDistrib {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n HasCondDistrib Y X\n (regressionKernel (P.map (fun ω => Y ω - mY" + }, + { + "kind": "theorem", + "unqualified_name": "gaussianRegression_observed_spec", + "line": 246, + "source_header": "d using 1\n funext ω\n abel\n\n/-- The canonical conditional-law specification for the actual jointly Gaussian target.\nThe residual Gaussianity and its zero cross-covariance are conclusions of the construction. -/\ntheorem gaussianRegression_observed_spec {Ω : Type*} [MeasurableSpace Ω]\n {P : Measure Ω} {n k : ℕ} {X : Ω → Fin n → ℝ} {Y : Ω → Fin k → ℝ}\n (hXY : HasGaussianLaw (fun ω => (X ω, Y ω)) P)\n (B : (Fin n → ℝ) →L[ℝ] (Fin k → ℝ)) (mX : Fin n → ℝ) (mY : Fin k → ℝ)\n (hnormal : ∀ i j, covariance (fun ω => X ω i) (fun ω => Y ω j) P =\n ∑ l, B (Pi.single l 1) j * covariance (fun ω => X ω i) (fun ω => X ω l) P) :\n IsMarkovKernel\n (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧\n Measurable\n (regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY) ∧\n (∀ x, regressionKernel (P.map (fun ω => Y ω - mY - B (X ω - mX))) B mX mY x =\n (P.map (fun ω => Y ω - mY - B (X ω - mX))).map\n (fun r => r + mY + B (x - mX))) ∧\n HasCondDistrib Y X\n (regressionKernel (P.map (fun ω => Y ω - m" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianCoupling.lean", + "sha256": "426a53c139215650e961601c12f3cc1e09069520c5ebb96234a29483280551bb", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "gc_matrix_eval_tendsto", + "line": 18, + "source_header": "e\n\nprivate theorem gc_matrix_eval_tendsto {ι R : Type*} [Fintype ι] [DecidableEq ι]\n {u : Filter R} {S : R → Matrix ι ι ℝ} {S0 : Matrix ι ι ℝ}\n (hS : Tendsto S u (𝓝 S0)) (z : EuclideanSpace ℝ ι) :\n Tendsto (fun r => Matrix.toEuclideanCLM (" + }, + { + "kind": "def", + "unqualified_name": "gc_coupledVector", + "line": 35, + "source_header": "c\n\n/-- The canonical affine vector on one common standard Gaussian space. -/\nnoncomputable def gc_coupledVector {ι : Type*} [Fintype ι] [DecidableEq ι]\n (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) (z : EuclideanSpace ℝ ι) :\n EuclideanSpace" + }, + { + "kind": "theorem", + "unqualified_name": "gc_coupledVector_hasLaw", + "line": 40, + "source_header": ") z\n\n/-- Exact marginal law; this is the pinned multivariateGaussian definition. -/\ntheorem gc_coupledVector_hasLaw {ι : Type*} [Fintype ι] [DecidableEq ι]\n (m : EuclideanSpace ℝ ι) (S : Matrix ι ι ℝ) :\n HasLaw (gc_coupledVector m S) (multivariateGaussian m S)\n (stdGaussian (EuclideanSpace ℝ ι)) where\n aemeasu" + }, + { + "kind": "theorem", + "unqualified_name": "gc_coupledVector_tendsto", + "line": 48, + "source_header": "= rfl\n\n/-- Every common Gaussian coordinate converges when means and PSD covariances\nconverge. No invertibility, fixed rank, or square-root Lipschitz estimate. -/\ntheorem gc_coupledVector_tendsto {ι κ : Type*} [Fintype ι] [DecidableEq ι]\n (u : Filter κ) (m : κ → EuclideanSpace ℝ ι) (S : κ → Matrix ι ι ℝ)\n (m0 : EuclideanSpace ℝ ι) (S0 : Matrix ι ι ℝ)\n (hm : Tendsto m u (𝓝 m0)) (hS : Tendsto S u (𝓝 S0))\n (hPSD : ∀ᶠ t in u, (S t).PosSemidef) (hPSD0 : S0.PosSemidef)\n (z : EuclideanSpace ℝ ι) :\n Tendsto (fun t => gc_coupledVector (m t) (S t) z) u\n (𝓝 (gc_coupledVector m0" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianNormalizer.lean", + "sha256": "32b7202cba2a9a0e0ed603d1a6db9ba2031714375b4e955614d5a40826a14aeb", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gn_normalizedWeight", + "line": 24, + "source_header": "e\n\n/-- The six coordinates are aM,aS,bM,bS,cM,cS. For physical positive radius,\nthe source identifies this continuous expression with its typed W_r/r². -/\nnoncomputable def gn_normalizedWeight (r : ℝ) (v : Fin 6 → ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "gn_gaussian_reference_integrable_pos", + "line": 30, + "source_header": ") 0\n\n/-- The contact negative-curvature reference has an integrable, strictly\npositive squared negative part, with arbitrary mean and nonzero variance. -/\ntheorem gn_gaussian_reference_integrable_pos (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0) :\n Integrable (fun q : ℝ => (max (-q) 0)^2) (gaussianReal m v) ∧\n 0 < ∫ q : ℝ, (max (-q) 0)^2 ∂gaussianRea" + }, + { + "kind": "theorem", + "unqualified_name": "gn_open_box_floor", + "line": 67, + "source_header": "hmass\n\n/-- An explicit open endpoint box has a uniform positive normalized weight.\nThis is a pointwise component, with no claimed probability mass for the box. -/\ntheorem gn_open_box_floor\n (r K : ℝ) (v : Fin 6 → ℝ)\n (hr : 0 ≤ r) (hK : 0 < K) (hsmall : r * K^2 ≤ 1/4)\n (haM : v 0 ∈ Set.Ioo (-5/4) (-3/4))\n (haS : v 1 ∈ Set.Ioo (3/4) (5/4))\n (hbM : |v 2| < K) (_hbS : |v 3| < K)\n (hcM : v 4 ∈ Set.Ioo (-2) (-1))\n (hcS : v 5 ∈ Set.Ioo (-2) (-1)) :\n (3 : ℝ)/8 ≤ gn_normalizedWei" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/GaussianScalarMoments.lean", + "sha256": "71ce88ad2c97891858a5196f3293907bdffdd2341dfbace24204f2318c7510df", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "gm8C8", + "line": 16, + "source_header": "e\n\nnoncomputable def gm8C8 :" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_standard_integrable", + "line": 18, + "source_header": "1\n\ntheorem gm8_standard_integrable :\n Integrable (fun z : ℝ => |z| ^ 8) (gaussianReal 0 1" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_standard_nonneg", + "line": 24, + "source_header": ")\n\ntheorem gm8_standard_nonneg : 0 ≤ gm8C" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_integrable", + "line": 27, + "source_header": ")\n\nprivate theorem gm8_integrable (m : ℝ) (v : ℝ≥0) :\n Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_sqrt_pow", + "line": 33, + "source_header": ")\n\nprivate theorem gm8_sqrt_pow (V : ℝ) (hV : 0 ≤ V) :\n (Real.sqrt V) ^ 8 = V ^" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_affine_map", + "line": 39, + "source_header": "]\n\nprivate theorem gm8_affine_map (m : ℝ) (v : ℝ≥0) :\n (gaussianReal 0 1).map (fun z : ℝ => m + Real.sqrt (v : ℝ) * z) =\n gaussianReal m" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_affine_bound", + "line": 54, + "source_header": "y\n\nprivate theorem gm8_affine_bound (m B V : ℝ) (v : ℝ≥0) (hB : 0 ≤ B) (hV : 0 ≤ V)\n (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) (z : ℝ) :\n |m + Real.sqrt (v : ℝ) * z| ^ 8 ≤ 128 * (B ^ 8 + V ^ 4 * |z| ^ 8" + }, + { + "kind": "theorem", + "unqualified_name": "gm8_scalar_integrable_bound", + "line": 72, + "source_header": "]\n\n/-- Bounded means and variances give a uniform eighth-moment bound, including\nzero variance and nonzero means. No eighth-moment hypothesis is assumed. -/\ntheorem gm8_scalar_integrable_bound (m B V : ℝ) (v : ℝ≥0)\n (hB : 0 ≤ B) (hV : 0 ≤ V) (hm : |m| ≤ B) (hv : (v : ℝ) ≤ V) :\n Integrable (fun x : ℝ => |x| ^ 8) (gaussianReal m v) ∧\n (∫ x : ℝ, |x| ^ 8 ∂gaussianReal m v) ≤\n 128 * (B ^ 8 + V ^ 4 * gm8" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/NormalizerFloor.lean", + "sha256": "428eefd71b8c64fc4bcb208d9f73658058f29765f01a01c591f20a2d2359ec3e", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "nfloor_eventually_lower_of_fatou", + "line": 23, + "source_header": "e\n\nprivate theorem nfloor_eventually_lower_of_fatou {Ω ι : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (u : Filter ι) [IsCountablyGenerated u] [NeBot u]\n (f : ι → Ω → ℝ) (g : Ω → ℝ)\n (hmeas : ∀ r, Measurable (f r))\n (hnonneg : ∀ r ω, 0 ≤ f r ω)\n (hg : Integrable g P) (hgpos : 0 < ∫ ω, g ω ∂P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => f r ω) u (𝓝 (g ω)))\n (hfint : ∀ᶠ r in u, Integrable (f r) P) :\n ∀ᶠ r in u, (∫ ω, g ω ∂P)/2 ≤ ∫ ω, f r ω ∂" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_weight_continuous", + "line": 52, + "source_header": "e\n\nprivate theorem nfloor_weight_continuous :\n Continuous (fun p : ℝ × (Fin 6 → ℝ) => gn_normalizedWeight p.1 p.2" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_contact_value", + "line": 57, + "source_header": "p\nprivate theorem nfloor_contact_value (a q : ℝ) :\n gn_normalizedWeight 0 ![-1,1,-a/2,a/2,q,q] = (max (-q) 0)^" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_weight_limit", + "line": 60, + "source_header": "]\nprivate theorem nfloor_weight_limit (X : ℝ → Fin 6 → ℝ) (a q : ℝ)\n (hX : Tendsto X (𝓝[>] (0:ℝ)) (𝓝 ![-1,1,-a/2,a/2,q,q])) :\n Tendsto (fun r => gn_normalizedWeight r (X r)) (𝓝[>] (0:ℝ))\n (𝓝 ((max (-q) 0)^2)" + }, + { + "kind": "theorem", + "unqualified_name": "nfloor_reference", + "line": 68, + "source_header": ")\nprivate theorem nfloor_reference {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) (Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hlaw : HasLaw Q (gaussianReal m v) P) :\n Integrable (fun ω => (max (-Q ω) 0)^2) P ∧\n 0 < ∫ ω, (max (-Q ω) 0)^2 ∂" + }, + { + "kind": "theorem", + "unqualified_name": "gn_normalizer_floor_of_common_coupling", + "line": 78, + "source_header": "s\n\n/-- The actual integral of the physical r²-scaled continuous endpoint weight\nhas a positive lower constant at every sufficiently small positive radius.\nThe common coupling and current integrability are explicit premises; its\npositive reference integral and the lower bound are proved, not premises. -/\ntheorem gn_normalizer_floor_of_common_coupling\n {Ω : Type*} [MeasurableSpace Ω]\n (P : Measure Ω) [IsProbabilityMeasure P]\n (X : ℝ → Ω → Fin 6 → ℝ) (hX : ∀ r, Measurable (X r))\n (A Q : Ω → ℝ) (m : ℝ) (v : ℝ≥0) (hv : v ≠ 0)\n (hQ : HasLaw Q (gaussianReal m v) P)\n (hconv : ∀ᵐ ω ∂P, Tendsto (fun r => X r ω) (𝓝[>] (0 : ℝ))\n (𝓝 ![-1,1,-A ω/2,A ω/2,Q ω,Q ω]))\n (hint : ∀ᶠ r in 𝓝[>] (0 : ℝ),\n Integrable (fun ω => gn_normalizedWeight r (X r ω)) P) :\n ∃ c : ℝ, 0 < c ∧ ∃ δ : ℝ, 0 < δ ∧\n ∀ r : ℝ, 0 < r → r < δ →\n c * r^2 ≤ ∫ ω, r^2 * gn_normalizedWeight r (X r ω)" + } + ] + }, + { + "path": "frontiers/source_derivative_gaussian_20261025/inputs/ResearchFormalCoreR1/DeterminantMoment.lean", + "sha256": "661b73c3f21c6d2529f5e09ce426d89c01939ab27a5cc868db3802c7e66ea82d", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "DM2Jet", + "line": 20, + "source_header": "abbrev DM2Jet" + }, + { + "kind": "def", + "unqualified_name": "dm2Radius", + "line": 22, + "source_header": "def dm2Radius (j : DM2Jet) : ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2HM", + "line": 24, + "source_header": "noncomputable def dm2HM (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2HS", + "line": 28, + "source_header": "noncomputable def dm2HS (r : ℝ) (j : DM2Jet) : Matrix (Fin 2) (Fin 2) ℝ" + }, + { + "kind": "def", + "unqualified_name": "dm2Negative", + "line": 32, + "source_header": "/-- The source's negative-definite condition, stated as the quadratic form. -/\ndef dm2Negative (H : Matrix (Fin 2) (Fin 2) ℝ) : Pro" + }, + { + "kind": "def", + "unqualified_name": "dm2Weight", + "line": 36, + "source_header": "0\n\nnoncomputable def dm2Weight (r : ℝ) (j : DM2Jet) :" + }, + { + "kind": "lemma", + "unqualified_name": "dm2_scale", + "line": 41, + "source_header": "0\n\nprivate lemma dm2_scale (r x : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1) :\n |r*x| ≤ |x" + }, + { + "kind": "lemma", + "unqualified_name": "dm2_factors", + "line": 46, + "source_header": "]\n\nprivate lemma dm2_factors (r A B C R : ℝ) (hr : 0 ≤ r) (hr1 : r ≤ 1)\n (hR : 0 ≤ R) (hA : |A| ≤ R) (hB : |B| ≤ R) (hC : |C| ≤ R) :\n |A*C-r*B^2| ≤ 2*R^" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_untyped", + "line": 58, + "source_header": ")\n\n/-- Exact untyped determinant domination; no jet-coordinate or type assumptions. -/\ntheorem dm2_untyped (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :\n ((dm2HM r j).det * (dm2HS r j).det)^2 ≤ 16*r^4*dm2Radius" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_pointwise", + "line": 127, + "source_header": "ing\n\n/-- P02-LM-002 section 2, with the literal quadratic-form type indicator. -/\ntheorem dm2_pointwise (r : ℝ) (j : DM2Jet) (hr : 0 < r) (hr1 : r ≤ 1) :\n dm2Weight r j ^ 2 ≤ 16*r^4*dm2Radiu" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_negative_iff", + "line": 137, + "source_header": "vity)\n\n/-- Two-dimensional Sylvester criterion for the literal quadratic-form definition. -/\ntheorem dm2_negative_iff (a b c : ℝ) :\n dm2Negative !![a,b;b,c] ↔ a < 0 ∧ 0 <" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_weight_measurable", + "line": 170, + "source_header": "inarith\n\n/-- Measurability of the exact typed weight, with no assumed type-null boundary. -/\ntheorem dm2_weight_measurable (r : ℝ) : Measurable (dm2" + }, + { + "kind": "theorem", + "unqualified_name": "dm2_moment", + "line": 191, + "source_header": "ble_const\n\n/-- P02-LM-002's expectation step: eighth-moment control supplies integrability\nand the second moment, rather than presupposing that second moment. -/\ntheorem dm2_moment {Ω : Type*} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω)\n (J : Ω → DM2Jet) (hJ : Measurable J) (r M8 : ℝ) (hr : 0 < r) (hr1 : r ≤ 1)\n (h8 : MeasureTheory.Integrable (fun x => dm2Radius (J x)^8) μ)\n (hM8 : (∫ x, dm2Radius (J x)^8 ∂μ) ≤ M8) :\n MeasureTheory.Integrable (fun x => dm2Weight r (J x)^2) μ ∧\n (∫ x, dm2Weight r (J x)^2 ∂μ)" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:frontiers/source_lifetime_realization_20261017", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeGeometry.lean", + "sha256": "8ec4b18959055f20d849337e44a70d0c5b39b7959b54cb4d7b6c2a473ee0612d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeControls.lean", + "sha256": "f50da7cb374c3e75280ae465696b657902f9070cff1256784dc28050017cd171" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceThetaBridge.lean", + "sha256": "c03df303f47ac056af332ad421a6720966464c474ee77e671f85242d30f6cc9b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeAxiomAudit.lean", + "sha256": "fea8df29106f295238b3a039bb2aae350167a9ada2326d6d00ba6f6663be52c3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeField.lean", + "sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmooth.lean", + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothCarrier.lean", + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceKernel.lean", + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorus.lean", + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SpectralWeights.lean", + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothControls.lean", + "sha256": "8eca5ecdb5e2a0c1cb786468b340e4516df653468f958e535f156baafef088b4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceFourierSeries.lean", + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceCovariance.lean", + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceGaussianLaw.lean", + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/GaussianSeriesFoundation.lean", + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceTorusC4.lean", + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceC4.lean", + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_lifetime_realization_20261017/inputs/SourceLattice.lean", + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b" + } + ], + "source_record_sha256": "5f7cacd0c3a353c54ea3baf38a3b5c7f134b8f4e60d80a00e73a1b4918d55ae0", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "frontiers/source_lifetime_realization_20261017", + "source_files": [ + { + "path": "frontiers/source_lifetime_realization_20261017/SourceLifetimeGeometry.lean", + "sha256": "8ec4b18959055f20d849337e44a70d0c5b39b7959b54cb4d7b6c2a473ee0612d", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "coordinates", + "line": 14, + "source_header": "d\n\ndef coordinates (d : ℕ) : E d ≃L[ℝ] (Fin d → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "coordinates_latticeVec", + "line": 20, + "source_header": "l\n\ntheorem coordinates_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :\n coordinates d (latticeVec d L n) = fun i => L * (n i : ℝ" + }, + { + "kind": "def", + "unqualified_name": "actualField", + "line": 25, + "source_header": "]\n\n/-- The same carrier, same law, and same literal source; only spatial coordinates change. -/\ndef actualField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : E d)" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_smooth", + "line": 29, + "source_header": "x)\n\ntheorem actualField_smooth (d : ℕ) {L : ℝ} (hL : 0 < L)\n (ω : SmoothSample d L) : IsSmooth d (actualField d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_periodic", + "line": 35, + "source_header": "iff\n\ntheorem actualField_periodic (d : ℕ) {L : ℝ} (hL : 0 < L)\n (ω : SmoothSample d L) : IsLPeriodic d L (actualField d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_eval_measurable", + "line": 43, + "source_header": "x)\n\ntheorem actualField_eval_measurable (d : ℕ) (L : ℝ) (x : E d) :\n Measurable (fun ω => actualField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_eval_hasGaussianLaw", + "line": 48, + "source_header": "L)\n\ntheorem actualField_eval_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x : E d) : HasGaussianLaw (fun ω => actualField d L ω x) (smoothLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_measurable", + "line": 53, + "source_header": "l 0\n\ntheorem actualField_linearCombination_measurable (d : ℕ) (L : ℝ) {m : ℕ}\n (x : Fin m → E d) (a : Fin m → ℝ) :\n Measurable (fun ω => ∑ i, a i * actualField d L ω (x" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_hasGaussianLaw", + "line": 59, + "source_header": ")))\n\ntheorem actualField_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ}\n (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n HasGaussianLaw (fun ω => ∑ i, a i * actualField d L ω (x i)) (smoothLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_integral_zero", + "line": 73, + "source_header": "map\n\ntheorem actualField_integral_zero (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n ∫ ω, actualField d L ω x ∂smoothLaw d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_integral_zero", + "line": 82, + "source_header": "x)\n\ntheorem actualField_linearCombination_integral_zero (d : ℕ) {L : ℝ}\n (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n ∫ ω, (∑ i, a i * actualField d L ω (x i)) ∂smoothLaw d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_covariance_spectral", + "line": 90, + "source_header": "ro]\n\ntheorem actualField_covariance_spectral (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =\n I4Kernel.sourceSpectralKernel d L (coordinates d (x -" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/SourceLifetimeControls.lean", + "sha256": "f50da7cb374c3e75280ae465696b657902f9070cff1256784dc28050017cd171", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "unrestrictedEndpoint", + "line": 13, + "source_header": "s\n\ndef unrestrictedEndpoint (d : ℕ) (L : ℝ) (hL : 0 < L) :\n GaussianFieldInterface d" + }, + { + "kind": "theorem", + "unqualified_name": "literalCarrier", + "line": 16, + "source_header": "L\n\ntheorem literalCarrier (d : ℕ) (L : ℝ) (hL : 0 < L) :\n (actualGaussianFieldInterface d L hL).Ω = SmoothSample d" + }, + { + "kind": "theorem", + "unqualified_name": "literalLaw", + "line": 19, + "source_header": "l\n\ntheorem literalLaw (d : ℕ) (L : ℝ) (hL : 0 < L) :\n (actualGaussianFieldInterface d L hL).P = smoothLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "literalField", + "line": 22, + "source_header": "l\n\ntheorem literalField (d : ℕ) (L : ℝ) (hL : 0 < L)\n (ω : SmoothSample d L) (x : E d) :\n (actualGaussianFieldInterface d L hL).F ω x =\n smoothSourceField d L ω (EuclideanSpace.equiv (Fin d) ℝ x" + }, + { + "kind": "theorem", + "unqualified_name": "sameCarrierOrders", + "line": 27, + "source_header": "l\n\ntheorem sameCarrierOrders (d : ℕ) (L : ℝ) (hL : 0 < L)\n (ω : SmoothSample d L) :\n ContDiff ℝ 5 ((actualGaussianFieldInterface d L hL).F ω) ∧\n ContDiff ℝ 37 ((actualGaussianFieldInterface d L hL).F ω" + }, + { + "kind": "theorem", + "unqualified_name": "wholeCoefficientLaw", + "line": 34, + "source_header": "⟩\n\ntheorem wholeCoefficientLaw (d : ℕ) (L : ℝ) (hL : 0 < L) :\n (actualGaussianFieldInterface d L hL).P.map (sampleInclusion d L) =\n I4Source.sourceLaw" + }, + { + "kind": "theorem", + "unqualified_name": "periodicCovariance_zero", + "line": 38, + "source_header": "'\n\ntheorem periodicCovariance_zero (d : ℕ) {L : ℝ} (hL : 0 < L) :\n periodicCovariance d L 0 =" + }, + { + "kind": "theorem", + "unqualified_name": "rawDiagonalOne", + "line": 42, + "source_header": ")\n\ntheorem rawDiagonalOne (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n ∫ ω, actualField d L ω x * actualField d L ω x ∂smoothLaw d L =" + }, + { + "kind": "theorem", + "unqualified_name": "zeroMean", + "line": 46, + "source_header": "]\n\ntheorem zeroMean (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n ∫ ω, actualField d L ω x ∂smoothLaw d L =" + }, + { + "kind": "theorem", + "unqualified_name": "dimensionZeroTheta", + "line": 50, + "source_header": "x\n\ntheorem dimensionZeroTheta (L : ℝ) : thetaSum 0 L 0 =" + }, + { + "kind": "theorem", + "unqualified_name": "dimensionZeroSpectralNormalizer", + "line": 53, + "source_header": "]\n\ntheorem dimensionZeroSpectralNormalizer (L : ℝ) : I4Weights.sourceZ 0 L =" + }, + { + "kind": "theorem", + "unqualified_name": "dimensionZeroRawVariance", + "line": 56, + "source_header": "]\n\ntheorem dimensionZeroRawVariance (L : ℝ) (hL : 0 < L) :\n ∫ ω, actualField 0 L ω 0 * actualField 0 L ω 0 ∂smoothLaw 0 L =" + }, + { + "kind": "theorem", + "unqualified_name": "emptyQuad", + "line": 60, + "source_header": "0\n\ntheorem emptyQuad (d : ℕ) (L : ℝ) (x : Fin 0 → E d) (a : Fin 0 → ℝ) :\n covQuadForm d L x a =" + }, + { + "kind": "theorem", + "unqualified_name": "emptyFamilyLaw", + "line": 63, + "source_header": "]\n\ntheorem emptyFamilyLaw (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x : Fin 0 → E d) (a : Fin 0 → ℝ) :\n (smoothLaw d L).map (fun ω => ∑ i, a i * actualField d L ω (x i)) =\n Measure.dirac" + }, + { + "kind": "theorem", + "unqualified_name": "cancelledQuad", + "line": 73, + "source_header": ")\n\ntheorem cancelledQuad (d : ℕ) {L : ℝ} (_hL : 0 < L) (x : E d) :\n covQuadForm d L ![x, x] ![1, -1] =" + }, + { + "kind": "theorem", + "unqualified_name": "cancelledSample", + "line": 77, + "source_header": "]\n\ntheorem cancelledSample (d : ℕ) (L : ℝ) (x : E d) (ω : SmoothSample d L) :\n (∑ i : Fin 2, (![1, -1] : Fin 2 → ℝ) i *\n actualField d L ω ((![x, x] : Fin 2 → E d) i)) =" + }, + { + "kind": "theorem", + "unqualified_name": "cancelledLaw", + "line": 82, + "source_header": "]\n\ntheorem cancelledLaw (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n (smoothLaw d L).map (fun ω => ∑ i : Fin 2,\n (![1, -1] : Fin 2 → ℝ) i * actualField d L ω ((![x, x] : Fin 2 → E d) i)) =\n Measure.dirac" + }, + { + "kind": "theorem", + "unqualified_name": "reinforcedQuad", + "line": 93, + "source_header": ")\n\ntheorem reinforcedQuad (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n covQuadForm d L ![x, x] ![1, 1] =" + }, + { + "kind": "theorem", + "unqualified_name": "reinforcedLaw", + "line": 97, + "source_header": "]\n\ntheorem reinforcedLaw (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n (smoothLaw d L).map (fun ω => ∑ i : Fin 2,\n (![1, 1] : Fin 2 → ℝ) i * actualField d L ω ((![x, x] : Fin 2 → E d) i)) =\n gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "everyLatticeTranslation", + "line": 106, + "source_header": "m\n\ntheorem everyLatticeTranslation (d : ℕ) (L : ℝ) (hL : 0 < L)\n (ω : SmoothSample d L) (x : E d) (n : Fin d → ℤ) :\n actualField d L ω (x + latticeVec d L n) = actualField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "euclideanNormSquared", + "line": 111, + "source_header": "n\n\ntheorem euclideanNormSquared :\n ‖(WithLp.toLp 2 (![1, 1] : Fin 2 → ℝ) : E 2)‖ ^ 2 =" + }, + { + "kind": "theorem", + "unqualified_name": "shiftedMeanOne", + "line": 115, + "source_header": "]\n\n/-- Adding one leaves centered covariance unchanged, but violates the required mean. -/\ntheorem shiftedMeanOne (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n ∫ ω, (actualField d L ω x + 1) ∂smoothLaw d L" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/SourceThetaBridge.lean", + "sha256": "c03df303f47ac056af332ad421a6720966464c474ee77e671f85242d30f6cc9b", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "latticeVec_apply", + "line": 15, + "source_header": "e\n\ntheorem latticeVec_apply (d : ℕ) (L : ℝ) (n : Fin d → ℤ) (j : Fin d) :\n latticeVec d L n j = L * (n j : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "theta_summand_eq_product", + "line": 21, + "source_header": "p\n\ntheorem theta_summand_eq_product (d : ℕ) (L : ℝ) (z : E d) (n : Fin d → ℤ) :\n Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2) =\n ∏ j, Real.exp (-((z j + L * (n j : ℝ)) ^ 2) / 2" + }, + { + "kind": "theorem", + "unqualified_name": "shifted_gaussian_le", + "line": 29, + "source_header": "]\n\ntheorem shifted_gaussian_le (L t : ℝ) (n : ℤ) :\n Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2) ≤\n Real.exp (t ^ 2 / 2) * decay (L ^ 2 / 4)" + }, + { + "kind": "theorem", + "unqualified_name": "shifted_gaussian_summable", + "line": 36, + "source_header": "]\n\ntheorem shifted_gaussian_summable {L : ℝ} (hL : 0 < L) (t : ℝ) :\n Summable (fun n : ℤ => Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2)" + }, + { + "kind": "theorem", + "unqualified_name": "theta_summable", + "line": 45, + "source_header": "n\n\ntheorem theta_summable (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :\n Summable (fun n : Fin d → ℤ =>\n Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2)" + }, + { + "kind": "theorem", + "unqualified_name": "theta_zero_pos", + "line": 61, + "source_header": "]\n\ntheorem theta_zero_pos (d : ℕ) {L : ℝ} (hL : 0 < L) :\n 0 < thetaSum d L" + }, + { + "kind": "theorem", + "unqualified_name": "summable_nonneg_fin_product", + "line": 66, + "source_header": "_\n\nprivate theorem summable_nonneg_fin_product\n (d : ℕ) (f : Fin d → ℤ → ℝ)\n (hf : ∀ j, Summable (f j)) (hn : ∀ j n, 0 ≤ f j n) :\n Summable (fun k : Fin d → ℤ => ∏ j, f j (k j)" + }, + { + "kind": "theorem", + "unqualified_name": "summable_norm_fin_product", + "line": 92, + "source_header": "p\n\nprivate theorem summable_norm_fin_product\n (d : ℕ) (f : Fin d → ℤ → ℂ)\n (hf : ∀ j, Summable (fun n : ℤ => ‖f j n‖)) :\n Summable (fun k : Fin d → ℤ => ‖∏ j, f j (k j)‖" + }, + { + "kind": "theorem", + "unqualified_name": "tsum_fin_product", + "line": 99, + "source_header": ")\n\nprivate theorem tsum_fin_product\n (d : ℕ) (f : Fin d → ℤ → ℂ)\n (hf : ∀ j, Summable (fun n : ℤ => ‖f j n‖)) :\n (∑' k : Fin d → ℤ, ∏ j, f j (k j)) = ∏ j, ∑' n : ℤ, f j" + }, + { + "kind": "def", + "unqualified_name": "poissonScale", + "line": 113, + "source_header": "]\n\nprivate def poissonScale (L : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "poissonScale_eq", + "line": 116, + "source_header": ")\n\nprivate theorem poissonScale_eq {L : ℝ} (hL : 0 < L) :\n poissonScale L = Real.sqrt (2 * Real.pi) /" + }, + { + "kind": "def", + "unqualified_name": "spectral1Term", + "line": 123, + "source_header": "p\n\nprivate def spectral1Term (L t : ℝ) (k : ℤ) :" + }, + { + "kind": "theorem", + "unqualified_name": "spectral1Term_norm", + "line": 127, + "source_header": ")\n\nprivate theorem spectral1Term_norm (L t : ℝ) (k : ℤ) :\n ‖spectral1Term L t k‖ = decay (2 * sourceA L)" + }, + { + "kind": "theorem", + "unqualified_name": "spectral1Term_summable_norm", + "line": 133, + "source_header": "]\n\nprivate theorem spectral1Term_summable_norm {L : ℝ} (hL : 0 < L) (t : ℝ) :\n Summable (fun k => ‖spectral1Term L t k‖" + }, + { + "kind": "theorem", + "unqualified_name": "poisson_one_dimension", + "line": 139, + "source_header": "0\n\nprivate theorem poisson_one_dimension {L : ℝ} (hL : 0 < L) (t : ℝ) :\n ((∑' n : ℤ, Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2) : ℝ) : ℂ) =\n (poissonScale L : ℂ) * ∑' k : ℤ, spectral1Term L t" + }, + { + "kind": "theorem", + "unqualified_name": "spectral1Term_prod", + "line": 191, + "source_header": "g\n\nprivate theorem spectral1Term_prod (d : ℕ) (L : ℝ) (x : Fin d → ℝ)\n (k : Fin d → ℤ) :\n (∏ j, spectral1Term L (x j) (k j)) =\n (sourceWeight d L k : ℂ) * Complex.exp ((phase d L k x : ℂ) * Complex.I" + }, + { + "kind": "theorem", + "unqualified_name": "complex_spectral_summable", + "line": 202, + "source_header": "]\n\nprivate theorem complex_spectral_summable (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x : Fin d → ℝ) :\n Summable (fun k : Fin d → ℤ => (sourceWeight d L k : ℂ) *\n Complex.exp ((phase d L k x : ℂ) * Complex.I)" + }, + { + "kind": "theorem", + "unqualified_name": "thetaSum_complex", + "line": 214, + "source_header": "]\n\nprivate theorem thetaSum_complex (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :\n (thetaSum d L z : ℂ) = (poissonScale L : ℂ) ^ d *\n ∑' k : Fin d → ℤ, (sourceWeight d L k : ℂ) *\n Complex.exp ((phase d L k (fun i => z i) : ℂ) * Complex.I" + }, + { + "kind": "theorem", + "unqualified_name": "thetaSum_eq_scaled_cos", + "line": 238, + "source_header": "k\n\ntheorem thetaSum_eq_scaled_cos (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :\n thetaSum d L z = (Real.sqrt (2 * Real.pi) / L) ^ d *\n ∑' k : Fin d → ℤ, sourceWeight d L k *\n Real.cos (phase d L k (fun i => z i)" + }, + { + "kind": "theorem", + "unqualified_name": "thetaSum_zero_eq", + "line": 249, + "source_header": "h\n\ntheorem thetaSum_zero_eq (d : ℕ) {L : ℝ} (hL : 0 < L) :\n thetaSum d L 0 = (Real.sqrt (2 * Real.pi) / L) ^ d * sourceZ d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSpectralKernel_eq_periodicCovariance", + "line": 253, + "source_header": ")\n\ntheorem sourceSpectralKernel_eq_periodicCovariance\n (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :\n I4Kernel.sourceSpectralKernel d L (fun i => z i) = periodicCovariance d L" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/SourceLifetimeAxiomAudit.lean", + "sha256": "fea8df29106f295238b3a039bb2aae350167a9ada2326d6d00ba6f6663be52c3", + "declarations_lexical": [] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/SourceLifetimeField.lean", + "sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "actualField_covariance", + "line": 15, + "source_header": "d\n\ntheorem actualField_covariance (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =\n periodicCovariance d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_raw_second_moment", + "line": 22, + "source_header": ")\n\ntheorem actualField_raw_second_moment (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n ∫ ω, actualField d L ω x * actualField d L ω y ∂smoothLaw d L =\n periodicCovariance d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_variance", + "line": 29, + "source_header": "y\n\ntheorem actualField_linearCombination_variance (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n Var[fun ω => ∑ i, a i * actualField d L ω (x i); smoothLaw d L] =\n covQuadForm d L x" + }, + { + "kind": "theorem", + "unqualified_name": "covQuadForm_nonneg", + "line": 44, + "source_header": "g\n\ntheorem covQuadForm_nonneg (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n 0 ≤ covQuadForm d L x" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_map", + "line": 50, + "source_header": "_\n\ntheorem actualField_linearCombination_map (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n (smoothLaw d L).map (fun ω => ∑ i, a i * actualField d L ω (x i)) =\n gaussianReal 0 ⟨covQuadForm d L x a, covQuadForm_nonneg d hL x a" + }, + { + "kind": "def", + "unqualified_name": "actualGaussianFieldInterface", + "line": 61, + "source_header": ")\n\n/-- The original target on the unchanged coefficient carrier and preserved source law. -/\ndef actualGaussianFieldInterface (d : ℕ) (L : ℝ) (hL : 0 < L) :\n GaussianFieldInterface d L where" + }, + { + "kind": "theorem", + "unqualified_name": "actualGaussianFieldInterface_exists", + "line": 76, + "source_header": "hL\n\ntheorem actualGaussianFieldInterface_exists (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Nonempty (GaussianFieldInterface d" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceSmooth.lean", + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "orderCoordinateBound", + "line": 24, + "source_header": "h\n\ndef orderCoordinateBound (n : ℕ) (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderProductBound", + "line": 27, + "source_header": "n\n\ndef orderProductBound (n d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderPairedBound", + "line": 30, + "source_header": ")\n\ndef orderPairedBound (n d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderModeBound", + "line": 33, + "source_header": "k\n\ndef orderModeBound (n d : ℕ) (L : ℝ) (m : SourceMode d) :" + }, + { + "kind": "theorem", + "unqualified_name": "orderCoordinateBound_summable", + "line": 38, + "source_header": "k\n\ntheorem orderCoordinateBound_summable (n : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderCoordinateBound n a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderProductBound_summable", + "line": 59, + "source_header": "g\n\ntheorem orderProductBound_summable (n d : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderProductBound n d a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_summable", + "line": 64, + "source_header": "d\n\ntheorem orderPairedBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderPairedBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_eq_amplitude", + "line": 68, + "source_header": "_\n\ntheorem orderPairedBound_eq_amplitude (n d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : Fin d → ℤ) :\n orderPairedBound n d L k =\n Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_nonneg", + "line": 92, + "source_header": "g\n\ntheorem orderModeBound_nonneg (n d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_summable", + "line": 100, + "source_header": "y\n\ntheorem orderModeBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_four", + "line": 115, + "source_header": "e\n\ntheorem orderModeBound_four (d : ℕ) (L : ℝ) (m : SourceMode d) :\n orderModeBound 4 d L m = modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_order_bound", + "line": 119, + "source_header": "l\n\ntheorem modeCoefficient_iteratedFDeriv_order_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ orderModeBound j d L" + }, + { + "kind": "def", + "unqualified_name": "goodSample", + "line": 179, + "source_header": "]\n\n/-- One explicit coefficient event, shared by every derivative order. -/\ndef goodSample (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : P" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_ae", + "line": 183, + "source_header": "m|)\n\ntheorem goodSample_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, goodSample d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_of_goodSample", + "line": 190, + "source_header": "hL)\n\ntheorem sourceField_smooth_of_goodSample (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (hω : goodSample d L ω) :\n ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_ae", + "line": 222, + "source_header": "m))\n\ntheorem sourceField_smooth_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_congr_cofinite", + "line": 227, + "source_header": "hω\n\n/-- The carrier depends only on the coefficient tail; finite coordinate changes\ncannot destroy any derivative-order summability condition. -/\ntheorem goodSample_congr_cofinite (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (hωη : ω =ᶠ[Filter.cofinite] η) :\n goodSample d L ω ↔ goodSample" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_finite_change_iff", + "line": 242, + "source_header": "[hm]\n\ntheorem goodSample_finite_change_iff (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))\n (hωη : ∀ m ∉ s, ω m = η m) :\n goodSample d L ω ↔ goodSample" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothCarrier.lean", + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "goodSet", + "line": 30, + "source_header": "r\n\n/-- The actual common coefficient event, with no smoothness premise added. -/\ndef goodSet (d : ℕ) (L : ℝ) : Set (SourceMode d →" + }, + { + "kind": "def", + "unqualified_name": "orderAbsNN", + "line": 34, + "source_header": "ω}\n\nprivate def orderAbsNN (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ)\n (m : SourceMode d) :" + }, + { + "kind": "def", + "unqualified_name": "orderAbsTotal", + "line": 39, + "source_header": "_)⟩\n\nprivate def orderAbsTotal (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_ne_top_iff", + "line": 42, + "source_header": "0∞)\n\nprivate theorem orderAbsTotal_ne_top_iff (n d : ℕ) (L : ℝ)\n (ω : SourceMode d → ℝ) :\n orderAbsTotal n d L ω ≠ ∞ ↔\n Summable (fun m => orderModeBound n d L m * |ω" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_measurable", + "line": 48, + "source_header": "ω)\n\nprivate theorem orderAbsTotal_measurable (n d : ℕ) (L : ℝ) :\n Measurable (orderAbsTotal n d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measurable", + "line": 62, + "source_header": "eal\n\ntheorem goodSet_measurable (d : ℕ) (L : ℝ) : MeasurableSet (goodSet d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_ae", + "line": 75, + "source_header": "imp\n\ntheorem goodSet_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ω ∈ goodSet" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measure_one", + "line": 79, + "source_header": "hL\n\ntheorem goodSet_measure_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceLaw d (goodSet d L)" + }, + { + "kind": "abbrev", + "unqualified_name": "SmoothSample", + "line": 83, + "source_header": "hL)\n\n/-- A coefficient sample on the explicit all-order summability carrier. -/\nabbrev SmoothSample (d : ℕ) (L" + }, + { + "kind": "def", + "unqualified_name": "sampleInclusion", + "line": 86, + "source_header": "d L)\n\n/-- Literal inclusion, retaining every coefficient of the original sample. -/\ndef sampleInclusion (d : ℕ) (L : ℝ) : SmoothSample d L → (SourceMode" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurable", + "line": 90, + "source_header": "ype.val\n\ntheorem sampleInclusion_measurable (d : ℕ) (L : ℝ) :\n Measurable (sampleInclusi" + }, + { + "kind": "def", + "unqualified_name": "smoothLaw", + "line": 94, + "source_header": "ype_coe\n\n/-- Pull back the original product law; no normalization or new law is chosen. -/\ndef smoothLaw (d : ℕ) (L : ℝ) : Measure (SmoothSa" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_map", + "line": 98, + "source_header": "sion d L)\n\ntheorem sampleInclusion_map (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n (smoothLaw d L).map (sampleInclusion d L) = so" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurePreserving", + "line": 105, + "source_header": "ae d hL)]\n\ntheorem sampleInclusion_measurePreserving (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothLaw_isProbabilityMeasure", + "line": 109, + "source_header": "map d hL⟩\n\ntheorem smoothLaw_isProbabilityMeasure (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsProbabilityMeasure (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "observation_map_eq", + "line": 114, + "source_header": "t_ae d hL\n\n/-- Every measurable observation has exactly its original pushforward law. -/\ntheorem observation_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :\n (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceL" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 121, + "source_header": "n_map d hL]\n\ntheorem coordinate_marginal (d : ℕ) {L : ℝ} (hL : L ≠ 0) (m : SourceMode d) :\n (smoothLaw d L).map (fun ω => sampleInclusion d L ω m) = gauss" + }, + { + "kind": "theorem", + "unqualified_name": "finiteCoordinate_map_eq", + "line": 126, + "source_header": "_marginal m\n\ntheorem finiteCoordinate_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (m : Fin n → SourceMode d) :\n (smoothLaw d L).map (fun ω j => sampleInclusion d L ω (m j)) =\n (sourceLaw d).map (fun ω j" + }, + { + "kind": "def", + "unqualified_name": "smoothSourceField", + "line": 132, + "source_header": "ply (m j)))\n\n/-- The unchanged literal real-cover field, evaluated on the carrier. -/\ndef smoothSourceField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : F" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_contDiff", + "line": 136, + "source_header": "sion d L ω) x\n\ntheorem smoothSourceField_contDiff (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) (n : ℕ) : ContDiff ℝ n (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_smooth", + "line": 140, + "source_header": "ω.property n\n\ntheorem smoothSourceField_smooth (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ (⊤ : ℕ∞) (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_map_eq", + "line": 144, + "source_header": "tDiff d hL ω)\n\ntheorem smoothSourceField_finiteVector_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n (smoothLaw d L).map (fun ω j => smoothSourceField d L ω (x j)) =\n (sourceLaw d).map (fun ω j => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_hasGaussianLaw", + "line": 151, + "source_header": "e d L (x j)))\n\ntheorem smoothSourceField_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => smoothSourceField d L ω (x j)) (s" + }, + { + "kind": "theorem", + "unqualified_name": "covariance_comp_inclusion", + "line": 161, + "source_header": "sGaussian_map\n\ntheorem covariance_comp_inclusion (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (X Y : (SourceMode d → ℝ) → ℝ) (hX : Measurable X) (hY : Measurable Y) :\n cov[fun ω => X (sampleInclusion d L ω), fun ω => Y (sampleInclusion d L ω); smoothLaw d L] =\n cov[X, Y;" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_covariance", + "line": 171, + "source_header": "exact h.symm\n\ntheorem smoothSourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (x y : Fin d → ℝ) :\n cov[fun ω => smoothSourceField d L ω x, fun ω => smoothSourceField d L ω y; smoothLaw d L] =\n sourceSpectralKerne" + }, + { + "kind": "def", + "unqualified_name": "smoothTorusSourceField", + "line": 181, + "source_header": "ance d hL x y\n\n/-- The unchanged literal torus descent of the same coefficient sample. -/\ndef smoothTorusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) (q : Sourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_smooth", + "line": 188, + "source_header": "ualChartedSpace\n\ntheorem smoothTorusSourceField_smooth (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) :\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) (⊤ : ℕ∞) (smoothTorusSou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_finiteVector_hasGaussianLaw", + "line": 205, + "source_header": "ontDiffWithinAt\n\ntheorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ)\n [Fact (0 < L)] (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => smoothTorusSourceField d L ω (q j))" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_covariance", + "line": 218, + "source_header": ".isGaussian_map\n\ntheorem smoothTorusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => smoothTorusSourceField d L ω q, fun ω => smoothTorusSourceField d L ω p;\n smoothLaw d L] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepres" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 65, + "source_header": "y\n\n/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this\nnamespace). The duplication is deliberate: modules of this packet import only Mathlib. -/\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 77, + "source_header": "in d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 86, + "source_header": "i : ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 97, + "source_header": "^ 2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 109, + "source_header": "taSum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : F" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 120, + "source_header": "L (x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g :" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 129, + "source_header": "ec d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 138, + "source_header": "ℕ, ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 180, + "source_header": "y ∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 190, + "source_header": ": ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoi" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 199, + "source_header": "ℝ) (x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 215, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNon" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 225, + "source_header": "iticalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsInd" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 235, + "source_header": "alPoint d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 244, + "source_header": ": ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnon" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 253, + "source_header": "nS (d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence modul" + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 283, + "source_header": "tGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsC" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 302, + "source_header": "NondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the sourc" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 315, + "source_header": "IsCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNond" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 351, + "source_header": "gMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 363, + "source_header": "p :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pai" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 374, + "source_header": "ndDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d :" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 385, + "source_header": "E d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gau" + }, + { + "kind": "def", + "unqualified_name": "IsWindowPair", + "line": 407, + "source_header": "A ∧\n ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)\n\n/-! ### Populations of pairs -/\n\n/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with\n`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none beyond the shared predicates.\nDoes not claim: anything about the off-diagonal (far) population separately (Section" + }, + { + "kind": "structure", + "unqualified_name": "PairLawInterface", + "line": 442, + "source_header": ": ℝ) (g : E d → ℝ) (M S : E d) : Prop :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S\n\n/-! ### The typed pair law as an interface -/\n\n/-- Interface for the weighted regression (typed pair) law: the only object consumed by the\nstatements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death\npartner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the\nlaw `Q^W = (W_r/Z_r) Q_{r,b,k,R}` with `W_r = |det H_M det H_S| 1{H_M<0, index(H_S)=d-1}`.\nThat law, its weight, its normalizer and the regression construction are informal in the\nsource and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark\n`k` and orthonormal frame `R` with values in `[0, 1]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S.\"\nInterface: `p` is given; its only hypothesis fields are the bounds `0 ≤ p ≤ 1`. The parameters `G` and `I` record which field and which elder relation the law refers to; no field ties `p` to them.\nDoes not claim: existence of the regression law, the typed weight, the full normalizer `Z_r > 0`, or that `p` is the probability of any event under any measure declared here; that `p` depends on `G` or `I` in any way (no field mentions them; they only record which field and elder relation the law is meant to refer to). -/\nstructure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)\n (I : SuperlevelBarInterface d L) where\n /-- Section 1 clause: \"Let p_r(b,k,R) be the Q^W probability that the global ordinary\n superlevel elder death partner of M is S.\" -/\n p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R\n /-- `p` is a proba" + }, + { + "kind": "def", + "unqualified_name": "ParentUniformSelectionA", + "line": 466, + "source_header": "ility: at most one. -/\n p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1\n\n/-! ### The parent statements (1.1), (1.2), (1.3) -/\n\n/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`\nand `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)\nsuch that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all\northonormal frames `R`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There exist r_*>0 and C 0` and\nwindows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a\nconstant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and\nelder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,\n`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),\"\nInterface: `G` and `I` are given; \"versions\" are any `νc`, `νe` satisfying `IsLifetimeDensityVersion` (integral identity), not a Kac-Rice representation; the coefficient `c_{B,K}` is existential, not the Gaussian integral (11.3).\nDoes not claim: the parent result or its proof; the exact coefficient formula (11.3); existence of the versions; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef ParentCompactWindowDensityB (d :" + }, + { + "kind": "def", + "unqualified_name": "IsUnrestrictedLeadingCoefficient", + "line": 510, + "source_header": "r : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.\nThe essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the\nconclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,\nnot by the integral (13.6)/(15.2).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There is a positive finite constant c_{d,L} such that\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the explicit Gaussian/angular representation (15.2) of `c_{d,L}`; uniqueness of `c` (which follows from the asymptotics but is not stated); existence of versions. -/\ndef IsUnrestrictedLeadingC" + }, + { + "kind": "def", + "unqualified_name": "ParentUnrestrictedLeadingDensityC", + "line": 531, + "source_header": "∧\n Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe\n (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the\nunrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth\nheights, all positive gap marks, all separations; essential global maximum excluded) admit\nversions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the parent result or its proof (dominated convergence of Section 13, off-diagonal bound (14.1)); the representation (15.2); the compact-window `O(ell^(2/3))` difference for the unrestricted densities; any numerical enclosure of `c_{d,L}` (the SIDE24 coefficient track is separate); nonauthor review or acceptance. -/\ndef ParentUnrestr" + }, + { + "kind": "def", + "unqualified_name": "RemainderBoundedR1", + "line": 545, + "source_header": "(I : SuperlevelBarInterface d L) : Prop :=\n 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c\n\n/-! ### The bounded remainder (R1) -/\n\n/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed\n`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here\nby `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of\nthe unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,\n`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.\nThe `O(1)` remainder is stated with an explicit absolute-value bound.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a\nAnchor: \"|nu_cand(ell)-c ell^(-1/3)| <= C,\"\nInterface: `G` and `I` are given; `c` is any real satisfying the parent leading-coefficient property (the source says the coefficient \"is exactly the parent's equation (15.2)\"; that integral is not transcribed, so `c` is pinned through (1.3) instead); versions are characterised by the integral identity only. The statement does not mention the typed pair law: Theorem R does not consume (1.1).\nDoes not claim: the result or its proof (quadratic determinant cancellation (R7), coupling (R4), cap-loss bound (R12)); convergence of the remainder; a second coefficient; numerical `C` or `ell_*`; the compact-window `O(ell^(2/3))` difference without cutoffs; the parent interfaces it imports (D1-A-E); nonauthor review or acceptance. If no `c` satisfies the parent property the statement holds vacuously; that is a transcription of its dependency on (1.3), not a claim. -" + }, + { + "kind": "def", + "unqualified_name": "PlanarElderLowerE2", + "line": 569, + "source_header": "c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧\n |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C\n\n/-! ### Planar elder lower bound and density gap (d = 2) -/\n\n/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with\nbirth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging\nover `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all\n`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \"1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff\n`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the\ncompact-window candidate and ordinary elder densities satisfy\n`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper\ninput is an explicit hypothesis, not folded into the conclusion. The lower half, which the\nsource derives from (E2) alone, is stated under the same hypothesis because the source displays\n(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower\nhalf, recorded here as such.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \" <= C_{B,K} ell^(2/3). (E11)\"\nInterface: `G`, `I` and `PL` are given; the hypothesis `ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi` is the consumed parent upper input (a statement shape, not the parent result); versions are characterised by the integral identity only; the weighted Kac-Rice / radial ledger of [LP, Sections 9-11] that the source consumes is not transcribed. The interface does not determine `p` or the field: the Prop is a predicate on the interface objects, not a closed statement about the source's objects; nothing is asserted about its universal closure over all inhabitants, and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the result or its proof; the upper half independently of the parent (1.1); the parent (1.1) itself; the lower half without the hypothesis (the source has it from (E2) alone); sharpness of the `O(1)` remainder of (R1); removal of the compact-mark restriction; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef PlanarDensityGapE11 (L : ℝ) (G :" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceKernel.lean", + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "frequencyEquiv", + "line": 8, + "source_header": "def frequencyEquiv (d : ℕ) : SourceMode d ≃ (Fin d → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "sourceSpectralKernel", + "line": 11, + "source_header": "/-- The prescribed normalized full-lattice real Fourier kernel; image/Poisson linkage is separate. -/\ndef sourceSpectralKernel (d : ℕ) (L : ℝ) (z : Fin d → ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "tsum_mode", + "line": 15, + "source_header": ")\n\nprivate theorem tsum_mode (d : ℕ) (f : SourceMode d → ℝ) (hf : Summable f) :\n (∑' m, f m) = f none + ∑' k : ↥(halfLattice d),\n (f (some (k,false)) + f (some (k,true))" + }, + { + "kind": "theorem", + "unqualified_name": "modeProduct_summable", + "line": 33, + "source_header": "g\n\ntheorem modeProduct_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n Summable (fun m => modeCoefficient d L m x * modeCoefficient d L m y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_summable", + "line": 46, + "source_header": ")\n\ntheorem spectralKernel_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (z : Fin d → ℝ) :\n Summable (fun k : Fin d → ℤ =>\n sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)" + }, + { + "kind": "theorem", + "unqualified_name": "coefficientKernel_eq_fullLattice", + "line": 58, + "source_header": "q\n\ntheorem coefficientKernel_eq_fullLattice (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =\n sourceSpectralKernel d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_zero", + "line": 103, + "source_header": "m\n\ntheorem spectralKernel_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceSpectralKernel d L 0 =" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceTorus.lean", + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "SourceTorus", + "line": 13, + "source_header": "s\n\nabbrev SourceTorus (d : ℕ) (L : ℝ" + }, + { + "kind": "def", + "unqualified_name": "torusProjection", + "line": 15, + "source_header": "L\n\ndef torusProjection (d : ℕ) (L : ℝ) (x : Fin d → ℝ) : SourceTorus d" + }, + { + "kind": "def", + "unqualified_name": "torusRepresentative", + "line": 18, + "source_header": ")\n\ndef torusRepresentative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "torusSourceField", + "line": 22, + "source_header": "1\n\ndef torusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (q : SourceTorus d L) :" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_measurable", + "line": 26, + "source_header": ")\n\ntheorem torusProjection_measurable (d : ℕ) (L : ℝ) : Measurable (torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusRepresentative_measurable", + "line": 29, + "source_header": ")\n\ntheorem torusRepresentative_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (torusRepresentative d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_representative", + "line": 34, + "source_header": ")\n\ntheorem torusProjection_representative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : torusProjection d L (torusRepresentative d L q) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eq_of_torusProjection_eq", + "line": 39, + "source_header": ")\n\ntheorem sourceField_eq_of_torusProjection_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (x y : Fin d → ℝ)\n (h : torusProjection d L x = torusProjection d L y) :\n sourceField d L ω x = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_pullback", + "line": 57, + "source_header": "m\n\ntheorem torusSourceField_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (x : Fin d → ℝ) :\n torusSourceField d L ω (torusProjection d L x) = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_eval_measurable", + "line": 64, + "source_header": ")\n\ntheorem torusSourceField_eval_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Measurable (fun ω => torusSourceField d L ω q" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_joint_measurable", + "line": 68, + "source_header": ")\n\ntheorem torusSourceField_joint_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (fun p : (SourceMode d → ℝ) × SourceTorus d L =>\n torusSourceField d L p.1 p.2" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_finiteVector_hasGaussianLaw", + "line": 84, + "source_header": ")\n\ntheorem torusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => torusSourceField d L ω (q j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_isGaussianProcess", + "line": 90, + "source_header": ")\n\ntheorem torusSourceField_isGaussianProcess (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsGaussianProcess (fun q ω => torusSourceField d L ω q) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance", + "line": 95, + "source_header": ")\n\ntheorem torusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance_pullback", + "line": 102, + "source_header": ")\n\ntheorem torusSourceField_covariance_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (x y : Fin d → ℝ) :\n cov[fun ω => torusSourceField d L ω (torusProjection d L x),\n fun ω => torusSourceField d L ω (torusProjection d L y); sourceLaw d] =\n sourceSpectralKernel d L (x - y" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SpectralWeights.lean", + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "decay", + "line": 14, + "source_header": "s\n\ndef decay (a : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "coordinateBound", + "line": 16, + "source_header": ")\ndef coordinateBound (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productDecay", + "line": 18, + "source_header": "4\ndef productDecay (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productBound", + "line": 20, + "source_header": ")\ndef productBound (d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceA", + "line": 22, + "source_header": ")\ndef sourceA (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceC", + "line": 23, + "source_header": "2\ndef sourceC (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceWeight", + "line": 24, + "source_header": "L\ndef sourceWeight (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceZ", + "line": 26, + "source_header": "k\ndef sourceZ (d : ℕ) (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "pairedBound", + "line": 27, + "source_header": "k\ndef pairedBound (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "theorem", + "unqualified_name": "summable_decay_pow", + "line": 29, + "source_header": "k\n\ntheorem summable_decay_pow {a : ℝ} (ha : 0 < a) (n : ℕ) :\n Summable (fun k : ℤ => decay a k * |(k : ℝ)| ^ n" + }, + { + "kind": "theorem", + "unqualified_name": "coordinateBound_summable", + "line": 40, + "source_header": "b\n\ntheorem coordinateBound_summable {a c : ℝ} (ha : 0 < a) :\n Summable (coordinateBound a c" + }, + { + "kind": "theorem", + "unqualified_name": "finite_product_summable", + "line": 52, + "source_header": "n\ntheorem finite_product_summable {f : ℤ → ℝ} (hf : Summable f) (hn : ∀ k, 0 ≤ f k)\n (d : ℕ) : Summable (fun k : Fin d → ℤ => ∏ i, f (k i)" + }, + { + "kind": "theorem", + "unqualified_name": "productBound_summable", + "line": 72, + "source_header": "p\n\ntheorem productBound_summable {a c : ℝ} (ha : 0 < a) (d : ℕ) :\n Summable (productBound d a c" + }, + { + "kind": "theorem", + "unqualified_name": "productDecay_eq_exp", + "line": 77, + "source_header": "d\n\ntheorem productDecay_eq_exp (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :\n productDecay d a k = exp (-a * ∑ i, (k i : ℝ) ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "frequency_l1_le_product", + "line": 82, + "source_header": "]\n\ntheorem frequency_l1_le_product (d : ℕ) (v : Fin d → ℝ) (hv : ∀ i, 0 ≤ v i) :\n 1 + ∑ i, v i ≤ ∏ i, (1 + v i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceA_pos", + "line": 98, + "source_header": "v\n\ntheorem sourceA_pos {L : ℝ} (hL : L ≠ 0) : 0 < sourceA" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_eq_physical", + "line": 102, + "source_header": "y\n\ntheorem sourceWeight_eq_physical (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L k = exp (-(∑ i, (sourceC L * (k i : ℝ)) ^ 2) / 2" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_summable", + "line": 117, + "source_header": "g\n\ntheorem sourceWeight_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (sourceWeight d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceZ_pos", + "line": 124, + "source_header": "d\n\ntheorem sourceZ_pos (d : ℕ) {L : ℝ} (hL : L ≠ 0) : 0 < sourceZ d" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_eq_amplitude", + "line": 129, + "source_header": "]\n\ntheorem pairedBound_eq_amplitude (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : Fin d → ℤ) :\n pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_summable", + "line": 151, + "source_header": "g\n\ntheorem pairedBound_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (pairedBound d L" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_subtype_summable", + "line": 155, + "source_header": "_\n\ntheorem pairedBound_subtype_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (S : Set (Fin d → ℤ)) : Summable (fun k : S => pairedBound d L k" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothControls.lean", + "sha256": "8eca5ecdb5e2a0c1cb786468b340e4516df653468f958e535f156baafef088b4", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "old_four_does_not_fill_all_orders", + "line": 13, + "source_header": "s\n\n/-- The old a.e. order-four theorem cannot fill the all-orders goal. -/\ntheorem old_four_does_not_fill_all_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "represented_sample_order_five", + "line": 19, + "source_header": "hL\n\ntheorem represented_sample_order_five (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ 5 (smoothSourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "represented_sample_order_thirtyseven", + "line": 23, + "source_header": "ω 5\n\ntheorem represented_sample_order_thirtyseven (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ 37 (smoothSourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "one_carrier_for_both_orders", + "line": 27, + "source_header": "37\n\n/-- Both higher orders hold for every sample of the very same carrier. -/\ntheorem one_carrier_for_both_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) :\n ContDiff ℝ 5 (smoothSourceField d L ω) ∧\n ContDiff ℝ 37 (smoothSourceField d" + }, + { + "kind": "theorem", + "unqualified_name": "literal_field_everywhere", + "line": 34, + "source_header": "hL ω⟩\n\ntheorem literal_field_everywhere (d : ℕ) (L : ℝ) (ω : SmoothSample d L)\n (x : Fin d → ℝ) :\n smoothSourceField d L ω x = sourceField d L (sampleInclusion d L" + }, + { + "kind": "theorem", + "unqualified_name": "entire_coefficient_law_preserved", + "line": 38, + "source_header": "= rfl\n\ntheorem entire_coefficient_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n (smoothLaw d L).map (sampleInclusion d L) = source" + }, + { + "kind": "theorem", + "unqualified_name": "arbitrary_observation_law_preserved", + "line": 42, + "source_header": "d hL\n\ntheorem arbitrary_observation_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :\n (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceLaw d)." + }, + { + "kind": "theorem", + "unqualified_name": "finite_block_changes_preserve_carrier", + "line": 47, + "source_header": "X hX\n\n/-- Arbitrarily large changes on a finite block leave the actual carrier intact. -/\ntheorem finite_block_changes_preserve_carrier (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))\n (hωη : ∀ m ∉ s, ω m = η m) :\n goodSample d L ω ↔ goodSampl" + }, + { + "kind": "theorem", + "unqualified_name": "field_variance_one", + "line": 54, + "source_header": "η s hωη\n\n/-- The restricted field keeps variance one, which excludes a zero-field substitution. -/\ntheorem field_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n cov[fun ω => smoothSourceField d L ω x,\n fun ω => smoothSourceField d L ω x; smoothLaw" + }, + { + "kind": "theorem", + "unqualified_name": "carrier_probability", + "line": 60, + "source_header": "ero d hL]\n\n/-- The underlying restricted measure has total mass one, without conditioning\non a finite pin event or normalizing by a weight. -/\ntheorem carrier_probability (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsProbabilityMeasure (smo" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceFourierSeries.lean", + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "halfLattice", + "line": 14, + "source_header": "e\n\n/-- The representative whose first nonzero coordinate is positive. -/\ndef halfLattice (d : ℕ) : Set (Fin d →" + }, + { + "kind": "abbrev", + "unqualified_name": "SourceMode", + "line": 18, + "source_header": "0}\n\nabbrev SourceMode (d :" + }, + { + "kind": "abbrev", + "unqualified_name": "sourceLaw", + "line": 20, + "source_header": "ol)\n\n/-- The actual common law, with independent variance-one real coefficients. -/\nabbrev sourceLaw (d : ℕ) : Measure (SourceMode d" + }, + { + "kind": "def", + "unqualified_name": "phase", + "line": 24, + "source_header": "de d)\n\ndef phase (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ" + }, + { + "kind": "def", + "unqualified_name": "modeCoefficient", + "line": 27, + "source_header": "* x i\n\n/-- False is the cosine coefficient and true the independent sine coefficient. -/\ndef modeCoefficient (d : ℕ) (L : ℝ) (m : SourceMode d) (x : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "modeMajorant", + "line": 34, + "source_header": "L k x)\n\ndef modeMajorant (d : ℕ) (L : ℝ) (m : SourceMode" + }, + { + "kind": "def", + "unqualified_name": "sourceField", + "line": 39, + "source_header": "d d L k\n\n/-- Literal normalized real Fourier sum on the common coefficient samples. -/\ndef sourceField (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) (x : Fin d" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_nonneg", + "line": 43, + "source_header": "L m x) ω\n\ntheorem modeMajorant_nonneg (d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_summable", + "line": 52, + "source_header": "ositivity\n\ntheorem modeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (modeMajo" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_bound", + "line": 66, + "source_header": ".summable\n\ntheorem modeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (x : Fin d → ℝ) :\n |modeCoefficient d L m x| ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eval_measurable", + "line": 98, + "source_header": "rans hamp\n\ntheorem sourceField_eval_measurable (d : ℕ) (L : ℝ) (x : Fin d → ℝ) :\n Measurable (fun ω => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "sourceMajorant_ae", + "line": 102, + "source_header": "surable _\n\ntheorem sourceMajorant_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Summable (fun m => modeMajorant d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAbs_uniform_ae", + "line": 106, + "source_header": "ble d hL)\n\ntheorem sourceAbs_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => |modeCoefficient d L m x * ω m|)\n (fun x => ∑' m, |modeCoefficient d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_uniform_ae", + "line": 117, + "source_header": "nonneg _)\n\ntheorem sourceField_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => modeCoefficient d L m x * ω m)\n (sourceFie" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_continuous_ae", + "line": 128, + "source_header": "nonneg _)\n\ntheorem sourceField_continuous_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Continuous (sourceFie" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceCovariance.lean", + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "scalarSeries_covariance", + "line": 12, + "source_header": "theorem scalarSeries_covariance (a b : ι → ℝ) (ha : Summable a) (hb : Summable b) :\n cov[scalarSeries a, scalarSeries b; coefficientLaw ι] = ∑' i, a i * b i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_integral_zero", + "line": 51, + "source_header": "theorem sourceField_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n ∫ ω, sourceField d L ω x ∂sourceLaw d = 0" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_covariance", + "line": 58, + "source_header": "theorem sourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] =\n sourceSpectralKernel d L (x - y)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_variance_one", + "line": 68, + "source_header": "theorem sourceField_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n Var[fun ω => sourceField d L ω x; sourceLaw d] = 1" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceGaussianLaw.lean", + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "summable_square", + "line": 18, + "source_header": "}\n\nprivate theorem summable_square (a : ι → ℝ) (ha : Summable a) :\n Summable (fun i => a i ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "partial_charFun", + "line": 29, + "source_header": "n\nprivate theorem partial_charFun (a : ι → ℝ) (s : Finset ι) (t : ℝ) :\n charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =\n Complex.exp (-((∑ i ∈ s, a i ^ 2 : ℝ) : ℂ) * (t : ℂ) ^ 2 / 2" + }, + { + "kind": "theorem", + "unqualified_name": "charFun_partial_tendsto", + "line": 55, + "source_header": "]\n\nprivate theorem charFun_partial_tendsto (a : ι → ℝ) (ha : Summable a) (t : ℝ) :\n Filter.Tendsto\n (fun s : Finset ι => charFun ((coefficientLaw ι).map\n (fun ω => ∑ i ∈ s, a i * ω i)) t)\n Filter.atTop (𝓝 (charFun ((coefficientLaw ι).map (scalarSeries a)) t)" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_map_gaussian", + "line": 90, + "source_header": "ω\n\ntheorem scalarSeries_map_gaussian (a : ι → ℝ) (ha : Summable a) :\n (coefficientLaw ι).map (scalarSeries a) =\n gaussianReal 0 (∑' i, a i ^ 2).toNNRea" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_integral_zero", + "line": 109, + "source_header": "g\n\ntheorem scalarSeries_integral_zero (a : ι → ℝ) (ha : Summable a) :\n ∫ ω, scalarSeries a ω ∂coefficientLaw ι =" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_variance", + "line": 116, + "source_header": "h\n\ntheorem scalarSeries_variance (a : ι → ℝ) (ha : Summable a) :\n Var[scalarSeries a; coefficientLaw ι] = ∑' i, a i ^" + }, + { + "kind": "theorem", + "unqualified_name": "source_linearCombination_hasGaussianLaw", + "line": 122, + "source_header": ")\n\ntheorem source_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) (c : Fin n → ℝ) :\n HasGaussianLaw (fun ω => ∑ j, c j * sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "source_finiteVector_hasGaussianLaw", + "line": 147, + "source_header": ")\n\ntheorem source_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_isGaussianProcess", + "line": 174, + "source_header": "l\n\ntheorem sourceField_isGaussianProcess (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsGaussianProcess (fun x ω => sourceField d L ω x) (sourceLaw d" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/GaussianSeriesFoundation.lean", + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "coefficientLaw", + "line": 15, + "source_header": "n\n\n/-- The same actual probability measure used for every coefficient and series assertion. -/\ndef coefficientLaw (ι : Type*) : Measure (ι →" + }, + { + "kind": "instance", + "unqualified_name": "coefficientLaw_isProbabilityMeasure", + "line": 19, + "source_header": "1)\n\ninstance coefficientLaw_isProbabilityMeasure (ι : Type*) :\n IsProbabilityMeasure (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_measurePreserving", + "line": 24, + "source_header": "nce\n\ntheorem coordinate_measurePreserving {ι : Type*} (i : ι) :\n MeasurePreserving (fun ω : ι → ℝ => ω i) (coefficientLaw ι)\n (gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 29, + "source_header": ") i\n\ntheorem coordinate_marginal {ι : Type*} (i : ι) :\n (coefficientLaw ι).map (fun ω => ω i) = gaussianReal" + }, + { + "kind": "theorem", + "unqualified_name": "coordinates_independent", + "line": 33, + "source_header": "_eq\n\ntheorem coordinates_independent (ι : Type*) :\n iIndepFun (fun i (ω : ι → ℝ) => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_memLp", + "line": 38, + "source_header": "id)\n\ntheorem coordinate_memLp {ι : Type*} (i : ι) (p : ℝ≥0∞) (hp : p ≠ ∞) :\n MemLp (fun ω : ι → ℝ => ω i) p (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_integrable", + "line": 43, + "source_header": "i)\n\ntheorem coordinate_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_abs_integrable", + "line": 47, + "source_header": "p))\n\ntheorem coordinate_abs_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => |ω i|) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_abs_summable_ae", + "line": 51, + "source_header": "orm\n\ntheorem weighted_abs_summable_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (ha : ∀ i, 0 ≤ a i) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, Summable (fun i => a i * |ω" + }, + { + "kind": "def", + "unqualified_name": "scalarSeries", + "line": 75, + "source_header": "hω\n\n/-- The actual scalar sum; its convergence is proved separately on the product law. -/\ndef scalarSeries {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_measurable", + "line": 79, + "source_header": "* ω i\n\ntheorem scalarSeries_measurable {ι : Type*} [Countable ι] (a : ι → ℝ) :\n Measurable (scalarSeri" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_hasSum_ae", + "line": 86, + "source_header": "ly i)\n\ntheorem scalarSeries_hasSum_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, HasSum (fun i => a i * ω i) (scalarSeries" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceTorusC4.lean", + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "quotientChart", + "line": 12, + "source_header": "def quotientChart (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n OpenPartialHomeomorph (SourceTorus d L) (Fin d → ℝ)" + }, + { + "kind": "def", + "unqualified_name": "chartCenter", + "line": 16, + "source_header": "def chartCenter (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) : Fin d → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "quotientChart_symm", + "line": 19, + "source_header": "theorem quotientChart_symm (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n (quotientChart d L a).symm = torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "centered_chart_covers", + "line": 23, + "source_header": "theorem centered_chart_covers (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) :\n q ∈ (quotientChart d L (chartCenter d L q)).source" + }, + { + "kind": "theorem", + "unqualified_name": "chart_transition_contDiff", + "line": 51, + "source_header": "theorem chart_transition_contDiff (d : ℕ) (L : ℝ) [Fact (0 < L)] (a b : Fin d → ℝ) :\n ContDiffOn ℝ ∞ ((quotientChart d L a).symm.trans (quotientChart d L b))\n ((quotientChart d L a).symm.trans (quotientChart d L b)).source" + }, + { + "kind": "theorem", + "unqualified_name": "torus_isManifold", + "line": 98, + "source_header": "theorem torus_isManifold (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsManifold 𝓘(ℝ, Fin d → ℝ) ∞ (SourceTorus d L)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_contMDiff_ae", + "line": 110, + "source_header": "theorem torusSourceField_contMDiff_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d,\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) 4 (torusSourceField d L sample)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_weakSuperlevel_closed_ae", + "line": 126, + "source_header": "theorem torusSourceField_weakSuperlevel_closed_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d, ∀ h : ℝ,\n IsClosed {q : SourceTorus d L | h ≤ torusSourceField d L sample q}" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceC4.lean", + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "phaseCLM", + "line": 13, + "source_header": "4\n\ndef phaseCLM (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : (Fin d → ℝ) →L[ℝ]" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_apply", + "line": 16, + "source_header": "i\n\ntheorem phaseCLM_apply (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) :\n phaseCLM d L k x = phase d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_norm_le", + "line": 20, + "source_header": "]\n\ntheorem phaseCLM_norm_le (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n ‖phaseCLM d L k‖ ≤ ∑ i, |sourceC L * (k i : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_bound", + "line": 35, + "source_header": "]\n\ntheorem modeCoefficient_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (hj : j ≤ 4) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_ae", + "line": 102, + "source_header": "]\n\ntheorem sourceField_contDiff_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ContDiff ℝ 4 (sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_affine_ae", + "line": 133, + "source_header": ")\n\ntheorem sourceField_contDiff_affine_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ (T : (Fin d → ℝ) →L[ℝ] (Fin d → ℝ)) (a : Fin d → ℝ),\n ContDiff ℝ 4 (fun x => sourceField d L ω (a + T x)" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceLattice.lean", + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "latticeFrequency", + "line": 8, + "source_header": "def latticeFrequency (d : ℕ) (m : SourceMode d) : Fin d → ℤ" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_ne_zero", + "line": 13, + "source_header": "theorem halfLattice_ne_zero (d : ℕ) {k : Fin d → ℤ} (hk : k ∈ halfLattice d) :\n k ≠ 0" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_partition", + "line": 20, + "source_header": "theorem halfLattice_partition (d : ℕ) {k : Fin d → ℤ} (hk : k ≠ 0) :\n (k ∈ halfLattice d ∨ -k ∈ halfLattice d) ∧\n ¬ (k ∈ halfLattice d ∧ -k ∈ halfLattice d)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_neg", + "line": 59, + "source_header": "theorem sourceWeight_neg (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L (-k) = sourceWeight d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phase_lattice_shift", + "line": 64, + "source_header": "theorem phase_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k n : Fin d → ℤ) (x : Fin d → ℝ) :\n phase d L k (fun i => x i + L * (n i : ℝ)) =\n phase d L k x + ((∑ i, k i * n i : ℤ) : ℝ) * (2 * Real.pi)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_lattice_shift", + "line": 78, + "source_header": "theorem modeCoefficient_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) =\n modeCoefficient d L m x" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_lattice_shift", + "line": 90, + "source_header": "theorem sourceField_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n sourceField d L ω (fun i => x i + L * (n i : ℝ)) = sourceField d L ω x" + }, + { + "kind": "theorem", + "unqualified_name": "pairedCoefficient_kernel", + "line": 100, + "source_header": "theorem pairedCoefficient_kernel (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ↥(halfLattice d)) (x y : Fin d → ℝ) :\n (∑ b : Bool, modeCoefficient d L (some (k,b)) x *\n modeCoefficient d L (some (k,b)) y) =\n (2 * sourceWeight d L k / sourceZ d L) * Real.cos (phase d L k (x - y))" + }, + { + "kind": "theorem", + "unqualified_name": "latticeFrequency_bijective", + "line": 120, + "source_header": "theorem latticeFrequency_bijective (d : ℕ) : Function.Bijective (latticeFrequency d)" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:frontiers/source_lifetime_realization_20261017", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "frontiers/source_lifetime_realization_20261017", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "frontiers/source_lifetime_realization_20261017/SourceLifetimeGeometry.lean", + "sha256": "8ec4b18959055f20d849337e44a70d0c5b39b7959b54cb4d7b6c2a473ee0612d", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "coordinates", + "line": 14, + "source_header": "d\n\ndef coordinates (d : ℕ) : E d ≃L[ℝ] (Fin d → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "coordinates_latticeVec", + "line": 20, + "source_header": "l\n\ntheorem coordinates_latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ) :\n coordinates d (latticeVec d L n) = fun i => L * (n i : ℝ" + }, + { + "kind": "def", + "unqualified_name": "actualField", + "line": 25, + "source_header": "]\n\n/-- The same carrier, same law, and same literal source; only spatial coordinates change. -/\ndef actualField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : E d)" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_smooth", + "line": 29, + "source_header": "x)\n\ntheorem actualField_smooth (d : ℕ) {L : ℝ} (hL : 0 < L)\n (ω : SmoothSample d L) : IsSmooth d (actualField d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_periodic", + "line": 35, + "source_header": "iff\n\ntheorem actualField_periodic (d : ℕ) {L : ℝ} (hL : 0 < L)\n (ω : SmoothSample d L) : IsLPeriodic d L (actualField d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_eval_measurable", + "line": 43, + "source_header": "x)\n\ntheorem actualField_eval_measurable (d : ℕ) (L : ℝ) (x : E d) :\n Measurable (fun ω => actualField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_eval_hasGaussianLaw", + "line": 48, + "source_header": "L)\n\ntheorem actualField_eval_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x : E d) : HasGaussianLaw (fun ω => actualField d L ω x) (smoothLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_measurable", + "line": 53, + "source_header": "l 0\n\ntheorem actualField_linearCombination_measurable (d : ℕ) (L : ℝ) {m : ℕ}\n (x : Fin m → E d) (a : Fin m → ℝ) :\n Measurable (fun ω => ∑ i, a i * actualField d L ω (x" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_hasGaussianLaw", + "line": 59, + "source_header": ")))\n\ntheorem actualField_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ}\n (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n HasGaussianLaw (fun ω => ∑ i, a i * actualField d L ω (x i)) (smoothLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_integral_zero", + "line": 73, + "source_header": "map\n\ntheorem actualField_integral_zero (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n ∫ ω, actualField d L ω x ∂smoothLaw d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_integral_zero", + "line": 82, + "source_header": "x)\n\ntheorem actualField_linearCombination_integral_zero (d : ℕ) {L : ℝ}\n (hL : 0 < L) {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n ∫ ω, (∑ i, a i * actualField d L ω (x i)) ∂smoothLaw d L" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_covariance_spectral", + "line": 90, + "source_header": "ro]\n\ntheorem actualField_covariance_spectral (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =\n I4Kernel.sourceSpectralKernel d L (coordinates d (x -" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/SourceLifetimeControls.lean", + "sha256": "f50da7cb374c3e75280ae465696b657902f9070cff1256784dc28050017cd171", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "unrestrictedEndpoint", + "line": 13, + "source_header": "s\n\ndef unrestrictedEndpoint (d : ℕ) (L : ℝ) (hL : 0 < L) :\n GaussianFieldInterface d" + }, + { + "kind": "theorem", + "unqualified_name": "literalCarrier", + "line": 16, + "source_header": "L\n\ntheorem literalCarrier (d : ℕ) (L : ℝ) (hL : 0 < L) :\n (actualGaussianFieldInterface d L hL).Ω = SmoothSample d" + }, + { + "kind": "theorem", + "unqualified_name": "literalLaw", + "line": 19, + "source_header": "l\n\ntheorem literalLaw (d : ℕ) (L : ℝ) (hL : 0 < L) :\n (actualGaussianFieldInterface d L hL).P = smoothLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "literalField", + "line": 22, + "source_header": "l\n\ntheorem literalField (d : ℕ) (L : ℝ) (hL : 0 < L)\n (ω : SmoothSample d L) (x : E d) :\n (actualGaussianFieldInterface d L hL).F ω x =\n smoothSourceField d L ω (EuclideanSpace.equiv (Fin d) ℝ x" + }, + { + "kind": "theorem", + "unqualified_name": "sameCarrierOrders", + "line": 27, + "source_header": "l\n\ntheorem sameCarrierOrders (d : ℕ) (L : ℝ) (hL : 0 < L)\n (ω : SmoothSample d L) :\n ContDiff ℝ 5 ((actualGaussianFieldInterface d L hL).F ω) ∧\n ContDiff ℝ 37 ((actualGaussianFieldInterface d L hL).F ω" + }, + { + "kind": "theorem", + "unqualified_name": "wholeCoefficientLaw", + "line": 34, + "source_header": "⟩\n\ntheorem wholeCoefficientLaw (d : ℕ) (L : ℝ) (hL : 0 < L) :\n (actualGaussianFieldInterface d L hL).P.map (sampleInclusion d L) =\n I4Source.sourceLaw" + }, + { + "kind": "theorem", + "unqualified_name": "periodicCovariance_zero", + "line": 38, + "source_header": "'\n\ntheorem periodicCovariance_zero (d : ℕ) {L : ℝ} (hL : 0 < L) :\n periodicCovariance d L 0 =" + }, + { + "kind": "theorem", + "unqualified_name": "rawDiagonalOne", + "line": 42, + "source_header": ")\n\ntheorem rawDiagonalOne (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n ∫ ω, actualField d L ω x * actualField d L ω x ∂smoothLaw d L =" + }, + { + "kind": "theorem", + "unqualified_name": "zeroMean", + "line": 46, + "source_header": "]\n\ntheorem zeroMean (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n ∫ ω, actualField d L ω x ∂smoothLaw d L =" + }, + { + "kind": "theorem", + "unqualified_name": "dimensionZeroTheta", + "line": 50, + "source_header": "x\n\ntheorem dimensionZeroTheta (L : ℝ) : thetaSum 0 L 0 =" + }, + { + "kind": "theorem", + "unqualified_name": "dimensionZeroSpectralNormalizer", + "line": 53, + "source_header": "]\n\ntheorem dimensionZeroSpectralNormalizer (L : ℝ) : I4Weights.sourceZ 0 L =" + }, + { + "kind": "theorem", + "unqualified_name": "dimensionZeroRawVariance", + "line": 56, + "source_header": "]\n\ntheorem dimensionZeroRawVariance (L : ℝ) (hL : 0 < L) :\n ∫ ω, actualField 0 L ω 0 * actualField 0 L ω 0 ∂smoothLaw 0 L =" + }, + { + "kind": "theorem", + "unqualified_name": "emptyQuad", + "line": 60, + "source_header": "0\n\ntheorem emptyQuad (d : ℕ) (L : ℝ) (x : Fin 0 → E d) (a : Fin 0 → ℝ) :\n covQuadForm d L x a =" + }, + { + "kind": "theorem", + "unqualified_name": "emptyFamilyLaw", + "line": 63, + "source_header": "]\n\ntheorem emptyFamilyLaw (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x : Fin 0 → E d) (a : Fin 0 → ℝ) :\n (smoothLaw d L).map (fun ω => ∑ i, a i * actualField d L ω (x i)) =\n Measure.dirac" + }, + { + "kind": "theorem", + "unqualified_name": "cancelledQuad", + "line": 73, + "source_header": ")\n\ntheorem cancelledQuad (d : ℕ) {L : ℝ} (_hL : 0 < L) (x : E d) :\n covQuadForm d L ![x, x] ![1, -1] =" + }, + { + "kind": "theorem", + "unqualified_name": "cancelledSample", + "line": 77, + "source_header": "]\n\ntheorem cancelledSample (d : ℕ) (L : ℝ) (x : E d) (ω : SmoothSample d L) :\n (∑ i : Fin 2, (![1, -1] : Fin 2 → ℝ) i *\n actualField d L ω ((![x, x] : Fin 2 → E d) i)) =" + }, + { + "kind": "theorem", + "unqualified_name": "cancelledLaw", + "line": 82, + "source_header": "]\n\ntheorem cancelledLaw (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n (smoothLaw d L).map (fun ω => ∑ i : Fin 2,\n (![1, -1] : Fin 2 → ℝ) i * actualField d L ω ((![x, x] : Fin 2 → E d) i)) =\n Measure.dirac" + }, + { + "kind": "theorem", + "unqualified_name": "reinforcedQuad", + "line": 93, + "source_header": ")\n\ntheorem reinforcedQuad (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n covQuadForm d L ![x, x] ![1, 1] =" + }, + { + "kind": "theorem", + "unqualified_name": "reinforcedLaw", + "line": 97, + "source_header": "]\n\ntheorem reinforcedLaw (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n (smoothLaw d L).map (fun ω => ∑ i : Fin 2,\n (![1, 1] : Fin 2 → ℝ) i * actualField d L ω ((![x, x] : Fin 2 → E d) i)) =\n gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "everyLatticeTranslation", + "line": 106, + "source_header": "m\n\ntheorem everyLatticeTranslation (d : ℕ) (L : ℝ) (hL : 0 < L)\n (ω : SmoothSample d L) (x : E d) (n : Fin d → ℤ) :\n actualField d L ω (x + latticeVec d L n) = actualField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "euclideanNormSquared", + "line": 111, + "source_header": "n\n\ntheorem euclideanNormSquared :\n ‖(WithLp.toLp 2 (![1, 1] : Fin 2 → ℝ) : E 2)‖ ^ 2 =" + }, + { + "kind": "theorem", + "unqualified_name": "shiftedMeanOne", + "line": 115, + "source_header": "]\n\n/-- Adding one leaves centered covariance unchanged, but violates the required mean. -/\ntheorem shiftedMeanOne (d : ℕ) {L : ℝ} (hL : 0 < L) (x : E d) :\n ∫ ω, (actualField d L ω x + 1) ∂smoothLaw d L" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/SourceThetaBridge.lean", + "sha256": "c03df303f47ac056af332ad421a6720966464c474ee77e671f85242d30f6cc9b", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "latticeVec_apply", + "line": 15, + "source_header": "e\n\ntheorem latticeVec_apply (d : ℕ) (L : ℝ) (n : Fin d → ℤ) (j : Fin d) :\n latticeVec d L n j = L * (n j : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "theta_summand_eq_product", + "line": 21, + "source_header": "p\n\ntheorem theta_summand_eq_product (d : ℕ) (L : ℝ) (z : E d) (n : Fin d → ℤ) :\n Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2) =\n ∏ j, Real.exp (-((z j + L * (n j : ℝ)) ^ 2) / 2" + }, + { + "kind": "theorem", + "unqualified_name": "shifted_gaussian_le", + "line": 29, + "source_header": "]\n\ntheorem shifted_gaussian_le (L t : ℝ) (n : ℤ) :\n Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2) ≤\n Real.exp (t ^ 2 / 2) * decay (L ^ 2 / 4)" + }, + { + "kind": "theorem", + "unqualified_name": "shifted_gaussian_summable", + "line": 36, + "source_header": "]\n\ntheorem shifted_gaussian_summable {L : ℝ} (hL : 0 < L) (t : ℝ) :\n Summable (fun n : ℤ => Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2)" + }, + { + "kind": "theorem", + "unqualified_name": "theta_summable", + "line": 45, + "source_header": "n\n\ntheorem theta_summable (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :\n Summable (fun n : Fin d → ℤ =>\n Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2)" + }, + { + "kind": "theorem", + "unqualified_name": "theta_zero_pos", + "line": 61, + "source_header": "]\n\ntheorem theta_zero_pos (d : ℕ) {L : ℝ} (hL : 0 < L) :\n 0 < thetaSum d L" + }, + { + "kind": "theorem", + "unqualified_name": "summable_nonneg_fin_product", + "line": 66, + "source_header": "_\n\nprivate theorem summable_nonneg_fin_product\n (d : ℕ) (f : Fin d → ℤ → ℝ)\n (hf : ∀ j, Summable (f j)) (hn : ∀ j n, 0 ≤ f j n) :\n Summable (fun k : Fin d → ℤ => ∏ j, f j (k j)" + }, + { + "kind": "theorem", + "unqualified_name": "summable_norm_fin_product", + "line": 92, + "source_header": "p\n\nprivate theorem summable_norm_fin_product\n (d : ℕ) (f : Fin d → ℤ → ℂ)\n (hf : ∀ j, Summable (fun n : ℤ => ‖f j n‖)) :\n Summable (fun k : Fin d → ℤ => ‖∏ j, f j (k j)‖" + }, + { + "kind": "theorem", + "unqualified_name": "tsum_fin_product", + "line": 99, + "source_header": ")\n\nprivate theorem tsum_fin_product\n (d : ℕ) (f : Fin d → ℤ → ℂ)\n (hf : ∀ j, Summable (fun n : ℤ => ‖f j n‖)) :\n (∑' k : Fin d → ℤ, ∏ j, f j (k j)) = ∏ j, ∑' n : ℤ, f j" + }, + { + "kind": "def", + "unqualified_name": "poissonScale", + "line": 113, + "source_header": "]\n\nprivate def poissonScale (L : ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "poissonScale_eq", + "line": 116, + "source_header": ")\n\nprivate theorem poissonScale_eq {L : ℝ} (hL : 0 < L) :\n poissonScale L = Real.sqrt (2 * Real.pi) /" + }, + { + "kind": "def", + "unqualified_name": "spectral1Term", + "line": 123, + "source_header": "p\n\nprivate def spectral1Term (L t : ℝ) (k : ℤ) :" + }, + { + "kind": "theorem", + "unqualified_name": "spectral1Term_norm", + "line": 127, + "source_header": ")\n\nprivate theorem spectral1Term_norm (L t : ℝ) (k : ℤ) :\n ‖spectral1Term L t k‖ = decay (2 * sourceA L)" + }, + { + "kind": "theorem", + "unqualified_name": "spectral1Term_summable_norm", + "line": 133, + "source_header": "]\n\nprivate theorem spectral1Term_summable_norm {L : ℝ} (hL : 0 < L) (t : ℝ) :\n Summable (fun k => ‖spectral1Term L t k‖" + }, + { + "kind": "theorem", + "unqualified_name": "poisson_one_dimension", + "line": 139, + "source_header": "0\n\nprivate theorem poisson_one_dimension {L : ℝ} (hL : 0 < L) (t : ℝ) :\n ((∑' n : ℤ, Real.exp (-((t + L * (n : ℝ)) ^ 2) / 2) : ℝ) : ℂ) =\n (poissonScale L : ℂ) * ∑' k : ℤ, spectral1Term L t" + }, + { + "kind": "theorem", + "unqualified_name": "spectral1Term_prod", + "line": 191, + "source_header": "g\n\nprivate theorem spectral1Term_prod (d : ℕ) (L : ℝ) (x : Fin d → ℝ)\n (k : Fin d → ℤ) :\n (∏ j, spectral1Term L (x j) (k j)) =\n (sourceWeight d L k : ℂ) * Complex.exp ((phase d L k x : ℂ) * Complex.I" + }, + { + "kind": "theorem", + "unqualified_name": "complex_spectral_summable", + "line": 202, + "source_header": "]\n\nprivate theorem complex_spectral_summable (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x : Fin d → ℝ) :\n Summable (fun k : Fin d → ℤ => (sourceWeight d L k : ℂ) *\n Complex.exp ((phase d L k x : ℂ) * Complex.I)" + }, + { + "kind": "theorem", + "unqualified_name": "thetaSum_complex", + "line": 214, + "source_header": "]\n\nprivate theorem thetaSum_complex (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :\n (thetaSum d L z : ℂ) = (poissonScale L : ℂ) ^ d *\n ∑' k : Fin d → ℤ, (sourceWeight d L k : ℂ) *\n Complex.exp ((phase d L k (fun i => z i) : ℂ) * Complex.I" + }, + { + "kind": "theorem", + "unqualified_name": "thetaSum_eq_scaled_cos", + "line": 238, + "source_header": "k\n\ntheorem thetaSum_eq_scaled_cos (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :\n thetaSum d L z = (Real.sqrt (2 * Real.pi) / L) ^ d *\n ∑' k : Fin d → ℤ, sourceWeight d L k *\n Real.cos (phase d L k (fun i => z i)" + }, + { + "kind": "theorem", + "unqualified_name": "thetaSum_zero_eq", + "line": 249, + "source_header": "h\n\ntheorem thetaSum_zero_eq (d : ℕ) {L : ℝ} (hL : 0 < L) :\n thetaSum d L 0 = (Real.sqrt (2 * Real.pi) / L) ^ d * sourceZ d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceSpectralKernel_eq_periodicCovariance", + "line": 253, + "source_header": ")\n\ntheorem sourceSpectralKernel_eq_periodicCovariance\n (d : ℕ) {L : ℝ} (hL : 0 < L) (z : E d) :\n I4Kernel.sourceSpectralKernel d L (fun i => z i) = periodicCovariance d L" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/SourceLifetimeAxiomAudit.lean", + "sha256": "fea8df29106f295238b3a039bb2aae350167a9ada2326d6d00ba6f6663be52c3", + "declarations_lexical": [] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/SourceLifetimeField.lean", + "sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "actualField_covariance", + "line": 15, + "source_header": "d\n\ntheorem actualField_covariance (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n cov[fun ω => actualField d L ω x, fun ω => actualField d L ω y; smoothLaw d L] =\n periodicCovariance d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_raw_second_moment", + "line": 22, + "source_header": ")\n\ntheorem actualField_raw_second_moment (d : ℕ) {L : ℝ} (hL : 0 < L)\n (x y : E d) :\n ∫ ω, actualField d L ω x * actualField d L ω y ∂smoothLaw d L =\n periodicCovariance d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_variance", + "line": 29, + "source_header": "y\n\ntheorem actualField_linearCombination_variance (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n Var[fun ω => ∑ i, a i * actualField d L ω (x i); smoothLaw d L] =\n covQuadForm d L x" + }, + { + "kind": "theorem", + "unqualified_name": "covQuadForm_nonneg", + "line": 44, + "source_header": "g\n\ntheorem covQuadForm_nonneg (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n 0 ≤ covQuadForm d L x" + }, + { + "kind": "theorem", + "unqualified_name": "actualField_linearCombination_map", + "line": 50, + "source_header": "_\n\ntheorem actualField_linearCombination_map (d : ℕ) {L : ℝ} (hL : 0 < L)\n {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ) :\n (smoothLaw d L).map (fun ω => ∑ i, a i * actualField d L ω (x i)) =\n gaussianReal 0 ⟨covQuadForm d L x a, covQuadForm_nonneg d hL x a" + }, + { + "kind": "def", + "unqualified_name": "actualGaussianFieldInterface", + "line": 61, + "source_header": ")\n\n/-- The original target on the unchanged coefficient carrier and preserved source law. -/\ndef actualGaussianFieldInterface (d : ℕ) (L : ℝ) (hL : 0 < L) :\n GaussianFieldInterface d L where" + }, + { + "kind": "theorem", + "unqualified_name": "actualGaussianFieldInterface_exists", + "line": 76, + "source_header": "hL\n\ntheorem actualGaussianFieldInterface_exists (d : ℕ) (L : ℝ) (hL : 0 < L) :\n Nonempty (GaussianFieldInterface d" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceSmooth.lean", + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "orderCoordinateBound", + "line": 24, + "source_header": "h\n\ndef orderCoordinateBound (n : ℕ) (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderProductBound", + "line": 27, + "source_header": "n\n\ndef orderProductBound (n d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderPairedBound", + "line": 30, + "source_header": ")\n\ndef orderPairedBound (n d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderModeBound", + "line": 33, + "source_header": "k\n\ndef orderModeBound (n d : ℕ) (L : ℝ) (m : SourceMode d) :" + }, + { + "kind": "theorem", + "unqualified_name": "orderCoordinateBound_summable", + "line": 38, + "source_header": "k\n\ntheorem orderCoordinateBound_summable (n : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderCoordinateBound n a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderProductBound_summable", + "line": 59, + "source_header": "g\n\ntheorem orderProductBound_summable (n d : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderProductBound n d a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_summable", + "line": 64, + "source_header": "d\n\ntheorem orderPairedBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderPairedBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_eq_amplitude", + "line": 68, + "source_header": "_\n\ntheorem orderPairedBound_eq_amplitude (n d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : Fin d → ℤ) :\n orderPairedBound n d L k =\n Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_nonneg", + "line": 92, + "source_header": "g\n\ntheorem orderModeBound_nonneg (n d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_summable", + "line": 100, + "source_header": "y\n\ntheorem orderModeBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_four", + "line": 115, + "source_header": "e\n\ntheorem orderModeBound_four (d : ℕ) (L : ℝ) (m : SourceMode d) :\n orderModeBound 4 d L m = modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_order_bound", + "line": 119, + "source_header": "l\n\ntheorem modeCoefficient_iteratedFDeriv_order_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ orderModeBound j d L" + }, + { + "kind": "def", + "unqualified_name": "goodSample", + "line": 179, + "source_header": "]\n\n/-- One explicit coefficient event, shared by every derivative order. -/\ndef goodSample (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : P" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_ae", + "line": 183, + "source_header": "m|)\n\ntheorem goodSample_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, goodSample d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_of_goodSample", + "line": 190, + "source_header": "hL)\n\ntheorem sourceField_smooth_of_goodSample (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (hω : goodSample d L ω) :\n ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_ae", + "line": 222, + "source_header": "m))\n\ntheorem sourceField_smooth_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_congr_cofinite", + "line": 227, + "source_header": "hω\n\n/-- The carrier depends only on the coefficient tail; finite coordinate changes\ncannot destroy any derivative-order summability condition. -/\ntheorem goodSample_congr_cofinite (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (hωη : ω =ᶠ[Filter.cofinite] η) :\n goodSample d L ω ↔ goodSample" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_finite_change_iff", + "line": 242, + "source_header": "[hm]\n\ntheorem goodSample_finite_change_iff (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))\n (hωη : ∀ m ∉ s, ω m = η m) :\n goodSample d L ω ↔ goodSample" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothCarrier.lean", + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "goodSet", + "line": 30, + "source_header": "r\n\n/-- The actual common coefficient event, with no smoothness premise added. -/\ndef goodSet (d : ℕ) (L : ℝ) : Set (SourceMode d →" + }, + { + "kind": "def", + "unqualified_name": "orderAbsNN", + "line": 34, + "source_header": "ω}\n\nprivate def orderAbsNN (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ)\n (m : SourceMode d) :" + }, + { + "kind": "def", + "unqualified_name": "orderAbsTotal", + "line": 39, + "source_header": "_)⟩\n\nprivate def orderAbsTotal (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_ne_top_iff", + "line": 42, + "source_header": "0∞)\n\nprivate theorem orderAbsTotal_ne_top_iff (n d : ℕ) (L : ℝ)\n (ω : SourceMode d → ℝ) :\n orderAbsTotal n d L ω ≠ ∞ ↔\n Summable (fun m => orderModeBound n d L m * |ω" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_measurable", + "line": 48, + "source_header": "ω)\n\nprivate theorem orderAbsTotal_measurable (n d : ℕ) (L : ℝ) :\n Measurable (orderAbsTotal n d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measurable", + "line": 62, + "source_header": "eal\n\ntheorem goodSet_measurable (d : ℕ) (L : ℝ) : MeasurableSet (goodSet d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_ae", + "line": 75, + "source_header": "imp\n\ntheorem goodSet_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ω ∈ goodSet" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measure_one", + "line": 79, + "source_header": "hL\n\ntheorem goodSet_measure_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceLaw d (goodSet d L)" + }, + { + "kind": "abbrev", + "unqualified_name": "SmoothSample", + "line": 83, + "source_header": "hL)\n\n/-- A coefficient sample on the explicit all-order summability carrier. -/\nabbrev SmoothSample (d : ℕ) (L" + }, + { + "kind": "def", + "unqualified_name": "sampleInclusion", + "line": 86, + "source_header": "d L)\n\n/-- Literal inclusion, retaining every coefficient of the original sample. -/\ndef sampleInclusion (d : ℕ) (L : ℝ) : SmoothSample d L → (SourceMode" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurable", + "line": 90, + "source_header": "ype.val\n\ntheorem sampleInclusion_measurable (d : ℕ) (L : ℝ) :\n Measurable (sampleInclusi" + }, + { + "kind": "def", + "unqualified_name": "smoothLaw", + "line": 94, + "source_header": "ype_coe\n\n/-- Pull back the original product law; no normalization or new law is chosen. -/\ndef smoothLaw (d : ℕ) (L : ℝ) : Measure (SmoothSa" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_map", + "line": 98, + "source_header": "sion d L)\n\ntheorem sampleInclusion_map (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n (smoothLaw d L).map (sampleInclusion d L) = so" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurePreserving", + "line": 105, + "source_header": "ae d hL)]\n\ntheorem sampleInclusion_measurePreserving (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothLaw_isProbabilityMeasure", + "line": 109, + "source_header": "map d hL⟩\n\ntheorem smoothLaw_isProbabilityMeasure (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsProbabilityMeasure (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "observation_map_eq", + "line": 114, + "source_header": "t_ae d hL\n\n/-- Every measurable observation has exactly its original pushforward law. -/\ntheorem observation_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :\n (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceL" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 121, + "source_header": "n_map d hL]\n\ntheorem coordinate_marginal (d : ℕ) {L : ℝ} (hL : L ≠ 0) (m : SourceMode d) :\n (smoothLaw d L).map (fun ω => sampleInclusion d L ω m) = gauss" + }, + { + "kind": "theorem", + "unqualified_name": "finiteCoordinate_map_eq", + "line": 126, + "source_header": "_marginal m\n\ntheorem finiteCoordinate_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (m : Fin n → SourceMode d) :\n (smoothLaw d L).map (fun ω j => sampleInclusion d L ω (m j)) =\n (sourceLaw d).map (fun ω j" + }, + { + "kind": "def", + "unqualified_name": "smoothSourceField", + "line": 132, + "source_header": "ply (m j)))\n\n/-- The unchanged literal real-cover field, evaluated on the carrier. -/\ndef smoothSourceField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : F" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_contDiff", + "line": 136, + "source_header": "sion d L ω) x\n\ntheorem smoothSourceField_contDiff (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) (n : ℕ) : ContDiff ℝ n (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_smooth", + "line": 140, + "source_header": "ω.property n\n\ntheorem smoothSourceField_smooth (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ (⊤ : ℕ∞) (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_map_eq", + "line": 144, + "source_header": "tDiff d hL ω)\n\ntheorem smoothSourceField_finiteVector_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n (smoothLaw d L).map (fun ω j => smoothSourceField d L ω (x j)) =\n (sourceLaw d).map (fun ω j => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_hasGaussianLaw", + "line": 151, + "source_header": "e d L (x j)))\n\ntheorem smoothSourceField_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => smoothSourceField d L ω (x j)) (s" + }, + { + "kind": "theorem", + "unqualified_name": "covariance_comp_inclusion", + "line": 161, + "source_header": "sGaussian_map\n\ntheorem covariance_comp_inclusion (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (X Y : (SourceMode d → ℝ) → ℝ) (hX : Measurable X) (hY : Measurable Y) :\n cov[fun ω => X (sampleInclusion d L ω), fun ω => Y (sampleInclusion d L ω); smoothLaw d L] =\n cov[X, Y;" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_covariance", + "line": 171, + "source_header": "exact h.symm\n\ntheorem smoothSourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (x y : Fin d → ℝ) :\n cov[fun ω => smoothSourceField d L ω x, fun ω => smoothSourceField d L ω y; smoothLaw d L] =\n sourceSpectralKerne" + }, + { + "kind": "def", + "unqualified_name": "smoothTorusSourceField", + "line": 181, + "source_header": "ance d hL x y\n\n/-- The unchanged literal torus descent of the same coefficient sample. -/\ndef smoothTorusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) (q : Sourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_smooth", + "line": 188, + "source_header": "ualChartedSpace\n\ntheorem smoothTorusSourceField_smooth (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) :\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) (⊤ : ℕ∞) (smoothTorusSou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_finiteVector_hasGaussianLaw", + "line": 205, + "source_header": "ontDiffWithinAt\n\ntheorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ)\n [Fact (0 < L)] (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => smoothTorusSourceField d L ω (q j))" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_covariance", + "line": 218, + "source_header": ".isGaussian_map\n\ntheorem smoothTorusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => smoothTorusSourceField d L ω q, fun ω => smoothTorusSourceField d L ω p;\n smoothLaw d L] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepres" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 65, + "source_header": "y\n\n/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this\nnamespace). The duplication is deliberate: modules of this packet import only Mathlib. -/\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 77, + "source_header": "in d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 86, + "source_header": "i : ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 97, + "source_header": "^ 2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 109, + "source_header": "taSum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : F" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 120, + "source_header": "L (x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g :" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 129, + "source_header": "ec d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 138, + "source_header": "ℕ, ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 180, + "source_header": "y ∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 190, + "source_header": ": ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoi" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 199, + "source_header": "ℝ) (x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 215, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNon" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 225, + "source_header": "iticalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsInd" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 235, + "source_header": "alPoint d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 244, + "source_header": ": ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnon" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 253, + "source_header": "nS (d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence modul" + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 283, + "source_header": "tGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsC" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 302, + "source_header": "NondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the sourc" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 315, + "source_header": "IsCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNond" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 351, + "source_header": "gMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 363, + "source_header": "p :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pai" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 374, + "source_header": "ndDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d :" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 385, + "source_header": "E d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gau" + }, + { + "kind": "def", + "unqualified_name": "IsWindowPair", + "line": 407, + "source_header": "A ∧\n ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)\n\n/-! ### Populations of pairs -/\n\n/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with\n`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none beyond the shared predicates.\nDoes not claim: anything about the off-diagonal (far) population separately (Section" + }, + { + "kind": "structure", + "unqualified_name": "PairLawInterface", + "line": 442, + "source_header": ": ℝ) (g : E d → ℝ) (M S : E d) : Prop :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S\n\n/-! ### The typed pair law as an interface -/\n\n/-- Interface for the weighted regression (typed pair) law: the only object consumed by the\nstatements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death\npartner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the\nlaw `Q^W = (W_r/Z_r) Q_{r,b,k,R}` with `W_r = |det H_M det H_S| 1{H_M<0, index(H_S)=d-1}`.\nThat law, its weight, its normalizer and the regression construction are informal in the\nsource and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark\n`k` and orthonormal frame `R` with values in `[0, 1]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S.\"\nInterface: `p` is given; its only hypothesis fields are the bounds `0 ≤ p ≤ 1`. The parameters `G` and `I` record which field and which elder relation the law refers to; no field ties `p` to them.\nDoes not claim: existence of the regression law, the typed weight, the full normalizer `Z_r > 0`, or that `p` is the probability of any event under any measure declared here; that `p` depends on `G` or `I` in any way (no field mentions them; they only record which field and elder relation the law is meant to refer to). -/\nstructure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)\n (I : SuperlevelBarInterface d L) where\n /-- Section 1 clause: \"Let p_r(b,k,R) be the Q^W probability that the global ordinary\n superlevel elder death partner of M is S.\" -/\n p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R\n /-- `p` is a proba" + }, + { + "kind": "def", + "unqualified_name": "ParentUniformSelectionA", + "line": 466, + "source_header": "ility: at most one. -/\n p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1\n\n/-! ### The parent statements (1.1), (1.2), (1.3) -/\n\n/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`\nand `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)\nsuch that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all\northonormal frames `R`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There exist r_*>0 and C 0` and\nwindows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a\nconstant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and\nelder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,\n`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),\"\nInterface: `G` and `I` are given; \"versions\" are any `νc`, `νe` satisfying `IsLifetimeDensityVersion` (integral identity), not a Kac-Rice representation; the coefficient `c_{B,K}` is existential, not the Gaussian integral (11.3).\nDoes not claim: the parent result or its proof; the exact coefficient formula (11.3); existence of the versions; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef ParentCompactWindowDensityB (d :" + }, + { + "kind": "def", + "unqualified_name": "IsUnrestrictedLeadingCoefficient", + "line": 510, + "source_header": "r : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.\nThe essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the\nconclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,\nnot by the integral (13.6)/(15.2).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There is a positive finite constant c_{d,L} such that\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the explicit Gaussian/angular representation (15.2) of `c_{d,L}`; uniqueness of `c` (which follows from the asymptotics but is not stated); existence of versions. -/\ndef IsUnrestrictedLeadingC" + }, + { + "kind": "def", + "unqualified_name": "ParentUnrestrictedLeadingDensityC", + "line": 531, + "source_header": "∧\n Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe\n (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the\nunrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth\nheights, all positive gap marks, all separations; essential global maximum excluded) admit\nversions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the parent result or its proof (dominated convergence of Section 13, off-diagonal bound (14.1)); the representation (15.2); the compact-window `O(ell^(2/3))` difference for the unrestricted densities; any numerical enclosure of `c_{d,L}` (the SIDE24 coefficient track is separate); nonauthor review or acceptance. -/\ndef ParentUnrestr" + }, + { + "kind": "def", + "unqualified_name": "RemainderBoundedR1", + "line": 545, + "source_header": "(I : SuperlevelBarInterface d L) : Prop :=\n 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c\n\n/-! ### The bounded remainder (R1) -/\n\n/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed\n`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here\nby `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of\nthe unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,\n`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.\nThe `O(1)` remainder is stated with an explicit absolute-value bound.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a\nAnchor: \"|nu_cand(ell)-c ell^(-1/3)| <= C,\"\nInterface: `G` and `I` are given; `c` is any real satisfying the parent leading-coefficient property (the source says the coefficient \"is exactly the parent's equation (15.2)\"; that integral is not transcribed, so `c` is pinned through (1.3) instead); versions are characterised by the integral identity only. The statement does not mention the typed pair law: Theorem R does not consume (1.1).\nDoes not claim: the result or its proof (quadratic determinant cancellation (R7), coupling (R4), cap-loss bound (R12)); convergence of the remainder; a second coefficient; numerical `C` or `ell_*`; the compact-window `O(ell^(2/3))` difference without cutoffs; the parent interfaces it imports (D1-A-E); nonauthor review or acceptance. If no `c` satisfies the parent property the statement holds vacuously; that is a transcription of its dependency on (1.3), not a claim. -" + }, + { + "kind": "def", + "unqualified_name": "PlanarElderLowerE2", + "line": 569, + "source_header": "c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧\n |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C\n\n/-! ### Planar elder lower bound and density gap (d = 2) -/\n\n/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with\nbirth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging\nover `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all\n`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \"1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff\n`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the\ncompact-window candidate and ordinary elder densities satisfy\n`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper\ninput is an explicit hypothesis, not folded into the conclusion. The lower half, which the\nsource derives from (E2) alone, is stated under the same hypothesis because the source displays\n(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower\nhalf, recorded here as such.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \" <= C_{B,K} ell^(2/3). (E11)\"\nInterface: `G`, `I` and `PL` are given; the hypothesis `ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi` is the consumed parent upper input (a statement shape, not the parent result); versions are characterised by the integral identity only; the weighted Kac-Rice / radial ledger of [LP, Sections 9-11] that the source consumes is not transcribed. The interface does not determine `p` or the field: the Prop is a predicate on the interface objects, not a closed statement about the source's objects; nothing is asserted about its universal closure over all inhabitants, and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the result or its proof; the upper half independently of the parent (1.1); the parent (1.1) itself; the lower half without the hypothesis (the source has it from (E2) alone); sharpness of the `O(1)` remainder of (R1); removal of the compact-mark restriction; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef PlanarDensityGapE11 (L : ℝ) (G :" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceKernel.lean", + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "frequencyEquiv", + "line": 8, + "source_header": "def frequencyEquiv (d : ℕ) : SourceMode d ≃ (Fin d → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "sourceSpectralKernel", + "line": 11, + "source_header": "/-- The prescribed normalized full-lattice real Fourier kernel; image/Poisson linkage is separate. -/\ndef sourceSpectralKernel (d : ℕ) (L : ℝ) (z : Fin d → ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "tsum_mode", + "line": 15, + "source_header": ")\n\nprivate theorem tsum_mode (d : ℕ) (f : SourceMode d → ℝ) (hf : Summable f) :\n (∑' m, f m) = f none + ∑' k : ↥(halfLattice d),\n (f (some (k,false)) + f (some (k,true))" + }, + { + "kind": "theorem", + "unqualified_name": "modeProduct_summable", + "line": 33, + "source_header": "g\n\ntheorem modeProduct_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n Summable (fun m => modeCoefficient d L m x * modeCoefficient d L m y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_summable", + "line": 46, + "source_header": ")\n\ntheorem spectralKernel_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (z : Fin d → ℝ) :\n Summable (fun k : Fin d → ℤ =>\n sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)" + }, + { + "kind": "theorem", + "unqualified_name": "coefficientKernel_eq_fullLattice", + "line": 58, + "source_header": "q\n\ntheorem coefficientKernel_eq_fullLattice (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =\n sourceSpectralKernel d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_zero", + "line": 103, + "source_header": "m\n\ntheorem spectralKernel_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceSpectralKernel d L 0 =" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceTorus.lean", + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "SourceTorus", + "line": 13, + "source_header": "s\n\nabbrev SourceTorus (d : ℕ) (L : ℝ" + }, + { + "kind": "def", + "unqualified_name": "torusProjection", + "line": 15, + "source_header": "L\n\ndef torusProjection (d : ℕ) (L : ℝ) (x : Fin d → ℝ) : SourceTorus d" + }, + { + "kind": "def", + "unqualified_name": "torusRepresentative", + "line": 18, + "source_header": ")\n\ndef torusRepresentative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "torusSourceField", + "line": 22, + "source_header": "1\n\ndef torusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (q : SourceTorus d L) :" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_measurable", + "line": 26, + "source_header": ")\n\ntheorem torusProjection_measurable (d : ℕ) (L : ℝ) : Measurable (torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusRepresentative_measurable", + "line": 29, + "source_header": ")\n\ntheorem torusRepresentative_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (torusRepresentative d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_representative", + "line": 34, + "source_header": ")\n\ntheorem torusProjection_representative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : torusProjection d L (torusRepresentative d L q) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eq_of_torusProjection_eq", + "line": 39, + "source_header": ")\n\ntheorem sourceField_eq_of_torusProjection_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (x y : Fin d → ℝ)\n (h : torusProjection d L x = torusProjection d L y) :\n sourceField d L ω x = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_pullback", + "line": 57, + "source_header": "m\n\ntheorem torusSourceField_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (x : Fin d → ℝ) :\n torusSourceField d L ω (torusProjection d L x) = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_eval_measurable", + "line": 64, + "source_header": ")\n\ntheorem torusSourceField_eval_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Measurable (fun ω => torusSourceField d L ω q" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_joint_measurable", + "line": 68, + "source_header": ")\n\ntheorem torusSourceField_joint_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (fun p : (SourceMode d → ℝ) × SourceTorus d L =>\n torusSourceField d L p.1 p.2" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_finiteVector_hasGaussianLaw", + "line": 84, + "source_header": ")\n\ntheorem torusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => torusSourceField d L ω (q j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_isGaussianProcess", + "line": 90, + "source_header": ")\n\ntheorem torusSourceField_isGaussianProcess (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsGaussianProcess (fun q ω => torusSourceField d L ω q) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance", + "line": 95, + "source_header": ")\n\ntheorem torusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance_pullback", + "line": 102, + "source_header": ")\n\ntheorem torusSourceField_covariance_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (x y : Fin d → ℝ) :\n cov[fun ω => torusSourceField d L ω (torusProjection d L x),\n fun ω => torusSourceField d L ω (torusProjection d L y); sourceLaw d] =\n sourceSpectralKernel d L (x - y" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SpectralWeights.lean", + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "decay", + "line": 14, + "source_header": "s\n\ndef decay (a : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "coordinateBound", + "line": 16, + "source_header": ")\ndef coordinateBound (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productDecay", + "line": 18, + "source_header": "4\ndef productDecay (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productBound", + "line": 20, + "source_header": ")\ndef productBound (d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceA", + "line": 22, + "source_header": ")\ndef sourceA (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceC", + "line": 23, + "source_header": "2\ndef sourceC (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceWeight", + "line": 24, + "source_header": "L\ndef sourceWeight (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceZ", + "line": 26, + "source_header": "k\ndef sourceZ (d : ℕ) (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "pairedBound", + "line": 27, + "source_header": "k\ndef pairedBound (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "theorem", + "unqualified_name": "summable_decay_pow", + "line": 29, + "source_header": "k\n\ntheorem summable_decay_pow {a : ℝ} (ha : 0 < a) (n : ℕ) :\n Summable (fun k : ℤ => decay a k * |(k : ℝ)| ^ n" + }, + { + "kind": "theorem", + "unqualified_name": "coordinateBound_summable", + "line": 40, + "source_header": "b\n\ntheorem coordinateBound_summable {a c : ℝ} (ha : 0 < a) :\n Summable (coordinateBound a c" + }, + { + "kind": "theorem", + "unqualified_name": "finite_product_summable", + "line": 52, + "source_header": "n\ntheorem finite_product_summable {f : ℤ → ℝ} (hf : Summable f) (hn : ∀ k, 0 ≤ f k)\n (d : ℕ) : Summable (fun k : Fin d → ℤ => ∏ i, f (k i)" + }, + { + "kind": "theorem", + "unqualified_name": "productBound_summable", + "line": 72, + "source_header": "p\n\ntheorem productBound_summable {a c : ℝ} (ha : 0 < a) (d : ℕ) :\n Summable (productBound d a c" + }, + { + "kind": "theorem", + "unqualified_name": "productDecay_eq_exp", + "line": 77, + "source_header": "d\n\ntheorem productDecay_eq_exp (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :\n productDecay d a k = exp (-a * ∑ i, (k i : ℝ) ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "frequency_l1_le_product", + "line": 82, + "source_header": "]\n\ntheorem frequency_l1_le_product (d : ℕ) (v : Fin d → ℝ) (hv : ∀ i, 0 ≤ v i) :\n 1 + ∑ i, v i ≤ ∏ i, (1 + v i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceA_pos", + "line": 98, + "source_header": "v\n\ntheorem sourceA_pos {L : ℝ} (hL : L ≠ 0) : 0 < sourceA" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_eq_physical", + "line": 102, + "source_header": "y\n\ntheorem sourceWeight_eq_physical (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L k = exp (-(∑ i, (sourceC L * (k i : ℝ)) ^ 2) / 2" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_summable", + "line": 117, + "source_header": "g\n\ntheorem sourceWeight_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (sourceWeight d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceZ_pos", + "line": 124, + "source_header": "d\n\ntheorem sourceZ_pos (d : ℕ) {L : ℝ} (hL : L ≠ 0) : 0 < sourceZ d" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_eq_amplitude", + "line": 129, + "source_header": "]\n\ntheorem pairedBound_eq_amplitude (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : Fin d → ℤ) :\n pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_summable", + "line": 151, + "source_header": "g\n\ntheorem pairedBound_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (pairedBound d L" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_subtype_summable", + "line": 155, + "source_header": "_\n\ntheorem pairedBound_subtype_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (S : Set (Fin d → ℤ)) : Summable (fun k : S => pairedBound d L k" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceSmoothControls.lean", + "sha256": "8eca5ecdb5e2a0c1cb786468b340e4516df653468f958e535f156baafef088b4", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "old_four_does_not_fill_all_orders", + "line": 13, + "source_header": "s\n\n/-- The old a.e. order-four theorem cannot fill the all-orders goal. -/\ntheorem old_four_does_not_fill_all_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "represented_sample_order_five", + "line": 19, + "source_header": "hL\n\ntheorem represented_sample_order_five (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ 5 (smoothSourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "represented_sample_order_thirtyseven", + "line": 23, + "source_header": "ω 5\n\ntheorem represented_sample_order_thirtyseven (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ 37 (smoothSourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "one_carrier_for_both_orders", + "line": 27, + "source_header": "37\n\n/-- Both higher orders hold for every sample of the very same carrier. -/\ntheorem one_carrier_for_both_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) :\n ContDiff ℝ 5 (smoothSourceField d L ω) ∧\n ContDiff ℝ 37 (smoothSourceField d" + }, + { + "kind": "theorem", + "unqualified_name": "literal_field_everywhere", + "line": 34, + "source_header": "hL ω⟩\n\ntheorem literal_field_everywhere (d : ℕ) (L : ℝ) (ω : SmoothSample d L)\n (x : Fin d → ℝ) :\n smoothSourceField d L ω x = sourceField d L (sampleInclusion d L" + }, + { + "kind": "theorem", + "unqualified_name": "entire_coefficient_law_preserved", + "line": 38, + "source_header": "= rfl\n\ntheorem entire_coefficient_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n (smoothLaw d L).map (sampleInclusion d L) = source" + }, + { + "kind": "theorem", + "unqualified_name": "arbitrary_observation_law_preserved", + "line": 42, + "source_header": "d hL\n\ntheorem arbitrary_observation_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :\n (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceLaw d)." + }, + { + "kind": "theorem", + "unqualified_name": "finite_block_changes_preserve_carrier", + "line": 47, + "source_header": "X hX\n\n/-- Arbitrarily large changes on a finite block leave the actual carrier intact. -/\ntheorem finite_block_changes_preserve_carrier (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))\n (hωη : ∀ m ∉ s, ω m = η m) :\n goodSample d L ω ↔ goodSampl" + }, + { + "kind": "theorem", + "unqualified_name": "field_variance_one", + "line": 54, + "source_header": "η s hωη\n\n/-- The restricted field keeps variance one, which excludes a zero-field substitution. -/\ntheorem field_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n cov[fun ω => smoothSourceField d L ω x,\n fun ω => smoothSourceField d L ω x; smoothLaw" + }, + { + "kind": "theorem", + "unqualified_name": "carrier_probability", + "line": 60, + "source_header": "ero d hL]\n\n/-- The underlying restricted measure has total mass one, without conditioning\non a finite pin event or normalizing by a weight. -/\ntheorem carrier_probability (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsProbabilityMeasure (smo" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceFourierSeries.lean", + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "halfLattice", + "line": 14, + "source_header": "e\n\n/-- The representative whose first nonzero coordinate is positive. -/\ndef halfLattice (d : ℕ) : Set (Fin d →" + }, + { + "kind": "abbrev", + "unqualified_name": "SourceMode", + "line": 18, + "source_header": "0}\n\nabbrev SourceMode (d :" + }, + { + "kind": "abbrev", + "unqualified_name": "sourceLaw", + "line": 20, + "source_header": "ol)\n\n/-- The actual common law, with independent variance-one real coefficients. -/\nabbrev sourceLaw (d : ℕ) : Measure (SourceMode d" + }, + { + "kind": "def", + "unqualified_name": "phase", + "line": 24, + "source_header": "de d)\n\ndef phase (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ" + }, + { + "kind": "def", + "unqualified_name": "modeCoefficient", + "line": 27, + "source_header": "* x i\n\n/-- False is the cosine coefficient and true the independent sine coefficient. -/\ndef modeCoefficient (d : ℕ) (L : ℝ) (m : SourceMode d) (x : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "modeMajorant", + "line": 34, + "source_header": "L k x)\n\ndef modeMajorant (d : ℕ) (L : ℝ) (m : SourceMode" + }, + { + "kind": "def", + "unqualified_name": "sourceField", + "line": 39, + "source_header": "d d L k\n\n/-- Literal normalized real Fourier sum on the common coefficient samples. -/\ndef sourceField (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) (x : Fin d" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_nonneg", + "line": 43, + "source_header": "L m x) ω\n\ntheorem modeMajorant_nonneg (d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_summable", + "line": 52, + "source_header": "ositivity\n\ntheorem modeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (modeMajo" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_bound", + "line": 66, + "source_header": ".summable\n\ntheorem modeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (x : Fin d → ℝ) :\n |modeCoefficient d L m x| ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eval_measurable", + "line": 98, + "source_header": "rans hamp\n\ntheorem sourceField_eval_measurable (d : ℕ) (L : ℝ) (x : Fin d → ℝ) :\n Measurable (fun ω => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "sourceMajorant_ae", + "line": 102, + "source_header": "surable _\n\ntheorem sourceMajorant_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Summable (fun m => modeMajorant d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAbs_uniform_ae", + "line": 106, + "source_header": "ble d hL)\n\ntheorem sourceAbs_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => |modeCoefficient d L m x * ω m|)\n (fun x => ∑' m, |modeCoefficient d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_uniform_ae", + "line": 117, + "source_header": "nonneg _)\n\ntheorem sourceField_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => modeCoefficient d L m x * ω m)\n (sourceFie" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_continuous_ae", + "line": 128, + "source_header": "nonneg _)\n\ntheorem sourceField_continuous_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Continuous (sourceFie" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceCovariance.lean", + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "scalarSeries_covariance", + "line": 12, + "source_header": "theorem scalarSeries_covariance (a b : ι → ℝ) (ha : Summable a) (hb : Summable b) :\n cov[scalarSeries a, scalarSeries b; coefficientLaw ι] = ∑' i, a i * b i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_integral_zero", + "line": 51, + "source_header": "theorem sourceField_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n ∫ ω, sourceField d L ω x ∂sourceLaw d = 0" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_covariance", + "line": 58, + "source_header": "theorem sourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] =\n sourceSpectralKernel d L (x - y)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_variance_one", + "line": 68, + "source_header": "theorem sourceField_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n Var[fun ω => sourceField d L ω x; sourceLaw d] = 1" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceGaussianLaw.lean", + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "summable_square", + "line": 18, + "source_header": "}\n\nprivate theorem summable_square (a : ι → ℝ) (ha : Summable a) :\n Summable (fun i => a i ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "partial_charFun", + "line": 29, + "source_header": "n\nprivate theorem partial_charFun (a : ι → ℝ) (s : Finset ι) (t : ℝ) :\n charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =\n Complex.exp (-((∑ i ∈ s, a i ^ 2 : ℝ) : ℂ) * (t : ℂ) ^ 2 / 2" + }, + { + "kind": "theorem", + "unqualified_name": "charFun_partial_tendsto", + "line": 55, + "source_header": "]\n\nprivate theorem charFun_partial_tendsto (a : ι → ℝ) (ha : Summable a) (t : ℝ) :\n Filter.Tendsto\n (fun s : Finset ι => charFun ((coefficientLaw ι).map\n (fun ω => ∑ i ∈ s, a i * ω i)) t)\n Filter.atTop (𝓝 (charFun ((coefficientLaw ι).map (scalarSeries a)) t)" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_map_gaussian", + "line": 90, + "source_header": "ω\n\ntheorem scalarSeries_map_gaussian (a : ι → ℝ) (ha : Summable a) :\n (coefficientLaw ι).map (scalarSeries a) =\n gaussianReal 0 (∑' i, a i ^ 2).toNNRea" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_integral_zero", + "line": 109, + "source_header": "g\n\ntheorem scalarSeries_integral_zero (a : ι → ℝ) (ha : Summable a) :\n ∫ ω, scalarSeries a ω ∂coefficientLaw ι =" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_variance", + "line": 116, + "source_header": "h\n\ntheorem scalarSeries_variance (a : ι → ℝ) (ha : Summable a) :\n Var[scalarSeries a; coefficientLaw ι] = ∑' i, a i ^" + }, + { + "kind": "theorem", + "unqualified_name": "source_linearCombination_hasGaussianLaw", + "line": 122, + "source_header": ")\n\ntheorem source_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) (c : Fin n → ℝ) :\n HasGaussianLaw (fun ω => ∑ j, c j * sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "source_finiteVector_hasGaussianLaw", + "line": 147, + "source_header": ")\n\ntheorem source_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_isGaussianProcess", + "line": 174, + "source_header": "l\n\ntheorem sourceField_isGaussianProcess (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsGaussianProcess (fun x ω => sourceField d L ω x) (sourceLaw d" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/GaussianSeriesFoundation.lean", + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "coefficientLaw", + "line": 15, + "source_header": "n\n\n/-- The same actual probability measure used for every coefficient and series assertion. -/\ndef coefficientLaw (ι : Type*) : Measure (ι →" + }, + { + "kind": "instance", + "unqualified_name": "coefficientLaw_isProbabilityMeasure", + "line": 19, + "source_header": "1)\n\ninstance coefficientLaw_isProbabilityMeasure (ι : Type*) :\n IsProbabilityMeasure (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_measurePreserving", + "line": 24, + "source_header": "nce\n\ntheorem coordinate_measurePreserving {ι : Type*} (i : ι) :\n MeasurePreserving (fun ω : ι → ℝ => ω i) (coefficientLaw ι)\n (gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 29, + "source_header": ") i\n\ntheorem coordinate_marginal {ι : Type*} (i : ι) :\n (coefficientLaw ι).map (fun ω => ω i) = gaussianReal" + }, + { + "kind": "theorem", + "unqualified_name": "coordinates_independent", + "line": 33, + "source_header": "_eq\n\ntheorem coordinates_independent (ι : Type*) :\n iIndepFun (fun i (ω : ι → ℝ) => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_memLp", + "line": 38, + "source_header": "id)\n\ntheorem coordinate_memLp {ι : Type*} (i : ι) (p : ℝ≥0∞) (hp : p ≠ ∞) :\n MemLp (fun ω : ι → ℝ => ω i) p (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_integrable", + "line": 43, + "source_header": "i)\n\ntheorem coordinate_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_abs_integrable", + "line": 47, + "source_header": "p))\n\ntheorem coordinate_abs_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => |ω i|) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_abs_summable_ae", + "line": 51, + "source_header": "orm\n\ntheorem weighted_abs_summable_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (ha : ∀ i, 0 ≤ a i) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, Summable (fun i => a i * |ω" + }, + { + "kind": "def", + "unqualified_name": "scalarSeries", + "line": 75, + "source_header": "hω\n\n/-- The actual scalar sum; its convergence is proved separately on the product law. -/\ndef scalarSeries {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_measurable", + "line": 79, + "source_header": "* ω i\n\ntheorem scalarSeries_measurable {ι : Type*} [Countable ι] (a : ι → ℝ) :\n Measurable (scalarSeri" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_hasSum_ae", + "line": 86, + "source_header": "ly i)\n\ntheorem scalarSeries_hasSum_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, HasSum (fun i => a i * ω i) (scalarSeries" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceTorusC4.lean", + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "quotientChart", + "line": 12, + "source_header": "def quotientChart (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n OpenPartialHomeomorph (SourceTorus d L) (Fin d → ℝ)" + }, + { + "kind": "def", + "unqualified_name": "chartCenter", + "line": 16, + "source_header": "def chartCenter (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) : Fin d → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "quotientChart_symm", + "line": 19, + "source_header": "theorem quotientChart_symm (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n (quotientChart d L a).symm = torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "centered_chart_covers", + "line": 23, + "source_header": "theorem centered_chart_covers (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) :\n q ∈ (quotientChart d L (chartCenter d L q)).source" + }, + { + "kind": "theorem", + "unqualified_name": "chart_transition_contDiff", + "line": 51, + "source_header": "theorem chart_transition_contDiff (d : ℕ) (L : ℝ) [Fact (0 < L)] (a b : Fin d → ℝ) :\n ContDiffOn ℝ ∞ ((quotientChart d L a).symm.trans (quotientChart d L b))\n ((quotientChart d L a).symm.trans (quotientChart d L b)).source" + }, + { + "kind": "theorem", + "unqualified_name": "torus_isManifold", + "line": 98, + "source_header": "theorem torus_isManifold (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsManifold 𝓘(ℝ, Fin d → ℝ) ∞ (SourceTorus d L)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_contMDiff_ae", + "line": 110, + "source_header": "theorem torusSourceField_contMDiff_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d,\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) 4 (torusSourceField d L sample)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_weakSuperlevel_closed_ae", + "line": 126, + "source_header": "theorem torusSourceField_weakSuperlevel_closed_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d, ∀ h : ℝ,\n IsClosed {q : SourceTorus d L | h ≤ torusSourceField d L sample q}" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceC4.lean", + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "phaseCLM", + "line": 13, + "source_header": "4\n\ndef phaseCLM (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : (Fin d → ℝ) →L[ℝ]" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_apply", + "line": 16, + "source_header": "i\n\ntheorem phaseCLM_apply (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) :\n phaseCLM d L k x = phase d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_norm_le", + "line": 20, + "source_header": "]\n\ntheorem phaseCLM_norm_le (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n ‖phaseCLM d L k‖ ≤ ∑ i, |sourceC L * (k i : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_bound", + "line": 35, + "source_header": "]\n\ntheorem modeCoefficient_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (hj : j ≤ 4) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_ae", + "line": 102, + "source_header": "]\n\ntheorem sourceField_contDiff_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ContDiff ℝ 4 (sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_affine_ae", + "line": 133, + "source_header": ")\n\ntheorem sourceField_contDiff_affine_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ (T : (Fin d → ℝ) →L[ℝ] (Fin d → ℝ)) (a : Fin d → ℝ),\n ContDiff ℝ 4 (fun x => sourceField d L ω (a + T x)" + } + ] + }, + { + "path": "frontiers/source_lifetime_realization_20261017/inputs/SourceLattice.lean", + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "latticeFrequency", + "line": 8, + "source_header": "def latticeFrequency (d : ℕ) (m : SourceMode d) : Fin d → ℤ" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_ne_zero", + "line": 13, + "source_header": "theorem halfLattice_ne_zero (d : ℕ) {k : Fin d → ℤ} (hk : k ∈ halfLattice d) :\n k ≠ 0" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_partition", + "line": 20, + "source_header": "theorem halfLattice_partition (d : ℕ) {k : Fin d → ℤ} (hk : k ≠ 0) :\n (k ∈ halfLattice d ∨ -k ∈ halfLattice d) ∧\n ¬ (k ∈ halfLattice d ∧ -k ∈ halfLattice d)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_neg", + "line": 59, + "source_header": "theorem sourceWeight_neg (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L (-k) = sourceWeight d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phase_lattice_shift", + "line": 64, + "source_header": "theorem phase_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k n : Fin d → ℤ) (x : Fin d → ℝ) :\n phase d L k (fun i => x i + L * (n i : ℝ)) =\n phase d L k x + ((∑ i, k i * n i : ℤ) : ℝ) * (2 * Real.pi)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_lattice_shift", + "line": 78, + "source_header": "theorem modeCoefficient_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) =\n modeCoefficient d L m x" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_lattice_shift", + "line": 90, + "source_header": "theorem sourceField_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n sourceField d L ω (fun i => x i + L * (n i : ℝ)) = sourceField d L ω x" + }, + { + "kind": "theorem", + "unqualified_name": "pairedCoefficient_kernel", + "line": 100, + "source_header": "theorem pairedCoefficient_kernel (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ↥(halfLattice d)) (x y : Fin d → ℝ) :\n (∑ b : Bool, modeCoefficient d L (some (k,b)) x *\n modeCoefficient d L (some (k,b)) y) =\n (2 * sourceWeight d L k / sourceZ d L) * Real.cos (phase d L k (x - y))" + }, + { + "kind": "theorem", + "unqualified_name": "latticeFrequency_bijective", + "line": 120, + "source_header": "theorem latticeFrequency_bijective (d : ℕ) : Function.Bijective (latticeFrequency d)" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:frontiers/source_smooth_realization_20261011", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmooth.lean", + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothCarrier.lean", + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceKernel.lean", + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorus.lean", + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SpectralWeights.lean", + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothControls.lean", + "sha256": "8eca5ecdb5e2a0c1cb786468b340e4516df653468f958e535f156baafef088b4" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceFourierSeries.lean", + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceSmoothAxiomAudit.lean", + "sha256": "4dfa901029fab71d127c9f4c8cf30c937607f4444e6af64f429890d9d141d591" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceCovariance.lean", + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceGaussianLaw.lean", + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/GaussianSeriesFoundation.lean", + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceTorusC4.lean", + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceC4.lean", + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/frontiers/source_smooth_realization_20261011/SourceLattice.lean", + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b" + } + ], + "source_record_sha256": "3720e929093f342466ff7bdc1a9e5c399b50bc6f720b02874fc8c4b7b25acc07", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "frontiers/source_smooth_realization_20261011", + "source_files": [ + { + "path": "frontiers/source_smooth_realization_20261011/SourceSmooth.lean", + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "orderCoordinateBound", + "line": 24, + "source_header": "h\n\ndef orderCoordinateBound (n : ℕ) (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderProductBound", + "line": 27, + "source_header": "n\n\ndef orderProductBound (n d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderPairedBound", + "line": 30, + "source_header": ")\n\ndef orderPairedBound (n d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderModeBound", + "line": 33, + "source_header": "k\n\ndef orderModeBound (n d : ℕ) (L : ℝ) (m : SourceMode d) :" + }, + { + "kind": "theorem", + "unqualified_name": "orderCoordinateBound_summable", + "line": 38, + "source_header": "k\n\ntheorem orderCoordinateBound_summable (n : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderCoordinateBound n a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderProductBound_summable", + "line": 59, + "source_header": "g\n\ntheorem orderProductBound_summable (n d : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderProductBound n d a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_summable", + "line": 64, + "source_header": "d\n\ntheorem orderPairedBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderPairedBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_eq_amplitude", + "line": 68, + "source_header": "_\n\ntheorem orderPairedBound_eq_amplitude (n d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : Fin d → ℤ) :\n orderPairedBound n d L k =\n Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_nonneg", + "line": 92, + "source_header": "g\n\ntheorem orderModeBound_nonneg (n d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_summable", + "line": 100, + "source_header": "y\n\ntheorem orderModeBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_four", + "line": 115, + "source_header": "e\n\ntheorem orderModeBound_four (d : ℕ) (L : ℝ) (m : SourceMode d) :\n orderModeBound 4 d L m = modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_order_bound", + "line": 119, + "source_header": "l\n\ntheorem modeCoefficient_iteratedFDeriv_order_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ orderModeBound j d L" + }, + { + "kind": "def", + "unqualified_name": "goodSample", + "line": 179, + "source_header": "]\n\n/-- One explicit coefficient event, shared by every derivative order. -/\ndef goodSample (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : P" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_ae", + "line": 183, + "source_header": "m|)\n\ntheorem goodSample_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, goodSample d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_of_goodSample", + "line": 190, + "source_header": "hL)\n\ntheorem sourceField_smooth_of_goodSample (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (hω : goodSample d L ω) :\n ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_ae", + "line": 222, + "source_header": "m))\n\ntheorem sourceField_smooth_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_congr_cofinite", + "line": 227, + "source_header": "hω\n\n/-- The carrier depends only on the coefficient tail; finite coordinate changes\ncannot destroy any derivative-order summability condition. -/\ntheorem goodSample_congr_cofinite (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (hωη : ω =ᶠ[Filter.cofinite] η) :\n goodSample d L ω ↔ goodSample" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_finite_change_iff", + "line": 242, + "source_header": "[hm]\n\ntheorem goodSample_finite_change_iff (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))\n (hωη : ∀ m ∉ s, ω m = η m) :\n goodSample d L ω ↔ goodSample" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceSmoothCarrier.lean", + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "goodSet", + "line": 30, + "source_header": "r\n\n/-- The actual common coefficient event, with no smoothness premise added. -/\ndef goodSet (d : ℕ) (L : ℝ) : Set (SourceMode d →" + }, + { + "kind": "def", + "unqualified_name": "orderAbsNN", + "line": 34, + "source_header": "ω}\n\nprivate def orderAbsNN (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ)\n (m : SourceMode d) :" + }, + { + "kind": "def", + "unqualified_name": "orderAbsTotal", + "line": 39, + "source_header": "_)⟩\n\nprivate def orderAbsTotal (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_ne_top_iff", + "line": 42, + "source_header": "0∞)\n\nprivate theorem orderAbsTotal_ne_top_iff (n d : ℕ) (L : ℝ)\n (ω : SourceMode d → ℝ) :\n orderAbsTotal n d L ω ≠ ∞ ↔\n Summable (fun m => orderModeBound n d L m * |ω" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_measurable", + "line": 48, + "source_header": "ω)\n\nprivate theorem orderAbsTotal_measurable (n d : ℕ) (L : ℝ) :\n Measurable (orderAbsTotal n d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measurable", + "line": 62, + "source_header": "eal\n\ntheorem goodSet_measurable (d : ℕ) (L : ℝ) : MeasurableSet (goodSet d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_ae", + "line": 75, + "source_header": "imp\n\ntheorem goodSet_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ω ∈ goodSet" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measure_one", + "line": 79, + "source_header": "hL\n\ntheorem goodSet_measure_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceLaw d (goodSet d L)" + }, + { + "kind": "abbrev", + "unqualified_name": "SmoothSample", + "line": 83, + "source_header": "hL)\n\n/-- A coefficient sample on the explicit all-order summability carrier. -/\nabbrev SmoothSample (d : ℕ) (L" + }, + { + "kind": "def", + "unqualified_name": "sampleInclusion", + "line": 86, + "source_header": "d L)\n\n/-- Literal inclusion, retaining every coefficient of the original sample. -/\ndef sampleInclusion (d : ℕ) (L : ℝ) : SmoothSample d L → (SourceMode" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurable", + "line": 90, + "source_header": "ype.val\n\ntheorem sampleInclusion_measurable (d : ℕ) (L : ℝ) :\n Measurable (sampleInclusi" + }, + { + "kind": "def", + "unqualified_name": "smoothLaw", + "line": 94, + "source_header": "ype_coe\n\n/-- Pull back the original product law; no normalization or new law is chosen. -/\ndef smoothLaw (d : ℕ) (L : ℝ) : Measure (SmoothSa" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_map", + "line": 98, + "source_header": "sion d L)\n\ntheorem sampleInclusion_map (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n (smoothLaw d L).map (sampleInclusion d L) = so" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurePreserving", + "line": 105, + "source_header": "ae d hL)]\n\ntheorem sampleInclusion_measurePreserving (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothLaw_isProbabilityMeasure", + "line": 109, + "source_header": "map d hL⟩\n\ntheorem smoothLaw_isProbabilityMeasure (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsProbabilityMeasure (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "observation_map_eq", + "line": 114, + "source_header": "t_ae d hL\n\n/-- Every measurable observation has exactly its original pushforward law. -/\ntheorem observation_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :\n (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceL" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 121, + "source_header": "n_map d hL]\n\ntheorem coordinate_marginal (d : ℕ) {L : ℝ} (hL : L ≠ 0) (m : SourceMode d) :\n (smoothLaw d L).map (fun ω => sampleInclusion d L ω m) = gauss" + }, + { + "kind": "theorem", + "unqualified_name": "finiteCoordinate_map_eq", + "line": 126, + "source_header": "_marginal m\n\ntheorem finiteCoordinate_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (m : Fin n → SourceMode d) :\n (smoothLaw d L).map (fun ω j => sampleInclusion d L ω (m j)) =\n (sourceLaw d).map (fun ω j" + }, + { + "kind": "def", + "unqualified_name": "smoothSourceField", + "line": 132, + "source_header": "ply (m j)))\n\n/-- The unchanged literal real-cover field, evaluated on the carrier. -/\ndef smoothSourceField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : F" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_contDiff", + "line": 136, + "source_header": "sion d L ω) x\n\ntheorem smoothSourceField_contDiff (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) (n : ℕ) : ContDiff ℝ n (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_smooth", + "line": 140, + "source_header": "ω.property n\n\ntheorem smoothSourceField_smooth (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ (⊤ : ℕ∞) (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_map_eq", + "line": 144, + "source_header": "tDiff d hL ω)\n\ntheorem smoothSourceField_finiteVector_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n (smoothLaw d L).map (fun ω j => smoothSourceField d L ω (x j)) =\n (sourceLaw d).map (fun ω j => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_hasGaussianLaw", + "line": 151, + "source_header": "e d L (x j)))\n\ntheorem smoothSourceField_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => smoothSourceField d L ω (x j)) (s" + }, + { + "kind": "theorem", + "unqualified_name": "covariance_comp_inclusion", + "line": 161, + "source_header": "sGaussian_map\n\ntheorem covariance_comp_inclusion (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (X Y : (SourceMode d → ℝ) → ℝ) (hX : Measurable X) (hY : Measurable Y) :\n cov[fun ω => X (sampleInclusion d L ω), fun ω => Y (sampleInclusion d L ω); smoothLaw d L] =\n cov[X, Y;" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_covariance", + "line": 171, + "source_header": "exact h.symm\n\ntheorem smoothSourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (x y : Fin d → ℝ) :\n cov[fun ω => smoothSourceField d L ω x, fun ω => smoothSourceField d L ω y; smoothLaw d L] =\n sourceSpectralKerne" + }, + { + "kind": "def", + "unqualified_name": "smoothTorusSourceField", + "line": 181, + "source_header": "ance d hL x y\n\n/-- The unchanged literal torus descent of the same coefficient sample. -/\ndef smoothTorusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) (q : Sourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_smooth", + "line": 188, + "source_header": "ualChartedSpace\n\ntheorem smoothTorusSourceField_smooth (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) :\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) (⊤ : ℕ∞) (smoothTorusSou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_finiteVector_hasGaussianLaw", + "line": 205, + "source_header": "ontDiffWithinAt\n\ntheorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ)\n [Fact (0 < L)] (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => smoothTorusSourceField d L ω (q j))" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_covariance", + "line": 218, + "source_header": ".isGaussian_map\n\ntheorem smoothTorusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => smoothTorusSourceField d L ω q, fun ω => smoothTorusSourceField d L ω p;\n smoothLaw d L] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepres" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceKernel.lean", + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "frequencyEquiv", + "line": 8, + "source_header": "def frequencyEquiv (d : ℕ) : SourceMode d ≃ (Fin d → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "sourceSpectralKernel", + "line": 11, + "source_header": "/-- The prescribed normalized full-lattice real Fourier kernel; image/Poisson linkage is separate. -/\ndef sourceSpectralKernel (d : ℕ) (L : ℝ) (z : Fin d → ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "tsum_mode", + "line": 15, + "source_header": ")\n\nprivate theorem tsum_mode (d : ℕ) (f : SourceMode d → ℝ) (hf : Summable f) :\n (∑' m, f m) = f none + ∑' k : ↥(halfLattice d),\n (f (some (k,false)) + f (some (k,true))" + }, + { + "kind": "theorem", + "unqualified_name": "modeProduct_summable", + "line": 33, + "source_header": "g\n\ntheorem modeProduct_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n Summable (fun m => modeCoefficient d L m x * modeCoefficient d L m y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_summable", + "line": 46, + "source_header": ")\n\ntheorem spectralKernel_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (z : Fin d → ℝ) :\n Summable (fun k : Fin d → ℤ =>\n sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)" + }, + { + "kind": "theorem", + "unqualified_name": "coefficientKernel_eq_fullLattice", + "line": 58, + "source_header": "q\n\ntheorem coefficientKernel_eq_fullLattice (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =\n sourceSpectralKernel d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_zero", + "line": 103, + "source_header": "m\n\ntheorem spectralKernel_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceSpectralKernel d L 0 =" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceTorus.lean", + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "SourceTorus", + "line": 13, + "source_header": "s\n\nabbrev SourceTorus (d : ℕ) (L : ℝ" + }, + { + "kind": "def", + "unqualified_name": "torusProjection", + "line": 15, + "source_header": "L\n\ndef torusProjection (d : ℕ) (L : ℝ) (x : Fin d → ℝ) : SourceTorus d" + }, + { + "kind": "def", + "unqualified_name": "torusRepresentative", + "line": 18, + "source_header": ")\n\ndef torusRepresentative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "torusSourceField", + "line": 22, + "source_header": "1\n\ndef torusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (q : SourceTorus d L) :" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_measurable", + "line": 26, + "source_header": ")\n\ntheorem torusProjection_measurable (d : ℕ) (L : ℝ) : Measurable (torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusRepresentative_measurable", + "line": 29, + "source_header": ")\n\ntheorem torusRepresentative_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (torusRepresentative d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_representative", + "line": 34, + "source_header": ")\n\ntheorem torusProjection_representative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : torusProjection d L (torusRepresentative d L q) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eq_of_torusProjection_eq", + "line": 39, + "source_header": ")\n\ntheorem sourceField_eq_of_torusProjection_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (x y : Fin d → ℝ)\n (h : torusProjection d L x = torusProjection d L y) :\n sourceField d L ω x = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_pullback", + "line": 57, + "source_header": "m\n\ntheorem torusSourceField_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (x : Fin d → ℝ) :\n torusSourceField d L ω (torusProjection d L x) = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_eval_measurable", + "line": 64, + "source_header": ")\n\ntheorem torusSourceField_eval_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Measurable (fun ω => torusSourceField d L ω q" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_joint_measurable", + "line": 68, + "source_header": ")\n\ntheorem torusSourceField_joint_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (fun p : (SourceMode d → ℝ) × SourceTorus d L =>\n torusSourceField d L p.1 p.2" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_finiteVector_hasGaussianLaw", + "line": 84, + "source_header": ")\n\ntheorem torusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => torusSourceField d L ω (q j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_isGaussianProcess", + "line": 90, + "source_header": ")\n\ntheorem torusSourceField_isGaussianProcess (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsGaussianProcess (fun q ω => torusSourceField d L ω q) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance", + "line": 95, + "source_header": ")\n\ntheorem torusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance_pullback", + "line": 102, + "source_header": ")\n\ntheorem torusSourceField_covariance_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (x y : Fin d → ℝ) :\n cov[fun ω => torusSourceField d L ω (torusProjection d L x),\n fun ω => torusSourceField d L ω (torusProjection d L y); sourceLaw d] =\n sourceSpectralKernel d L (x - y" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SpectralWeights.lean", + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "decay", + "line": 14, + "source_header": "s\n\ndef decay (a : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "coordinateBound", + "line": 16, + "source_header": ")\ndef coordinateBound (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productDecay", + "line": 18, + "source_header": "4\ndef productDecay (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productBound", + "line": 20, + "source_header": ")\ndef productBound (d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceA", + "line": 22, + "source_header": ")\ndef sourceA (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceC", + "line": 23, + "source_header": "2\ndef sourceC (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceWeight", + "line": 24, + "source_header": "L\ndef sourceWeight (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceZ", + "line": 26, + "source_header": "k\ndef sourceZ (d : ℕ) (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "pairedBound", + "line": 27, + "source_header": "k\ndef pairedBound (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "theorem", + "unqualified_name": "summable_decay_pow", + "line": 29, + "source_header": "k\n\ntheorem summable_decay_pow {a : ℝ} (ha : 0 < a) (n : ℕ) :\n Summable (fun k : ℤ => decay a k * |(k : ℝ)| ^ n" + }, + { + "kind": "theorem", + "unqualified_name": "coordinateBound_summable", + "line": 40, + "source_header": "b\n\ntheorem coordinateBound_summable {a c : ℝ} (ha : 0 < a) :\n Summable (coordinateBound a c" + }, + { + "kind": "theorem", + "unqualified_name": "finite_product_summable", + "line": 52, + "source_header": "n\ntheorem finite_product_summable {f : ℤ → ℝ} (hf : Summable f) (hn : ∀ k, 0 ≤ f k)\n (d : ℕ) : Summable (fun k : Fin d → ℤ => ∏ i, f (k i)" + }, + { + "kind": "theorem", + "unqualified_name": "productBound_summable", + "line": 72, + "source_header": "p\n\ntheorem productBound_summable {a c : ℝ} (ha : 0 < a) (d : ℕ) :\n Summable (productBound d a c" + }, + { + "kind": "theorem", + "unqualified_name": "productDecay_eq_exp", + "line": 77, + "source_header": "d\n\ntheorem productDecay_eq_exp (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :\n productDecay d a k = exp (-a * ∑ i, (k i : ℝ) ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "frequency_l1_le_product", + "line": 82, + "source_header": "]\n\ntheorem frequency_l1_le_product (d : ℕ) (v : Fin d → ℝ) (hv : ∀ i, 0 ≤ v i) :\n 1 + ∑ i, v i ≤ ∏ i, (1 + v i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceA_pos", + "line": 98, + "source_header": "v\n\ntheorem sourceA_pos {L : ℝ} (hL : L ≠ 0) : 0 < sourceA" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_eq_physical", + "line": 102, + "source_header": "y\n\ntheorem sourceWeight_eq_physical (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L k = exp (-(∑ i, (sourceC L * (k i : ℝ)) ^ 2) / 2" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_summable", + "line": 117, + "source_header": "g\n\ntheorem sourceWeight_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (sourceWeight d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceZ_pos", + "line": 124, + "source_header": "d\n\ntheorem sourceZ_pos (d : ℕ) {L : ℝ} (hL : L ≠ 0) : 0 < sourceZ d" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_eq_amplitude", + "line": 129, + "source_header": "]\n\ntheorem pairedBound_eq_amplitude (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : Fin d → ℤ) :\n pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_summable", + "line": 151, + "source_header": "g\n\ntheorem pairedBound_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (pairedBound d L" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_subtype_summable", + "line": 155, + "source_header": "_\n\ntheorem pairedBound_subtype_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (S : Set (Fin d → ℤ)) : Summable (fun k : S => pairedBound d L k" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceSmoothControls.lean", + "sha256": "8eca5ecdb5e2a0c1cb786468b340e4516df653468f958e535f156baafef088b4", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "old_four_does_not_fill_all_orders", + "line": 13, + "source_header": "s\n\n/-- The old a.e. order-four theorem cannot fill the all-orders goal. -/\ntheorem old_four_does_not_fill_all_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "represented_sample_order_five", + "line": 19, + "source_header": "hL\n\ntheorem represented_sample_order_five (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ 5 (smoothSourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "represented_sample_order_thirtyseven", + "line": 23, + "source_header": "ω 5\n\ntheorem represented_sample_order_thirtyseven (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ 37 (smoothSourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "one_carrier_for_both_orders", + "line": 27, + "source_header": "37\n\n/-- Both higher orders hold for every sample of the very same carrier. -/\ntheorem one_carrier_for_both_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) :\n ContDiff ℝ 5 (smoothSourceField d L ω) ∧\n ContDiff ℝ 37 (smoothSourceField d" + }, + { + "kind": "theorem", + "unqualified_name": "literal_field_everywhere", + "line": 34, + "source_header": "hL ω⟩\n\ntheorem literal_field_everywhere (d : ℕ) (L : ℝ) (ω : SmoothSample d L)\n (x : Fin d → ℝ) :\n smoothSourceField d L ω x = sourceField d L (sampleInclusion d L" + }, + { + "kind": "theorem", + "unqualified_name": "entire_coefficient_law_preserved", + "line": 38, + "source_header": "= rfl\n\ntheorem entire_coefficient_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n (smoothLaw d L).map (sampleInclusion d L) = source" + }, + { + "kind": "theorem", + "unqualified_name": "arbitrary_observation_law_preserved", + "line": 42, + "source_header": "d hL\n\ntheorem arbitrary_observation_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :\n (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceLaw d)." + }, + { + "kind": "theorem", + "unqualified_name": "finite_block_changes_preserve_carrier", + "line": 47, + "source_header": "X hX\n\n/-- Arbitrarily large changes on a finite block leave the actual carrier intact. -/\ntheorem finite_block_changes_preserve_carrier (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))\n (hωη : ∀ m ∉ s, ω m = η m) :\n goodSample d L ω ↔ goodSampl" + }, + { + "kind": "theorem", + "unqualified_name": "field_variance_one", + "line": 54, + "source_header": "η s hωη\n\n/-- The restricted field keeps variance one, which excludes a zero-field substitution. -/\ntheorem field_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n cov[fun ω => smoothSourceField d L ω x,\n fun ω => smoothSourceField d L ω x; smoothLaw" + }, + { + "kind": "theorem", + "unqualified_name": "carrier_probability", + "line": 60, + "source_header": "ero d hL]\n\n/-- The underlying restricted measure has total mass one, without conditioning\non a finite pin event or normalizing by a weight. -/\ntheorem carrier_probability (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsProbabilityMeasure (smo" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceFourierSeries.lean", + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "halfLattice", + "line": 14, + "source_header": "e\n\n/-- The representative whose first nonzero coordinate is positive. -/\ndef halfLattice (d : ℕ) : Set (Fin d →" + }, + { + "kind": "abbrev", + "unqualified_name": "SourceMode", + "line": 18, + "source_header": "0}\n\nabbrev SourceMode (d :" + }, + { + "kind": "abbrev", + "unqualified_name": "sourceLaw", + "line": 20, + "source_header": "ol)\n\n/-- The actual common law, with independent variance-one real coefficients. -/\nabbrev sourceLaw (d : ℕ) : Measure (SourceMode d" + }, + { + "kind": "def", + "unqualified_name": "phase", + "line": 24, + "source_header": "de d)\n\ndef phase (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ" + }, + { + "kind": "def", + "unqualified_name": "modeCoefficient", + "line": 27, + "source_header": "* x i\n\n/-- False is the cosine coefficient and true the independent sine coefficient. -/\ndef modeCoefficient (d : ℕ) (L : ℝ) (m : SourceMode d) (x : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "modeMajorant", + "line": 34, + "source_header": "L k x)\n\ndef modeMajorant (d : ℕ) (L : ℝ) (m : SourceMode" + }, + { + "kind": "def", + "unqualified_name": "sourceField", + "line": 39, + "source_header": "d d L k\n\n/-- Literal normalized real Fourier sum on the common coefficient samples. -/\ndef sourceField (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) (x : Fin d" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_nonneg", + "line": 43, + "source_header": "L m x) ω\n\ntheorem modeMajorant_nonneg (d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_summable", + "line": 52, + "source_header": "ositivity\n\ntheorem modeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (modeMajo" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_bound", + "line": 66, + "source_header": ".summable\n\ntheorem modeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (x : Fin d → ℝ) :\n |modeCoefficient d L m x| ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eval_measurable", + "line": 98, + "source_header": "rans hamp\n\ntheorem sourceField_eval_measurable (d : ℕ) (L : ℝ) (x : Fin d → ℝ) :\n Measurable (fun ω => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "sourceMajorant_ae", + "line": 102, + "source_header": "surable _\n\ntheorem sourceMajorant_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Summable (fun m => modeMajorant d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAbs_uniform_ae", + "line": 106, + "source_header": "ble d hL)\n\ntheorem sourceAbs_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => |modeCoefficient d L m x * ω m|)\n (fun x => ∑' m, |modeCoefficient d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_uniform_ae", + "line": 117, + "source_header": "nonneg _)\n\ntheorem sourceField_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => modeCoefficient d L m x * ω m)\n (sourceFie" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_continuous_ae", + "line": 128, + "source_header": "nonneg _)\n\ntheorem sourceField_continuous_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Continuous (sourceFie" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceSmoothAxiomAudit.lean", + "sha256": "4dfa901029fab71d127c9f4c8cf30c937607f4444e6af64f429890d9d141d591", + "declarations_lexical": [] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceCovariance.lean", + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "scalarSeries_covariance", + "line": 12, + "source_header": "theorem scalarSeries_covariance (a b : ι → ℝ) (ha : Summable a) (hb : Summable b) :\n cov[scalarSeries a, scalarSeries b; coefficientLaw ι] = ∑' i, a i * b i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_integral_zero", + "line": 51, + "source_header": "theorem sourceField_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n ∫ ω, sourceField d L ω x ∂sourceLaw d = 0" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_covariance", + "line": 58, + "source_header": "theorem sourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] =\n sourceSpectralKernel d L (x - y)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_variance_one", + "line": 68, + "source_header": "theorem sourceField_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n Var[fun ω => sourceField d L ω x; sourceLaw d] = 1" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceGaussianLaw.lean", + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "summable_square", + "line": 18, + "source_header": "}\n\nprivate theorem summable_square (a : ι → ℝ) (ha : Summable a) :\n Summable (fun i => a i ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "partial_charFun", + "line": 29, + "source_header": "n\nprivate theorem partial_charFun (a : ι → ℝ) (s : Finset ι) (t : ℝ) :\n charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =\n Complex.exp (-((∑ i ∈ s, a i ^ 2 : ℝ) : ℂ) * (t : ℂ) ^ 2 / 2" + }, + { + "kind": "theorem", + "unqualified_name": "charFun_partial_tendsto", + "line": 55, + "source_header": "]\n\nprivate theorem charFun_partial_tendsto (a : ι → ℝ) (ha : Summable a) (t : ℝ) :\n Filter.Tendsto\n (fun s : Finset ι => charFun ((coefficientLaw ι).map\n (fun ω => ∑ i ∈ s, a i * ω i)) t)\n Filter.atTop (𝓝 (charFun ((coefficientLaw ι).map (scalarSeries a)) t)" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_map_gaussian", + "line": 90, + "source_header": "ω\n\ntheorem scalarSeries_map_gaussian (a : ι → ℝ) (ha : Summable a) :\n (coefficientLaw ι).map (scalarSeries a) =\n gaussianReal 0 (∑' i, a i ^ 2).toNNRea" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_integral_zero", + "line": 109, + "source_header": "g\n\ntheorem scalarSeries_integral_zero (a : ι → ℝ) (ha : Summable a) :\n ∫ ω, scalarSeries a ω ∂coefficientLaw ι =" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_variance", + "line": 116, + "source_header": "h\n\ntheorem scalarSeries_variance (a : ι → ℝ) (ha : Summable a) :\n Var[scalarSeries a; coefficientLaw ι] = ∑' i, a i ^" + }, + { + "kind": "theorem", + "unqualified_name": "source_linearCombination_hasGaussianLaw", + "line": 122, + "source_header": ")\n\ntheorem source_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) (c : Fin n → ℝ) :\n HasGaussianLaw (fun ω => ∑ j, c j * sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "source_finiteVector_hasGaussianLaw", + "line": 147, + "source_header": ")\n\ntheorem source_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_isGaussianProcess", + "line": 174, + "source_header": "l\n\ntheorem sourceField_isGaussianProcess (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsGaussianProcess (fun x ω => sourceField d L ω x) (sourceLaw d" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/GaussianSeriesFoundation.lean", + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "coefficientLaw", + "line": 15, + "source_header": "n\n\n/-- The same actual probability measure used for every coefficient and series assertion. -/\ndef coefficientLaw (ι : Type*) : Measure (ι →" + }, + { + "kind": "instance", + "unqualified_name": "coefficientLaw_isProbabilityMeasure", + "line": 19, + "source_header": "1)\n\ninstance coefficientLaw_isProbabilityMeasure (ι : Type*) :\n IsProbabilityMeasure (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_measurePreserving", + "line": 24, + "source_header": "nce\n\ntheorem coordinate_measurePreserving {ι : Type*} (i : ι) :\n MeasurePreserving (fun ω : ι → ℝ => ω i) (coefficientLaw ι)\n (gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 29, + "source_header": ") i\n\ntheorem coordinate_marginal {ι : Type*} (i : ι) :\n (coefficientLaw ι).map (fun ω => ω i) = gaussianReal" + }, + { + "kind": "theorem", + "unqualified_name": "coordinates_independent", + "line": 33, + "source_header": "_eq\n\ntheorem coordinates_independent (ι : Type*) :\n iIndepFun (fun i (ω : ι → ℝ) => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_memLp", + "line": 38, + "source_header": "id)\n\ntheorem coordinate_memLp {ι : Type*} (i : ι) (p : ℝ≥0∞) (hp : p ≠ ∞) :\n MemLp (fun ω : ι → ℝ => ω i) p (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_integrable", + "line": 43, + "source_header": "i)\n\ntheorem coordinate_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_abs_integrable", + "line": 47, + "source_header": "p))\n\ntheorem coordinate_abs_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => |ω i|) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_abs_summable_ae", + "line": 51, + "source_header": "orm\n\ntheorem weighted_abs_summable_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (ha : ∀ i, 0 ≤ a i) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, Summable (fun i => a i * |ω" + }, + { + "kind": "def", + "unqualified_name": "scalarSeries", + "line": 75, + "source_header": "hω\n\n/-- The actual scalar sum; its convergence is proved separately on the product law. -/\ndef scalarSeries {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_measurable", + "line": 79, + "source_header": "* ω i\n\ntheorem scalarSeries_measurable {ι : Type*} [Countable ι] (a : ι → ℝ) :\n Measurable (scalarSeri" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_hasSum_ae", + "line": 86, + "source_header": "ly i)\n\ntheorem scalarSeries_hasSum_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, HasSum (fun i => a i * ω i) (scalarSeries" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceTorusC4.lean", + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "quotientChart", + "line": 12, + "source_header": "def quotientChart (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n OpenPartialHomeomorph (SourceTorus d L) (Fin d → ℝ)" + }, + { + "kind": "def", + "unqualified_name": "chartCenter", + "line": 16, + "source_header": "def chartCenter (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) : Fin d → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "quotientChart_symm", + "line": 19, + "source_header": "theorem quotientChart_symm (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n (quotientChart d L a).symm = torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "centered_chart_covers", + "line": 23, + "source_header": "theorem centered_chart_covers (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) :\n q ∈ (quotientChart d L (chartCenter d L q)).source" + }, + { + "kind": "theorem", + "unqualified_name": "chart_transition_contDiff", + "line": 51, + "source_header": "theorem chart_transition_contDiff (d : ℕ) (L : ℝ) [Fact (0 < L)] (a b : Fin d → ℝ) :\n ContDiffOn ℝ ∞ ((quotientChart d L a).symm.trans (quotientChart d L b))\n ((quotientChart d L a).symm.trans (quotientChart d L b)).source" + }, + { + "kind": "theorem", + "unqualified_name": "torus_isManifold", + "line": 98, + "source_header": "theorem torus_isManifold (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsManifold 𝓘(ℝ, Fin d → ℝ) ∞ (SourceTorus d L)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_contMDiff_ae", + "line": 110, + "source_header": "theorem torusSourceField_contMDiff_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d,\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) 4 (torusSourceField d L sample)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_weakSuperlevel_closed_ae", + "line": 126, + "source_header": "theorem torusSourceField_weakSuperlevel_closed_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d, ∀ h : ℝ,\n IsClosed {q : SourceTorus d L | h ≤ torusSourceField d L sample q}" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceC4.lean", + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "phaseCLM", + "line": 13, + "source_header": "4\n\ndef phaseCLM (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : (Fin d → ℝ) →L[ℝ]" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_apply", + "line": 16, + "source_header": "i\n\ntheorem phaseCLM_apply (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) :\n phaseCLM d L k x = phase d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_norm_le", + "line": 20, + "source_header": "]\n\ntheorem phaseCLM_norm_le (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n ‖phaseCLM d L k‖ ≤ ∑ i, |sourceC L * (k i : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_bound", + "line": 35, + "source_header": "]\n\ntheorem modeCoefficient_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (hj : j ≤ 4) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_ae", + "line": 102, + "source_header": "]\n\ntheorem sourceField_contDiff_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ContDiff ℝ 4 (sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_affine_ae", + "line": 133, + "source_header": ")\n\ntheorem sourceField_contDiff_affine_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ (T : (Fin d → ℝ) →L[ℝ] (Fin d → ℝ)) (a : Fin d → ℝ),\n ContDiff ℝ 4 (fun x => sourceField d L ω (a + T x)" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceLattice.lean", + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "latticeFrequency", + "line": 8, + "source_header": "def latticeFrequency (d : ℕ) (m : SourceMode d) : Fin d → ℤ" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_ne_zero", + "line": 13, + "source_header": "theorem halfLattice_ne_zero (d : ℕ) {k : Fin d → ℤ} (hk : k ∈ halfLattice d) :\n k ≠ 0" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_partition", + "line": 20, + "source_header": "theorem halfLattice_partition (d : ℕ) {k : Fin d → ℤ} (hk : k ≠ 0) :\n (k ∈ halfLattice d ∨ -k ∈ halfLattice d) ∧\n ¬ (k ∈ halfLattice d ∧ -k ∈ halfLattice d)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_neg", + "line": 59, + "source_header": "theorem sourceWeight_neg (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L (-k) = sourceWeight d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phase_lattice_shift", + "line": 64, + "source_header": "theorem phase_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k n : Fin d → ℤ) (x : Fin d → ℝ) :\n phase d L k (fun i => x i + L * (n i : ℝ)) =\n phase d L k x + ((∑ i, k i * n i : ℤ) : ℝ) * (2 * Real.pi)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_lattice_shift", + "line": 78, + "source_header": "theorem modeCoefficient_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) =\n modeCoefficient d L m x" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_lattice_shift", + "line": 90, + "source_header": "theorem sourceField_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n sourceField d L ω (fun i => x i + L * (n i : ℝ)) = sourceField d L ω x" + }, + { + "kind": "theorem", + "unqualified_name": "pairedCoefficient_kernel", + "line": 100, + "source_header": "theorem pairedCoefficient_kernel (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ↥(halfLattice d)) (x y : Fin d → ℝ) :\n (∑ b : Bool, modeCoefficient d L (some (k,b)) x *\n modeCoefficient d L (some (k,b)) y) =\n (2 * sourceWeight d L k / sourceZ d L) * Real.cos (phase d L k (x - y))" + }, + { + "kind": "theorem", + "unqualified_name": "latticeFrequency_bijective", + "line": 120, + "source_header": "theorem latticeFrequency_bijective (d : ℕ) : Function.Bijective (latticeFrequency d)" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:frontiers/source_smooth_realization_20261011", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "frontiers/source_smooth_realization_20261011", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "frontiers/source_smooth_realization_20261011/SourceSmooth.lean", + "sha256": "12ad7263267a970bd5d5c95d7c7aa62d9c971f7beebf28f1aa7ed16d3a112f1b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "orderCoordinateBound", + "line": 24, + "source_header": "h\n\ndef orderCoordinateBound (n : ℕ) (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderProductBound", + "line": 27, + "source_header": "n\n\ndef orderProductBound (n d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderPairedBound", + "line": 30, + "source_header": ")\n\ndef orderPairedBound (n d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "orderModeBound", + "line": 33, + "source_header": "k\n\ndef orderModeBound (n d : ℕ) (L : ℝ) (m : SourceMode d) :" + }, + { + "kind": "theorem", + "unqualified_name": "orderCoordinateBound_summable", + "line": 38, + "source_header": "k\n\ntheorem orderCoordinateBound_summable (n : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderCoordinateBound n a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderProductBound_summable", + "line": 59, + "source_header": "g\n\ntheorem orderProductBound_summable (n d : ℕ) {a c : ℝ} (ha : 0 < a) :\n Summable (orderProductBound n d a c" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_summable", + "line": 64, + "source_header": "d\n\ntheorem orderPairedBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderPairedBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderPairedBound_eq_amplitude", + "line": 68, + "source_header": "_\n\ntheorem orderPairedBound_eq_amplitude (n d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : Fin d → ℤ) :\n orderPairedBound n d L k =\n Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_nonneg", + "line": 92, + "source_header": "g\n\ntheorem orderModeBound_nonneg (n d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_summable", + "line": 100, + "source_header": "y\n\ntheorem orderModeBound_summable (n d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (orderModeBound n d L" + }, + { + "kind": "theorem", + "unqualified_name": "orderModeBound_four", + "line": 115, + "source_header": "e\n\ntheorem orderModeBound_four (d : ℕ) (L : ℝ) (m : SourceMode d) :\n orderModeBound 4 d L m = modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_order_bound", + "line": 119, + "source_header": "l\n\ntheorem modeCoefficient_iteratedFDeriv_order_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ orderModeBound j d L" + }, + { + "kind": "def", + "unqualified_name": "goodSample", + "line": 179, + "source_header": "]\n\n/-- One explicit coefficient event, shared by every derivative order. -/\ndef goodSample (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : P" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_ae", + "line": 183, + "source_header": "m|)\n\ntheorem goodSample_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, goodSample d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_of_goodSample", + "line": 190, + "source_header": "hL)\n\ntheorem sourceField_smooth_of_goodSample (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (hω : goodSample d L ω) :\n ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_smooth_ae", + "line": 222, + "source_header": "m))\n\ntheorem sourceField_smooth_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_congr_cofinite", + "line": 227, + "source_header": "hω\n\n/-- The carrier depends only on the coefficient tail; finite coordinate changes\ncannot destroy any derivative-order summability condition. -/\ntheorem goodSample_congr_cofinite (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (hωη : ω =ᶠ[Filter.cofinite] η) :\n goodSample d L ω ↔ goodSample" + }, + { + "kind": "theorem", + "unqualified_name": "goodSample_finite_change_iff", + "line": 242, + "source_header": "[hm]\n\ntheorem goodSample_finite_change_iff (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))\n (hωη : ∀ m ∉ s, ω m = η m) :\n goodSample d L ω ↔ goodSample" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceSmoothCarrier.lean", + "sha256": "5defdf223e85e7ccd23b5a903a1a306fe7f723727eb6aabf62eef523ef8639ed", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "goodSet", + "line": 30, + "source_header": "r\n\n/-- The actual common coefficient event, with no smoothness premise added. -/\ndef goodSet (d : ℕ) (L : ℝ) : Set (SourceMode d →" + }, + { + "kind": "def", + "unqualified_name": "orderAbsNN", + "line": 34, + "source_header": "ω}\n\nprivate def orderAbsNN (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ)\n (m : SourceMode d) :" + }, + { + "kind": "def", + "unqualified_name": "orderAbsTotal", + "line": 39, + "source_header": "_)⟩\n\nprivate def orderAbsTotal (n d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_ne_top_iff", + "line": 42, + "source_header": "0∞)\n\nprivate theorem orderAbsTotal_ne_top_iff (n d : ℕ) (L : ℝ)\n (ω : SourceMode d → ℝ) :\n orderAbsTotal n d L ω ≠ ∞ ↔\n Summable (fun m => orderModeBound n d L m * |ω" + }, + { + "kind": "theorem", + "unqualified_name": "orderAbsTotal_measurable", + "line": 48, + "source_header": "ω)\n\nprivate theorem orderAbsTotal_measurable (n d : ℕ) (L : ℝ) :\n Measurable (orderAbsTotal n d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measurable", + "line": 62, + "source_header": "eal\n\ntheorem goodSet_measurable (d : ℕ) (L : ℝ) : MeasurableSet (goodSet d" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_ae", + "line": 75, + "source_header": "imp\n\ntheorem goodSet_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ω ∈ goodSet" + }, + { + "kind": "theorem", + "unqualified_name": "goodSet_measure_one", + "line": 79, + "source_header": "hL\n\ntheorem goodSet_measure_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceLaw d (goodSet d L)" + }, + { + "kind": "abbrev", + "unqualified_name": "SmoothSample", + "line": 83, + "source_header": "hL)\n\n/-- A coefficient sample on the explicit all-order summability carrier. -/\nabbrev SmoothSample (d : ℕ) (L" + }, + { + "kind": "def", + "unqualified_name": "sampleInclusion", + "line": 86, + "source_header": "d L)\n\n/-- Literal inclusion, retaining every coefficient of the original sample. -/\ndef sampleInclusion (d : ℕ) (L : ℝ) : SmoothSample d L → (SourceMode" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurable", + "line": 90, + "source_header": "ype.val\n\ntheorem sampleInclusion_measurable (d : ℕ) (L : ℝ) :\n Measurable (sampleInclusi" + }, + { + "kind": "def", + "unqualified_name": "smoothLaw", + "line": 94, + "source_header": "ype_coe\n\n/-- Pull back the original product law; no normalization or new law is chosen. -/\ndef smoothLaw (d : ℕ) (L : ℝ) : Measure (SmoothSa" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_map", + "line": 98, + "source_header": "sion d L)\n\ntheorem sampleInclusion_map (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n (smoothLaw d L).map (sampleInclusion d L) = so" + }, + { + "kind": "theorem", + "unqualified_name": "sampleInclusion_measurePreserving", + "line": 105, + "source_header": "ae d hL)]\n\ntheorem sampleInclusion_measurePreserving (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n MeasurePreserving (sampleInclusion d L) (smoothLaw d L) (sou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothLaw_isProbabilityMeasure", + "line": 109, + "source_header": "map d hL⟩\n\ntheorem smoothLaw_isProbabilityMeasure (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsProbabilityMeasure (smoot" + }, + { + "kind": "theorem", + "unqualified_name": "observation_map_eq", + "line": 114, + "source_header": "t_ae d hL\n\n/-- Every measurable observation has exactly its original pushforward law. -/\ntheorem observation_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :\n (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceL" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 121, + "source_header": "n_map d hL]\n\ntheorem coordinate_marginal (d : ℕ) {L : ℝ} (hL : L ≠ 0) (m : SourceMode d) :\n (smoothLaw d L).map (fun ω => sampleInclusion d L ω m) = gauss" + }, + { + "kind": "theorem", + "unqualified_name": "finiteCoordinate_map_eq", + "line": 126, + "source_header": "_marginal m\n\ntheorem finiteCoordinate_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (m : Fin n → SourceMode d) :\n (smoothLaw d L).map (fun ω j => sampleInclusion d L ω (m j)) =\n (sourceLaw d).map (fun ω j" + }, + { + "kind": "def", + "unqualified_name": "smoothSourceField", + "line": 132, + "source_header": "ply (m j)))\n\n/-- The unchanged literal real-cover field, evaluated on the carrier. -/\ndef smoothSourceField (d : ℕ) (L : ℝ) (ω : SmoothSample d L) (x : F" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_contDiff", + "line": 136, + "source_header": "sion d L ω) x\n\ntheorem smoothSourceField_contDiff (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) (n : ℕ) : ContDiff ℝ n (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_smooth", + "line": 140, + "source_header": "ω.property n\n\ntheorem smoothSourceField_smooth (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ (⊤ : ℕ∞) (smoothSourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_map_eq", + "line": 144, + "source_header": "tDiff d hL ω)\n\ntheorem smoothSourceField_finiteVector_map_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n (smoothLaw d L).map (fun ω j => smoothSourceField d L ω (x j)) =\n (sourceLaw d).map (fun ω j => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_finiteVector_hasGaussianLaw", + "line": 151, + "source_header": "e d L (x j)))\n\ntheorem smoothSourceField_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => smoothSourceField d L ω (x j)) (s" + }, + { + "kind": "theorem", + "unqualified_name": "covariance_comp_inclusion", + "line": 161, + "source_header": "sGaussian_map\n\ntheorem covariance_comp_inclusion (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (X Y : (SourceMode d → ℝ) → ℝ) (hX : Measurable X) (hY : Measurable Y) :\n cov[fun ω => X (sampleInclusion d L ω), fun ω => Y (sampleInclusion d L ω); smoothLaw d L] =\n cov[X, Y;" + }, + { + "kind": "theorem", + "unqualified_name": "smoothSourceField_covariance", + "line": 171, + "source_header": "exact h.symm\n\ntheorem smoothSourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (x y : Fin d → ℝ) :\n cov[fun ω => smoothSourceField d L ω x, fun ω => smoothSourceField d L ω y; smoothLaw d L] =\n sourceSpectralKerne" + }, + { + "kind": "def", + "unqualified_name": "smoothTorusSourceField", + "line": 181, + "source_header": "ance d hL x y\n\n/-- The unchanged literal torus descent of the same coefficient sample. -/\ndef smoothTorusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) (q : Sourc" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_smooth", + "line": 188, + "source_header": "ualChartedSpace\n\ntheorem smoothTorusSourceField_smooth (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SmoothSample d L) :\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) (⊤ : ℕ∞) (smoothTorusSou" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_finiteVector_hasGaussianLaw", + "line": 205, + "source_header": "ontDiffWithinAt\n\ntheorem smoothTorusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ)\n [Fact (0 < L)] (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => smoothTorusSourceField d L ω (q j))" + }, + { + "kind": "theorem", + "unqualified_name": "smoothTorusSourceField_covariance", + "line": 218, + "source_header": ".isGaussian_map\n\ntheorem smoothTorusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => smoothTorusSourceField d L ω q, fun ω => smoothTorusSourceField d L ω p;\n smoothLaw d L] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepres" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceKernel.lean", + "sha256": "5fa3abc8fb0db0c14c67b4ee840e659cdf80f7d22c9fd4cb5e6c1c7b204fbd21", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "frequencyEquiv", + "line": 8, + "source_header": "def frequencyEquiv (d : ℕ) : SourceMode d ≃ (Fin d → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "sourceSpectralKernel", + "line": 11, + "source_header": "/-- The prescribed normalized full-lattice real Fourier kernel; image/Poisson linkage is separate. -/\ndef sourceSpectralKernel (d : ℕ) (L : ℝ) (z : Fin d → ℝ) :" + }, + { + "kind": "theorem", + "unqualified_name": "tsum_mode", + "line": 15, + "source_header": ")\n\nprivate theorem tsum_mode (d : ℕ) (f : SourceMode d → ℝ) (hf : Summable f) :\n (∑' m, f m) = f none + ∑' k : ↥(halfLattice d),\n (f (some (k,false)) + f (some (k,true))" + }, + { + "kind": "theorem", + "unqualified_name": "modeProduct_summable", + "line": 33, + "source_header": "g\n\ntheorem modeProduct_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n Summable (fun m => modeCoefficient d L m x * modeCoefficient d L m y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_summable", + "line": 46, + "source_header": ")\n\ntheorem spectralKernel_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) (z : Fin d → ℝ) :\n Summable (fun k : Fin d → ℤ =>\n sourceWeight d L k / sourceZ d L * Real.cos (phase d L k z)" + }, + { + "kind": "theorem", + "unqualified_name": "coefficientKernel_eq_fullLattice", + "line": 58, + "source_header": "q\n\ntheorem coefficientKernel_eq_fullLattice (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n (∑' m, modeCoefficient d L m x * modeCoefficient d L m y) =\n sourceSpectralKernel d L (x - y" + }, + { + "kind": "theorem", + "unqualified_name": "spectralKernel_zero", + "line": 103, + "source_header": "m\n\ntheorem spectralKernel_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n sourceSpectralKernel d L 0 =" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceTorus.lean", + "sha256": "02857b44552ab0e51a756b3b095c4ba43f8168ac332b069acb5bc8146d337eef", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "SourceTorus", + "line": 13, + "source_header": "s\n\nabbrev SourceTorus (d : ℕ) (L : ℝ" + }, + { + "kind": "def", + "unqualified_name": "torusProjection", + "line": 15, + "source_header": "L\n\ndef torusProjection (d : ℕ) (L : ℝ) (x : Fin d → ℝ) : SourceTorus d" + }, + { + "kind": "def", + "unqualified_name": "torusRepresentative", + "line": 18, + "source_header": ")\n\ndef torusRepresentative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "torusSourceField", + "line": 22, + "source_header": "1\n\ndef torusSourceField (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (q : SourceTorus d L) :" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_measurable", + "line": 26, + "source_header": ")\n\ntheorem torusProjection_measurable (d : ℕ) (L : ℝ) : Measurable (torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusRepresentative_measurable", + "line": 29, + "source_header": ")\n\ntheorem torusRepresentative_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (torusRepresentative d L" + }, + { + "kind": "theorem", + "unqualified_name": "torusProjection_representative", + "line": 34, + "source_header": ")\n\ntheorem torusProjection_representative (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : torusProjection d L (torusRepresentative d L q) =" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eq_of_torusProjection_eq", + "line": 39, + "source_header": ")\n\ntheorem sourceField_eq_of_torusProjection_eq (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (x y : Fin d → ℝ)\n (h : torusProjection d L x = torusProjection d L y) :\n sourceField d L ω x = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_pullback", + "line": 57, + "source_header": "m\n\ntheorem torusSourceField_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (ω : SourceMode d → ℝ) (x : Fin d → ℝ) :\n torusSourceField d L ω (torusProjection d L x) = sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_eval_measurable", + "line": 64, + "source_header": ")\n\ntheorem torusSourceField_eval_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q : SourceTorus d L) : Measurable (fun ω => torusSourceField d L ω q" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_joint_measurable", + "line": 68, + "source_header": ")\n\ntheorem torusSourceField_joint_measurable (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n Measurable (fun p : (SourceMode d → ℝ) × SourceTorus d L =>\n torusSourceField d L p.1 p.2" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_finiteVector_hasGaussianLaw", + "line": 84, + "source_header": ")\n\ntheorem torusSourceField_finiteVector_hasGaussianLaw (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (n : ℕ) (q : Fin n → SourceTorus d L) :\n HasGaussianLaw (fun ω j => torusSourceField d L ω (q j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_isGaussianProcess", + "line": 90, + "source_header": ")\n\ntheorem torusSourceField_isGaussianProcess (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsGaussianProcess (fun q ω => torusSourceField d L ω q) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance", + "line": 95, + "source_header": ")\n\ntheorem torusSourceField_covariance (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (q p : SourceTorus d L) :\n cov[fun ω => torusSourceField d L ω q, fun ω => torusSourceField d L ω p; sourceLaw d] =\n sourceSpectralKernel d L (torusRepresentative d L q - torusRepresentative d L p" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_covariance_pullback", + "line": 102, + "source_header": ")\n\ntheorem torusSourceField_covariance_pullback (d : ℕ) (L : ℝ) [Fact (0 < L)]\n (x y : Fin d → ℝ) :\n cov[fun ω => torusSourceField d L ω (torusProjection d L x),\n fun ω => torusSourceField d L ω (torusProjection d L y); sourceLaw d] =\n sourceSpectralKernel d L (x - y" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SpectralWeights.lean", + "sha256": "92af14a2d83304de3f8576ee10b3d376587e93c4464f8c715b8d2e32360f44b0", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "decay", + "line": 14, + "source_header": "s\n\ndef decay (a : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "coordinateBound", + "line": 16, + "source_header": ")\ndef coordinateBound (a c : ℝ) (k : ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productDecay", + "line": 18, + "source_header": "4\ndef productDecay (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "productBound", + "line": 20, + "source_header": ")\ndef productBound (d : ℕ) (a c : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceA", + "line": 22, + "source_header": ")\ndef sourceA (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceC", + "line": 23, + "source_header": "2\ndef sourceC (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceWeight", + "line": 24, + "source_header": "L\ndef sourceWeight (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "def", + "unqualified_name": "sourceZ", + "line": 26, + "source_header": "k\ndef sourceZ (d : ℕ) (L : ℝ) :" + }, + { + "kind": "def", + "unqualified_name": "pairedBound", + "line": 27, + "source_header": "k\ndef pairedBound (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :" + }, + { + "kind": "theorem", + "unqualified_name": "summable_decay_pow", + "line": 29, + "source_header": "k\n\ntheorem summable_decay_pow {a : ℝ} (ha : 0 < a) (n : ℕ) :\n Summable (fun k : ℤ => decay a k * |(k : ℝ)| ^ n" + }, + { + "kind": "theorem", + "unqualified_name": "coordinateBound_summable", + "line": 40, + "source_header": "b\n\ntheorem coordinateBound_summable {a c : ℝ} (ha : 0 < a) :\n Summable (coordinateBound a c" + }, + { + "kind": "theorem", + "unqualified_name": "finite_product_summable", + "line": 52, + "source_header": "n\ntheorem finite_product_summable {f : ℤ → ℝ} (hf : Summable f) (hn : ∀ k, 0 ≤ f k)\n (d : ℕ) : Summable (fun k : Fin d → ℤ => ∏ i, f (k i)" + }, + { + "kind": "theorem", + "unqualified_name": "productBound_summable", + "line": 72, + "source_header": "p\n\ntheorem productBound_summable {a c : ℝ} (ha : 0 < a) (d : ℕ) :\n Summable (productBound d a c" + }, + { + "kind": "theorem", + "unqualified_name": "productDecay_eq_exp", + "line": 77, + "source_header": "d\n\ntheorem productDecay_eq_exp (d : ℕ) (a : ℝ) (k : Fin d → ℤ) :\n productDecay d a k = exp (-a * ∑ i, (k i : ℝ) ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "frequency_l1_le_product", + "line": 82, + "source_header": "]\n\ntheorem frequency_l1_le_product (d : ℕ) (v : Fin d → ℝ) (hv : ∀ i, 0 ≤ v i) :\n 1 + ∑ i, v i ≤ ∏ i, (1 + v i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceA_pos", + "line": 98, + "source_header": "v\n\ntheorem sourceA_pos {L : ℝ} (hL : L ≠ 0) : 0 < sourceA" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_eq_physical", + "line": 102, + "source_header": "y\n\ntheorem sourceWeight_eq_physical (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L k = exp (-(∑ i, (sourceC L * (k i : ℝ)) ^ 2) / 2" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_summable", + "line": 117, + "source_header": "g\n\ntheorem sourceWeight_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (sourceWeight d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceZ_pos", + "line": 124, + "source_header": "d\n\ntheorem sourceZ_pos (d : ℕ) {L : ℝ} (hL : L ≠ 0) : 0 < sourceZ d" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_eq_amplitude", + "line": 129, + "source_header": "]\n\ntheorem pairedBound_eq_amplitude (d : ℕ) {L : ℝ} (hL : L ≠ 0) (k : Fin d → ℤ) :\n pairedBound d L k = Real.sqrt (2 * sourceWeight d L k / sourceZ d L) *\n ∏ i, (1 + |sourceC L * (k i : ℝ)|) ^" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_summable", + "line": 151, + "source_header": "g\n\ntheorem pairedBound_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (pairedBound d L" + }, + { + "kind": "theorem", + "unqualified_name": "pairedBound_subtype_summable", + "line": 155, + "source_header": "_\n\ntheorem pairedBound_subtype_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (S : Set (Fin d → ℤ)) : Summable (fun k : S => pairedBound d L k" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceSmoothControls.lean", + "sha256": "8eca5ecdb5e2a0c1cb786468b340e4516df653468f958e535f156baafef088b4", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "old_four_does_not_fill_all_orders", + "line": 13, + "source_header": "s\n\n/-- The old a.e. order-four theorem cannot fill the all-orders goal. -/\ntheorem old_four_does_not_fill_all_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ n : ℕ, ContDiff ℝ n (sourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "represented_sample_order_five", + "line": 19, + "source_header": "hL\n\ntheorem represented_sample_order_five (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ 5 (smoothSourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "represented_sample_order_thirtyseven", + "line": 23, + "source_header": "ω 5\n\ntheorem represented_sample_order_thirtyseven (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) : ContDiff ℝ 37 (smoothSourceField d L" + }, + { + "kind": "theorem", + "unqualified_name": "one_carrier_for_both_orders", + "line": 27, + "source_header": "37\n\n/-- Both higher orders hold for every sample of the very same carrier. -/\ntheorem one_carrier_for_both_orders (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SmoothSample d L) :\n ContDiff ℝ 5 (smoothSourceField d L ω) ∧\n ContDiff ℝ 37 (smoothSourceField d" + }, + { + "kind": "theorem", + "unqualified_name": "literal_field_everywhere", + "line": 34, + "source_header": "hL ω⟩\n\ntheorem literal_field_everywhere (d : ℕ) (L : ℝ) (ω : SmoothSample d L)\n (x : Fin d → ℝ) :\n smoothSourceField d L ω x = sourceField d L (sampleInclusion d L" + }, + { + "kind": "theorem", + "unqualified_name": "entire_coefficient_law_preserved", + "line": 38, + "source_header": "= rfl\n\ntheorem entire_coefficient_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n (smoothLaw d L).map (sampleInclusion d L) = source" + }, + { + "kind": "theorem", + "unqualified_name": "arbitrary_observation_law_preserved", + "line": 42, + "source_header": "d hL\n\ntheorem arbitrary_observation_law_preserved (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n {E : Type*} [MeasurableSpace E] (X : (SourceMode d → ℝ) → E) (hX : Measurable X) :\n (smoothLaw d L).map (fun ω => X (sampleInclusion d L ω)) = (sourceLaw d)." + }, + { + "kind": "theorem", + "unqualified_name": "finite_block_changes_preserve_carrier", + "line": 47, + "source_header": "X hX\n\n/-- Arbitrarily large changes on a finite block leave the actual carrier intact. -/\ntheorem finite_block_changes_preserve_carrier (d : ℕ) (L : ℝ)\n (ω η : SourceMode d → ℝ) (s : Finset (SourceMode d))\n (hωη : ∀ m ∉ s, ω m = η m) :\n goodSample d L ω ↔ goodSampl" + }, + { + "kind": "theorem", + "unqualified_name": "field_variance_one", + "line": 54, + "source_header": "η s hωη\n\n/-- The restricted field keeps variance one, which excludes a zero-field substitution. -/\ntheorem field_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n cov[fun ω => smoothSourceField d L ω x,\n fun ω => smoothSourceField d L ω x; smoothLaw" + }, + { + "kind": "theorem", + "unqualified_name": "carrier_probability", + "line": 60, + "source_header": "ero d hL]\n\n/-- The underlying restricted measure has total mass one, without conditioning\non a finite pin event or normalizing by a weight. -/\ntheorem carrier_probability (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsProbabilityMeasure (smo" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceFourierSeries.lean", + "sha256": "5f145e8e8693bfe4d1554092c8258dbda4f17f8e078c503029e4e8ff2c018014", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "halfLattice", + "line": 14, + "source_header": "e\n\n/-- The representative whose first nonzero coordinate is positive. -/\ndef halfLattice (d : ℕ) : Set (Fin d →" + }, + { + "kind": "abbrev", + "unqualified_name": "SourceMode", + "line": 18, + "source_header": "0}\n\nabbrev SourceMode (d :" + }, + { + "kind": "abbrev", + "unqualified_name": "sourceLaw", + "line": 20, + "source_header": "ol)\n\n/-- The actual common law, with independent variance-one real coefficients. -/\nabbrev sourceLaw (d : ℕ) : Measure (SourceMode d" + }, + { + "kind": "def", + "unqualified_name": "phase", + "line": 24, + "source_header": "de d)\n\ndef phase (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ" + }, + { + "kind": "def", + "unqualified_name": "modeCoefficient", + "line": 27, + "source_header": "* x i\n\n/-- False is the cosine coefficient and true the independent sine coefficient. -/\ndef modeCoefficient (d : ℕ) (L : ℝ) (m : SourceMode d) (x : Fin d →" + }, + { + "kind": "def", + "unqualified_name": "modeMajorant", + "line": 34, + "source_header": "L k x)\n\ndef modeMajorant (d : ℕ) (L : ℝ) (m : SourceMode" + }, + { + "kind": "def", + "unqualified_name": "sourceField", + "line": 39, + "source_header": "d d L k\n\n/-- Literal normalized real Fourier sum on the common coefficient samples. -/\ndef sourceField (d : ℕ) (L : ℝ) (ω : SourceMode d → ℝ) (x : Fin d" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_nonneg", + "line": 43, + "source_header": "L m x) ω\n\ntheorem modeMajorant_nonneg (d : ℕ) (L : ℝ) (m : SourceMode d) :\n 0 ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "modeMajorant_summable", + "line": 52, + "source_header": "ositivity\n\ntheorem modeMajorant_summable (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n Summable (modeMajo" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_bound", + "line": 66, + "source_header": ".summable\n\ntheorem modeCoefficient_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (x : Fin d → ℝ) :\n |modeCoefficient d L m x| ≤ modeMajor" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_eval_measurable", + "line": 98, + "source_header": "rans hamp\n\ntheorem sourceField_eval_measurable (d : ℕ) (L : ℝ) (x : Fin d → ℝ) :\n Measurable (fun ω => sourceField" + }, + { + "kind": "theorem", + "unqualified_name": "sourceMajorant_ae", + "line": 102, + "source_header": "surable _\n\ntheorem sourceMajorant_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Summable (fun m => modeMajorant d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceAbs_uniform_ae", + "line": 106, + "source_header": "ble d hL)\n\ntheorem sourceAbs_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => |modeCoefficient d L m x * ω m|)\n (fun x => ∑' m, |modeCoefficient d L m" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_uniform_ae", + "line": 117, + "source_header": "nonneg _)\n\ntheorem sourceField_uniform_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d,\n HasSumUniformly (fun m x => modeCoefficient d L m x * ω m)\n (sourceFie" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_continuous_ae", + "line": 128, + "source_header": "nonneg _)\n\ntheorem sourceField_continuous_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, Continuous (sourceFie" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceSmoothAxiomAudit.lean", + "sha256": "4dfa901029fab71d127c9f4c8cf30c937607f4444e6af64f429890d9d141d591", + "declarations_lexical": [] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceCovariance.lean", + "sha256": "30560009582659a100637b5510c657cf1fa762f68a37bae8fab42c1eeee6aee5", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "scalarSeries_covariance", + "line": 12, + "source_header": "theorem scalarSeries_covariance (a b : ι → ℝ) (ha : Summable a) (hb : Summable b) :\n cov[scalarSeries a, scalarSeries b; coefficientLaw ι] = ∑' i, a i * b i" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_integral_zero", + "line": 51, + "source_header": "theorem sourceField_integral_zero (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n ∫ ω, sourceField d L ω x ∂sourceLaw d = 0" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_covariance", + "line": 58, + "source_header": "theorem sourceField_covariance (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x y : Fin d → ℝ) :\n cov[fun ω => sourceField d L ω x, fun ω => sourceField d L ω y; sourceLaw d] =\n sourceSpectralKernel d L (x - y)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_variance_one", + "line": 68, + "source_header": "theorem sourceField_variance_one (d : ℕ) {L : ℝ} (hL : L ≠ 0) (x : Fin d → ℝ) :\n Var[fun ω => sourceField d L ω x; sourceLaw d] = 1" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceGaussianLaw.lean", + "sha256": "a60ab6099d3cef0eeecaefa9e35d95ec14ec54ffd6c89e42dfcf6170907166e8", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "summable_square", + "line": 18, + "source_header": "}\n\nprivate theorem summable_square (a : ι → ℝ) (ha : Summable a) :\n Summable (fun i => a i ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "partial_charFun", + "line": 29, + "source_header": "n\nprivate theorem partial_charFun (a : ι → ℝ) (s : Finset ι) (t : ℝ) :\n charFun ((coefficientLaw ι).map (fun ω => ∑ i ∈ s, a i * ω i)) t =\n Complex.exp (-((∑ i ∈ s, a i ^ 2 : ℝ) : ℂ) * (t : ℂ) ^ 2 / 2" + }, + { + "kind": "theorem", + "unqualified_name": "charFun_partial_tendsto", + "line": 55, + "source_header": "]\n\nprivate theorem charFun_partial_tendsto (a : ι → ℝ) (ha : Summable a) (t : ℝ) :\n Filter.Tendsto\n (fun s : Finset ι => charFun ((coefficientLaw ι).map\n (fun ω => ∑ i ∈ s, a i * ω i)) t)\n Filter.atTop (𝓝 (charFun ((coefficientLaw ι).map (scalarSeries a)) t)" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_map_gaussian", + "line": 90, + "source_header": "ω\n\ntheorem scalarSeries_map_gaussian (a : ι → ℝ) (ha : Summable a) :\n (coefficientLaw ι).map (scalarSeries a) =\n gaussianReal 0 (∑' i, a i ^ 2).toNNRea" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_integral_zero", + "line": 109, + "source_header": "g\n\ntheorem scalarSeries_integral_zero (a : ι → ℝ) (ha : Summable a) :\n ∫ ω, scalarSeries a ω ∂coefficientLaw ι =" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_variance", + "line": 116, + "source_header": "h\n\ntheorem scalarSeries_variance (a : ι → ℝ) (ha : Summable a) :\n Var[scalarSeries a; coefficientLaw ι] = ∑' i, a i ^" + }, + { + "kind": "theorem", + "unqualified_name": "source_linearCombination_hasGaussianLaw", + "line": 122, + "source_header": ")\n\ntheorem source_linearCombination_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) (c : Fin n → ℝ) :\n HasGaussianLaw (fun ω => ∑ j, c j * sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "source_finiteVector_hasGaussianLaw", + "line": 147, + "source_header": ")\n\ntheorem source_finiteVector_hasGaussianLaw (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (n : ℕ) (x : Fin n → (Fin d → ℝ)) :\n HasGaussianLaw (fun ω j => sourceField d L ω (x j)) (sourceLaw d" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_isGaussianProcess", + "line": 174, + "source_header": "l\n\ntheorem sourceField_isGaussianProcess (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n IsGaussianProcess (fun x ω => sourceField d L ω x) (sourceLaw d" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/GaussianSeriesFoundation.lean", + "sha256": "feea566d5aeba58459bd4a1f20f070bdcd80ee30712817324cdd594e3e232c95", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "coefficientLaw", + "line": 15, + "source_header": "n\n\n/-- The same actual probability measure used for every coefficient and series assertion. -/\ndef coefficientLaw (ι : Type*) : Measure (ι →" + }, + { + "kind": "instance", + "unqualified_name": "coefficientLaw_isProbabilityMeasure", + "line": 19, + "source_header": "1)\n\ninstance coefficientLaw_isProbabilityMeasure (ι : Type*) :\n IsProbabilityMeasure (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_measurePreserving", + "line": 24, + "source_header": "nce\n\ntheorem coordinate_measurePreserving {ι : Type*} (i : ι) :\n MeasurePreserving (fun ω : ι → ℝ => ω i) (coefficientLaw ι)\n (gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_marginal", + "line": 29, + "source_header": ") i\n\ntheorem coordinate_marginal {ι : Type*} (i : ι) :\n (coefficientLaw ι).map (fun ω => ω i) = gaussianReal" + }, + { + "kind": "theorem", + "unqualified_name": "coordinates_independent", + "line": 33, + "source_header": "_eq\n\ntheorem coordinates_independent (ι : Type*) :\n iIndepFun (fun i (ω : ι → ℝ) => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_memLp", + "line": 38, + "source_header": "id)\n\ntheorem coordinate_memLp {ι : Type*} (i : ι) (p : ℝ≥0∞) (hp : p ≠ ∞) :\n MemLp (fun ω : ι → ℝ => ω i) p (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_integrable", + "line": 43, + "source_header": "i)\n\ntheorem coordinate_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => ω i) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "coordinate_abs_integrable", + "line": 47, + "source_header": "p))\n\ntheorem coordinate_abs_integrable {ι : Type*} (i : ι) :\n Integrable (fun ω : ι → ℝ => |ω i|) (coefficientLaw" + }, + { + "kind": "theorem", + "unqualified_name": "weighted_abs_summable_ae", + "line": 51, + "source_header": "orm\n\ntheorem weighted_abs_summable_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (ha : ∀ i, 0 ≤ a i) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, Summable (fun i => a i * |ω" + }, + { + "kind": "def", + "unqualified_name": "scalarSeries", + "line": 75, + "source_header": "hω\n\n/-- The actual scalar sum; its convergence is proved separately on the product law. -/\ndef scalarSeries {ι : Type*} (a : ι → ℝ) (ω : ι → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_measurable", + "line": 79, + "source_header": "* ω i\n\ntheorem scalarSeries_measurable {ι : Type*} [Countable ι] (a : ι → ℝ) :\n Measurable (scalarSeri" + }, + { + "kind": "theorem", + "unqualified_name": "scalarSeries_hasSum_ae", + "line": 86, + "source_header": "ly i)\n\ntheorem scalarSeries_hasSum_ae {ι : Type*} [Countable ι]\n (a : ι → ℝ) (hs : Summable a) :\n ∀ᵐ ω ∂coefficientLaw ι, HasSum (fun i => a i * ω i) (scalarSeries" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceTorusC4.lean", + "sha256": "b67b13030389dea4521e8e2afcac30ea44f84abd65c374bf208067b288fc64a1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "quotientChart", + "line": 12, + "source_header": "def quotientChart (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n OpenPartialHomeomorph (SourceTorus d L) (Fin d → ℝ)" + }, + { + "kind": "def", + "unqualified_name": "chartCenter", + "line": 16, + "source_header": "def chartCenter (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) : Fin d → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "quotientChart_symm", + "line": 19, + "source_header": "theorem quotientChart_symm (d : ℕ) (L : ℝ) [Fact (0 < L)] (a : Fin d → ℝ) :\n (quotientChart d L a).symm = torusProjection d L" + }, + { + "kind": "theorem", + "unqualified_name": "centered_chart_covers", + "line": 23, + "source_header": "theorem centered_chart_covers (d : ℕ) (L : ℝ) [Fact (0 < L)] (q : SourceTorus d L) :\n q ∈ (quotientChart d L (chartCenter d L q)).source" + }, + { + "kind": "theorem", + "unqualified_name": "chart_transition_contDiff", + "line": 51, + "source_header": "theorem chart_transition_contDiff (d : ℕ) (L : ℝ) [Fact (0 < L)] (a b : Fin d → ℝ) :\n ContDiffOn ℝ ∞ ((quotientChart d L a).symm.trans (quotientChart d L b))\n ((quotientChart d L a).symm.trans (quotientChart d L b)).source" + }, + { + "kind": "theorem", + "unqualified_name": "torus_isManifold", + "line": 98, + "source_header": "theorem torus_isManifold (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n IsManifold 𝓘(ℝ, Fin d → ℝ) ∞ (SourceTorus d L)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_contMDiff_ae", + "line": 110, + "source_header": "theorem torusSourceField_contMDiff_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d,\n ContMDiff 𝓘(ℝ, Fin d → ℝ) 𝓘(ℝ) 4 (torusSourceField d L sample)" + }, + { + "kind": "theorem", + "unqualified_name": "torusSourceField_weakSuperlevel_closed_ae", + "line": 126, + "source_header": "theorem torusSourceField_weakSuperlevel_closed_ae (d : ℕ) (L : ℝ) [Fact (0 < L)] :\n ∀ᵐ sample ∂sourceLaw d, ∀ h : ℝ,\n IsClosed {q : SourceTorus d L | h ≤ torusSourceField d L sample q}" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceC4.lean", + "sha256": "b15e53b825c2e2d6af2af18182da227d8794dddcc3e1b29611a913f89a889397", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "phaseCLM", + "line": 13, + "source_header": "4\n\ndef phaseCLM (d : ℕ) (L : ℝ) (k : Fin d → ℤ) : (Fin d → ℝ) →L[ℝ]" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_apply", + "line": 16, + "source_header": "i\n\ntheorem phaseCLM_apply (d : ℕ) (L : ℝ) (k : Fin d → ℤ) (x : Fin d → ℝ) :\n phaseCLM d L k x = phase d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phaseCLM_norm_le", + "line": 20, + "source_header": "]\n\ntheorem phaseCLM_norm_le (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n ‖phaseCLM d L k‖ ≤ ∑ i, |sourceC L * (k i : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_iteratedFDeriv_bound", + "line": 35, + "source_header": "]\n\ntheorem modeCoefficient_iteratedFDeriv_bound (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (j : ℕ) (hj : j ≤ 4) (x : Fin d → ℝ) :\n ‖iteratedFDeriv ℝ j (modeCoefficient d L m) x‖ ≤ modeMajorant d L" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_ae", + "line": 102, + "source_header": "]\n\ntheorem sourceField_contDiff_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ContDiff ℝ 4 (sourceField d L ω" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_contDiff_affine_ae", + "line": 133, + "source_header": ")\n\ntheorem sourceField_contDiff_affine_ae (d : ℕ) {L : ℝ} (hL : L ≠ 0) :\n ∀ᵐ ω ∂sourceLaw d, ∀ (T : (Fin d → ℝ) →L[ℝ] (Fin d → ℝ)) (a : Fin d → ℝ),\n ContDiff ℝ 4 (fun x => sourceField d L ω (a + T x)" + } + ] + }, + { + "path": "frontiers/source_smooth_realization_20261011/SourceLattice.lean", + "sha256": "c644305a426bc876f609c055ce999b8008f028c67a1091639d919f4122981b7b", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "latticeFrequency", + "line": 8, + "source_header": "def latticeFrequency (d : ℕ) (m : SourceMode d) : Fin d → ℤ" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_ne_zero", + "line": 13, + "source_header": "theorem halfLattice_ne_zero (d : ℕ) {k : Fin d → ℤ} (hk : k ∈ halfLattice d) :\n k ≠ 0" + }, + { + "kind": "theorem", + "unqualified_name": "halfLattice_partition", + "line": 20, + "source_header": "theorem halfLattice_partition (d : ℕ) {k : Fin d → ℤ} (hk : k ≠ 0) :\n (k ∈ halfLattice d ∨ -k ∈ halfLattice d) ∧\n ¬ (k ∈ halfLattice d ∧ -k ∈ halfLattice d)" + }, + { + "kind": "theorem", + "unqualified_name": "sourceWeight_neg", + "line": 59, + "source_header": "theorem sourceWeight_neg (d : ℕ) (L : ℝ) (k : Fin d → ℤ) :\n sourceWeight d L (-k) = sourceWeight d L k" + }, + { + "kind": "theorem", + "unqualified_name": "phase_lattice_shift", + "line": 64, + "source_header": "theorem phase_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k n : Fin d → ℤ) (x : Fin d → ℝ) :\n phase d L k (fun i => x i + L * (n i : ℝ)) =\n phase d L k x + ((∑ i, k i * n i : ℤ) : ℝ) * (2 * Real.pi)" + }, + { + "kind": "theorem", + "unqualified_name": "modeCoefficient_lattice_shift", + "line": 78, + "source_header": "theorem modeCoefficient_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (m : SourceMode d) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n modeCoefficient d L m (fun i => x i + L * (n i : ℝ)) =\n modeCoefficient d L m x" + }, + { + "kind": "theorem", + "unqualified_name": "sourceField_lattice_shift", + "line": 90, + "source_header": "theorem sourceField_lattice_shift (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (ω : SourceMode d → ℝ) (n : Fin d → ℤ) (x : Fin d → ℝ) :\n sourceField d L ω (fun i => x i + L * (n i : ℝ)) = sourceField d L ω x" + }, + { + "kind": "theorem", + "unqualified_name": "pairedCoefficient_kernel", + "line": 100, + "source_header": "theorem pairedCoefficient_kernel (d : ℕ) {L : ℝ} (hL : L ≠ 0)\n (k : ↥(halfLattice d)) (x y : Fin d → ℝ) :\n (∑ b : Bool, modeCoefficient d L (some (k,b)) x *\n modeCoefficient d L (some (k,b)) y) =\n (2 * sourceWeight d L k / sourceZ d L) * Real.cos (phase d L k (x - y))" + }, + { + "kind": "theorem", + "unqualified_name": "latticeFrequency_bijective", + "line": 120, + "source_header": "theorem latticeFrequency_bijective (d : ℕ) : Function.Bijective (latticeFrequency d)" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:reviews/w3_side24_source_proposal_20261008", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/D2SchurLinks.lean", + "sha256": "628260ba01ae2cedf2f89478faddb4426ebbfb054aa7d64d983da237c124f00e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Poisson.lean", + "sha256": "45377ccfd156d4342d9e5aee0f90843f46f015436e7f2aa80779c1ed1a02a87d" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Law.lean", + "sha256": "97dd915fdcdc78b8242f60bd93005ba854f1fc24c2db9da5df6bedfd20eef0a7" + } + ], + "source_record_sha256": "27c74ae08294c0da5db476ecf9cc855707c8a637e435b4b0ff29415c2b3947d2", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "reviews/w3_side24_source_proposal_20261008", + "source_files": [ + { + "path": "reviews/w3_side24_source_proposal_20261008/W3Scratch/D2SchurLinks.lean", + "sha256": "628260ba01ae2cedf2f89478faddb4426ebbfb054aa7d64d983da237c124f00e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "k2", + "line": 28, + "source_header": "1\n\n/-! ## Source objects, written literally -/\n\n/-- NOTE L23. -/\ndef k2 (m2 : ℝ" + }, + { + "kind": "def", + "unqualified_name": "k4", + "line": 33, + "source_header": ":= m2\n/-- NOTE L23. -/\ndef k4 (m2 m4 :" + }, + { + "kind": "def", + "unqualified_name": "k6", + "line": 35, + "source_header": "m2 ^ 2\n/-- NOTE L23. -/\ndef k6 (m2 m4 m6" + }, + { + "kind": "def", + "unqualified_name": "srcAlpha", + "line": 37, + "source_header": "* m2 ^ 3\n/-- NOTE L30, in cumulants. -/\ndef srcAlpha (m2 m4" + }, + { + "kind": "def", + "unqualified_name": "srcGamma", + "line": 39, + "source_header": "4 m2 m4 * q\n/-- NOTE L30, in cumulants. -/\ndef srcGamma (m2" + }, + { + "kind": "def", + "unqualified_name": "srcQ", + "line": 41, + "source_header": "k4 m2 m4 * q\n/-- NOTE L26. -/\ndef src" + }, + { + "kind": "def", + "unqualified_name": "srcE", + "line": 43, + "source_header": "= c ^ 2 * s ^ 2\n/-- NOTE L26. -/\ndef s" + }, + { + "kind": "def", + "unqualified_name": "srcDet", + "line": 45, + "source_header": "* (c ^ 2 - s ^ 2)\n/-- NOTE L34, first form, with e² = q(1 − 4q) (L28). -/\ndef srcDe" + }, + { + "kind": "def", + "unqualified_name": "srcSchur", + "line": 48, + "source_header": "* (q * (1 - 4 * q))\n/-- NOTE L35, with e² = q(1 − 4q). -/\ndef srcSc" + }, + { + "kind": "def", + "unqualified_name": "srcTau", + "line": 53, + "source_header": "q))) / srcDet m2 m4 q\n/-- NOTE L36, in cumulants (division is Lean's total division). -/\ndef srcT" + }, + { + "kind": "def", + "unqualified_name": "srcQTheta", + "line": 57, + "source_header": "/ k2 m2) * (1 - 3 * q)\n/-- NOTE L43: q(θ) = (1 − cos 4θ)/8. -/" + }, + { + "kind": "theorem", + "unqualified_name": "d2Alpha_eq_src", + "line": 59, + "source_header": "1 - Real.cos (4 * θ)) / 8\n\n/-! ## W3d (b): the missing link det V = αγ − k4² e² -/\n\ntheorem d2Alpha_eq_src (m2 m4 q : ℝ) : d2Alpha" + }, + { + "kind": "theorem", + "unqualified_name": "d2Gamma_eq_src", + "line": 64, + "source_header": "2Alpha srcAlpha k2 k4; ring\n\ntheorem d2Gamma_eq_src (m2 m4 q : ℝ) : d2Gamma" + }, + { + "kind": "theorem", + "unqualified_name": "srcE_sq", + "line": 67, + "source_header": "2Gamma srcGamma k2 k4; ring\n\ntheorem srcE_sq (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n srcE c s ^ 2 = sr" + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_alpha_gamma_q", + "line": 73, + "source_header": "rw [mul_pow, h, hu]; ring\n\ntheorem d2DetV_eq_alpha_gamma_q (m2 m4 q : ℝ) :\n d2DetV m2 m4 q = d2Alpha m2 m4 q * d2Gamma m2 m4 q - k4 m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_srcDet", + "line": 77, + "source_header": "tV d2Alpha d2Gamma k4; ring\n\ntheorem d2DetV_eq_srcDet (m2 m4 q : ℝ) : d2De" + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_alpha_gamma_e", + "line": 80, + "source_header": "pha_eq_src, d2Gamma_eq_src]\n\ntheorem d2DetV_eq_alpha_gamma_e (m2 m4 c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n d2DetV m2 m4 (srcQ c s) =\n srcAlpha m2 m4 (srcQ c s) * srcGamma m2 m4 (srcQ c s) -" + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_det_varV", + "line": 86, + "source_header": "ha_gamma_q m2 m4 (srcQ c s)\n\ntheorem d2DetV_eq_det_varV (m2 m4 c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n d2DetV m2 m4 (srcQ c s) =\n Matrix.det !![srcAlpha m2 m4 (srcQ c s), -(k4 m2 m4 * srcE c s);\n -(k4 m2 m4 * srcE c s)," + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_note_linear", + "line": 92, + "source_header": "gamma_e m2 m4 c s hu]; ring\n\ntheorem d2DetV_eq_note_linear (m2 m4 q : ℝ) :\n d2DetV m2 m4 q =\n k2 m2 ^ 2 * (3 * k2 m2 ^ 2 + k4 m2 m4) + k4 m2 m4 * (4" + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_alpha_gamma_e_needs_unit", + "line": 97, + "source_header": "unfold d2DetV k2 k4; ring\n\n/-- The unit-norm hypothesis cannot be dropped (c = s = 1, m2 = 1, m4 = 2). -/\ntheorem d2DetV_eq_alpha_gamma_e_needs_unit :\n d2DetV 1 2 (srcQ 1 1) ≠\n srcAlpha 1 2 (srcQ 1 1) * srcGamma 1 2 (srcQ 1 1" + }, + { + "kind": "theorem", + "unqualified_name": "srcQ_mem_Icc", + "line": 103, + "source_header": "mma srcQ srcE k2 k4; norm_num\n\n/-! ## W3e (a): sweep lemma — q = c²s² over the unit circle is exactly [0, 1/4] -/\n\ntheorem srcQ_mem_Icc (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) : src" + }, + { + "kind": "theorem", + "unqualified_name": "exists_unit_of_mem_Icc", + "line": 113, + "source_header": "ith [sq_nonneg (c ^ 2 - s ^ 2)]\n\ntheorem exists_unit_of_mem_Icc (q : ℝ) (hq : q ∈ Set.Icc (0 : ℝ) (1 / 4)) :\n ∃ c s : ℝ, c" + }, + { + "kind": "theorem", + "unqualified_name": "unit_q_range", + "line": 126, + "source_header": "rt (by linarith)]\n nlinarith\n\n/-- (a) Sweep lemma as a set equality. -/\ntheorem unit_q_range :\n {q : ℝ | ∃ c s : ℝ, c ^ 2 + s ^ 2 = 1 ∧ q = sr" + }, + { + "kind": "theorem", + "unqualified_name": "unit_q_image", + "line": 136, + "source_header": "q hq\n exact ⟨c, s, hu, h.symm⟩\n\n/-- (a) Same, as an image of the unit circle. -/\ntheorem unit_q_image :\n (fun p : ℝ × ℝ => srcQ p.1 p.2) '' {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 =" + }, + { + "kind": "theorem", + "unqualified_name": "srcQTheta_eq", + "line": 146, + "source_header": ", hu, rfl⟩; exact ⟨⟨c, s⟩, hu, rfl⟩\n\n/-- NOTE L43's angle parameterization agrees with q = c²s² at (c, s) = (cos θ, sin θ). -/\ntheorem srcQTheta_eq (θ : ℝ) : srcQThe" + }, + { + "kind": "theorem", + "unqualified_name": "srcQTheta_range", + "line": 156, + "source_header": "q θ; linarith\n rw [h4, h2, hs]; ring\n\n/-- (a) Angle form: the range of q(θ) = (1 − cos 4θ)/8 is exactly [0, 1/4]. -/\ntheorem srcQTheta_range : Set.ra" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_endpoint_isLeast", + "line": 170, + "source_header": "s (by linarith) (by linarith)]\n ring\n\n/-! ## W3d (c) + W3e (a): the endpoint minimum, over q and over unit directions -/\n\ntheorem d2_schur_endpoint_isLeast (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n IsLeast (d2Schur m2 m4 '' Set.Icc (0 : ℝ) (1 / 4))\n (d2Numerator m2 m4 / max (m2 ^ 2 * m4)" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_endpoint_sInf", + "line": 186, + "source_header": "ur_endpoint_lower m2 m4 q hm2 hm4 hq0 hq1\n\ntheorem d2_schur_endpoint_sInf (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n sInf (d2Schur m2 m4 '' Set.Icc (0 : ℝ) (1 / 4)) =\n d2Numerator m2 m4 / max (m2 ^ 2 * m4" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_min_over_unit_directions", + "line": 191, + "source_header": "_endpoint_isLeast m2 m4 hm2 hm4).csInf_eq\n\n/-- (a) The comment's L33 minimum, stated directly over unit directions u = (c, s). -/\ntheorem d2_schur_min_over_unit_directions (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n IsLeast {σ : ℝ | ∃ c s : ℝ, c ^ 2 + s ^ 2 = 1 ∧ σ = d2Schur m2 m4 (srcQ c s)}\n (d2Numerator m2 m4 / max (m2 ^ 2 * m" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_min_over_angles", + "line": 204, + "source_header": "act d2_schur_endpoint_isLeast m2 m4 hm2 hm4\n\n/-- (a) The same minimum over the NOTE's angle θ ∈ ℝ (q(θ) = (1 − cos 4θ)/8). -/\ntheorem d2_schur_min_over_angles (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n IsLeast (Set.range fun θ : ℝ => d2Schur m2 m4 (srcQTheta θ))\n (d2Numerator m2 m4 / max (m2 ^ 2 *" + }, + { + "kind": "theorem", + "unqualified_name": "moments_of_cumulants", + "line": 213, + "source_header": "exact d2_schur_endpoint_isLeast m2 m4 hm2 hm4\n\n/-! ## W3e (b)1: cumulants ↔ raw moments -/\n\n/-- Inverse map (symmetric law): m4 = k4 + 3k2², m6 = k6 + 15 k2 k4 + 15 k2³. -/\ntheorem moments_of_cumulants (m2 m4 m6 : ℝ) :\n m2 = k2 m2 ∧ m4 = k4 m2 m4 + 3 * k2 m2 ^ 2 ∧\n m6 = k6" + }, + { + "kind": "theorem", + "unqualified_name": "cumulants_of_moments", + "line": 221, + "source_header": "unfold k2 k4 k6; refine ⟨rfl, by ring, by ring⟩\n\n/-- Round trip from cumulants: any (K2, K4, K6) is hit by exactly the moments above. -/\ntheorem cumulants_of_moments (K2 K4 K6 : ℝ) :\n k2 K2 = K2 ∧ k4 K2 (K4 + 3 * K2 ^ 2) = K4 ∧\n k6 K2 (K4 +" + }, + { + "kind": "theorem", + "unqualified_name": "gaussian_cumulants_iff", + "line": 227, + "source_header": "y\n unfold k2 k4 k6; refine ⟨rfl, by ring, by ring⟩\n\n/-- NOTE L48 Gaussian reference: (k2, k4, k6) = (1, 0, 0) iff (m2, m4, m6) = (1, 3, 15). -/\ntheorem gaussian_cumulants_iff (m2 m4 m6 : ℝ) :\n (k2 m2 = 1 ∧ k4 m2 m4" + }, + { + "kind": "theorem", + "unqualified_name": "k4_sq_div", + "line": 239, + "source_header": "fl, by linarith⟩\n · rintro ⟨rfl, rfl, rfl⟩; norm_num\n\n/-- Helper: (m4 − 3m2²)²/m2 = m4²/m2 − 6 m4 m2 + 9 m2³ for ALL real m2 (both sides 0 at m2 = 0). -/\ntheorem k4_sq_div (m2 m4 : ℝ) :\n k4 m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2Tau_eq_srcTau", + "line": 247, + "source_header": "m2 0 with h | h\n · subst h; simp\n · field_simp; ring\n\n/-- The NOTE's τ² in cumulants equals the Lean `d2Tau` with NO hypothesis on m2\n(the existing `d2_tau_cumulant_eq` assumes m2 ≠ 0; it is not needed). -/\ntheorem d2Tau_eq_srcTa" + }, + { + "kind": "theorem", + "unqualified_name": "d2Schur_eq_srcSchur", + "line": 255, + "source_header": "u\n rw [k4_sq_div]\n unfold d2Tau d2Delta k2 k4 k6\n ring\n\n/-- The NOTE's Σ_{A|V} in cumulants equals the Lean `d2Schur`, all real q, no hypotheses. -/\ntheorem d2Schur_eq_" + }, + { + "kind": "theorem", + "unqualified_name": "d2Numerator_eq_comment", + "line": 261, + "source_header": "cDet, ← d2Alpha_eq_src, ← d2Gamma_eq_src]\n unfold k4; ring\n\n/-- Comment 6005199919 L15/L17 right-hand side: x(2x+b)(4x+b), x = m2², b = k4. -/\ntheorem d2Numerator_eq_comment (m2 m4 : ℝ) :\n d2Numerator m2 m4" + }, + { + "kind": "theorem", + "unqualified_name": "src_delta_cumulant", + "line": 266, + "source_header": "* (4 * m2 ^ 2 + k4 m2 m4) := by\n unfold d2Numerator k4; ring\n\n/-- Comment L29: Δ = m6 − m4²/m2 is literally `d2Delta`. NOTE's k6 − k4²/k2 in moments. -/\ntheorem src_delta_cumulant (m2 m4 m6 : ℝ) :\n k6 m2 m4 m6 - k4 m" + }, + { + "kind": "theorem", + "unqualified_name": "restrict_all_q", + "line": 271, + "source_header": "2 + 21 * m2 ^ 3 := by\n rw [k4_sq_div]; unfold k6 d2Delta; ring\n\n/-! ## W3e (b)3: all-q identities specialize to the source's restricted statements -/\n\n/-- Generic: an all-q statement restricts to [0, 1/4] and to every unit direction. -/\ntheorem restrict_all_q {P : ℝ → Prop} (h : ∀ q, P q) :\n (∀ q ∈ Set.Icc (0" + }, + { + "kind": "theorem", + "unqualified_name": "note_section2_every_direction", + "line": 278, + "source_header": "1 → P (srcQ c s)) :=\n ⟨fun q _ => h q, fun c s _ => h (srcQ c s)⟩\n\n/-- NOTE §2 L34–36 in every unit direction, obtained from the all-q identities by specialization. -/\ntheorem note_section2_every_direction (m2 m4 m6 c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n srcQ c s ∈ Set.Icc (0 : ℝ) (1 / 4) ∧\n d2DetV m2 m4 (srcQ c s) =\n srcAlpha m2 m4 (srcQ c s) * srcGamma m2 m4 (srcQ c s) - k4 m2 m4 ^ 2 * srcE c s ^ 2 ∧\n d2DetV m2 m4 (srcQ c s) = k2 m2 ^ 2 * (3 * k2 m2 ^ 2 + k4 m2 m4) +\n k4 m2 m4 * (4 * k2 m2 ^ 2 + k4 m2 m4) * srcQ c s ∧\n d2Schur m2 m4 (srcQ c s) = srcSchur m2 m4 (srcQ c s) ∧\n d2Tau m2 m4 m6 (srcQ c s) = srcTau m2 m4 m6 (srcQ c s) ∧\n d2Alpha m2 m4 (srcQ c s) * d2DetV m2 m4 (srcQ c s) - d2Gamma m2 m4 (srcQ c s) ^ 3 -\n (2 * d2Gamma m2 m4 (srcQ c s) + d2Alpha m2 m4 (srcQ c s)) *\n (m4" + }, + { + "kind": "theorem", + "unqualified_name": "gaussian_control_on_Icc", + "line": 293, + "source_header": "eq_srcSchur _ _ _, d2Tau_eq_srcTau _ _ _ _, d2_schur_numerator _ _ _⟩\n\n/-- NOTE L48 Gaussian controls hold on [0, 1/4] (specialization of `d2_gaussian_control`). -/\ntheorem gaussian_control_on_Icc :\n ∀ q ∈ Set.Icc (0 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "positivity_every_direction", + "line": 298, + "source_header": "8 / 3 ∧ d2Tau 1 3 15 q = 6 :=\n (restrict_all_q d2_gaussian_control).1\n\n/-! ## W3e (b)2: positivity in every direction, general form -/\n\n/-- NOTE L59/L78 \"positive in every direction\", as a general real-variable statement:\nany moments with 0 < m2, m2² < m4, 0 < Δ give τ², det V, Σ_{A|V} > 0 for every unit u. -/\ntheorem positivity_every_direction (m2 m4 m6 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hΔ : 0 < d2Delta m2 m4 m6) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV m2 m4 (src" + }, + { + "kind": "theorem", + "unqualified_name": "lagrange_weighted", + "line": 310, + "source_header": "d2_schur_pos _ _ _ hm2 hm4 h0 h1,\n d2_tau_pos _ _ _ _ hm2 hm4 hΔ h0 h1⟩\n\n/-- Weighted Lagrange identity (finite sums). -/\ntheorem lagrange_weighted {ι : Type*} [Fintype ι] (p f g : ι → ℝ) :\n 2 * ((∑ i, p i * f i ^ 2) * (∑ i, p i * g i ^ 2) - (∑ i, p i" + }, + { + "kind": "def", + "unqualified_name": "finMoment", + "line": 321, + "source_header": "strib, Finset.sum_add_distrib, ← Finset.mul_sum,\n ← Finset.sum_mul]\n ring\n\n/-- Raw moment of a finite w" + }, + { + "kind": "theorem", + "unqualified_name": "double_sum_pos", + "line": 324, + "source_header": "nMoment {ι : Type*} [Fintype ι] (p x : ι → ℝ) (n : ℕ) : ℝ := ∑ i, p i * x i ^ n\n\ntheorem double_sum_pos {ι : Type*} [Fintype ι] (F : ι → ι → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "finite_law_moment_hyps", + "line": 329, + "source_header": "et.mem_univ _, Finset.sum_pos' (fun j _ => hF a j) ⟨b, Finset.mem_univ _, hab⟩⟩\n\n/-- Moment hypotheses for any finite probability law with two nonzero atoms of distinct squares\n(a finite-support analogue of D2MomentBridge's two-atom lemmas; self-contained). -/\ntheorem finite_law_moment_hyps {ι : Type*} [Fintype ι] (p x : ι → ℝ) (hp : ∀ i, 0 ≤ p i)\n (hsum : ∑ i, p i = 1) (a b : ι) (hpa : 0 < p a) (hpb : 0 < p b) (ha0 : x a ≠ 0)\n (hb0 : x b ≠ 0) (hab : x a ^ 2 ≠ x b ^ 2) :\n 0 < finMoment p x 2 ∧ finMoment p x 2 ^ 2 < finMomen" + }, + { + "kind": "theorem", + "unqualified_name": "finite_law_positivity_every_direction", + "line": 379, + "source_header": "refine ⟨hm2, hm4, ?_⟩\n unfold d2Delta\n rw [sub_pos, div_lt_iff₀ hm2]\n linarith\n\n/-- (b)2 general statement for finite laws: positivity of τ², det V, Σ_{A|V} in every direction. -/\ntheorem finite_law_positivity_every_direction {ι : Type*} [Fintype ι] (p x : ι → ℝ)\n (hp : ∀ i, 0 ≤ p i) (hsum : ∑ i, p i = 1) (a b : ι) (hpa : 0 < p a) (hpb : 0 < p b)\n (ha0 : x a ≠ 0) (hb0 : x b ≠ 0) (hab : x a ^ 2 ≠ x b ^ 2) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV (finMoment p x 2) (finMoment p x 4) (srcQ c s) ∧\n 0 < d2Schur (finMoment p x 2) (finMoment p x 4) (srcQ c s)" + } + ] + }, + { + "path": "reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Poisson.lean", + "sha256": "45377ccfd156d4342d9e5aee0f90843f46f015436e7f2aa80779c1ed1a02a87d", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "theta_eq_cos_series", + "line": 27, + "source_header": "f\n\n/-! ## (a) General-t real θ cosine identity (Poisson summation) -/\n\n/-- θ_L(t) = (L²/(2π))^{-1/2} Σ_k w_k cos(2πkt/L) for every real t, L ≠ 0. -/\ntheorem theta_eq_cos_series {L : ℝ} (hL : L ≠ 0) (t : ℝ) :\n theta L t = 1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) *\n ∑' k : ℤ, weight L k * Real.cos (atom L k" + }, + { + "kind": "def", + "unqualified_name": "gauss", + "line": 88, + "source_header": "ring)\n\n/-! ## (b) Term-by-term differentiation of both series -/\n\n/-- Standard Gaussian e^{-x²/2}, in the form used by Mathlib's Hermite lemma. -/\ndef gaus" + }, + { + "kind": "theorem", + "unqualified_name": "contDiff_gauss", + "line": 93, + "source_header": "^ 2 / 2))\n\ntheorem contDiff_gauss : ContDiff" + }, + { + "kind": "theorem", + "unqualified_name": "hasDerivAt_iterate_deriv_gauss", + "line": 95, + "source_header": "fun_prop\n\ntheorem hasDerivAt_iterate_deriv_gauss (j : ℕ) (x : ℝ) :\n HasDerivAt (deriv^[j] gauss) (deriv^[j + 1] g" + }, + { + "kind": "theorem", + "unqualified_name": "poly_exp_bound", + "line": 100, + "source_header": "asDerivAt\n\n/-- Every real polynomial is bounded by B e^{|x|}. -/\ntheorem poly_exp_bound (p : Polynomial ℤ) :\n ∃ B : ℝ, 0 ≤ B ∧ ∀ x : ℝ, |Polynomial.aeval x p| ≤ B * R" + }, + { + "kind": "theorem", + "unqualified_name": "abs_sub_sq_le", + "line": 122, + "source_header": "orial : ℝ)]\n\ntheorem abs_sub_sq_le {L R t : ℝ} (ht : |t| ≤ R) (n : ℤ) :\n |t + L * n| - (t + L * n) ^ 2 / 2 ≤\n R + -π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 - 2 * ((R + 1) * |L| / (2 * π)) *" + }, + { + "kind": "theorem", + "unqualified_name": "iterate_deriv_gauss_bound", + "line": 135, + "source_header": "s_nonneg m]\n\n/-- Uniform majorant for g^{(j)}(t + Ln) on |t| ≤ R. -/\ntheorem iterate_deriv_gauss_bound (j : ℕ) : ∃ B : ℝ, 0 ≤ B ∧ ∀ (L R t : ℝ), |t| ≤ R → ∀ n : ℤ,\n ‖deriv^[j] gauss (t + L * n)‖ ≤ B * (Real.exp R *\n Real.exp (-π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 - 2 * ((R + 1) * |L| / (2 * π)) *" + }, + { + "kind": "theorem", + "unqualified_name": "summable_majorant", + "line": 154, + "source_header": "Real.exp_add]\n\ntheorem summable_majorant {L : ℝ} (hL : L ≠ 0) (B R : ℝ) :\n Summable fun n : ℤ => B * (Real.exp R *\n Real.exp (-π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 - 2 * ((R + 1) * |L| / (2 * π)) *" + }, + { + "kind": "def", + "unqualified_name": "thetaD", + "line": 162, + "source_header": "_).mul_left _\n\n/-- Termwise j-th derivative series of θ_L: Σ_n g^{(j)}(t + Ln). -/\ndef thetaD (L : ℝ) (j :" + }, + { + "kind": "theorem", + "unqualified_name": "summable_thetaD_terms", + "line": 165, + "source_header": "uss (t + L * n)\n\ntheorem summable_thetaD_terms {L : ℝ} (hL : L ≠ 0) (j : ℕ) (t : ℝ) :\n Summable fun n : ℤ => deriv^[j] ga" + }, + { + "kind": "theorem", + "unqualified_name": "hasDerivAt_thetaD", + "line": 170, + "source_header": "|t| t le_rfl n)\n\ntheorem hasDerivAt_thetaD {L : ℝ} (hL : L ≠ 0) (j : ℕ) (y : ℝ) :\n HasDerivAt (thetaD L j) (thetaD" + }, + { + "kind": "def", + "unqualified_name": "cosD", + "line": 189, + "source_header": "y\n linarith\n\n/-- Termwise j-th derivative series of the cosine side: Σ_k w_k ω_k^j cos(ω_k t + jπ/2). -/\ndef cosD (L : ℝ) (j" + }, + { + "kind": "theorem", + "unqualified_name": "summable_abs_weight_mul_atom_pow", + "line": 193, + "source_header": "t + j * (π / 2)))\n\ntheorem summable_abs_weight_mul_atom_pow {L : ℝ} (hL : L ≠ 0) (j : ℕ) :\n Summable fun k : ℤ => weight L k" + }, + { + "kind": "theorem", + "unqualified_name": "cosD_term_bound", + "line": 198, + "source_header": "os L k), abs_pow]\n\ntheorem cosD_term_bound (L : ℝ) (j : ℕ) (k : ℤ) (t : ℝ) :\n ‖weight L k * (atom L k ^ j * Real.cos (atom L k * t + j * (π / 2)))‖ ≤\n weight L k" + }, + { + "kind": "theorem", + "unqualified_name": "hasDerivAt_cosD", + "line": 205, + "source_header": "eight_pos L k).le\n\ntheorem hasDerivAt_cosD {L : ℝ} (hL : L ≠ 0) (j : ℕ) (y : ℝ) :\n HasDerivAt (cosD L j) (co" + }, + { + "kind": "theorem", + "unqualified_name": "thetaD_zero", + "line": 226, + "source_header": "i_div_two]\n ring\n\ntheorem thetaD_zero (L t : ℝ) : thetaD" + }, + { + "kind": "theorem", + "unqualified_name": "cosD_zero", + "line": 232, + "source_header": "]\n congr 1; ring\n\ntheorem cosD_zero (L t : ℝ) : cosD L 0 t = ∑' k : ℤ, weight L k * Real.c" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedDeriv_theta", + "line": 235, + "source_header": "unfold cosD; simp\n\n/-- Term-by-term differentiation, θ side: iteratedDeriv j θ_L = Σ_n g^{(j)}(· + Ln). -/\ntheorem iteratedDeriv_theta {L : ℝ} (hL : L ≠ 0) (j : ℕ) : iteratedDeriv j (th" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedDeriv_theta_termwise", + "line": 241, + "source_header": "hetaD hL j t).deriv\n\n/-- Same, stated as \"derivative of the sum = sum of the derivatives\". -/\ntheorem iteratedDeriv_theta_termwise {L : ℝ} (hL : L ≠ 0) (j : ℕ) (t : ℝ) :\n iteratedDeriv j (theta L) t =\n ∑' n : ℤ, iteratedDeriv j (fun s => Real.exp (-(s" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedDeriv_cos_series", + "line": 253, + "source_header": "atedDeriv_eq_iterate]\n\n/-- Term-by-term differentiation, cosine side. -/\ntheorem iteratedDeriv_cos_series {L : ℝ} (hL : L ≠ 0) (j : ℕ) :\n iteratedDeriv j (fun t => ∑' k : ℤ, weight L k * Real.cos (at" + }, + { + "kind": "theorem", + "unqualified_name": "thetaD_eq_cosD", + "line": 260, + "source_header": "ivAt_cosD hL j t).deriv\n\n/-- Poisson identity for every termwise derivative (all j, all t). -/\ntheorem thetaD_eq_cosD {L : ℝ} (hL : L ≠ 0) (j : ℕ) (t : ℝ) :\n thetaD L j t = 1 / (L ^ 2 / (2 * π)) ^" + }, + { + "kind": "theorem", + "unqualified_name": "imageSum_even_eq_thetaD", + "line": 271, + "source_header": "cosD hL j t).const_mul _)\n\n/-! ## (c) θ-route moments = dual-law moments -/\n\ntheorem imageSum_even_eq_thetaD (L : ℝ) (m : ℕ) : imageSum L (" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedDeriv_theta_zero_even", + "line": 279, + "source_header": "_pow,\n one_mul, neg_div]\n\n/-- N L53 as written, for even order: θ_L^{(2m)}(0) = Σ_n He_{2m}(Ln) e^{−(Ln)²/2}. -/\ntheorem iteratedDeriv_theta_zero_even {L : ℝ} (hL : L ≠ 0) (m : ℕ) :\n iteratedDeriv (2 * m) (th" + }, + { + "kind": "theorem", + "unqualified_name": "cosD_even_zero", + "line": 284, + "source_header": "hL, imageSum_even_eq_thetaD]\n\ntheorem cosD_even_zero (L : ℝ) (m : ℕ) :\n cosD L (2 * m) 0 = (-1) ^ m * rawSu" + }, + { + "kind": "theorem", + "unqualified_name": "imageSum_even_eq", + "line": 293, + "source_header": "eft]; congr 1; funext k; ring\n\ntheorem imageSum_even_eq {L : ℝ} (hL : L ≠ 0) (m : ℕ) :\n imageSum L (2 * m) = 1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) *\n ((-1) ^ m * rawSum" + }, + { + "kind": "theorem", + "unqualified_name": "imageMoment_even_eq_dualMoment", + "line": 298, + "source_header": "D_eq_cosD hL, cosD_even_zero]\n\n/-- The link: θ-route moment (N L53 / C L153) = dual-law moment (N L54 / C L156-177), every even\norder, every L ≠ 0. -/\ntheorem imageMoment_even_eq_dualMoment {L : ℝ} (hL : L ≠ 0) (m : ℕ) :\n imageMoment L" + }, + { + "kind": "theorem", + "unqualified_name": "imageMoment_eq_dualMoment", + "line": 316, + "source_header": "_mul, mul_div_mul_left _ _ hA0]\n\n/-- j = 2, 4, 6 (the W3f commented target, now with L ≠ 0 instead of 0 < L). -/\ntheorem imageMoment_eq_dualMoment {L : ℝ} (hL : L ≠ 0) (j : ℕ) (hj : j = 2 ∨ j = 4 ∨ j = 6) :" + }, + { + "kind": "theorem", + "unqualified_name": "image_moment_hyps", + "line": 324, + "source_header": "ageMoment_even_eq_dualMoment hL 3\n\n/-- Corollary: the θ-route moments satisfy 0 < m2, m2² < m4, Δ > 0 for every L ≠ 0. -/\ntheorem image_moment_hyps {L : ℝ} (hL : L ≠ 0) :\n 0 < imageMoment L 2 ∧ imageMoment L 2 ^ 2 < imageMoment L 4 ∧\n 0 < d2Delta (imageMoment L 2)" + }, + { + "kind": "theorem", + "unqualified_name": "image_positivity_every_direction", + "line": 332, + "source_header": "rfl))]\n exact dual_moment_hyps hL\n\n/-- Corollary: every-direction positivity for the θ-route moments, every L ≠ 0 (R3: c²+s²=1). -/\ntheorem image_positivity_every_direction {L : ℝ} (hL : L ≠ 0) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV (imageMoment L 2) (imageMoment L 4) (srcQ c s) ∧\n 0 < d2Schur (imageMoment L 2) (imageMoment L 4) (srcQ c s) ∧\n 0 < d2Tau (imageMoment L 2) (imageMom" + } + ] + }, + { + "path": "reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Law.lean", + "sha256": "97dd915fdcdc78b8242f60bd93005ba854f1fc24c2db9da5df6bedfd20eef0a7", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "rawSum", + "line": 38, + "source_header": "ℝ)\n\n/-- Unnormalized moment sum Σ w_i a_i^n. -/\ndef rawSum (n : ℕ" + }, + { + "kind": "def", + "unqualified_name": "lawMoment", + "line": 41, + "source_header": "i ^ n\n/-- Normalized raw moment m_n = Σ w a^n / Σ w. -/\ndef lawMoment (n :" + }, + { + "kind": "theorem", + "unqualified_name": "residual4_tsum", + "line": 45, + "source_header": "e {w a}\n\ntheorem residual4_tsum (hs : ∀ n : ℕ, Summable fun i => w i * a i ^ n) (m : ℝ) :\n Summable (fun i => w i * (a i ^ 2 - m) ^ 2) ∧\n ∑' i, w i * (a i ^ 2 - m) ^ 2 = rawSum w a 4 - 2 * m * rawSum w a 2 + m ^ 2 * rawSu" + }, + { + "kind": "theorem", + "unqualified_name": "residual6_tsum", + "line": 58, + "source_header": "]\n rfl\n\ntheorem residual6_tsum (hs : ∀ n : ℕ, Summable fun i => w i * a i ^ n) (c : ℝ) :\n Summable (fun i => w i * (a i ^ 3 - c * a i) ^ 2) ∧\n ∑' i, w i * (a i ^ 3 - c * a i) ^ 2 =\n rawSum w a 6 - 2 * c * rawSum w a 4 + c ^ 2 * rawSu" + }, + { + "kind": "theorem", + "unqualified_name": "sq_pos_of_ne", + "line": 72, + "source_header": "]\n rfl\n\ntheorem sq_pos_of_ne {x : ℝ} (hx : x ≠ 0) : 0" + }, + { + "kind": "theorem", + "unqualified_name": "countable_law_moment_hyps", + "line": 75, + "source_header": "2 hx))\n\n/-- Countable-support analogue of `finite_law_moment_hyps`: two nonzero atoms with distinct squares\ngive 0 < m2, m2² < m4 and Δ > 0. -/\ntheorem countable_law_moment_hyps (hw : ∀ i, 0 ≤ w i)\n (hs : ∀ n : ℕ, Summable fun i => w i * a i ^ n) (i j : ι) (hwi : 0 < w i) (hwj : 0 < w j)\n (hai : a i ≠ 0) (haj : a j ≠ 0) (hij : a i ^ 2 ≠ a j ^ 2) :\n 0 < lawMoment w a 2 ∧ lawMoment w a 2 ^ 2 < lawMoment w a 4 ∧\n 0 < d2Delta (lawMoment w a 2) (lawMoment w a 4) (lawMome" + }, + { + "kind": "def", + "unqualified_name": "atom", + "line": 134, + "source_header": "d Generic\n\n/-! ## The SIDE24 Poisson-dual law (N L54; C L156-177) -/\n\n/-- Atom 2πk/L (N L54). -/\ndef atom (L : ℝ" + }, + { + "kind": "def", + "unqualified_name": "weight", + "line": 139, + "source_header": "2 * π * k / L\n/-- Unnormalized weight e^{−(2πk/L)²/2} (N L54). -/\ndef weight (L :" + }, + { + "kind": "def", + "unqualified_name": "dualZ", + "line": 141, + "source_header": "m L k) ^ 2 / 2)\n/-- Normalizer Σ_k e^{−(2πk/L)²/2}. -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "dualMoment", + "line": 143, + "source_header": "ght L) (atom L) 0\n/-- Raw moment m_n(L) of the dual law (C L176-177: w[j]/w[0]). -/\ndef dualMoment" + }, + { + "kind": "theorem", + "unqualified_name": "weight_pos", + "line": 145, + "source_header": "eight L) (atom L) n\n\ntheorem weight_pos (L : ℝ) (k :" + }, + { + "kind": "theorem", + "unqualified_name": "summable_weight_mul_atom_pow", + "line": 147, + "source_header": "k := Real.exp_pos _\n\n/-- Summability of Σ_k w_k · atom_k^n for every n (in particular n = 6: X⁶ integrability). -/\ntheorem summable_weight_mul_atom_pow {L : ℝ} (hL : L ≠ 0) (n : ℕ) :\n Summable fun k : ℤ => weig" + }, + { + "kind": "theorem", + "unqualified_name": "summable_sixth", + "line": 164, + "source_header": "[Int.cast_abs]\n ring\n\n/-- X⁶ integrability of the dual law, stated as summability. -/\ntheorem summable_sixth {L : ℝ} (hL : L ≠ 0) : Summable fun k : ℤ => we" + }, + { + "kind": "theorem", + "unqualified_name": "dualZ_pos", + "line": 168, + "source_header": "eight_mul_atom_pow hL 6\n\ntheorem dualZ_pos {L : ℝ} (hL" + }, + { + "kind": "theorem", + "unqualified_name": "dual_normalized", + "line": 173, + "source_header": "; exact weight_pos L 0)\n\n/-- Normalization: the probabilities w_k / Z sum to 1. -/\ntheorem dual_normalized {L : ℝ} (hL : L ≠ 0) : ∑' k : ℤ," + }, + { + "kind": "theorem", + "unqualified_name": "dual_odd_moment_zero", + "line": 181, + "source_header": "s, div_self (ne_of_gt h)]\n\n/-- Symmetry: odd raw moments vanish (atom(−k) = −atom(k), weight even). -/\ntheorem dual_odd_moment_zero (L : ℝ) (m : ℕ) : rawSum (weight" + }, + { + "kind": "theorem", + "unqualified_name": "dual_moment_hyps", + "line": 193, + "source_header": ", tsum_neg] at h\n linarith\n\n/-- Moment hypotheses for the SIDE24 dual law at EVERY nonzero period L (atoms k = 1, 2). -/\ntheorem dual_moment_hyps {L : ℝ} (hL : L ≠ 0) :\n 0 < dualMoment L 2 ∧ dualMoment L 2 ^ 2 < dualMoment L 4 ∧\n 0 < d2Delta (dualMoment L 2) (dua" + }, + { + "kind": "theorem", + "unqualified_name": "dual_positivity_every_direction", + "line": 212, + "source_header": "1) (weight_pos L 2) h1 h2 h12\n\n/-- Every-direction positivity for the exact dual-law moments, at every nonzero L. This is a new\nall-L ≠ 0 statement. N certifies \"positive in every direction\" (N L59, L78) only numerically, by\ninterval enclosures, at the six values L ∈ {24, 8, 2π, 4, 3, 2} (N L17, L65-73); this theorem is\nnot that certificate, and identifying the two needs analytic question (a) of the README. -/\ntheorem dual_positivity_every_direction {L : ℝ} (hL : L ≠ 0) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV (dualMoment L 2) (dualMoment L 4) (srcQ c s) ∧\n 0 < d2Schur (dualMoment L 2) (dualMoment L 4) (srcQ c s) ∧\n 0 < d2Tau (dualMoment L 2) (dualMoment L" + }, + { + "kind": "def", + "unqualified_name": "theta", + "line": 223, + "source_header": "direction _ _ _ h2 h4 h6 c s hu\n\n/-! ## The θ-series route (N L21, L53; C L137-153) -/\n\n/-- θ_L(t) = Σ_n e^{−(t+Ln)²/2}" + }, + { + "kind": "def", + "unqualified_name": "imageSum", + "line": 228, + "source_header": "ℤ, Real.exp (-(t + L * n) ^ 2 / 2)\n/-- Image sum Σ_n He_j(Ln) e^{−(Ln)²/2} (N L53), probabilists' Hermite `Polynomial.hermite`" + }, + { + "kind": "def", + "unqualified_name": "imageMoment", + "line": 231, + "source_header": "mite j) * Real.exp (-(L * n) ^ 2 / 2)\n/-- θ-route moment m_j = (−1)^(j/2) θ^{(j)}(0)/θ(0), via image sums (C L153)." + }, + { + "kind": "theorem", + "unqualified_name": "imageSum_zero", + "line": 233, + "source_header": "^ (j / 2) * imageSum L j / imageSum L 0\n\ntheorem imageSum_" + }, + { + "kind": "theorem", + "unqualified_name": "theta_zero_eq_dual", + "line": 237, + "source_header": "theta\n simp [Polynomial.hermite_zero]\n\n/-- Poisson link, j = 0 (closed): θ_L(0) = (L²/(2π))^{−1/2} · Σ_k e^{−(2πk/L)²/2}, from\nMathlib's `Real.tsum_exp_neg_mul_int_sq`. -/\ntheorem theta_zero_eq_dual {L : ℝ} (hL : L ≠ 0) :\n theta L 0 = 1 /" + }, + { + "kind": "theorem", + "unqualified_name": "theta_term_iteratedDeriv", + "line": 251, + "source_header": "_simp\n simp only [e1, e2] at h\n exact h\n\n/-- Step (iii) of the Poisson link, closed: the j-th t-derivative at 0 of one θ-term is\n(−1)^j He_j(y) e^{−y²/2} (Mathlib `deriv_gaussian_eq_hermite_mul_gaussian`). -/\ntheorem theta_term_iteratedDeriv (y : ℝ) (j : ℕ) :\n iteratedDeriv j (fun t => Real.exp (-(t + y) ^ 2 / 2)) 0 =\n (-1 : ℝ) ^ j * Polynomial.aeval y (Po" + }, + { + "kind": "theorem", + "unqualified_name": "imageSum_even_eq_tsum_termwise", + "line": 263, + "source_header": "an_eq_hermite_mul_gaussian]\n congr 2; ring\n\n/-- N L53 holds termwise: the image sum of even order is the sum of the termwise 2m-th\nderivatives of θ_L at 0. (The exchange of Σ and d/dt, for L ≠ 0, is in `Side24Poisson`:\n`iteratedDeriv_theta`, `iteratedDeriv_theta_zero_even`.) -/\ntheorem imageSum_even_eq_tsum_termwise (L : ℝ) (m : ℕ) :\n imageSum L (2 * m) =\n ∑' n : ℤ, iteratedDeriv (2 * m)" + } + ] + } + ] + }, + "reason": "Research scratch source; not an admitted project theorem closure.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:reviews/w3_side24_source_proposal_20261008", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "reviews/w3_side24_source_proposal_20261008", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Research scratch source; not an admitted project theorem closure.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "reviews/w3_side24_source_proposal_20261008/W3Scratch/D2SchurLinks.lean", + "sha256": "628260ba01ae2cedf2f89478faddb4426ebbfb054aa7d64d983da237c124f00e", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "k2", + "line": 28, + "source_header": "1\n\n/-! ## Source objects, written literally -/\n\n/-- NOTE L23. -/\ndef k2 (m2 : ℝ" + }, + { + "kind": "def", + "unqualified_name": "k4", + "line": 33, + "source_header": ":= m2\n/-- NOTE L23. -/\ndef k4 (m2 m4 :" + }, + { + "kind": "def", + "unqualified_name": "k6", + "line": 35, + "source_header": "m2 ^ 2\n/-- NOTE L23. -/\ndef k6 (m2 m4 m6" + }, + { + "kind": "def", + "unqualified_name": "srcAlpha", + "line": 37, + "source_header": "* m2 ^ 3\n/-- NOTE L30, in cumulants. -/\ndef srcAlpha (m2 m4" + }, + { + "kind": "def", + "unqualified_name": "srcGamma", + "line": 39, + "source_header": "4 m2 m4 * q\n/-- NOTE L30, in cumulants. -/\ndef srcGamma (m2" + }, + { + "kind": "def", + "unqualified_name": "srcQ", + "line": 41, + "source_header": "k4 m2 m4 * q\n/-- NOTE L26. -/\ndef src" + }, + { + "kind": "def", + "unqualified_name": "srcE", + "line": 43, + "source_header": "= c ^ 2 * s ^ 2\n/-- NOTE L26. -/\ndef s" + }, + { + "kind": "def", + "unqualified_name": "srcDet", + "line": 45, + "source_header": "* (c ^ 2 - s ^ 2)\n/-- NOTE L34, first form, with e² = q(1 − 4q) (L28). -/\ndef srcDe" + }, + { + "kind": "def", + "unqualified_name": "srcSchur", + "line": 48, + "source_header": "* (q * (1 - 4 * q))\n/-- NOTE L35, with e² = q(1 − 4q). -/\ndef srcSc" + }, + { + "kind": "def", + "unqualified_name": "srcTau", + "line": 53, + "source_header": "q))) / srcDet m2 m4 q\n/-- NOTE L36, in cumulants (division is Lean's total division). -/\ndef srcT" + }, + { + "kind": "def", + "unqualified_name": "srcQTheta", + "line": 57, + "source_header": "/ k2 m2) * (1 - 3 * q)\n/-- NOTE L43: q(θ) = (1 − cos 4θ)/8. -/" + }, + { + "kind": "theorem", + "unqualified_name": "d2Alpha_eq_src", + "line": 59, + "source_header": "1 - Real.cos (4 * θ)) / 8\n\n/-! ## W3d (b): the missing link det V = αγ − k4² e² -/\n\ntheorem d2Alpha_eq_src (m2 m4 q : ℝ) : d2Alpha" + }, + { + "kind": "theorem", + "unqualified_name": "d2Gamma_eq_src", + "line": 64, + "source_header": "2Alpha srcAlpha k2 k4; ring\n\ntheorem d2Gamma_eq_src (m2 m4 q : ℝ) : d2Gamma" + }, + { + "kind": "theorem", + "unqualified_name": "srcE_sq", + "line": 67, + "source_header": "2Gamma srcGamma k2 k4; ring\n\ntheorem srcE_sq (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n srcE c s ^ 2 = sr" + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_alpha_gamma_q", + "line": 73, + "source_header": "rw [mul_pow, h, hu]; ring\n\ntheorem d2DetV_eq_alpha_gamma_q (m2 m4 q : ℝ) :\n d2DetV m2 m4 q = d2Alpha m2 m4 q * d2Gamma m2 m4 q - k4 m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_srcDet", + "line": 77, + "source_header": "tV d2Alpha d2Gamma k4; ring\n\ntheorem d2DetV_eq_srcDet (m2 m4 q : ℝ) : d2De" + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_alpha_gamma_e", + "line": 80, + "source_header": "pha_eq_src, d2Gamma_eq_src]\n\ntheorem d2DetV_eq_alpha_gamma_e (m2 m4 c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n d2DetV m2 m4 (srcQ c s) =\n srcAlpha m2 m4 (srcQ c s) * srcGamma m2 m4 (srcQ c s) -" + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_det_varV", + "line": 86, + "source_header": "ha_gamma_q m2 m4 (srcQ c s)\n\ntheorem d2DetV_eq_det_varV (m2 m4 c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n d2DetV m2 m4 (srcQ c s) =\n Matrix.det !![srcAlpha m2 m4 (srcQ c s), -(k4 m2 m4 * srcE c s);\n -(k4 m2 m4 * srcE c s)," + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_note_linear", + "line": 92, + "source_header": "gamma_e m2 m4 c s hu]; ring\n\ntheorem d2DetV_eq_note_linear (m2 m4 q : ℝ) :\n d2DetV m2 m4 q =\n k2 m2 ^ 2 * (3 * k2 m2 ^ 2 + k4 m2 m4) + k4 m2 m4 * (4" + }, + { + "kind": "theorem", + "unqualified_name": "d2DetV_eq_alpha_gamma_e_needs_unit", + "line": 97, + "source_header": "unfold d2DetV k2 k4; ring\n\n/-- The unit-norm hypothesis cannot be dropped (c = s = 1, m2 = 1, m4 = 2). -/\ntheorem d2DetV_eq_alpha_gamma_e_needs_unit :\n d2DetV 1 2 (srcQ 1 1) ≠\n srcAlpha 1 2 (srcQ 1 1) * srcGamma 1 2 (srcQ 1 1" + }, + { + "kind": "theorem", + "unqualified_name": "srcQ_mem_Icc", + "line": 103, + "source_header": "mma srcQ srcE k2 k4; norm_num\n\n/-! ## W3e (a): sweep lemma — q = c²s² over the unit circle is exactly [0, 1/4] -/\n\ntheorem srcQ_mem_Icc (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) : src" + }, + { + "kind": "theorem", + "unqualified_name": "exists_unit_of_mem_Icc", + "line": 113, + "source_header": "ith [sq_nonneg (c ^ 2 - s ^ 2)]\n\ntheorem exists_unit_of_mem_Icc (q : ℝ) (hq : q ∈ Set.Icc (0 : ℝ) (1 / 4)) :\n ∃ c s : ℝ, c" + }, + { + "kind": "theorem", + "unqualified_name": "unit_q_range", + "line": 126, + "source_header": "rt (by linarith)]\n nlinarith\n\n/-- (a) Sweep lemma as a set equality. -/\ntheorem unit_q_range :\n {q : ℝ | ∃ c s : ℝ, c ^ 2 + s ^ 2 = 1 ∧ q = sr" + }, + { + "kind": "theorem", + "unqualified_name": "unit_q_image", + "line": 136, + "source_header": "q hq\n exact ⟨c, s, hu, h.symm⟩\n\n/-- (a) Same, as an image of the unit circle. -/\ntheorem unit_q_image :\n (fun p : ℝ × ℝ => srcQ p.1 p.2) '' {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 =" + }, + { + "kind": "theorem", + "unqualified_name": "srcQTheta_eq", + "line": 146, + "source_header": ", hu, rfl⟩; exact ⟨⟨c, s⟩, hu, rfl⟩\n\n/-- NOTE L43's angle parameterization agrees with q = c²s² at (c, s) = (cos θ, sin θ). -/\ntheorem srcQTheta_eq (θ : ℝ) : srcQThe" + }, + { + "kind": "theorem", + "unqualified_name": "srcQTheta_range", + "line": 156, + "source_header": "q θ; linarith\n rw [h4, h2, hs]; ring\n\n/-- (a) Angle form: the range of q(θ) = (1 − cos 4θ)/8 is exactly [0, 1/4]. -/\ntheorem srcQTheta_range : Set.ra" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_endpoint_isLeast", + "line": 170, + "source_header": "s (by linarith) (by linarith)]\n ring\n\n/-! ## W3d (c) + W3e (a): the endpoint minimum, over q and over unit directions -/\n\ntheorem d2_schur_endpoint_isLeast (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n IsLeast (d2Schur m2 m4 '' Set.Icc (0 : ℝ) (1 / 4))\n (d2Numerator m2 m4 / max (m2 ^ 2 * m4)" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_endpoint_sInf", + "line": 186, + "source_header": "ur_endpoint_lower m2 m4 q hm2 hm4 hq0 hq1\n\ntheorem d2_schur_endpoint_sInf (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n sInf (d2Schur m2 m4 '' Set.Icc (0 : ℝ) (1 / 4)) =\n d2Numerator m2 m4 / max (m2 ^ 2 * m4" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_min_over_unit_directions", + "line": 191, + "source_header": "_endpoint_isLeast m2 m4 hm2 hm4).csInf_eq\n\n/-- (a) The comment's L33 minimum, stated directly over unit directions u = (c, s). -/\ntheorem d2_schur_min_over_unit_directions (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n IsLeast {σ : ℝ | ∃ c s : ℝ, c ^ 2 + s ^ 2 = 1 ∧ σ = d2Schur m2 m4 (srcQ c s)}\n (d2Numerator m2 m4 / max (m2 ^ 2 * m" + }, + { + "kind": "theorem", + "unqualified_name": "d2_schur_min_over_angles", + "line": 204, + "source_header": "act d2_schur_endpoint_isLeast m2 m4 hm2 hm4\n\n/-- (a) The same minimum over the NOTE's angle θ ∈ ℝ (q(θ) = (1 − cos 4θ)/8). -/\ntheorem d2_schur_min_over_angles (m2 m4 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4) :\n IsLeast (Set.range fun θ : ℝ => d2Schur m2 m4 (srcQTheta θ))\n (d2Numerator m2 m4 / max (m2 ^ 2 *" + }, + { + "kind": "theorem", + "unqualified_name": "moments_of_cumulants", + "line": 213, + "source_header": "exact d2_schur_endpoint_isLeast m2 m4 hm2 hm4\n\n/-! ## W3e (b)1: cumulants ↔ raw moments -/\n\n/-- Inverse map (symmetric law): m4 = k4 + 3k2², m6 = k6 + 15 k2 k4 + 15 k2³. -/\ntheorem moments_of_cumulants (m2 m4 m6 : ℝ) :\n m2 = k2 m2 ∧ m4 = k4 m2 m4 + 3 * k2 m2 ^ 2 ∧\n m6 = k6" + }, + { + "kind": "theorem", + "unqualified_name": "cumulants_of_moments", + "line": 221, + "source_header": "unfold k2 k4 k6; refine ⟨rfl, by ring, by ring⟩\n\n/-- Round trip from cumulants: any (K2, K4, K6) is hit by exactly the moments above. -/\ntheorem cumulants_of_moments (K2 K4 K6 : ℝ) :\n k2 K2 = K2 ∧ k4 K2 (K4 + 3 * K2 ^ 2) = K4 ∧\n k6 K2 (K4 +" + }, + { + "kind": "theorem", + "unqualified_name": "gaussian_cumulants_iff", + "line": 227, + "source_header": "y\n unfold k2 k4 k6; refine ⟨rfl, by ring, by ring⟩\n\n/-- NOTE L48 Gaussian reference: (k2, k4, k6) = (1, 0, 0) iff (m2, m4, m6) = (1, 3, 15). -/\ntheorem gaussian_cumulants_iff (m2 m4 m6 : ℝ) :\n (k2 m2 = 1 ∧ k4 m2 m4" + }, + { + "kind": "theorem", + "unqualified_name": "k4_sq_div", + "line": 239, + "source_header": "fl, by linarith⟩\n · rintro ⟨rfl, rfl, rfl⟩; norm_num\n\n/-- Helper: (m4 − 3m2²)²/m2 = m4²/m2 − 6 m4 m2 + 9 m2³ for ALL real m2 (both sides 0 at m2 = 0). -/\ntheorem k4_sq_div (m2 m4 : ℝ) :\n k4 m2" + }, + { + "kind": "theorem", + "unqualified_name": "d2Tau_eq_srcTau", + "line": 247, + "source_header": "m2 0 with h | h\n · subst h; simp\n · field_simp; ring\n\n/-- The NOTE's τ² in cumulants equals the Lean `d2Tau` with NO hypothesis on m2\n(the existing `d2_tau_cumulant_eq` assumes m2 ≠ 0; it is not needed). -/\ntheorem d2Tau_eq_srcTa" + }, + { + "kind": "theorem", + "unqualified_name": "d2Schur_eq_srcSchur", + "line": 255, + "source_header": "u\n rw [k4_sq_div]\n unfold d2Tau d2Delta k2 k4 k6\n ring\n\n/-- The NOTE's Σ_{A|V} in cumulants equals the Lean `d2Schur`, all real q, no hypotheses. -/\ntheorem d2Schur_eq_" + }, + { + "kind": "theorem", + "unqualified_name": "d2Numerator_eq_comment", + "line": 261, + "source_header": "cDet, ← d2Alpha_eq_src, ← d2Gamma_eq_src]\n unfold k4; ring\n\n/-- Comment 6005199919 L15/L17 right-hand side: x(2x+b)(4x+b), x = m2², b = k4. -/\ntheorem d2Numerator_eq_comment (m2 m4 : ℝ) :\n d2Numerator m2 m4" + }, + { + "kind": "theorem", + "unqualified_name": "src_delta_cumulant", + "line": 266, + "source_header": "* (4 * m2 ^ 2 + k4 m2 m4) := by\n unfold d2Numerator k4; ring\n\n/-- Comment L29: Δ = m6 − m4²/m2 is literally `d2Delta`. NOTE's k6 − k4²/k2 in moments. -/\ntheorem src_delta_cumulant (m2 m4 m6 : ℝ) :\n k6 m2 m4 m6 - k4 m" + }, + { + "kind": "theorem", + "unqualified_name": "restrict_all_q", + "line": 271, + "source_header": "2 + 21 * m2 ^ 3 := by\n rw [k4_sq_div]; unfold k6 d2Delta; ring\n\n/-! ## W3e (b)3: all-q identities specialize to the source's restricted statements -/\n\n/-- Generic: an all-q statement restricts to [0, 1/4] and to every unit direction. -/\ntheorem restrict_all_q {P : ℝ → Prop} (h : ∀ q, P q) :\n (∀ q ∈ Set.Icc (0" + }, + { + "kind": "theorem", + "unqualified_name": "note_section2_every_direction", + "line": 278, + "source_header": "1 → P (srcQ c s)) :=\n ⟨fun q _ => h q, fun c s _ => h (srcQ c s)⟩\n\n/-- NOTE §2 L34–36 in every unit direction, obtained from the all-q identities by specialization. -/\ntheorem note_section2_every_direction (m2 m4 m6 c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n srcQ c s ∈ Set.Icc (0 : ℝ) (1 / 4) ∧\n d2DetV m2 m4 (srcQ c s) =\n srcAlpha m2 m4 (srcQ c s) * srcGamma m2 m4 (srcQ c s) - k4 m2 m4 ^ 2 * srcE c s ^ 2 ∧\n d2DetV m2 m4 (srcQ c s) = k2 m2 ^ 2 * (3 * k2 m2 ^ 2 + k4 m2 m4) +\n k4 m2 m4 * (4 * k2 m2 ^ 2 + k4 m2 m4) * srcQ c s ∧\n d2Schur m2 m4 (srcQ c s) = srcSchur m2 m4 (srcQ c s) ∧\n d2Tau m2 m4 m6 (srcQ c s) = srcTau m2 m4 m6 (srcQ c s) ∧\n d2Alpha m2 m4 (srcQ c s) * d2DetV m2 m4 (srcQ c s) - d2Gamma m2 m4 (srcQ c s) ^ 3 -\n (2 * d2Gamma m2 m4 (srcQ c s) + d2Alpha m2 m4 (srcQ c s)) *\n (m4" + }, + { + "kind": "theorem", + "unqualified_name": "gaussian_control_on_Icc", + "line": 293, + "source_header": "eq_srcSchur _ _ _, d2Tau_eq_srcTau _ _ _ _, d2_schur_numerator _ _ _⟩\n\n/-- NOTE L48 Gaussian controls hold on [0, 1/4] (specialization of `d2_gaussian_control`). -/\ntheorem gaussian_control_on_Icc :\n ∀ q ∈ Set.Icc (0 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "positivity_every_direction", + "line": 298, + "source_header": "8 / 3 ∧ d2Tau 1 3 15 q = 6 :=\n (restrict_all_q d2_gaussian_control).1\n\n/-! ## W3e (b)2: positivity in every direction, general form -/\n\n/-- NOTE L59/L78 \"positive in every direction\", as a general real-variable statement:\nany moments with 0 < m2, m2² < m4, 0 < Δ give τ², det V, Σ_{A|V} > 0 for every unit u. -/\ntheorem positivity_every_direction (m2 m4 m6 : ℝ) (hm2 : 0 < m2) (hm4 : m2 ^ 2 < m4)\n (hΔ : 0 < d2Delta m2 m4 m6) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV m2 m4 (src" + }, + { + "kind": "theorem", + "unqualified_name": "lagrange_weighted", + "line": 310, + "source_header": "d2_schur_pos _ _ _ hm2 hm4 h0 h1,\n d2_tau_pos _ _ _ _ hm2 hm4 hΔ h0 h1⟩\n\n/-- Weighted Lagrange identity (finite sums). -/\ntheorem lagrange_weighted {ι : Type*} [Fintype ι] (p f g : ι → ℝ) :\n 2 * ((∑ i, p i * f i ^ 2) * (∑ i, p i * g i ^ 2) - (∑ i, p i" + }, + { + "kind": "def", + "unqualified_name": "finMoment", + "line": 321, + "source_header": "strib, Finset.sum_add_distrib, ← Finset.mul_sum,\n ← Finset.sum_mul]\n ring\n\n/-- Raw moment of a finite w" + }, + { + "kind": "theorem", + "unqualified_name": "double_sum_pos", + "line": 324, + "source_header": "nMoment {ι : Type*} [Fintype ι] (p x : ι → ℝ) (n : ℕ) : ℝ := ∑ i, p i * x i ^ n\n\ntheorem double_sum_pos {ι : Type*} [Fintype ι] (F : ι → ι → ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "finite_law_moment_hyps", + "line": 329, + "source_header": "et.mem_univ _, Finset.sum_pos' (fun j _ => hF a j) ⟨b, Finset.mem_univ _, hab⟩⟩\n\n/-- Moment hypotheses for any finite probability law with two nonzero atoms of distinct squares\n(a finite-support analogue of D2MomentBridge's two-atom lemmas; self-contained). -/\ntheorem finite_law_moment_hyps {ι : Type*} [Fintype ι] (p x : ι → ℝ) (hp : ∀ i, 0 ≤ p i)\n (hsum : ∑ i, p i = 1) (a b : ι) (hpa : 0 < p a) (hpb : 0 < p b) (ha0 : x a ≠ 0)\n (hb0 : x b ≠ 0) (hab : x a ^ 2 ≠ x b ^ 2) :\n 0 < finMoment p x 2 ∧ finMoment p x 2 ^ 2 < finMomen" + }, + { + "kind": "theorem", + "unqualified_name": "finite_law_positivity_every_direction", + "line": 379, + "source_header": "refine ⟨hm2, hm4, ?_⟩\n unfold d2Delta\n rw [sub_pos, div_lt_iff₀ hm2]\n linarith\n\n/-- (b)2 general statement for finite laws: positivity of τ², det V, Σ_{A|V} in every direction. -/\ntheorem finite_law_positivity_every_direction {ι : Type*} [Fintype ι] (p x : ι → ℝ)\n (hp : ∀ i, 0 ≤ p i) (hsum : ∑ i, p i = 1) (a b : ι) (hpa : 0 < p a) (hpb : 0 < p b)\n (ha0 : x a ≠ 0) (hb0 : x b ≠ 0) (hab : x a ^ 2 ≠ x b ^ 2) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV (finMoment p x 2) (finMoment p x 4) (srcQ c s) ∧\n 0 < d2Schur (finMoment p x 2) (finMoment p x 4) (srcQ c s)" + } + ] + }, + { + "path": "reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Poisson.lean", + "sha256": "45377ccfd156d4342d9e5aee0f90843f46f015436e7f2aa80779c1ed1a02a87d", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "theta_eq_cos_series", + "line": 27, + "source_header": "f\n\n/-! ## (a) General-t real θ cosine identity (Poisson summation) -/\n\n/-- θ_L(t) = (L²/(2π))^{-1/2} Σ_k w_k cos(2πkt/L) for every real t, L ≠ 0. -/\ntheorem theta_eq_cos_series {L : ℝ} (hL : L ≠ 0) (t : ℝ) :\n theta L t = 1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) *\n ∑' k : ℤ, weight L k * Real.cos (atom L k" + }, + { + "kind": "def", + "unqualified_name": "gauss", + "line": 88, + "source_header": "ring)\n\n/-! ## (b) Term-by-term differentiation of both series -/\n\n/-- Standard Gaussian e^{-x²/2}, in the form used by Mathlib's Hermite lemma. -/\ndef gaus" + }, + { + "kind": "theorem", + "unqualified_name": "contDiff_gauss", + "line": 93, + "source_header": "^ 2 / 2))\n\ntheorem contDiff_gauss : ContDiff" + }, + { + "kind": "theorem", + "unqualified_name": "hasDerivAt_iterate_deriv_gauss", + "line": 95, + "source_header": "fun_prop\n\ntheorem hasDerivAt_iterate_deriv_gauss (j : ℕ) (x : ℝ) :\n HasDerivAt (deriv^[j] gauss) (deriv^[j + 1] g" + }, + { + "kind": "theorem", + "unqualified_name": "poly_exp_bound", + "line": 100, + "source_header": "asDerivAt\n\n/-- Every real polynomial is bounded by B e^{|x|}. -/\ntheorem poly_exp_bound (p : Polynomial ℤ) :\n ∃ B : ℝ, 0 ≤ B ∧ ∀ x : ℝ, |Polynomial.aeval x p| ≤ B * R" + }, + { + "kind": "theorem", + "unqualified_name": "abs_sub_sq_le", + "line": 122, + "source_header": "orial : ℝ)]\n\ntheorem abs_sub_sq_le {L R t : ℝ} (ht : |t| ≤ R) (n : ℤ) :\n |t + L * n| - (t + L * n) ^ 2 / 2 ≤\n R + -π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 - 2 * ((R + 1) * |L| / (2 * π)) *" + }, + { + "kind": "theorem", + "unqualified_name": "iterate_deriv_gauss_bound", + "line": 135, + "source_header": "s_nonneg m]\n\n/-- Uniform majorant for g^{(j)}(t + Ln) on |t| ≤ R. -/\ntheorem iterate_deriv_gauss_bound (j : ℕ) : ∃ B : ℝ, 0 ≤ B ∧ ∀ (L R t : ℝ), |t| ≤ R → ∀ n : ℤ,\n ‖deriv^[j] gauss (t + L * n)‖ ≤ B * (Real.exp R *\n Real.exp (-π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 - 2 * ((R + 1) * |L| / (2 * π)) *" + }, + { + "kind": "theorem", + "unqualified_name": "summable_majorant", + "line": 154, + "source_header": "Real.exp_add]\n\ntheorem summable_majorant {L : ℝ} (hL : L ≠ 0) (B R : ℝ) :\n Summable fun n : ℤ => B * (Real.exp R *\n Real.exp (-π * (L ^ 2 / (2 * π) * (n : ℝ) ^ 2 - 2 * ((R + 1) * |L| / (2 * π)) *" + }, + { + "kind": "def", + "unqualified_name": "thetaD", + "line": 162, + "source_header": "_).mul_left _\n\n/-- Termwise j-th derivative series of θ_L: Σ_n g^{(j)}(t + Ln). -/\ndef thetaD (L : ℝ) (j :" + }, + { + "kind": "theorem", + "unqualified_name": "summable_thetaD_terms", + "line": 165, + "source_header": "uss (t + L * n)\n\ntheorem summable_thetaD_terms {L : ℝ} (hL : L ≠ 0) (j : ℕ) (t : ℝ) :\n Summable fun n : ℤ => deriv^[j] ga" + }, + { + "kind": "theorem", + "unqualified_name": "hasDerivAt_thetaD", + "line": 170, + "source_header": "|t| t le_rfl n)\n\ntheorem hasDerivAt_thetaD {L : ℝ} (hL : L ≠ 0) (j : ℕ) (y : ℝ) :\n HasDerivAt (thetaD L j) (thetaD" + }, + { + "kind": "def", + "unqualified_name": "cosD", + "line": 189, + "source_header": "y\n linarith\n\n/-- Termwise j-th derivative series of the cosine side: Σ_k w_k ω_k^j cos(ω_k t + jπ/2). -/\ndef cosD (L : ℝ) (j" + }, + { + "kind": "theorem", + "unqualified_name": "summable_abs_weight_mul_atom_pow", + "line": 193, + "source_header": "t + j * (π / 2)))\n\ntheorem summable_abs_weight_mul_atom_pow {L : ℝ} (hL : L ≠ 0) (j : ℕ) :\n Summable fun k : ℤ => weight L k" + }, + { + "kind": "theorem", + "unqualified_name": "cosD_term_bound", + "line": 198, + "source_header": "os L k), abs_pow]\n\ntheorem cosD_term_bound (L : ℝ) (j : ℕ) (k : ℤ) (t : ℝ) :\n ‖weight L k * (atom L k ^ j * Real.cos (atom L k * t + j * (π / 2)))‖ ≤\n weight L k" + }, + { + "kind": "theorem", + "unqualified_name": "hasDerivAt_cosD", + "line": 205, + "source_header": "eight_pos L k).le\n\ntheorem hasDerivAt_cosD {L : ℝ} (hL : L ≠ 0) (j : ℕ) (y : ℝ) :\n HasDerivAt (cosD L j) (co" + }, + { + "kind": "theorem", + "unqualified_name": "thetaD_zero", + "line": 226, + "source_header": "i_div_two]\n ring\n\ntheorem thetaD_zero (L t : ℝ) : thetaD" + }, + { + "kind": "theorem", + "unqualified_name": "cosD_zero", + "line": 232, + "source_header": "]\n congr 1; ring\n\ntheorem cosD_zero (L t : ℝ) : cosD L 0 t = ∑' k : ℤ, weight L k * Real.c" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedDeriv_theta", + "line": 235, + "source_header": "unfold cosD; simp\n\n/-- Term-by-term differentiation, θ side: iteratedDeriv j θ_L = Σ_n g^{(j)}(· + Ln). -/\ntheorem iteratedDeriv_theta {L : ℝ} (hL : L ≠ 0) (j : ℕ) : iteratedDeriv j (th" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedDeriv_theta_termwise", + "line": 241, + "source_header": "hetaD hL j t).deriv\n\n/-- Same, stated as \"derivative of the sum = sum of the derivatives\". -/\ntheorem iteratedDeriv_theta_termwise {L : ℝ} (hL : L ≠ 0) (j : ℕ) (t : ℝ) :\n iteratedDeriv j (theta L) t =\n ∑' n : ℤ, iteratedDeriv j (fun s => Real.exp (-(s" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedDeriv_cos_series", + "line": 253, + "source_header": "atedDeriv_eq_iterate]\n\n/-- Term-by-term differentiation, cosine side. -/\ntheorem iteratedDeriv_cos_series {L : ℝ} (hL : L ≠ 0) (j : ℕ) :\n iteratedDeriv j (fun t => ∑' k : ℤ, weight L k * Real.cos (at" + }, + { + "kind": "theorem", + "unqualified_name": "thetaD_eq_cosD", + "line": 260, + "source_header": "ivAt_cosD hL j t).deriv\n\n/-- Poisson identity for every termwise derivative (all j, all t). -/\ntheorem thetaD_eq_cosD {L : ℝ} (hL : L ≠ 0) (j : ℕ) (t : ℝ) :\n thetaD L j t = 1 / (L ^ 2 / (2 * π)) ^" + }, + { + "kind": "theorem", + "unqualified_name": "imageSum_even_eq_thetaD", + "line": 271, + "source_header": "cosD hL j t).const_mul _)\n\n/-! ## (c) θ-route moments = dual-law moments -/\n\ntheorem imageSum_even_eq_thetaD (L : ℝ) (m : ℕ) : imageSum L (" + }, + { + "kind": "theorem", + "unqualified_name": "iteratedDeriv_theta_zero_even", + "line": 279, + "source_header": "_pow,\n one_mul, neg_div]\n\n/-- N L53 as written, for even order: θ_L^{(2m)}(0) = Σ_n He_{2m}(Ln) e^{−(Ln)²/2}. -/\ntheorem iteratedDeriv_theta_zero_even {L : ℝ} (hL : L ≠ 0) (m : ℕ) :\n iteratedDeriv (2 * m) (th" + }, + { + "kind": "theorem", + "unqualified_name": "cosD_even_zero", + "line": 284, + "source_header": "hL, imageSum_even_eq_thetaD]\n\ntheorem cosD_even_zero (L : ℝ) (m : ℕ) :\n cosD L (2 * m) 0 = (-1) ^ m * rawSu" + }, + { + "kind": "theorem", + "unqualified_name": "imageSum_even_eq", + "line": 293, + "source_header": "eft]; congr 1; funext k; ring\n\ntheorem imageSum_even_eq {L : ℝ} (hL : L ≠ 0) (m : ℕ) :\n imageSum L (2 * m) = 1 / (L ^ 2 / (2 * π)) ^ (1 / 2 : ℝ) *\n ((-1) ^ m * rawSum" + }, + { + "kind": "theorem", + "unqualified_name": "imageMoment_even_eq_dualMoment", + "line": 298, + "source_header": "D_eq_cosD hL, cosD_even_zero]\n\n/-- The link: θ-route moment (N L53 / C L153) = dual-law moment (N L54 / C L156-177), every even\norder, every L ≠ 0. -/\ntheorem imageMoment_even_eq_dualMoment {L : ℝ} (hL : L ≠ 0) (m : ℕ) :\n imageMoment L" + }, + { + "kind": "theorem", + "unqualified_name": "imageMoment_eq_dualMoment", + "line": 316, + "source_header": "_mul, mul_div_mul_left _ _ hA0]\n\n/-- j = 2, 4, 6 (the W3f commented target, now with L ≠ 0 instead of 0 < L). -/\ntheorem imageMoment_eq_dualMoment {L : ℝ} (hL : L ≠ 0) (j : ℕ) (hj : j = 2 ∨ j = 4 ∨ j = 6) :" + }, + { + "kind": "theorem", + "unqualified_name": "image_moment_hyps", + "line": 324, + "source_header": "ageMoment_even_eq_dualMoment hL 3\n\n/-- Corollary: the θ-route moments satisfy 0 < m2, m2² < m4, Δ > 0 for every L ≠ 0. -/\ntheorem image_moment_hyps {L : ℝ} (hL : L ≠ 0) :\n 0 < imageMoment L 2 ∧ imageMoment L 2 ^ 2 < imageMoment L 4 ∧\n 0 < d2Delta (imageMoment L 2)" + }, + { + "kind": "theorem", + "unqualified_name": "image_positivity_every_direction", + "line": 332, + "source_header": "rfl))]\n exact dual_moment_hyps hL\n\n/-- Corollary: every-direction positivity for the θ-route moments, every L ≠ 0 (R3: c²+s²=1). -/\ntheorem image_positivity_every_direction {L : ℝ} (hL : L ≠ 0) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV (imageMoment L 2) (imageMoment L 4) (srcQ c s) ∧\n 0 < d2Schur (imageMoment L 2) (imageMoment L 4) (srcQ c s) ∧\n 0 < d2Tau (imageMoment L 2) (imageMom" + } + ] + }, + { + "path": "reviews/w3_side24_source_proposal_20261008/W3Scratch/Side24Law.lean", + "sha256": "97dd915fdcdc78b8242f60bd93005ba854f1fc24c2db9da5df6bedfd20eef0a7", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "rawSum", + "line": 38, + "source_header": "ℝ)\n\n/-- Unnormalized moment sum Σ w_i a_i^n. -/\ndef rawSum (n : ℕ" + }, + { + "kind": "def", + "unqualified_name": "lawMoment", + "line": 41, + "source_header": "i ^ n\n/-- Normalized raw moment m_n = Σ w a^n / Σ w. -/\ndef lawMoment (n :" + }, + { + "kind": "theorem", + "unqualified_name": "residual4_tsum", + "line": 45, + "source_header": "e {w a}\n\ntheorem residual4_tsum (hs : ∀ n : ℕ, Summable fun i => w i * a i ^ n) (m : ℝ) :\n Summable (fun i => w i * (a i ^ 2 - m) ^ 2) ∧\n ∑' i, w i * (a i ^ 2 - m) ^ 2 = rawSum w a 4 - 2 * m * rawSum w a 2 + m ^ 2 * rawSu" + }, + { + "kind": "theorem", + "unqualified_name": "residual6_tsum", + "line": 58, + "source_header": "]\n rfl\n\ntheorem residual6_tsum (hs : ∀ n : ℕ, Summable fun i => w i * a i ^ n) (c : ℝ) :\n Summable (fun i => w i * (a i ^ 3 - c * a i) ^ 2) ∧\n ∑' i, w i * (a i ^ 3 - c * a i) ^ 2 =\n rawSum w a 6 - 2 * c * rawSum w a 4 + c ^ 2 * rawSu" + }, + { + "kind": "theorem", + "unqualified_name": "sq_pos_of_ne", + "line": 72, + "source_header": "]\n rfl\n\ntheorem sq_pos_of_ne {x : ℝ} (hx : x ≠ 0) : 0" + }, + { + "kind": "theorem", + "unqualified_name": "countable_law_moment_hyps", + "line": 75, + "source_header": "2 hx))\n\n/-- Countable-support analogue of `finite_law_moment_hyps`: two nonzero atoms with distinct squares\ngive 0 < m2, m2² < m4 and Δ > 0. -/\ntheorem countable_law_moment_hyps (hw : ∀ i, 0 ≤ w i)\n (hs : ∀ n : ℕ, Summable fun i => w i * a i ^ n) (i j : ι) (hwi : 0 < w i) (hwj : 0 < w j)\n (hai : a i ≠ 0) (haj : a j ≠ 0) (hij : a i ^ 2 ≠ a j ^ 2) :\n 0 < lawMoment w a 2 ∧ lawMoment w a 2 ^ 2 < lawMoment w a 4 ∧\n 0 < d2Delta (lawMoment w a 2) (lawMoment w a 4) (lawMome" + }, + { + "kind": "def", + "unqualified_name": "atom", + "line": 134, + "source_header": "d Generic\n\n/-! ## The SIDE24 Poisson-dual law (N L54; C L156-177) -/\n\n/-- Atom 2πk/L (N L54). -/\ndef atom (L : ℝ" + }, + { + "kind": "def", + "unqualified_name": "weight", + "line": 139, + "source_header": "2 * π * k / L\n/-- Unnormalized weight e^{−(2πk/L)²/2} (N L54). -/\ndef weight (L :" + }, + { + "kind": "def", + "unqualified_name": "dualZ", + "line": 141, + "source_header": "m L k) ^ 2 / 2)\n/-- Normalizer Σ_k e^{−(2πk/L)²/2}. -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "dualMoment", + "line": 143, + "source_header": "ght L) (atom L) 0\n/-- Raw moment m_n(L) of the dual law (C L176-177: w[j]/w[0]). -/\ndef dualMoment" + }, + { + "kind": "theorem", + "unqualified_name": "weight_pos", + "line": 145, + "source_header": "eight L) (atom L) n\n\ntheorem weight_pos (L : ℝ) (k :" + }, + { + "kind": "theorem", + "unqualified_name": "summable_weight_mul_atom_pow", + "line": 147, + "source_header": "k := Real.exp_pos _\n\n/-- Summability of Σ_k w_k · atom_k^n for every n (in particular n = 6: X⁶ integrability). -/\ntheorem summable_weight_mul_atom_pow {L : ℝ} (hL : L ≠ 0) (n : ℕ) :\n Summable fun k : ℤ => weig" + }, + { + "kind": "theorem", + "unqualified_name": "summable_sixth", + "line": 164, + "source_header": "[Int.cast_abs]\n ring\n\n/-- X⁶ integrability of the dual law, stated as summability. -/\ntheorem summable_sixth {L : ℝ} (hL : L ≠ 0) : Summable fun k : ℤ => we" + }, + { + "kind": "theorem", + "unqualified_name": "dualZ_pos", + "line": 168, + "source_header": "eight_mul_atom_pow hL 6\n\ntheorem dualZ_pos {L : ℝ} (hL" + }, + { + "kind": "theorem", + "unqualified_name": "dual_normalized", + "line": 173, + "source_header": "; exact weight_pos L 0)\n\n/-- Normalization: the probabilities w_k / Z sum to 1. -/\ntheorem dual_normalized {L : ℝ} (hL : L ≠ 0) : ∑' k : ℤ," + }, + { + "kind": "theorem", + "unqualified_name": "dual_odd_moment_zero", + "line": 181, + "source_header": "s, div_self (ne_of_gt h)]\n\n/-- Symmetry: odd raw moments vanish (atom(−k) = −atom(k), weight even). -/\ntheorem dual_odd_moment_zero (L : ℝ) (m : ℕ) : rawSum (weight" + }, + { + "kind": "theorem", + "unqualified_name": "dual_moment_hyps", + "line": 193, + "source_header": ", tsum_neg] at h\n linarith\n\n/-- Moment hypotheses for the SIDE24 dual law at EVERY nonzero period L (atoms k = 1, 2). -/\ntheorem dual_moment_hyps {L : ℝ} (hL : L ≠ 0) :\n 0 < dualMoment L 2 ∧ dualMoment L 2 ^ 2 < dualMoment L 4 ∧\n 0 < d2Delta (dualMoment L 2) (dua" + }, + { + "kind": "theorem", + "unqualified_name": "dual_positivity_every_direction", + "line": 212, + "source_header": "1) (weight_pos L 2) h1 h2 h12\n\n/-- Every-direction positivity for the exact dual-law moments, at every nonzero L. This is a new\nall-L ≠ 0 statement. N certifies \"positive in every direction\" (N L59, L78) only numerically, by\ninterval enclosures, at the six values L ∈ {24, 8, 2π, 4, 3, 2} (N L17, L65-73); this theorem is\nnot that certificate, and identifying the two needs analytic question (a) of the README. -/\ntheorem dual_positivity_every_direction {L : ℝ} (hL : L ≠ 0) (c s : ℝ) (hu : c ^ 2 + s ^ 2 = 1) :\n 0 < d2DetV (dualMoment L 2) (dualMoment L 4) (srcQ c s) ∧\n 0 < d2Schur (dualMoment L 2) (dualMoment L 4) (srcQ c s) ∧\n 0 < d2Tau (dualMoment L 2) (dualMoment L" + }, + { + "kind": "def", + "unqualified_name": "theta", + "line": 223, + "source_header": "direction _ _ _ h2 h4 h6 c s hu\n\n/-! ## The θ-series route (N L21, L53; C L137-153) -/\n\n/-- θ_L(t) = Σ_n e^{−(t+Ln)²/2}" + }, + { + "kind": "def", + "unqualified_name": "imageSum", + "line": 228, + "source_header": "ℤ, Real.exp (-(t + L * n) ^ 2 / 2)\n/-- Image sum Σ_n He_j(Ln) e^{−(Ln)²/2} (N L53), probabilists' Hermite `Polynomial.hermite`" + }, + { + "kind": "def", + "unqualified_name": "imageMoment", + "line": 231, + "source_header": "mite j) * Real.exp (-(L * n) ^ 2 / 2)\n/-- θ-route moment m_j = (−1)^(j/2) θ^{(j)}(0)/θ(0), via image sums (C L153)." + }, + { + "kind": "theorem", + "unqualified_name": "imageSum_zero", + "line": 233, + "source_header": "^ (j / 2) * imageSum L j / imageSum L 0\n\ntheorem imageSum_" + }, + { + "kind": "theorem", + "unqualified_name": "theta_zero_eq_dual", + "line": 237, + "source_header": "theta\n simp [Polynomial.hermite_zero]\n\n/-- Poisson link, j = 0 (closed): θ_L(0) = (L²/(2π))^{−1/2} · Σ_k e^{−(2πk/L)²/2}, from\nMathlib's `Real.tsum_exp_neg_mul_int_sq`. -/\ntheorem theta_zero_eq_dual {L : ℝ} (hL : L ≠ 0) :\n theta L 0 = 1 /" + }, + { + "kind": "theorem", + "unqualified_name": "theta_term_iteratedDeriv", + "line": 251, + "source_header": "_simp\n simp only [e1, e2] at h\n exact h\n\n/-- Step (iii) of the Poisson link, closed: the j-th t-derivative at 0 of one θ-term is\n(−1)^j He_j(y) e^{−y²/2} (Mathlib `deriv_gaussian_eq_hermite_mul_gaussian`). -/\ntheorem theta_term_iteratedDeriv (y : ℝ) (j : ℕ) :\n iteratedDeriv j (fun t => Real.exp (-(t + y) ^ 2 / 2)) 0 =\n (-1 : ℝ) ^ j * Polynomial.aeval y (Po" + }, + { + "kind": "theorem", + "unqualified_name": "imageSum_even_eq_tsum_termwise", + "line": 263, + "source_header": "an_eq_hermite_mul_gaussian]\n congr 2; ring\n\n/-- N L53 holds termwise: the image sum of even order is the sum of the termwise 2m-th\nderivatives of θ_L at 0. (The exchange of Σ and d/dt, for L ≠ 0, is in `Side24Poisson`:\n`iteratedDeriv_theta`, `iteratedDeriv_theta_zero_even`.) -/\ntheorem imageSum_even_eq_tsum_termwise (L : ℝ) (m : ℕ) :\n imageSum L (2 * m) =\n ∑' n : ℤ, iteratedDeriv (2 * m)" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:specifications/lean_statement_proofs_20261011", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs.lean", + "sha256": "bf65105b6902ba3ef8262a7cff13e611ce3e56263ad7f57a7183097e67332a8c" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Covers.lean", + "sha256": "5d14d6283c52e90451bce80061dd55b07b9234c92b3d87de38c1975f5b1852ed" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Elementary.lean", + "sha256": "7fb8f8c5045f51ca766f1fa614a25e3b334b1ac6199731c2556c28707193c1bb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24ConeMoment.lean", + "sha256": "08d53d0a970d5765c32e42253fd78226430627018c276398968cab9fc8e3180e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Interpolation.lean", + "sha256": "bdfd836ecc96910824e78249a19a12e74b99ac2f352bda1e9d5daa4f93ff03cb" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNCluster.lean", + "sha256": "829f8ad5677c52d55ae7c4c3ea36d817692c3d122273e29dfe2068b00dde442a" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Interfaces.lean", + "sha256": "cac965c9f6095a0812891b609be56e0fed885861f5c95cc0e9518e7908642fce" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Images.lean", + "sha256": "ca643c39144400074658c39bbdd0f04ac47d29bd0c59fc2327d5a90d4f5ae392" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Structure.lean", + "sha256": "a3c9f514a4d482a99402a57c0097e1819fedbfd71faffaafade3b2050d797598" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Analysis.lean", + "sha256": "7cf64095450464b5974e381f9c6d1ed238473dd931ff558cad67db1d9a62acbc" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Hazard.lean", + "sha256": "65584aea77eefd1f59aee51554d94b9ea9c390f7a62da40e4210f8487dbdf8f1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Budget.lean", + "sha256": "6b5c5515345b3a8609fd7198f2da07e94a136dcf662445f1e528c63266671c46" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/RNProbability.lean", + "sha256": "3bdc6055c8fe9419addc3ad7bf77c5a88efe387470d9c7201331343859808636" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Elementary.lean", + "sha256": "d4d87bba1da9473cd3c5bda9c702ba4dd036de06085d5ad589f17988bf8695b1" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Covariance.lean", + "sha256": "08317c620ae7b85ce2d253f0a106a6cee0099566a09debeb703acbce4744ae30" + } + ], + "source_record_sha256": "cef96d47bb6cef763b2c7fa2dbc93ac8dcca1c5e0a250e882fe9891aacc9f064", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "specifications/lean_statement_proofs_20261011", + "source_files": [ + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs.lean", + "sha256": "bf65105b6902ba3ef8262a7cff13e611ce3e56263ad7f57a7183097e67332a8c", + "declarations_lexical": [] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Covers.lean", + "sha256": "5d14d6283c52e90451bce80061dd55b07b9234c92b3d87de38c1975f5b1852ed", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "weight_nonneg", + "line": 31, + "source_header": "x\n\n/-! ### The product measure: nonnegative weights and the marginal of a fixed subset -/\n\n/-- Weights are nonnegative for `p` in `[0,1]^Y`. -/\ntheorem weight_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (U : Finset Y) : 0 ≤ weigh" + }, + { + "kind": "theorem", + "unqualified_name": "filter_superset_eq_image", + "line": 40, + "source_header": ").2])\n\n/-- The sets containing `M` are exactly the sets `M ∪ T` with `T ⊆ univ \\ M`. -/\ntheorem filter_superset_eq_image {Y : Type} [Fintype Y] [DecidableEq Y] (M : Finset Y) :\n (univ : Finset Y).powerset.filter (fun U => M ⊆ U) =\n ((univ : Finset Y) \\ M).powerset.image (fun T =>" + }, + { + "kind": "theorem", + "unqualified_name": "weight_union_of_disjoint", + "line": 52, + "source_header": "on_left\n\n/-- The weight of `M ∪ T` for `T` disjoint from `M` factors as the product of `p` over `M` times\nthe weight of `T` relative to the ground set `univ \\ M`. -/\ntheorem weight_union_of_disjoint {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ)\n {M T : Finset Y} (h : Disjoint M T) :\n weight p (M ∪ T) =\n (∏ v ∈ M, p v) * ((∏ v ∈ T, p v) * ∏ v ∈ ((univ : Finset Y) \\ M) \\ T, (" + }, + { + "kind": "theorem", + "unqualified_name": "sum_weight_filter_superset", + "line": 64, + "source_header": "ssoc, hs]\n\n/-- The marginal identity: the total weight of the sets containing a fixed `M` is\n`∏_{v ∈ M} p v`, for any real vector `p` (no range hypothesis is needed). -/\ntheorem sum_weight_filter_superset {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ)\n (M : Finset Y) :\n ∑ U ∈ (univ : Finset Y).powerset.filter (fun U => M ⊆ U), weight p U = ∏" + }, + { + "kind": "theorem", + "unqualified_name": "sum_weight_ite_superset", + "line": 86, + "source_header": ", ← e₂, h']\n\n/-- The same marginal identity with the superset condition written as an `if`. -/\ntheorem sum_weight_ite_superset {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ)\n (M : Finset Y) :\n ∑ U ∈ (univ : Finset Y).powerset, (if M ⊆ U then weight p U else 0) =" + }, + { + "kind": "theorem", + "unqualified_name": "one_sub_mu_eq", + "line": 96, + "source_header": "en Classical in\n/-- `1 - mu_p(D)` is the total weight of the bad sets (classical decidability of `IsGood`). -/\ntheorem one_sub_mu_eq {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (p : X → ℝ) :\n 1 - mu F p =\n ∑ U ∈ (univ : Finset X).powerset, (if IsGood F U then 0" + }, + { + "kind": "theorem", + "unqualified_name": "one_sub_mu_le_sum_prod", + "line": 109, + "source_header": "plit_ifs <;> ring\n\n/-- The union bound: if every bad set contains a member of the family `𝓜`, then\n`1 - mu_p(D) ≤ ∑_{M ∈ 𝓜} ∏_{v ∈ M} p v`, for `p` in `[0,1]^X`. -/\ntheorem one_sub_mu_le_sum_prod {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X → ℝ) (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (𝓜 : Finset (Finset X))\n (h𝓜 : ∀ U : Finset X, ¬ IsGood F U → ∃ M ∈ 𝓜, M ⊆ U) :\n 1 - mu F p ≤ ∑" + }, + { + "kind": "theorem", + "unqualified_name": "exists_minimalForbidden_subset", + "line": 138, + "source_header": "ht_ite_superset p M\n\n/-! ### Minimal forbidden subsets of bad sets; the size of a transversal -/\n\n/-- Every bad set contains an inclusion-minimal forbidden set. -/\ntheorem exists_minimalForbidden_subset {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) (U : Finset X) (hU : ¬ IsGood F U) :\n ∃ M : Finset X, IsMinim" + }, + { + "kind": "theorem", + "unqualified_name": "card_of_isTransversal", + "line": 152, + "source_header": ", hv, hb⟩⟩, subset_rfl⟩\n\n/-- A transversal of `e` has exactly `|e|` elements (one per block of `e`). -/\ntheorem card_of_isTransversal {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n {e : Finset (Fin F.b)} {U : Finset X} (h : IsTransversal" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816_bad_covered", + "line": 177, + "source_header": ".Proofs.P15Structure.Aux in\n/-- Every bad set of the six-block benchmark contains an internal pair or a transversal\nquadruple. -/\ntheorem benchmark816_bad_covered (U : Finset (Fin 6 × Fin 409))\n (hU : ¬ IsGood benchmark816 U) : ∃ M ∈" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816_one_sub_mu_le", + "line": 191, + "source_header": "aw.Proofs.P15Structure.Aux in\n/-- Display (P11), first line: the union bound over the `6 * C(409,2)` pairs and the\n`15 * 409^4` transversal quadruples at `p_v = 1/40900`. -/\ntheorem benchmark816_one_sub_mu_le :\n 1 - mu benchmark816 (fun _ => (1 : ℝ) / 40900) ≤ 50" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816Cover", + "line": 219, + "source_header": "push_cast\n norm_num\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816Cover` (claim `p15-realized-covers`, Section 6 of\nP15_REALIZED_COVERS.md: \"At816 colors it covers the obstruction; at815 it does not\").\nMethod: Proposition P2 (`FullBlockCoverIff`) for the six-block data, which satisfy\n`IsRealizedFamily` (`Benchmark816IsRealized`), reduces both clauses to `816 ≤ K`, and\n`Benchmark816Palette` evaluates the palette number to `816`.\nDoes not establish: the informal claim, its review or acceptance; alignment of the formal\n`IsGeneratorCover`/`obstruction` with the informal notions; optimality of any other cover\n(disposition transcribed in the statement: HOLD_WITH_DOMAIN). -/\ntheorem benchmark816Cover : Univer" + }, + { + "kind": "theorem", + "unqualified_name": "localRestriction", + "line": 237, + "source_header": ".1 hc\n rw [hpal] at h815\n omega\n\n/-- Proves: `UniversalLaw.Spec.P15.LocalRestriction` (claim `p15-realized-covers`, display (P2) of\nP15_REALIZED_COVERS.md: `D_i = D ∩ 2^(X_i) = {S ⊆ X_i : |S| ≤ a_i}`).\nMethod: for `S ⊆ X_i`, `S ∩ X_i = S`, so goodness gives `|S| ≤ a_i`; conversely a subset of one\nblock with at most `a_i` elements is good because its support has at most one index and every\nedge has at least two (`P15Structure.Aux.good_of_subset_block`).\nDoes not establish: the informal claim, its review or acceptance; alignment of `IsGood` with the\ninformal downset `D`. -/\ntheorem localRestriction {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :\n Unive" + }, + { + "kind": "theorem", + "unqualified_name": "paletteNumberAttained", + "line": 254, + "source_header": "ux.good_of_subset_block hF hS hcard\n\n/-- Proves: `UniversalLaw.Spec.P15.PaletteNumberAttained` (claim `p15-realized-covers`, Section 4\nof P15_REALIZED_COVERS.md: \"By discarding excess labels within blocks, one may take |P_i|=d_i\";\nthe feasible set of palette sizes is nonempty).\nMethod: disjoint label intervals of lengths `d_i` form a feasible palette of size `∑ d_i` when\nevery edge has at least two indices (`P15Structure.Aux.isPaletteFeasible_paletteNumber`), so the\ninfimum over `ℕ` is attained (`csInf_mem` of a nonempty set of naturals).\nDoes not establish: the informal claim, its review or acceptance; the value of the palette\nnumber for any family. -/\ntheorem paletteNumberAttained {X : Type} [Fintype X] (F : RealizedData X) :\n Universa" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816UnionBound", + "line": 266, + "source_header": "ible_paletteNumber F.H F.d hF.2.2.2.1\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816UnionBound` (claim `p15-realized-covers`, display\n(P11) of P15_REALIZED_COVERS.md: `Q = 1 - mu_p(D) ≤ 500616/40900^2 + 15/100^4 =\n2449227/8180000000 < 3/10000` at `p_v = 1/40900`).\nMethod: `1 - mu_p(D)` is the total weight of the bad sets; every bad set contains a minimal\nforbidden set, which by Proposition P1 for the six-block data is an internal pair (`6 * C(409,2)`\nof them) or a transversal quadruple (`15 * 409^4`); the union bound exchanges the two sums and the\nmarginal identity `∑_{U ⊇ M} w(U) = ∏_{v ∈ M} p_v` evaluates each term to `(1/40900)^|M|`; the\ntwo rational identities are exact arithmetic (`norm_num`), and the last clause follows from the\nfirst three by `linarith`.\nDoes not establish: the informal claim, its review or acceptance; the exact value of the bad\nprobability (the source stresses \"only a union bound, not an equality of the global bad\nprobability\"); alignment of `mu`/`IsGood` with the informal objects. -/\ntheorem benchmark816UnionBound : Unive" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Elementary.lean", + "sha256": "7fb8f8c5045f51ca766f1fa614a25e3b334b1ac6199731c2556c28707193c1bb", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "ten_lt_taylor_sum", + "line": 37, + "source_header": "x\n\n/-! ### Exponential bounds -/\n\n/-- The degree-nine Taylor polynomial of `exp` at `288/125` exceeds `10` (exact rational\narithmetic). -/\ntheorem ten_lt_taylor_sum :\n (10 : ℝ) < ∑ i ∈ Finset.range 10, (288 / 125 : ℝ) ^ i / (Nat.factorial i" + }, + { + "kind": "theorem", + "unqualified_name": "ten_lt_exp", + "line": 46, + "source_header": "m_num\n\n/-- `10 < exp (288/125)` by the Taylor lower bound `Real.sum_le_exp_of_nonneg`. -/\ntheorem ten_lt_exp : (10 : ℝ) < Real.exp (288" + }, + { + "kind": "theorem", + "unqualified_name": "pow_ten_lt_exp", + "line": 51, + "source_header": "r_sum h\n\n/-- `10^125 < exp 288`, raising the previous bound to the `125`-th power. -/\ntheorem pow_ten_lt_exp : (10 : ℝ) ^ 125 < Rea" + }, + { + "kind": "theorem", + "unqualified_name": "exp_neg_lt", + "line": 58, + "source_header": "norm_num)\n\n/-- `exp (-288) < 1 / 10^125`. -/\ntheorem exp_neg_lt : Real.exp (-288) < 1" + }, + { + "kind": "theorem", + "unqualified_name": "big_lt_exp", + "line": 63, + "source_header": "_ten_lt_exp\n\n/-- `1024 < exp 864` by the quadratic lower bound. -/\ntheorem big_lt_exp : (1024 : ℝ) <" + }, + { + "kind": "theorem", + "unqualified_name": "ratio_const_lt_half", + "line": 68, + "source_header": "4)\n linarith\n\n/-- The geometric-ratio constant: `512 exp (-864) < 1/2`. -/\ntheorem ratio_const_lt_half : 512 * Real.exp (-864" + }, + { + "kind": "theorem", + "unqualified_name": "pow_succ_le", + "line": 74, + "source_header": "_exp\n linarith\n\n/-- The term ratio for `j ≥ 1`: `(j+1)^9 ≤ 512 j^9` since `j + 1 ≤ 2 j`. -/\ntheorem pow_succ_le (j : ℕ) (hj : 1 ≤ j) : ((j : ℝ) + 1) ^ 9 ≤" + }, + { + "kind": "theorem", + "unqualified_name": "exp_succ_le", + "line": 81, + "source_header": "ℝ) ^ 9 := by ring\n\n/-- The exponential factor for `j ≥ 1`: `exp (-288 (j+1)^2) ≤ exp (-864) exp (-288 j^2)`. -/\ntheorem exp_succ_le (j : ℕ) (hj : 1 ≤ j) :\n Real.exp (-288 * ((j : ℝ) + 1) ^ 2) ≤ Real.exp (-864) * Real.exp (" + }, + { + "kind": "theorem", + "unqualified_name": "sqrt_three_eighths", + "line": 88, + "source_header": "le_exp]\n nlinarith\n\n/-! ### Square-root algebra -/\n\n/-- `sqrt (3/8) = sqrt 6 / 4`. -/\ntheorem sqrt_three_eighths : Real.sqrt (3" + }, + { + "kind": "theorem", + "unqualified_name": "sqrt_six_rpow", + "line": 95, + "source_header": ".sqrt_sq (by norm_num)]\n\n/-- `(sqrt 6)^(4/3) = 24^(1/3) (3/2)^(1/3)`, i.e. `6^(2/3) = 36^(1/3)` and `24 * 3/2 = 36`. -/\ntheorem sqrt_six_rpow : (Real.sqrt 6) ^ ((4 : ℝ) / 3) =\n (24 : ℝ) ^ ((1 : ℝ) / 3) * (3" + }, + { + "kind": "theorem", + "unqualified_name": "hasDerivAt_antideriv", + "line": 103, + "source_header": "Real.rpow_two]\n norm_num\n\n/-! ### The elementary cone integral -/\n\n/-- The antiderivative `F z = -((a-z)^2 - 4(a-z) + 8) exp (-z/2)` of\n`(a-z)^2 exp (-z/2) / 2`. -/\ntheorem hasDerivAt_antideriv (a z : ℝ) :\n HasDerivAt (fun z : ℝ => -(((a - z) ^ 2 - 4 * (a - z) + 8) * Real.exp (-z / 2)))\n ((a - z) ^" + }, + { + "kind": "theorem", + "unqualified_name": "exponentialBounds", + "line": 128, + "source_header": "1\n push_cast\n ring\n\nend Aux\n\n/-! ## Section 2 exponential and ratio facts -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ExponentialBounds` (register row `side24-coefficient`).\nMethod: degree-nine Taylor lower bound `Real.sum_le_exp_of_nonneg` at `288/125` evaluated in\nexact rational arithmetic, then `exp 288 = exp (288/125)^125 > 10^125` and inversion.\nDoes not establish: the lattice-image bound or display (2) of the source, any enclosure of the\ncoefficient, nonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/\ntheorem exponentialBounds : Universal" + }, + { + "kind": "theorem", + "unqualified_name": "successiveTermRatio", + "line": 138, + "source_header": "⟨Aux.ten_lt_exp, Aux.exp_neg_lt⟩\n\n/-- Proves: `UniversalLaw.Spec.Side24.SuccessiveTermRatio` (register row `side24-coefficient`).\nMethod: `(j+1)^9 ≤ (2j)^9 = 512 j^9` and `-288 (j+1)^2 ≤ -864 - 288 j^2` for `j ≥ 1`;\n`512 exp (-864) < 1/2` from the quadratic lower bound `1 + 864 + 864^2/2 ≤ exp 864`.\nDoes not establish: the lattice-image sum bound `LatticeImageSumBound` (the geometric\nsummation itself is not performed here), any enclosure of the coefficient, nonauthor review\nor acceptance. -/\ntheorem successiveTermRatio : Universal" + }, + { + "kind": "theorem", + "unqualified_name": "coneMomentD2Algebra", + "line": 152, + "source_header": "xp (-288 * (j : ℝ) ^ 2)) := by ring\n\n/-! ## Section 1 algebra -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ConeMomentD2Algebra` (register row `side24-coefficient`).\nMethod: `sqrt (3/8) = sqrt 6 / 4` (`Real.sqrt_div'`, `Real.sqrt_sq`), then `ring`.\nDoes not establish: the Gaussian identity `ConeMomentD2Identity` (that `D_2` is the cone\nexpectation), any enclosure of the coefficient, nonauthor review or acceptance. -/\ntheorem coneMomentD2Algebra : Unive" + }, + { + "kind": "theorem", + "unqualified_name": "referenceCoefficientIdentity", + "line": 163, + "source_header": "D2\n rw [Aux.sqrt_three_eighths]\n ring\n\n/-- Proves: `UniversalLaw.Spec.Side24.ReferenceCoefficientIdentity` (register row\n`side24-coefficient`).\nMethod: case split `d = 2`, `d = 3`; `(sqrt 6)^(4/3) = 24^(1/3) (3/2)^(1/3)` through\n`Real.sqrt_eq_rpow`, `Real.rpow_mul`, `Real.mul_rpow`; `(2 pi)^(-d)` through `Real.rpow_neg`\nand `Real.rpow_natCast`; then `field_simp` and `ring` with `pi`, `sqrt pi`, `sqrt 3`,\n`24^(1/3)` nonzero.\nDoes not establish: that the left side is the parent formula (15.2) evaluated at the reference\nlaw (rotational invariance of `K_infty` is not specified), the value of `Gamma (7/6)`, equality\nof the periodic and reference coefficients (the source says it is NOT claimed), any enclosure\nof the coefficient, nonauthor review or acceptance. -/\ntheorem referenceCoefficientIdentity : UniversalLaw" + }, + { + "kind": "theorem", + "unqualified_name": "elementaryConeIntegral", + "line": 191, + "source_header": "Ref]\n norm_num\n field_simp\n ring\n\n/-- Proves: `UniversalLaw.Spec.Side24.ElementaryConeIntegral` (register row\n`side24-coefficient`).\nMethod: fundamental theorem of calculus `intervalIntegral.integral_eq_sub_of_hasDerivAt` with\nthe explicit antiderivative `-((a-z)^2 - 4(a-z) + 8) exp (-z/2)` (derivative rules\n`HasDerivAt.fun_pow`, `.mul`, `.exp`), integrability from continuity (`fun_prop`).\nDoes not establish: the Rayleigh law of `R^2` (`RayleighSquareLaw`), the cone-moment identity\n`ConeMomentD2Identity`, any enclosure of the coefficient, nonauthor review or acceptance. -/\ntheorem elementaryConeIntegral : Univ" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24ConeMoment.lean", + "sha256": "08d53d0a970d5765c32e42253fd78226430627018c276398968cab9fc8e3180e", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "cm_det_transverse", + "line": 88, + "source_header": "x\n\n/-! ## `cm_` (a): the negative-definite cone of the `m = 2` transverse matrix -/\n\n/-- `det [[s + x, y], [y, s - x]] = s^2 - x^2 - y^2` (`Matrix.det_fin_two_of`). -/\ntheorem cm_det_transverse (s x y : ℝ) :\n (transverseMatrix s x y).det = s ^ 2 - x ^ 2 -" + }, + { + "kind": "theorem", + "unqualified_name": "cm_cone_forward", + "line": 97, + "source_header": "ring\n\n/-- Forward direction of the cone characterisation: positive definiteness of `-A` gives `s < 0`\n(the two diagonal entries `-s - x`, `-s + x` are positive, `Matrix.PosDef.diag_pos`) and\n`x^2 + y^2 < s^2` (`det (-A) = det A > 0`, `Matrix.PosDef.det_pos`, `Matrix.det_neg`). -/\ntheorem cm_cone_forward (s x y : ℝ) (h : NegDefCone (s, x, y)) :\n s < 0 ∧ x ^ 2 + y ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "cm_sq_add_sq_pos", + "line": 113, + "source_header": "inarith\n\n/-- A nonzero vector of `Fin 2 → ℝ` has positive squared norm `v 0 ^ 2 + v 1 ^ 2`. -/\ntheorem cm_sq_add_sq_pos (v : Fin 2 → ℝ) (hv : v ≠ 0) : 0 < v 0 ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "cm_quad_pos", + "line": 125, + "source_header": "exact h1\n\n/-- The quadratic form of `-A` at `(a, b) ≠ 0` is positive inside the cone: by the Lagrange\nidentity `(x (a^2 - b^2) + 2 y a b)^2 + (2 x a b - y (a^2 - b^2))^2 = (x^2 + y^2) (a^2 + b^2)^2`,\n`|x (a^2 - b^2) + 2 y a b| ≤ sqrt (x^2 + y^2) (a^2 + b^2) < -s (a^2 + b^2)` (`nlinarith`). -/\ntheorem cm_quad_pos (s x y a b : ℝ) (hs : s < 0) (hr : x ^ 2 + y ^ 2 < s ^ 2)\n (hab : 0 < a ^ 2 + b ^ 2) :\n 0 < -s * (a ^ 2 + b ^ 2) - x * (a ^ 2 - b ^ 2) - 2" + }, + { + "kind": "theorem", + "unqualified_name": "cm_cone_backward", + "line": 144, + "source_header": "- b ^ 2))]\n\n/-- Converse direction of the cone characterisation: for `s < 0` and `x^2 + y^2 < s^2`, `-A` is\nsymmetric and its quadratic form is positive on nonzero vectors\n(`Matrix.PosDef.of_dotProduct_mulVec_pos`, `cm_quad_pos`). -/\ntheorem cm_cone_backward (s x y : ℝ) (hs : s < 0) (hr : x ^ 2 + y ^ 2 < s ^ 2) :\n NegDefC" + }, + { + "kind": "theorem", + "unqualified_name": "cm_cone_iff", + "line": 159, + "source_header": "nlinarith\n\n/-- The formal cone `NegDefCone q` is `q.1 < 0 ∧ q.2.1^2 + q.2.2^2 < q.1^2` (both directions\nabove). A statement about the formal definition only. -/\ntheorem cm_cone_iff (q : ℝ × ℝ × ℝ) :\n NegDefCone q ↔ q.1 < 0 ∧ q.2.1 ^ 2 + q.2." + }, + { + "kind": "theorem", + "unqualified_name": "cm_radial_integral", + "line": 166, + "source_header": "q.2.2 h.1 h.2⟩\n\n/-! ## `cm_` (b): the planar Gaussian integral of the disk integrand -/\n\n/-- The radial integral `∫_0^{sqrt a} r (a - r^2)^2 (2π)⁻¹ exp (-r^2/2) dr =\n(2π)⁻¹ (a^2 - 4a + 8 - 8 exp (-a/2))`: the substitution `z = r^2`\n(`intervalIntegral.integral_comp_mul_deriv`) turns it into `(2π)⁻¹` times the interval integral\nof `ElementaryConeIntegral`, which `Side24Elementary.elementaryConeIntegral` evaluates. -/\ntheorem cm_radial_integral (a : ℝ) (ha : 0 ≤ a) :\n ∫ r in (0 : ℝ)..Real.sqrt a,\n r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2))) =\n (2 * Real.pi)⁻¹ * (a ^ 2 - 4 * a + 8 - 8 *" + }, + { + "kind": "theorem", + "unqualified_name": "cm_polar_integrand", + "line": 195, + "source_header": "yConeIntegral a ha]\n\n/-- In polar coordinates the disk integrand `p.1 • 1_D (a - |q|^2)^2 φ(q.1) φ(q.2)` at\n`q = polarCoord.symm p` is the radial function `1_{r^2 ≤ a} r (a - r^2)^2 (2π)⁻¹ exp (-r^2/2)` of\n`p.1` times the constant `1` of `p.2` (`rl_pdf_mul`, `cos^2 + sin^2 = 1`). -/\ntheorem cm_polar_integrand (a : ℝ) (p : ℝ × ℝ) :\n p.1 • Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}\n (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2 *\n (gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2)) (polarCoord.symm p) =\n Set.indicator {r : ℝ | r ^ 2 ≤ a}\n (fun r => r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)))) p.1 *\n (fun" + }, + { + "kind": "theorem", + "unqualified_name": "cm_disk_integral", + "line": 213, + "source_header": "split_ifs <;> simp\n\n/-- The Lebesgue integral over the plane of `1{|q|^2 ≤ a} (a - |q|^2)^2 φ(q.1) φ(q.2)` (`φ` the\nstandard Gaussian density) is `a^2 - 4a + 8 - 8 exp (-a/2)`: polar coordinates\n(`integral_comp_polarCoord_symm`), separation of variables (`setIntegral_prod_mul`), the angular\nintegral `2π` (`rl_angular_integral`) and the radial integral `cm_radial_integral`. -/\ntheorem cm_disk_integral (a : ℝ) (ha : 0 ≤ a) :\n ∫ p, Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}\n (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2 *\n (gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2)) p =\n a ^ 2 - 4 * a + 8" + }, + { + "kind": "theorem", + "unqualified_name": "cm_gauss2_integral", + "line": 252, + "source_header": "_integral]\n field_simp\n\n/-- Under the standard planar Gaussian `gaussianReal 0 1 ⊗ gaussianReal 0 1`, the integral of\n`1{|q|^2 ≤ a} (a - |q|^2)^2` is `a^2 - 4a + 8 - 8 exp (-a/2)`: the product of the two\n`withDensity` laws is `withDensity` of the product density (`prod_withDensity`), the integral\nagainst it is the Lebesgue integral of the density times the integrand\n(`integral_withDensity_eq_integral_toReal_smul`, `toReal_gaussianPDF`), and `cm_disk_integral`. -/\ntheorem cm_gauss2_integral (a : ℝ) (ha : 0 ≤ a) :\n ∫ p, Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a} (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2) p\n ∂((gaussianReal 0 1).prod (gaussianReal 0 1)) =\n a ^ 2 - 4 * a +" + }, + { + "kind": "theorem", + "unqualified_name": "cm_integrable_pow_four", + "line": 275, + "source_header": "mul]\n split_ifs <;> ring\n\n/-! ## `cm_` (c): the bracket `t^4 - 4t^2 + 8 - 8 exp (-t^2/2)` under `N(0, 5/3)` -/\n\n/-- `t ↦ t^4` is integrable against `gaussianReal 0 v` (`memLp_id_gaussianReal'` at `p = 4`,\n`MemLp.integrable_norm_pow`, `|t|^4 = t^4`). -/\ntheorem cm_integrable_pow_four (v : NNReal) :\n Integrable (fun t : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "cm_integrable_exp", + "line": 287, + "source_header": "bs_of_nonneg (by positivity)]\n\n/-- `t ↦ exp (-t^2/2)` is integrable against `gaussianReal 0 v`: measurable and bounded by `1`\nunder a probability measure (`Integrable.mono'`). -/\ntheorem cm_integrable_exp (v : NNReal) :\n Integrable (fun t : ℝ => Real.exp (-(" + }, + { + "kind": "theorem", + "unqualified_name": "cm_integrable_bracket", + "line": 297, + "source_header": "t ^ 2 := sq_nonneg t\n linarith\n\n/-- The bracket `t^4 - 4t^2 + 8 - 8 exp (-t^2/2)` is integrable against `gaussianReal 0 v`\n(sums and scalar multiples of integrable functions). -/\ntheorem cm_integrable_bracket (v : NNReal) :\n Integrable (fun t : ℝ => t ^ 4 - 4 * t ^ 2 + 8 - 8 * Real.exp (-(t ^" + }, + { + "kind": "theorem", + "unqualified_name": "cm_integral_bracket", + "line": 305, + "source_header": "m_integrable_exp v).const_mul 8))\n\n/-- The integral of the bracket against `gaussianReal 0 (5/3)` is\n`25/3 - 20/3 + 8 - 8 sqrt (3/8)`: linearity, then the moments `∫ t^4 = 3 (5/3)^2`\n(`tm_fourth_moment`), `∫ t^2 = 5/3` (`c1_second_moment_gaussianReal`) and\n`∫ exp (-t^2/2) = sqrt (3/8)` (`tm_exp_moment`). -/\ntheorem cm_integral_bracket :\n ∫ t, (t ^ 4 - 4 * t ^ 2 + 8 - 8 * Real.exp (-(t ^ 2) / 2)) ∂(gaussianReal 0 (5 / 3 : NNReal)) =\n 25 / 3 -" + }, + { + "kind": "theorem", + "unqualified_name": "cm_setIntegral_Iio_even", + "line": 330, + "source_header": "l, tm_exp_moment]\n simp\n norm_num\n\n/-- For an even, measurable, integrable `h` and `v ≠ 0`, the integral of `1_{Iio 0} h` against\n`gaussianReal 0 v` is half the integral of `h`: the change of variables `t ↦ -t`\n(`gaussianReal_map_neg`, `integral_map`) equates the integrals over `Iio 0` and `Ioi 0`, and\n`integral_add_compl` with `integral_Ici_eq_integral_Ioi` (no atoms) adds them to the whole. -/\ntheorem cm_setIntegral_Iio_even (v : NNReal) (hv : v ≠ 0) (h : ℝ → ℝ) (hm : Measurable h)\n (heven : ∀ t, h (-t) = h t) (hint : Integrable h (gaussianReal 0 v)) :\n ∫ t, Set.indicator (Set.Iio 0) h t ∂(gaussianReal 0 v) =\n (" + }, + { + "kind": "theorem", + "unqualified_name": "cm_coneIntegrand_eq", + "line": 359, + "source_header": "dicator measurableSet_Iio]\n linarith\n\n/-! ## `cm_` (d): the cone integrand on the product space -/\n\n/-- `coneIntegrand q` is the indicator of `{q.1 < 0 ∧ q.2.1^2 + q.2.2^2 < q.1^2}` applied to\n`(q.1^2 - q.2.1^2 - q.2.2^2)^2` (`cm_cone_iff`, `cm_det_transverse`). -/\ntheorem cm_coneIntegrand_eq (q : ℝ × ℝ × ℝ) :\n coneIntegrand q = Set.indicator {q : ℝ × ℝ × ℝ | q.1 < 0 ∧ q.2.1 ^ 2 + q.2.2 ^ 2 < q.1 ^ 2}\n (fun q =>" + }, + { + "kind": "theorem", + "unqualified_name": "cm_measurable_coneIntegrand", + "line": 369, + "source_header": "fPred_eq, cm_cone_iff, cm_det_transverse]\n\n/-- `coneIntegrand` is measurable: by `cm_coneIntegrand_eq` it is a polynomial times the\nindicator of a measurable set (`measurableSet_lt`, `Measurable.indicator`). -/\ntheorem cm_measurab" + }, + { + "kind": "theorem", + "unqualified_name": "cm_coneIntegrand_bound", + "line": 382, + "source_header": "rable.indicator (by fun_prop) (h1.inter h2)\n\n/-- `|coneIntegrand q| ≤ q.1^4`: inside the cone `0 ≤ q.1^2 - q.2.1^2 - q.2.2^2 ≤ q.1^2`,\noutside it the integrand is `0`. -/\ntheorem cm_coneIntegrand_bound" + }, + { + "kind": "theorem", + "unqualified_name": "cm_integrable_coneIntegrand", + "line": 399, + "source_header": "< q.1 ^ 2} from h), norm_zero]\n positivity\n\n/-- `coneIntegrand` is integrable against `N(0, 5/3) ⊗ (N(0, 1) ⊗ N(0, 1))`: it is dominated by\n`q ↦ q.1^4`, integrable as a function of the first coordinate (`cm_integrable_pow_four`,\n`Integrable.comp_fst`, `Integrable.mono'`). -/\ntheorem cm_integrable_coneIntegrand :\n Integrable coneIntegrand ((gaussianReal 0 (5 / 3 : NNReal)).prod" + }, + { + "kind": "theorem", + "unqualified_name": "cm_coneIntegrand_neg", + "line": 409, + "source_header": "er.Eventually.of_forall cm_coneIntegrand_bound)\n\n/-- For `s < 0` the slice `p ↦ coneIntegrand (s, p)` is the closed-disk integrand\n`1{|p|^2 ≤ s^2} (s^2 - |p|^2)^2` (on the circle `|p|^2 = s^2` both sides vanish). -/\ntheorem cm_coneIntegrand_neg (s : ℝ) (p : ℝ × ℝ) (hs : s < 0) :\n coneIntegrand (s, p) = Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ s ^ 2}" + }, + { + "kind": "theorem", + "unqualified_name": "cm_coneIntegrand_nonneg", + "line": 425, + "source_header": ":= by linarith\n rw [he']\n norm_num\n · rfl\n\n/-- For `s ≥ 0` the slice `p ↦ coneIntegrand (s, p)` vanishes (the cone needs `s < 0`). -/\ntheorem cm_coneIntegrand_nonneg (s : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "cm_inner", + "line": 432, + "source_header": "y [Set.mem_ofPred_eq, not_and]\n intro h\n linarith\n\n/-- The inner integral: `∫ coneIntegrand (s, ·) d(N(0, 1) ⊗ N(0, 1))` is\n`1_{Iio 0}(s) (s^4 - 4s^2 + 8 - 8 exp (-s^2/2))` (`cm_coneIntegrand_neg` with\n`cm_gauss2_integral` at `a = s^2`, and `cm_coneIntegrand_nonneg`). -/\ntheorem cm_inner (s : ℝ) :\n ∫ p, coneIntegrand (s, p) ∂((gaussianReal 0 1).prod (gaussianReal 0 1)) =\n Set.indicator (Set.Iio 0)\n (fun t : ℝ => t" + }, + { + "kind": "theorem", + "unqualified_name": "coneMomentD2Identity", + "line": 452, + "source_header": "Integrand_nonneg s p hs))).trans ?_\n simp\n\nend Aux\n\n/-! ## The `m = 2` cone moment identity for every inhabitant of the interface -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ConeMomentD2Identity` (claim `side24-coefficient`), for every inhabitant `I : ConeMomentInterface`.\nMethod: transport along the law field `I.sxy_law` (`integral_map` after `Side24Interfaces.Aux.tm_aemeasurable_triple`), Fubini (`integral_prod`, with integrability from the bound `|coneIntegrand q| ≤ q.1^4`, `Aux.cm_integrable_coneIntegrand`), the cone identification `NegDefCone (s, x, y) ↔ s < 0 ∧ x^2 + y^2 < s^2` and `det A = s^2 - x^2 - y^2` (`Aux.cm_cone_iff`, `Aux.cm_det_transverse`), the inner planar Gaussian integral `s^4 - 4s^2 + 8 - 8 exp (-s^2/2)` for `s < 0` and `0` for `s ≥ 0` (`Aux.cm_inner`: `prod_withDensity`, polar coordinates `integral_comp_polarCoord_symm`, the substitution `z = r^2` onto `Side24Elementary.elementaryConeIntegral`), the symmetry halving of the even bracket under `gaussianReal 0 (5/3)` (`Aux.cm_setIntegral_Iio_even`), and the moments `25/3`, `5/3`, `sqrt (3/8)` (`Aux.cm_integral_bracket`, from `Side24Interfaces.Aux.tm_fourth_moment`, `c1_second_moment_gaussianReal`, `tm_exp_moment`).\nDoes not establish: the informal identity `D_2 = E[det(A)^2 1{A<0}] = (1/2)[25/3 - 20/3 + 8 - 8 sqrt(3/8)]` of the source as the source's object (the alignment of `ConeMomentInterface`, `transverseMatrix`, `NegDefCone`, `coneIntegrand` and `gaussianReal` with the source's objects is PENDING_INDEPENDENT_REVIEW); the source's Rayleigh integration route or its reduction of the cone to `s < -R` as the source's statements (the helper `Aux.cm_cone_iff` characterises the formal `NegDefCone` only, and `RayleighSquareLaw` is not used); integrability of the sample-space integrand under `I.P` as a separate statement (the integral is transported by `integral_map`, which needs only a.e.-measurability); that `D_2` is the parent's cone moment `D_u` of (15.1) for the reference law; that `ConeMomentInterface` has an inhabitant, or that its laws are the conditional law `A | V = 0` of the reference field; the value `29/6 - sqrt 6` (`ConeMomentD2Algebra`, not used here); any enclosure of the coefficient; the disposition of `side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the register, not derived here; nonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/\ntheorem coneMomentD2Identity (I : ConeMomentInt" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Interpolation.lean", + "sha256": "bdfd836ecc96910824e78249a19a12e74b99ac2f352bda1e9d5daa4f93ff03cb", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "f3_exp_one_gt", + "line": 62, + "source_header": "x\n\n/-! ## (F3) The enclosure of `rho_star`\n\n### A 29-decimal enclosure of `e` from the degree-26 Taylor bound -/\n\n/-- `2.71828182845904523536028746620 < e`: the 26-term Taylor sum of `exp 1` minus the tail bound\n`27 / (26! * 26)` of `Real.exp_bound`, evaluated exactly by `norm_num`. -/\ntheorem f3_exp_one_gt : (271828182845904523536028746620 : ℝ) / 10 ^ 29 < Real." + }, + { + "kind": "theorem", + "unqualified_name": "f3_exp_one_lt", + "line": 75, + "source_header": "arith\n\n/-- `e < 2.71828182845904523536028747136`: the 26-term Taylor sum of `exp 1` plus the tail bound\n`27 / (26! * 26)` of `Real.exp_bound`, evaluated exactly by `norm_num`. -/\ntheorem f3_exp_one_lt : Real.exp 1 < (271828182845904523536028747136 : ℝ) /" + }, + { + "kind": "theorem", + "unqualified_name": "f3_exp_xU_ge", + "line": 84, + "source_header": "inarith\n\n/-! ### Degree-16 Taylor enclosures of `exp x_U` and `exp x_L`\n\n`x_U = 1 - 1/rhoStarUpper = -3863004568775331983 / 21136995431224668017` (reduced) and\n`x_L = 1 - 1/rhoStarLower = -15452018275101327933 / 84547981724898672067`, both about `-0.18276`. -/\n\n/-- Lower bound `0.83296775704110158100003160908803 ≤ exp x_U` from `Real.exp_bound` at degree 16. -/\ntheorem f3_exp_xU_ge :\n (83296775704110158100003160908803 : ℝ) / 10 ^ 32 ≤\n Real.exp (-3863004568775331983 / 2113699543" + }, + { + "kind": "theorem", + "unqualified_name": "f3_exp_xL_le", + "line": 101, + "source_header": "linarith\n\n/-- Upper bound `exp x_L ≤ 0.83296775704110158098837919695330` from `Real.exp_bound` at degree 16. -/\ntheorem f3_exp_xL_le :\n Real.exp (-15452018275101327933 / 84547981724898672067) ≤\n (83296775704110158098837919695330 :" + }, + { + "kind": "theorem", + "unqualified_name": "f3_log_lt", + "line": 113, + "source_header": "h1\n linarith\n\n/-! ### The two logarithmic inequalities -/\n\n/-- `log(3e - 2) < 2 + x_U = 3 - 1/rhoStarUpper`: equivalently `3e - 2 < (exp 1)^2 * exp x_U`,\nwith `e` and `exp x_U` replaced by their rational bounds (`norm_num` margin about `1.08e-20`). -/\ntheorem f3_log_lt :\n Real.log (3 * Real.exp 1 - 2) < 2 + (-3863004568775331983 / 21136995" + }, + { + "kind": "theorem", + "unqualified_name": "f3_lt_log", + "line": 136, + "source_header": "rm_num\n linarith\n\n/-- `2 + x_L = 3 - 1/rhoStarLower < log(3e - 2)`: equivalently `(exp 1)^2 * exp x_L < 3e - 2`,\nwith `e` and `exp x_L` replaced by their rational bounds (`norm_num` margin about `7.53e-20`). -/\ntheorem f3_lt_log :\n 2 + (-15452018275101327933 / 84547981724898672067 : ℝ) < Real.log (" + }, + { + "kind": "theorem", + "unqualified_name": "f3_hStar_pos", + "line": 157, + "source_header": "norm_num\n linarith\n\n/-! ### The three conjuncts of (F3) -/\n\n/-- `0 < h_star` written out, from `one_lt_hStar`. -/\ntheorem f3_hStar_pos : (0 : ℝ) < 3 - Real.l" + }, + { + "kind": "theorem", + "unqualified_name": "f3_rhoStar_lt_upper", + "line": 165, + "source_header": "d hStar at h\n linarith\n\n/-- `rho_star < rhoStarUpper`. -/\ntheorem f3_rhoStar_lt_upper" + }, + { + "kind": "theorem", + "unqualified_name": "f3_lower_lt_rhoStar", + "line": 172, + "source_header": "h := f3_log_lt\n linarith\n\n/-- `rhoStarLower < rho_star`. -/\ntheorem f3_lower_lt_rhoSt" + }, + { + "kind": "theorem", + "unqualified_name": "f3_upper_lt_six_sevenths", + "line": 179, + "source_header": "e h := f3_lt_log\n linarith\n\n/-- `rhoStarUpper < 6/7`, a rational inequality. -/\ntheorem f3_upper_lt_six_se" + }, + { + "kind": "def", + "unqualified_name": "cc_wOther", + "line": 186, + "source_header": "Upper\n norm_num\n\nopen Finset\n\n/-! ## (F4), (F5) The split of the product weight at one coordinate and separate concavity -/\n\n/-- The weight of `U` over the coordinates other than `i`: `prod_{v in U, v ≠ i} p_v *\nprod_{v notin U, v ≠ i} (1 - p_v)`. -/\nnoncomputable def cc_wOther {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y →" + }, + { + "kind": "theorem", + "unqualified_name": "cc_wOther_nonneg", + "line": 194, + "source_header": "v ∈ (univ \\ U).erase i, (1 - p v)\n\n/-- The reduced weight is nonnegative when every `p_v` lies in `[0, 1]`. -/\ntheorem cc_wOther_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Y) (" + }, + { + "kind": "theorem", + "unqualified_name": "cc_wOther_empty_pos", + "line": 201, + "source_header": "un v _ => ?_)\n linarith [(hp v).2]\n\n/-- The reduced weight of the empty set is positive when every `p_v < 1`. -/\ntheorem cc_wOther_empty_pos {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}\n (hp : ∀ v, p" + }, + { + "kind": "theorem", + "unqualified_name": "cc_wOther_erase", + "line": 208, + "source_header": "rod_pos fun v _ => by linarith [hp v]\n\n/-- Erasing the distinguished coordinate does not change the reduced weight. -/\ntheorem cc_wOther_erase {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) (i : Y)\n (U : Finset Y) : cc_w" + }, + { + "kind": "theorem", + "unqualified_name": "cc_prod_split_at", + "line": 219, + "source_header": "univ, true_and]\n tauto\n rw [h1, h2]\n\n/-- A finite product splits off the factor at `i` when `i` belongs to the index set. -/\ntheorem cc_prod_split_at {Y : Type} [DecidableEq Y] (s : Finset Y) (f : Y → ℝ) (i : Y) :\n ∏ v ∈ s, f v = (if i ∈" + }, + { + "kind": "theorem", + "unqualified_name": "cc_weight_update", + "line": 226, + "source_header": "h, one_mul, Finset.erase_eq_of_notMem h]\n\n/-- The weight of `U` under `p` with coordinate `i` replaced by `x`: the factor at `i` is\n`x` or `1 - x` according to `i ∈ U`, times the reduced weight. -/\ntheorem cc_weight_update {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) (i : Y) (x : ℝ)\n (U : Finset Y) :\n weight (Function.update p i x) U = (if" + }, + { + "kind": "theorem", + "unqualified_name": "cc_muOf_update", + "line": 249, + "source_header": "ite_eq_left hi', ite_eq_right hi]\n ring\n\n/-- Display (F4): the split of `mu_p(A)` at coordinate `i`, for any family `A` (general finite\nground type). -/\ntheorem cc_muOf_update {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))\n (p : Y → ℝ) (i : Y) (x : ℝ) :\n muOf A (Function.update p i x) =\n x * ∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i U\n + (1 - x) * ∑ U" + }, + { + "kind": "theorem", + "unqualified_name": "cc_sum_in_le_sum_out", + "line": 260, + "source_header": "nset.sum_ite, Finset.mul_sum, Finset.mul_sum]\n\n/-- For a downset, the sum over the members containing `i` is at most the sum over the members\navoiding `i` (`U ↦ U.erase i` injects the first into the second and preserves `cc_wOther`). -/\ntheorem cc_sum_in_le_sum_out {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p : Y → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Y) :\n ∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i U\n ≤ ∑" + }, + { + "kind": "theorem", + "unqualified_name": "cc_sum_out_pos", + "line": 288, + "source_header": "neg himg (fun U _ _ => cc_wOther_nonneg hp i U)\n\n/-- The sum over the members avoiding `i` is positive once `∅ ∈ A` and every `p_v < 1`. -/\ntheorem cc_sum_out_pos {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (h0 : ∅ ∈ A) {p : Y → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v < 1) (i : Y) :\n 0 <" + }, + { + "kind": "theorem", + "unqualified_name": "cc_muOf_update_antitone", + "line": 298, + "source_header": "e_sum (fun U _ => cc_wOther_nonneg hp1 i U) hmem)\n\n/-- `mu_p(A)` is antitone in each coordinate for a downset and `p` in the cube. -/\ntheorem cc_muOf_update_antitone {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p : Y → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Y) {x y : ℝ} (hxy : x ≤ y) :\n muOf A (Func" + }, + { + "kind": "theorem", + "unqualified_name": "cc_affineExp_pos", + "line": 307, + "source_header": "th [mul_nonneg (sub_nonneg.2 hxy) (sub_nonneg.2 h)]\n\n/-! ### The one-variable function `s ↦ -log(a + b exp(-s))` (display (F5)) -/\n\n/-- `a + b exp(-s) > 0` for `a, b ≥ 0` with `a + b > 0`. -/\ntheorem cc_affineExp_pos {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (h" + }, + { + "kind": "theorem", + "unqualified_name": "cc_hasDerivAt_negLog", + "line": 320, + "source_header": ":= by linarith\n have := mul_pos hb' he\n linarith\n\n/-- First derivative: `d/ds (-log(a + b e^{-s})) = b e^{-s} / (a + b e^{-s})`. -/\ntheorem cc_hasDerivAt_negLog {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : 0 < a + b) (s : ℝ) :\n HasDerivAt (fun x => -Real.log (a + b * Real.exp (-x" + }, + { + "kind": "theorem", + "unqualified_name": "cc_hasDerivAt_ratio", + "line": 330, + "source_header": ":= (h1.log hpos.ne').neg\n exact h2.congr_deriv (by ring)\n\n/-- Second derivative: `d/ds (b e^{-s} / (a + b e^{-s})) = -a b e^{-s} / (a + b e^{-s})^2`. -/\ntheorem cc_hasDerivAt_ratio {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : 0 < a + b) (s : ℝ) :\n HasDerivAt (fun x => b * Real.exp (-x) / (a + b * Real.exp (-x)))" + }, + { + "kind": "theorem", + "unqualified_name": "cc_concaveOn_negLog", + "line": 342, + "source_header": "h := hnum.div hden hpos.ne'\n exact h.congr_deriv (by ring)\n\n/-- Display (F5), one variable: `s ↦ -log(a + b exp(-s))` is concave on `[0, 1]` for\n`a, b ≥ 0`, `a + b > 0` (`concaveOn_of_deriv2_nonpos`). -/\ntheorem cc_concaveOn_negLog {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : 0 < a + b) :\n ConcaveOn ℝ (Se" + }, + { + "kind": "theorem", + "unqualified_name": "cc_hazardCoord_update_eq", + "line": 365, + "source_header": "b) (Real.exp_pos _).le\n linarith\n · exact sq_nonneg _\n\n/-! ### Assembly of (F5) -/\n\n/-- `F_A(t[i := s])` is `-log mu(A)` at `p(t)` with coordinate `i` replaced by `1 - exp(-s)`. -/\ntheorem cc_hazardCoord_update_eq {Y : Type} [Fintype Y] [DecidableEq Y]\n (A : Finset (Finset Y)) (t : Y → ℝ) (i : Y) (s : ℝ) :\n hazardCoord A (Function.update t i s) =\n -Real.log (muOf A (Function.upda" + }, + { + "kind": "theorem", + "unqualified_name": "cc_concaveOn_hazardCoord_update", + "line": 383, + "source_header": "rw [Function.update_of_ne hj, Function.update_of_ne hj]\n rw [h]\n\n/-- Display (F5) on a general finite ground type: for a downset containing `∅` and `t` in the\ncube, `s ↦ F_A(t[i := s])` is concave on `[0, 1]`. -/\ntheorem cc_concaveOn_hazardCoord_update {Y : Type} [Fintype Y] [DecidableEq Y]\n {A : Finset (Finset Y)} (h0 : ∅ ∈ A) (hdown : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A)\n (i : Y) (t : Y → ℝ) (ht : ∀ j, 0 ≤ t j ∧ t j ≤ 1) :\n ConcaveOn ℝ (Set." + }, + { + "kind": "theorem", + "unqualified_name": "f6_muOf_le_one", + "line": 416, + "source_header": "exact cc_concaveOn_negLog hSin0 (sub_nonneg.2 hle) (by linarith)\n\n/-! ## (F6) The hazard product bound `F_A(t) ≥ (prod_i t_i) H_A`\n\n### Elementary bounds on `mu_p(A)` and on the hazard `F_A` -/\n\n/-- `mu_p(A) ≤ 1` for `p` in the cube: `A ⊆ univ.powerset`, the weights are nonnegative\n(`weight_nonneg`) and all of them sum to one (`sum_weight_eq_one`). -/\ntheorem f6_muOf_le_one {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (" + }, + { + "kind": "theorem", + "unqualified_name": "f6_muOf_nonneg", + "line": 430, + "source_header": "(fun U _ _ => UniversalLaw.Proofs.P15Budget.Aux.weight_nonneg hp U)\n\n/-- `0 ≤ mu_p(A)` for `p` in the cube. -/\ntheorem f6_muOf_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset" + }, + { + "kind": "theorem", + "unqualified_name": "f6_one_sub_exp_neg_mem", + "line": 435, + "source_header": "um_nonneg fun U _ => UniversalLaw.Proofs.P15Budget.Aux.weight_nonneg hp U\n\n/-- `1 - exp(-u) ∈ [0, 1]` for `u ∈ [0, 1]` (indeed for every `u ≥ 0`). -/\ntheorem f6_one_sub_exp_neg_mem {u :" + }, + { + "kind": "theorem", + "unqualified_name": "f6_coords_mem", + "line": 444, + "source_header": "linarith [hu.1])\n linarith\n · have h := Real.exp_pos (-u)\n linarith\n\n/-- The coordinates `p_j(u) = 1 - exp(-u_j)` lie in the cube when `u` does. -/\ntheorem f6_coords_mem {Y : Type} {u : Y → ℝ} (hu : ∀ j, 0" + }, + { + "kind": "theorem", + "unqualified_name": "f6_hazardCoord_nonneg", + "line": 449, + "source_header": "(-u v) ∧ 1 - Real.exp (-u v) ≤ 1 :=\n fun v => f6_one_sub_exp_neg_mem (hu v)\n\n/-- `0 ≤ F_A(u)` on the cube: `-log m ≥ 0` for `0 ≤ m ≤ 1` (`Real.log_nonpos`; `log 0 = 0`, so\nno positivity of `mu` is needed). -/\ntheorem f6_hazardCoord_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset" + }, + { + "kind": "theorem", + "unqualified_name": "f6_hazardCoord_one", + "line": 458, + "source_header": "ave h := Real.log_nonpos (f6_muOf_nonneg A hp) (f6_muOf_le_one A hp)\n linarith\n\n/-- `F_A(1, …, 1) = H_A`, since `1 - exp(-1) = p_star`. -/\ntheorem f6_hazardCoord_one {Y : Type} [Fintype Y] [DecidableEq" + }, + { + "kind": "theorem", + "unqualified_name": "f6_chord", + "line": 464, + "source_header": "un _ => (1 : ℝ)) = hazardStar A := by\n unfold hazardCoord hazardStar pStar\n rfl\n\n/-! ### The chord inequality and its iteration -/\n\n/-- Chord inequality at one coordinate: if `s ↦ F_A(update u i s)` is concave on `[0, 1]` and\n`u` lies in the cube, then `u_i · F_A(update u i 1) ≤ F_A(u)`. -/\ntheorem f6_chord {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y)) (i : Y)\n (u : Y → ℝ) (hu : ∀ j, 0 ≤ u j ∧ u j ≤ 1)\n (hconc : ConcaveOn ℝ (Set.Icc (0 : ℝ) 1)\n (fun s : ℝ => hazardCoord A (Functio" + }, + { + "kind": "theorem", + "unqualified_name": "f6_raised_mem", + "line": 488, + "source_header": "ne hj]\n exact hu j\n have hprod := mul_nonneg (sub_nonneg.2 hs.2) hf0\n linarith\n\n/-- The vector `u_s` which equals `1` on `s` and `t` elsewhere lies in the cube when `t` does. -/\ntheorem f6_raised_mem {Y : Type} [DecidableEq Y] {t : Y → ℝ} (ht : ∀ j, 0 ≤ t j ∧ t j ≤ 1)\n (s : Finset Y)" + }, + { + "kind": "theorem", + "unqualified_name": "f6_raised_insert", + "line": 497, + "source_header": "t j) ≤ 1 := by\n intro j\n split_ifs\n · exact ⟨zero_le_one, le_refl 1⟩\n · exact ht j\n\n/-- Raising one more coordinate: `u_{insert a s} = update u_s a 1`. -/\ntheorem f6_raised_insert {Y : Type} [DecidableEq Y] (t : Y → ℝ) (a : Y) (s : Finset Y) :\n (fun j => if j ∈ insert a s the" + }, + { + "kind": "theorem", + "unqualified_name": "f6_prod_hazardCoord_le", + "line": 507, + "source_header": "y\n funext j\n by_cases hj : j = a\n · subst hj\n simp\n · simp [Finset.mem_insert, hj]\n\n/-- Iterated chord inequality: for every finite set `s` of coordinates,\n`(prod_{j ∈ s} t_j) · F_A(u_s) ≤ F_A(t)`, where `u_s` is `t` with the coordinates in `s` raised\nto `1`. Induction over `s` (`Finset.induction_on`) with `f6_chord` at each step. -/\ntheorem f6_prod_hazardCoord_le {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))\n (hconc : ∀ (i : Y) (u : Y → ℝ), (∀ j, 0 ≤ u j ∧ u j ≤ 1) →\n ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) (fun s : ℝ => hazardCoord A (Function.update u i s)))\n (t : Y → ℝ) (ht : ∀ j, 0 ≤ t j ∧ t j ≤ 1) (s : Finset Y) :\n (∏ j" + }, + { + "kind": "theorem", + "unqualified_name": "f6_hazardProductBound_of_concavity", + "line": 533, + "source_header": "se t j) :=\n mul_le_mul_of_nonneg_left hchord hprod\n _ ≤ hazardCoord A t := ih\n\n/-- Display (F6) from display (F5): assuming `CoordinatewiseConcavity`, the hazard product bound\nholds. Takes `s = univ` in `f6_prod_hazardCoord_le`, where `u_univ = (1, …, 1)` and\n`F_A(1, …, 1) = H_A` (`f6_hazardCoord_one`). -/\ntheorem f6_hazardProductBound_of_concavity (h5 :" + }, + { + "kind": "theorem", + "unqualified_name": "f7_phi_nonneg", + "line": 550, + "source_header": "n _ => (1 : ℝ) := by\n funext j\n simp\n rw [hfun, f6_hazardCoord_one] at key\n exact key\n\n/-! ## (F7) The hazard `phi` bound `-log mu_p(A) ≥ H_A prod_i phi(p_i)`\n\n### (a) The transformed price `phi` maps `[0,1]` into `[0,1]` -/\n\n/-- `0 ≤ phi x` for `x ≥ 0`: when `x < 1`, `" + }, + { + "kind": "theorem", + "unqualified_name": "f7_phi_le_one", + "line": 563, + "source_header": "log (1 - x) ≤ 0 := Real.log_nonpos (by linarith) (by linarith)\n linarith\n ·" + }, + { + "kind": "theorem", + "unqualified_name": "f7_phi_mem", + "line": 570, + "source_header": "ℝ) : phi x ≤ 1 := by\n unfold phi\n split_ifs with h\n · exact min_le_left _ _\n · exact le_refl 1\n\n/-- `phi`" + }, + { + "kind": "theorem", + "unqualified_name": "f7_one_sub_exp_neg_phi_nonneg", + "line": 574, + "source_header": "i_mem {x : ℝ} (hx : 0 ≤ x ∧ x ≤ 1) : 0 ≤ phi x ∧ phi x ≤ 1 :=\n ⟨f7_phi_nonneg hx.1, f7_phi_le_one x⟩\n\n/-! ### (b) `p' = 1 - exp(-phi p)` lies in `[0, p]` -/\n\n/-- `0 ≤ 1 - exp(-phi x)` for `x ≥ 0` (sinc" + }, + { + "kind": "theorem", + "unqualified_name": "f7_one_sub_exp_neg_phi_le", + "line": 581, + "source_header": "by\n have h : Real.exp (-phi x) ≤ 1 := Real.exp_le_one_iff.2 (by linarith [f7_phi_nonneg hx])\n linarith\n\n/-- `1 - exp(-phi x) ≤ x` on `[0,1]`: for `x < 1`, `phi x ≤ -log(1 - x)` so\n`exp(-phi x) ≥ exp(log(1 - x)) = 1 - x`; for `x = 1`, `1 - exp(" + }, + { + "kind": "theorem", + "unqualified_name": "f7_mix_mem", + "line": 603, + "source_header": "unfold phi\n rw [ite_eq_right h]\n rw [hphi, hx1]\n have := Real.exp_pos (-1 : ℝ)\n linarith\n\n/-! ### (c) Antitonicity of `mu_p(A)` in the probability vector (from the split (F4)) -/\n\n/-- The interpolating vector `r_s` (`q` on `s`, `p` elsewhere) lies in the cube when both do. -/\ntheorem f7_mix_mem {Y : Type} [DecidableEq Y] {p q : Y → ℝ} (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1)\n (hq : ∀ j, 0" + }, + { + "kind": "theorem", + "unqualified_name": "f7_mix_insert", + "line": 614, + "source_header": "then q j else p j) ∧ (if j ∈ s then q j else p j) ≤ 1 := by\n intro j\n split_ifs\n · exact hq j\n · exact hp j\n\n/-- Switching one more coordinate to `q`: `r_{insert a s} = update r_s a (q a)`. -/\ntheorem f7_mix_insert {Y : Type} [DecidableEq Y] (p q : Y → ℝ) (a : Y) (s : Finset Y) :\n (fu" + }, + { + "kind": "theorem", + "unqualified_name": "f7_mix_eq_update_self", + "line": 624, + "source_header": "j else p j) a (q a) := by\n funext j\n by_cases hj : j = a\n · subst hj\n simp\n · simp [Finset.mem_insert, hj]\n\n/-- For `a ∉ s`, `r_s` is its own update at `a` by `p a`. -/\ntheorem f7_mix_eq_update_self {Y : Type} [DecidableEq Y] (p q : Y → ℝ) (a : Y) (s : Finset Y)\n (ha : a ∉ s" + }, + { + "kind": "theorem", + "unqualified_name": "f7_muOf_le_mix", + "line": 635, + "source_header": "if j ∈ s then q j else p j) a (p a) := by\n funext j\n by_cases hj : j = a\n · subst hj\n simp [ha]\n · simp [hj]\n\n/-- Moving from `p` down to `q` one coordinate at a time: for every finite set `s` of\ncoordinates, `mu_p(A) ≤ mu_(r_s)(A)` (induction over `s`, `cc_muOf_update_antitone` at each\nstep). -/\ntheorem f7_muOf_le_mix {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p q : Y → ℝ}\n (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1) (hq : ∀ j, 0 ≤ q" + }, + { + "kind": "theorem", + "unqualified_name": "f7_muOf_antitone", + "line": 652, + "source_header": "(hqp a)\n rw [← f7_mix_eq_update_self p q a s ha] at hstep\n rw [f7_mix_insert p q a s]\n exact ih.trans hstep\n\n/-- Antitonicity of `mu(A)` in the probability vector for a downset: `q ≤ p` pointwise, both in\nthe cube, gives `mu_p(A) ≤ mu_q(A)`. -/\ntheorem f7_muOf_antitone {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p q :" + }, + { + "kind": "theorem", + "unqualified_name": "f7_hazardPhiBound_of_productBound", + "line": 665, + "source_header": ": (fun j : Y => if j ∈ (univ : Finset Y) then q j else p j) = q := by\n funext j\n simp\n rw [hfun] at h\n exact h\n\n/-! ### (d) Display (F7) from display (F6) -/\n\n/-- Display (F7) from display (F6): assuming `HazardProductBound`, the hazard `phi` bound holds.\nWith `t_i := phi(p_i) ∈ [0,1]` and `p'_i := 1 - exp(-t_i) ∈ [0, p_i]`, antitonicity gives\n`0 < mu_p(A) ≤ mu_p'(A)`, so `-log mu_p(A) ≥ -log mu_p'(A) = F_A(t) ≥ (prod_i t_i) H_A`. -/\ntheorem f" + }, + { + "kind": "theorem", + "unqualified_name": "f8_prod_phi_le_one", + "line": 690, + "source_header": ":= mul_comm _ _\n _ ≤ -Real.log (muOf A (fun j => 1 - Real.exp (-phi (p j)))) := h6'\n _ ≤ -Real.log (muOf A p) := hlog\n\n/-! ## (F8) The full-ground price bound -/\n\n/-- `prod_i phi(p_i) ≤ 1` for `p ∈ [0, 1]^n`, from `0 ≤ phi ≤ 1` on `[0, 1]`\n(`Fins" + }, + { + "kind": "theorem", + "unqualified_name": "f8_prod_le_prod_phi", + "line": 698, + "source_header": "p j ≤ 1) :\n ∏ i, phi (p i) ≤ 1 :=\n Finset.prod_le_one₀ (fun i _ => f7_phi_nonneg (hp i).1) (fun i _ => f7_phi_le_one (p i))\n\n/-- `prod_i c_i ≤ prod_i phi(p_i)` for `0 ≤ c_i ≤ phi(p_i)` (`Finset.prod_le_prod₀`" + }, + { + "kind": "theorem", + "unqualified_name": "f8_fullGroundPriceBound_of_phiBound", + "line": 703, + "source_header": "0 ≤ c j ∧ c j ≤ phi (p j)) :\n ∏ i, c i ≤ ∏ i, phi (p i) :=\n Finset.prod_le_prod₀ (fun i _ => (hc i).1) (fun i _ => (hc i).2)\n\n/-- Display (F8) from display (F7): given `HazardPhiBound`, the full-ground price bound holds.\nFix `n`, a proper downset `A` on `Fin n`, `p ∈ [0, 1]^n` and `0 ≤ c ≤ phi ∘ p`. The cap `1` is\n`f8_prod_le_prod_phi` and `f8_prod_phi_le_one`; when `0 < mu_p(A)`, (F7) gives\n`H_A prod_i phi(p_i) ≤ -log mu_p(A)` and `0 < H_A` (`P15Elementary.hazardStarPositive`), so\n`prod_i phi(p_i) = H_A⁻¹ (H_A prod_i phi(p_i)) ≤ H_A⁻¹ [-log mu_p(A)]` (`inv_mul_cancel_left₀`,\n`mul_le_mul_of_nonneg_left`); `P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard. -/\ntheor" + }, + { + "kind": "theorem", + "unqualified_name": "bi_prod_phi_nonneg", + "line": 725, + "source_header": ":=\n mul_le_mul_of_nonneg_left h7' (inv_nonneg.mpr hH.le)\n _ = 1 / hazardStar A * -Real.log (muOf A p) := by rw [one_div]\n\n/-! ## (F8), exactness remark: the full-ground budget equivalence -/\n\n/-- `0 ≤ prod_i phi(p_i)` for `p ∈ [0, 1]^" + }, + { + "kind": "theorem", + "unqualified_name": "bi_budget_of_one_le_hazardStar", + "line": 732, + "source_header": "n : ℕ} (p : Fin n → ℝ) (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1) :\n 0 ≤ ∏ i, phi (p i) :=\n Finset.prod_nonneg fun i _ => f7_phi_nonneg (hp i).1\n\n/-- The (⇐) direction, display (F8) with `rho = 1`: given display (F7) and `1 ≤ H_A`, every\n`p ∈ [0, 1]^n` and `0 ≤ c ≤ phi ∘ p` satisfy `prod_i c_i ≤ cappedHazard 1 (mu_p(A))`. The cap\n`1` is `f8_prod_le_prod_phi` and `f8_prod_phi_le_one`; when `0 < mu_p(A)`,\n`prod_i phi(p_i) ≤ H_A prod_i phi(p_i)` (`le_mul_of_one_le_left`, from `0 ≤ prod_i phi(p_i)`\nand `1 ≤ H_A`) and `H_A prod_i phi(p_i) ≤ -log mu_p(A)` by (F7);\n`P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard. -/\ntheorem bi_budget_of_one_le_hazardStar (h7 : UniversalLaw.Spec.P15.HazardPhiBound) {n : ℕ}\n {A : Finset (Finset (Fin n))} (hn : 1 ≤ n) (hA : IsProperDownset A)\n (h1 : 1 ≤ hazardSta" + }, + { + "kind": "theorem", + "unqualified_name": "bi_muOf_pStar_pos", + "line": 753, + "source_header": "∏ i, phi (p i) := le_mul_of_one_le_left hphi0 h1\n _ ≤ -Real.log (muOf A p) := h7'\n _ = 1 * -Real.log (muOf A p) := (one_mul _).symm\n\n/-- `0 < mu_{p_star}(A)` for a proper downset `A`: every weight at the constant vector\n`p_star ∈ (0, 1)` is nonnegative (`P15Budget.Aux.weight_nonneg`), and the member `∅ ∈ A`\ncontributes `prod_{v} (1 - p_star) > 0` (`Finset.prod_pos`), so `Finset.single_le_sum` giv" + }, + { + "kind": "theorem", + "unqualified_name": "bi_one_le_hazardStar_of_budget", + "line": 772, + "source_header": "show (0 : ℝ) < 1 - pStar\n linarith\n unfold muOf\n exact lt_of_lt_of_le hempty_w (Finset.single_le_sum (fun U _ => hw_nonneg U) hA.1)\n\n/-- The (⇒) direction: if every `p ∈ [0, 1]^n` and `0 ≤ c ≤ phi ∘ p` satisfy\n`prod_i c_i ≤ cappedHazard 1 (mu_p(A))`, then `1 ≤ H_A`. Instantiate at `p ≡ p_star`, `c ≡ 1`,\nadmissible since `0 ≤ p_star ≤ 1` and `phi p_star = 1` (`P15Elementary.phiAtPStar`); then\n`prod_i 1 = 1` (`Finset.prod_const_one`), `0 < mu_{p_star}(A)` (`bi_muOf_pStar_pos`) selects\nthe branch `min 1 (1 * -log mu_{p_star}(A))` of `cappedHazard`, and `le_min_iff` extracts\n`1 ≤ -log mu_{p_star}(A)`, which is `hazardStar A` by definition. -/\ntheorem bi_one_le_hazardStar_of_budget {n : ℕ} {A : Finset (Finset (Fin n))}\n (hA : IsProperDownset A)\n (hall : ∀ (p c :" + }, + { + "kind": "theorem", + "unqualified_name": "bi_fullGroundBudgetIff_of_phiBound", + "line": 799, + "source_header": ":= bi_muOf_pStar_pos hA\n unfold cappedHazard at h\n simp only [hm, ↓reduceIte, one_mul] at h\n unfold hazardStar\n exact (le_min_iff.1 h).2\n\n/-- The budget equivalence from display (F7): given `HazardPhiBound`, for `n ≥ 1` and a proper\ndownset `A` on `Fin n`, the universal capped budget at `rho = 1` holds iff `1 ≤ H_A`. The two\ndirections are `bi_one_le_hazardStar_of_budget` and `bi_budget_of_one_le_hazardS" + }, + { + "kind": "theorem", + "unqualified_name": "lp_capacityFamily_properDownset", + "line": 811, + "source_header": "tro hall\n exact bi_one_le_hazardStar_of_budget hA hall\n · intro h1 p c hp hc\n exact bi_budget_of_one_le_hazardStar h7 hn hA h1 p c hp hc\n\n/-! ## (F12) The local price bound\n\n### Elementary facts -/\n\n/-- The capacity family `{T ⊆ Fin n : |T| ≤ a}` is a proper downset when `a < n`: it contains\nthe empty set, misses `univ` (of size `n > a" + }, + { + "kind": "theorem", + "unqualified_name": "lp_exists_enum", + "line": 831, + "source_header": "hVU\n have hU' : U.card ≤ a := (mem_filter.mp hU).2\n exact mem_filter.mpr ⟨mem_powerset.mpr (subset_univ V), le_trans (card_le_card hVU) hU'⟩\n\n/-! ### Enumerating a finite set by `Fin (card)` -/\n\n/-- Every `B : Finset X` is enumerated injectively by `Fin B.card`, w" + }, + { + "kind": "theorem", + "unqualified_name": "lp_map_univ_eq", + "line": 846, + "source_header": "ype.ext h)\n · intro v\n constructor\n · intro hv\n exact ⟨B.equivFin ⟨v, hv⟩, by simp⟩\n · rintro ⟨k, rfl⟩\n exact (B.equivFin.symm k).2\n\n/-- An injection `e : Fin n → X` with range `B` maps `univ` onto `B`. -/\ntheorem lp_map_univ_eq {X : Type}" + }, + { + "kind": "theorem", + "unqualified_name": "lp_prod_univ_eq", + "line": 854, + "source_header": "k = v) :\n (univ : Finset (Fin n)).map ⟨e, he⟩ = B := by\n ext v\n rw [hrange v]\n simp only [mem_map, mem_univ, true_and, Function.Embedding.coeFn_mk]\n\n/-- Products over `B` are products over `Fin n` along the enumeration. -/\ntheorem lp_prod_univ_eq {X : Type" + }, + { + "kind": "theorem", + "unqualified_name": "lp_map_filter_eq", + "line": 861, + "source_header": "tive e) (hrange : ∀ v, v ∈ B ↔ ∃ k, e k = v) (f : X → ℝ) :\n ∏ k, f (e k) = ∏ v ∈ B, f v := by\n rw [← lp_map_univ_eq e he hrange, Finset.prod_map]\n rfl\n\n/-- For `S ⊆ B`, the image of the preimage `{k : e k ∈ S}` is `S`. -/\ntheorem lp_map_filter_eq {X : Type} [DecidableEq X] {B : Finset X} {n : ℕ} (e : Fin n → X)\n (he : Functio" + }, + { + "kind": "theorem", + "unqualified_name": "lp_filter_map_eq", + "line": 875, + "source_header": "ction.Embedding.coeFn_mk]\n constructor\n · rintro ⟨k, hk, rfl⟩\n exact hk\n · intro hv\n obtain ⟨k, rfl⟩ := (hrange v).mp (hS hv)\n exact ⟨k, hv, rfl⟩\n\n/-- The preimage of the image of `T` is `T` (injectivity of the enumeration). -/\ntheorem lp_filter_map_eq {X : Type} [Deci" + }, + { + "kind": "theorem", + "unqualified_name": "lp_localGood_eq_muOf", + "line": 887, + "source_header": "ter, mem_univ, true_and, mem_map, Function.Embedding.coeFn_mk]\n constructor\n · rintro ⟨a, ha, hak⟩\n rwa [he hak] at ha\n · intro hk\n exact ⟨k, hk, rfl⟩\n\n/-! ### Transport of the local good probability to the capacity family -/\n\n/-- Along an enumeration `e : Fin n → X` of the block `X_i`, the local good probability\n`mu_p(D_i)` is the product measure of the capacity family `{T : |T| ≤ a_i}` on `Fin n` under\nthe transported vector `p ∘ e`. Uses `LocalRestriction` (a block subset is good iff its size is\nat most `a_i`) and the bijection `T ↦ T.map e` between subsets of `Fin n` and subsets of the\nblock, which preserves size and matches the two weight products. -/\ntheorem lp_localGood_eq_muOf {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) (p : X → ℝ) (i : Fin F.b) {n : ℕ} (e :" + }, + { + "kind": "theorem", + "unqualified_name": "lp_localPriceBoundFull_of_phiBound", + "line": 943, + "source_header": ".map ⟨e, he⟩, p v) * ∏ v ∈ block F i \\ T.map ⟨e, he⟩, (1 - p v)\n unfold weight\n rw [Finset.prod_map, ← hmapuniv, ← Finset.map_sdiff, Finset.prod_map]\n rfl\n\n/-! ### Display (F12) in hypothesis form -/\n\n/-- Display (F12) under the hypothesis `HazardPhiBound` (display (F7)): for every realized\nfamily with `d_i ≥ 2`, every `p ∈ [0,1]^X`, every `0 ≤ c_v ≤ phi(p_v)` and every block with\n`mu_p(D_i) > 0`, `price(X_i) ≤ rho_star · (-log mu_p(D_i))` and `price(X_i) ≤ 1`. -/\ntheorem lp_localPriceBoundFull_of" + }, + { + "kind": "theorem", + "unqualified_name": "f2_rhoStar_nonneg", + "line": 1004, + "source_header": "od]\n _ ≤ -Real.log (localGood F p i) := h7'\n have hrho : rhoStar = 1 / hStar := rfl\n rw [hrho, one_div, inv_mul_eq_div, le_div_iff₀ hhpos, mul_comm]\n exact key\n\n/-! ## (F2) The full transformed-price budget -/\n\n/-- `0 ≤ rh" + }, + { + "kind": "theorem", + "unqualified_name": "f2_fullTransformedPriceBudget_of_local", + "line": 1014, + "source_header": "ave h : (1 : ℝ) < 3 - Real.log (3 * Real.exp 1 - 2) :=\n UniversalLaw.Proofs.P15Elementary.Aux.one_lt_hStar\n unfold rhoStar\n exact div_nonneg zero_le_one (by linarith)\n\n/-- Display (F2) from display (F12): given the local price bound for every realized family, the\nfull transformed-price budget holds for every realized family. The hypothesis `h12` is the\nregistered `Prop` `LocalPriceBoundFull`, quantified over the ground type so that it can be\ndischarged by the inventory theorem `localPriceBoundFull`. -/\ntheorem f2_fullTransformedPriceBudget_of_local\n (h12 : ∀ {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)" + }, + { + "kind": "theorem", + "unqualified_name": "rhoStarEnclosure", + "line": 1044, + "source_header": "-Real.log (mu F p) :=\n mul_le_mul_of_nonneg_left\n ((UniversalLaw.Proofs.P15Hazard.globalAssemblyHazard F hF p hp).2 hmu)\n f2_rhoStar_nonneg\n\nend Aux\n\n/-! ## Inventory theorems\n\nEach theorem below has as its type exactly one registered `Prop`; the chain is\n`coordinatewiseConcavity → hazardProductBound → hazardPhiBound → fullGroundPriceBound,\nfullGroundBudgetIff, localPriceBoundFull → fullTransformedPriceBudget`, and `rhoStarEnclosure`\nis independent of it. -/\n\n/-- Proves: `UniversalLaw.Spec.P15.RhoStarEnclosure` (claim `p15-full-price`, display (F3)).\nMethod: `rho_star < U` iff `3e - 2 < exp(3 - 1/U)` and `L < rho_star` iff `exp(3 - 1/L) < 3e - 2`\n(`Real.log_lt_iff_lt_exp`, `Real.lt_log_iff_exp_lt`, `div_lt_iff₀`, `lt_div_iff₀`); with\n`3 - 1/U = 2 + x_U`, `exp(3 - 1/U) = (exp 1)^2 * exp x_U` (`Real.exp_add`, `exp_two_eq`), and\n`Real.exp_bound` at degree 26 for `e` and degree 16 for `exp x_U`, `exp x_L` gives exact rational\nenclosures (`Aux.f3_exp_one_gt/lt`, `Aux.f3_exp_xU_ge`, `Aux.f3_exp_xL_le`) that `norm_num`\ncompares in `Aux.f3_log_lt`, `Aux.f3_lt_log`; `rhoStarUpper < 6/7` is `norm_num` on rationals.\nDoes not establish: the informal display (F3) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); the source's `full_price.py`\nFraction procedure (not specified and not reproduced here: the route above is a different\ncertificate of the same enclosure), nor any change to the `specified` status that main's\n`docs/FORMAL_VERIFICATION_ROLLOUT_20260927.md` records f" + }, + { + "kind": "theorem", + "unqualified_name": "coordinatewiseConcavity", + "line": 1068, + "source_header": "ersalLaw.Spec.P15.RhoStarEnclosure := by\n unfold UniversalLaw.Spec.P15.RhoStarEnclosure\n exact ⟨Aux.f3_lower_lt_rhoStar, Aux.f3_rhoStar_lt_upper, Aux.f3_upper_lt_six_sevenths⟩\n\n/-- Proves: `UniversalLaw.Spec.P15.CoordinatewiseConcavity` (claim `p15-full-price`, display (F5)).\nMethod: split `mu_p(A)` at the coordinate `i` (display (F4), `Aux.cc_muOf_update`): with\n`p_i = 1 - exp(-s)` it equals `S_in + (S_out - S_in) exp(-s)`, where `0 ≤ S_in ≤ S_out` for a\ndownset (`Aux.cc_sum_in_le_sum_out`, the injection `U ↦ U.erase i`) and `S_out > 0` since `∅ ∈ A`\nand every `p_j(t) < 1` on the cube (`Aux.cc_sum_out_pos`); then `s ↦ -log(a + b exp(-s))` with\n`a, b ≥ 0`, `a + b > 0` is concave by `concaveOn_of_deriv2_nonpos`, its second derivative being\n`-a b exp(-s) / (a + b exp(-s))^2 ≤ 0` (`Aux.cc_concaveOn_negLog`, via `HasDerivAt.log`,\n`HasDerivAt.div`, `HasDerivAt.deriv`).\nDoes not establish: the informal display (F5) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); joint concavity, or the derivative\nformulas (F4)-(F5) themselves as registered statements (not specified; concavity is their\nconsequenc" + }, + { + "kind": "theorem", + "unqualified_name": "hazardProductBound", + "line": 1086, + "source_header": "seConcavity : UniversalLaw.Spec.P15.CoordinatewiseConcavity := by\n intro n A _ hA i t ht\n obtain ⟨h0, -, hdown⟩ := hA\n exact Aux.cc_concaveOn_hazardCoord_update h0 hdown i t ht\n\n/-- Proves: `UniversalLaw.Spec.P15.HazardProductBound` (claim `p15-full-price`, display (F6)).\nMethod: chord inequality of the separate coordinatewise concavity `coordinatewiseConcavity`\n(display (F5)) on `[0,1]`: `f(s) ≥ (1-s) f(0) + s f(1) ≥ s f(1)` since `f(0) = -log mu ≥ 0`\n(`Aux.f6_hazardCoord_nonneg`, from `mu_p(A) ≤ 1` by `sum_weight_eq_one` and `weight_nonneg`);\niterate over the coordinates with `Finset.induction_on` (`Aux.f6_prod_hazardCoord_le`), raising\none coordinate to `1` at each step (`Aux.f6_chord`), and identify `F_A(1, …, 1) = H_A`\n(`Aux.f6_hazardCoord_one`, since `1 - exp(-1) = p_star`).\nDoes not establish: the informal display (F6) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); the inequality as an informal\nstatement (the Prop is s" + }, + { + "kind": "theorem", + "unqualified_name": "hazardPhiBound", + "line": 1100, + "source_header": "ribed in the register, not derived here. -/\ntheorem hazardProductBound : UniversalLaw.Spec.P15.HazardProductBound :=\n Aux.f6_hazardProductBound_of_concavity coordinatewiseConcavity\n\n/-- Proves: `UniversalLaw.Spec.P15.HazardPhiBound` (claim `p15-full-price`, display (F7)).\nMethod: put `t_i := phi(p_i) ∈ [0,1]` (`Aux.f7_phi_mem`) and `p'_i := 1 - exp(-t_i) ∈ [0, p_i]`\n(`Aux.f7_one_sub_exp_neg_phi_le`, from `phi p ≤ -log(1-p)` and `Real.exp_log`); for a downset\n`mu(A)` is antitone in the probability vector (`Aux.f7_muOf_antitone`, built from the\none-coordinate split `Aux.cc_muOf_update` of display (F4) with `S_in ≤ S_out` by\n`Finset.sum_image` along `U ↦ U.erase i`, iterated by `Finset.induction_on`), so\n`0 < mu_p(A) ≤ mu_p'(A)` and `Real.log_le_log` give `-log mu_p(A) ≥ -log mu_p'(A) = F_A(t)`;\ndisplay (F6) `hazardProductBound` then gives `F_A(t) ≥ (prod_i t_i) H_A`, and `mul_comm`\nmatches the Prop's order.\nDoes not establish: the informal display (F7) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); the inequality as an informal\nstatement (the Prop is statement only), nor anything at `mu_p(A) = 0`, where the source reads\nthe inequality as an extended one and" + }, + { + "kind": "theorem", + "unqualified_name": "fullGroundPriceBound", + "line": 1117, + "source_header": "which is transcribed in the register, not derived here. -/\ntheorem hazardPhiBound : UniversalLaw.Spec.P15.HazardPhiBound :=\n Aux.f7_hazardPhiBound_of_productBound hazardProductBound\n\n/-- Proves: `UniversalLaw.Spec.P15.FullGroundPriceBound` (claim `p15-full-price`, display (F8)).\nMethod: `prod_i c_i ≤ prod_i phi(p_i)` for `0 ≤ c_i ≤ phi(p_i)` (`Finset.prod_le_prod₀`) and\n`prod_i phi(p_i) ≤ 1` from `0 ≤ phi ≤ 1` on `[0,1]` (`Finset.prod_le_one₀`, `Real.log_nonpos`)\ngive the cap; when `mu_p(A) > 0`, display (F7), `hazardPhiBound`, gives\n`H_A prod_i phi(p_i) ≤ -log mu_p(A)` and `H_A > 0` (`P15Elementary.hazardStarPositive`), so\n`prod_i phi(p_i) ≤ (1/H_A) [-log mu_p(A)]` (`inv_mul_cancel_left₀`, `mul_le_mul_of_nonneg_left`);\n`P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard.\nDoes not establish: the informal display (F8) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); that the full-ground generator\ncovers any obstruction (the source: \"It does not assert that this generator alone covers an\narbitrary" + }, + { + "kind": "theorem", + "unqualified_name": "fullGroundBudgetIff", + "line": 1132, + "source_header": "s transcribed in the\nregister, not derived here. -/\ntheorem fullGroundPriceBound : UniversalLaw.Spec.P15.FullGroundPriceBound :=\n Aux.f8_fullGroundPriceBound_of_phiBound hazardPhiBound\n\n/-- Proves: `UniversalLaw.Spec.P15.FullGroundBudgetIff` (claim `p15-full-price`, display (F8), the\nexactness remark following it).\nMethod: (⇐) is display (F8) with `rho = 1`: `prod_i c_i ≤ prod_i phi(p_i) ≤ 1`\n(`Finset.prod_le_prod₀`, `Finset.prod_le_one₀`) and, when `mu_p(A) > 0`,\n`prod_i phi(p_i) ≤ H_A prod_i phi(p_i) ≤ -log mu_p(A)` from `1 ≤ H_A` (`le_mul_of_one_le_left`)\nand display (F7), `hazardPhiBound`, reaching the cap by `P15Budget.Aux.le_cappedHazard_of`.\n(⇒) instantiates the budget at `p ≡ p_star`, `c ≡ 1` (admissible by `P15Elementary.Aux.pStar_pos`,\n`pStar_lt_one` and `phi p_star = 1`, `P15Elementary.phiAtPStar`); `mu_{p_star}(A) > 0` since\n`∅ ∈ A` contributes `(1 - p_star)^n > 0` (`Finset.single_le_sum`, `P15Budget.Aux.weight_nonneg`),\nso `1 ≤ min 1 (-log mu_{p_star}(A))` and `le_min_iff` gives `1 ≤ H_A`.\nDoes not establish: the informal display (F8) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); coverage of arbitrary `A` (the\nsource: \"it does not infer coverag" + }, + { + "kind": "theorem", + "unqualified_name": "localPriceBoundFull", + "line": 1149, + "source_header": "ich\nis transcribed in the register, not derived here. -/\ntheorem fullGroundBudgetIff : UniversalLaw.Spec.P15.FullGroundBudgetIff :=\n Aux.bi_fullGroundBudgetIff_of_phiBound hazardPhiBound\n\n/-- Proves: `UniversalLaw.Spec.P15.LocalPriceBoundFull` (claim `p15-full-price`, display (F12)).\nMethod: enumerate the block by `Fin n_i` (`Aux.lp_exists_enum`), transport `mu_p(D_i)` to the\ncapacity family `{|T| ≤ a_i}` via `LocalRestriction` (`Aux.lp_localGood_eq_muOf`), apply\n`hazardPhiBound` (display (F7)) to that proper downset (`Aux.lp_capacityFamily_properDownset`),\nbound `h_star ≤ H_{n_i,a_i}` by `CapacityWorstCase` and `∏ c ≤ ∏ phi ≤ 1` by\n`Finset.prod_le_prod₀`, `Finset.prod_le_one₀`; `rho_star = 1 / h_star` is definitional.\nDoes not establish: the informal display (F12) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); the stronger inequality\n`price ≤ q_i` (\"The inequality price<=q_i is NOT required and is in general stronger than what\nis proved here\"); the disposition of `p15-full-price`, which i" + }, + { + "kind": "theorem", + "unqualified_name": "fullTransformedPriceBudget", + "line": 1164, + "source_header": "ocalPriceBoundFull {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :\n UniversalLaw.Spec.P15.LocalPriceBoundFull F :=\n Aux.lp_localPriceBoundFull_of_phiBound hazardPhiBound F\n\n/-- Proves: `UniversalLaw.Spec.P15.FullTransformedPriceBudget` (claim `p15-full-price`, display (F2)).\nMethod: `covercost ≤ 1` by the cover `{∅}` (`P15Budget.Aux.coverCost_le_one`); for `K ≥ K_H(d)`\nthe full blocks cover, so `covercost ≤ sum_i price(X_i)` (`P15Budget.Aux.coverCost_le_sum_block`);\nwhen `mu_p(D) > 0` every `mu_p(D_i) > 0` (`P15Hazard.Aux.localGood_pos_of_mu_pos`) and the local\nbound (F12), `localPriceBoundFull`, gives `price(X_i) ≤ rho_star [-log mu_p(D_i)]`;\n`Finset.sum_le_sum`, `Finset.mul_sum` and the global assembly (F13),\n`P15Hazard.globalAssemblyHazard`, give `sum_i price(X_i) ≤ rho_star [-log mu_p(D)]` with\n`rho_star ≥ 0`; `P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard.\nDoes not establish: the informal display (F2) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); optimality of `rho_star` (that is\n`SharpnessOfRhoStar`); any unrestricted downset or prize statement (the source: \"palette size\nremains K_H(d), which can depend on H and d\"); the nonauthor review recorded in LANDING_CLAIMS\n(REVIEWED_SCOPED), which is not reproduced or extended here; the disposition of\n`p15-full-price`, which is transcribe" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/RNCluster.lean", + "sha256": "829f8ad5677c52d55ae7c4c3ea36d817692c3d122273e29dfe2068b00dde442a", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "rc_tail_one_eq", + "line": 50, + "source_header": "x\n\n/-! ### (a) Tails of a probability mass function on `ℕ` -/\n\n/-- `∑_{n ≥ 1} μ n = 1 - μ 0` for a summable family of total mass one. -/\ntheorem rc_tail_one_eq (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) :\n ∑' n : ℕ, μ (n + 1) = 1" + }, + { + "kind": "theorem", + "unqualified_name": "rc_tail_two_eq", + "line": 59, + "source_header": "arith\n\n/-- `∑_{n ≥ 2} μ n = 1 - μ 0 - μ 1` for a summable family of total mass one. -/\ntheorem rc_tail_two_eq (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) :\n ∑' n : ℕ, μ (n + 2) = 1 - μ" + }, + { + "kind": "theorem", + "unqualified_name": "rc_tail_one_le_mean", + "line": 67, + "source_header": "inarith\n\n/-- Markov for the mean: `∑_{n ≥ 1} μ n ≤ ∑ n μ n` for a nonnegative family with summable\nmean. -/\ntheorem rc_tail_one_le_mean (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)\n (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) :\n ∑' n : ℕ, μ (n + 1) ≤ ∑' n : ℕ, (n :" + }, + { + "kind": "theorem", + "unqualified_name": "rc_one_sub_head_le_mean", + "line": 84, + "source_header": "_of_eq h2\n\n/-- `1 - μ 0 ≤ ∑ n μ n` for a probability mass function with summable mean. -/\ntheorem rc_one_sub_head_le_mean (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)\n (h1 : ∑' n, μ n = 1) (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) :\n 1 - μ 0 ≤ ∑' n : ℕ, (n" + }, + { + "kind": "theorem", + "unqualified_name": "rc_two_mul_tail_two_le_mean", + "line": 91, + "source_header": "hs h1] at h\n\n/-- `2 (1 - μ 0 - μ 1) ≤ ∑ n μ n`: the mean dominates twice the mass of `{n ≥ 2}` (this is the\nsource's remark `2a ≤ A`, before dividing by `r^3`). -/\ntheorem rc_two_mul_tail_two_le_mean (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)\n (h1 : ∑' n, μ n = 1) (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) :\n 2 * (1 - μ 0 - μ 1) ≤ ∑' n : ℕ," + }, + { + "kind": "theorem", + "unqualified_name": "rc_hasSum_poissonPMF", + "line": 111, + "source_header": "narith [h0 1]\n\n/-! ### (b) The Poisson family -/\n\n/-- `poissonPMF lam` has total mass one for `lam ≥ 0` (Mathlib's\n`ProbabilityTheory.hasSum_one_poissonMeasure`, whose summand is definitionally\n`poissonPMF lam n`). -/\ntheorem rc_hasSum_poissonPMF (lam : ℝ) (hl : 0 ≤ lam) : HasSum (" + }, + { + "kind": "theorem", + "unqualified_name": "rc_poissonPMF_zero", + "line": 121, + "source_header": "am, hl⟩\n exact h\n\n/-- `poissonPMF lam 0 = e^{-lam}`. -/\ntheorem rc_poissonPMF_zero (lam : ℝ) : poissonPMF lam" + }, + { + "kind": "theorem", + "unqualified_name": "rc_poissonPMF_one", + "line": 125, + "source_header": "simp [poissonPMF]\n\n/-- `poissonPMF lam 1 = e^{-lam} lam`. -/\ntheorem rc_poissonPMF_one (lam : ℝ) : poissonPMF lam 1 =" + }, + { + "kind": "theorem", + "unqualified_name": "rc_poisson_tail_one", + "line": 129, + "source_header": "y\n simp [poissonPMF]\n\n/-- The Poisson tail `∑_{n ≥ 1} Pois(lam)(n) = 1 - e^{-lam}` for `lam ≥ 0`. -/\ntheorem rc_poisson_tail_one (lam : ℝ) (hl : 0 ≤ lam) :\n ∑' n : ℕ, poissonPMF lam (n + 1" + }, + { + "kind": "theorem", + "unqualified_name": "rc_poisson_tail_two", + "line": 137, + "source_header": "F_zero] at h\n linarith\n\n/-- The Poisson tail `∑_{n ≥ 2} Pois(lam)(n) = 1 - e^{-lam} - lam e^{-lam}` for `lam ≥ 0`. -/\ntheorem rc_poisson_tail_two (lam : ℝ) (hl : 0 ≤ lam) :\n ∑' n : ℕ, poissonPMF lam (n + 2) = 1 - Real.exp (-lam" + }, + { + "kind": "theorem", + "unqualified_name": "rc_half_le_one_sub_exp", + "line": 147, + "source_header": "nPMF_one] at h\n linarith\n\n/-- `x/2 ≤ 1 - e^{-x}` for `0 ≤ x ≤ 1/2`, from `|e^y - 1 - y| ≤ y^2` on `|y| ≤ 1`. -/\ntheorem rc_half_le_one_sub_exp (x : ℝ) (h0 : 0 ≤ x) (h1 : x ≤ 1 / 2) :" + }, + { + "kind": "theorem", + "unqualified_name": "rc_poisson_tail_two_le_sq", + "line": 154, + "source_header": "at h\n nlinarith [h.1, h.2]\n\n/-- `Pois(lam)(n ≥ 2) = 1 - e^{-lam} - lam e^{-lam} ≤ lam^2` for `lam ≥ 0`, from\n`1 + y ≤ e^y` multiplied by `1 + lam ≥ 0`. -/\ntheorem rc_poisson_tail_two_le_sq (lam : ℝ) (h0 : 0 ≤ lam) :\n 1 - Real.exp (-lam) - la" + }, + { + "kind": "theorem", + "unqualified_name": "rc_pmfTV_poissonPMF_zero", + "line": 162, + "source_header": "[hprod, Real.exp_pos (-lam)]\n\n/-! ### (c) Total variation against `δ_0` and against tail events -/\n\n/-- The upper half's witness: `pmfTV μ (poissonPMF 0) = 1 - μ 0` for a probability mass\nfunction `μ` (`poissonPMF 0 = δ_0`). -/\ntheorem rc_pmfTV_poissonPMF_zero (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)\n (h1 : ∑' n, μ n = 1) :" + }, + { + "kind": "theorem", + "unqualified_name": "rc_abs_tail_sub_le_pmfTV", + "line": 188, + "source_header": "l, rc_tail_one_eq μ hs h1]\n ring\n\n/-- Half the `l^1` distance dominates the difference of the masses of every tail event\n`{n ≥ k}`, for two summable families of total mass one: the head and the tail of `μ - ν` sum to\nzero, so the tail difference is bounded by the head's `l^1` mass and by its own. -/\ntheorem rc_abs_tail_sub_le_pmfTV (μ ν : ℕ → ℝ) (hμ : Summable μ) (hν : Summable ν)\n (h1 : ∑' n, μ n = 1) (h1' : ∑' n, ν n = 1) (k : ℕ) :\n |(∑' n : ℕ, μ (n + k))" + }, + { + "kind": "theorem", + "unqualified_name": "rc_tail_two_bound", + "line": 215, + "source_header": "[heq, abs_neg] at hhead\n linarith\n\n/-- The tail `{n ≥ 2}` against `Pois(lam)`:\n`|(1 - μ 0 - μ 1) - (1 - e^{-lam} - lam e^{-lam})| ≤ pmfTV μ (poissonPMF lam)`. -/\ntheorem rc_tail_two_bound (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) (lam : ℝ)\n (hl : 0 ≤ lam) :\n |(1 - μ 0 - μ 1) - (1 - Real.exp (-lam) - lam * Real.exp (-la" + }, + { + "kind": "theorem", + "unqualified_name": "rc_tail_one_bound", + "line": 225, + "source_header": "h1, rc_poisson_tail_two lam hl] at h\n\n/-- The tail `{n ≥ 1}` against `Pois(lam)`:\n`|(1 - μ 0) - (1 - e^{-lam})| ≤ pmfTV μ (poissonPMF lam)`. -/\ntheorem rc_tail_one_bound (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) (lam : ℝ)\n (hl : 0 ≤ lam) :\n |(1 - μ 0) - (1 - Real." + }, + { + "kind": "theorem", + "unqualified_name": "rc_lower_half", + "line": 234, + "source_header": "hs h1, rc_poisson_tail_one lam hl] at h\n\n/-! ### (d) The two halves at a fixed `r` -/\n\n/-- The lower half at a fixed `r` with `0 < r ≤ min (a/2) (min (1/(a + 2A)) (1/2))`, for a\nprobability mass function `μ` with summable mean satisfying (H1) and (H2) at `r`: every\n`lam ≥ 0` is at distance at least `(a/2) r^3`. -/\ntheorem rc_lower_half (μ : ℕ → ℝ) (a A r : ℝ) (hA : 0 < A) (hr : 0 < r)\n (hr_a : r ≤ a / 2) (hr_A : r ≤ 1 / (a + 2 * A)) (hr_half : r ≤ 1 / 2)\n (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ) (h1 : ∑' n, μ n = 1)\n (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) (hmean : ∑' n : ℕ, (n : ℝ) * μ n ≤ A * r ^ 3)\n (hH2 : a * r ^ 3 ≤ 1 - μ 0 - μ 1) (lam : ℝ) (hlam : 0 ≤ lam) :" + }, + { + "kind": "theorem", + "unqualified_name": "rc_upper_half", + "line": 274, + "source_header": "nlinarith [hprod]\n linarith [hk1.1]\n\n/-- The upper half at a fixed `r`, witness `lam = 0`: `pmfTV μ (poissonPMF 0) = 1 - μ 0 ≤\n∑ n μ n ≤ A r^3`. -/\ntheorem rc_upper_half (μ : ℕ → ℝ) (A r : ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)\n (h1 : ∑' n, μ n = 1) (hm : Summable (fun n : ℕ => (n : ℝ) * μ n))\n (hmean : ∑' n : ℕ, (n : ℝ) * μ n ≤ A * r" + }, + { + "kind": "theorem", + "unqualified_name": "rareClusterPoissonObstructionO", + "line": 285, + "source_header": "d_le_mean μ h0 hs h1 hm).trans hmean\n\nend Aux\n\n/-! ## Theorem O's shape: the abstract implication (H1) ∧ (H2) ⇒ (3.1) -/\n\n/-- Proves: `UniversalLaw.Spec.RN.RareClusterPoissonObstructionO` (claim `OA-C6-RARE-CLUSTER-20260929-v1`).\nMethod: the antecedents at `r0` give `2a ≤ A` (`Aux.rc_two_mul_tail_two_le_mean`,\n`le_of_mul_le_mul_right`), so `rStar := min r0 (min (a/2) (min (1/(a + 2A)) (1/2)))` is positive;\nthe upper half is the witness `lam = 0` with `pmfTV (μ r) (poissonPMF 0) = 1 - μ r 0 ≤ ∑ n μ r n`\n(`Aux.rc_upper_half`, from `Aux.rc_pmfTV_poissonPMF_zero` and `Aux.rc_one_sub_head_le_mean`);\nthe lower half tests the tail `{n ≥ 2}` when `lam ≤ r^2` and the tail `{n ≥ 1}` when\n`lam > r^2` (`Aux.rc_lower_half`, from `Aux.rc_abs_tail_sub_le_pmfTV`, the Poisson tails via\n`ProbabilityTheory.hasSum_one_poissonMeasure`, `Real.add_one_le_exp` and\n`Real.abs_exp_sub_one_sub_id_le`).\nDoes not establish: the informal Theorem O (3.1) of the source as the source's statement (the\nalignment of `pmfTV`, `poissonPMF` and the family `μ` with the source's `dTV`, `Pois(lambda)` and\n`Law N_r` is PENDING_INDEPENDENT_REVIEW); the result (Theorem O) or its proof as a reviewed fact;\n`2a ≤ A` as a registered statement (it is derived internally from the antecedents at `r0`, as in\nthe source, and is neither a hypothesis nor a conclusion of the Prop); that (H1) or (H2) hold for\nthe Gaussian window count (the source takes them from [D5] Theorem G_d and [C6] Corollary\nTheta); the mean-matched statement `lambda = mu`; Theorems C and S, the factorial-moment\nmatching or the independent-replica limit; the conditional-law liminf remark; that the upper half\nis the source's infimum bound verbatim (the Prop's existential form with witness `lam = 0` is\nwhat is proved); the statement module's own `Does not claim:` text (the statement packet is not\nedited here); the disposition of `OA-C6-RARE-CLUSTER-20260929-v1`, for which the register row\ntranscribes none (`disposition_transcribed: null`; title: PROOF_INDEX reviewed scoped result,\nconditional packet) and which is in any case transcribed there, not derived here; nonauthor\nreview or acceptance of OA-C6-RARE-CLUSTER-20260929-v1. -/\ntheorem rareClusterPoissonObstructionO (μ : ℝ → ℕ → ℝ) (a A : ℝ) :\n Universa" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Interfaces.lean", + "sha256": "cac965c9f6095a0812891b609be56e0fed885861f5c95cc0e9518e7908642fce", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "c1_aemeasurable_of_map_eq_gaussian", + "line": 61, + "source_header": "x\n\n/-! ## `c1_`: the `m = 1` cone moment identity (`ConeMomentD1Identity`) -/\n\n/-! ### (a) A map with a non-degenerate Gaussian law is a.e.-measurable -/\n\n/-- If `Measure.map A P` is the Gaussian `gaussianReal 0 v` with `v ≠ 0`, then `A` is\na.e.-measurable: otherwise the image measure would be a Dirac measure\n(`Measure.map_of_not_aemeasurable_of_ne_zero`), giving a singleton of measure one, whereas the\nGaussian charges no singleton (`nullSingletonClass_gaussianReal`). -/\ntheorem c1_aemeasurable_of_map_eq_gaussian {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω)\n [IsProbabilityMeasure P] (A : Ω → ℝ) {v : NNReal} (hv : v ≠ 0)\n (h : Measure.map A P = gaussianReal 0 v) : AEMeasura" + }, + { + "kind": "theorem", + "unqualified_name": "c1_measurable_indicator_sq", + "line": 81, + "source_header": "zero h1\n\n/-! ### (b) Second moments of the centred Gaussian -/\n\n/-- The integrand `a ↦ 1_{Iio 0}(a) a^2` is measurable. -/\ntheorem c1_measurable_indicator_sq :\n Measurable (fun a : ℝ => Set.indicator (Set.Iio (0 : ℝ)) (fun a =" + }, + { + "kind": "theorem", + "unqualified_name": "c1_second_moment_gaussianReal", + "line": 88, + "source_header": "ableSet_Iio\n\n/-- The second moment of `gaussianReal 0 v` is `v`, from Mathlib's\n`variance_fun_id_gaussianReal` rewritten with `variance_eq_integral` (the mean is `0`). -/\ntheorem c1_second_moment_gaussianReal (v : NNReal) :\n ∫ t, t ^ 2 ∂(gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "c1_integrable_sq_gaussianReal", + "line": 96, + "source_header": "simpa using h\n\n/-- `a ↦ a^2` is integrable against `gaussianReal 0 v` (`memLp_id_gaussianReal` at `p = 2`). -/\ntheorem c1_integrable_sq_gaussianReal (v : NNReal) :\n Integrable (fun a : ℝ => a ^ 2) (ga" + }, + { + "kind": "theorem", + "unqualified_name": "c1_setIntegral_sq_Iio_eq_Ioi", + "line": 102, + "source_header": "impa using this\n\n/-- Symmetry of the centred Gaussian: the second moment over `Iio 0` equals the second moment\nover `Ioi 0`, by `gaussianReal_map_neg` and a change of variables `a ↦ -a` (`integral_map`),\nusing `neg_lt_zero` and `neg_sq` pointwise. -/\ntheorem c1_setIntegral_sq_Iio_eq_Ioi (v : NNReal) :\n ∫ a in Set.Iio (0 : ℝ), a ^ 2 ∂(gaussianReal 0 v) =\n ∫ a in Set.Ioi (0 : ℝ), a ^ 2 ∂(" + }, + { + "kind": "theorem", + "unqualified_name": "c1_setIntegral_sq_Iio", + "line": 122, + "source_header": "measurableSet_Ioi\n\n/-- The negative half of the second moment of `gaussianReal 0 v`, `v ≠ 0`, is `v / 2`:\n`integral_add_compl` over `Iio 0` and its complement `Ici 0`, `integral_Ici_eq_integral_Ioi`\n(the Gaussian charges no singleton), the symmetry lemma, and the full second moment `v`. -/\ntheorem c1_setIntegral_sq_Iio (v : NNReal) (hv : v ≠ 0) :\n ∫ a in Set.Iio (0 : ℝ), a ^ 2 ∂(gaussianReal" + }, + { + "kind": "theorem", + "unqualified_name": "c1_integral_indicator_eq", + "line": 134, + "source_header": "t hsplit\n linarith\n\n/-! ### (c) Transport along the law of `A` -/\n\n/-- For a map `A` with law `gaussianReal 0 (8/3)` under a probability measure `P`, the integral\nof `1_{Iio 0}(A) A^2` equals the set integral of `a ↦ a^2` over `Iio 0` against\n`gaussianReal 0 (8/3)`: a.e.-measurability of `A` from its law, then `integral_map` and\n`integral_indicator`. Stated for an abstract `(Ω, P, A)` so that the interface's own instance\nfields `I.mΩ`, `I.isProb` are supplied explicitly at the point of use. -/\ntheorem c1_integral_indicator_eq {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω)\n [IsProbabilityMeasure P] (A : Ω → ℝ)\n (hlaw : Measure.map A P = gaussianReal 0 (8 / 3 : NNReal)) :\n ∫ ω, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) (A ω) ∂P =\n ∫ a in Set.Iio (0 : ℝ), a ^ 2 ∂(gaussianR" + }, + { + "kind": "theorem", + "unqualified_name": "tm_hasDerivAt_exp_sq", + "line": 153, + "source_header": "ator measurableSet_Iio]\n\n/-! ## `tm_`: the trace moments (`TraceMoments`) -/\n\n/-! ### (a) Calculus: the fourth derivative of `exp (c t^2 / 2)` at `0` -/\n\n/-- Derivative of `t ↦ exp (c t^2 / 2)`: `c t exp (c t^2 / 2)` (chain rule through\n`HasDerivAt.exp`). -/\ntheorem tm_hasDerivAt_exp_sq (c t : ℝ) :\n HasDerivAt (fun t : ℝ => Real.exp (c * t ^ 2 / 2)) (c * t" + }, + { + "kind": "theorem", + "unqualified_name": "tm_iteratedDeriv_four", + "line": 169, + "source_header": "h2 using 1\n push_cast\n ring\n\n/-- The fourth derivative of `t ↦ exp (c t^2 / 2)` at `0` is `3 c^2`: four explicit\n`HasDerivAt` steps, chained through `iteratedDeriv_succ` and `iteratedDeriv_one`. -/\ntheorem tm_iteratedDeriv_four (c : ℝ) :\n iteratedDeriv 4 (fun t : ℝ => Real.exp" + }, + { + "kind": "theorem", + "unqualified_name": "tm_fourth_moment", + "line": 214, + "source_header": "riv_one, d1, d2, d3, d4]\n simp\n\n/-! ### (b) Moments of the centred real Gaussian `gaussianReal 0 v`\n\nThe second moment `∫ t^2 = v` is `c1_second_moment_gaussianReal` above (the `tm_` copy was\nremoved at integration). -/\n\n/-- Fourth moment of `N(0, v)`: `∫ t^4 = 3 v^2`, from the fourth derivative at `0` of the\nmoment generating function `t ↦ exp (v t^2 / 2)` (`iteratedDeriv_mgf_zero`,\n`mgf_fun_id_gaussianReal`, `tm_iteratedDeriv_four`). -/\ntheorem tm_fourth_moment (v : NNReal) :\n ∫ t, t ^ 4 ∂(" + }, + { + "kind": "theorem", + "unqualified_name": "tm_exp_moment", + "line": 230, + "source_header": "riv_four] at h\n simpa using h.symm\n\n/-- Exponential moment of `N(0, 5/3)`: `∫ exp (-t^2/2) = sqrt (3/8)`. The density\n`(sqrt (10 π / 3))⁻¹ exp (-3 t^2 / 10)` times `exp (-t^2/2)` is\n`(sqrt (10 π / 3))⁻¹ exp (-(4/5) t^2)`, whose Lebesgue integral is `sqrt (π / (4/5))`\n(`integral_gaussian`); the square roots combine to `sqrt (3/8)`. -/\ntheorem tm_exp_moment :\n ∫ t, Real.exp (-(t ^ 2) / 2) ∂(gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "tm_aemeasurable_triple", + "line": 252, + "source_header": "ivity)]\n congr 1\n field_simp\n ring\n\n/-! ### (c) The marginal law of `s` from the interface's product law -/\n\n/-- The triple `(s, x, y)` is a.e.-measurable: its image measure under `P` is the product\nGaussian law (`sxy_law`); were the triple not a.e.-measurable, `Measure.map` would be a Dirac\nmass (`Measure.map_of_not_aemeasurable_of_ne_zero`), which gives a singleton measure `1`,\nwhereas the product of non-degenerate Gaussians has `NullSingletonClass`. -/\ntheorem tm_aemeasurable_triple (I : ConeMomentInterface) :\n @AEMeasurable _ _ _" + }, + { + "kind": "theorem", + "unqualified_name": "tm_aemeasurable_s", + "line": 276, + "source_header": "e_singleton] at h1\n exact one_ne_zero h1\n\n/-- `s` is a.e.-measurable, as the first component of the a.e.-measurable triple. -/\ntheorem tm_aemeasurable_s (I : ConeMomentIn" + }, + { + "kind": "theorem", + "unqualified_name": "tm_law_s", + "line": 280, + "source_header": "I.s I.P :=\n (tm_aemeasurable_triple I).fst\n\n/-- The law of `s` is `N(0, 5/3)`: the first marginal of the product law `sxy_law`\n(`AEMeasurable.map_map_of_aemeasurable`, `Measure.map_fst_prod`; the composite\n`Prod.fst ∘ (s, x, y)` is `s`). -/\ntheorem tm_law_s (I : ConeMomentInterface) :\n @Measure.map _ _ I.m" + }, + { + "kind": "theorem", + "unqualified_name": "tm_integral_comp_s", + "line": 292, + "source_header": ", measure_univ, one_smul] at h\n exact h.symm\n\n/-! ### (d) Transport of an integral along `s` to the marginal law -/\n\n/-- For a measurable `f : ℝ → ℝ`, `∫ f (s ω) dP = ∫ f t d(gaussianReal 0 (5/3))`\n(`integral_map` along the a.e.-measurable `s`, then `tm_law_s`). -/\ntheorem tm_integral_comp_s (I : ConeMomentInterface) (f : ℝ → ℝ) (hf : Measurable f) :\n ∫ ω, f (I.s ω) ∂" + }, + { + "kind": "theorem", + "unqualified_name": "rl_rhs_integral", + "line": 303, + "source_header": "m_aemeasurable_s I) hf.aestronglyMeasurable).symm\n\n/-! ## `rl_`: the law of `R^2` (`RayleighSquareLaw`) -/\n\n/-! ### (a) Elementary integrals -/\n\n/-- The right-hand side of `RayleighSquareLaw`: `∫_0^a exp (-z/2)/2 dz = 1 - exp (-a/2)`, by\nthe fundamental theorem of calculus with antiderivative `z ↦ -exp (-z/2)`. -/\ntheorem rl_rhs_integral (a : ℝ) :\n ∫ z in (0" + }, + { + "kind": "theorem", + "unqualified_name": "rl_radial_integral", + "line": 325, + "source_header": "ntegral_eq_sub_of_hasDerivAt hderiv hint]\n simp\n ring\n\n/-- The radial integral of the planar Gaussian density over the disk of radius `sqrt a`:\n`∫_0^{sqrt a} r (2π)⁻¹ exp (-r^2/2) dr = (2π)⁻¹ (1 - exp (-a/2))`, by the fundamental\ntheorem of calculus with antiderivative `r ↦ -(2π)⁻¹ exp (-r^2/2)`. -/\ntheorem rl_radial_integral (a : ℝ) (ha : 0 ≤ a) :\n ∫ r in (0 : ℝ)..Real.sqrt a, r * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "rl_angular_integral", + "line": 351, + "source_header": "of_hasDerivAt hderiv hint, Real.sq_sqrt ha]\n simp\n ring\n\n/-- The angular integral: `∫_{Ioo (-π) π} 1 = 2π`. -/\ntheorem rl_angular_integral" + }, + { + "kind": "theorem", + "unqualified_name": "rl_pdf_mul", + "line": 357, + "source_header": "ENNReal.toReal_ofReal (by linarith [Real.pi_pos])]\n ring\n\n/-! ### (b) The planar standard Gaussian density -/\n\n/-- The product of two standard Gaussian densities is the planar density\n`(2π)⁻¹ exp (-(x^2 + y^2)/2)`. -/\ntheorem rl_pdf_mul (x y : ℝ) :\n gaussianPDFReal 0 1 x * gaussianPDFReal" + }, + { + "kind": "theorem", + "unqualified_name": "rl_measurableSet_disk", + "line": 377, + "source_header": "2) := by\n rw [hs, ← Real.exp_add]\n congr 2\n ring\n\n/-- The closed disk `{p | p.1^2 + p.2^2 ≤ a}` is measurable. -/\ntheorem rl_measurableSet_dis" + }, + { + "kind": "theorem", + "unqualified_name": "rl_measurableSet_radial", + "line": 382, + "source_header": "p.2 ^ 2 ≤ a} :=\n measurableSet_le (by fun_prop) measurable_const\n\n/-- The set `{r | r^2 ≤ a}` is measurable. -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "rl_polar_integrand", + "line": 386, + "source_header": "ℝ | r ^ 2 ≤ a} :=\n measurableSet_le (by fun_prop) measurable_const\n\n/-- In polar coordinates the disk integrand `p.1 • 1_D (density ∘ polarCoord.symm) p` is the\nradial function `1_{r^2 ≤ a} (r (2π)⁻¹ exp (-r^2/2))` of `p.1` times the constant `1` of\n`p.2` (the form `setIntegral_prod_mul` separates). -/\ntheorem rl_polar_integrand (a : ℝ) (p : ℝ × ℝ) :\n p.1 • Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}\n (fun q => gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2) (polarCoord.symm p) =\n Set.indicator {r : ℝ | r ^ 2 ≤ a}\n (fun r => r * ((2 * Real.pi)⁻¹" + }, + { + "kind": "theorem", + "unqualified_name": "rl_Ioi_inter_eq", + "line": 401, + "source_header": "d_eq, rl_pdf_mul, hsq,\n smul_eq_mul, mul_one]\n split_ifs <;> simp\n\n/-- For `a ≥ 0`, `Ioi 0 ∩ {r | r^2 ≤ a} = Ioc 0 (sqrt a)`. -/\ntheorem rl_Ioi_inter_eq (a : ℝ) (ha : 0 ≤ a" + }, + { + "kind": "theorem", + "unqualified_name": "rl_disk_integral", + "line": 412, + "source_header": ".2 hr⟩\n · rintro ⟨h0, hr⟩\n exact ⟨h0, (Real.le_sqrt h0.le ha).1 hr⟩\n\n/-- The Bochner integral of the planar standard Gaussian density over the closed disk of\nradius `sqrt a` is `1 - exp (-a/2)`: polar coordinates (`integral_comp_polarCoord_symm`),\nseparation of variables (`setIntegral_prod_mul`), the angular integral `2π` and the radial\nintegral `(2π)⁻¹ (1 - exp (-a/2))`. -/\ntheorem rl_disk_integral (a : ℝ) (ha : 0 ≤ a) :\n ∫ p in {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 ≤ a}," + }, + { + "kind": "theorem", + "unqualified_name": "rl_disk_measure", + "line": 452, + "source_header": "h2, h3]\n refine h4.trans ?_\n rw [h5, rl_angular_integral]\n field_simp\n\n/-- The measure of the closed disk of radius `sqrt a` under the standard planar Gaussian\n`gaussianReal 0 1 ⊗ gaussianReal 0 1` is `1 - exp (-a/2)`: the product of the two\n`withDensity` measures is `withDensity` of the product density (`prod_withDensity`), whose\nvalue on the (measurable) disk is the `lintegral` of the density there (`withDensity_apply`),\nwhich is `ENNReal.ofReal` of the Bochner integral `rl_disk_integral`\n(`ofReal_integral_eq_lintegral_ofReal`). -/\ntheorem rl_disk_measure (a : ℝ) (ha : 0 ≤ a) :\n ((gaussianReal 0 1).prod (gaussianReal 0 1)) {p : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "rl_aemeasurable_xy", + "line": 478, + "source_header": "only [gaussianPDF]\n rw [ENNReal.ofReal_mul (gaussianPDFReal_nonneg _ _ _)]\n\n/-! ### (c) The interface: measurability and the law of `(x, y)`\n\nA.e.-measurability of the triple `(s, x, y)` is `tm_aemeasurable_triple` above (the `rl_` copy\nwas removed at integration). -/\n\n/-- The pair `(x, y)` is a.e.-measurable, as the second component of the triple. -/\ntheorem rl_aemeasurable_xy (I : Co" + }, + { + "kind": "theorem", + "unqualified_name": "rl_law_xy", + "line": 488, + "source_header": "le _ _ _ I.mΩ (fun ω => (I.x ω, I.y ω)) I.P :=\n (tm_aemeasurable_triple I).snd\n\n/-- The law of `(x, y)` is `gaussianReal 0 1 ⊗ gaussianReal 0 1`: the second marginal of the\nproduct law `sxy_law` (`AEMeasurable.map_map_of_aemeasurable`, `Measure.map_snd_prod`; the\ncomposite `Prod.snd ∘ (s, x, y)` is `(x, y)`). -/\ntheorem rl_law_xy (I : ConeMomentInterface) :\n @Measure.map _ _ I.mΩ _" + }, + { + "kind": "theorem", + "unqualified_name": "rl_prob_eq_disk_measure", + "line": 501, + "source_header": "rw [I.sxy_law, Measure.map_snd_prod, measure_univ, one_smul] at h\n exact h.symm\n\n/-- The probability of `{x^2 + y^2 ≤ a}` under `P` is the Gaussian measure of the closed disk: the\ndisk is a measurable set and `(x, y)` is a.e.-measurable, so `Measure.map_apply_of_aemeasurable`\ntransports the law `rl_law_xy` (a.e.-measurable transport; the sample-space preimage is only\nshown to be null-measurable for `I.P`, which is not assumed complete). -/\ntheorem rl_prob_eq_disk_measure (I : ConeMomentInterface) (a : ℝ) :\n I.P {ω | I.x ω ^ 2 + I.y ω ^ 2 ≤ a} =" + }, + { + "kind": "theorem", + "unqualified_name": "coneMomentD1Identity", + "line": 516, + "source_header": "ly_of_aemeasurable (rl_aemeasurable_xy I) (rl_measurableSet_disk a)]\n rfl\n\nend Aux\n\n/-! ## The `m = 1` cone moment identity for every inhabitant of the interface -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ConeMomentD1Identity` (claim `side24-coefficient`).\nMethod: transport along the law field `I.A_law` (`Aux.c1_integral_indicator_eq`, applied to\n`I.Ω`, `I.mΩ`, `I.P`, `I.isProb`, `I.A`; it uses `integral_map` after a.e.-measurability of\n`I.A` from `Aux.c1_aemeasurable_of_map_eq_gaussian`, the Dirac-versus-`NullSingletonClass`\nargument), then the negative half of the second moment of\n`gaussianReal 0 (8/3)` is `(8/3)/2` (`Aux.c1_setIntegral_sq_Iio`, from `integral_add_compl`,\n`integral_Ici_eq_integral_Ioi`, the symmetry `gaussianReal_map_neg` and the variance\n`variance_fun_id_gaussianReal`), and `push_cast`/`norm_num` give `4/3 = coneMomentD1`.\nDoes not establish: the informal identity `D_1 = E[A^2 1{A<0}] = 4/3` of the source as the\nsource's object (the alignment of `ConeMomentInterface`, its field `A_law` and `coneMomentD1`\nwith the source's `A ~ N(0, 8/3)` and `D_1` is PENDING_INDEPENDENT_REVIEW); that `D_1` is the\nparent's cone moment `D_u` of (15.1) for the reference law; that `ConeMomentInterface` has an\ninhabitant, or that its laws are the conditional law `A | V = 0` of the reference field; any\nenclosure of the coefficient; `ConeMomentD2Identity`, `TraceMoments` or `RayleighSquareLaw`;\nthe disposition of `side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the\nregister, not derived here; nonauthor review or acceptance of\nSIDE24-COEFFICIENT-D23-20260924-v1. -/\ntheorem coneMomentD1I" + }, + { + "kind": "theorem", + "unqualified_name": "traceMoments", + "line": 543, + "source_header": "w,\n Aux.c1_setIntegral_sq_Iio (8 / 3 : NNReal) (by norm_num)]\n push_cast\n norm_num\n\n/-! ## The Section 1 trace moments for every inhabitant of the interface -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.TraceMoments` (claim `side24-coefficient`).\nMethod: the law of `I.s` is `gaussianReal 0 (5/3)` (`Aux.tm_law_s`: the first marginal of the\ninterface's product law `sxy_law`, after `Aux.tm_aemeasurable_triple` derives a.e.-measurability\nof the triple from the law by the Dirac-versus-`NullSingletonClass` argument); each of the three\nintegrals is transported to that law by `integral_map` (`Aux.tm_integral_comp_s`) and computed\nthere: `∫ t^2 = 5/3` (`Aux.c1_second_moment_gaussianReal`, shared with `ConeMomentD1Identity`,\nfrom `variance_fun_id_gaussianReal`),\n`∫ t^4 = 3 (5/3)^2 = 25/3` (`Aux.tm_fourth_moment`, from `iteratedDeriv_mgf_zero` and the\nexplicit fourth derivative `Aux.tm_iteratedDeriv_four`), and `∫ exp (-t^2/2) = sqrt (3/8)`\n(`Aux.tm_exp_moment`, from `integral_gaussianReal_eq_integral_smul` and `integral_gaussian`).\nDoes not establish: the informal Section 1 display of the source as the source's object (the\nalignment of the interface fields `s`, `P`, `sxy_law` and of `gaussianReal` with the source's\n`s ~ N(0, 5/3)` is PENDING_INDEPENDENT_REVIEW); that any inhabitant of `ConeMomentInterface`\nexists, or that its laws are the conditional law `A | V = 0` of the reference field (the laws are\nhypothesis fields of the given `I`, not derived here); the main-side constants\n`UniversalLaw.Side24.fourth_moment_of_trace` and `exponential_moment_of_trace`, which\nkernel-check `3 (5/3)^2 = 25/3` and `1 + 5/3 = 8/3` on main and are neither imported nor\nre-stated here (the same arithmetic is discharged inline by `ring`); `ConeMomentD2Identity`,\n`RayleighSquareLaw` or any cone moment; any enclosure of the coefficient; the statement module's\nown `Does not claim:` text (the statement packet is not edited here); the disposition of\n`side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the register, not derived here;\nnonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1." + }, + { + "kind": "theorem", + "unqualified_name": "rayleighSquareLaw", + "line": 585, + "source_header": "ral_comp_s I (fun t => Real.exp (-(t ^ 2) / 2)) (by fun_prop)\n rw [e, Aux.tm_exp_moment]\n\n/-! ## The law of `R^2` for every inhabitant of the interface -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.RayleighSquareLaw` (claim `side24-coefficient`).\nMethod: for `a ≥ 0`, `P {x^2 + y^2 ≤ a}` is the measure of the closed disk of radius `sqrt a`\nunder `gaussianReal 0 1 ⊗ gaussianReal 0 1` (`Aux.rl_prob_eq_disk_measure`, from the law\n`Aux.rl_law_xy` of `(x, y)` obtained as the second marginal of the interface's product law\n`sxy_law`, after `Aux.tm_aemeasurable_triple`, shared with `TraceMoments`, derives\na.e.-measurability of the triple from the\nlaw by the Dirac-versus-`NullSingletonClass` argument); that disk measure is\n`ENNReal.ofReal (1 - exp (-a/2))` (`Aux.rl_disk_measure`: `prod_withDensity`,\n`withDensity_apply`, `ofReal_integral_eq_lintegral_ofReal`, then polar coordinates\n`integral_comp_polarCoord_symm` and `setIntegral_prod_mul` in `Aux.rl_disk_integral`, with the\nangular integral `2π` and the radial integral by the fundamental theorem of calculus); the\nright-hand side `∫_0^a exp (-z/2)/2 dz` is the same number `1 - exp (-a/2)`\n(`Aux.rl_rhs_integral`), and `ENNReal.toReal_ofReal` closes.\nDoes not establish: the informal Section 1 display \"The variable R^2 has density e^(-z/2)/2\" of\nthe source as the source's object, nor its review and acceptance (the alignment of the interface\nfields `x`, `y`, `P`, `sxy_law` and of `gaussianReal` with the source's `x, y ~ N(0, 1)` is\nPENDING_INDEPENDENT_REVIEW); from the Prop's own `Does not claim:` line, \"the law (statement\nonly)\": the law is proved here only for the formal objects of the Prop, as the distribution\nfunction `P(R^2 ≤ a)` for `a ≥ 0`, not as a density and not for the source's variable; and\n\"measurability of the event (if the event is not measurable, `P` is its outer measure)\":\nthe formal event `{x^2 + y^2 ≤ a}` is the preimage of the closed disk, a measurable set\n(`Aux.rl_measurableSet_disk`), under the a.e.-measurable coordinate map `(x, y)`\n(`Aux.rl_aemeasurable_xy`); `Measure.map_apply_of_aemeasurable` transports the measure along that\nmap, so `P` of the event equals the disk measure under the law. The preimage is thereby\nnull-measurable for `I.P` (`AEMeasurable.nullMeasurableSet_preimage`); `MeasurableSet` of the\nsample-space preimage is not asserted (`ConeMomentInterface` assumes neither that `I.P` is\ncomplete nor that the coordinate fields are measurable), and nothing is established about any\nother event; that any inhabitant of\n`ConeMomentInterface` exists, or that its laws are the conditional law `A | V = 0` of the\nreference field (the laws are hypothesis fields of the given `I`, not derived here);\n`ConeMomentD2Identity` or any cone moment; any enclosure of the coefficient; the statement\nmodule's own text (the statement packet is not edited here); the disposition of\n`side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the register, not derived here;\nnonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/\nthe" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Images.lean", + "sha256": "ca643c39144400074658c39bbdd0f04ac47d29bd0c59fc2327d5a90d4f5ae392", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "ib_iteratedFDeriv_tsum_of_isOpen", + "line": 75, + "source_header": "x\n\n/-! ## `ib_`: helpers for `ImageBound` -/\n\n/-- Local version of Mathlib's `iteratedFDeriv_tsum`: for summands that are each `C^N` on the whole\nspace, summable bounds over an open preconnected set `U` on their derivatives of every order `≤ N`\ngive, for every `k ≤ N`, the term-wise `k`-th iterated derivative at every point of `U`. Same\ninduction as Mathlib's global lemma, with the local `hasFDerivAt_tsum_of_isPreconnected` and\n`Filter.EventuallyEq.fderiv_eq` on `U`. -/\ntheorem ib_iteratedFDeriv_tsum_of_isOpen {α E F : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]\n [NormedAddCommGroup F] [CompleteSpace F] [NormedSpace ℝ F]\n {f : α → E → F} {v : ℕ → α → ℝ} {N : ℕ∞} {U : Set E}\n (hU : IsOpen U) (hU' : IsPreconnected U)\n (hf : ∀ i, ContDiff ℝ N (f i))\n (hv : ∀ k : ℕ, (k : ℕ∞) ≤ N → Summable (v k))\n (h'f : ∀ (k : ℕ) (i : α) (x : E), (k : ℕ∞) ≤ N → x ∈ U →\n ‖iteratedFDeriv ℝ k (f i) x‖ ≤ v k i)\n {k : ℕ} (hk : (k : ℕ∞) ≤ N) {x : E} (hx : x ∈ U) :\n iteratedFDeriv ℝ k (fun y => ∑' n, f n y) x = ∑' n, iteratedFDeriv ℝ k (f" + }, + { + "kind": "theorem", + "unqualified_name": "ib_pairingSum_mono", + "line": 114, + "source_header": "_tsum\n\n/-- The pairing sums are monotone in `r ≥ 0`: every term is a nonnegative multiple of `r^m`. -/\ntheorem ib_pairingSum_mono (q : ℕ) {r s : ℝ} (hr : 0 ≤ r) (hrs : r ≤ s) :\n pairingSum q r ≤ pairing" + }, + { + "kind": "theorem", + "unqualified_name": "ib_pairingSum_le", + "line": 124, + "source_header": ")) hden\n\n/-- For `q ≤ 6` and `r ≥ 0`, `pairingSum q r ≤ 76 (1 + r)^6`. -/\ntheorem ib_pairingSum_le (q : ℕ) (hq : q ≤ 6) {r : ℝ} (hr : 0 ≤ r) :\n pairingSum q r ≤ 76 * (1" + }, + { + "kind": "theorem", + "unqualified_name": "ib_poly_gauss_le", + "line": 131, + "source_header": "q hq _ h1\n\n/-- `(1 + r)^6 e^(-r^2/2) ≤ 720 e^2 e^(-r^2/4)` for `r ≥ 0`: `(1 + r)^6 ≤ 6! e^(1 + r)` and\n`1 + r - r^2/2 ≤ 2 - r^2/4`, that is `(r - 2)^2 ≥ 0`. -/\ntheorem ib_poly_gauss_le {r : ℝ} (hr : 0 ≤ r) :\n (1 + r) ^ 6 * Real.exp (-(r ^ 2) / 2) ≤ 720 * Real.exp 2 * Real.exp (-(" + }, + { + "kind": "theorem", + "unqualified_name": "ib_exp_shift_le", + "line": 149, + "source_header": ":= by ring\n\n/-- `exp(-‖z + v‖^2/4) ≤ exp(‖z‖^2/4) exp(-‖v‖^2/8)`, from `‖v‖ ≤ ‖z + v‖ + ‖z‖`. -/\ntheorem ib_exp_shift_le {d : ℕ} (z v : E d) :\n Real.exp (-(‖z + v‖ ^ 2) / 4) ≤ Real.exp (‖z‖ ^ 2 / 4) * Real.exp (-(" + }, + { + "kind": "theorem", + "unqualified_name": "ib_exp_lattice_eighth", + "line": 161, + "source_header": "+ v‖ - ‖z‖)]\n\n/-- `exp(-‖24 n‖^2/8) = ∏ i, exp(-72 n_i^2)`. -/\ntheorem ib_exp_lattice_eighth (d : ℕ) (n : Fin d → ℤ) :\n Real.exp (-(‖latticeVec d n‖ ^ 2) / 8) = ∏ i, Real.exp (-72 * ((n i" + }, + { + "kind": "theorem", + "unqualified_name": "ib_translate_bound", + "line": 170, + "source_header": "_ => ?_\n ring\n\n/-- On the unit ball, every derivative of order `k ≤ 6` of a lattice translate of `Kinf d` is\nbounded by the summable family `C ∏ i, exp(-72 n_i^2)`. -/\ntheorem ib_translate_bound {d : ℕ} (k : ℕ) (hk : k ≤ 6) (n : Fin d → ℤ) {z : E d}\n (hz : z ∈ Metric.ball (0 : E d) 1) :\n ‖iteratedFDeriv ℝ k (Kinf d) (z + latticeVec d n)‖ ≤\n 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * ∏ i, Real.exp (-72 * ((n" + }, + { + "kind": "theorem", + "unqualified_name": "ib_latticeVec_zero", + "line": 202, + "source_header": ") ^ 2) := by ring\n\n/-- `latticeVec d 0 = 0`. -/\ntheorem ib_latticeVec_zero (d : ℕ) :" + }, + { + "kind": "theorem", + "unqualified_name": "ib_theta0_ge_one", + "line": 207, + "source_header": "simp [latticeVec]\n\n/-- `θ(0) = ∑_n exp(-‖24 n‖^2/2) ≥ 1`: the summand at `n = 0` is `1` and the others are positive. -/\ntheorem ib_theta0_ge_one (d : ℕ)" + }, + { + "kind": "theorem", + "unqualified_name": "ib_K24_eq", + "line": 213, + "source_header": "ticeVec_zero] using h\n\n/-- `K_24` as a sum of scaled lattice translates of `Kinf d`. -/\ntheorem ib_K24_eq (d : ℕ) :\n K24 d = fun z => ∑' n : Fin d → ℤ, (thetaSum24 d 0)⁻¹ • Kinf" + }, + { + "kind": "theorem", + "unqualified_name": "ib_contDiff_term", + "line": 221, + "source_header": ", div_eq_inv_mul]\n rfl\n\n/-- Each scaled translate is `C^∞`. -/\ntheorem ib_contDiff_term (d : ℕ) (c : ℝ) (n : Fin d → ℤ) :\n ContDiff ℝ ∞ (fun z : E d => c • Kin" + }, + { + "kind": "theorem", + "unqualified_name": "ib_iteratedFDeriv_term", + "line": 226, + "source_header": "Diff_const)).const_smul c\n\n/-- The iterated derivative of a scaled translate. -/\ntheorem ib_iteratedFDeriv_term (d k : ℕ) (c : ℝ) (n : Fin d → ℤ) (z : E d) :\n iteratedFDeriv ℝ k (fun z : E d => c • Kinf d (z + latticeVec d n)) z =\n c • iteratedFDeriv ℝ k (K" + }, + { + "kind": "theorem", + "unqualified_name": "ib_summable_bound", + "line": 238, + "source_header": "ratedFDeriv_comp_add_right]\n\n/-- The summable bound family is summable. -/\ntheorem ib_summable_bound (d : ℕ) :\n Summable (fun n : Fin d → ℤ =>\n 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * ∏ i, Real.exp" + }, + { + "kind": "theorem", + "unqualified_name": "ib_term_bound", + "line": 245, + "source_header": "72 (by norm_num))).mul_left _\n\n/-- The derivative bound of a scaled translate on the unit ball, for a scale `0 ≤ c ≤ 1`. -/\ntheorem ib_term_bound {d : ℕ} {c : ℝ} (hc0 : 0 ≤ c) (hc1 : c ≤ 1) (k : ℕ) (hk : k ≤ 6)\n (n : Fin d → ℤ) {z : E d} (hz : z ∈ Metric.ball (0 : E d) 1) :\n ‖iteratedFDeriv ℝ k (fun z : E d => c • Kinf d (z + latticeVec d n)) z‖ ≤\n 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * ∏ i, Real." + }, + { + "kind": "theorem", + "unqualified_name": "ib_K24_deriv", + "line": 257, + "source_header": ":= ib_translate_bound k hk n hz\n\n/-- The term-wise iterated derivative of `K_24` at `0`, as continuous multilinear maps. -/\ntheorem ib_K24_deriv (d q : ℕ) (hq : q ≤ 6) :\n iteratedFDeriv ℝ q (K24 d) 0 =\n ∑' n : Fin d → ℤ, (thetaSum24 d 0)⁻¹ • iteratedFDe" + }, + { + "kind": "theorem", + "unqualified_name": "ib_intNormSq_ge_one", + "line": 280, + "source_header": "ib_iteratedFDeriv_term, zero_add]\n\n/-- Nonzero integer vectors have `intNormSq d n ≥ 1`. -/\ntheorem ib_intNormSq_ge_one {d : ℕ} {n : Fin d →" + }, + { + "kind": "theorem", + "unqualified_name": "ib_lattice_term", + "line": 293, + "source_header": "eg _)\n (Finset.mem_univ i)\n\n/-- For `n ≠ 0`: `‖24 n‖^6 exp(-‖24 n‖^2/2) = 24^6 imageTerm d n`. -/\ntheorem ib_lattice_term (d : ℕ) {n : Fin d → ℤ} (hn : n ≠ 0) :\n ‖latticeVec d n‖ ^ 6 * Real.exp (-(‖latticeVec d" + }, + { + "kind": "theorem", + "unqualified_name": "ib_gauss_le_image", + "line": 303, + "source_header": "ormSq d n := by ring\n rw [he]\n ring\n\n/-- For `n ≠ 0`: `exp(-‖24 n‖^2/2) ≤ imageTerm d n` (the factor `|n|^6 ≥ 1`). -/\ntheorem ib_gauss_le_image (d : ℕ) {n : Fin d → ℤ} (hn : n ≠ 0) :\n Real.exp (-(‖(0 : E d) + la" + }, + { + "kind": "theorem", + "unqualified_name": "ib_final_constant", + "line": 316, + "source_header": "_of_nonneg_right h3 (Real.exp_pos _).le\n\n/-- The image bound's constant: `1458 (76 · 24^6 + 15) e^(-288) < imageConstE`. -/\ntheorem ib_final_constant :\n 1458 * (76 * 24" + }, + { + "kind": "theorem", + "unqualified_name": "ec_mem_jetDirs", + "line": 325, + "source_header": "imageConstE := by norm_num [imageConstE]\n\n/-! ## `ec_`: helpers for `EntrywiseCovarianceBound` (`ec_length_jetDirs_le` also serves `co_C24_symm`) -/\n\n/-- When `u` is itself a frame vector (`hu : ∃ j, u = R j`), every direction attached to a joint\ncoordinate is a frame vector `R j`. -/\ntheorem ec_mem_jetDirs {d : ℕ} {u : E d} {R : Fin d → E d} (hu : ∃ j, u = R j)\n (x : JointIndex d) {v : E" + }, + { + "kind": "theorem", + "unqualified_name": "ec_length_jetDirs_le", + "line": 341, + "source_header": "· exact ⟨p.1.1, h⟩\n · exact ⟨p.1.2, h⟩\n\n/-- Each joint coordinate carries at most three directions. -/\ntheorem ec_length_jetDirs_le {d : ℕ} (u : E d) (R : Fin d → E d) (x : J" + }, + { + "kind": "theorem", + "unqualified_name": "ec_svecScale_bounds", + "line": 346, + "source_header": "rcases x with i | (_ | p) <;> simp [jetDirs]\n\n/-- The `svec` scale is `1` or `√2`: nonnegative and at most `√2`. -/\ntheorem ec_svecScale_bounds {d : ℕ} (x : JointIndex d) :" + }, + { + "kind": "theorem", + "unqualified_name": "ec_scale_le", + "line": 360, + "source_header": "one, h1⟩\n · exact ⟨Real.sqrt_nonneg _, le_rfl⟩\n\n/-- `|svecScale a · svecScale b · (-1)^n| ≤ 2`. -/\ntheorem ec_scale_le {d : ℕ} (a b : JointIndex d) (n : ℕ) :" + }, + { + "kind": "theorem", + "unqualified_name": "co_kinf_analytic", + "line": 370, + "source_header": "eg _)\n _ = 2 := Real.mul_self_sqrt (by norm_num)\n\n/-! ## `co_`: helpers for `CovarianceOrdering` -/\n\n/-- `Kinf d` is analytic (`C^ω`): the exponential of a polynomial. -/\nt" + }, + { + "kind": "theorem", + "unqualified_name": "co_kinf_perm", + "line": 377, + "source_header": "ontDiff_exp.comp ((contDiff_norm_sq ℝ).neg.div_const 2)\n\n/-- The iterated derivatives of `Kinf d` are symmetric at every point (analyticity and\n`ContDiffAt.iteratedFDeriv_comp_perm`). -/\ntheorem co_kinf_perm {d n : ℕ} (y : E d) (v : Fin n → E d) (σ : Equiv.Perm (Fin n)) :\n iteratedFDeriv" + }, + { + "kind": "theorem", + "unqualified_name": "co_kinf_neg_apply", + "line": 383, + "source_header": "_kinf_analytic d).contDiffAt.iteratedFDeriv_comp_perm v σ\n\n/-- Evenness of `Kinf d` at a general point: `D^q Kinf (-y) v = (-1)^q D^q Kinf y v`. -/\ntheorem co_kinf_neg_apply {d : ℕ} (q : ℕ) (y : E d) (v : Fin q → E d) :\n iteratedFDeriv ℝ q (Kinf" + }, + { + "kind": "theorem", + "unqualified_name": "co_latticeVec_neg", + "line": 401, + "source_header": "rw [h2, ← mul_assoc, ← pow_add, ← two_mul, pow_mul]\n simp\n\n/-- `latticeVec d (-n) = -latticeVec d n`. -/\ntheorem co_latticeVec_neg" + }, + { + "kind": "theorem", + "unqualified_name": "co_K24_apply", + "line": 406, + "source_header": "ec d (-n) = -latticeVec d n := by\n ext i\n simp [latticeVec]\n\n/-- The term-wise derivative of `K_24` at `0`, evaluated at a tuple. -/\ntheorem co_K24_apply (d q : ℕ) (hq : q ≤ 6) (v : Fin q → E d) :\n iteratedFDeriv ℝ q (K24 d) 0 v =\n (thetaSum24 d 0)⁻¹ * ∑" + }, + { + "kind": "theorem", + "unqualified_name": "co_K24_odd", + "line": 426, + "source_header": "ceVec d n) v\n from tsum_congr fun n => rfl, tsum_mul_left]\n\n/-- Odd-order derivatives of `K_24` at `0` of order at most `6` vanish (reindex the lattice sum by\n`n ↦ -n`, with `co_kinf_neg_apply`). -/\ntheorem co_K24_odd (d q : ℕ) (hq : q ≤ 6) (hodd :" + }, + { + "kind": "theorem", + "unqualified_name": "co_derivContraction_cast", + "line": 442, + "source_header": "_neg\n have h0 : ∑' n, f n = 0 := by linarith\n rw [h0, mul_zero]\n\n/-- `derivContraction` through a length cast. -/\ntheorem co_derivContraction_cast {d : ℕ} (K : E d → ℝ) (x : E d) (l : List (E d)) (n : ℕ)\n (h : l.length = n) :\n derivContraction d" + }, + { + "kind": "def", + "unqualified_name": "co_rot", + "line": 449, + "source_header": "ℝ n K x (fun i => l.get (Fin.cast h.symm i)) := by\n subst h\n rfl\n\n/-- The block rotation `i ↦ i + m` (mod `m + k`) of `Fin (m + k)" + }, + { + "kind": "theorem", + "unqualified_name": "co_kinf_swap", + "line": 468, + "source_header": "simp only [h1, dite_false]\n split_ifs with h2 <;> simp <;> omega\n\n/-- Swapping the two blocks of a contraction list does not change a contraction of `Kinf d`. -/\ntheorem co_kinf_swap {d : ℕ} (x : E d) (l₁ l₂ : List (E d)) :\n derivContrac" + }, + { + "kind": "theorem", + "unqualified_name": "co_K24_swap", + "line": 490, + "source_header": "(by omega), List.getElem_append_right (by omega)]\n congr 1\n omega\n\n/-- The same block swap for `K_24` at `0`, for lists of total length at most `6`. -/\ntheorem co_K24_swap {d : ℕ} (l₁ l₂ : List (E d)) (hl : (l₁ ++ l₂).length ≤ 6) :\n derivCon" + }, + { + "kind": "theorem", + "unqualified_name": "co_K24_odd_list", + "line": 501, + "source_header": "refine tsum_congr fun n => ?_\n exact co_kinf_swap (latticeVec d n) l₁ l₂\n\n/-- A contraction of `K_24` at `0` against a list of odd length at most `6` vanishes. -/\ntheorem co_K24_odd_list {d : ℕ} (l : List (E d)) (hl : l" + }, + { + "kind": "theorem", + "unqualified_name": "co_C24_symm", + "line": 506, + "source_header": "gth) :\n derivContraction d (K24 d) 0 l = 0 :=\n co_K24_odd d _ hl hodd _\n\n/-- `C_24` is symmetric, for every `u` and every `R`. -/\ntheorem co_C24_symm {d : ℕ} (u : E" + }, + { + "kind": "theorem", + "unqualified_name": "co_C24_hermitian", + "line": 535, + "source_header": "ngth_append, add_comm]; exact ho\n rw [co_K24_odd_list _ hba hodd]\n ring\n\n/-- `C_24` is Hermitian (real symmetric). -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "co_quad_le", + "line": 539, + "source_header": "sHermitian :=\n Matrix.IsHermitian.ext fun i j => by simp [co_C24_symm u R i j]\n\n/-- An entrywise bound `|A i j| ≤ c` bounds the quadratic form by `c · card · (x ⬝ᵥ x)`. -/\ntheorem co_quad_le {ι : Type*} [Fintype ι] (A : Matrix ι ι ℝ) {c : ℝ} (hc : 0 ≤ c)\n (hA : ∀ i" + }, + { + "kind": "theorem", + "unqualified_name": "co_card_le", + "line": 571, + "source_header": "ul_of_nonneg_left h3 hc\n _ = c * Fintype.card ι * (x ⬝ᵥ x) := by rw [h4]; ring\n\n/-- `card (JointIndex d) ≤ 13` for `d" + }, + { + "kind": "theorem", + "unqualified_name": "co_margin", + "line": 582, + "source_header": "[JointIndex, Fintype.card_sum]\n rw [h2]\n have : d * d ≤ 9 := by nlinarith\n omega\n\n/-- The margin: `2 image" + }, + { + "kind": "theorem", + "unqualified_name": "imageBound", + "line": 590, + "source_header": "eConstE * 13 ≤ epsilon / 3 := by\n norm_num [imageConstE, epsilon]\n\nend Aux\n\nopen Aux\n\n/-- Proves: `UniversalLaw.Spec.Side24.ImageBound` (claim `side24-coefficient`), for the formal\n`K24`, `Kinf` and `thetaSum24` of `Specifications.Side24`: for `d ∈ {2, 3}`, every order `q ≤ 6`\nand every unit tuple `u`, `|D^q K_24(0) u - D^q K_∞(0) u| < imageConstE`.\nMethod: `D^q K_24(0) = θ(0)⁻¹ ∑_n D^q K_∞(24 n)` by the local term-wise derivative on the unit\nball (`Aux.ib_K24_deriv`, from `Aux.ib_iteratedFDeriv_tsum_of_isOpen`); splitting off `n = 0` in\nboth sums gives `θ(0)⁻¹ (∑_{n ≠ 0} D^q K_∞(24 n) u - (θ(0) - 1) D^q K_∞(0) u)`, bounded, with\n`θ(0) ≥ 1` (`Aux.ib_theta0_ge_one`) and `0 ≤ θ(0) - 1 ≤ ∑_{n ≠ 0} imageTerm d n` (`|n|^6 ≥ 1`,\n`Aux.ib_gauss_le_image`), by `76 · 24^6 · 1458 e^(-288) + 15 · 1458 e^(-288)` through the packet's\ntheorems\n`Side24Analysis.derivativeBoundAtLeastOne`, `derivativeBoundAtZero` and `latticeImageSumBound`,\nand `1458 (76 · 24^6 + 15) e^(-288) < imageConstE` through `Side24Elementary.exponentialBounds`.\nDoes not establish: display (2) of the source as the source's object (the alignment of `E d`,\n`Kinf`, `K24`, `thetaSum24`, `IsUnitTuple` and Mathlib's `iteratedFDeriv` with the source's\n`R^d`, `K_infty`, `K_24`, unit directions and derivatives is PENDING_INDEPENDENT_REVIEW); any\nbound for `q > 6` or `d ∉ {2, 3}`; differentiability of `K24` as a statement (it is used inside the\nproof, on the unit ball, through the helper `Aux.ib_iteratedFDeriv_tsum_of_isOpen`, which is a\nhelper of this module, not an inventory theorem and not a Mathlib result); the Prop's hypothesis\n`ThetaSummable d` is not used (the packet's `thetaSummable` proves it for every `d`); the\nstatement module's own `Does not claim:` text, which describes the statement packet and is not\nedited here; the round-4 triage verdict on `ImageBound` (BLOCKED_MISSING_MATHLIB), which is\ntranscribed in the register and not altered here; any enclosure of the coefficient `c_{d,24}`;\nthe disposition of `side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the register,\nnot derived here; nonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. It\npromotes, closes, discharg" + }, + { + "kind": "theorem", + "unqualified_name": "entrywiseCovarianceBound", + "line": 721, + "source_header": "^ 6 + 15) * Real.exp (-288) := hnum.trans hTb\n _ < imageConstE := ib_final_constant\n\n/-- Proves: `UniversalLaw.Spec.Side24.EntrywiseCovarianceBound` (claim `side24-coefficient`),\nfor the formal `C24` and `Cref` of `Specifications.Side24`: for `d ∈ {2, 3}` and every\northonormal frame `R` with `u = R 0`, `|C_24 a b - C_ref a b| ≤ 2 imageConstE` for every pair of\njoint coordinates.\nMethod: the two entries share the factor `svecScale a · svecScale b · (-1)^|b|`, of absolute value\nat most `2`, and their derivative contractions are along the list `jetDirs a ++ jetDirs b` of at\nmost six frame vectors, each of norm one; `imageBound` bounds the difference of the contractions\nby `imageConstE` (strictly).\nDoes not establish: the source's Section 3 sentence as the source's object (the alignment of\n`jetDirs`, `svecScale`, `jointCov`, `C24` and `Cref` with the source's jet, `svec` scaling and\njoint covariances is PENDING_INDEPENDENT_REVIEW); that `C24` or `Cref` is the covariance of any\nrandom vector (no field is constructed); the spectral-norm bound `20E` (not specified); the\nordering `CovarianceOrdering` (a separate theorem of this module); the Prop's hypothesis\n`ThetaSummable d` is passed to `imageBound`, which does not use it; the round-4 triage verdict on\n`EntrywiseCovarianceBound` (BLOCKED_MISSING_MATHLIB), which is transcribed in the register and not\naltered here; any enclosure of the coefficient `c_{d,24}`; the disposition of\n`side24-coefficient` (REVIEWED_SCOPED); nonauthor review or acceptance of\nSIDE24-COEFFICIENT-D23-20260924-v1. It promotes, closes, discharges or reclassifies nothing" + }, + { + "kind": "theorem", + "unqualified_name": "covarianceOrdering", + "line": 768, + "source_header": "mageConstE :=\n mul_le_mul (ec_scale_le a b _) himg.le (abs_nonneg _) (by norm_num)\n\n/-- Proves: `UniversalLaw.Spec.Side24.CovarianceOrdering` (claim `side24-coefficient`), for the\nformal `C24` and `Cref` of `Specifications.Side24`: for `d ∈ {2, 3}` and every orthonormal frame\n`R` with `u = R 0`, `C_24 - (1 - epsilon) C_ref` and `(1 + epsilon) C_ref - C_24` are positive\nsemidefinite in Mathlib's sense (`Matrix.PosSemidef`, which includes `IsHermitian`).\nMethod: `C_24` is symmetric (`Aux.co_C24_hermitian`): by the term-wise derivative a contraction of\n`K_24` at `0` of total order at most `6` is `θ(0)⁻¹ ∑_n` of contractions of the analytic `Kinf d`\nat `24 n`, which are\ninvariant under the block swap (`ContDiffAt.iteratedFDeriv_comp_perm`), and odd total orders\nvanish by reindexing `n ↦ -n` together with `D^q Kinf(-y) = (-1)^q D^q Kinf(y)`\n(`Aux.co_kinf_neg_apply`, from the round-5 helper `Side24Covariance.Aux.cv_kinf_comp_neg`), so the\nsign `(-1)^|b|` may be replaced by `(-1)^|a|`. `C_ref` is\nsymmetric and `C_ref - I/3` positive semidefinite by `Side24Covariance.referenceCovarianceLowerBound`.\nWith `Δ = C_24 - C_ref`, `|Δ a b| ≤ 2 imageConstE` (`entrywiseCovarianceBound`), so\n`|x ⬝ Δ x| ≤ 2 imageConstE · card · (x ⬝ x)` (Cauchy-Schwarz), the cardinality of the joint index\nis at most `d + 1 + d^2 ≤ 13` for `d ≤ 3` (its exact value `6` or `10` is not used), and\n`26 imageConstE (x ⬝ x) ≤ (epsilon / 3) (x ⬝ x) ≤ epsilon (x ⬝ C_ref x)` (`Aux.co_margin` and\n`C_ref - I/3 ≥ 0`), which gives both orderings.\nDoes not establish: display (3) of the source as the source's object (the alignment of `C24`,\n`Cref` and Mathlib's `Matrix.PosSemidef`, `IsHermitian` included, with the source's covariances and\npositive-semidefinite order is PENDING_INDEPENDENT_REVIEW); that `C24` or `Cref` is the\ncovariance of any random vector (no field is constructed); the passage to marginal and\nconditional covariances (not specified); the source's route through the spectral-norm bound `20E`\nand `60E < epsilon` (not reproduced: the proof uses the cruder `2E` times at most `13` coordinates\nand `26E ≤ epsilon / 3`, that is `78E ≤ epsilon`, decided by `norm_num` in the helper\n`Aux.co_margin`; main's `UniversalLaw.Side24.covariance_relative_bound` is neither imported, cited\nnor relied on);\nsymmetry of `Cref d u R` for a general `u` or frame (it is taken from the round-5 theorem at\n`u = R 0` in an orthonormal frame; the helper `Aux.co_C24_hermitian`, stated for every `d`, `u`\nand `R`, is a helper, not an inventory theorem); the Prop's hypothesis `ThetaSummable d` is only\nforwarded, through `entrywiseCovarianceBound`, to `imageBound`, which does not use it; the round-4\ntriage verdict on `CovarianceOrdering` (BLOCKED_MISSING_MATHLIB), which is transcribed in the\nregister and not altered here; any enclosure of the coefficient `c_{d,24}`; the disposition of\n`side24-coefficient` (REVIEWED_SCOPED); nonauthor review or acceptance of\nSIDE24-COEFFICIENT-D23-20260924-v1. It promotes, closes, discharges or reclas" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Structure.lean", + "sha256": "a3c9f514a4d482a99402a57c0097e1819fedbfd71faffaafade3b2050d797598", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "block_nonempty", + "line": 25, + "source_header": "x\n\n/-! ### Blocks of a realized family -/\n\n/-- The blocks of a realized family are nonempty (they have `a_i d_i + 1 ≥ 1` elements). -/\ntheorem block_nonempty {X : Type} [Fintype X] {F : RealizedData X} (hF : IsRealizedFamily F)\n (i : Fin F.b) : (block F i).Non" + }, + { + "kind": "theorem", + "unqualified_name": "blk_eq_of_mem_block", + "line": 33, + "source_header": "pos _\n\n/-- An element of `block F i` has block index `i`. -/\ntheorem blk_eq_of_mem_block {X : Type} [Fintype X] {F : RealizedData X} {i : Fin F.b} {v : X}\n (hv : v ∈ block F i) : F.bl" + }, + { + "kind": "theorem", + "unqualified_name": "mem_block_iff", + "line": 38, + "source_header": "sing hv\n\n/-- Membership in a block. -/\ntheorem mem_block_iff {X : Type} [Fintype X] {F : RealizedData X} {i : Fin F.b} {v : X} :\n v ∈ block F i ↔ F." + }, + { + "kind": "theorem", + "unqualified_name": "block_injective", + "line": 43, + "source_header": "p [block]\n\n/-- The block map of a realized family is injective (blocks are nonempty fibres). -/\ntheorem block_injective {X : Type} [Fintype X] {F : RealizedData X}\n (hF : IsRealizedFamily F) : Function.Injectiv" + }, + { + "kind": "theorem", + "unqualified_name": "famPrice_fullBlockFamily", + "line": 51, + "source_header": "_block hvj]\n\n/-- The price of the full-block family is the sum of the block prices. -/\ntheorem famPrice_fullBlockFamily {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) (c : X → ℝ) :\n famPrice c (fullBlockFamily F) = ∑ i, genPrice" + }, + { + "kind": "theorem", + "unqualified_name": "block_benchmark816", + "line": 58, + "source_header": "ective hF h)]\n\n/-! ### The six-block benchmark -/\n\ntheorem block_benchmark816 (i : Fin 6) :\n block benchmark816 i = {i} ×ˢ (univ : Fi" + }, + { + "kind": "theorem", + "unqualified_name": "card_block_benchmark816'", + "line": 66, + "source_header": "exact Iff.rfl\n\ntheorem card_block_benchmark816' (i : Fin 6) : (block benchmark81" + }, + { + "kind": "theorem", + "unqualified_name": "card_block_benchmark816", + "line": 69, + "source_header": "ntype.card_fin]\n\n/-- The same statement at the dependent index type `Fin benchmark816.b` (definitionally `Fin 6`),\nso that it can be used by `rw` on goals produced from the general definitions. -/\ntheorem card_block_benchmark816 (i : Fin benchmark816.b) : (block benchmark" + }, + { + "kind": "theorem", + "unqualified_name": "mem_H_benchmark816'", + "line": 74, + "source_header": "k_benchmark816' i\n\ntheorem mem_H_benchmark816' {e : Finset (Fin 6)} (he : e ∈ completeClutter" + }, + { + "kind": "theorem", + "unqualified_name": "mem_H_benchmark816", + "line": 78, + "source_header": "t he\n exact he.2\n\ntheorem mem_H_benchmark816 {e : Finset (Fin benchmark816.b)} (he : e ∈ benchmark816.H)" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816_isRealized", + "line": 82, + "source_header": "_benchmark816' he\n\ntheorem benchmark816_isRealized : IsRealizedFa" + }, + { + "kind": "theorem", + "unqualified_name": "famPrice_const_benchmark816", + "line": 92, + "source_header": "benchmark816 hf])\n\n/-- The price of the six full blocks at a constant price vector. -/\ntheorem famPrice_const_benchmark816 (r : ℝ) :\n famPrice (fun _ => r) (fullBlockFamily benchmar" + }, + { + "kind": "theorem", + "unqualified_name": "neg_log_one_sub_gt", + "line": 103, + "source_header": "_eq_mul]\n norm_num\n\n/-- Lower bound on `-log(1 - x)` from the Taylor estimate of Mathlib with three terms. -/\ntheorem neg_log_one_sub_gt (x : ℝ) (hx0 : 0 < x) (hx1 : x < 1 / 4) :\n x + x ^ 2 /" + }, + { + "kind": "theorem", + "unqualified_name": "completeClutter_edge_iff", + "line": 119, + "source_header": "linarith [h2, key]\n\n\n/-! ### Palette numbers of complete clutters -/\n\n/-- For the clutter of all `(s+1)`-subsets, the edge condition of a palette says exactly that every\nlabel lies in at most `s` of the label sets. -/\ntheorem completeClutter_edge_iff (b s : ℕ) {K : ℕ} (P : Fin b → Finset (Fin K)) :\n (∀ e ∈ completeClutter b s, ∀ ℓ : Fin K, ∃ i ∈ e, ℓ ∉ P i) ↔\n ∀ ℓ : Fin K, (univ.filter (fu" + }, + { + "kind": "theorem", + "unqualified_name": "sum_card_eq_sum_fiber", + "line": 147, + "source_header": "have := h ℓ\n omega\n\n/-- Double counting: the total size of the label sets is the sum over labels of their\nmultiplicities. -/\ntheorem sum_card_eq_sum_fiber {b K : ℕ} (P : Fin b → Finset (Fin K)) :\n ∑ i, (P i).card = ∑ ℓ : Fin K, (univ.filt" + }, + { + "kind": "theorem", + "unqualified_name": "palette_lower_bounds", + "line": 159, + "source_header": "rd_filter]\n exact sum_comm\n\n/-- The two necessary conditions for a feasible palette of the complete clutter. -/\ntheorem palette_lower_bounds {b s K : ℕ} {d : Fin b → ℕ}\n (hK : IsPaletteFeasible b (completeClutter b s) d K) :\n (∀ i" + }, + { + "kind": "def", + "unqualified_name": "prefixSum", + "line": 171, + "source_header": "d_fin, smul_eq_mul, mul_comm]\n\n/-- Prefix sums of the demands: `c_i = sum_{j < i} d_j`. -/\ndef prefixSum {b : ℕ}" + }, + { + "kind": "theorem", + "unqualified_name": "prefixSum_add_le_of_lt", + "line": 175, + "source_header": "iv.filter (fun j => j < i), d j\n\ntheorem prefixSum_add_le_of_lt {b : ℕ} (d : Fin b → ℕ) {i i' : Fin b} (h : i < i') :\n prefi" + }, + { + "kind": "theorem", + "unqualified_name": "prefixSum_add_le", + "line": 187, + "source_header": "· exact h\n · exact hj.trans h\n\ntheorem prefixSum_add_le {b : ℕ} (d : Fin b → ℕ) (i : Fin b) :" + }, + { + "kind": "def", + "unqualified_name": "cycLabel", + "line": 194, + "source_header": "e_sum_of_subset (subset_univ _)\n\n/-- The cyclic label of a position. -/\ndef cycLabel (K" + }, + { + "kind": "def", + "unqualified_name": "cycPalette", + "line": 197, + "source_header": "Fin K := ⟨n % K, Nat.mod_lt _ hK⟩\n\n/-- The cyclic palette: block `i` receives the labels of the positions `c_i, ..., c_i + d_i - 1`\nreduced modulo `K`. -/\ndef cycPalette {b : ℕ} (d : Fin b → ℕ) (K : ℕ) (hK :" + }, + { + "kind": "theorem", + "unqualified_name": "mem_cycPalette", + "line": 202, + "source_header": "m d i + d i)).image (cycLabel K hK)\n\ntheorem mem_cycPalette {b : ℕ} (d : Fin b → ℕ) (K : ℕ) (hK : 0 < K) (i : Fin b) (ℓ : Fin K) :\n ℓ ∈ cycPalette d K hK i ↔\n ∃ n, n ∈ Ico (prefixSum d i) (p" + }, + { + "kind": "theorem", + "unqualified_name": "card_cycPalette", + "line": 208, + "source_header": "simp only [mem_image, Fin.ext_iff]\n\ntheorem card_cycPalette {b : ℕ} (d : Fin b → ℕ) (K : ℕ) (hK : 0 < K) (i : Fin b)\n (hd : d i ≤ K)" + }, + { + "kind": "def", + "unqualified_name": "firstPos", + "line": 227, + "source_header": "at h1\n omega\n\nopen Classical in\n/-- The first position of block `i` carrying the label `ℓ` (or `0` if there is none). -/\nnoncomputable def firstPos {b : ℕ} (d :" + }, + { + "kind": "theorem", + "unqualified_name": "firstPos_spec", + "line": 230, + "source_header": "i) ∧ n % K = ℓ then Nat.find h else 0\n\ntheorem firstPos_spec {b : ℕ} (d : Fin b → ℕ) (K ℓ : ℕ) (i : Fin b)\n (hex : ∃ n, n ∈ Ico (prefixSum d i) (prefixSum d i + d i) ∧ n % K = ℓ) :\n firstPos d K ℓ i ∈ Ico (prefixSum d i) (prefixSum" + }, + { + "kind": "theorem", + "unqualified_name": "card_residue_le", + "line": 237, + "source_header": "split_ifs\n exact Nat.find_spec hex\n\n/-- At most `s` positions below `s * K` carry a given residue modulo `K`. -/\ntheorem card_residue_le {K s D : ℕ} (hK : 0 < K) (hD : D ≤ s * K) (ℓ : ℕ) :\n ((range D" + }, + { + "kind": "theorem", + "unqualified_name": "palette_witness", + "line": 253, + "source_header": "2]\n _ = n' := Nat.div_add_mod n' K\n\n/-- The cyclic palette is feasible for the complete clutter whenever the two necessary conditions\nhold. -/\ntheorem palette_witness {b s K : ℕ} (d : Fin b → ℕ) (hdK : ∀ i, d i ≤ K)\n (hsum : ∑ i, d i ≤ s * K) : IsPa" + }, + { + "kind": "theorem", + "unqualified_name": "paletteNumber_completeClutter", + "line": 287, + "source_header": "refixSum_add_le_of_lt d hlt\n omega\n\n/-- The palette number of the complete clutter, display (P9), in expanded form. -/\ntheorem paletteNumber_completeClutter (b s : ℕ) (d : Fin b → ℕ) (hs : 1 ≤ s) :\n paletteNumber b (completeClutter b s) d =\n max (un" + }, + { + "kind": "theorem", + "unqualified_name": "isPaletteFeasible_sum", + "line": 317, + "source_header": "rw [mul_comm]; exact h2 : ∑ i, d i ≤ K * s)\n\n\n/-! ### Palettes exist and are upward closed -/\n\n/-- Disjoint label intervals give a feasible palette of size `sum d_i` for any clutter whose edges\nhave at least two elements. -/\ntheorem isPaletteFeasible_sum {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)\n (hH : ∀ e ∈ H, 2" + }, + { + "kind": "theorem", + "unqualified_name": "isPaletteFeasible_mono", + "line": 341, + "source_header": "ave := prefixSum_add_le_of_lt d hlt\n omega\n\n/-- Feasibility is upward closed in the palette size (for clutters with edges of size `≥ 2`). -/\ntheorem isPaletteFeasible_mono {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)\n (hH : ∀ e ∈ H, 2 ≤ e.card) {K K' : ℕ} (hKK' : K ≤ K')\n (h : IsPale" + }, + { + "kind": "theorem", + "unqualified_name": "isPaletteFeasible_paletteNumber", + "line": 369, + "source_header": ", _, hcast⟩ := hmem\n rw [← hcast]\n simp\n\n/-- The palette number is attained and bounded by `sum d_i` when every edge has size `≥ 2`. -/\ntheorem isPaletteFeasible_paletteNumber {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)\n (hH : ∀ e ∈ H, 2 ≤ e.ca" + }, + { + "kind": "theorem", + "unqualified_name": "isPaletteFeasible_of_paletteNumber_le", + "line": 376, + "source_header": "⟨∑ i, d i, isPaletteFeasible_sum H d hH⟩\n exact h\n\ntheorem isPaletteFeasible_of_paletteNumber_le {b : ℕ} (H : Finset (Finset (Fin b)))\n (d : Fin b → ℕ) (hH : ∀ e ∈ H, 2 ≤ e.card) {K : ℕ} (hK : palet" + }, + { + "kind": "theorem", + "unqualified_name": "paletteNumber_le_of_feasible", + "line": 381, + "source_header": "H d hH hK (isPaletteFeasible_paletteNumber H d hH)\n\ntheorem paletteNumber_le_of_feasible {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)\n {K : ℕ} (hK : I" + }, + { + "kind": "theorem", + "unqualified_name": "palette_of_decomposable", + "line": 391, + "source_header": "ype} [Fintype X] [DecidableEq X] {F : RealizedData X}\n\n/-- A `K`-decomposition of `U` yields a palette with `|U ∩ X_i| ≤ a_i |P_i|`: `P_i` is the set of\nparts meeting `X_i`. -/\ntheorem palette_of_decomposable {K : ℕ} {U : Finset X} (h : IsKDecomposable F K U) :\n ∃ P : Fin F.b → Finset (Fin K), (∀ i, (U ∩ block F i).card ≤ F.a i * (P i)" + }, + { + "kind": "def", + "unqualified_name": "idxIn", + "line": 426, + "source_header": "em_image]\n exact ⟨v, hv.1, blk_eq_of_mem_block hv.2⟩\n\n/-- The index of `v` within `U ∩ X_i` (`0` if `v` is not there). -/\nnoncomputable def idxIn (F :" + }, + { + "kind": "theorem", + "unqualified_name": "idxIn_lt", + "line": 430, + "source_header": "ock F i then ((U ∩ block F i).equivFin ⟨v, h⟩).val else 0\n\ntheorem idxIn_lt (F : RealizedData X) (U : Finset X) (i : Fin F.b) {v : X}\n (hv :" + }, + { + "kind": "theorem", + "unqualified_name": "idxIn_inj", + "line": 436, + "source_header": ".card := by\n unfold idxIn\n split_ifs\n exact Fin.isLt _\n\ntheorem idxIn_inj (F : RealizedData X) (U : Finset X) (i : Fin F.b) {v w : X}\n (hv : v ∈ U ∩ block F i) (hw : w ∈ U ∩ b" + }, + { + "kind": "def", + "unqualified_name": "labOf", + "line": 444, + "source_header": "n.injective (Fin.ext h)\n exact congrArg Subtype.val this\n\n/-- The `r`-th label of `P_i`, as an `Option`. -/\nnoncomputable def labOf {b K : ℕ} (P : Fin b" + }, + { + "kind": "theorem", + "unqualified_name": "labOf_mem", + "line": 449, + "source_header": ").card then some ((P i).orderEmbOfFin rfl ⟨r, h⟩) else none\n\ntheorem labOf_mem {b K : ℕ} (P : Fin b → Finset (Fin K)) (i : Fin b) (" + }, + { + "kind": "theorem", + "unqualified_name": "labOf_inj", + "line": 457, + "source_header": "n.some_inj] at h\n rw [← h]\n exact orderEmbOfFin_mem _ _ _\n\ntheorem labOf_inj {b K : ℕ} (P : Fin b → Finset (Fin K)) (i : Fin b) {r r' : ℕ} {ℓ : Fin K}\n (h :" + }, + { + "kind": "theorem", + "unqualified_name": "labOf_isSome", + "line": 465, + "source_header": ").injective (h.trans h'.symm)\n exact Fin.mk.inj_iff.1 this\n\ntheorem labOf_isSome {b K : ℕ} (P : Fin b → Finset (Fin K)) (i : Fin b) {r" + }, + { + "kind": "def", + "unqualified_name": "colOf", + "line": 471, + "source_header": "= some ℓ := by\n unfold labOf\n split_ifs\n exact ⟨_, rfl⟩\n\n/-- The colour of `v`: the `(idx v / a_i)`-th label of `P_{blk v}`. -/\nnoncomputable def colOf (F : RealizedData X) (U : Finset X) {K : ℕ" + }, + { + "kind": "def", + "unqualified_name": "partOf", + "line": 476, + "source_header": "=\n labOf P (F.blk v) (idxIn F U (F.blk v) v / F.a (F.blk v))\n\n/-- The colour class of `ℓ` inside `U`. -/\nnoncomputable def partOf (F : RealizedData X) (U : Finset X) {K" + }, + { + "kind": "theorem", + "unqualified_name": "colOf_isSome", + "line": 481, + "source_header": "n K) : Finset X :=\n U.filter (fun v => colOf F U P v = some ℓ)\n\ntheorem colOf_isSome (hF : IsRealizedFamily F) {U : Finset X} {K : ℕ}\n {P : Fin F.b → Finset (Fin K)} (hcard : ∀ i, (U ∩ block F i).card ≤ F.a i * (P" + }, + { + "kind": "theorem", + "unqualified_name": "partOf_good", + "line": 494, + "source_header": "= h2\n _ = (P (F.blk v)).card * F.a (F.blk v) := mul_comm _ _\n\ntheorem partOf_good (hF : IsRealizedFamily F) {U : Finset X} {K : ℕ}\n {P : Fin F.b → Finset (Fin K)}\n (hedge : ∀ e ∈ F.H, ∀ ℓ : Fin K" + }, + { + "kind": "theorem", + "unqualified_name": "partOf_disjoint", + "line": 545, + "source_header": "f at h1\n rw [hbv] at h1\n exact hni (labOf_mem P i _ ℓ h1)\n\ntheorem partOf_disjoint (F : RealizedData X) (U : Finset X) {K : ℕ}\n (P : Fin F.b → Finset (Fin K)) {ℓ ℓ' : Fin K}" + }, + { + "kind": "theorem", + "unqualified_name": "biUnion_partOf", + "line": 554, + "source_header": "] at hv hv'\n apply h\n rw [← Option.some_inj, ← hv.2, ← hv'.2]\n\ntheorem biUnion_partOf (hF : IsRealizedFamily F) {U : Finset X} {K : ℕ}\n {P : Fin F.b → Finset (Fin K)} (hcard : ∀ i, (U ∩ block F i).card ≤ F.a i * (P i)" + }, + { + "kind": "theorem", + "unqualified_name": "decomposable_of_palette", + "line": 566, + "source_header": "me hF hcard hv\n exact ⟨ℓ, mem_univ _, mem_filter.2 ⟨hv, hℓ⟩⟩\n\n/-- A palette with `|U ∩ X_i| ≤ a_i |P_i|` yields a `K`-decomposition of `U`. -/\ntheorem decomposable_of_palette (hF : IsRealizedFamily F) {K : ℕ} {U : Finset X}\n (P : Fin F.b → Finset (Fin K)) (hcard : ∀ i, (U ∩ block F i).card ≤ F.a i * (P i).card)\n (hedge :" + }, + { + "kind": "theorem", + "unqualified_name": "block_disjoint", + "line": 575, + "source_header": "nt F U P h,\n biUnion_partOf hF hcard⟩\n\nomit [DecidableEq X] in\n/-- Blocks are pairwise disjoint. -/\ntheorem block_disjoint (F : RealizedData X)" + }, + { + "kind": "theorem", + "unqualified_name": "localDecomposability_expanded", + "line": 581, + "source_header": "t h ((blk_eq_of_mem_block hv).symm.trans (blk_eq_of_mem_block hv'))\n\n/-- Section 3: `I_k(D_i) = {S : |S| ≤ a_i k}`, in expanded form. -/\ntheorem localDecomposability_expanded (hF : IsRealizedFamily F) (i : Fin F.b) (k : ℕ)\n (S : Finset" + }, + { + "kind": "theorem", + "unqualified_name": "mem_supp_iff", + "line": 622, + "source_header": "ecidableEq X] {F : RealizedData X}\n\nomit [Fintype X] [DecidableEq X] in\ntheorem mem_supp" + }, + { + "kind": "theorem", + "unqualified_name": "good_of_subset_block", + "line": 624, + "source_header": "F.b} : i ∈ supp F U ↔ ∃ v ∈ U, F.blk v = i := by\n rw [supp, mem_image]\n\n/-- A subset of one block with at most `a_i` elements is good. -/\ntheorem good_of_subset_block (hF : IsRealizedFamily F) {i : Fin F.b} {S :" + }, + { + "kind": "theorem", + "unqualified_name": "erase_inter_block_of_blk_ne", + "line": 647, + "source_header": "p)\n have h2 := hF.2.2.2.1 e he\n rw [card_singleton] at h1\n omega\n\n/-- Removing an element outside `X_i` does not change the intersection with `X_i`. -/\ntheorem erase_inter_block_of_blk_ne {U : Finset X} {v : X}" + }, + { + "kind": "theorem", + "unqualified_name": "minimalForbidden_iff", + "line": 658, + "source_header": "⟨hw, hb⟩\n · rintro ⟨hw, hb⟩\n refine ⟨⟨fun hwv => h (hwv ▸ hb), hw⟩, hb⟩\n\n/-- Proposition P1 in expanded form. -/\ntheorem minimalForbidden_iff (hF : IsRealizedFamily F) (U : Finset X) :\n IsMinimalForbidden F U ↔" + }, + { + "kind": "theorem", + "unqualified_name": "minForb816_iff", + "line": 766, + "source_header": "ting the minimal forbidden sets of the six-block benchmark -/\n\nsection Count816\n\n/-- Proposition P1 for the six-block data (`a_i = 1`). -/\ntheorem minForb816_iff (U : Finset (Fin 6 × Fin 409)) :\n IsMinimalForbidden benchmark816 U ↔\n ((∃ i, U ⊆ block benchmark81" + }, + { + "kind": "theorem", + "unqualified_name": "supp_eq_singleton_of_pair", + "line": 773, + "source_header": "Transversal benchmark816 e U) :=\n minimalForbidden_iff benchmark816_isRealized U\n\ntheorem supp_eq_singleton_of_pair {U : Finset (Fin 6 × Fin 409)} {i : Fin benchmark816.b}" + }, + { + "kind": "def", + "unqualified_name": "pairs816", + "line": 786, + "source_header": "rd_pos.1 (by omega)\n exact mem_supp_iff.2 ⟨v, hv, blk_eq_of_mem_block (hU hv)⟩\n\n/-- T" + }, + { + "kind": "theorem", + "unqualified_name": "mem_pairs816", + "line": 790, + "source_header": "nset (Fin benchmark816.b)).biUnion (fun i => (block benchmark816 i).powersetCard 2)\n\ntheorem mem_pairs816 {U : Finset" + }, + { + "kind": "theorem", + "unqualified_name": "card_pairs816", + "line": 794, + "source_header": "= 2 := by\n simp only [pairs816, mem_biUnion, mem_univ, true_a" + }, + { + "kind": "def", + "unqualified_name": "transOf", + "line": 816, + "source_header": "sals\n\nvariable {ι β : Type} [Fintype ι] [DecidableEq ι] [Fintype β] [DecidableEq β]\n\n/-- The candidate transversals of `e` in a product ground type: the images of `e` under\n`i ↦ (σ i, g i)` for `g` ranging over a product set (`b₀` is a dummy value off `e`). -/\ndef transOf (F : RealizedData (ι" + }, + { + "kind": "theorem", + "unqualified_name": "sigma_injective", + "line": 825, + "source_header": "un i => (σ i, g i)))\n\nomit [Fintype ι] [DecidableEq ι] [Fintype β] [DecidableEq β] in\ntheorem sigma_injective {F : RealizedData (ι × β)} {σ : Fin F.b → ι} (b₀ : β)" + }, + { + "kind": "theorem", + "unqualified_name": "mem_transOf", + "line": 831, + "source_header": "σ _ _).2 rfl\n have hj : F.blk (σ i, b₀) = j := (hσ _ _).2 h\n exact hi.symm.trans hj\n\ntheorem mem_transOf {F : RealizedData (ι × β)} {σ : Fin F.b → ι} {b₀ : β}\n (hσ : ∀ (v : ι × β) (i : Fin F.b), F.blk v = i ↔ v.1 = σ i) (e : Fi" + }, + { + "kind": "theorem", + "unqualified_name": "card_transOf", + "line": 902, + "source_header": ")\n rw [mem_image]\n exact ⟨F.blk v, hv1, this.symm⟩\n\nomit [Fintype ι] in\ntheorem card_transOf {F : RealizedData (ι × β)} {σ : Fin F.b → ι} {b₀ : β}\n (hσ : ∀ (v : ι × β) (i : Fin F.b), F.blk v = i ↔ v.1" + }, + { + "kind": "theorem", + "unqualified_name": "hσ816", + "line": 940, + "source_header": "ht hi, mem_singleton] at h1 h2\n rw [h1, h2]\n\nend Transversals\n\nsection Count816b\n\n/-- The index map of the six-block benchmark is the identity (definitionally). -/\ntheorem hσ816 : ∀ (v : Fin 6 × Fin 409) (i : Fin benchmar" + }, + { + "kind": "def", + "unqualified_name": "transAll816", + "line": 945, + "source_header": "6.blk v = i ↔ v.1 = (fun i => i : Fin benchmark816.b → Fin 6) i :=\n fun _ _ => Iff.rfl" + }, + { + "kind": "theorem", + "unqualified_name": "mem_transAll816", + "line": 949, + "source_header": "nset (Fin 6 × Fin 409)) :=\n benchmark816.H.biUnion (transOf benchmark816 (fun i => i) 0)\n\ntheorem mem_transAll816 {U : Finset (Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "card_H816", + "line": 953, + "source_header": "nsversal benchmark816 e U := by\n simp only [t" + }, + { + "kind": "theorem", + "unqualified_name": "card_transAll816", + "line": 958, + "source_header": "3).card = 15\n rw [completeClutter, card_powersetCard, card_" + }, + { + "kind": "theorem", + "unqualified_name": "disjoint_pairs816_transAll816", + "line": 974, + "source_header": "it is a naming linter, not a check.\nset_option linter.constructorName" + }, + { + "kind": "theorem", + "unqualified_name": "minForbSet_eq", + "line": 986, + "source_header": "816 he\n rw [hsupp] at h1\n rw [h1, card_singleton] at h2\n exact absurd h2 (by norm_num)\n\ntheorem minForbSet_eq :\n {U : Finset" + }, + { + "kind": "theorem", + "unqualified_name": "minForbSet1_eq", + "line": 993, + "source_header": "oe_union, Set.mem_union, mem_coe, mem_pairs816, mem_transAll816]\n exact minForb816_iff U\n\ntheorem minForbSet1_eq :\n {U : Finset (Fin 6 × Fin 409)" + }, + { + "kind": "theorem", + "unqualified_name": "minForbSet4_eq", + "line": 1008, + "source_header": "⟨Or.inl ⟨i, hUi, hcard⟩, ?_⟩\n rw [supp_eq_singleton_of_pair hUi hcard, card_singleton]\n\ntheorem minForbSet4_eq :\n {U : Finset (Fin 6 × Fin 409) |" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816IsRealized", + "line": 1027, + "source_header": "r ⟨e, he, hsupp, hone⟩, ?_⟩\n rw [hsupp, mem_H_benchmark816 he]\n\nend Count816b\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816IsRealized` (claim `p15-realized-covers`, Section 6\nof P15_REALIZED_COVERS.md: six blocks of `409` coordinates with `a_i = 1`, `d_i = 408`, `H` all\nfour-block subsets).\nMethod: block cardinality `1 * 409 = 409` via the product decomposition of the fibre; clutter\nproperty of `powersetCard 4` by `eq_of_subset_of_card_le`.\nDoes not establish: anything about the informal six-block realization beyond this data record\nsatisfying the formal side conditions; no review, acceptance or" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816Price", + "line": 1037, + "source_header": "6IsRealized : UniversalLaw.Spec.P15.Benchmark816IsRealized :=\n Aux.benchmark816_isRealized\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816Price` (claim `p15-realized-covers`, Section 6:\n\"6/(40900^409)>0\").\nMethod: the full-block family is the image of the injective block map, so its price is the sum\nof six block prices `(1/40900)^409`.\nDoes not establish: that this cover is optimal or that it covers the obstruction\n(`Benchmark816Cover` is a separate `Prop`); no" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816RationalPrice", + "line": 1047, + "source_header": "?_, by positivity⟩\n rw [Aux.famPrice_const_benchmark816, one_div, div_eq_mul_inv, ← inv_pow]\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816RationalPrice` (claim `p15-price-budget-restricted`,\ndisplay (T7) and the explicit rational price of Section 4 of price_budget PROOF.md).\nMethod: `log x ≤ x - 1` for the upper bound; Mathlib's Taylor estimate\n`Real.abs_log_sub_add_sum_range_le` with three terms for `p + p^2/2 < -log(1 - p)`; exact\nrational arithmetic by `norm_num`; the full-block price as six equal block prices.\nDoes not establish: the (T1) budget itself, admissibility of any other price vector, or the\ninformal claim; no review or acc" + }, + { + "kind": "theorem", + "unqualified_name": "elementaryPaletteFormula", + "line": 1074, + "source_header": "linarith\n · exfalso\n exact h (by norm_num)\n · exact Aux.famPrice_const_benchmark816 _\n\n/-- Proves: `UniversalLaw.Spec.P15.ElementaryPaletteFormula` (claim `p15-realized-covers`, display\n(P9) of P15_REALIZED_COVERS.md: for `H` all `(s+1)`-subsets, `K_H(d) = max(max_i d_i,\nceil(sum_i d_i / s))`).\nMethod: for the complete clutter the edge condition says each label lies in at most `s` label\nsets; double counting gives the two necessary conditions `d_i ≤ K` and `sum d_i ≤ s K`; the\ncyclic palette (block `i` takes positions `c_i, …, c_i + d_i - 1` reduced modulo `K`) realizes\nthem; `IsLeast.csInf_eq` identifies `sInf`.\nDoes not establish: the matroid palette formula of Section 5, anything about non-complete\nclutters, or the informal claim; the hypotheses `s ≤ b` and `1 ≤ d_i` of the `Prop` are not\nneeded by this proof and are simply carried; no review or" + }, + { + "kind": "theorem", + "unqualified_name": "triangleNeedsThree", + "line": 1087, + "source_header": ".P15.ElementaryPaletteFormula :=\n fun b s d hs _ _ => Aux.paletteNumber_completeClutter b s d hs\n\n/-- Proves: `UniversalLaw.Spec.P15.TriangleNeedsThree` (claim `p15-realized-covers`, Section 5:\nthe triangle at unit demands needs `3` colors).\nMethod: the complete-clutter formula at `b = 3`, `s = 1`, `d = 1`: `max 1 ⌈3/1⌉₊ = 3`.\nDoes not establish: the informal remark about \"size-two edge loads\"" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816Palette", + "line": 1097, + "source_header": "rfl]\n rw [sup_const univ_nonempty, sum_const, card_univ, Fintype.card_fin, smul_eq_mul]\n norm_num\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816Palette` (claim `p15-realized-covers`, Section 6:\n`K_H(408,...,408) = 816`).\nMethod: the complete-clutter formula at `b = 6`, `s = 3`, `d = 408`: `max 408 ⌈2448/3⌉₊ = 816`.\nDoes not establish: that the full blocks cover the obstruction (`Benchmark816Cover`), or the\ninformal claim" + }, + { + "kind": "theorem", + "unqualified_name": "localDecomposability", + "line": 1108, + "source_header": "_num)]\n rw [sup_const univ_nonempty, sum_const, card_univ, Fintype.card_fin, smul_eq_mul]\n norm_num\n\n/-- Proves: `UniversalLaw.Spec.P15.LocalDecomposability` (claim `p15-realized-covers`, Section 3 of\nP15_REALIZED_COVERS.md: `I_k(D_i) = {S : |S| <= a_i k}`).\nMethod: a decomposition of `S ⊆ X_i` into `k` good parts has parts of size `≤ a_i`; conversely\nthe chunks of size `≤ a_i` of an enumeration of `S` are good (one block, support of size `≤ 1`\ncontains no edge of size `≥ 2`), via the general palette/decomposition correspondence.\nDoes not establish: the informal claim or its review; alignment of `IsKDecomposable` with the\ninformal `I_k`. -/\ntheorem localDecomposability {X : Ty" + }, + { + "kind": "theorem", + "unqualified_name": "localObstructionIsFullBlock", + "line": 1119, + "source_header": "w.Spec.P15.LocalDecomposability F :=\n fun hF i k S hS => Aux.localDecomposability_expanded hF i k S hS\n\n/-- Proves: `UniversalLaw.Spec.P15.LocalObstructionIsFullBlock` (claim `p15-realized-covers`,\ndisplay (P3): the only `d_i`-obstructed subset of `X_i` is `X_i`).\nMethod: `LocalDecomposability` at `k = d_i` and `|X_i| = a_i d_i + 1`.\nDoes not establish: the informal claim or its review. -/\ntheorem localObstructionIsFullBlock {X : Type} [" + }, + { + "kind": "theorem", + "unqualified_name": "fullBlockCoverIff", + "line": 1135, + "source_header": "exact eq_of_subset_of_card_le hS (by omega)\n · intro h\n rw [h, hcard]\n exact Nat.lt_succ_self _\n\n/-- Proves: `UniversalLaw.Spec.P15.FullBlockCoverIff` (claim `p15-realized-covers`, Proposition\nP2, display (P7): the family of full blocks covers `O_K(D)` iff `K >= K_H(d)`).\nMethod: a set containing no full block has `|U ∩ X_i| ≤ a_i d_i`, so a palette for `d` at `K`\ncolours it; conversely the set missing one chosen vertex per block is `K`-decomposable, and the\nparts meeting each block form a feasible palette, so `K_H(d) ≤ K`. Attainment of `K_H(d)` and\nupward closure of feasibility are proved via disjoint label intervals.\nDoes not establish: optimality of other covers, the unrestricted prize, the informal claim or\nits review (disposition transcribed in the statement: HOLD_WITH_DOMAIN). -/\ntheorem fullBlockCoverIff" + }, + { + "kind": "theorem", + "unqualified_name": "wholeGroundChromaticNumber", + "line": 1195, + "source_header": "∩ block F i).card ≤ F.a i * F.d i := by omega\n _ ≤ F.a i * (P i).card := Nat.mul_le_mul_left _ (hPd i)\n\n/-- Proves: `UniversalLaw.Spec.P15.WholeGroundChromaticNumber` (claim `p15-realized-covers`,\nSection 4: the chromatic number of the entire ground set is `K_H(d+1)`).\nMethod: the palette/decomposition correspondence with `|X_i| = a_i d_i + 1`, which lies in\n`(a_i d_i, a_i (d_i + 1)]`, so the demands are exactly `d_i + 1`.\nDoes not establish: the informal claim or its review. -/\ntheorem wholeGroundChromaticNumber {X : Ty" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816WholeGround", + "line": 1227, + "source_header": "(F.d i + 1) := by rw [mul_add, mul_one]; omega\n _ ≤ F.a i * (P i).card := Nat.mul_le_mul_left _ (hPd i)\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816WholeGround` (claim `p15-realized-covers`, Section\n6: the whole ground set needs `818` colors).\nMethod: `WholeGroundChromaticNumber` for the six-block data and the complete-clutter palette\nformula at demands `409`: `max 409 ⌈2454/3⌉₊ = 818`.\nDoes not establish: the i" + }, + { + "kind": "theorem", + "unqualified_name": "minimalForbiddenCharacterisation", + "line": 1244, + "source_header": "intype.card_fin, smul_eq_mul]\n norm_num\n constructor\n · rw [h 818, hpal]\n · rw [h 817, hpal]\n norm_num\n\n/-- Proves: `UniversalLaw.Spec.P15.MinimalForbiddenCharacterisation` (claim `p15-realized-covers`,\nProposition P1 of P15_REALIZED_COVERS.md: the inclusion-minimal forbidden sets are exactly the\n`(a_i+1)`-subsets of a single block and the transversals of the edges).\nMethod: a capacity violation in block `i` forces `U ⊆ X_i` with `|U| = a_i + 1` (removing any\noutside vertex or any vertex keeps the violation); otherwise an edge `e ⊆ supp U` forces each\nvertex to be alone in its block with its block in `e`. Conversely both families are forbidden\nand every one-vertex deletion is good (one-block sets of size `≤ a_i`; the clutter property for\ntransversals).\nDoes not establish: the informal claim or its review; alignment of `IsMinimalForbidden` with the\ninformal notion. -/\ntheorem minimalForbiddenCharacterisation {X : Type" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816MinimalForbiddenCounts", + "line": 1258, + "source_header": "Data X) : UniversalLaw.Spec.P15.MinimalForbiddenCharacterisation F :=\n fun hF U => Aux.minimalForbidden_iff hF U\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816MinimalForbiddenCounts` (claim\n`p15-realized-covers`, display (P10): `6 * binom(409,2)` internal pairs, `15 * 409^4` crossing\ntransversal quadruples, and nothing else).\nMethod: Proposition P1 (`MinimalForbiddenCharacterisation`) for the six-block data; the pairs\nare the disjoint union over the six blocks of `powersetCard 2`; the transversals of a four-edge\nare the images of `e` under `i ↦ (i, g i)` for `g` in a product set of size `409^4`, counted by\n`card_image_of_injOn` and `Fintype.card_piFinset`; the two families are disjoint by the size of\nthe support. No enumeration of subsets is performed.\nDoes not establish: the informal claim or its review; the evaluations `500616` and\n`419743994415` (core-Lean targets on" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Analysis.lean", + "sha256": "7cf64095450464b5974e381f9c6d1ed238473dd931ff558cad67db1d9a62acbc", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "th_latticeVec_apply", + "line": 83, + "source_header": "x\n\n/-! ## `th_`: the theta family (`ThetaSummable`) -/\n\n/-! ### (a) Coordinates and squared norm of the lattice vector `24 n` -/\n\n/-- The `i`-th coordinate of `latticeVec d n` is `24 n_i`. -/\ntheorem th_latticeVec_apply (d : ℕ) (n : Fin d → ℤ) (i : Fin d) :\n latticeVec d n i = 24 * (n" + }, + { + "kind": "theorem", + "unqualified_name": "th_norm_latticeVec_sq", + "line": 92, + "source_header": "iceVec]\n\n/-- `‖24 n‖^2 = 576 * ∑ i, n_i^2` (`EuclideanSpace.norm_sq_eq`, coordinatewise). -/\ntheorem th_norm_latticeVec_sq (d : ℕ) (n : Fin d → ℤ) :\n ‖latticeVec d n‖ ^ 2 = 576 * intN" + }, + { + "kind": "theorem", + "unqualified_name": "th_exp_neg_norm_latticeVec_sq", + "line": 100, + "source_header": "s]\n ring\n\n/-- `exp(-‖24 n‖^2/4) = ∏ i, exp(-144 n_i^2)`, by `Real.exp_sum` and the previous lemma. -/\ntheorem th_exp_neg_norm_latticeVec_sq (d : ℕ) (n : Fin d → ℤ) :\n Real.exp (-(‖latticeVec d n‖ ^ 2) / 4) = ∏ i, Real.exp (-144 * ((n i : ℤ" + }, + { + "kind": "theorem", + "unqualified_name": "th_summable_gauss_int", + "line": 109, + "source_header": "> ?_\n ring\n\n/-! ### (b) One-dimensional Gaussian summability on `ℤ` -/\n\n/-- `m ↦ exp(-c m^2)` is summable on `ℤ` for `c > 0`: Mathlib's\n`HurwitzKernelBounds.summable_f_int 0 0` at `t = c/π` after `-π m^2 (c/π) = -c m^2`. -/\ntheorem th_summable_gauss_int (c : ℝ) (hc : 0 < c) :\n Summable (fun m : ℤ => Real.exp (-c" + }, + { + "kind": "theorem", + "unqualified_name": "th_summable_pi_prod", + "line": 121, + "source_header": "1\n field_simp\n\n/-! ### (c) Products of a summable nonnegative function over `Fin d → ℤ` -/\n\n/-- For a nonnegative summable `g : ℤ → ℝ`, the product `n ↦ ∏ i, g (n i)` is summable over\n`Fin d → ℤ`: a finite set `s` of lattice points lies in the box `Fintype.piFinset t` with\n`t i = s.image (· i)`, over which the sum factors as `∏ i, ∑ m ∈ t i, g m ≤ (∑' m, g m)^d`. -/\ntheorem th_summable_pi_prod (d : ℕ) (g : ℤ → ℝ) (hg0 : ∀ m, 0 ≤ g m) (hg : Summable g) :\n Summable (fun n : Fin d →" + }, + { + "kind": "theorem", + "unqualified_name": "th_exp_shift_le", + "line": 144, + "source_header": "g m) ^ d := by simp\n\n/-! ### (d) The pointwise shift bound -/\n\n/-- `exp(-‖z + v‖^2/2) ≤ exp(‖z‖^2/2) exp(-‖v‖^2/4)`: from `‖v‖ ≤ ‖z + v‖ + ‖z‖` one has\n`‖v‖^2/4 ≤ (‖z + v‖ + ‖z‖)^2/4 ≤ ‖z + v‖^2/2 + ‖z‖^2/2`. -/\ntheorem th_exp_shift_le (d : ℕ) (z v : E d) :\n Real.exp (-(‖z + v‖ ^ 2) / 2) ≤ Real.exp (‖z‖ ^ 2 / 2) * Re" + }, + { + "kind": "theorem", + "unqualified_name": "th_summable_dominant", + "line": 159, + "source_header": "nonneg (‖z + v‖ - ‖z‖)]\n\n/-- The dominating family `n ↦ exp(‖z‖^2/2) ∏ i, exp(-144 n_i^2)` is summable over\n`Fin d → ℤ`. -/\ntheorem th_summable_dominant (d : ℕ) (z : E d) :\n Summable (fun n : Fin d → ℤ =>\n Real.exp (‖z‖ ^ 2 / 2) * ∏ i, Real.exp (-14" + }, + { + "kind": "theorem", + "unqualified_name": "th_term_le_dominant", + "line": 167, + "source_header": "by norm_num))).mul_left _\n\n/-- Each theta term is bounded by the corresponding dominating term. -/\ntheorem th_term_le_dominant (d : ℕ) (z : E d) (n : Fin d → ℤ) :\n Real.exp (-(‖z + latticeVec d n‖ ^ 2) / 2) ≤\n Real.exp (‖z‖ ^ 2 / 2) * ∏ i, Real.exp (" + }, + { + "kind": "theorem", + "unqualified_name": "dp_contDiff_Kinf", + "line": 176, + "source_header": "exp_neg_norm_latticeVec_sq]\n\n/-! ## `dp_`: the derivative pairing bound (`DerivativePairingBound`) -/\n\n/-! ### Smoothness and first derivative of the reference kernel `Kinf` -/\n\n/-- `Kinf d = exp (-‖·‖^2 / 2)` is `C^∞` on `E d`. -/\ntheorem dp_contDiff_Kin" + }, + { + "kind": "theorem", + "unqualified_name": "dp_hasFDerivAt_Kinf", + "line": 187, + "source_header": "exact Real.contDiff_exp.comp h\n\n/-- The first derivative of `Kinf d` at `x` is `Kinf d x • (-(innerSL ℝ x))`, i.e.\n`v ↦ -⟪x, v⟫ Kinf d x`. -/\ntheorem dp_hasFDerivAt_Kinf (d : ℕ) (x : E d) :\n HasFDerivAt (Kinf" + }, + { + "kind": "theorem", + "unqualified_name": "dp_fderiv_Kinf", + "line": 203, + "source_header": "v\n simp [Kinf]\n left\n ring\n\n/-- The derivative function of `Kinf d`. -/\ntheorem dp_fderiv_Kinf (d : ℕ) :\n fderiv ℝ (Kinf d) =" + }, + { + "kind": "theorem", + "unqualified_name": "dp_contDiff_g", + "line": 208, + "source_header": "y => (dp_hasFDerivAt_Kinf d y).fderiv\n\n/-! ### The operator-valued factor `g y = -(innerSL ℝ y)` -/\n\n/-- `y ↦ -(innerSL ℝ y)` is `C^∞` (it is a continuous linear map). -/\ntheorem dp_contDiff_g (d : ℕ) : Con" + }, + { + "kind": "theorem", + "unqualified_name": "dp_g_eq", + "line": 214, + "source_header": "inuousLinearMap.contDiff (innerSL ℝ)).neg\n\n/-- The factor as the coercion of the continuous linear map `-(innerSL ℝ)`. -/\ntheorem dp_g_eq (d : ℕ) :\n (fun y" + }, + { + "kind": "theorem", + "unqualified_name": "dp_norm_g_zero", + "line": 220, + "source_header": "erSL ℝ (E := E d))) := by\n funext y\n simp\n\n/-- Order zero: `‖g x‖ = ‖x‖` (`innerSL_apply_norm`). -/\ntheorem dp_norm_g_zero (d : ℕ) (x : E d) :\n ‖iteratedFDeriv" + }, + { + "kind": "theorem", + "unqualified_name": "dp_norm_g_one", + "line": 225, + "source_header": "tedFDeriv_zero, norm_neg, innerSL_apply_norm]\n\n/-- Order one: `‖D g x‖ = ‖innerSL ℝ‖ ≤ 1` (`norm_innerSL_le`). -/\ntheorem dp_norm_g_one (d : ℕ) (x : E d) :\n ‖iteratedFD" + }, + { + "kind": "theorem", + "unqualified_name": "dp_g_higher", + "line": 231, + "source_header": "Map.fderiv, norm_neg]\n exact norm_innerSL_le ℝ\n\n/-- Orders `k ≥ 2` of the linear factor vanish. -/\ntheorem dp_g_higher (d : ℕ) (x : E d) (k : ℕ) (hk : 2 ≤ k) :\n iterate" + }, + { + "kind": "theorem", + "unqualified_name": "dp_recursion", + "line": 242, + "source_header": "ero_apply]\n exact LinearIsometryEquiv.map_zero _\n\n/-! ### The Hermite-type recursion for the operator norms -/\n\n/-- Hermite-type recursion for `b_q = ‖D^q Kinf (x)‖`:\n`b_{q+2} ≤ ‖x‖ b_{q+1} + (q+1) b_q`, from `norm_iteratedFDeriv_fderiv`, the explicit first\nderivative, and the Leibniz bound `norm_iteratedFDeriv_smul_le` in which only the terms\n`i = q` and `i = q + 1` of the binomial sum survive. -/\ntheorem dp_recursion (d : ℕ) (x : E d) (q : ℕ) :\n ‖iteratedFDeriv ℝ (q + 2) (Kinf d) x‖ ≤\n ‖x‖ * ‖iteratedFDeriv ℝ (q + 1) (Kinf d) x" + }, + { + "kind": "theorem", + "unqualified_name": "dp_Kinf_pos", + "line": 269, + "source_header": "l_nonneg (by positivity : (0 : ℝ) ≤ (q : ℝ) + 1) hb)]\n\n/-! ### The seven explicit orders -/\n\n/-- `Kinf d x > 0`" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b0", + "line": 274, + "source_header": "nf_pos (d : ℕ) (x : E d) : 0 < Kinf d x := Real.exp_pos _\n\n/-- `b_0 = Kinf d x`. -/\ntheorem dp_b0 (d" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b1", + "line": 278, + "source_header": "Deriv_zero, Real.norm_eq_abs, abs_of_pos (dp_Kinf_pos d x)]\n\n/-- `b_1 = Kinf d x * ‖x‖`. -/\ntheorem dp_b1 (d : ℕ)" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b2", + "line": 283, + "source_header": "ply_norm,\n Real.norm_eq_abs, abs_of_pos (dp_Kinf_pos d x)]\n\n/-- `b_2 ≤ Kinf d x * (‖x‖^2 + 1)`. -/\ntheorem dp_b2 (d : ℕ) (x : E d) :" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b3", + "line": 291, + "source_header": "d x 0\n rw [dp_b1, dp_b0] at h\n push_cast at h\n nlinarith [h]\n\n/-- `b_3 ≤ Kinf d x * (‖x‖^3 + 3 ‖x‖)`. -/\ntheorem dp_b3 (d : ℕ) (x : E d) :" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b4", + "line": 301, + "source_header": "_\n push_cast at h\n nlinarith [mul_le_mul_of_nonneg_left h2 hr]\n\n/-- `b_4 ≤ Kinf d x * (‖x‖^4 + 6 ‖x‖^2 + 3)`. -/\ntheorem dp_b4 (d : ℕ) (x : E d) :\n ‖iter" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b5", + "line": 311, + "source_header": "eg _\n push_cast at h\n nlinarith [mul_le_mul_of_nonneg_left h3 hr]\n\n/-- `b_5 ≤ Kinf d x * (‖x‖^5 + 10 ‖x‖^3 + 15 ‖x‖)`. -/\ntheorem dp_b5 (d : ℕ) (x : E d) :\n ‖iteratedFD" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b6", + "line": 321, + "source_header": "nneg _\n push_cast at h\n nlinarith [mul_le_mul_of_nonneg_left h4 hr]\n\n/-- `b_6 ≤ Kinf d x * (‖x‖^6 + 15 ‖x‖^4 + 45 ‖x‖^2 + 15)`. -/\ntheorem dp_b6 (d : ℕ) (x : E d) :\n ‖iteratedFDeriv ℝ 6 (Kin" + }, + { + "kind": "theorem", + "unqualified_name": "dp_pairing_all", + "line": 332, + "source_header": "nonneg _\n push_cast at h\n nlinarith [mul_le_mul_of_nonneg_left h5 hr]\n\n/-- For `q ≤ 6`, `b_q ≤ Kinf d x * pairingSum q ‖x‖`: the explicit bounds `dp_b0` to `dp_b6`\nmatch the unfolded pairing sums (`Finset.sum_range_succ`, `Nat.factorial`). -/\ntheorem dp_pairing_all (d : ℕ) (x : E d) (q : ℕ) (hq : q" + }, + { + "kind": "theorem", + "unqualified_name": "dp_abs_le_opNorm", + "line": 362, + "source_header": "simp [pairingSum, Finset.sum_range_succ, Nat.factorial]\n try ring\n\n/-! ### Contraction at a unit tuple -/\n\n/-- At a unit tuple the contraction is bounded by the operator norm\n(`ContinuousMultilinearMap.le_opNorm` with `∏ ‖u i‖ = 1`). -/\ntheorem dp_abs_le_opNorm (d q : ℕ) (x : E d) (u : Fin q → E d) (hu : IsUnitTuple d q" + }, + { + "kind": "theorem", + "unqualified_name": "d1_pairingSum_le_of_one_le", + "line": 373, + "source_header": "(fun i _ => hu i)\n rw [hp, mul_one] at h\n simpa [Real.norm_eq_abs] using h\n\n/-! ## `d1_`: the derivative bound at `|x| ≥ 1` (`DerivativeBoundAtLeastOne`) -/\n\n/-! ### The elementary pairing-sum bound at `r ≥ 1` -/\n\n/-- For `q ≤ 6` and `1 ≤ r`, `pairingSum q r ≤ 76 r^6`. Each pairing sum unfolds\n(`Finset.sum_range_succ`, `Nat.factorial`) to a polynomial with nonnegative coefficients summing\nto `1, 1, 2, 4, 10, 26, 76` for `q = 0, …, 6`; every monomial `r^k`, `k ≤ 6`, is at most `r^6`\n(`pow_le_pow_right₀`, `one_le_pow₀`). -/\ntheorem d1_pairingSum_le_of" + }, + { + "kind": "theorem", + "unqualified_name": "d1_derivativeBoundAtLeastOne_of_derivativePairingBound", + "line": 393, + "source_header": "ge_zero,\n Nat.factorial] <;> norm_num <;> nlinarith [h0, h1, h2, h3, h4, h5, hr]\n\n/-! ### Hypothesis form: the Prop from `DerivativePairingBound` -/\n\n/-- `DerivativeBoundAtLeastOne` from `DerivativePairingBound`: at `1 ≤ ‖x‖` the pairing bound\n`|D^q Kinf (x) u| ≤ exp(-‖x‖²/2) · pairingSum q ‖x‖` and `pairingSum q ‖x‖ ≤ 76 ‖x‖^6`\n(`d1_pairingSum_le_of_one_le`) give the Prop by `mul_le_mul_of_nonneg_left` with\n`0 ≤ exp(-‖x‖²/2)` (`Real.exp_pos`). -/\ntheorem d1_derivativeBoundAtLeastOne_of_derivativePairingBound\n (h : UniversalLaw.Spec." + }, + { + "kind": "theorem", + "unqualified_name": "d0_pairingSum_zero_le", + "line": 412, + "source_header": "mul_of_nonneg_left hps hexp\n _ = 76 * ‖x‖ ^ 6 * Real.exp (-(‖x‖ ^ 2) / 2) := by ring\n\n/-! ## `d0_`: the derivative bound at the origin (`DerivativeBoundAtZero`) -/\n\n/-! ### The pairing sums at the origin -/\n\n/-- At `r = 0` the pairing sums of order `q ≤ 6` are `1, 0, 1, 0, 3, 0, 15` (only the `j = q/2`\nterm of an even order survives, `0 ^ 0 = 1`), he" + }, + { + "kind": "theorem", + "unqualified_name": "d0_derivativeBoundAtZero_of_derivativePairingBound", + "line": 421, + "source_header": "y\n interval_cases q <;> simp [pairingSum, Finset.sum_range_succ, Nat.factorial] <;> norm_num\n\n/-! ### The hypothesis form: the bound at the origin from the pairing bound -/\n\n/-- `DerivativeBoundAtZero` from `DerivativePairingBound` taken as a hypothesis: specialise the\npairing bound to `x = 0`, where `‖0‖ = 0` and `exp (-(0 ^ 2) / 2) = 1`, and bound\n`pairingSum q 0 ≤ 15` by `d0_pairingSum_zero_le`. -/\ntheorem d0_derivativeBoundAtZero_of_derivativePairingBound\n (h : Univ" + }, + { + "kind": "theorem", + "unqualified_name": "rb_kinf_contDiff", + "line": 436, + "source_header": "d)‖ = pairingSum q 0 := by\n simp\n rw [hx] at h0\n exact h0.trans (d0_pairingSum_zero_le q hq)\n\n/-! ## `rb_`: the Section 1 reference blocks (`ReferenceOddAndPinBlocks`) -/\n\n/-! ### (a) Smoothness and first derivative of the reference kernel -/\n\n/-- `Kinf d = exp (-‖·‖^2 / 2)` is `C^∞` (" + }, + { + "kind": "theorem", + "unqualified_name": "rb_hasFDerivAt_kinf", + "line": 445, + "source_header": "d) := by\n unfold Kinf\n exact ContDiff.exp (ContDiff.div_const (ContDiff.neg (contDiff_norm_sq ℝ)) 2)\n\n/-- The Fréchet derivative of `Kinf d` at `y`, as `HasFDerivAt` (chain rule through\n`hasStrictFDerivAt_norm_sq` and `HasFDerivAt.exp`). -/\ntheorem rb_hasFDerivAt_kinf {d : ℕ} (y : E d" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_kinf", + "line": 457, + "source_header": ".congr_of_eventuallyEq (Filter.Eventually.of_forall fun z => ?_)\n simp [div_eq_mul_inv]\n exact h1.exp\n\n/-- `fderiv ℝ (Kinf d) y v = -(⟪y, v⟫ * K" + }, + { + "kind": "theorem", + "unqualified_name": "rb_peel", + "line": 464, + "source_header": "* Kinf d y) := by\n rw [(rb_hasFDerivAt_kinf y).fderiv]\n simp [Kinf, two_smul, innerSL_apply_apply]\n ring\n\n/-! ### (b) Peeling one direction off an iterated derivative -/\n\n/-- For a `C^∞` real function `f`, `D^{n+1} f x [m] = D^n (y ↦ D f y (m (Fin.last n))) x [Fin.init m]`\n(`iteratedFDeriv_succ_apply_right` with `iteratedFDeriv_clm_apply_const_apply`). -/\ntheorem rb_peel {d : ℕ} (f : E d → ℝ) (hf : ContDiff ℝ (⊤ : ℕ∞) f) (n : ℕ) (x : E d)\n (m : Fin (n + 1) → E d) :\n it" + }, + { + "kind": "theorem", + "unqualified_name": "rb_inner_contDiff", + "line": 476, + "source_header": "ly_right]\n rw [iteratedFDeriv_clm_apply_const_apply (contDiff_infty_iff_fderiv.mp hf).2\n (mod_cast le_top)]\n\n/-- `y" + }, + { + "kind": "theorem", + "unqualified_name": "rb_g1_contDiff", + "line": 480, + "source_header": "_contDiff {d : ℕ} (v : E d) : ContDiff ℝ (⊤ : ℕ∞) (fun y : E d => ⟪y, v⟫) :=\n contDiff_id.inner ℝ contDiff_const\n\n/-! ### (c) Level one: `g₁ y = -(⟪y, v⟫ Kinf d y)` -/\n\n/-- Smoothness of the level-one" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_g1", + "line": 487, + "source_header": ":\n ContDiff ℝ (⊤ : ℕ∞) (fun y : E d => -(⟪y, v⟫ * Kinf d y)) :=\n ((rb_inner_contDiff v).mul rb_kinf_contDiff).neg\n\n/-- Derivative of the level-one function in direction `w`. -/\ntheorem rb_fderiv_g1 {d : ℕ} (v y w :" + }, + { + "kind": "theorem", + "unqualified_name": "rb_g2_contDiff", + "line": 497, + "source_header": "(rb_hasFDerivAt_kinf y)).neg\n rw [h.fderiv]\n simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]\n ring\n\n/-! ### (d) Level two: `g₂ y = -(⟪w, v⟫ Kinf d y) + ⟪y, v⟫ ⟪y, w⟫ Kinf d y` -/\n\n/-- Smoothness of the level-two function. -/\ntheorem rb_g" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_g2", + "line": 505, + "source_header": "(contDiff_const.mul rb_kinf_contDiff).neg.add\n (((rb_inner_contDiff v).mul (rb_inner_contDiff w)).mul rb_kinf_contDiff))\n\n/-- Derivative of the level-two function in direction `a`. -/\ntheorem rb_fderiv_g2 {d : ℕ} (v w y a : E d) :\n fderiv ℝ (fun y : E d => -(⟪w, v⟫ * Kinf d y) + ⟪y, v⟫ * ⟪y, w⟫ * Kinf d y) y a =" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_g3_zero", + "line": 519, + "source_header": "w y))).mul (rb_hasFDerivAt_kinf y))\n rw [h.fderiv]\n simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]\n ring\n\n/-! ### (e) Level three at the origin, general directions -/\n\n/-- Derivative at `0` of the level-three function in direction `c`: the three pairings. -/\ntheorem rb_fderiv_g3_zero {d : ℕ} (v w a c : E d) :\n fderiv ℝ (fun y : E d => ⟪w, v⟫ * ⟪y, a⟫ * Kinf d y\n + (⟪a, v⟫ * ⟪y, w⟫ + ⟪y, v⟫" + }, + { + "kind": "theorem", + "unqualified_name": "rb_order_four", + "line": 543, + "source_header": "inner ℝ (hasFDerivAt_const a 0))).mul\n (rb_hasFDerivAt_kinf 0))\n rw [h.fderiv]\n simp [Kinf, fderivInnerCLM_apply]\n ring\n\n/-- Fourth-order contraction of `Kinf d` at `0`: `D^4 Kinf 0 [c, a, w, v]` is the sum of the\nthree pairings `⟪w, v⟫⟪c, a⟫ + ⟪a, v⟫⟪c, w⟫ + ⟪c, v⟫⟪a, w⟫`. -/\ntheorem rb_order_four {" + }, + { + "kind": "theorem", + "unqualified_name": "rb_P3_contDiff", + "line": 569, + "source_header": "a, v⟫ * ⟪y, w⟫ + ⟪y, v⟫ * ⟪a, w⟫) * Kinf d y\n - ⟪y, v⟫ * ⟪y, w⟫ * ⟪y, a⟫ * Kinf d y) 0 c = _\n exact rb_fderiv_g3_zero v w a c\n\n/-! ### (f) Levels three to five along one direction `u` (Hermite forms) -/\n\n/-- Smoothness of `(3 ⟪u,u⟫ ⟪y,u⟫ - ⟪y,u⟫^3) Kinf d y`. -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_P3", + "line": 578, + "source_header": "(rb_inner_contDiff u)).sub\n (((rb_inner_contDiff u).mul (rb_inner_contDiff u)).mul (rb_inner_contDiff u))).mul\n rb_kinf_contDiff\n\n/-- Derivative along `u` of the level-three Hermite form. -/\ntheorem rb_fderiv_P3 {d : ℕ} (u y : E d) :\n fderiv ℝ (fun y : E d => (3 * ⟪u, u⟫ * ⟪y, u⟫ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y," + }, + { + "kind": "theorem", + "unqualified_name": "rb_P4_contDiff", + "line": 592, + "source_header": ".mul hin).mul hin)).mul (rb_hasFDerivAt_kinf y)\n rw [h.fderiv]\n simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]\n ring\n\n/-- Smoothness of the level-four Hermite form. -/\ntheorem rb_P4_contDiff {d : ℕ} (u : E d) : ContDiff ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_P4", + "line": 601, + "source_header": "d\n ((((rb_inner_contDiff u).mul (rb_inner_contDiff u)).mul (rb_inner_contDiff u)).mul\n (rb_inner_contDiff u))).mul rb_kinf_contDiff\n\n/-- Derivative along `u` of the level-four Hermite form. -/\ntheorem rb_fderiv_P4 {d : ℕ} (u y : E d) :\n fderiv ℝ (fun y : E d => (3 * ⟪u, u⟫ * ⟪u, u⟫ - 6 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫)\n + ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) y u =" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_P5_zero", + "line": 617, + "source_header": "hin).mul hin).mul hin)).mul (rb_hasFDerivAt_kinf y)\n rw [h.fderiv]\n simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]\n ring\n\n/-- Derivative at `0` along `u` of the level-five Hermite form: `-15 ⟪u, u⟫^3`. -/\ntheorem rb_fderiv_P5_zero {d : ℕ} (u : E d) :\n fderiv ℝ (fun y : E d => (-15 * (⟪u, u⟫ * ⟪u, u⟫) * ⟪y, u⟫\n + 10 * ⟪u," + }, + { + "kind": "theorem", + "unqualified_name": "rb_order_six", + "line": 634, + "source_header": ").sub\n ((((hin.mul hin).mul hin).mul hin).mul hin)).mul (rb_hasFDerivAt_kinf 0)\n rw [h.fderiv]\n simp [Kinf, fderivInnerCLM_apply]\n ring\n\n/-- Sixth-order contraction of `Kinf d` at `0` along one direction: `-" + }, + { + "kind": "theorem", + "unqualified_name": "rb_order_two", + "line": 674, + "source_header": "+ 10 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫)\n - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) 0 u = _\n exact rb_fderiv_P5_zero u\n\n/-! ### (g) Second-order contraction and the blocks in an orthonormal frame -/\n\n/-- Second-order contra" + }, + { + "kind": "theorem", + "unqualified_name": "rb_gradCov", + "line": 685, + "source_header": "dFDeriv_one_apply]\n simp only [rb_fderiv_kinf]\n show fderiv ℝ (fun y : E d => -(⟪y, b⟫ * Kinf d y)) 0 a = -⟪a, b⟫\n rw [rb_fderiv_g1]\n simp [Kinf]\n\n/-- The gradient block of" + }, + { + "kind": "theorem", + "unqualified_name": "rb_pinCov", + "line": 692, + "source_header": "d (Kinf d) R = 1 := by\n ext i j\n simp only [gradCov, Matrix.of_apply, rb_order_two, neg_neg, Matrix.one_apply]\n exact orthonormal_iff_ite.mp hR i j\n\n/-- The pin block of `Kinf d` with `u = R 0` in an orthonormal frame is `diagonal (3, 1, …, 1)`. -/\ntheorem rb_pinCov {d : ℕ} (h" + }, + { + "kind": "theorem", + "unqualified_name": "rb_thirdGradCov", + "line": 710, + "source_header": "j\n norm_num\n · simp [Ne.symm hj]\n · by_cases hj : j = ⟨0, hd⟩\n · subst hj\n simp [hi, Ne.symm hi]\n · simp [hi, Ne.symm hi, Ne.symm hj]\n\n/-- The third-derivative/gradient covariance vector of `Kinf d` with `u = R 0` is\n`(-3, 0, …, 0)`. -/\ntheorem rb_thir" + }, + { + "kind": "theorem", + "unqualified_name": "rb_thirdVar", + "line": 722, + "source_header": "rb_order_four, hite]\n by_cases hj : j = ⟨0, hd⟩\n · simp [hj]; norm_num\n · have hj' : ¬ ((⟨0, hd⟩ : Fin d) = j) := fun h => hj h.symm\n simp [hj, hj']\n\n/-- The third-derivative variance of `Kinf d` along a u" + }, + { + "kind": "theorem", + "unqualified_name": "rb_condThirdVariance", + "line": 729, + "source_header": "Orthonormal ℝ R) :\n thirdVar d (Kinf d) (R ⟨0, hd⟩) = 15 := by\n have hite := orthonormal_iff_ite.mp hR\n simp only [thirdVar, rb_order_six, hite]\n simp\n\n/-- The Schur complement `condThirdVariance` of `Kinf d` in an orthonormal frame is `" + }, + { + "kind": "theorem", + "unqualified_name": "rp_det_pinDiagonal", + "line": 738, + "source_header": "rw [rb_thirdVar hd R hR, rb_gradCov R hR, rb_thirdGradCov hd R hR, inv_one,\n Matrix.one_mulVec]\n simp [dotProduct, ite_mul, Finset.sum_ite_eq']\n norm_num\n\n/-! ## `rp_`: the reference pin-density product (`ReferencePinDensityProduct`) -/\n\n/-! ### The density algebra at the reference blocks -/\n\n/-- `det (diagonal (3, 1, …, 1)) = 3` (the single `3" + }, + { + "kind": "theorem", + "unqualified_name": "rp_density_algebra", + "line": 748, + "source_header": "(d : ℕ) (hd : 0 < d) :\n (Matrix.diagonal fun i : Fin d => if i = ⟨0, hd⟩ then (3 : ℝ) else 1).det = 3 := by\n rw [Matrix.det_diagonal, Finset.prod_ite_eq']\n simp\n\n/-- The product of the two centred Gaussian densities at `0`, for the covariance blocks `1` and\n`diagonal (3, 1, …, 1)`: `(2π)^(-d/2) · (2π)^(-d/2) · 3^(-1/2) = (2π)^(-d) / √3`. -/\ntheorem rp_density_algebra (d : ℕ) (hd : 0 < d) :" + }, + { + "kind": "theorem", + "unqualified_name": "rp_referencePinDensityProduct_of_blockIdentities", + "line": 762, + "source_header": "2 = -(d : ℝ) by ring,\n show (-1 : ℝ) / 2 = -(1 / 2) by norm_num, Real.rpow_neg (by norm_num : (0 : ℝ) ≤ 3),\n Real.sqrt_eq_rpow]\n exact (div_eq_mul_inv _ _).symm\n\n/-! ### The common core: the Prop from the two block identities -/\n\n/-- `ReferencePinDensityProduct` from the two block identities `gradCov d (Kinf d) R = 1` and\n`pinCov d (Kinf d) (R 0) R = diagonal (3, 1, …, 1)` (for `d ∈ {2, 3}` and orthonormal `R`), by\nrewriting the blocks and `rp_density_algebra`. -/\ntheorem rp_referencePinDensityProduct_of_blockIdentities\n (hblk : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n gradCov d" + }, + { + "kind": "theorem", + "unqualified_name": "rp_referencePinDensityProduct_of_referenceOddAndPinBlocks", + "line": 777, + "source_header": "UniversalLaw.Spec.Side24.ReferencePinDensityProduct := by\n intro d hd23 hd R hR\n obtain ⟨hG, hV⟩ := hblk d hd23 hd R hR\n rw [hG, hV]\n exact rp_density_algebra d hd\n\n/-! ### The hypothesis form: the Prop from `ReferenceOddAndPinBlocks` -/\n\n/-- `ReferencePinDensityProduct` from `ReferenceOddAndPinBlocks` taken as a hypothesis: only its\nfirst conjunct (`gradCov d (Kinf d) R = 1`) and fourth conjunct\n(`pinCov d (Kinf d) (R 0) R = diagonal (3, 1, …, 1)`) are used. -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "ir_epsilon_pos", + "line": 790, + "source_header": "eferencePinDensityProduct := by\n apply rp_referencePinDensityProduct_of_blockIdentities\n intro d hd23 hd R hR\n obtain ⟨hG, -, -, hV, -⟩ := h d hd23 hd R hR\n exact ⟨hG, hV⟩\n\n/-! ## `ir_`: the Sectio" + }, + { + "kind": "theorem", + "unqualified_name": "ir_epsilon_lt", + "line": 799, + "source_header": "ndRatioBounds`) -/\n\n/-! ### (a) Elementary facts about `epsilon = 10^(-108)` -/\n\n/-- `0 < epsilon`. -/\ntheorem ir_epsilon_pos : (0 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "ir_one_sub_epsilon_pos", + "line": 804, + "source_header": "positivity\n\n/-- `epsilon < 1/100`: a crude upper bound sufficient for every sig" + }, + { + "kind": "theorem", + "unqualified_name": "ir_one_le_one_add_epsilon", + "line": 809, + "source_header": "lt : epsilon < (1 / 100 : ℝ) := by\n unfold epsilon\n norm_num\n\n/-- `0 < 1 - epsilo" + }, + { + "kind": "theorem", + "unqualified_name": "ir_rpow_le_pow_five", + "line": 814, + "source_header": ": ℝ) < 1 - epsilon := by\n have := ir_epsilon_lt\n linarith\n\n/-- `1 ≤ 1 + epsilon`. -/\ntheorem ir_one_le_one_add_epsilon : (1 : ℝ) ≤ 1 + epsilon := by\n have := ir_epsilon_pos\n linarith\n\n/-! ### (b) The two one-sided power estimates -/\n\n/-- For a real exponent `b ≤ 5`, `(1 + epsilon)^b ≤ (1 + epsilon)^5`: monotonicity of the real\npower in the exponent for a base `≥ 1` (`R" + }, + { + "kind": "theorem", + "unqualified_name": "ir_bernoulli", + "line": 824, + "source_header": "(1 + epsilon) ^ b ≤ (1 + epsilon) ^ 5 := by\n have h := Real.rpow_le_rpow_of_exponent_le ir_one_le_one_add_epsilon hb\n rwa [show (5 : ℝ) = ((5 : ℕ) : ℝ) by norm_num, Real.rpow_natCast] at h\n\n/-- Bernoulli's inequality at `s = -" + }, + { + "kind": "theorem", + "unqualified_name": "ir_lower_rational", + "line": 832, + "source_header": "^ a := by\n have hε := ir_epsilon_lt\n have h := one_add_mul_self_le_rpow_one_add (show (-1 : ℝ) ≤ -epsilon by linarith) ha\n rw [show (1 : ℝ) + -epsilon = 1 - epsilon by ring] at h\n linarith\n\n/-! ### (c) The two exact rational inequalities (de" + }, + { + "kind": "theorem", + "unqualified_name": "ir_upper_rational", + "line": 839, + "source_header": "1 - 13 epsilon)(1 + epsilon)^5 ≤ 1 - 5 epsilon`, exact rational arithmetic. -/\ntheorem ir_lower_rational : (1 - 13 * epsilon) * (1 + epsilon) ^ 5 ≤ 1 - 5 * epsilon := by\n u" + }, + { + "kind": "theorem", + "unqualified_name": "ir_lower_bound", + "line": 844, + "source_header": "+ epsilon)^5 ≤ (1 + 28 epsilon)(1 - 5 epsilon)`, exact rational arithmetic. -/\ntheorem ir_upper_rational : (1 + epsilon) ^ 5 ≤ (1 + 28 * epsilon) * (1 - 5 * epsilon) := by\n unfold epsilon\n norm_num\n\n/-! ### (d) The ratio bounds for arbitrary exponents in `[1, 5]` -/\n\n/-- Lower bound: for `1 ≤ a ≤ 5` and `1 ≤" + }, + { + "kind": "theorem", + "unqualified_name": "ir_upper_bound", + "line": 862, + "source_header": "mul_le_mul_of_nonneg_left (ir_rpow_le_pow_five b hb5) (by linarith)\n _ ≤ 1 - 5 * epsilon := ir_lower_rational\n _ ≤ 1 - a * epsilon := by linarith\n _ ≤ (1 - epsilon) ^ a := ir_bernoulli a ha1\n\n/-- Upper bound: for `a ≤ 5` and `1" + }, + { + "kind": "theorem", + "unqualified_name": "ir_ratio_bounds", + "line": 877, + "source_header": ") * (1 - b * epsilon) :=\n mul_le_mul_of_nonneg_left (by linarith) (by linarith)\n _ ≤ (1 + 28 * epsilon) * (1 - epsilon) ^ b :=\n mul_le_mul_of_nonneg_left (ir_bernoulli b hb1) (by linarith)\n\n/-- Both ratio bounds together, for `1 ≤ a ≤ 5` and `1 ≤ b ≤ 5`. -/\ntheorem ir" + }, + { + "kind": "theorem", + "unqualified_name": "ir_exponentA_two", + "line": 883, + "source_header": ": b ≤ 5) :\n 1 - 13 * epsilon ≤ (1 - epsilon) ^ a / (1 + epsilon) ^ b ∧\n (1 + epsilon) ^ a / (1 - epsilon) ^ b ≤ 1 + 28 * epsilon :=\n ⟨ir_lower_bound a b ha1 h" + }, + { + "kind": "theorem", + "unqualified_name": "ir_exponentB_two", + "line": 890, + "source_header": "(e) The exponents in dimensions two and three -/\n\n/-- `exponentA 2 = 13/6` (`m = 1`, `n = 1`: `1 + 2/3 +" + }, + { + "kind": "theorem", + "unqualified_name": "ir_exponentA_three", + "line": 895, + "source_header": "= 13 / 6 := by\n simp [exponentA, symCoordDim]\n norm_num\n\n/-- `exponentB 2 = 5/2` (`d = 2`, `n = 1`: `2 + 1/2`)." + }, + { + "kind": "theorem", + "unqualified_name": "ir_exponentB_three", + "line": 900, + "source_header": "2 := by\n simp [exponentB, symCoordDim]\n norm_num\n\n/-- `exponentA 3 = 25/6` (`m = 2`, `n = 3`: `2 + 2/3 +" + }, + { + "kind": "theorem", + "unqualified_name": "li_geom_tail", + "line": 905, + "source_header": "3 = 25 / 6 := by\n simp [exponentA, symCoordDim]\n norm_num\n\n/-- `exponentB 3 = 9/2` (`d = 3`, `n = 3`: `3 + 3/2`). -/\ntheorem ir_exponentB_three : exponentB 3 = 9 / 2 := by\n simp [exponentB, symCoordDim]\n norm_num\n\n/-! ## `li_`: the lattice-image sum bound (`LatticeImageSumBound`) -/\n\n/-! ### (a) The geometric tail `(n+1)^9 exp(-288 (n+1)^2) ≤ exp(-288) (1/2)^n` -/\n\n/-- Induction on `n` from the registered successive-term ratio: the ratio of consecutive terms\n`j^9 exp(-288 j^2" + }, + { + "kind": "theorem", + "unqualified_name": "li_pow6_succ_le", + "line": 927, + "source_header": "ℝ) + 1) ^ 9 * Real.exp (-288 * ((n : ℝ) + 1) ^ 2)) :=\n h1\n _ ≤ (1 / 2) * (Real.exp (-288) * (1 / 2) ^ n) := mul_le_mul h2.le ih hnn (by norm_num)\n _ = Real.exp (-288) * ((1 / 2) ^ n * (1 / 2)) := by" + }, + { + "kind": "theorem", + "unqualified_name": "li_exp_succ_le", + "line": 935, + "source_header": ":= by\n refine le_trans ?_ (li_geom_tail n)\n have h0 : (0 : ℝ) ≤ n := by positivity\n have h1 : (1 : ℝ) ≤ (n : ℝ) + 1 := by linarith\n exact mul_le_mul_of_nonneg_righ" + }, + { + "kind": "theorem", + "unqualified_name": "li_summable_int_tsum_le", + "line": 943, + "source_header": "(-288) * (1 / 2) ^ n := by\n refine le_trans ?_ (li_geom_tail n)\n have h0 : (0 : ℝ) ≤ n := by positivity\n have h1 : (1 : ℝ) ≤ ((n : ℝ) + 1) ^ 9 := one_le_pow₀ (by linarith)\n exact le_mul_of_one_le_left (Real.exp_pos _).le h1\n\n/-! ### (b) One-dimensional sums over `ℤ` -/\n\n/-- A nonnegative `φ : ℤ → ℝ` whose values at `n+1` and at `-(n+1)` are at most\n`exp(-288) (1/2)^n` is summable over `ℤ`, with `∑' φ ≤ φ 0 + 4 exp(-288)`: split `ℤ` into `ℕ`\nand the negatives (`tsum_of_nat_of_neg_add_one`), peel off `φ 0` (`Summable.tsum_eq_zero_add`)\nand compare both tails with the geometric series (`tsum_geometric_two`). -/\ntheorem li_summable_int_tsum_le (φ :" + }, + { + "kind": "theorem", + "unqualified_name": "li_gauss_int", + "line": 981, + "source_header": "ve hsum2 : ∑' n : ℕ, φ (-((n : ℤ) + 1)) ≤ 2 * Real.exp (-288) := by\n rw [← hgeo_sum]\n exact hs2.tsum_le_tsum hneg hgeo\n refine ⟨Summable.of_nat_of_neg_add_one hs0 hs2, ?_⟩\n rw [tsum_of_nat_of_neg_add_one hs0 hs2]\n linarith\n\n/-- The Gaussian weight `m ↦ exp(-288 m^2)` is su" + }, + { + "kind": "theorem", + "unqualified_name": "li_pow_gauss_int", + "line": 1002, + "source_header": "ine ⟨h.1, h.2.trans ?_⟩\n have he := UniversalLaw.Proofs.Side24Elementary.Aux.exp_neg_lt\n have hp : (1 : ℝ) / 10 ^ 125 ≤ 1 / 4 := by norm_num\n have h0 : Real.exp (-288 * ((0 : ℤ) : ℝ) ^ 2) = 1 := by simp\n simp only [h0]\n linarith\n\n/-- The weight `m ↦ m^6 exp(-288 m^2)` is summable over `ℤ` with sum `" + }, + { + "kind": "theorem", + "unqualified_name": "li_sum_prod_le", + "line": 1020, + "source_header": "eal.exp_pos _).le)\n (fun n => by\n push_cast\n exact li_pow6_succ_le n)\n (fun n => by\n push_cast\n rw [neg_sq, Even.neg_pow (by decide : Even 6)]\n exact li_pow6_succ_le n)\n refine ⟨h.1, h.2.trans ?_⟩\n simp\n\n/-! ### (c) Finite sums of products over `Fin d → ℤ` -/\n\n/-- For `h : Fin d → ℤ → ℝ` nonnegative and summable in each coordinate, the sum of\n`∏ k, h k (n k)` over a finite set `s` of lattice points is at most `∏ k, ∑' m, h k m`: `s` lies\nin the box `Fintype.piFinset (fun k => s.image (· k))`, over which the sum factors\n(`Finset.prod_univ_sum`), and each factor is a partial sum of" + }, + { + "kind": "theorem", + "unqualified_name": "li_prod_ite_eq", + "line": 1043, + "source_header": "nset.prod_nonneg fun k _ => h0 _ _\n _ = ∏ k, ∑ m ∈ t k, h k m := (Finset.prod_univ_sum t fun k m => h k m).symm\n _ ≤ ∏ k, ∑' m, h k m :=\n Finset.prod_le_prod₀ (fun k _ => Finset.sum_nonneg fun m _ => h0 k m) (fun k _ => hle k)\n\n/-- A product over `Fin d` with one" + }, + { + "kind": "theorem", + "unqualified_name": "li_prod_exp", + "line": 1052, + "source_header": "et.univ.erase i, G k := by\n rw [← Finset.mul_prod_erase Finset.univ (fun k => if k = i then F k else G k)\n (Finset.mem_univ i), ite_eq_left rfl]\n congr 1\n exact Finset.prod_congr rfl fun k hk =>" + }, + { + "kind": "theorem", + "unqualified_name": "li_sum_cube_le", + "line": 1057, + "source_header": "p(-288 n_k^2) = exp(-288 |n|^2)` (`Real.exp_sum`). -/\ntheorem li_prod_exp (d : ℕ) (n : Fin d → ℤ) :\n ∏ k : Fin d, Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2) = Real.exp (-288 * intNormSq d n) := by\n rw [← Real.exp_sum, intNormSq, Finset.mul_sum]\n\n/-! ### (d) The pointwise domination for `d ≤ 3` -/\n\n/-- Power mean for at most three nonnegative term" + }, + { + "kind": "theorem", + "unqualified_name": "li_imageTerm_nonneg", + "line": 1077, + "source_header": "set.sum_nonneg fun i _ => pow_nonneg (ha i) 3\n calc (∑ i, a i) ^ 3 ≤ (∑ i, a i ^ 3) * (d : ℝ) ^" + }, + { + "kind": "theorem", + "unqualified_name": "li_imageTerm_le", + "line": 1084, + "source_header": "`imageTerm d n ≥ 0`. -/\ntheorem li_imageTerm_nonneg (d : ℕ) (n : Fin d → ℤ) : 0 ≤ imageTerm d n := by\n unfold imageTerm\n split_ifs\n · exact le_rfl\n · exact mul_nonneg (pow_nonneg (Finset.sum_nonneg fun i _ => sq_nonneg _) 3) (Real.exp_pos _).le\n\n/-- Pointwise domination for `d ≤ 3`: `imageTerm d n ≤ 9 ∑ i, ∏ k, h_i k (n k)`, where\n`h_i i m = m^6 exp(-288 m^2)` and `h_i k m = exp(-288 m^2)` for `k ≠ i`. Each product equals\n`(n_i^2)^3 exp(-288 |n|^2)` (`li_prod_ite_eq`, `li_prod_exp`), and `(∑ n_k^2)^3 ≤ 9 ∑ (n_i^2)^3`\nis `li_sum_cube_le" + }, + { + "kind": "theorem", + "unqualified_name": "li_partial_sum_le", + "line": 1114, + "source_header": "i, (((n i : ℤ) : ℝ) ^ 2) ^ 3) * Real.exp (-288 * ∑ i, ((n i : ℤ) : ℝ) ^ 2) :=\n mul_le_mul_of_nonneg_right h (Real.exp_pos _).le\n _ = 9 * ((∑ i, (((n i : ℤ) : ℝ) ^ 2) ^ 3) * Real.exp (-288 * ∑ i, ((n i : ℤ) : ℝ) ^ 2)) := by\n ring\n\n/-! ### (e) The uniform partial-sum bound -/\n\n/-- For `d ≤ 3` and every finite `s`, `∑ n ∈ s, imageTerm d n ≤ 1458 exp(-288)`: the pointwise\nbound `li_imageTerm_le`, the box bound `li_sum_prod_le` for each `i`, the one-dimensional sums\n`A ≤ 2` an" + }, + { + "kind": "theorem", + "unqualified_name": "dc_one_add_epsilon_pos", + "line": 1184, + "source_header": "288))) := by\n rw [Finset.sum_const, Finset.card_univ, Fintype.card_fin, nsmul_eq_mul]\n _ ≤ 9 * (3 * (16 * Real.exp (-288))) := by\n have hd' : (d : ℝ) ≤ 3 := by exact_mod_cast hd\n gcongr\n _ ≤ 1458 * Real.exp (-288) := by linarith\n\n/-! ## `dc_`: the Section 4 Gaussian density comparison (`DensityComparison`) -/\n\n/-! ### (a) Elementary facts about `epsilon = 10^(-108)`\n\n`" + }, + { + "kind": "theorem", + "unqualified_name": "dc_expand_identity", + "line": 1196, + "source_header": "_epsilon_pos` and `ir_one_sub_epsilon_pos` above\n(the `dc_` copies were removed at integration); only `0 < 1 + epsilon` is added here. -/\n\n/-- `0 < 1 + epsilon`. -/\ntheorem dc_one_add_epsilon_pos : (0 : ℝ) < 1 + epsilon := by\n have := ir_epsilon_pos\n linarith\n\n/-! ### (b) Loewner order: antitonicity of" + }, + { + "kind": "theorem", + "unqualified_name": "dc_conj_identity", + "line": 1211, + "source_header": "A hA\n calc (C - A) * A⁻¹ * (C - A) + (C - A)\n = C * A⁻¹ * C - C * (A⁻¹ * A) - (A * A⁻¹) * C + (A * A⁻¹) * A + (C - A) := by\n noncomm_ring\n _ = C * A⁻¹ * C - C := by\n rw [h1, h2]\n simp only [Mat" + }, + { + "kind": "theorem", + "unqualified_name": "dc_inv_sub_inv_posSemidef", + "line": 1223, + "source_header": "have h2 : C⁻¹ * C = 1 := Matrix.nonsing_inv_mul C hC\n calc C⁻¹ * (C * A⁻¹ * C - C) * C⁻¹\n = (C⁻¹ * C) * A⁻¹ * (C * C⁻¹) - C⁻¹ * (C * C⁻¹) := by\n noncomm_ring\n _ = A⁻¹ - C⁻¹ := by\n rw [h1, h2]\n simp only [Matrix.mul_one, Matrix.one_mul]\n\n/-- (L1) For real matrices: `A` positive definite, `C` positive definite and `C - A` p" + }, + { + "kind": "theorem", + "unqualified_name": "dc_quad_le", + "line": 1241, + "source_header": "tian.eq] at h1\n have h2 := h1.add hAC\n rwa [dc_expand_identity A C hAu] at h2\n have h3 : ((C⁻¹).conjTranspose * (C * A⁻¹ * C - C) * C⁻¹).PosSemidef :=\n hP.conjTranspose_mul_mul_same C⁻¹\n rw [hC.inv.isHermitian.eq] at h3\n rwa [dc_conj_identity A C hCu] at h3\n\n/-- The quadratic" + }, + { + "kind": "theorem", + "unqualified_name": "dc_one_le_det", + "line": 1249, + "source_header": "- A).PosSemidef) (x : Fin k → ℝ) :\n dotProduct x (Matrix.mulVec C⁻¹ x) ≤ dotProduct x (Matrix.mulVec A⁻¹ x) := by\n have h := (dc_inv_sub_inv_posSemidef hA hC hAC).dotProduct_mulVec_nonneg x\n simp only [star_trivial, Matrix.sub_mulVec, dotProduct_sub] at h\n linarith\n\n/-! ### (c) Loewner order: monotonicity of the determinant (L2) -/\n\n/-- A real matrix `M` with `M - 1` positive semidefinite has determinant at least" + }, + { + "kind": "theorem", + "unqualified_name": "dc_det_le_det", + "line": 1273, + "source_header": "nvalues i - 1 ∈ spectrum ℝ M - ({1} : Set ℝ) :=\n Set.sub_mem_sub hmem (Set.mem_singleton (1 : ℝ))\n rw [spectrum.sub_singleton_eq] at h\n simpa using h\n have h0 : (0 : ℝ) ≤ hherm.eigenvalues i - 1 := hspec hmem'\n simp only [RCLike.ofReal_real_eq_id, id]\n linarith\n\n/-- (L2) For real matri" + }, + { + "kind": "theorem", + "unqualified_name": "dc_det_smul", + "line": 1324, + "source_header": "⁻¹).det := by\n ring\n have hSS2 : 0 ≤ S.det * S.det := mul_self_nonneg _\n calc A.det = S.det * S.det := hdetA\n _ = S.det * S.det * 1 := (mul_one _).symm\n _ ≤ S.det * S.det * (S⁻¹ * C * S⁻¹).det := mul_le_mul_o" + }, + { + "kind": "theorem", + "unqualified_name": "dc_scale_identity", + "line": 1331, + "source_header": ".symm\n\n/-! ### (d) Determinant scaling and real-power bookkeeping -/\n\n/-- `det (c • C) = c ^ k * det C` for a `k × k` real matrix. -/\ntheorem dc_det_smul {k : ℕ} (C : Matrix (Fin k) (Fin k) ℝ) (c : ℝ) :\n (c • C).det = c ^ k * C.det := by\n rw [Matrix.det_smul, Fintype.c" + }, + { + "kind": "theorem", + "unqualified_name": "dc_assemble_lower", + "line": 1348, + "source_header": "ve hapos : a ^ ((k : ℝ) / 2) ≠ 0 := (Real.rpow_pos_of_pos ha _).ne'\n have hbpos : b ^ ((k : ℝ) / 2) ≠ 0 := (Real.rpow_pos_of_pos hb _).ne'\n rw [Real.div_rpow ha.le hb.le, Real.mul_rpow (pow_nonneg ha.le k) hD.le,\n Real.mul_rpow (pow_nonneg hb.le k) hD.le, hak, hbk]\n field_simp\n\n/-! ### (e) Assembly of the two pointwise inequalities from abstract rea" + }, + { + "kind": "theorem", + "unqualified_name": "dc_assemble_upper", + "line": 1358, + "source_header": "hd : dB ≤ dC) (hdC : 0 ≤ dC) (he : eA ≤ eC) (heA : 0 ≤ eA) :\n s * (P * dA * eA) ≤ P * dC * eC := by\n calc s * (P * dA * eA) = P * (s * dA) * eA := by ring\n _ = P * dB * eA := by rw [hs]\n _ ≤ P * dC * eC := mul_le_mul (mul_le_mul_of_nonneg_left hd hP) he heA (mul_" + }, + { + "kind": "theorem", + "unqualified_name": "thetaSummable", + "line": 1369, + "source_header": "hdA : 0 ≤ dA) (he : eC ≤ eB) (heC : 0 ≤ eC) :\n P * dC * eC ≤ s * (P * dB * eB) := by\n calc P * dC * eC ≤ P * dA * eB :=\n mul_le_mul (mul_le_mul_of_nonneg_left hd hP) he heC (mul_nonneg hP hdA)\n _ = P * (s * dB) * eB := by rw [hs]\n _ = s * (P * dB * eB) := by ring\n\nend Aux\n\n/-! ## The theta family is summable at every point, in every dimension -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ThetaSummable` (claim `side24-coefficient`).\nMethod: comparison `Summable.of_nonneg_of_le` with the dominating family\n`exp(‖z‖^2/2) ∏ i, exp(-144 n_i^2)` (`Aux.th_term_le_dominant`, from `‖24 n‖^2 = 576 ∑ n_i^2`\nand `Real.exp_sum`); that family is summable (`Aux.th_summable_dominant`) because\n`m ↦ exp(-144 m^2)` is summable on `ℤ` (`HurwitzKernelBounds.summable_f_int`) and products of\na nonnegative summable function are summable over `Fin d → ℤ` (`Aux.th_summable_pi_prod`, via\n`Fintype.piFinset`, `Finset.prod_univ_sum` and `summable_of_sum_le`).\nDoes not establish: the informal convergence statement of the source as the source's object\n(the alignment of `E d`, `latticeVec` and this family with the source's `R^d`, `24 Z^d` and\n`K_24` is PENDING_INDEPENDENT_REVIEW); any value, positivity, smoothness or Poisson-summation\nproperty of `thetaSum24` or `K24`; `ImageBound`, `LatticeImageSumBound` or the derivative\nbounds of Section 2; any enclosure of the coefficient; the statement module's own\n`Does not claim:` text (the state" + }, + { + "kind": "theorem", + "unqualified_name": "derivativePairingBound", + "line": 1391, + "source_header": "r review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/\ntheorem thetaSummable (d : ℕ) : UniversalLaw.Spec.Side24.ThetaSummable d := by\n intro z\n exact Summable.of_nonneg_of_le (fun n => (Real.exp_pos _).le)\n (fun n => Aux.th_term_le_dominant d z n) (Aux.th_summable_dominant d z)\n\n/-! ## Inventory theorem -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.DerivativePairingBound` (register row `side24-coefficient`,\nSection 2 first display of SIDE24-COEFFICIENT-D23-20260924-v1).\nMethod: the contraction at a unit tuple is at most the operator norm `‖iteratedFDeriv ℝ q (Kinf d) x‖`\n(`Aux.dp_abs_le_opNorm`, from `ContinuousMultilinearMap.le_opNorm`); the operator norms satisfy the\nHermite-type recursion `b_{q+2} ≤ ‖x‖ b_{q+1} + (q+1) b_q` (`Aux.dp_recursion`, from\n`norm_iteratedFDeriv_fderiv`, the explicit derivative `fderiv ℝ (Kinf d) y = Kinf d y • (-(innerSL ℝ y))`\nand the Leibniz bound `norm_iteratedFDeriv_smul_le`, the linear factor's derivatives of order `≥ 2`\nvanishing), and with `b_0 = Kinf d x`, `b_1 = Kinf d x ‖x‖` the orders `q ≤ 6` are matched to the\nunfolded `pairingSum q ‖x‖` (`Aux.dp_pairing_all`, `interval_cases`, `nlinarith`).\nDoes not establish: the informal Section 2 display or its review and acceptance; the alignment of the\nformal objects (`Kinf`, `IsUnitTuple`, `pairingSum`, Mathlib's `iteratedFDeriv ℝ q`) with the source's\n(PENDING_INDEPENDENT_REVIEW); validity for `q > 6` (the Prop restricts to `q ≤ 6`, as the source do" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeBoundAtLeastOne", + "line": 1412, + "source_header": "osition of `side24-coefficient`, which is REVIEWED_SCOPED as transcribed in the register, not\nderived here. -/\ntheorem derivativePairingBound : UniversalLaw.Spec.Side24.DerivativePairingBound := by\n intro d q hq x u hu\n exact (Aux.dp_abs_le_opNorm d q x u hu).trans (Aux.dp_pairing_all d x q hq)\n\n/-! ## The Section 2 derivative bound at `|x| ≥ 1` -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.DerivativeBoundAtLeastOne` (register row `side24-coefficient`,\nSection 2 of SIDE24-COEFFICIENT-D23-20260924-v1, \"At |x|>=1 this is at most 76 |x|^6 e^(-|x|^2/2)\").\nMethod: the Section 2 pairing bound `|D^q Kinf (x) u| ≤ exp(-‖x‖²/2) · pairingSum q ‖x‖` is the\ninventory theorem `derivativePairingBound` of this module (the Hermite-type recursion\n`b_{q+2} ≤ ‖x‖ b_{q+1} + (q+1) b_q` for the operator norms, `Aux.dp_recursion`, with\n`ContinuousMultilinearMap.le_opNorm` at a unit tuple); the hypothesis-form helper\n`Aux.d1_derivativeBoundAtLeastOne_of_derivativePairingBound` combines it with the elementary\ninequality `pairingSum q r ≤ 76 r^6` for `1 ≤ r`, `q ≤ 6` (`Aux.d1_pairingSum_le_of_one_le`:\n`interval_cases`, `Finset.sum_range_succ`, `Nat.factorial`, `norm_num`, and the monomial bounds\n`r^k ≤ r^6` from `pow_le_pow_right₀`, `one_le_pow₀`), by `mul_le_mul_of_nonneg_left` with\n`0 ≤ exp(-‖x‖²/2)`.\nDoes not establish: the informal Section 2 display or its review and acceptance; the alignment of the\nformal objects (`Kinf`, `IsUnitTuple`, `pairingSum`, Mathlib's `iteratedFDeriv ℝ q`) with the source's\n(PENDING_INDEPENDENT_REVIEW); any identification with the main-branch targets\n`UniversalLaw.Side24.pairing_sum_six` and `pairing_sum_le_six`, which kernel-check the coefficient\narithmetic `1+15+45+15=76` and `76` bounding the smaller orders there, not here; validity for `q > 6` or\nfor `‖x‖ < 1` (the Prop restri" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeBoundAtZero", + "line": 1436, + "source_header": "{d,24}`; the disposition of `side24-coefficient`, which is REVIEWED_SCOPED as transcribed\nin the register, not derived here. -/\ntheorem derivativeBoundAtLeastOne : UniversalLaw.Spec.Side24.DerivativeBoundAtLeastOne :=\n Aux.d1_derivativeBoundAtLeastOne_of_derivativePairingBound derivativePairingBound\n\n/-! ## The Section 2 derivative bound at the origin -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.DerivativeBoundAtZero` (register row `side24-coefficient`,\nSection 2 of SIDE24-COEFFICIENT-D23-20260924-v1, \"contraction has absolute value at most 15\").\nMethod: the hypothesis-form helper `Aux.d0_derivativeBoundAtZero_of_derivativePairingBound`\nspecialises the pairing bound `DerivativePairingBound` to `x = 0`, where `‖0‖ = 0`,\n`exp (-(0 ^ 2) / 2) = 1` and `pairingSum q 0 ≤ 15` for `q ≤ 6` (`Aux.d0_pairingSum_zero_le`:\nthe values are `1, 0, 1, 0, 3, 0, 15`, by `interval_cases`, `Finset.sum_range_succ`, `norm_num`);\nthe pairing bound itself is the inventory theorem `derivativePairingBound` of this module\n(`Aux.dp_recursion`, `Aux.dp_pairing_all`, `Aux.dp_abs_le_opNorm`).\nDoes not establish: the informal Section 2 display or its review and acceptance; the alignment of\nthe formal objects (`Kinf`, `IsUnitTuple`, `pairingSum`, Mathlib's `iteratedFDeriv ℝ q` at `0`) with\nthe source's (PENDING_INDEPENDENT_REVIEW); the double-factorial identity `5!! = 15` as such, which\nis kernel-checked on main (`UniversalLaw.Side24.sixth_moment_double_factorial`) and is neither\nre-proved nor cited here (only `pairingSum 6 0 = 15` is computed); validity for `q > 6` (the Prop\nrestricts to `q ≤ 6`, as the source does); any value" + }, + { + "kind": "theorem", + "unqualified_name": "referenceOddAndPinBlocks", + "line": 1457, + "source_header": "coefficient `c_{d,24}`; the disposition of\n`side24-coefficient`, which is REVIEWED_SCOPED as transcribed in the register, not derived here. -/\ntheorem derivativeBoundAtZero : UniversalLaw.Spec.Side24.DerivativeBoundAtZero :=\n Aux.d0_derivativeBoundAtZero_of_derivativePairingBound derivativePairingBound\n\n/-! ## The Section 1 reference blocks of `K_infty` in every orthonormal frame -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ReferenceOddAndPinBlocks` (claim `side24-coefficient`).\nMethod: the derivative contractions of `Kinf d` at `0` are evaluated by peeling one direction\nat a time (`Aux.rb_peel`, from `iteratedFDeriv_succ_apply_right` and\n`iteratedFDeriv_clm_apply_const_apply`) with explicit `HasFDerivAt` closed forms of the\nintermediate functions (`Aux.rb_fderiv_kinf`, `rb_fderiv_g1`, `rb_fderiv_g2`,\n`rb_fderiv_g3_zero`, `rb_fderiv_P3`, `rb_fderiv_P4`, `rb_fderiv_P5_zero`), giving\n`Aux.rb_order_two` (`-⟪a, b⟫`), `Aux.rb_order_four` (the three pairings) and `Aux.rb_order_six`\n(`-15 ⟪u, u⟫^3`); in an orthonormal frame (`orthonormal_iff_ite`) the five blocks follow\n(`Aux.rb_gradCov`, `rb_thirdVar`, `rb_thirdGradCov`, `rb_pinCov`, `rb_condThirdVariance`,\nthe last with `inv_one`, `Matrix.one_mulVec` and `Finset.sum_ite_eq'`).\nDoes not establish: the informal Section 1 block values of the source as the source's objects\n(the alignment of `E d`, `Kinf`, `derivContraction`, `gradCov`, `pinCov`, `thirdGradCov`,\n`thirdVar` and `condThirdVariance` with the source's `R^d`, `K_infty`, covariances and\nconditional variance is PENDING_INDEPENDENT_REVIEW); that any of these matrices is the\ncovariance of a random vector or field (none is constructed in the statement module); the\nstatement module's own `Does not claim:` text (\"the identities (statement only); `15 - 9 = 6` is\nkernel-checked on main (`UniversalLaw.Side24.conditional_third_derivative_variance`), not\nhere\"), which describes the statement packet, is not edited here, and main's theorem is neither\ncited nor relied on; `ReferencePinDensityProduct`, `CovarianceOrdering`,\n`EntrywiseCovarianceBound` or any other Prop of the modul" + }, + { + "kind": "theorem", + "unqualified_name": "referencePinDensityProduct", + "line": 1486, + "source_header": "acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/\ntheorem referenceOddAndPinBlocks : UniversalLaw.Spec.Side24.ReferenceOddAndPinBlocks := by\n intro d _ hd R hR\n exact ⟨Aux.rb_gradCov R hR, Aux.rb_thirdVar hd R hR, Aux.rb_thirdGradCov hd R hR,\n Aux.rb_pinCov hd R hR, Aux.rb_condThirdVariance hd R hR⟩\n\n/-! ## The Section 1 reference pin-density product -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ReferencePinDensityProduct` (register row `side24-coefficient`,\nSection 1 of SIDE24-COEFFICIENT-D23-20260924-v1, \"p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3)\").\nMethod: the hypothesis form `Aux.rp_referencePinDensityProduct_of_referenceOddAndPinBlocks` takes\nthe inventory theorem `referenceOddAndPinBlocks` of this module and uses only its first conjunct\n`gradCov d (Kinf d) R = 1` and fourth conjunct `pinCov d (Kinf d) (R 0) R = diagonal (3, 1, …, 1)`\n(both from the contractions `Aux.rb_order_two`, `Aux.rb_order_four` in an orthonormal frame); the\ncommon core `Aux.rp_referencePinDensityProduct_of_blockIdentities` rewrites the two blocks and\nfinishes with the density algebra `Aux.rp_density_algebra` (`Matrix.det_one`, `Matrix.det_diagonal`,\n`Finset.prod_ite_eq'`, `Matrix.mulVec_zero`, `Real.rpow_add`, `Real.rpow_neg`, `Real.sqrt_eq_rpow`).\nDoes not establish: the informal Section 1 display or its review and acceptance; the alignment of\nthe formal objects (`gaussDensity`, `gradCov`, `pinCov`, `derivContraction` through Mathlib's\n`iteratedFDeriv ℝ` at `0`, `Orthonormal ℝ R`) with the source's (PENDING_INDEPENDENT_REVIEW); the\ndeterminant identity `det diag(3,1,…,1) = 3` as the main-branch target\n`UniversalLaw.Side24.pin_determinant_and_joint_dimension`, which is kernel-checked on main and is\nneither cited nor re-used here (the determinant is recomputed by `Matrix.det_diagonal` in\n`Aux.rp_det_pinDiagonal`); that `gaussDensity` is the density of any random vector or that any field\nis constructed; the remaining conjuncts of `ReferenceOddAndPinBlocks` (`Var(t) = 15`,\n`Cov(t, G) = (-3, 0, …, 0)`, `tau^2 = 6`), which this theorem does not use; the value for\n`d ∉ {2, 3}`" + }, + { + "kind": "theorem", + "unqualified_name": "integrandRatioBounds", + "line": 1512, + "source_header": "t `c_{d,24}`; the disposition of `side24-coefficient`, which is REVIEWED_SCOPED as\ntranscribed in the register, not derived here. -/\ntheorem referencePinDensityProduct : UniversalLaw.Spec.Side24.ReferencePinDensityProduct :=\n Aux.rp_referencePinDensityProduct_of_referenceOddAndPinBlocks referenceOddAndPinBlocks\n\n/-! ## The Section 4 integrand-ratio bounds in dimensions two and three -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.IntegrandRatioBounds` (claim `side24-coefficient`).\nMethod: case split `d = 2`, `d = 3`, where the exponents evaluate to `a = 13/6, b = 5/2` and\n`a = 25/6, b = 9/2` (`Aux.ir_exponentA_two`, `Aux.ir_exponentB_two`, `Aux.ir_exponentA_three`,\n`Aux.ir_exponentB_three`); for arbitrary `1 ≤ a, b ≤ 5` both bounds follow\n(`Aux.ir_ratio_bounds`) from Bernoulli's inequality `1 - a epsilon ≤ (1 - epsilon)^a`\n(`one_add_mul_self_le_rpow_one_add`, `Aux.ir_bernoulli`), exponent monotonicity\n`(1 + epsilon)^b ≤ (1 + epsilon)^5` (`Real.rpow_le_rpow_of_exponent_le`,\n`Aux.ir_rpow_le_pow_five`), `le_div_iff₀` / `div_le_iff₀`, and the two exact rational\ninequalities `(1 - 13 epsilon)(1 + epsilon)^5 ≤ 1 - 5 epsilon` and\n`(1 + epsilon)^5 ≤ (1 + 28 epsilon)(1 - 5 epsilon)` decided by `norm_num`\n(`Aux.ir_lower_rational`, `Aux.ir_upper_rational`).\nDoes not establish: the informal Section 4 display of the source as the source's object (the\nalignment of `epsilon`, `exponentA`, `exponentB` and these power quotients with the source's\n`epsilon`, `a`, `b` and integrand ratio is PENDING_INDEPENDENT_REVIEW); that the integrand ratio\nof the source equals these power quotients (not specified in the statement packet); the\narithmetic `13 ≤ 32`, `28 ≤ 32` and `32*10^(-108) < 10^(-106)` (kernel-checked on main in\n`UniversalLaw.Side24.ratio_constant_ordering` and `density_comparison_below_reported`, not\nhere); `DensityComparison` or any covariance ordering; any enclosure of the coefficient; the\nstatement module's own `Does not cla" + }, + { + "kind": "theorem", + "unqualified_name": "latticeImageSumBound", + "line": 1543, + "source_header": "hd\n rcases hd with rfl | rfl\n · rw [Aux.ir_exponentA_two, Aux.ir_exponentB_two]\n exact Aux.ir_ratio_bounds _ _ (by norm_num) (by norm_num) (by norm_num) (by norm_num)\n · rw [Aux.ir_exponentA_three, Aux.ir_exponentB_three]\n exact Aux.ir_ratio_bounds _ _ (by norm_num) (by norm_num) (by norm_num) (by norm_num)\n\n/-! ## The lattice-image sum bound for `d ≤ 3` -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.LatticeImageSumBound` (claim `side24-coefficient`).\nMethod: both conjuncts from the uniform partial-sum bound `Aux.li_partial_sum_le` via\n`summable_of_sum_le` and `Real.tsum_le_of_sum_le` (terms nonnegative, `Aux.li_imageTerm_nonneg`);\nthe partial sums are dominated pointwise by `9 ∑ i, ∏ k, h_i k (n k)` (`Aux.li_imageTerm_le`,\nfrom the power mean `pow_sum_div_card_le_sum_pow` and `Real.exp_sum`), each finite sum of\nproducts sits in a `Fintype.piFinset` box and factors (`Aux.li_sum_prod_le`, via\n`Finset.prod_univ_sum` and `Summable.sum_le_tsum`), and the one-dimensional sums over `ℤ` are\nbounded by `2` and `4 exp(-288)` (`Aux.li_gauss_int`, `Aux.li_pow_gauss_int`) through\n`tsum_of_nat_of_neg_add_one`, the geometric series `tsum_geometric_two` and the registered\n`SuccessiveTermRatio` (`SpecificationProofs.Side24Elementary.successiveTermRatio`), giving\n`432 exp(-288) ≤ 1458 exp(-288)`.\nDoes not establish: the informal Section 2 lattice display of the source as the source's object\n(the alignment of `intNormSq`, `imageTerm` and this `tsum` over `Fin d → ℤ` with the source's\n`sum_{n ≠ 0} |n|^6 e^(-288|n|^2)` is PENDING_INDEPENDENT_REVIEW); the intermediate shell count\n`729 ∑_j j^9 e^(-288 j^2)` of the source, which the Prop does not specify and this proof does not\nreproduce; the arithmetic `27·27 = 729`, `729·2 = 1458` kernel-checked on main, not here;\n`ImageBound`, the derivative" + }, + { + "kind": "theorem", + "unqualified_name": "densityComparison", + "line": 1569, + "source_header": "-COEFFICIENT-D23-20260924-v1. -/\ntheorem latticeImageSumBound : UniversalLaw.Spec.Side24.LatticeImageSumBound := by\n intro d hd\n exact ⟨summable_of_sum_le (fun n => Aux.li_imageTerm_nonneg d n) (Aux.li_partial_sum_le d hd),\n Real.tsum_le_of_sum_le (fun n => Aux.li_imageTerm_nonneg d n) (Aux.li_partial_sum_le d hd)⟩\n\n/-! ## The Section 4 Gaussian density comparison -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.DensityComparison` (claim `side24-coefficient`).\nMethod: with `A = (1 - epsilon) • C0` and `B = (1 + epsilon) • C0` (positive definite by\n`Matrix.PosDef.smul`), the Loewner lemmas `Aux.dc_det_le_det` (`det A ≤ det C ≤ det B`, via\n`CFC.sqrt`, `Matrix.PosSemidef.conjTranspose_mul_mul_same`,\n`Matrix.posSemidef_iff_isHermitian_and_spectrum_nonneg` and\n`Matrix.IsHermitian.det_eq_prod_eigenvalues`) and `Aux.dc_quad_le`\n(`x ⬝ B⁻¹ x ≤ x ⬝ C⁻¹ x ≤ x ⬝ A⁻¹ x`, via `Aux.dc_inv_sub_inv_posSemidef`) give the two\ndeterminant and exponent comparisons; `Aux.dc_scale_identity` with `Matrix.det_smul` turns\n`((1 ∓ epsilon)/(1 ± epsilon))^(n/2) · det((1 ∓ epsilon) • C0)^(-1/2)` into\n`det((1 ± epsilon) • C0)^(-1/2)`; `Real.rpow_le_rpow_of_nonpos`, `Real.exp_le_exp` and\n`Aux.dc_assemble_lower` / `Aux.dc_assemble_upper` finish after unfolding `gaussDensity`.\nDoes not establish: the informal Section 4 display of the source as the source's object (the\nalignment of `gaussDensity`, `symCoordDim`, `epsilon` and the positive-semidefinite hypotheses\nwith the source's densities, `n = m(m+1)/2`, `epsilon` and ordering is\nPENDING_INDEPENDENT_REVIEW); the cone-moment consequence `(1 ± epsilon)^m D0` and the scaling\n`a^m` of `h(A) = det(A)^2 1{A<0}` (not specified in the statement packet); that\n`(1 ± epsilon) • C0` or `C` are covariances of any random object; `CovarianceOrdering` or any\nordering of `C24` against `Cref`; any enclosure of the coefficient; the statement module's own" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Hazard.lean", + "sha256": "65584aea77eefd1f59aee51554d94b9ea9c390f7a62da40e4210f8487dbdf8f1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "blockWeight", + "line": 32, + "source_header": "x\n\n/-! ### The block-local weight -/\n\n/-- The block-restricted weight `w_i(S) = prod_{v in S} p_v prod_{v in X_i \\ S} (1 - p_v)`; the\nintegrand of `localGood`. -/\nnoncomputable def blockWeight {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X → ℝ) (i : Fin F.b) (S : Finset X" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_eq", + "line": 40, + "source_header": "p v)\n\n/-- `localGood` is the sum of the indicator of the downset times the block weight. -/\ntheorem localGood_eq {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (p : X → ℝ)\n (i : Fin F.b) :\n localGood F p i =\n ∑ S ∈ (block F i).powerset, Set.indicator (downset F) (blockWeight F" + }, + { + "kind": "theorem", + "unqualified_name": "blockWeight_nonneg", + "line": 46, + "source_header": ":= rfl\n\n/-- Block weights are nonnegative for `p in [0,1]^X`. -/\ntheorem blockWeight_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) (S : Finset X) :\n 0 ≤ blockWeigh" + }, + { + "kind": "theorem", + "unqualified_name": "sum_blockWeight_eq_one", + "line": 54, + "source_header": "(hp v).2]\n\n/-- The block weights of all subsets of a block sum to one (`Finset.prod_add`). -/\ntheorem sum_blockWeight_eq_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X → ℝ) (i : Fin F.b) :\n ∑ S ∈ (block F i).powerset, blockWeight" + }, + { + "kind": "theorem", + "unqualified_name": "sum_blockWeight_filter_supset", + "line": 64, + "source_header": "xact h.symm\n\n/-- The marginal identity: for `S ⊆ X_i`, the block weights of the supersets of `S` inside the\nblock sum to `prod_{v in S} p_v` (bijection `T ↦ T \\ S` onto `2^(X_i \\ S)`). -/\ntheorem sum_blockWeight_filter_supset {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) (p : X → ℝ) (i : Fin F.b) {S : Finset X} (hS : S ⊆ block F i) :\n ∑ T ∈ (block F i).powerset with S ⊆ T, blockWeight F p i T =" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_nonneg", + "line": 105, + "source_header": "h2, mul_one]\n\n/-! ### Bounds on the local good and failure probabilities -/\n\n/-- `0 ≤ mu_p(D_i)`. -/\ntheorem localGood_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) : 0" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_le_one", + "line": 114, + "source_header": "onneg F hp i T) S\n\n/-- `mu_p(D_i) ≤ 1`. -/\ntheorem localGood_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) :" + }, + { + "kind": "theorem", + "unqualified_name": "localFailure_nonneg", + "line": 121, + "source_header": "ht_nonneg F hp i S)\n\n/-- `0 ≤ q_i`. -/\ntheorem localFailure_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) : 0" + }, + { + "kind": "theorem", + "unqualified_name": "localFailure_le_one", + "line": 127, + "source_header": "alGood_le_one F hp i]\n\n/-- `q_i ≤ 1`. -/\ntheorem localFailure_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) :" + }, + { + "kind": "theorem", + "unqualified_name": "one_sub_localFailure", + "line": 133, + "source_header": "ocalGood_nonneg F hp i]\n\n/-- `1 - q_i = mu_p(D_i)`. -/\ntheorem one_sub_localFailure {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X → ℝ) (i : Fin F.b) : 1 - localFailur" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_le_one_sub_prod", + "line": 139, + "source_header": "nfold localFailure\n ring\n\n/-- Every subset of the block containing `a_i + 1` or more coordinates is bad, so\n`mu_p(D_i) ≤ 1 - prod_{v in S} p_v` for every such `S ⊆ X_i` (marginal identity plus the\ntermwise bound `indicator ≤ weight`). -/\ntheorem localGood_le_one_sub_prod {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) {i : Fin F.b} {S : Finset X}\n (hS : S ⊆ block F i) (hcard : F.a i + 1 ≤ S.card) :\n localGo" + }, + { + "kind": "theorem", + "unqualified_name": "prod_le_localFailure_of_card", + "line": 166, + "source_header": "F p i hS] at h4\n linarith\n\n/-- The block-local price bound of the (T3)/(T5) arguments: for `S ⊆ X_i` with\n`|S| ≥ a_i + 1`, `prod_{v in S} p_v ≤ q_i`. -/\ntheorem prod_le_localFailure_of_card {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) {i : Fin F.b}\n {S : Finset X} (hS : S ⊆ block F i) (hcard : F.a i + 1 ≤ S.card) :\n ∏ v" + }, + { + "kind": "theorem", + "unqualified_name": "prod_block_le_localFailure", + "line": 175, + "source_header": "e_one_sub_prod F hp hS hcard]\n\n/-- The full block has `a_i d_i + 1 ≥ a_i + 1` coordinates, so `prod_{v in X_i} p_v ≤ q_i`. -/\ntheorem prod_block_le_localFailure {X : Type} [Fintype X] [DecidableEq X]\n {F : RealizedData X} (hF : IsRealizedFamily F) {p : X → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) :\n ∏ v ∈ bloc" + }, + { + "kind": "theorem", + "unqualified_name": "neg_log_one_sub_ge", + "line": 185, + "source_header": "ight (F.a i) (hF.2.1 i)\n omega\n\n/-! ### The transformed price `phi` -/\n\n/-- `q ≤ -log(1 - q)` for `q < 1` (from `1 - q ≤ exp(-q)`). -/\ntheorem neg_log_one_sub_ge {q : ℝ} (" + }, + { + "kind": "theorem", + "unqualified_name": "le_phi_self", + "line": 196, + "source_header": "rw [Real.log_exp] at h2\n linarith\n\n/-- `q ≤ phi(q)` for `q ≤ 1` (in particular on `[0, 1]`). -/\ntheorem le_phi_" + }, + { + "kind": "theorem", + "unqualified_name": "pairwiseDisjoint_inter_block", + "line": 203, + "source_header": "1 (neg_log_one_sub_ge h)\n · exact h1\n\n/-! ### Blocks partition the ground set -/\n\n/-- The traces `T ∩ X_i` of a set on the blocks are pairwise disjoint. -/\ntheorem pairwiseDisjoint_inter_block {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) (T : Finset X) :\n (↑(univ : Finset (Fin F.b)) : Set (Fin F.b)).Pairwi" + }, + { + "kind": "theorem", + "unqualified_name": "biUnion_inter_block", + "line": 217, + "source_header": "hvj\n exact hij (hvi.2.symm.trans hvj.2)\n\n/-- The traces of a set on the blocks reassemble it. -/\ntheorem biUnion_inter_block {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (T : Finset X) : (univ : Finset (Fin" + }, + { + "kind": "theorem", + "unqualified_name": "prod_eq_prod_blocks", + "line": 223, + "source_header": "block F i) = T := by\n ext v\n simp [block]\n\n/-- A product over a set factors over its traces on the blocks. -/\ntheorem prod_eq_prod_blocks {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (f : X → ℝ) (T : Finset X) :" + }, + { + "kind": "theorem", + "unqualified_name": "compl_inter_block", + "line": 230, + "source_header": "od_biUnion (pairwiseDisjoint_inter_block F T)\n\n/-- The complement's trace on a block is the block minus the trace. -/\ntheorem compl_inter_block {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (U : Finset X) (i : Fin F.b) : (univ" + }, + { + "kind": "theorem", + "unqualified_name": "weight_eq_prod_blockWeight", + "line": 237, + "source_header": "mem_sdiff, mem_univ, true_and, not_and]\n tauto\n\n/-- The weight of a subset factors over the blocks: `w(U) = prod_i w_i(U ∩ X_i)`. -/\ntheorem weight_eq_prod_blockWeight {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X → ℝ) (U : Finset X) : we" + }, + { + "kind": "theorem", + "unqualified_name": "isGood_inter_block", + "line": 248, + "source_header": "_congr rfl fun i _ => ?_\n rw [compl_inter_block]\n\n/-! ### Good sets have good block restrictions -/\n\n/-- `U in D` implies `U ∩ X_i in D`. -/\ntheorem isGood_inter_block {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n {U : Finset X} (hU :" + }, + { + "kind": "theorem", + "unqualified_name": "indicator_weight_le", + "line": 257, + "source_header": "U.1 j)\n · exact image_subset_image inter_subset_left\n\n/-- Termwise: `1_D(U) w(U) ≤ prod_i 1_D(U ∩ X_i) w_i(U ∩ X_i)`. -/\ntheorem indicator_weight_le {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (U : Finset X) :\n Set.indicator (downset F) (weight p) U ≤\n ∏ i, Set.in" + }, + { + "kind": "theorem", + "unqualified_name": "sum_prod_blocks", + "line": 270, + "source_header": "cator_nonneg (fun T _ => blockWeight_nonneg F hp i T) _\n\n/-! ### The factorisation of a block-local product over `2^X` -/\n\n/-- `sum_{U ⊆ X} prod_i g_i(U ∩ X_i) = prod_i sum_{S ⊆ X_i} g_i(S)`: the bijection\n`U ↦ (i ↦ U ∩ X_i)` from `2^X` onto `prod_i 2^(X_i)` with inverse `x ↦ ⋃_i x_i`. -/\ntheorem sum_prod_blocks {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (g : Fin F.b → Finset X → ℝ) :\n ∑ U ∈ (univ : Finset X).powerset, ∏ i, g i (U" + }, + { + "kind": "theorem", + "unqualified_name": "mu_le_prod_localGood", + "line": 303, + "source_header": "ro hv\n exact ⟨⟨i, hv⟩, hx' i hv⟩\n · intro U _\n rfl\n\n/-- The factorisation `mu_p(D) ≤ prod_i mu_p(D_i)` for `p in [0,1]^X`: termwise domination of\n`1_D(U) w(U)` by the product of block restrictions, then the block-product bijection. -/\ntheorem mu_le_prod_localGood {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ}" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_pos_of_mu_pos", + "line": 318, + "source_header": "Finset.prod_congr rfl fun i _ => ?_\n rw [localGood_eq]\n\n/-- When `mu_p(D) > 0`, every local good probability is positive (a zero factor would zero the\nproduct that dominates `mu_p(D)`). -/\ntheorem localGood_pos_of_mu_pos {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v" + }, + { + "kind": "theorem", + "unqualified_name": "neg_log_prod_localGood", + "line": 329, + "source_header": "p\n rw [Finset.prod_eq_zero (mem_univ i) h0] at this\n linarith\n\n/-- `-log prod_i mu_p(D_i) = sum_i -log mu_p(D_i)` when `mu_p(D) > 0`. -/\ntheorem neg_log_prod_localGood {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (hmu : 0 < mu F p) :\n -R" + }, + { + "kind": "theorem", + "unqualified_name": "neg_log_prod_localGood_le", + "line": 335, + "source_header": "localGood_pos_of_mu_pos F hp hmu i).ne'), Finset.sum_neg_distrib]\n\n/-- `-log prod_i mu_p(D_i) ≤ -log mu_p(D)` when `mu_p(D) > 0`. -/\ntheorem neg_log_prod_localGood_le {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (hmu : 0 <" + }, + { + "kind": "theorem", + "unqualified_name": "localPriceChain", + "line": 343, + "source_header": "g_le_neg (Real.log_le_log hmu (mu_le_prod_localGood F hp))\n\nend Aux\n\n/-! ## Inventory theorems -/\n\n/-- Proves: `UniversalLaw.Spec.P15.LocalPriceChain` (claim `p15-realized-covers`, display (P4)).\nMethod: `Finset.prod_le_prod₀` for `0 ≤ c ≤ p`; the block-local marginal bound\n`Aux.prod_le_localFailure_of_card` at `S = X_i` (the full block has `a_i d_i + 1 ≥ a_i + 1`\ncoordinates and is therefore bad); `q ≤ phi(q)` on `[0,1]` from `1 - q ≤ exp(-q)`.\nDoes not establish: the informal display (P4) or its review and acceptance; the alignment of\n`localFailure` with the source's `q_i` (PENDING_INDEPENDENT_REVIEW); the identification\n`prod p_v = P(U_i = X_i)` as a probabilistic statement; the disposition HOLD_WITH_DOMAIN of\n`p15-realized-covers`, which is transcribed in the register, not derived here. -/\ntheorem localPriceChain {X : Type} [Fintype X] [DecidableE" + }, + { + "kind": "theorem", + "unqualified_name": "independentBlockHazard", + "line": 361, + "source_header": "exact Finset.prod_le_prod₀ (fun v _ => (hc v).1) (fun v _ => (hc v).2)\n\n/-- Proves: `UniversalLaw.Spec.P15.IndependentBlockHazard` (claim `p15-realized-covers`, display\n(P5)).\nMethod: `1 - q_i = mu_p(D_i)`; the factorisation `Aux.mu_le_prod_localGood` (block-product\nbijection on `2^X`, no independence assumption); when `mu_p(D) > 0` every `mu_p(D_i) > 0`, so\n`Real.log_prod` turns `-log prod` into `sum -log`, each `q_i ≤ -log(1 - q_i)` by\n`Aux.neg_log_one_sub_ge`, and `-log prod ≤ -log mu` by monotonicity of `log`.\nDoes not establish: the informal display (P5) or its review and acceptance; any independence of\ncrossing events (none is used); the price bound `sum_i price(G_i) ≤ sum_i q_i` (that is (P4)\nsummed, not part of this `Prop`); the alignment of the formal `mu`, `localFailure` with the\nsource's objects (PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of\n`p15-realized-covers`. -/\ntheorem independentBlockHazard {X : Type} [Fintype X] [DecidableEq X]" + }, + { + "kind": "theorem", + "unqualified_name": "globalAssemblyHazard", + "line": 387, + "source_header": "= Aux.localGood_pos_of_mu_pos F hp hmu i\n unfold localFailure\n linarith\n\n/-- Proves: `UniversalLaw.Spec.P15.GlobalAssemblyHazard` (claim `p15-full-price`, display (F13)).\nMethod: the factorisation `Aux.mu_le_prod_localGood` (every good set has good block\nrestrictions; the weight factors over the blocks; the block-product bijection on `2^X`), then,\nwhen `mu_p(D) > 0`, every `mu_p(D_i) > 0`, `Real.log_prod` and the monotonicity of `log`.\nDoes not establish: the informal display (F13) or its review and acceptance; the local bound\n(F12) or the full-price theorem (F2); any independence of crossing failures (none is used); the\nalignment of the formal `mu`, `localGood` with the source's `mu_p(D)`, `mu_p(D_i)`\n(PENDING_INDEPENDENT_REVIEW); the disposition of `p15-full-price`, which is transcribed in the\nregister, not derived here. -/\ntheorem globalAssemblyHazard {X : Type} [Fintype X] [DecidableEq" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Budget.lean", + "sha256": "6b5c5515345b3a8609fd7198f2da07e94a136dcf662445f1e528c63266671c46", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "famPrice_nonneg", + "line": 35, + "source_header": "x\n\n/-! ### Cover prices and the infimum `coverCost` -/\n\n/-- Family prices are nonnegative for nonnegative prices. -/\ntheorem famPrice_nonneg {Y : Type} {c : Y → ℝ} (hc : ∀ v, 0 ≤ c v) (G : Finset (Finset Y)) :\n 0 ≤ famPric" + }, + { + "kind": "theorem", + "unqualified_name": "coverSet_bddBelow", + "line": 42, + "source_header": "hc v\n\n/-- The set of prices of generator covers is bounded below by `0`. -/\ntheorem coverSet_bddBelow {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (K : ℕ)\n {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) :\n BddBelow {t : ℝ | ∃ G : Finset (Finset X), IsGeneratorCover F K G ∧ famPrice c" + }, + { + "kind": "theorem", + "unqualified_name": "coverCost_le_famPrice", + "line": 50, + "source_header": "eg hc G\n\n/-- The infimum is at most the price of any generator cover. -/\ntheorem coverCost_le_famPrice {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (K : ℕ) {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) {G : Finset (Finset X)}\n (hG : IsGeneratorCover F K G) : coverCost F K c ≤ fam" + }, + { + "kind": "theorem", + "unqualified_name": "isGeneratorCover_singleton_empty", + "line": 56, + "source_header": "hG, rfl⟩\n\n/-- `{∅}` covers every obstruction. -/\ntheorem isGeneratorCover_singleton_empty {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) (K : ℕ) : IsGeneratorCo" + }, + { + "kind": "theorem", + "unqualified_name": "famPrice_singleton_empty", + "line": 61, + "source_header": "y_subset U⟩\n\n/-- The cover `{∅}` has price `1`. -/\ntheorem famPrice_singleton_empty {Y : Type} (c : Y → ℝ) : famPr" + }, + { + "kind": "theorem", + "unqualified_name": "coverCost_le_one", + "line": 65, + "source_header": "ce, genPrice]\n\n/-- `covercost ≤ 1` (the cover `{∅}`). -/\ntheorem coverCost_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (K : ℕ)\n {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) : cove" + }, + { + "kind": "theorem", + "unqualified_name": "coverCost_le_sum_block", + "line": 71, + "source_header": "ton_empty] at h\n\n/-- For `K ≥ K_H(d)` the full blocks cover, so `covercost ≤ sum_i price(X_i)`. -/\ntheorem coverCost_le_sum_block {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) {K : ℕ}\n (hK : paletteNumber F.b F.H F.d ≤ K) :\n coverCost F K c ≤ ∑ i, genPr" + }, + { + "kind": "theorem", + "unqualified_name": "le_cappedHazard_of", + "line": 81, + "source_header": "ice F K hc hcover\n\n/-- A quantity at most `1` and, for `m > 0`, at most `ρ (-log m)` is at most the capped hazard. -/\ntheorem le_cappedHazard_of {ρ m x : ℝ} (hx1 : x ≤ 1) (hx2 : 0 < m → x ≤ ρ * -Real.log m) :\n x" + }, + { + "kind": "theorem", + "unqualified_name": "sum_localFailure_le_neg_log_mu", + "line": 89, + "source_header": "x2 h)\n · exact hx1\n\n/-- `sum_i q_i ≤ -log mu_p(D)` when `mu_p(D) > 0` (display (P5)/(T6), from `P15Hazard`). -/\ntheorem sum_localFailure_le_neg_log_mu {X : Type} [Fintype X] [DecidableEq X]\n {F : RealizedData X} (hF : IsRealizedFamily F) {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1)\n (hmu : 0 < mu F p) : ∑ i, localFailure F p i" + }, + { + "kind": "theorem", + "unqualified_name": "phi_le_div", + "line": 96, + "source_header": "exact h.1.trans h.2\n\n/-! ### The ratio bound of (T3)/(T5) -/\n\n/-- `phi(p) ≤ p/(1-p)` for `0 ≤ p < 1` (display (T2)). -/\ntheorem phi_le_div {p : ℝ} (h0 : 0 ≤ p) (h1 : p <" + }, + { + "kind": "theorem", + "unqualified_name": "genPrice_le_ratio", + "line": 104, + "source_header": "ry.logRatioBound p h0 h1)\n\n/-- The first two steps of (T3): `prod_{X_i} c ≤ prod_{X_i} p/(1-p)`, split along `S ⊆ X_i`. -/\ntheorem genPrice_le_ratio {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p c : X → ℝ} (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) {i : Fin F.b}\n (hp : ∀ v ∈ block F i, 0 ≤ p v ∧ p v < 1) {S : Finset X} (hS : S ⊆ block F i) :\n genPrice c (block F i) ≤\n (∏ v ∈ S, p v) * ((∏ v ∈ block F i \\ S, p v) * ∏" + }, + { + "kind": "theorem", + "unqualified_name": "prod_le_pow_of_le", + "line": 121, + "source_header": "prod_sdiff hS).symm]\n ring\n\n/-- A product of coordinates in `[0, B]` is at most `B^|s|`. -/\ntheorem prod_le_pow_of_le {X : Type} {s : Finset X} {p : X → ℝ} {B : ℝ}\n (hp : ∀ v ∈ s, 0 ≤ p v ∧ p v ≤ B" + }, + { + "kind": "theorem", + "unqualified_name": "prod_inv_le_pow", + "line": 127, + "source_header": ".1) (fun v hv => (hp v hv).2)\n\n/-- A product of `(1 - p_v)⁻¹` with `p_v ≤ B < 1` is at most `((1 - B)⁻¹)^|s|`. -/\ntheorem prod_inv_le_pow {X : Type} {s : Finset X} {p : X → ℝ} {B : ℝ} (hB : B < 1)\n (hp : ∀ v ∈ s, p v ≤ B) : ∏ v ∈ s, (1" + }, + { + "kind": "theorem", + "unqualified_name": "genPrice_le_prod_mul_ratio", + "line": 135, + "source_header": "narith) (by linarith [hp v hv])\n\n/-- The ratio bound: for `0 ≤ c ≤ phi(p)`, `0 ≤ p ≤ B < 1` on the block and `S ⊆ X_i`,\n`price(X_i) ≤ (prod_{S} p) * B^(n - |S|) * (1 - B)^(-n)`. -/\ntheorem genPrice_le_prod_mul_ratio {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p c : X → ℝ} (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) {i : Fin F.b} {B : ℝ} (hB0 : 0 ≤ B)\n (hB : B < 1) (hp : ∀ v ∈ block F i, 0 ≤ p v ∧ p v ≤ B) {S : Finset X}\n (hS : S ⊆ block F i) :\n genPrice c (block F i) ≤\n (∏ v ∈ S, p v) * (B ^ ((block F i).card - S.card)" + }, + { + "kind": "theorem", + "unqualified_name": "quarter_pow_identity", + "line": 153, + "source_header": "v hv).2]))\n (pow_nonneg hB0 _)\n\n/-- The exponent identity behind (T3): `(1/4)^m (4/3)^(m+k) = 4^k / 3^(m+k)`. -/\ntheorem quarter_pow_identity (m k : ℕ) :\n (1 / 4 : ℝ) ^ m * (4 /" + }, + { + "kind": "theorem", + "unqualified_name": "quarter_ratio_le", + "line": 159, + "source_header": "pow, one_pow, pow_add]\n field_simp\n\n/-- Display (T3) in the form used here: for `a ≥ 1`, `n ≥ 2a + 1`,\n`(1/4)^(n-a-1) (3/4)^(-n) ≤ 16/27`. -/\ntheorem quarter_ratio_le {a n : ℕ} (ha : 1 ≤ a) (hn : 2 * a + 1 ≤ n) :\n (1 / 4 : ℝ) ^ (n - (a" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_congr", + "line": 168, + "source_header": "(a + 1)) ha hn\n exact h.1.trans h.2\n\n/-! ### Block-local hypotheses -/\n\n/-- `localGood` depends on `p` only through its values on the block. -/\ntheorem localGood_congr {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p p' : X → ℝ} {i : Fin F.b} (h : ∀ v ∈ block F i, p v = p' v)" + }, + { + "kind": "theorem", + "unqualified_name": "localFailure_congr", + "line": 184, + "source_header": "otMem hmem, Set.indicator_of_notMem hmem]\n\n/-- `localFailure` depends on `p` only through its values on the block. -/\ntheorem localFailure_congr {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p p' : X → ℝ} {i : Fin F.b} (h : ∀ v ∈ block F i, p v = p' v) :" + }, + { + "kind": "theorem", + "unqualified_name": "prod_le_localFailure_of_card_local", + "line": 191, + "source_header": "old localFailure\n rw [localGood_congr F h]\n\n/-- The marginal bound `prod_{v in S} p_v ≤ q_i` of `P15Hazard` under block-local hypotheses\nonly (`p` is replaced by its restriction to the block, zero elsewhere). -/\ntheorem prod_le_localFailure_of_card_local {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) {p : X → ℝ} {i : Fin F.b} (hp : ∀ v ∈ block F i, 0 ≤ p v ∧ p v ≤ 1)\n {S : Finset X} (hS : S ⊆ block F i) (hcard : F.a i + 1 ≤ S." + }, + { + "kind": "theorem", + "unqualified_name": "genPrice_le_budget", + "line": 208, + "source_header": "x.prod_le_localFailure_of_card F hp' hS hcard\n\n/-! ### The local budget (T4) -/\n\n/-- Display (T4), first inequality: for `a_i ≥ 1`, `d_i ≥ 2`, `0 ≤ p ≤ 1/4` and\n`0 ≤ c ≤ phi(p)`, `price(X_i) ≤ (16/27) q_i`. -/\ntheorem genPrice_le_budget {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) (hd : ∀ i, 2 ≤ F.d i) {p c : X → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1 / 4) (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) (i : Fin F.b) :\n genPri" + }, + { + "kind": "theorem", + "unqualified_name": "sum_genPrice_le_budget", + "line": 238, + "source_header": ":= mul_le_mul_of_nonneg_left hprodS (by norm_num)\n\n/-- The summed budget: `sum_i price(X_i) ≤ (16/27) (-log mu_p(D))` when `mu_p(D) > 0`. -/\ntheorem sum_genPrice_le_budget {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) (hd : ∀ i, 2 ≤ F.d i) {p c : X → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1 / 4) (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v))\n (hmu : 0 < mu F p) :\n ∑ i, genP" + }, + { + "kind": "theorem", + "unqualified_name": "weight_nonneg", + "line": 252, + "source_header": "ocalFailure_le_neg_log_mu hF hp1 hmu) (by norm_num)\n\n/-! ### Positivity of `mu_p(D)` -/\n\n/-- The weight is nonnegative for `p in [0,1]^X`. -/\ntheorem weight_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}\n (hp :" + }, + { + "kind": "theorem", + "unqualified_name": "isGood_empty", + "line": 261, + "source_header": "Finset.prod_nonneg fun v _ => ?_)\n linarith [(hp v).2]\n\n/-- The empty set is good when every edge of `H` has at least two elements. -/\ntheorem isGood_empty {X : Type} [Fintype X] [DecidableEq X] {F : Real" + }, + { + "kind": "theorem", + "unqualified_name": "mu_pos", + "line": 270, + "source_header": "have h2 := hH e he\n rw [h0, card_empty] at h2\n omega\n\n/-- `mu_p(D) > 0` for `0 ≤ p < 1` coordinatewise: the empty set is good and has positive weight. -/\ntheorem mu_pos {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamil" + }, + { + "kind": "theorem", + "unqualified_name": "log_benchmark_le", + "line": 283, + "source_header": "]\n exact Finset.prod_pos fun v _ => by linarith [(hp v).2]\n\n/-! ### The six-block benchmark at `p = 1/40900` -/\n\n/-- `log(40900/40899) ≤ 1/40899`. -/" + }, + { + "kind": "theorem", + "unqualified_name": "phi_benchmark", + "line": 290, + "source_header": "b_one_of_pos (by norm_num : (0 : ℝ) < 40900 / 40899)\n linarith\n\n/-- `phi(1/40900) = log(40900/40899)`. -/\nt" + }, + { + "kind": "theorem", + "unqualified_name": "genPrice_benchmark_le", + "line": 298, + "source_header": "_neg]\n exact min_eq_right (log_benchmark_le.trans (by norm_num))\n\n/-- Each full-block price at `c ≤ log(40900/40899)` is at most `1/40899`. -/\ntheorem genPrice_benchmark_le {c : Fin 6 × Fin 409 → ℝ}\n (hc : ∀ v, 0 ≤ c v ∧ c v ≤ Real.log (40900 / 40899)) (i : Fin" + }, + { + "kind": "theorem", + "unqualified_name": "famPrice_benchmark_le_one", + "line": 308, + "source_header": "40899 := pow_le_of_le_one (by norm_num) (by norm_num) (by norm_num)\n\n/-- The full-block price at `c ≤ log(40900/40899)` is at most `6/40899 ≤ 1`. -/\ntheorem famPrice_benchmark_le_one {c : Fin 6 × Fin 409 → ℝ}\n (hc : ∀ v, 0 ≤ c v ∧ c v ≤ Real.log" + }, + { + "kind": "theorem", + "unqualified_name": "coverCostHazardBound", + "line": 325, + "source_header": "rw [nsmul_eq_mul]\n norm_num\n _ ≤ 1 := by norm_num\n\nend Aux\n\n/-! ## Inventory theorems -/\n\n/-- Proves: `UniversalLaw.Spec.P15.CoverCostHazardBound` (claim `p15-realized-covers`, display\n(P8)).\nMethod: the set of cover prices is bounded below by `0`; the cover `{∅}` has price `1`, so\n`covercost ≤ 1` (`csInf_le`); for `K ≥ K_H(d)` the full blocks cover (`fullBlockCoverIff`), so\n`covercost ≤ sum_i price(X_i) ≤ sum_i q_i` (display (P4), `P15Hazard.localPriceChain`) and, when\n`mu_p(D) > 0`, `sum_i q_i ≤ -log mu_p(D)` (display (P5), `P15Hazard.independentBlockHazard`).\nDoes not establish: the informal display (P8) or its review and acceptance; anything for prices\n`c_v > p_v`; attainment of the infimum; the alignment of `coverCost`, `mu`, `localFailure` with\nthe source's objects (PENDING_INDEPENDENT_REVIEW); the unrestricted P15 prize or original P15-B;\nthe disposition HOLD_WITH_DOMAIN of `p15-realized-covers`, which is transcribed in the register,\nnot derived here. -/\ntheorem coverCostHazardBound {X : Type} [Fintype X] [DecidableEq X" + }, + { + "kind": "theorem", + "unqualified_name": "restrictedLocalBudget", + "line": 351, + "source_header": "_ ≤ -Real.log (mu F p) := Aux.sum_localFailure_le_neg_log_mu hF hp hmu\n\n/-- Proves: `UniversalLaw.Spec.P15.RestrictedLocalBudget` (claim `p15-price-budget-restricted`,\ndisplay (T4)).\nMethod: `phi(p) ≤ -log(1-p) ≤ p/(1-p)` (display (T2), `P15Elementary.logRatioBound`); a subset\n`S ⊆ X_i` with `|S| = a_i + 1` exists since `|X_i| = a_i d_i + 1`; `prod_{X_i} c ≤ prod_{X_i}\np/(1-p) ≤ (prod_S p) (1/4)^(n-a-1) (4/3)^n = (prod_S p) 4^(a+1)/3^n ≤ (16/27) prod_S p`\n(display (T3), `P15Elementary.ratioExponentBound` with `n ≥ 2a + 1` from `d_i ≥ 2`); `prod_S p ≤\nq_i` (block-local marginal bound of `P15Hazard`); `(16/27) q ≤ q ≤ phi(q)` on `[0, 1]`.\nDoes not establish: the informal display (T4) or its review and acceptance; sharpness of the\nrange `p_v ≤ 1/4` (the source: \"a sufficient range, not an asserted sharp threshold\"); anything\nat `d_i = 1` (the source's refutation stands); the alignment of `localFailure`, `phi` with the\nsource's objects (PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of\n`p15-price-budget-restricted`, which is transcribed in the register, not derived here. -/\ntheorem restrictedLocalBudget {X : Type} [Fintype X] [DecidableEq" + }, + { + "kind": "theorem", + "unqualified_name": "rhoTestSufficient", + "line": 375, + "source_header": "one_mul _\n _ ≤ phi (localFailure F p i) := P15Hazard.Aux.le_phi_self hq1\n\n/-- Proves: `UniversalLaw.Spec.P15.RhoTestSufficient` (claim `p15-price-budget-restricted`,\ndisplay (T5)).\nMethod: the same ratio argument as (T3) with the common bound `p_*`: for `S ⊆ X_i` with\n`|S| = a_i + 1`, `prod_{X_i} c ≤ prod_{X_i} p/(1-p) ≤ (prod_S p) p_*^(n-a-1) (1-p_*)^(-n) =\n(prod_S p) rho(a_i, d_i, p_*) ≤ prod_S p` since `n = a_i d_i + 1`, and `prod_S p ≤ q_i` by the\nblock-local marginal bound (`p` restricted to the block, as only the block's coordinates enter\n`q_i`).\nDoes not establish: the informal display (T5) or its review and acceptance; anything when\n`rho > 1` (the source: \"rho>1 is not a counterexample and must not be labeled infeasible\"); the\nalignment of `localFailure`, `phi`, `rhoTest` with the source's objects\n(PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of `p15-price-budget-restricted`,\nwhich is transcribed in the register, not derived here. -/\ntheorem rhoTestSufficient {X : Type} [Fintype X] [Decida" + }, + { + "kind": "theorem", + "unqualified_name": "restrictedTransformedPriceBudget", + "line": 413, + "source_header": "prodS0\n _ = ∏ v ∈ S, p v := mul_one _\n _ ≤ localFailure F p i := hprodS\n\n/-- Proves: `UniversalLaw.Spec.P15.RestrictedTransformedPriceBudget` (claim\n`p15-price-budget-restricted`, display (T1)).\nMethod: `covercost ≤ 1` by the cover `{∅}`; for `K ≥ K_H(d)` the full blocks cover\n(`fullBlockCoverIff`), so `covercost ≤ sum_i price(X_i) ≤ (16/27) sum_i q_i` (display (T4), the\nlocal budget of this module) and, when `mu_p(D) > 0`, `sum_i q_i ≤ -log mu_p(D)` (display (T6),\n`P15Hazard.independentBlockHazard`); the capped hazard handles `mu_p(D) = 0` by its convention.\nDoes not establish: the informal display (T1) or its review and acceptance; any retraction of the\ndemand-one refutation; the unrestricted prize; new classical coloring theory; attainment of the\ninfimum; the alignment of `coverCost`, `mu`, `phi` with the source's objects\n(PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of `p15-price-budget-restricted`,\nwhich is transcribed in the register, not derived here. -/\ntheorem restrictedTransformedPriceBudget {X : Type} [Fintype X] [DecidableEq X]" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816TransformedRange", + "line": 431, + "source_header": "Cost_le_sum_block hF hc0 hK).trans (Aux.sum_genPrice_le_budget hF hd hp hc hmu)\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816TransformedRange` (claim\n`p15-price-budget-restricted`, Section 4 of price_budget PROOF.md).\nMethod: `1 - 1/40900 = (40900/40899)⁻¹`, `Real.log_inv` and `log(40900/40899) ≤ 1/40899 ≤ 1`\nfor the value of `phi`; the cover from `fullBlockCoverIff` and `K_H(408, ..., 408) = 816`\n(`P15Structure.benchmark816Palette`); the price bound from six block prices `≤ (1/40899)^409 ≤\n1/40899` and from the summed local budget (T4) at `p_v = 1/40900 ≤ 1/4`, `d_i = 408 ≥ 2`, with\n`mu_p(D) > 0` because the empty set is good with positive weight; the `covercost` bound is\n`RestrictedTransformedPriceBudget` at these data.\nDoes not establish: the informal Section 4 or its review and acceptance; optimality of the\n816-label cover; the whole-ground value `818` (a separate `Prop`); the alignment of the formal\nobjects with the source's (PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of\n`p15-price-budget-restricted`, which is transcribed in the register, not derived here. -/\ntheorem" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/RNProbability.lean", + "sha256": "3bdc6055c8fe9419addc3ad7bf77c5a88efe387470d9c7201331343859808636", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "mul_indicator_one_eq", + "line": 31, + "source_header": "x\n\n/-- `N · 1_E = 1_E · N` pointwise. -/\ntheorem mul_indicator_one_eq {Ω : Type} (Ev : Set Ω) (N : Ω → ℕ) (ω : Ω) :\n (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω = Ev.indicator (fun ω => (N ω : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "conditionalMeanIdentityN3", + "line": 40, + "source_header": "Aux\n\n/-- Proves: `UniversalLaw.Spec.RN.ConditionalMeanIdentityN3` (register claims\n`rn-count-interface`, `math.rn-count-interface`).\nMethod: unfold `ProbabilityTheory.cond = (P E)⁻¹ • P.restrict E`, `integral_smul_measure`,\n`integral_indicator`, cancel `P(E) · P(E)⁻¹`.\nDoes not establish: the informal Theorem N, the bounded-conditional-mean equivalence, the lower\ncomparison `q ≥ c r^3`, anything about the Gaussian model, review or acceptance. -/\ntheorem conditionalMeanIdentityN3 : ConditionalMeanIdent" + }, + { + "kind": "theorem", + "unqualified_name": "holderCountBoundN1", + "line": 52, + "source_header": "_mul]\n\n/-- Proves: `UniversalLaw.Spec.RN.HolderCountBoundN1` (register claims `rn-count-interface`,\n`math.rn-count-interface`).\nMethod: Mathlib's Hölder inequality `integral_mul_le_Lp_mul_Lq_of_nonneg` with the conjugate\nexponent `q = p/(p-1)`, `MemLp` of `N` recovered from the integrability of `N^p`, and\n`∫ 1_E^q = P(E)`.\nDoes not establish: the informal Theorem N, that any Gaussian count satisfies the moment\nhypothesis, any rate in `r`, review or acceptance. -/\ntheorem holderCountBoundN1 : HolderCount" + }, + { + "kind": "theorem", + "unqualified_name": "holderConsequenceN2", + "line": 98, + "source_header": "act key\n\n/-- Proves: `UniversalLaw.Spec.RN.HolderConsequenceN2` (register claims `rn-count-interface`,\n`math.rn-count-interface`).\nMethod: `holderCountBoundN1`, then monotonicity of `x ↦ x^(1/p)` and `x ↦ x^(1-1/p)` on\n`[0, ∞)` and the rpow algebra `(A r^(-β))^(1/p) (C r^3)^(1-1/p) = A^(1/p) C^(1-1/p)\nr^((3(p-1)-β)/p)`.\nDoes not establish: the informal Theorem N, that the exponent can be rounded up to `3`, that\nany Gaussian count satisfies the hypotheses, review or acceptance. -/\ntheorem holderConsequenceN2 : HolderCons" + }, + { + "kind": "theorem", + "unqualified_name": "uniformLaw_Iic", + "line": 137, + "source_header": "space Aux\n\n/-- The uniform law of `Iic a` for `0 ≤ a ≤ 1` is `a`. -/\ntheorem uniformLaw_Iic {a : ℝ} (ha0 : 0 ≤ a) (ha1 : a ≤ 1) :\n (uniformLaw (Set.Iic a))" + }, + { + "kind": "theorem", + "unqualified_name": "integral_counterCount", + "line": 149, + "source_header": "ofReal ha0]\n\n/-- `∫ N_r dU = ceil(log(1/r)) · U(E_r)`. -/\ntheorem integral_counterCount (r : ℝ) :\n ∫ u, counterCount r u ∂uniformLaw =\n (⌈Real.log (1 / r)⌉₊ : ℝ) * (uniformLaw (Set.Iic (r" + }, + { + "kind": "theorem", + "unqualified_name": "integral_counterCount_rpow", + "line": 157, + "source_header": "mul, mul_one]\n\n/-- `∫ N_r^p dU = ceil(log(1/r))^p · U(E_r)` for `p ≠ 0`. -/\ntheorem integral_counterCount_rpow (r : ℝ) {p : ℝ} (hp : p ≠ 0) :\n ∫ u, counterCount r u ^ p ∂uniformLaw =\n (⌈Real.log (1 / r)⌉₊ : ℝ) ^ p * (uniformLaw (Set.Iic (" + }, + { + "kind": "theorem", + "unqualified_name": "n4_fixed", + "line": 170, + "source_header": "_mul, mul_comm]\n\n/-- The two displays of (N4) for a fixed `0 < r ≤ e^(-1)`. -/\ntheorem n4_fixed (r : ℝ) (hr : 0 < r) (hre : r ≤ Real.exp (-1)) :\n (uniformLaw (Set.Iic (r ^ 3))).toReal = r ^ 3 ∧\n (∫ u, counterCount r u ∂uniformLaw) / r ^ 3 = (⌈Real.l" + }, + { + "kind": "theorem", + "unqualified_name": "one_le_log_one_div", + "line": 181, + "source_header": "hr3.ne', mul_one]\n\n/-- `log (1/r) ≥ 1` for `0 < r ≤ e^(-1)`. -/\ntheorem one_le_log_one_div {r : ℝ} (hr : 0 < r) (hre : r ≤ Real.exp (-1)) :\n 1" + }, + { + "kind": "theorem", + "unqualified_name": "pow_three_eq_exp", + "line": 188, + "source_header": "xp_neg]\n exact hre\n\n/-- `r^3 = exp(-3 log(1/r))` for `r > 0`. -/\ntheorem pow_three_eq_exp {r : ℝ} (hr : 0 < r) :\n r ^ 3 = Real.exp (-(3" + }, + { + "kind": "theorem", + "unqualified_name": "integral_exp_neg_div_Ioi_zero", + "line": 199, + "source_header": "1\n push_cast\n ring\n\n/-- `∫_0^∞ exp(-s/B) ds = B` for `B > 0`. -/\ntheorem integral_exp_neg_div_Ioi_zero {B : ℝ} (hB : 0 < B) :\n ∫ s in Set.Ioi (0 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "uniformCounterexampleN4", + "line": 211, + "source_header": "fun]\n exact h\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.RN.UniformCounterexampleN4` (register claims\n`rn-count-interface`, `math.rn-count-interface`).\nMethod: `U(E_r) = r^3` from `volume.restrict` on `Icc 0 1`; `∫ N_r dU = ceil(log(1/r)) r^3`\nby `integral_indicator_const`; the limit from `log ∘ inv → ∞` on `𝓝[>] 0` and\n`x ≤ ⌈x⌉₊`; the moment bound with the explicit constant `A_p = 2^n n!`, `n = ⌈p⌉₊`, via\n`⌈t⌉₊^p ≤ (2t)^n` for `t = log(1/r) ≥ 1` and `t^n ≤ n! e^t`.\nDoes not establish: the source's sharper bound `sup_(t>=1) e^(-3t)(t+1)^p`, the one-`p`\nsharpness construction, anything about the Gaussian field, the informal Theorem N, review or\nacceptance. -/\ntheorem uniformCounterexampleN4" + }, + { + "kind": "theorem", + "unqualified_name": "exponentialTailLayerCakeN5", + "line": 270, + "source_header": "ght (by positivity) hexp2\n\n/-- Proves: `UniversalLaw.Spec.RN.ExponentialTailLayerCakeN5` (register claims\n`rn-count-interface`, `math.rn-count-interface`).\nMethod: with `t₀ = B log(A/q) ≥ 0`, the pointwise bound `N 1_E ≤ t₀ 1_E + (N - t₀)⁺`; the\nlayer-cake formula `Integrable.integral_eq_integral_meas_lt` for `(N - t₀)⁺`; the tail\nhypothesis at `t = s + t₀`; and `∫_0^∞ A e^(-(s+t₀)/B) ds = A B e^(-t₀/B) = B q`\n(`integral_comp_mul_left_Ioi`, `integral_exp_neg_Ioi_zero`).\nDoes not establish: the source's intermediate identity `∫_0^∞ min(q, A e^(-t/B)) dt`, that\nthe logarithmic loss is attained, anything about the Gaussian model, the informal Theorem N,\nreview or acceptance. -/\ntheorem exponentialTailLayerCakeN5 :" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Elementary.lean", + "sha256": "d4d87bba1da9473cd3c5bda9c702ba4dd036de06085d5ad589f17988bf8695b1", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "two_lt_exp_one", + "line": 39, + "source_header": "x\n\n/-! ### Real-analytic constants -/\n\n/-- `2 < e` from Mathlib's decimal bound. -/\ntheorem two_lt_exp_one : (2 : ℝ) < Real." + }, + { + "kind": "theorem", + "unqualified_name": "three_exp_sub_two_pos", + "line": 45, + "source_header": "arith\n\n/-- `3e - 2 > 0`. -/\ntheorem three_exp_sub_two_pos : (0 : ℝ) < 3 * Real.ex" + }, + { + "kind": "theorem", + "unqualified_name": "exp_two_eq", + "line": 49, + "source_header": "inarith\n\n/-- `exp 2 = (exp 1)^2`. -/\ntheorem exp_two_eq : Real.exp 2 = Real." + }, + { + "kind": "theorem", + "unqualified_name": "exp_neg_two_eq", + "line": 53, + "source_header": "norm_num\n\n/-- `exp (-2) = (exp (-1))^2`. -/\ntheorem exp_neg_two_eq : Real.exp (-2) = Real.e" + }, + { + "kind": "theorem", + "unqualified_name": "exp_neg_three_eq", + "line": 57, + "source_header": "]; norm_num\n\n/-- `exp (-3) = (exp (-1))^3`. -/\ntheorem exp_neg_three_eq : Real.exp (-3) = Real" + }, + { + "kind": "theorem", + "unqualified_name": "log_three_exp_sub_two_lt_two", + "line": 61, + "source_header": "ul]; norm_num\n\n/-- `log(3e - 2) < 2`, from `3e - 2 < e^2`, i.e. `(e-1)(e-2) > 0`. -/\ntheorem log_three_exp_sub_two_lt_two : Real.log (3 * Real" + }, + { + "kind": "theorem", + "unqualified_name": "one_lt_hStar", + "line": 67, + "source_header": "one\n nlinarith\n\n/-- `1 < h_star`. -/\ntheorem one_lt_" + }, + { + "kind": "theorem", + "unqualified_name": "taylor_sum_eq", + "line": 71, + "source_header": "_lt_two; linarith\n\n/-- The Taylor sum of the Section 6 certificate, evaluated exactly. -/\ntheorem taylor_sum_eq :\n (∑ j ∈ Finset.range 6, (11 / 6 : ℝ) ^ j / (Nat.factorial j : ℝ)) =\n 197 /" + }, + { + "kind": "theorem", + "unqualified_name": "exp_eleven_sixths_gt", + "line": 78, + "source_header": "ctorial]\n norm_num\n\n/-- `197/32 < exp(11/6)` by the degree-5 Taylor lower bound. -/\ntheorem exp_eleven_sixths_gt : (197 / 32 : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "three_exp_sub_two_lt", + "line": 84, + "source_header": "m_eq] at h\n linarith\n\n/-- `3e - 2 < 197/32` from `e < 2.7182818286`. -/\ntheorem three_exp_sub_two_lt : 3 * Real.exp" + }, + { + "kind": "theorem", + "unqualified_name": "log_three_exp_sub_two_lt", + "line": 88, + "source_header": "exp_one_lt_d9; linarith\n\n/-- `log(3e - 2) < 11/6`. -/\ntheorem log_three_exp_sub_two_lt : Real.log (3 *" + }, + { + "kind": "theorem", + "unqualified_name": "seven_sixths_lt_hStar", + "line": 93, + "source_header": "o_lt exp_eleven_sixths_gt\n\n/-- `7/6 < h_star`. -/\ntheorem seven_sixths_lt_" + }, + { + "kind": "theorem", + "unqualified_name": "rhoStar_lt_six_sevenths", + "line": 97, + "source_header": "ee_exp_sub_two_lt; linarith\n\n/-- `rho_star < 6/7`. -/\ntheorem rhoStar_lt_s" + }, + { + "kind": "theorem", + "unqualified_name": "pStar_pos", + "line": 104, + "source_header": "ff₀ (by linarith)]\n linarith\n\n/-- `0 < p_star`. -" + }, + { + "kind": "theorem", + "unqualified_name": "pStar_gt_half", + "line": 108, + "source_header": "l.exp_neg_one_lt_half; linarith\n\n/-- `1/2 < p_star`. -/\ntheo" + }, + { + "kind": "theorem", + "unqualified_name": "pStar_lt_one", + "line": 112, + "source_header": "eal.exp_neg_one_lt_half; linarith\n\n/-- `p_star < 1`." + }, + { + "kind": "theorem", + "unqualified_name": "sum_weight_eq_one", + "line": 116, + "source_header": "have := Real.exp_pos (-1); linarith\n\n/-! ### Product weights -/\n\n/-- The weights of all subsets sum to one (`Finset.prod_add` with `f = p`, `g = 1 - p`). -/\ntheorem sum_weight_eq_one {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) :\n ∑ U ∈ (Finset.un" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_succ_left", + "line": 127, + "source_header": "hl] at h\n unfold weight\n exact h.symm\n\n/-! ### Binomial lower tails -/\n\n/-- One more trial: `P(Bin(n+1,p) ≤ k) = P(Bin(n,p) ≤ k) - C(n,k) p^(k+1) (1-p)^(n-k)` for\n`k ≤ n` (Pascal's rule, induction on `k`). -/\ntheorem binomTail_succ_left (n k : ℕ) (p : ℝ) (hk : k ≤ n) :\n binomTail (n + 1) k p =\n binomTail n k p - (Nat.choose" + }, + { + "kind": "theorem", + "unqualified_name": "muOf_capacityFamily", + "line": 153, + "source_header": "w [h1, h2, pow_succ]\n push_cast\n ring\n\n/-- (F9) as an identity: the product measure of the capacity family at a constant vector is the\nbinomial lower tail (stated for `a ≤ n`). -/\ntheorem muOf_capacityFamily (n a : ℕ) (han : a ≤ n) (c : ℝ) :\n muOf (capac" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_antitone_step", + "line": 171, + "source_header": "act Finset.sum_congr rfl (fun j _ => by ring)\n\n/-- The lower tail decreases when one trial is added (`a ≤ n`, `0 ≤ c ≤ 1`). -/\ntheorem binomTail_antitone_step (n a : ℕ) (han : a ≤ n) (c : ℝ) (h0 : 0 ≤ c) (h1 : c ≤ 1" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_le_of_le", + "line": 179, + "source_header": "h0 _)) (pow_nonneg (by linarith) _)\n linarith\n\n/-- Monotonicity in the number of trials: `binomTail n a c ≤ binomTail m a c` for `a ≤ m ≤ n`. -/\ntheorem binomTail_le_of_le (a m n : ℕ) (hm : a ≤ m) (hmn : m ≤ n) (c : ℝ) (h0 : 0 ≤ c)" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_pos", + "line": 186, + "source_header": "il_antitone_step k a (le_trans hm hk) c h0 h1) ih\n\n/-- The lower tail is positive for `0 ≤ c < 1` (the `j = 0` term is `(1-c)^n > 0`). -/\ntheorem binomTail_pos (n a : ℕ) (c :" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_three_one", + "line": 199, + "source_header": "neg h0 _)) (pow_nonneg (by linarith) _))\n linarith\n\n/-- `P(Bin(3, p_star) ≤ 1) = 3e^{-2} - 2e^{-3}`. -/\ntheorem binomTail_three_one : binomT" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_block", + "line": 212, + "source_header": "size `cap + 1` -/\n\nsection OneBlock\n\nvariable (cap : ℕ)\n\n/-- The single block is the whole ground set. -/\ntheorem oneBlock_block" + }, + { + "kind": "theorem", + "unqualified_name": "card_le_of_ne_univ", + "line": 218, + "source_header": "lock\n rw [Fin.fin_one_eq_zero i]\n simp [demandOneBlock]\n\n/-- A proper subset of a `(cap+1)`-set has at most `cap` elements. -/\ntheorem card_le_of_ne_univ (U : Finse" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_isGood", + "line": 227, + "source_header": "f_eq_univ U).mp e)\n rw [Fintype.card_fin] at h1 h2\n omega\n\n/-- Goodness is the capacity constraint. -/\ntheorem oneBlock_isGood (U : Finset (Fin (" + }, + { + "kind": "theorem", + "unqualified_name": "decomp_one", + "line": 234, + "source_header": "demandOneBlock cap) U) ↔ U.card ≤ cap\n simp [oneBlock_block]\n\n/-- One-piece decomposability is goodness (for any family). -/\ntheorem decomp_one {X : Type} [Fintype X] [DecidableEq X] (F : Realized" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_obstruction", + "line": 246, + "source_header": "j j' hjj' => absurd (Subsingleton.elim j j') hjj', ?_⟩\n simp\n\n/-- At `K = 1` the sole obstruction is the full block. -/\ntheorem oneBlock_obstruction (U : Finset (Fin (cap + 1)" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_isRealized", + "line": 260, + "source_header": "· rintro rfl\n rw [Finset.card_univ, Fintype.card_fin]; omega\n\n/-- The side conditions hold for `cap ≥ 1`. -/\ntheorem oneBlock_" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_mu", + "line": 273, + "source_header": ", ∀ f ∈ (∅ : Finset (Finset (Fin 1))),\n e ⊆ f → e = f\n simp\n\n/-- `mu_p(D) = 1 - prod_v p_v`: every set but the full block is good. -/\ntheorem oneBlock_mu (" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_coverCost_ge_one", + "line": 301, + "source_header": "weight p Finset.univ = ∏ v, p v := by unfold weight; simp\n linarith\n\n/-- At unit prices every cover of `{X}` costs at least one. -/\ntheorem oneBlock_coverCo" + }, + { + "kind": "theorem", + "unqualified_name": "twoCoord_eq", + "line": 322, + "source_header": "Finset.single_le_sum (fun g _ => by simp [genPrice]) hg\n\nend OneBlock\n\n/-- The two-coordinate record of the price boundary is the `cap =" + }, + { + "kind": "theorem", + "unqualified_name": "triangle_feasible3", + "line": 325, + "source_header": "nd-one block. -/\ntheorem twoCoord_eq : twoCoord = demandOneBlock 1 := rfl\n\n/-! ### The triangle palette instance -/\n\n/-- Three singletons are a feasible palette of size three for the triangle. -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "triangle_not_feasible0", + "line": 332, + "source_header": ") (fun _ => 1) 3 := by\n refine ⟨fun i => {i}, fun i => by simp, ?_⟩\n decide\n\n/-- No palette of size zero. -/\ntheorem tria" + }, + { + "kind": "theorem", + "unqualified_name": "triangle_not_feasible1", + "line": 340, + "source_header": "ype.card (Fin 0) := Finset.card_le_univ _\n rw [Fintype.card_fin] at h0\n omega\n\n/-- No palette of size one (finite check). -/\ntheorem tr" + }, + { + "kind": "theorem", + "unqualified_name": "triangle_not_feasible2", + "line": 345, + "source_header": "3 (completeClutter 3 1) (fun _ => 1) 1 := by\n unfold IsPaletteFeasible\n decide\n\n/-- No palette of size two (finite check over the `4^3` label-set assignments). -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "twoCoordGeneratorPrices", + "line": 352, + "source_header": "pleteClutter 3 1) (fun _ => 1) 2 := by\n unfold IsPaletteFeasible\n decide\n\nend Aux\n\n/-! ## Price boundary (demand one) -/\n\n/-- Proves: `UniversalLaw.Spec.P15.TwoCoordGeneratorPrices` (register rows `p15-price-boundary`,\n`math.p15-price-boundary`).\nMethod: unfold `genPrice`/`twoCoordC`, evaluate the four finite products with `simp`/`norm_num`.\nDoes not establish: the demand-one refutation itself (`DemandOneRefutation`), any review or\nacceptance of P15-PRICE-BOUNDARY-20260924-v1; the disposition EXACT_COUNTEREXAMPLE is\ntranscribed in the register, not derived h" + }, + { + "kind": "theorem", + "unqualified_name": "logOnePlusBelowIdentity", + "line": 369, + "source_header": "mp [genPrice, twoCoordC]\n · simp [genPrice, twoCoordC, Finset.prod_const]\n norm_num\n\n/-- Proves: `UniversalLaw.Spec.P15.LogOnePlusBelowIdentity` (register row `p15-price-boundary`).\nMethod: `Real.log_lt_sub_one_of_pos` at `1 + x`.\nDoes not establish: anything about the refutation beyond this elementary inequ" + }, + { + "kind": "theorem", + "unqualified_name": "demandOneRefutation", + "line": 378, + "source_header": "s (by linarith : (0 : ℝ) < 1 + x)\n (by intro h; linarith : (1 : ℝ) + x ≠ 1)\n linarith\n\n/-- Proves: `UniversalLaw.Spec.P15.DemandOneRefutation` (register rows `p15-price-boundary`,\n`math.p15-price-boundary`).\nMethod: `twoCoord` is definitionally the `cap = 1` demand-one block, so the one-block lemmas\ngive the side conditions, the obstruction `{X}` and `mu_p(D) = 1 - (1/2)^2 = 3/4`; `K_H(d) = 1`\nby `Nat.sInf_le`/`le_csInf` (no palette of size `0`); admissibility and `phi(1/2) = log 2` from\n`Real.log_two_gt_d9`/`Real.log_two_lt_d9`; every cover contains a generator `g ⊆ X`, whose price\n`(2/3)^|g| ≥ 4/9`, and `{X}` attains `4/9` (`IsLeast.csInf_eq`); `log(4/3) < 1/3` from\n`Real.log_lt_sub_one_of_pos`.\nDoes not establish: that the refutation contradicts original P15-B (\"It does not contradict the\noriginal P15-B amalgamation\"), anything at the `408` scale or about the unrestricted prize, the\nsource's integral representation of `log 2`, nonauthor review or acceptance; the disposition\nEXACT_COUNTEREXAMPLE is transcrib" + }, + { + "kind": "theorem", + "unqualified_name": "logRatioBound", + "line": 467, + "source_header": "ro v\n show (2 / 3 : ℝ) ≤ phi (1 / 2)\n rw [hphi]; linarith\n · rw [hch, hcc]; linarith\n\n/-! ## Restricted price budget: elementary displays -/\n\n/-- Proves: `UniversalLaw.Spec.P15.LogRatioBound` (register row `p15-price-budget-restricted`).\nMethod: `Real.log_le_sub_one_of_pos` at `(1 - p)⁻¹` and `Real.log_inv`.\nDoes not establish: display (T1) or the restricted budget; the source's integral representation\no" + }, + { + "kind": "theorem", + "unqualified_name": "capTestAtTwoThirds", + "line": 483, + "source_header": "l.log_inv] at h\n have e : (1 - p)⁻¹ - 1 = p / (1 - p) := by\n field_simp\n ring\n linarith\n\n/-- Proves: `UniversalLaw.Spec.P15.CapTestAtTwoThirds` (register row `p15-price-budget-restricted`).\nMethod: `log 3 > 1` from `exp 1 < 3` (Mathlib's `Real.exp_one_lt_d9`); for `2/3 ≤ q < 1`,\n`-log(1-q) ≥ log 3 > 1` so the `min` is `1`; at `q = 1` the definition of `phi` gives `1`.\nDoes not establish: the checker program of the source's Section 5, n" + }, + { + "kind": "theorem", + "unqualified_name": "ratioExponentBound", + "line": 506, + "source_header": "hle\n rw [one_div, Real.log_inv] at hl\n exact min_eq_left (by linarith)\n · subst h\n simp\n\n/-- Proves: `UniversalLaw.Spec.P15.RatioExponentBound` (register row `p15-price-budget-restricted`).\nMethod: `3^n ≥ 3^(2a+1)` and the exact identity `4^(a+1)/3^(2a+1) = (4/3)(4/9)^a`; then\n`(4/9)^a ≤ 4/9` for `a ≥ 1`.\nDoes not establish: the ratio steps of (T3) preceding the exponent" + }, + { + "kind": "theorem", + "unqualified_name": "rhoStarBelowSixSevenths", + "line": 524, + "source_header": "/ 9 : ℝ) ^ a ≤ (4 / 9) ^ 1 := pow_le_pow_of_le_one (by norm_num) (by norm_num) ha\n nlinarith [h]\n\n/-! ## Full price: the constant `rho_star` -/\n\n/-- Proves: `UniversalLaw.Spec.P15.RhoStarBelowSixSevenths` (register row `p15-full-price`).\nMethod: `3e - 2 < 197/32 < exp(11/6)` (decimal bound on `e`; degree-5 Taylor lower bound on\n`exp`), hence `h_star > 7/6` and `rho_star = 1/h_star < 6/7`.\nDoes not establish: the 20-digit enclosure (F3) (`RhoStarEnclosure`), the budget (F2), or any\nreview/acceptance of P15-FULL-TRANSFORMED-PRICE-20260924-v1 (disposition REVIEWED_SCOPED is\ntransc" + }, + { + "kind": "theorem", + "unqualified_name": "sixSeventhsCertificate", + "line": 535, + "source_header": "hoStarBelowSixSevenths : UniversalLaw.Spec.P15.RhoStarBelowSixSevenths :=\n Aux.rhoStar_lt_six_sevenths\n\n/-- Proves: `UniversalLaw.Spec.P15.SixSeventhsCertificate` (register row `p15-full-price`).\nMethod: `Real.exp_one_lt_d9` for `e < 31967/11760`; `norm_num` for the two rational identities;\n`Real.sum_le_exp_of_nonneg` with six terms for `197/32 < exp(11/6)`; then `log` monotonicity.\nDoes not establish: the series and geometric-tail bounds the source uses for `e < 31967/11760`\n(a sharper Mathlib bound is used instead)," + }, + { + "kind": "theorem", + "unqualified_name": "hStarExceedsOne", + "line": 548, + "source_header": "en_sixths_gt, Aux.seven_sixths_lt_hStar, Aux.rhoStar_lt_six_sevenths⟩\n rw [Aux.taylor_sum_eq]\n norm_num\n\n/-- Proves: `UniversalLaw.Spec.P15.HStarExceedsOne` (register row `p15-full-price`).\nMethod: `2 < e` from `Real.exp_one_gt_d9`; `ring` for the factorisation; `u = exp(-1) < 1/2`\nand `u(1-u)(1-2u) > 0` for `3e^{-2} - 2e^{-3} < e^{-1}`; `log(3e-2) < 2` from `3e-2 < e^2`.\nDoes not establish: (F11) for general" + }, + { + "kind": "theorem", + "unqualified_name": "phiAtPStar", + "line": 562, + "source_header": "ul_pos hu (by linarith : (0 : ℝ) < 1 - Real.exp (-1)))\n (by linarith : (0 : ℝ) < 1 - 2 * Real.exp (-1))]\n\n/-- Proves: `UniversalLaw.Spec.P15.PhiAtPStar` (register row `p15-full-price`).\nMethod: `p_star < 1`, `1 - p_star = exp(-1)`, `Real.log_exp`.\nDoes not establish: equality" + }, + { + "kind": "theorem", + "unqualified_name": "hazardStarPositive", + "line": 574, + "source_header": "uceIte]\n have e : (1 : ℝ) - (1 - Real.exp (-1)) = Real.exp (-1) := by ring\n rw [e, Real.log_exp]\n norm_num\n\n/-! ## Full price: hazard positivity, binomial identities, worst case -/\n\n/-- Proves: `UniversalLaw.Spec.P15.HazardStarPositive` (register row `p15-full-price`).\nMethod: at the constant vector `p_star ∈ (0,1)` all weights are nonnegative, the empty set\ncontributes `(1-p_star)^n > 0`, and since `X ∉ A` the mass is at most `1 - p_star^n < 1`\n(all weights sum to one by `Finset.prod_add`); then `Real.log_neg`.\nDoes not establish:" + }, + { + "kind": "theorem", + "unqualified_name": "oddMajorityIdentity", + "line": 620, + "source_header": "hp0 _\n have hlt : muOf A (fun _ : Fin n => pStar) < 1 := by linarith\n have := Real.log_neg hpos hlt\n linarith\n\n/-- Proves: `UniversalLaw.Spec.P15.OddMajorityIdentity` (register row `p15-full-price`).\nMethod: the one-trial recursion `binomTail (n+1) k = binomTail n k - C(n,k) p^(k+1) (1-p)^(n-k)`\n(Pascal's rule, induction on `k`) applied twice, Pascal's rule once more, `ring`; the second\nform by `Nat.choose_symm_half`; negativity from `p(1-2p) < 0` and a positive factor.\nDoes not establish: (F11) itself (the ch" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_odd_chain", + "line": 659, + "source_header": ") (pow_pos (by linarith) _))\n (pow_pos (by linarith) _)\n exact mul_neg_of_neg_of_pos hneg hpos\n\nnamespace Aux\n\n/-- The chain of (F10) at `p ∈ (1/2, 1)`: `P(Bin(2a+1,p) ≤ a) ≤ P(Bin(3,p) ≤ 1)` for `a ≥ 1`. -/\ntheorem binomTail_od" + }, + { + "kind": "theorem", + "unqualified_name": "capacityWorstCase", + "line": 671, + "source_header": "ave h := (oddMajorityIdentity k c).2.2 hc hc1\n rw [show 2 * (k + 1) + 1 = 2 * k + 3 by ring]\n linarith\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.P15.CapacityWorstCase` (register row `p15-full-price`).\nMethod: `mu_{p_star}(capacityFamily n a) = binomTail n a p_star` (`Finset.sum_powerset_apply_card`),\nthe tail decreases in `n` (one-trial recursion) and along `a ↦ a+1` at `p_star > 1/2` (F10), so\n`binomTail n a ≤ binomTail 3 1` and `-log` reverses the order; `binomTail 3 1 p_star` evaluates\nto `3e^{-2} - 2e^{-3} = (3e-2)e^{-3}`, whose `-log` is `h_star`; `h_star > 1` as in\n`HStarExceedsOne`.\nDoes not establish: the local price bound (F12) or the assembly (F13); the source's remark \"it\nis not a finite-grid extrapolation\" is" + }, + { + "kind": "theorem", + "unqualified_name": "demandOneBoundary", + "line": 705, + "source_header": "m]\n ring\n rw [e, Real.log_mul (ne_of_gt Aux.three_exp_sub_two_pos) (Real.exp_pos _).ne', Real.log_exp]\n ring\n\n/-! ## Full price Section 5: the exact demand boundary -/\n\n/-- Proves: `UniversalLaw.Spec.P15.DemandOneBoundary` (register row `p15-full-price`).\nMethod: one-block lemmas (block = ground set, good ⇔ `|U| ≤ cap`, obstruction `{X}` at `K = 1`,\n`mu_p(D) = 1 - prod p_v` via `Finset.prod_add`, unit-price covers cost at least one by\n`le_csInf`); `p_star^(cap+1) < p_star` for `cap ≥ 1`; `Real.log_lt_log`; for `rho ≤ 1` the capped\nhazard is `min(1, rho(-log mu)) ≤ -log mu < 1 ≤ covercost`.\nDoes not establish: any retraction of original P15-B (\"whose local-budget premise is missing in\nthat case\"); the equality `coverco" + }, + { + "kind": "theorem", + "unqualified_name": "triangleNeedsThree", + "line": 748, + "source_header": "=> pStar)) := min_le_right _ _\n _ < 1 := by linarith\n _ ≤ coverCost (demandOneBlock cap) 1 (fun _ => (1 : ℝ)) := hcc\n\n/-! ## Realized covers Section 5: the triangle -/\n\n/-- Proves: `UniversalLaw.Spec.P15.TriangleNeedsThree` (register row `p15-realized-covers`).\nMethod: `K_H(d) = sInf` of the feasible set; three singletons are feasible at `K = 3`\n(`Nat.sInf_le`); sizes `0`, `1`, `2` are infeasible (`K = 0` by cardinality, `K = 1, 2` by\nkernel `decide` over the finitely many label-set assignments), so `le_csInf` gives `3 ≤ sInf`.\nDoes not establish: display (P9) (`ElementaryPaletteFormula`), the matroid palette formu" + }, + { + "kind": "theorem", + "unqualified_name": "muOf_capacityFamily_all", + "line": 774, + "source_header": "angle_not_feasible2 hK\n\n/-! ## Full price Sections 3 and 5: (F9) for every `a`, and the sharpness of `rho_star` -/\n\nnamespace Aux\n\n/-- (F9) as an identity for every `a` (no `a ≤ n` hypothesis): the extra terms `j > n` of the\ntail vanish since `Nat.c" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_block", + "line": 796, + "source_header": "ilter]\n refine Finset.sum_congr rfl (fun j _ => ?_)\n split_ifs with h\n · ring\n · rw [Nat.choose_eq_zero_of_lt (by omega)]; simp\n\n/-! ### The triple block: one block, `a = 1`, `d = 2`, ground set of size three," + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_isGood", + "line": 804, + "source_header": "ripleBlock_block (i : Fin 1) : block tripleBlock i = Finset.univ := by\n unfold block\n rw [Fin.fin_one_eq_zero i]\n simp [tripleBlock]" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_decomp", + "line": 810, + "source_header": "tripleBlock i).card ≤ 1) ∧\n (∀ e ∈ (∅ : Finset (Finset (Fin 1))), ¬ e ⊆ supp tripleBlock U) ↔ U.card ≤ 1\n simp [tripleBlock_block]\n\n/-- Two-decomposability is `|U| ≤ 2`: two good parts have at most two elements in all\n(`Finset.card_biUnion_le`), and a set of size `≤ 2" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_obstruction", + "line": 847, + "source_header": "mp only; split_ifs <;> simp\n · intro j j' hjj'\n fin_cases j <;> fin_cases j' <;> simp_all [hxy.symm]\n · ext v\n simp\n\n/-- At `K = 2` the sole" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_isRealized", + "line": 861, + "source_header": "intro h\n by_contra hne\n have := card_le_of_ne_univ 2 U hne\n omega\n · rintro rfl\n rw [Finset.card_univ, Fintype.card_fin]; omega\n\n/-- T" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_fullBlockFamily", + "line": 874, + "source_header": "Fin 1))), 2 ≤ e.card\n simp\n · change ∀ e ∈ (∅ : Finset (Finset (Fin 1))), ∀ f ∈ (∅ : Finset (Finset (Fin 1)))," + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_palette", + "line": 884, + "source_header": "Finset.mem_singleton]\n constructor\n · rintro ⟨i, rfl⟩\n exact tripleBlock_block i\n · rintro rfl\n exact ⟨(0 : Fin 1), tripleBlock_block 0⟩\n\n/-- `K_H(d) = 2` for one block of demand two and no edges" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_mu", + "line": 899, + "source_header": "K\n have h2le : 2 ≤ (P 0).card := hP 0\n have h0 : (P 0).card ≤ Fintype.card (Fin K) := Finset.card_le_univ _\n rw [Fintype.card_fin] at h0\n omega\n\n/-- `mu_p(D)` for the" + }, + { + "kind": "theorem", + "unqualified_name": "genPrice_one", + "line": 911, + "source_header": "r h)]\n simp [h]\n · rw [Set.indicator_of_notMem\n (show U ∉ downset tripleBlock from fun hm => h ((tripleBlock_isGood U).mp hm))]\n simp [h]\n\n/-- At" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_cover_ge_one", + "line": 915, + "source_header": "ator costs one (the empty generator included). -/\ntheorem genPrice_one (g : Finset (Fin 3)) : genPrice (fun _ => (1 : ℝ)) g = 1 := by\n simp [genPrice]\n\n/-- At unit prices every cover of `{X}` costs at lea" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_fullBlock_cover", + "line": 926, + "source_header": "g := (genPrice_one g).symm\n _ ≤ ∑ g ∈ G, genPrice (fun _ => (1 : ℝ)) g :=\n Finset.single_le_sum (fun g _ => by rw [genPrice_one]; norm_num) hg\n\n/-- The full" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_fullBlock_price", + "line": 934, + "source_header": ") := by\n intro U hU\n rw [tripleBlock_obstruction] at hU\n rw [tripleBlock_fullBlockFamily]\n exact ⟨Finset.univ, Finset.mem_singleton_self _, by rw [hU]⟩\n\n/-- The" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_coverCost", + "line": 940, + "source_header": "lock_fullBlock_price :\n famPrice (fun _ => (1 : ℝ)) (fullBlockFamily tripleBlock) = 1 := by\n rw [tripleBlock_fullBlockFamily]\n simp [famPrice, g" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_mu_pStar", + "line": 949, + "source_header": "⟨⟨fullBlockFamily tripleBlock, tripleBlock_fullBlock_cover,\n tripleBlock_fullBlock_price⟩, ?_⟩\n rintro t ⟨G, hG, rfl⟩\n exact tripleBlock_cover_ge_one G hG\n\n/-- `mu_{p_sta" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_hazard", + "line": 954, + "source_header": "_mu_pStar :\n mu tripleBlock (fun _ => pStar) = 3 * Real.exp (-2) - 2 * Real.exp (-3) := by\n rw [tripleBlock_mu, muOf_capacityFamily_all, binomTail_th" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_sharp", + "line": 959, + "source_header": "is `h_star`. -/\ntheorem tripleBlock_hazard : -Real.log (mu tripleBlock (fun _ => pStar)) = hStar := by\n rw [tripleBlock_mu_pStar]\n exact capacityWorstCase.2.2.1\n\n/-- Any `ρ < ρ_star = 1/h_star` makes the capped" + }, + { + "kind": "theorem", + "unqualified_name": "capacityHazardIsBinomial", + "line": 980, + "source_header": "↓reduceIte]\n rw [hlog]\n calc min 1 (ρ * hStar) ≤ ρ * hStar := min_le_right _ _\n _ < rhoStar * hStar := mul_lt_mul_of_pos_right hρ hh\n _ = 1 := hrho\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.P15.CapacityHazardIsBinomial` (claim `p15-full-price`, display (F9)).\nMethod: `hazardStar` unfolds to `-log (muOf (capacityFamily n a) p_star)`, and the mass of the\ncapacity family at a constant vector is `binomTail n a` for EVERY `a` (`Finset.sum_powerset_apply_card`\ngroups the subsets by cardinality; for `a > n` the extra terms `j > n` vanish since\n`Nat.choose n j = 0`), which extends `Aux.muOf_capacityFamily` beyond `a ≤ n`.\nDoes not establish: the informal claim's review or acceptance; the alignment of `capacityFamily` and\n`binomTail` with the source's `A = {S : |S| ≤ a}` and `P(Bin(n, p_star) ≤ a)`\n(PENDING_INDEPENDENT_REVI" + }, + { + "kind": "theorem", + "unqualified_name": "sharpnessOfRhoStar", + "line": 994, + "source_header": "(F2). -/\ntheorem capacityHazardIsBinomial : UniversalLaw.Spec.P15.CapacityHazardIsBinomial := by\n intro n a\n unfold hazardStar\n rw [Aux.muOf_capacityFamily_all n a]\n\n/-- Proves: `UniversalLaw.Spec.P15.SharpnessOfRhoStar` (claim `math.p15-full-price`, full-price note Section 5).\nMethod: for `tripleBlock` the single block is the ground set, good sets are those of size `≤ 1`, and a\nset is `2`-decomposable iff it has size `≤ 2` (two singletons/empties; `Finset.card_biUnion_le` for the\nconverse), so the obstruction at `K = 2` is `{X}`; `K_H(d) = 2` by `Nat.sInf_le`/`le_csInf`; at unit\nprices every generator costs `1`, every cover of `{X}` costs `≥ 1` (`Finset.single_le_sum`) and the\nfull-block cover `{X}` costs `1`, hence `coverCost = 1` (`IsLeast.csInf_eq`); `mu_p(D)` is the mass of\nthe capacity family `(3, 1)`, i.e. `binomTail 3 1 p_star = 3e^{-2} - 2e^{-3}`, whose `-log` is `h_star`\n(the identity proved in `capacityWorstCase`); for `ρ < ρ_star = 1/h_star`,\n`min 1 (ρ h_star) ≤ ρ h_star < 1`.\nDoes not establish: the informal sharpness claim's review or acceptance; the alignment of the Lean\n`tripleBlock`, `obstruction`, `coverCost` and `cappedHazard` with the source's objects\n(PENDING_INDEPENDENT_REVIEW); sharpness for any family other than the triple block; the budget (F2)\nitself; any necessity" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Covariance.lean", + "sha256": "08317c620ae7b85ce2d253f0a106a6cee0099566a09debeb703acbce4744ae30", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "cv_kinf_comp_neg", + "line": 78, + "source_header": "x\n\n/-! ## `cv_`: odd orders of `Kinf d` vanish at the origin -/\n\n/-- `Kinf d` is even: `Kinf d ∘ (-id) = Kinf d` (`norm_neg`). -/\ntheorem cv_kinf_comp_neg {d : ℕ} :\n (Kinf d ∘ (-ContinuousLinearMap.id ℝ (E d))) = K" + }, + { + "kind": "theorem", + "unqualified_name": "cv_iteratedFDeriv_odd", + "line": 86, + "source_header": "Kinf]\n\n/-- Every odd-order iterated derivative of `Kinf d` at `0` vanishes, in arbitrary directions:\n`ContinuousLinearMap.iteratedFDeriv_comp_right` with the evenness `cv_kinf_comp_neg` gives\n`D^n Kinf 0 [m] = (-1)^n D^n Kinf 0 [m]` (`ContinuousMultilinearMap.map_smul_univ`). -/\ntheorem cv_iteratedFDeriv_odd {d : ℕ} (n : ℕ) (hn : Odd n) (m : Fin n → E d) :\n iteratedFDeriv ℝ n (Kinf d)" + }, + { + "kind": "theorem", + "unqualified_name": "cv_odd_zero", + "line": 104, + "source_header": "inarith\n\n/-- A contraction of `Kinf d` at `0` against a list of odd length vanishes. -/\ntheorem cv_odd_zero {d : ℕ} (l : List (E d)) (hl : Odd l.length) :\n derivContraction d (Kinf d" + }, + { + "kind": "theorem", + "unqualified_name": "cv_GG", + "line": 109, + "source_header": "dd _ hl _\n\n/-! ## `cv_`: the entries of `Cref d u R` in a general frame -/\n\n/-- Gradient/gradient entry: `(-1)^1 · (-⟪R i, R j⟫) = ⟪R i, R j⟫`. -/\ntheorem cv_GG {d : ℕ} (u : E d) (R : Fin d → E d) (i j : Fin d) :\n Cref d u R (Sum.inl i) (Sum.inl j)" + }, + { + "kind": "theorem", + "unqualified_name": "cv_Gt", + "line": 116, + "source_header": "rb_order_two]\n\n/-- Gradient/`t` entry: `(-1)^3 · D^4 Kinf 0 [R i, u, u, u] = -3 ⟪u, u⟫ ⟪R i, u⟫`. -/\ntheorem cv_Gt {d : ℕ} (u : E d) (R : Fin d → E d) (i : Fin d) (t : Unit) :\n Cref d u R (Sum.inl i) (Sum.inr (Sum.inl t)) = -(3 * (⟪u," + }, + { + "kind": "theorem", + "unqualified_name": "cv_tG", + "line": 122, + "source_header": "er_four]\n ring\n\n/-- `t`/gradient entry: `(-1)^1 · D^4 Kinf 0 [u, u, u, R j] = -3 ⟪u, u⟫ ⟪u, R j⟫`. -/\ntheorem cv_tG {d : ℕ} (u : E d) (R : Fin d → E d) (j : Fin d) (t : Unit) :\n Cref d u R (Sum.inr (Sum.inl t)) (Sum.inl j) = -(3 * (⟪u" + }, + { + "kind": "theorem", + "unqualified_name": "cv_tt", + "line": 128, + "source_header": "rder_four]\n ring\n\n/-- `t`/`t` entry: `(-1)^3 · D^6 Kinf 0 [u, …, u] = 15 ⟪u, u⟫^3`. -/\ntheorem cv_tt {d : ℕ} (u : E d) (R : Fin d → E d) (t t' : Unit) :\n Cref d u R (Sum.inr (Sum.inl t)) (Sum.inr (Sum.inl t')) =\n 15 * (⟪u, u⟫" + }, + { + "kind": "theorem", + "unqualified_name": "cv_GH", + "line": 135, + "source_header": "b_order_six]\n ring\n\n/-- Gradient/Hessian entry: an order-three contraction, hence `0`. -/\ntheorem cv_GH {d : ℕ} (u : E d) (R : Fin d → E d) (i : Fin d) (q : SymIndex d) :\n Cref d u R (Sum.inl i) (Sum" + }, + { + "kind": "theorem", + "unqualified_name": "cv_HG", + "line": 141, + "source_header": "_ ⟨1, rfl⟩, mul_zero]\n\n/-- Hessian/gradient entry: an order-three contraction, hence `0`. -/\ntheorem cv_HG {d : ℕ} (u : E d) (R : Fin d → E d) (p : SymIndex d) (j : Fin d) :\n Cref d u R (Sum.inr (Sum." + }, + { + "kind": "theorem", + "unqualified_name": "cv_tH", + "line": 147, + "source_header": "o _ ⟨1, rfl⟩, mul_zero]\n\n/-- `t`/Hessian entry: an order-five contraction, hence `0`. -/\ntheorem cv_tH {d : ℕ} (u : E d) (R : Fin d → E d) (t : Unit) (q : SymIndex d) :\n Cref d u R (Sum.inr (Sum.inl t))" + }, + { + "kind": "theorem", + "unqualified_name": "cv_Ht", + "line": 153, + "source_header": "ero _ ⟨2, rfl⟩, mul_zero]\n\n/-- Hessian/`t` entry: an order-five contraction, hence `0`. -/\ntheorem cv_Ht {d : ℕ} (u : E d) (R : Fin d → E d) (p : SymIndex d) (t : Unit) :\n Cref d u R (Sum.inr (Sum.inr p)" + }, + { + "kind": "theorem", + "unqualified_name": "cv_HH", + "line": 159, + "source_header": "_zero _ ⟨2, rfl⟩, mul_zero]\n\n/-- Hessian/Hessian entry: `s_p s_q (-1)^2` times the three pairings of\n`D^4 Kinf 0 [R p₁, R p₂, R q₁, R q₂]`. -/\ntheorem cv_HH {d : ℕ} (u : E d) (R : Fin d → E d) (p q : SymIndex d) :\n Cref d u R (Sum.inr (Sum.inr p)) (Sum.inr (Sum.inr q)) =\n svecScale d (Sum.inr (Sum.inr p)) * svecScale d (Sum.inr (Sum.inr q)) *\n (⟪R q.1.1, R q.1.2⟫ * ⟪R p.1.1, R p.1.2⟫ + ⟪R p.1.2, R q.1.2⟫ * ⟪R p.1.1, R q.1.1⟫\n + ⟪R p.1.1, R" + }, + { + "kind": "theorem", + "unqualified_name": "cv_decomp", + "line": 170, + "source_header": "sis.Aux.rb_order_four]\n simp\n\n/-! ## `cv_`: the decomposition into positive semidefinite summands -/\n\n/-- In an orthonormal frame with `u = R 0`, `Cref - (1/3) I` is, entrywise, a nonnegative\ndiagonal matrix plus `(2/3) v vᵀ` with `v = e_{G_0} - (9/2) e_t` plus `w wᵀ` with `w` the\nindicator of the diagonal Hessian coordinates. -/\ntheorem cv_decomp {d : ℕ} (hd : 0 < d) (R : Fin d → E d) (hR : Orthonormal ℝ R) :\n Cref d (R ⟨0, hd⟩) R - (1 / 3 : ℝ) • (1 : Matrix (JointIndex d) (JointIndex d) ℝ) =\n Matrix.diagonal (Sum.elim (fun i : Fin d => if i = ⟨0, hd⟩ then (0 : ℝ) else 2 / 3)\n (Sum.elim (fun _ : Unit => (7 / 6 : ℝ)) (fun _ : SymIndex d => (5 / 3 : ℝ))))\n + (2 / 3 : ℝ) • Matrix.vecMulVec\n (Sum.elim (fun i : Fin d => if i = ⟨0, hd⟩ then (1 : ℝ) else 0)\n (Sum.elim (fun _ : Unit => (-9 / 2 : ℝ)) (fun _ : SymIndex d => (0 : ℝ))))\n (Sum.elim (fun i : Fin d => if i = ⟨0, hd⟩ then (1 : ℝ) else 0)\n (Sum.elim (fun _ : Unit => (-9 / 2 : ℝ)) (fun _ : SymIndex d => (0 : ℝ))))\n + Matrix.vecMulVec\n (Sum.elim (fun _ : Fin d => (0 : ℝ))\n (Sum.elim (fun _ : Unit => (0 : ℝ))\n (fun p : SymIndex d => if p.1.1 = p.1.2 then (1 : ℝ) else 0)))\n (Sum.elim (fun _ : Fin d => (0 : ℝ))\n (Sum.elim (fun _ : Unit => (0 : ℝ))\n (fun p : SymIndex d => if p.1" + }, + { + "kind": "theorem", + "unqualified_name": "cv_psd", + "line": 221, + "source_header": "iff] <;> first | omega | norm_num\n\n/-- `Cref - (1/3) I` is positive semidefinite in every orthonormal frame with `u = R 0`, for every\n`d > 0`: the three summands of `cv_decomp` are positive semidefinite. -/\ntheorem cv_psd {d : ℕ} (hd : 0 < d) (R : Fin d → E d) (hR : Orthonormal ℝ R) :\n (Cref d (R ⟨0, hd⟩) R -\n (1 / 3 : ℝ) • (1 : Matrix (JointInd" + }, + { + "kind": "theorem", + "unqualified_name": "referenceCovarianceLowerBound", + "line": 247, + "source_header": "1.2 then (1 : ℝ) else 0)))\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.Side24.ReferenceCovarianceLowerBound` (claim\n`side24-coefficient`), for the formal `Cref` of `Specifications.Side24`.\nMethod: odd-order contractions of the even kernel `Kinf d` vanish at `0` (`Aux.cv_odd_zero`,\nvia `ContinuousLinearMap.iteratedFDeriv_comp_right` and `ContinuousMultilinearMap.map_smul_univ`);\nthe orders two, four and six are the round-4 helpers `Side24Analysis.Aux.rb_order_two`,\n`rb_order_four`, `rb_order_six`; in an orthonormal frame with `u = R 0`,\n`Cref - I/3 = diagonal (0, 2/3, …, 2/3; 7/6; 5/3, …, 5/3) + (2/3) v vᵀ + w wᵀ` entrywise\n(`Aux.cv_decomp`, `v = e_{G_0} - (9/2) e_t`, `w` the indicator of the diagonal Hessian\ncoordinates), and each summand is positive semidefinite (`Aux.cv_psd`, which holds for every\n`d > 0`; the hypothesis `d = 2 ∨ d = 3` of the `Prop` is not used by the proof).\nDoes not establish: the informal Section 3 display \"C_ref >= I/3\" of the source as the source's\nobject (the alignment of `E d`, `Kinf`, `derivContraction`, `jetDirs`, `svecScale`, `jointCov` and\n`Cref` with the source's `R^d`, `K_infty`, jet and joint covariance, and of Mathlib's\n`Matrix.PosSemidef` (which includes `IsHermitian`) with the source's `>=` order, is\nPENDING_INDEPENDENT_REVIEW); that `Cref` is the covariance of any random vector (no field is\nconstructed); symmetry of `Cref d u R` for general `u` or a general frame (only the `IsHermitian`\nhalf of the `Prop`'s `PosSemidef`, at `u = R 0` in an orthonormal frame with `0 < d`, is proved);\nthe statement module's own `Does not claim:` text (\"the bound (statement only); the odd-block\neigenvalues `8 ± sqrt 58` and the minors `2/3`, `7/9` are kernel-checked on main\n(`UniversalLaw.Side24.odd_block_eigenvalues`, `odd_block_shifted_minors`,\n`smaller_eigenvalue_exceeds_third`), not here\"), which describes the statement packet and is not\nedited here; main's `UniversalLaw.Side24.odd_block_eigenvalues`, `odd_block_shifted_minors` and\n`smaller_eigenvalue_exceeds_third` are neither imported, cited nor relied on (the certificate's\nentry arithmetic is discharged inline by `simp`/`norm_num` in `Aux.cv_decomp`), and no minor\n(in particular not `7/9`), no eigenvalue `8 ± sqrt 58` and no comparison of the smaller\neigenvalue with `1/3` is computed or stated here; anything about `C_24`, `CovarianceOrdering` or\n`EntrywiseCovarianceBound`; any enclosure of the coefficient `c_{d,24}`; the disposition of\n`side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the register, not derived here;\nnonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. It promotes, closes,\ndischarges or reclassifies nothing. -/\ntheorem referenceCovarianceLowerBound : UniversalLaw.Spec" + } + ] + } + ] + }, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:specifications/lean_statement_proofs_20261011", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "specifications/lean_statement_proofs_20261011", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "Current pinned Lean build, all-project-constant axiom census, named-module kernel replay and premise satisfiability/statement alignment have not been observed for this exact package in CBZ execution. Existing historic receipts retain their scope and are not retracted.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs.lean", + "sha256": "bf65105b6902ba3ef8262a7cff13e611ce3e56263ad7f57a7183097e67332a8c", + "declarations_lexical": [] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Covers.lean", + "sha256": "5d14d6283c52e90451bce80061dd55b07b9234c92b3d87de38c1975f5b1852ed", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "weight_nonneg", + "line": 31, + "source_header": "x\n\n/-! ### The product measure: nonnegative weights and the marginal of a fixed subset -/\n\n/-- Weights are nonnegative for `p` in `[0,1]^Y`. -/\ntheorem weight_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (U : Finset Y) : 0 ≤ weigh" + }, + { + "kind": "theorem", + "unqualified_name": "filter_superset_eq_image", + "line": 40, + "source_header": ").2])\n\n/-- The sets containing `M` are exactly the sets `M ∪ T` with `T ⊆ univ \\ M`. -/\ntheorem filter_superset_eq_image {Y : Type} [Fintype Y] [DecidableEq Y] (M : Finset Y) :\n (univ : Finset Y).powerset.filter (fun U => M ⊆ U) =\n ((univ : Finset Y) \\ M).powerset.image (fun T =>" + }, + { + "kind": "theorem", + "unqualified_name": "weight_union_of_disjoint", + "line": 52, + "source_header": "on_left\n\n/-- The weight of `M ∪ T` for `T` disjoint from `M` factors as the product of `p` over `M` times\nthe weight of `T` relative to the ground set `univ \\ M`. -/\ntheorem weight_union_of_disjoint {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ)\n {M T : Finset Y} (h : Disjoint M T) :\n weight p (M ∪ T) =\n (∏ v ∈ M, p v) * ((∏ v ∈ T, p v) * ∏ v ∈ ((univ : Finset Y) \\ M) \\ T, (" + }, + { + "kind": "theorem", + "unqualified_name": "sum_weight_filter_superset", + "line": 64, + "source_header": "ssoc, hs]\n\n/-- The marginal identity: the total weight of the sets containing a fixed `M` is\n`∏_{v ∈ M} p v`, for any real vector `p` (no range hypothesis is needed). -/\ntheorem sum_weight_filter_superset {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ)\n (M : Finset Y) :\n ∑ U ∈ (univ : Finset Y).powerset.filter (fun U => M ⊆ U), weight p U = ∏" + }, + { + "kind": "theorem", + "unqualified_name": "sum_weight_ite_superset", + "line": 86, + "source_header": ", ← e₂, h']\n\n/-- The same marginal identity with the superset condition written as an `if`. -/\ntheorem sum_weight_ite_superset {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ)\n (M : Finset Y) :\n ∑ U ∈ (univ : Finset Y).powerset, (if M ⊆ U then weight p U else 0) =" + }, + { + "kind": "theorem", + "unqualified_name": "one_sub_mu_eq", + "line": 96, + "source_header": "en Classical in\n/-- `1 - mu_p(D)` is the total weight of the bad sets (classical decidability of `IsGood`). -/\ntheorem one_sub_mu_eq {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (p : X → ℝ) :\n 1 - mu F p =\n ∑ U ∈ (univ : Finset X).powerset, (if IsGood F U then 0" + }, + { + "kind": "theorem", + "unqualified_name": "one_sub_mu_le_sum_prod", + "line": 109, + "source_header": "plit_ifs <;> ring\n\n/-- The union bound: if every bad set contains a member of the family `𝓜`, then\n`1 - mu_p(D) ≤ ∑_{M ∈ 𝓜} ∏_{v ∈ M} p v`, for `p` in `[0,1]^X`. -/\ntheorem one_sub_mu_le_sum_prod {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X → ℝ) (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (𝓜 : Finset (Finset X))\n (h𝓜 : ∀ U : Finset X, ¬ IsGood F U → ∃ M ∈ 𝓜, M ⊆ U) :\n 1 - mu F p ≤ ∑" + }, + { + "kind": "theorem", + "unqualified_name": "exists_minimalForbidden_subset", + "line": 138, + "source_header": "ht_ite_superset p M\n\n/-! ### Minimal forbidden subsets of bad sets; the size of a transversal -/\n\n/-- Every bad set contains an inclusion-minimal forbidden set. -/\ntheorem exists_minimalForbidden_subset {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) (U : Finset X) (hU : ¬ IsGood F U) :\n ∃ M : Finset X, IsMinim" + }, + { + "kind": "theorem", + "unqualified_name": "card_of_isTransversal", + "line": 152, + "source_header": ", hv, hb⟩⟩, subset_rfl⟩\n\n/-- A transversal of `e` has exactly `|e|` elements (one per block of `e`). -/\ntheorem card_of_isTransversal {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n {e : Finset (Fin F.b)} {U : Finset X} (h : IsTransversal" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816_bad_covered", + "line": 177, + "source_header": ".Proofs.P15Structure.Aux in\n/-- Every bad set of the six-block benchmark contains an internal pair or a transversal\nquadruple. -/\ntheorem benchmark816_bad_covered (U : Finset (Fin 6 × Fin 409))\n (hU : ¬ IsGood benchmark816 U) : ∃ M ∈" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816_one_sub_mu_le", + "line": 191, + "source_header": "aw.Proofs.P15Structure.Aux in\n/-- Display (P11), first line: the union bound over the `6 * C(409,2)` pairs and the\n`15 * 409^4` transversal quadruples at `p_v = 1/40900`. -/\ntheorem benchmark816_one_sub_mu_le :\n 1 - mu benchmark816 (fun _ => (1 : ℝ) / 40900) ≤ 50" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816Cover", + "line": 219, + "source_header": "push_cast\n norm_num\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816Cover` (claim `p15-realized-covers`, Section 6 of\nP15_REALIZED_COVERS.md: \"At816 colors it covers the obstruction; at815 it does not\").\nMethod: Proposition P2 (`FullBlockCoverIff`) for the six-block data, which satisfy\n`IsRealizedFamily` (`Benchmark816IsRealized`), reduces both clauses to `816 ≤ K`, and\n`Benchmark816Palette` evaluates the palette number to `816`.\nDoes not establish: the informal claim, its review or acceptance; alignment of the formal\n`IsGeneratorCover`/`obstruction` with the informal notions; optimality of any other cover\n(disposition transcribed in the statement: HOLD_WITH_DOMAIN). -/\ntheorem benchmark816Cover : Univer" + }, + { + "kind": "theorem", + "unqualified_name": "localRestriction", + "line": 237, + "source_header": ".1 hc\n rw [hpal] at h815\n omega\n\n/-- Proves: `UniversalLaw.Spec.P15.LocalRestriction` (claim `p15-realized-covers`, display (P2) of\nP15_REALIZED_COVERS.md: `D_i = D ∩ 2^(X_i) = {S ⊆ X_i : |S| ≤ a_i}`).\nMethod: for `S ⊆ X_i`, `S ∩ X_i = S`, so goodness gives `|S| ≤ a_i`; conversely a subset of one\nblock with at most `a_i` elements is good because its support has at most one index and every\nedge has at least two (`P15Structure.Aux.good_of_subset_block`).\nDoes not establish: the informal claim, its review or acceptance; alignment of `IsGood` with the\ninformal downset `D`. -/\ntheorem localRestriction {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :\n Unive" + }, + { + "kind": "theorem", + "unqualified_name": "paletteNumberAttained", + "line": 254, + "source_header": "ux.good_of_subset_block hF hS hcard\n\n/-- Proves: `UniversalLaw.Spec.P15.PaletteNumberAttained` (claim `p15-realized-covers`, Section 4\nof P15_REALIZED_COVERS.md: \"By discarding excess labels within blocks, one may take |P_i|=d_i\";\nthe feasible set of palette sizes is nonempty).\nMethod: disjoint label intervals of lengths `d_i` form a feasible palette of size `∑ d_i` when\nevery edge has at least two indices (`P15Structure.Aux.isPaletteFeasible_paletteNumber`), so the\ninfimum over `ℕ` is attained (`csInf_mem` of a nonempty set of naturals).\nDoes not establish: the informal claim, its review or acceptance; the value of the palette\nnumber for any family. -/\ntheorem paletteNumberAttained {X : Type} [Fintype X] (F : RealizedData X) :\n Universa" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816UnionBound", + "line": 266, + "source_header": "ible_paletteNumber F.H F.d hF.2.2.2.1\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816UnionBound` (claim `p15-realized-covers`, display\n(P11) of P15_REALIZED_COVERS.md: `Q = 1 - mu_p(D) ≤ 500616/40900^2 + 15/100^4 =\n2449227/8180000000 < 3/10000` at `p_v = 1/40900`).\nMethod: `1 - mu_p(D)` is the total weight of the bad sets; every bad set contains a minimal\nforbidden set, which by Proposition P1 for the six-block data is an internal pair (`6 * C(409,2)`\nof them) or a transversal quadruple (`15 * 409^4`); the union bound exchanges the two sums and the\nmarginal identity `∑_{U ⊇ M} w(U) = ∏_{v ∈ M} p_v` evaluates each term to `(1/40900)^|M|`; the\ntwo rational identities are exact arithmetic (`norm_num`), and the last clause follows from the\nfirst three by `linarith`.\nDoes not establish: the informal claim, its review or acceptance; the exact value of the bad\nprobability (the source stresses \"only a union bound, not an equality of the global bad\nprobability\"); alignment of `mu`/`IsGood` with the informal objects. -/\ntheorem benchmark816UnionBound : Unive" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Elementary.lean", + "sha256": "7fb8f8c5045f51ca766f1fa614a25e3b334b1ac6199731c2556c28707193c1bb", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "ten_lt_taylor_sum", + "line": 37, + "source_header": "x\n\n/-! ### Exponential bounds -/\n\n/-- The degree-nine Taylor polynomial of `exp` at `288/125` exceeds `10` (exact rational\narithmetic). -/\ntheorem ten_lt_taylor_sum :\n (10 : ℝ) < ∑ i ∈ Finset.range 10, (288 / 125 : ℝ) ^ i / (Nat.factorial i" + }, + { + "kind": "theorem", + "unqualified_name": "ten_lt_exp", + "line": 46, + "source_header": "m_num\n\n/-- `10 < exp (288/125)` by the Taylor lower bound `Real.sum_le_exp_of_nonneg`. -/\ntheorem ten_lt_exp : (10 : ℝ) < Real.exp (288" + }, + { + "kind": "theorem", + "unqualified_name": "pow_ten_lt_exp", + "line": 51, + "source_header": "r_sum h\n\n/-- `10^125 < exp 288`, raising the previous bound to the `125`-th power. -/\ntheorem pow_ten_lt_exp : (10 : ℝ) ^ 125 < Rea" + }, + { + "kind": "theorem", + "unqualified_name": "exp_neg_lt", + "line": 58, + "source_header": "norm_num)\n\n/-- `exp (-288) < 1 / 10^125`. -/\ntheorem exp_neg_lt : Real.exp (-288) < 1" + }, + { + "kind": "theorem", + "unqualified_name": "big_lt_exp", + "line": 63, + "source_header": "_ten_lt_exp\n\n/-- `1024 < exp 864` by the quadratic lower bound. -/\ntheorem big_lt_exp : (1024 : ℝ) <" + }, + { + "kind": "theorem", + "unqualified_name": "ratio_const_lt_half", + "line": 68, + "source_header": "4)\n linarith\n\n/-- The geometric-ratio constant: `512 exp (-864) < 1/2`. -/\ntheorem ratio_const_lt_half : 512 * Real.exp (-864" + }, + { + "kind": "theorem", + "unqualified_name": "pow_succ_le", + "line": 74, + "source_header": "_exp\n linarith\n\n/-- The term ratio for `j ≥ 1`: `(j+1)^9 ≤ 512 j^9` since `j + 1 ≤ 2 j`. -/\ntheorem pow_succ_le (j : ℕ) (hj : 1 ≤ j) : ((j : ℝ) + 1) ^ 9 ≤" + }, + { + "kind": "theorem", + "unqualified_name": "exp_succ_le", + "line": 81, + "source_header": "ℝ) ^ 9 := by ring\n\n/-- The exponential factor for `j ≥ 1`: `exp (-288 (j+1)^2) ≤ exp (-864) exp (-288 j^2)`. -/\ntheorem exp_succ_le (j : ℕ) (hj : 1 ≤ j) :\n Real.exp (-288 * ((j : ℝ) + 1) ^ 2) ≤ Real.exp (-864) * Real.exp (" + }, + { + "kind": "theorem", + "unqualified_name": "sqrt_three_eighths", + "line": 88, + "source_header": "le_exp]\n nlinarith\n\n/-! ### Square-root algebra -/\n\n/-- `sqrt (3/8) = sqrt 6 / 4`. -/\ntheorem sqrt_three_eighths : Real.sqrt (3" + }, + { + "kind": "theorem", + "unqualified_name": "sqrt_six_rpow", + "line": 95, + "source_header": ".sqrt_sq (by norm_num)]\n\n/-- `(sqrt 6)^(4/3) = 24^(1/3) (3/2)^(1/3)`, i.e. `6^(2/3) = 36^(1/3)` and `24 * 3/2 = 36`. -/\ntheorem sqrt_six_rpow : (Real.sqrt 6) ^ ((4 : ℝ) / 3) =\n (24 : ℝ) ^ ((1 : ℝ) / 3) * (3" + }, + { + "kind": "theorem", + "unqualified_name": "hasDerivAt_antideriv", + "line": 103, + "source_header": "Real.rpow_two]\n norm_num\n\n/-! ### The elementary cone integral -/\n\n/-- The antiderivative `F z = -((a-z)^2 - 4(a-z) + 8) exp (-z/2)` of\n`(a-z)^2 exp (-z/2) / 2`. -/\ntheorem hasDerivAt_antideriv (a z : ℝ) :\n HasDerivAt (fun z : ℝ => -(((a - z) ^ 2 - 4 * (a - z) + 8) * Real.exp (-z / 2)))\n ((a - z) ^" + }, + { + "kind": "theorem", + "unqualified_name": "exponentialBounds", + "line": 128, + "source_header": "1\n push_cast\n ring\n\nend Aux\n\n/-! ## Section 2 exponential and ratio facts -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ExponentialBounds` (register row `side24-coefficient`).\nMethod: degree-nine Taylor lower bound `Real.sum_le_exp_of_nonneg` at `288/125` evaluated in\nexact rational arithmetic, then `exp 288 = exp (288/125)^125 > 10^125` and inversion.\nDoes not establish: the lattice-image bound or display (2) of the source, any enclosure of the\ncoefficient, nonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/\ntheorem exponentialBounds : Universal" + }, + { + "kind": "theorem", + "unqualified_name": "successiveTermRatio", + "line": 138, + "source_header": "⟨Aux.ten_lt_exp, Aux.exp_neg_lt⟩\n\n/-- Proves: `UniversalLaw.Spec.Side24.SuccessiveTermRatio` (register row `side24-coefficient`).\nMethod: `(j+1)^9 ≤ (2j)^9 = 512 j^9` and `-288 (j+1)^2 ≤ -864 - 288 j^2` for `j ≥ 1`;\n`512 exp (-864) < 1/2` from the quadratic lower bound `1 + 864 + 864^2/2 ≤ exp 864`.\nDoes not establish: the lattice-image sum bound `LatticeImageSumBound` (the geometric\nsummation itself is not performed here), any enclosure of the coefficient, nonauthor review\nor acceptance. -/\ntheorem successiveTermRatio : Universal" + }, + { + "kind": "theorem", + "unqualified_name": "coneMomentD2Algebra", + "line": 152, + "source_header": "xp (-288 * (j : ℝ) ^ 2)) := by ring\n\n/-! ## Section 1 algebra -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ConeMomentD2Algebra` (register row `side24-coefficient`).\nMethod: `sqrt (3/8) = sqrt 6 / 4` (`Real.sqrt_div'`, `Real.sqrt_sq`), then `ring`.\nDoes not establish: the Gaussian identity `ConeMomentD2Identity` (that `D_2` is the cone\nexpectation), any enclosure of the coefficient, nonauthor review or acceptance. -/\ntheorem coneMomentD2Algebra : Unive" + }, + { + "kind": "theorem", + "unqualified_name": "referenceCoefficientIdentity", + "line": 163, + "source_header": "D2\n rw [Aux.sqrt_three_eighths]\n ring\n\n/-- Proves: `UniversalLaw.Spec.Side24.ReferenceCoefficientIdentity` (register row\n`side24-coefficient`).\nMethod: case split `d = 2`, `d = 3`; `(sqrt 6)^(4/3) = 24^(1/3) (3/2)^(1/3)` through\n`Real.sqrt_eq_rpow`, `Real.rpow_mul`, `Real.mul_rpow`; `(2 pi)^(-d)` through `Real.rpow_neg`\nand `Real.rpow_natCast`; then `field_simp` and `ring` with `pi`, `sqrt pi`, `sqrt 3`,\n`24^(1/3)` nonzero.\nDoes not establish: that the left side is the parent formula (15.2) evaluated at the reference\nlaw (rotational invariance of `K_infty` is not specified), the value of `Gamma (7/6)`, equality\nof the periodic and reference coefficients (the source says it is NOT claimed), any enclosure\nof the coefficient, nonauthor review or acceptance. -/\ntheorem referenceCoefficientIdentity : UniversalLaw" + }, + { + "kind": "theorem", + "unqualified_name": "elementaryConeIntegral", + "line": 191, + "source_header": "Ref]\n norm_num\n field_simp\n ring\n\n/-- Proves: `UniversalLaw.Spec.Side24.ElementaryConeIntegral` (register row\n`side24-coefficient`).\nMethod: fundamental theorem of calculus `intervalIntegral.integral_eq_sub_of_hasDerivAt` with\nthe explicit antiderivative `-((a-z)^2 - 4(a-z) + 8) exp (-z/2)` (derivative rules\n`HasDerivAt.fun_pow`, `.mul`, `.exp`), integrability from continuity (`fun_prop`).\nDoes not establish: the Rayleigh law of `R^2` (`RayleighSquareLaw`), the cone-moment identity\n`ConeMomentD2Identity`, any enclosure of the coefficient, nonauthor review or acceptance. -/\ntheorem elementaryConeIntegral : Univ" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24ConeMoment.lean", + "sha256": "08d53d0a970d5765c32e42253fd78226430627018c276398968cab9fc8e3180e", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "cm_det_transverse", + "line": 88, + "source_header": "x\n\n/-! ## `cm_` (a): the negative-definite cone of the `m = 2` transverse matrix -/\n\n/-- `det [[s + x, y], [y, s - x]] = s^2 - x^2 - y^2` (`Matrix.det_fin_two_of`). -/\ntheorem cm_det_transverse (s x y : ℝ) :\n (transverseMatrix s x y).det = s ^ 2 - x ^ 2 -" + }, + { + "kind": "theorem", + "unqualified_name": "cm_cone_forward", + "line": 97, + "source_header": "ring\n\n/-- Forward direction of the cone characterisation: positive definiteness of `-A` gives `s < 0`\n(the two diagonal entries `-s - x`, `-s + x` are positive, `Matrix.PosDef.diag_pos`) and\n`x^2 + y^2 < s^2` (`det (-A) = det A > 0`, `Matrix.PosDef.det_pos`, `Matrix.det_neg`). -/\ntheorem cm_cone_forward (s x y : ℝ) (h : NegDefCone (s, x, y)) :\n s < 0 ∧ x ^ 2 + y ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "cm_sq_add_sq_pos", + "line": 113, + "source_header": "inarith\n\n/-- A nonzero vector of `Fin 2 → ℝ` has positive squared norm `v 0 ^ 2 + v 1 ^ 2`. -/\ntheorem cm_sq_add_sq_pos (v : Fin 2 → ℝ) (hv : v ≠ 0) : 0 < v 0 ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "cm_quad_pos", + "line": 125, + "source_header": "exact h1\n\n/-- The quadratic form of `-A` at `(a, b) ≠ 0` is positive inside the cone: by the Lagrange\nidentity `(x (a^2 - b^2) + 2 y a b)^2 + (2 x a b - y (a^2 - b^2))^2 = (x^2 + y^2) (a^2 + b^2)^2`,\n`|x (a^2 - b^2) + 2 y a b| ≤ sqrt (x^2 + y^2) (a^2 + b^2) < -s (a^2 + b^2)` (`nlinarith`). -/\ntheorem cm_quad_pos (s x y a b : ℝ) (hs : s < 0) (hr : x ^ 2 + y ^ 2 < s ^ 2)\n (hab : 0 < a ^ 2 + b ^ 2) :\n 0 < -s * (a ^ 2 + b ^ 2) - x * (a ^ 2 - b ^ 2) - 2" + }, + { + "kind": "theorem", + "unqualified_name": "cm_cone_backward", + "line": 144, + "source_header": "- b ^ 2))]\n\n/-- Converse direction of the cone characterisation: for `s < 0` and `x^2 + y^2 < s^2`, `-A` is\nsymmetric and its quadratic form is positive on nonzero vectors\n(`Matrix.PosDef.of_dotProduct_mulVec_pos`, `cm_quad_pos`). -/\ntheorem cm_cone_backward (s x y : ℝ) (hs : s < 0) (hr : x ^ 2 + y ^ 2 < s ^ 2) :\n NegDefC" + }, + { + "kind": "theorem", + "unqualified_name": "cm_cone_iff", + "line": 159, + "source_header": "nlinarith\n\n/-- The formal cone `NegDefCone q` is `q.1 < 0 ∧ q.2.1^2 + q.2.2^2 < q.1^2` (both directions\nabove). A statement about the formal definition only. -/\ntheorem cm_cone_iff (q : ℝ × ℝ × ℝ) :\n NegDefCone q ↔ q.1 < 0 ∧ q.2.1 ^ 2 + q.2." + }, + { + "kind": "theorem", + "unqualified_name": "cm_radial_integral", + "line": 166, + "source_header": "q.2.2 h.1 h.2⟩\n\n/-! ## `cm_` (b): the planar Gaussian integral of the disk integrand -/\n\n/-- The radial integral `∫_0^{sqrt a} r (a - r^2)^2 (2π)⁻¹ exp (-r^2/2) dr =\n(2π)⁻¹ (a^2 - 4a + 8 - 8 exp (-a/2))`: the substitution `z = r^2`\n(`intervalIntegral.integral_comp_mul_deriv`) turns it into `(2π)⁻¹` times the interval integral\nof `ElementaryConeIntegral`, which `Side24Elementary.elementaryConeIntegral` evaluates. -/\ntheorem cm_radial_integral (a : ℝ) (ha : 0 ≤ a) :\n ∫ r in (0 : ℝ)..Real.sqrt a,\n r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2))) =\n (2 * Real.pi)⁻¹ * (a ^ 2 - 4 * a + 8 - 8 *" + }, + { + "kind": "theorem", + "unqualified_name": "cm_polar_integrand", + "line": 195, + "source_header": "yConeIntegral a ha]\n\n/-- In polar coordinates the disk integrand `p.1 • 1_D (a - |q|^2)^2 φ(q.1) φ(q.2)` at\n`q = polarCoord.symm p` is the radial function `1_{r^2 ≤ a} r (a - r^2)^2 (2π)⁻¹ exp (-r^2/2)` of\n`p.1` times the constant `1` of `p.2` (`rl_pdf_mul`, `cos^2 + sin^2 = 1`). -/\ntheorem cm_polar_integrand (a : ℝ) (p : ℝ × ℝ) :\n p.1 • Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}\n (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2 *\n (gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2)) (polarCoord.symm p) =\n Set.indicator {r : ℝ | r ^ 2 ≤ a}\n (fun r => r * ((a - r ^ 2) ^ 2 * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2) / 2)))) p.1 *\n (fun" + }, + { + "kind": "theorem", + "unqualified_name": "cm_disk_integral", + "line": 213, + "source_header": "split_ifs <;> simp\n\n/-- The Lebesgue integral over the plane of `1{|q|^2 ≤ a} (a - |q|^2)^2 φ(q.1) φ(q.2)` (`φ` the\nstandard Gaussian density) is `a^2 - 4a + 8 - 8 exp (-a/2)`: polar coordinates\n(`integral_comp_polarCoord_symm`), separation of variables (`setIntegral_prod_mul`), the angular\nintegral `2π` (`rl_angular_integral`) and the radial integral `cm_radial_integral`. -/\ntheorem cm_disk_integral (a : ℝ) (ha : 0 ≤ a) :\n ∫ p, Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}\n (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2 *\n (gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2)) p =\n a ^ 2 - 4 * a + 8" + }, + { + "kind": "theorem", + "unqualified_name": "cm_gauss2_integral", + "line": 252, + "source_header": "_integral]\n field_simp\n\n/-- Under the standard planar Gaussian `gaussianReal 0 1 ⊗ gaussianReal 0 1`, the integral of\n`1{|q|^2 ≤ a} (a - |q|^2)^2` is `a^2 - 4a + 8 - 8 exp (-a/2)`: the product of the two\n`withDensity` laws is `withDensity` of the product density (`prod_withDensity`), the integral\nagainst it is the Lebesgue integral of the density times the integrand\n(`integral_withDensity_eq_integral_toReal_smul`, `toReal_gaussianPDF`), and `cm_disk_integral`. -/\ntheorem cm_gauss2_integral (a : ℝ) (ha : 0 ≤ a) :\n ∫ p, Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a} (fun q => (a - q.1 ^ 2 - q.2 ^ 2) ^ 2) p\n ∂((gaussianReal 0 1).prod (gaussianReal 0 1)) =\n a ^ 2 - 4 * a +" + }, + { + "kind": "theorem", + "unqualified_name": "cm_integrable_pow_four", + "line": 275, + "source_header": "mul]\n split_ifs <;> ring\n\n/-! ## `cm_` (c): the bracket `t^4 - 4t^2 + 8 - 8 exp (-t^2/2)` under `N(0, 5/3)` -/\n\n/-- `t ↦ t^4` is integrable against `gaussianReal 0 v` (`memLp_id_gaussianReal'` at `p = 4`,\n`MemLp.integrable_norm_pow`, `|t|^4 = t^4`). -/\ntheorem cm_integrable_pow_four (v : NNReal) :\n Integrable (fun t : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "cm_integrable_exp", + "line": 287, + "source_header": "bs_of_nonneg (by positivity)]\n\n/-- `t ↦ exp (-t^2/2)` is integrable against `gaussianReal 0 v`: measurable and bounded by `1`\nunder a probability measure (`Integrable.mono'`). -/\ntheorem cm_integrable_exp (v : NNReal) :\n Integrable (fun t : ℝ => Real.exp (-(" + }, + { + "kind": "theorem", + "unqualified_name": "cm_integrable_bracket", + "line": 297, + "source_header": "t ^ 2 := sq_nonneg t\n linarith\n\n/-- The bracket `t^4 - 4t^2 + 8 - 8 exp (-t^2/2)` is integrable against `gaussianReal 0 v`\n(sums and scalar multiples of integrable functions). -/\ntheorem cm_integrable_bracket (v : NNReal) :\n Integrable (fun t : ℝ => t ^ 4 - 4 * t ^ 2 + 8 - 8 * Real.exp (-(t ^" + }, + { + "kind": "theorem", + "unqualified_name": "cm_integral_bracket", + "line": 305, + "source_header": "m_integrable_exp v).const_mul 8))\n\n/-- The integral of the bracket against `gaussianReal 0 (5/3)` is\n`25/3 - 20/3 + 8 - 8 sqrt (3/8)`: linearity, then the moments `∫ t^4 = 3 (5/3)^2`\n(`tm_fourth_moment`), `∫ t^2 = 5/3` (`c1_second_moment_gaussianReal`) and\n`∫ exp (-t^2/2) = sqrt (3/8)` (`tm_exp_moment`). -/\ntheorem cm_integral_bracket :\n ∫ t, (t ^ 4 - 4 * t ^ 2 + 8 - 8 * Real.exp (-(t ^ 2) / 2)) ∂(gaussianReal 0 (5 / 3 : NNReal)) =\n 25 / 3 -" + }, + { + "kind": "theorem", + "unqualified_name": "cm_setIntegral_Iio_even", + "line": 330, + "source_header": "l, tm_exp_moment]\n simp\n norm_num\n\n/-- For an even, measurable, integrable `h` and `v ≠ 0`, the integral of `1_{Iio 0} h` against\n`gaussianReal 0 v` is half the integral of `h`: the change of variables `t ↦ -t`\n(`gaussianReal_map_neg`, `integral_map`) equates the integrals over `Iio 0` and `Ioi 0`, and\n`integral_add_compl` with `integral_Ici_eq_integral_Ioi` (no atoms) adds them to the whole. -/\ntheorem cm_setIntegral_Iio_even (v : NNReal) (hv : v ≠ 0) (h : ℝ → ℝ) (hm : Measurable h)\n (heven : ∀ t, h (-t) = h t) (hint : Integrable h (gaussianReal 0 v)) :\n ∫ t, Set.indicator (Set.Iio 0) h t ∂(gaussianReal 0 v) =\n (" + }, + { + "kind": "theorem", + "unqualified_name": "cm_coneIntegrand_eq", + "line": 359, + "source_header": "dicator measurableSet_Iio]\n linarith\n\n/-! ## `cm_` (d): the cone integrand on the product space -/\n\n/-- `coneIntegrand q` is the indicator of `{q.1 < 0 ∧ q.2.1^2 + q.2.2^2 < q.1^2}` applied to\n`(q.1^2 - q.2.1^2 - q.2.2^2)^2` (`cm_cone_iff`, `cm_det_transverse`). -/\ntheorem cm_coneIntegrand_eq (q : ℝ × ℝ × ℝ) :\n coneIntegrand q = Set.indicator {q : ℝ × ℝ × ℝ | q.1 < 0 ∧ q.2.1 ^ 2 + q.2.2 ^ 2 < q.1 ^ 2}\n (fun q =>" + }, + { + "kind": "theorem", + "unqualified_name": "cm_measurable_coneIntegrand", + "line": 369, + "source_header": "fPred_eq, cm_cone_iff, cm_det_transverse]\n\n/-- `coneIntegrand` is measurable: by `cm_coneIntegrand_eq` it is a polynomial times the\nindicator of a measurable set (`measurableSet_lt`, `Measurable.indicator`). -/\ntheorem cm_measurab" + }, + { + "kind": "theorem", + "unqualified_name": "cm_coneIntegrand_bound", + "line": 382, + "source_header": "rable.indicator (by fun_prop) (h1.inter h2)\n\n/-- `|coneIntegrand q| ≤ q.1^4`: inside the cone `0 ≤ q.1^2 - q.2.1^2 - q.2.2^2 ≤ q.1^2`,\noutside it the integrand is `0`. -/\ntheorem cm_coneIntegrand_bound" + }, + { + "kind": "theorem", + "unqualified_name": "cm_integrable_coneIntegrand", + "line": 399, + "source_header": "< q.1 ^ 2} from h), norm_zero]\n positivity\n\n/-- `coneIntegrand` is integrable against `N(0, 5/3) ⊗ (N(0, 1) ⊗ N(0, 1))`: it is dominated by\n`q ↦ q.1^4`, integrable as a function of the first coordinate (`cm_integrable_pow_four`,\n`Integrable.comp_fst`, `Integrable.mono'`). -/\ntheorem cm_integrable_coneIntegrand :\n Integrable coneIntegrand ((gaussianReal 0 (5 / 3 : NNReal)).prod" + }, + { + "kind": "theorem", + "unqualified_name": "cm_coneIntegrand_neg", + "line": 409, + "source_header": "er.Eventually.of_forall cm_coneIntegrand_bound)\n\n/-- For `s < 0` the slice `p ↦ coneIntegrand (s, p)` is the closed-disk integrand\n`1{|p|^2 ≤ s^2} (s^2 - |p|^2)^2` (on the circle `|p|^2 = s^2` both sides vanish). -/\ntheorem cm_coneIntegrand_neg (s : ℝ) (p : ℝ × ℝ) (hs : s < 0) :\n coneIntegrand (s, p) = Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ s ^ 2}" + }, + { + "kind": "theorem", + "unqualified_name": "cm_coneIntegrand_nonneg", + "line": 425, + "source_header": ":= by linarith\n rw [he']\n norm_num\n · rfl\n\n/-- For `s ≥ 0` the slice `p ↦ coneIntegrand (s, p)` vanishes (the cone needs `s < 0`). -/\ntheorem cm_coneIntegrand_nonneg (s : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "cm_inner", + "line": 432, + "source_header": "y [Set.mem_ofPred_eq, not_and]\n intro h\n linarith\n\n/-- The inner integral: `∫ coneIntegrand (s, ·) d(N(0, 1) ⊗ N(0, 1))` is\n`1_{Iio 0}(s) (s^4 - 4s^2 + 8 - 8 exp (-s^2/2))` (`cm_coneIntegrand_neg` with\n`cm_gauss2_integral` at `a = s^2`, and `cm_coneIntegrand_nonneg`). -/\ntheorem cm_inner (s : ℝ) :\n ∫ p, coneIntegrand (s, p) ∂((gaussianReal 0 1).prod (gaussianReal 0 1)) =\n Set.indicator (Set.Iio 0)\n (fun t : ℝ => t" + }, + { + "kind": "theorem", + "unqualified_name": "coneMomentD2Identity", + "line": 452, + "source_header": "Integrand_nonneg s p hs))).trans ?_\n simp\n\nend Aux\n\n/-! ## The `m = 2` cone moment identity for every inhabitant of the interface -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ConeMomentD2Identity` (claim `side24-coefficient`), for every inhabitant `I : ConeMomentInterface`.\nMethod: transport along the law field `I.sxy_law` (`integral_map` after `Side24Interfaces.Aux.tm_aemeasurable_triple`), Fubini (`integral_prod`, with integrability from the bound `|coneIntegrand q| ≤ q.1^4`, `Aux.cm_integrable_coneIntegrand`), the cone identification `NegDefCone (s, x, y) ↔ s < 0 ∧ x^2 + y^2 < s^2` and `det A = s^2 - x^2 - y^2` (`Aux.cm_cone_iff`, `Aux.cm_det_transverse`), the inner planar Gaussian integral `s^4 - 4s^2 + 8 - 8 exp (-s^2/2)` for `s < 0` and `0` for `s ≥ 0` (`Aux.cm_inner`: `prod_withDensity`, polar coordinates `integral_comp_polarCoord_symm`, the substitution `z = r^2` onto `Side24Elementary.elementaryConeIntegral`), the symmetry halving of the even bracket under `gaussianReal 0 (5/3)` (`Aux.cm_setIntegral_Iio_even`), and the moments `25/3`, `5/3`, `sqrt (3/8)` (`Aux.cm_integral_bracket`, from `Side24Interfaces.Aux.tm_fourth_moment`, `c1_second_moment_gaussianReal`, `tm_exp_moment`).\nDoes not establish: the informal identity `D_2 = E[det(A)^2 1{A<0}] = (1/2)[25/3 - 20/3 + 8 - 8 sqrt(3/8)]` of the source as the source's object (the alignment of `ConeMomentInterface`, `transverseMatrix`, `NegDefCone`, `coneIntegrand` and `gaussianReal` with the source's objects is PENDING_INDEPENDENT_REVIEW); the source's Rayleigh integration route or its reduction of the cone to `s < -R` as the source's statements (the helper `Aux.cm_cone_iff` characterises the formal `NegDefCone` only, and `RayleighSquareLaw` is not used); integrability of the sample-space integrand under `I.P` as a separate statement (the integral is transported by `integral_map`, which needs only a.e.-measurability); that `D_2` is the parent's cone moment `D_u` of (15.1) for the reference law; that `ConeMomentInterface` has an inhabitant, or that its laws are the conditional law `A | V = 0` of the reference field; the value `29/6 - sqrt 6` (`ConeMomentD2Algebra`, not used here); any enclosure of the coefficient; the disposition of `side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the register, not derived here; nonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/\ntheorem coneMomentD2Identity (I : ConeMomentInt" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Interpolation.lean", + "sha256": "bdfd836ecc96910824e78249a19a12e74b99ac2f352bda1e9d5daa4f93ff03cb", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "f3_exp_one_gt", + "line": 62, + "source_header": "x\n\n/-! ## (F3) The enclosure of `rho_star`\n\n### A 29-decimal enclosure of `e` from the degree-26 Taylor bound -/\n\n/-- `2.71828182845904523536028746620 < e`: the 26-term Taylor sum of `exp 1` minus the tail bound\n`27 / (26! * 26)` of `Real.exp_bound`, evaluated exactly by `norm_num`. -/\ntheorem f3_exp_one_gt : (271828182845904523536028746620 : ℝ) / 10 ^ 29 < Real." + }, + { + "kind": "theorem", + "unqualified_name": "f3_exp_one_lt", + "line": 75, + "source_header": "arith\n\n/-- `e < 2.71828182845904523536028747136`: the 26-term Taylor sum of `exp 1` plus the tail bound\n`27 / (26! * 26)` of `Real.exp_bound`, evaluated exactly by `norm_num`. -/\ntheorem f3_exp_one_lt : Real.exp 1 < (271828182845904523536028747136 : ℝ) /" + }, + { + "kind": "theorem", + "unqualified_name": "f3_exp_xU_ge", + "line": 84, + "source_header": "inarith\n\n/-! ### Degree-16 Taylor enclosures of `exp x_U` and `exp x_L`\n\n`x_U = 1 - 1/rhoStarUpper = -3863004568775331983 / 21136995431224668017` (reduced) and\n`x_L = 1 - 1/rhoStarLower = -15452018275101327933 / 84547981724898672067`, both about `-0.18276`. -/\n\n/-- Lower bound `0.83296775704110158100003160908803 ≤ exp x_U` from `Real.exp_bound` at degree 16. -/\ntheorem f3_exp_xU_ge :\n (83296775704110158100003160908803 : ℝ) / 10 ^ 32 ≤\n Real.exp (-3863004568775331983 / 2113699543" + }, + { + "kind": "theorem", + "unqualified_name": "f3_exp_xL_le", + "line": 101, + "source_header": "linarith\n\n/-- Upper bound `exp x_L ≤ 0.83296775704110158098837919695330` from `Real.exp_bound` at degree 16. -/\ntheorem f3_exp_xL_le :\n Real.exp (-15452018275101327933 / 84547981724898672067) ≤\n (83296775704110158098837919695330 :" + }, + { + "kind": "theorem", + "unqualified_name": "f3_log_lt", + "line": 113, + "source_header": "h1\n linarith\n\n/-! ### The two logarithmic inequalities -/\n\n/-- `log(3e - 2) < 2 + x_U = 3 - 1/rhoStarUpper`: equivalently `3e - 2 < (exp 1)^2 * exp x_U`,\nwith `e` and `exp x_U` replaced by their rational bounds (`norm_num` margin about `1.08e-20`). -/\ntheorem f3_log_lt :\n Real.log (3 * Real.exp 1 - 2) < 2 + (-3863004568775331983 / 21136995" + }, + { + "kind": "theorem", + "unqualified_name": "f3_lt_log", + "line": 136, + "source_header": "rm_num\n linarith\n\n/-- `2 + x_L = 3 - 1/rhoStarLower < log(3e - 2)`: equivalently `(exp 1)^2 * exp x_L < 3e - 2`,\nwith `e` and `exp x_L` replaced by their rational bounds (`norm_num` margin about `7.53e-20`). -/\ntheorem f3_lt_log :\n 2 + (-15452018275101327933 / 84547981724898672067 : ℝ) < Real.log (" + }, + { + "kind": "theorem", + "unqualified_name": "f3_hStar_pos", + "line": 157, + "source_header": "norm_num\n linarith\n\n/-! ### The three conjuncts of (F3) -/\n\n/-- `0 < h_star` written out, from `one_lt_hStar`. -/\ntheorem f3_hStar_pos : (0 : ℝ) < 3 - Real.l" + }, + { + "kind": "theorem", + "unqualified_name": "f3_rhoStar_lt_upper", + "line": 165, + "source_header": "d hStar at h\n linarith\n\n/-- `rho_star < rhoStarUpper`. -/\ntheorem f3_rhoStar_lt_upper" + }, + { + "kind": "theorem", + "unqualified_name": "f3_lower_lt_rhoStar", + "line": 172, + "source_header": "h := f3_log_lt\n linarith\n\n/-- `rhoStarLower < rho_star`. -/\ntheorem f3_lower_lt_rhoSt" + }, + { + "kind": "theorem", + "unqualified_name": "f3_upper_lt_six_sevenths", + "line": 179, + "source_header": "e h := f3_lt_log\n linarith\n\n/-- `rhoStarUpper < 6/7`, a rational inequality. -/\ntheorem f3_upper_lt_six_se" + }, + { + "kind": "def", + "unqualified_name": "cc_wOther", + "line": 186, + "source_header": "Upper\n norm_num\n\nopen Finset\n\n/-! ## (F4), (F5) The split of the product weight at one coordinate and separate concavity -/\n\n/-- The weight of `U` over the coordinates other than `i`: `prod_{v in U, v ≠ i} p_v *\nprod_{v notin U, v ≠ i} (1 - p_v)`. -/\nnoncomputable def cc_wOther {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y →" + }, + { + "kind": "theorem", + "unqualified_name": "cc_wOther_nonneg", + "line": 194, + "source_header": "v ∈ (univ \\ U).erase i, (1 - p v)\n\n/-- The reduced weight is nonnegative when every `p_v` lies in `[0, 1]`. -/\ntheorem cc_wOther_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Y) (" + }, + { + "kind": "theorem", + "unqualified_name": "cc_wOther_empty_pos", + "line": 201, + "source_header": "un v _ => ?_)\n linarith [(hp v).2]\n\n/-- The reduced weight of the empty set is positive when every `p_v < 1`. -/\ntheorem cc_wOther_empty_pos {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}\n (hp : ∀ v, p" + }, + { + "kind": "theorem", + "unqualified_name": "cc_wOther_erase", + "line": 208, + "source_header": "rod_pos fun v _ => by linarith [hp v]\n\n/-- Erasing the distinguished coordinate does not change the reduced weight. -/\ntheorem cc_wOther_erase {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) (i : Y)\n (U : Finset Y) : cc_w" + }, + { + "kind": "theorem", + "unqualified_name": "cc_prod_split_at", + "line": 219, + "source_header": "univ, true_and]\n tauto\n rw [h1, h2]\n\n/-- A finite product splits off the factor at `i` when `i` belongs to the index set. -/\ntheorem cc_prod_split_at {Y : Type} [DecidableEq Y] (s : Finset Y) (f : Y → ℝ) (i : Y) :\n ∏ v ∈ s, f v = (if i ∈" + }, + { + "kind": "theorem", + "unqualified_name": "cc_weight_update", + "line": 226, + "source_header": "h, one_mul, Finset.erase_eq_of_notMem h]\n\n/-- The weight of `U` under `p` with coordinate `i` replaced by `x`: the factor at `i` is\n`x` or `1 - x` according to `i ∈ U`, times the reduced weight. -/\ntheorem cc_weight_update {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) (i : Y) (x : ℝ)\n (U : Finset Y) :\n weight (Function.update p i x) U = (if" + }, + { + "kind": "theorem", + "unqualified_name": "cc_muOf_update", + "line": 249, + "source_header": "ite_eq_left hi', ite_eq_right hi]\n ring\n\n/-- Display (F4): the split of `mu_p(A)` at coordinate `i`, for any family `A` (general finite\nground type). -/\ntheorem cc_muOf_update {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))\n (p : Y → ℝ) (i : Y) (x : ℝ) :\n muOf A (Function.update p i x) =\n x * ∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i U\n + (1 - x) * ∑ U" + }, + { + "kind": "theorem", + "unqualified_name": "cc_sum_in_le_sum_out", + "line": 260, + "source_header": "nset.sum_ite, Finset.mul_sum, Finset.mul_sum]\n\n/-- For a downset, the sum over the members containing `i` is at most the sum over the members\navoiding `i` (`U ↦ U.erase i` injects the first into the second and preserves `cc_wOther`). -/\ntheorem cc_sum_in_le_sum_out {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p : Y → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Y) :\n ∑ U ∈ A.filter (fun U => i ∈ U), cc_wOther p i U\n ≤ ∑" + }, + { + "kind": "theorem", + "unqualified_name": "cc_sum_out_pos", + "line": 288, + "source_header": "neg himg (fun U _ _ => cc_wOther_nonneg hp i U)\n\n/-- The sum over the members avoiding `i` is positive once `∅ ∈ A` and every `p_v < 1`. -/\ntheorem cc_sum_out_pos {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (h0 : ∅ ∈ A) {p : Y → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v < 1) (i : Y) :\n 0 <" + }, + { + "kind": "theorem", + "unqualified_name": "cc_muOf_update_antitone", + "line": 298, + "source_header": "e_sum (fun U _ => cc_wOther_nonneg hp1 i U) hmem)\n\n/-- `mu_p(A)` is antitone in each coordinate for a downset and `p` in the cube. -/\ntheorem cc_muOf_update_antitone {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p : Y → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Y) {x y : ℝ} (hxy : x ≤ y) :\n muOf A (Func" + }, + { + "kind": "theorem", + "unqualified_name": "cc_affineExp_pos", + "line": 307, + "source_header": "th [mul_nonneg (sub_nonneg.2 hxy) (sub_nonneg.2 h)]\n\n/-! ### The one-variable function `s ↦ -log(a + b exp(-s))` (display (F5)) -/\n\n/-- `a + b exp(-s) > 0` for `a, b ≥ 0` with `a + b > 0`. -/\ntheorem cc_affineExp_pos {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (h" + }, + { + "kind": "theorem", + "unqualified_name": "cc_hasDerivAt_negLog", + "line": 320, + "source_header": ":= by linarith\n have := mul_pos hb' he\n linarith\n\n/-- First derivative: `d/ds (-log(a + b e^{-s})) = b e^{-s} / (a + b e^{-s})`. -/\ntheorem cc_hasDerivAt_negLog {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : 0 < a + b) (s : ℝ) :\n HasDerivAt (fun x => -Real.log (a + b * Real.exp (-x" + }, + { + "kind": "theorem", + "unqualified_name": "cc_hasDerivAt_ratio", + "line": 330, + "source_header": ":= (h1.log hpos.ne').neg\n exact h2.congr_deriv (by ring)\n\n/-- Second derivative: `d/ds (b e^{-s} / (a + b e^{-s})) = -a b e^{-s} / (a + b e^{-s})^2`. -/\ntheorem cc_hasDerivAt_ratio {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : 0 < a + b) (s : ℝ) :\n HasDerivAt (fun x => b * Real.exp (-x) / (a + b * Real.exp (-x)))" + }, + { + "kind": "theorem", + "unqualified_name": "cc_concaveOn_negLog", + "line": 342, + "source_header": "h := hnum.div hden hpos.ne'\n exact h.congr_deriv (by ring)\n\n/-- Display (F5), one variable: `s ↦ -log(a + b exp(-s))` is concave on `[0, 1]` for\n`a, b ≥ 0`, `a + b > 0` (`concaveOn_of_deriv2_nonpos`). -/\ntheorem cc_concaveOn_negLog {a b : ℝ} (ha : 0 ≤ a) (hb : 0 ≤ b) (hab : 0 < a + b) :\n ConcaveOn ℝ (Se" + }, + { + "kind": "theorem", + "unqualified_name": "cc_hazardCoord_update_eq", + "line": 365, + "source_header": "b) (Real.exp_pos _).le\n linarith\n · exact sq_nonneg _\n\n/-! ### Assembly of (F5) -/\n\n/-- `F_A(t[i := s])` is `-log mu(A)` at `p(t)` with coordinate `i` replaced by `1 - exp(-s)`. -/\ntheorem cc_hazardCoord_update_eq {Y : Type} [Fintype Y] [DecidableEq Y]\n (A : Finset (Finset Y)) (t : Y → ℝ) (i : Y) (s : ℝ) :\n hazardCoord A (Function.update t i s) =\n -Real.log (muOf A (Function.upda" + }, + { + "kind": "theorem", + "unqualified_name": "cc_concaveOn_hazardCoord_update", + "line": 383, + "source_header": "rw [Function.update_of_ne hj, Function.update_of_ne hj]\n rw [h]\n\n/-- Display (F5) on a general finite ground type: for a downset containing `∅` and `t` in the\ncube, `s ↦ F_A(t[i := s])` is concave on `[0, 1]`. -/\ntheorem cc_concaveOn_hazardCoord_update {Y : Type} [Fintype Y] [DecidableEq Y]\n {A : Finset (Finset Y)} (h0 : ∅ ∈ A) (hdown : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A)\n (i : Y) (t : Y → ℝ) (ht : ∀ j, 0 ≤ t j ∧ t j ≤ 1) :\n ConcaveOn ℝ (Set." + }, + { + "kind": "theorem", + "unqualified_name": "f6_muOf_le_one", + "line": 416, + "source_header": "exact cc_concaveOn_negLog hSin0 (sub_nonneg.2 hle) (by linarith)\n\n/-! ## (F6) The hazard product bound `F_A(t) ≥ (prod_i t_i) H_A`\n\n### Elementary bounds on `mu_p(A)` and on the hazard `F_A` -/\n\n/-- `mu_p(A) ≤ 1` for `p` in the cube: `A ⊆ univ.powerset`, the weights are nonnegative\n(`weight_nonneg`) and all of them sum to one (`sum_weight_eq_one`). -/\ntheorem f6_muOf_le_one {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (" + }, + { + "kind": "theorem", + "unqualified_name": "f6_muOf_nonneg", + "line": 430, + "source_header": "(fun U _ _ => UniversalLaw.Proofs.P15Budget.Aux.weight_nonneg hp U)\n\n/-- `0 ≤ mu_p(A)` for `p` in the cube. -/\ntheorem f6_muOf_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset" + }, + { + "kind": "theorem", + "unqualified_name": "f6_one_sub_exp_neg_mem", + "line": 435, + "source_header": "um_nonneg fun U _ => UniversalLaw.Proofs.P15Budget.Aux.weight_nonneg hp U\n\n/-- `1 - exp(-u) ∈ [0, 1]` for `u ∈ [0, 1]` (indeed for every `u ≥ 0`). -/\ntheorem f6_one_sub_exp_neg_mem {u :" + }, + { + "kind": "theorem", + "unqualified_name": "f6_coords_mem", + "line": 444, + "source_header": "linarith [hu.1])\n linarith\n · have h := Real.exp_pos (-u)\n linarith\n\n/-- The coordinates `p_j(u) = 1 - exp(-u_j)` lie in the cube when `u` does. -/\ntheorem f6_coords_mem {Y : Type} {u : Y → ℝ} (hu : ∀ j, 0" + }, + { + "kind": "theorem", + "unqualified_name": "f6_hazardCoord_nonneg", + "line": 449, + "source_header": "(-u v) ∧ 1 - Real.exp (-u v) ≤ 1 :=\n fun v => f6_one_sub_exp_neg_mem (hu v)\n\n/-- `0 ≤ F_A(u)` on the cube: `-log m ≥ 0` for `0 ≤ m ≤ 1` (`Real.log_nonpos`; `log 0 = 0`, so\nno positivity of `mu` is needed). -/\ntheorem f6_hazardCoord_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset" + }, + { + "kind": "theorem", + "unqualified_name": "f6_hazardCoord_one", + "line": 458, + "source_header": "ave h := Real.log_nonpos (f6_muOf_nonneg A hp) (f6_muOf_le_one A hp)\n linarith\n\n/-- `F_A(1, …, 1) = H_A`, since `1 - exp(-1) = p_star`. -/\ntheorem f6_hazardCoord_one {Y : Type} [Fintype Y] [DecidableEq" + }, + { + "kind": "theorem", + "unqualified_name": "f6_chord", + "line": 464, + "source_header": "un _ => (1 : ℝ)) = hazardStar A := by\n unfold hazardCoord hazardStar pStar\n rfl\n\n/-! ### The chord inequality and its iteration -/\n\n/-- Chord inequality at one coordinate: if `s ↦ F_A(update u i s)` is concave on `[0, 1]` and\n`u` lies in the cube, then `u_i · F_A(update u i 1) ≤ F_A(u)`. -/\ntheorem f6_chord {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y)) (i : Y)\n (u : Y → ℝ) (hu : ∀ j, 0 ≤ u j ∧ u j ≤ 1)\n (hconc : ConcaveOn ℝ (Set.Icc (0 : ℝ) 1)\n (fun s : ℝ => hazardCoord A (Functio" + }, + { + "kind": "theorem", + "unqualified_name": "f6_raised_mem", + "line": 488, + "source_header": "ne hj]\n exact hu j\n have hprod := mul_nonneg (sub_nonneg.2 hs.2) hf0\n linarith\n\n/-- The vector `u_s` which equals `1` on `s` and `t` elsewhere lies in the cube when `t` does. -/\ntheorem f6_raised_mem {Y : Type} [DecidableEq Y] {t : Y → ℝ} (ht : ∀ j, 0 ≤ t j ∧ t j ≤ 1)\n (s : Finset Y)" + }, + { + "kind": "theorem", + "unqualified_name": "f6_raised_insert", + "line": 497, + "source_header": "t j) ≤ 1 := by\n intro j\n split_ifs\n · exact ⟨zero_le_one, le_refl 1⟩\n · exact ht j\n\n/-- Raising one more coordinate: `u_{insert a s} = update u_s a 1`. -/\ntheorem f6_raised_insert {Y : Type} [DecidableEq Y] (t : Y → ℝ) (a : Y) (s : Finset Y) :\n (fun j => if j ∈ insert a s the" + }, + { + "kind": "theorem", + "unqualified_name": "f6_prod_hazardCoord_le", + "line": 507, + "source_header": "y\n funext j\n by_cases hj : j = a\n · subst hj\n simp\n · simp [Finset.mem_insert, hj]\n\n/-- Iterated chord inequality: for every finite set `s` of coordinates,\n`(prod_{j ∈ s} t_j) · F_A(u_s) ≤ F_A(t)`, where `u_s` is `t` with the coordinates in `s` raised\nto `1`. Induction over `s` (`Finset.induction_on`) with `f6_chord` at each step. -/\ntheorem f6_prod_hazardCoord_le {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))\n (hconc : ∀ (i : Y) (u : Y → ℝ), (∀ j, 0 ≤ u j ∧ u j ≤ 1) →\n ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) (fun s : ℝ => hazardCoord A (Function.update u i s)))\n (t : Y → ℝ) (ht : ∀ j, 0 ≤ t j ∧ t j ≤ 1) (s : Finset Y) :\n (∏ j" + }, + { + "kind": "theorem", + "unqualified_name": "f6_hazardProductBound_of_concavity", + "line": 533, + "source_header": "se t j) :=\n mul_le_mul_of_nonneg_left hchord hprod\n _ ≤ hazardCoord A t := ih\n\n/-- Display (F6) from display (F5): assuming `CoordinatewiseConcavity`, the hazard product bound\nholds. Takes `s = univ` in `f6_prod_hazardCoord_le`, where `u_univ = (1, …, 1)` and\n`F_A(1, …, 1) = H_A` (`f6_hazardCoord_one`). -/\ntheorem f6_hazardProductBound_of_concavity (h5 :" + }, + { + "kind": "theorem", + "unqualified_name": "f7_phi_nonneg", + "line": 550, + "source_header": "n _ => (1 : ℝ) := by\n funext j\n simp\n rw [hfun, f6_hazardCoord_one] at key\n exact key\n\n/-! ## (F7) The hazard `phi` bound `-log mu_p(A) ≥ H_A prod_i phi(p_i)`\n\n### (a) The transformed price `phi` maps `[0,1]` into `[0,1]` -/\n\n/-- `0 ≤ phi x` for `x ≥ 0`: when `x < 1`, `" + }, + { + "kind": "theorem", + "unqualified_name": "f7_phi_le_one", + "line": 563, + "source_header": "log (1 - x) ≤ 0 := Real.log_nonpos (by linarith) (by linarith)\n linarith\n ·" + }, + { + "kind": "theorem", + "unqualified_name": "f7_phi_mem", + "line": 570, + "source_header": "ℝ) : phi x ≤ 1 := by\n unfold phi\n split_ifs with h\n · exact min_le_left _ _\n · exact le_refl 1\n\n/-- `phi`" + }, + { + "kind": "theorem", + "unqualified_name": "f7_one_sub_exp_neg_phi_nonneg", + "line": 574, + "source_header": "i_mem {x : ℝ} (hx : 0 ≤ x ∧ x ≤ 1) : 0 ≤ phi x ∧ phi x ≤ 1 :=\n ⟨f7_phi_nonneg hx.1, f7_phi_le_one x⟩\n\n/-! ### (b) `p' = 1 - exp(-phi p)` lies in `[0, p]` -/\n\n/-- `0 ≤ 1 - exp(-phi x)` for `x ≥ 0` (sinc" + }, + { + "kind": "theorem", + "unqualified_name": "f7_one_sub_exp_neg_phi_le", + "line": 581, + "source_header": "by\n have h : Real.exp (-phi x) ≤ 1 := Real.exp_le_one_iff.2 (by linarith [f7_phi_nonneg hx])\n linarith\n\n/-- `1 - exp(-phi x) ≤ x` on `[0,1]`: for `x < 1`, `phi x ≤ -log(1 - x)` so\n`exp(-phi x) ≥ exp(log(1 - x)) = 1 - x`; for `x = 1`, `1 - exp(" + }, + { + "kind": "theorem", + "unqualified_name": "f7_mix_mem", + "line": 603, + "source_header": "unfold phi\n rw [ite_eq_right h]\n rw [hphi, hx1]\n have := Real.exp_pos (-1 : ℝ)\n linarith\n\n/-! ### (c) Antitonicity of `mu_p(A)` in the probability vector (from the split (F4)) -/\n\n/-- The interpolating vector `r_s` (`q` on `s`, `p` elsewhere) lies in the cube when both do. -/\ntheorem f7_mix_mem {Y : Type} [DecidableEq Y] {p q : Y → ℝ} (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1)\n (hq : ∀ j, 0" + }, + { + "kind": "theorem", + "unqualified_name": "f7_mix_insert", + "line": 614, + "source_header": "then q j else p j) ∧ (if j ∈ s then q j else p j) ≤ 1 := by\n intro j\n split_ifs\n · exact hq j\n · exact hp j\n\n/-- Switching one more coordinate to `q`: `r_{insert a s} = update r_s a (q a)`. -/\ntheorem f7_mix_insert {Y : Type} [DecidableEq Y] (p q : Y → ℝ) (a : Y) (s : Finset Y) :\n (fu" + }, + { + "kind": "theorem", + "unqualified_name": "f7_mix_eq_update_self", + "line": 624, + "source_header": "j else p j) a (q a) := by\n funext j\n by_cases hj : j = a\n · subst hj\n simp\n · simp [Finset.mem_insert, hj]\n\n/-- For `a ∉ s`, `r_s` is its own update at `a` by `p a`. -/\ntheorem f7_mix_eq_update_self {Y : Type} [DecidableEq Y] (p q : Y → ℝ) (a : Y) (s : Finset Y)\n (ha : a ∉ s" + }, + { + "kind": "theorem", + "unqualified_name": "f7_muOf_le_mix", + "line": 635, + "source_header": "if j ∈ s then q j else p j) a (p a) := by\n funext j\n by_cases hj : j = a\n · subst hj\n simp [ha]\n · simp [hj]\n\n/-- Moving from `p` down to `q` one coordinate at a time: for every finite set `s` of\ncoordinates, `mu_p(A) ≤ mu_(r_s)(A)` (induction over `s`, `cc_muOf_update_antitone` at each\nstep). -/\ntheorem f7_muOf_le_mix {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p q : Y → ℝ}\n (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1) (hq : ∀ j, 0 ≤ q" + }, + { + "kind": "theorem", + "unqualified_name": "f7_muOf_antitone", + "line": 652, + "source_header": "(hqp a)\n rw [← f7_mix_eq_update_self p q a s ha] at hstep\n rw [f7_mix_insert p q a s]\n exact ih.trans hstep\n\n/-- Antitonicity of `mu(A)` in the probability vector for a downset: `q ≤ p` pointwise, both in\nthe cube, gives `mu_p(A) ≤ mu_q(A)`. -/\ntheorem f7_muOf_antitone {Y : Type} [Fintype Y] [DecidableEq Y] {A : Finset (Finset Y)}\n (hA : ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A) {p q :" + }, + { + "kind": "theorem", + "unqualified_name": "f7_hazardPhiBound_of_productBound", + "line": 665, + "source_header": ": (fun j : Y => if j ∈ (univ : Finset Y) then q j else p j) = q := by\n funext j\n simp\n rw [hfun] at h\n exact h\n\n/-! ### (d) Display (F7) from display (F6) -/\n\n/-- Display (F7) from display (F6): assuming `HazardProductBound`, the hazard `phi` bound holds.\nWith `t_i := phi(p_i) ∈ [0,1]` and `p'_i := 1 - exp(-t_i) ∈ [0, p_i]`, antitonicity gives\n`0 < mu_p(A) ≤ mu_p'(A)`, so `-log mu_p(A) ≥ -log mu_p'(A) = F_A(t) ≥ (prod_i t_i) H_A`. -/\ntheorem f" + }, + { + "kind": "theorem", + "unqualified_name": "f8_prod_phi_le_one", + "line": 690, + "source_header": ":= mul_comm _ _\n _ ≤ -Real.log (muOf A (fun j => 1 - Real.exp (-phi (p j)))) := h6'\n _ ≤ -Real.log (muOf A p) := hlog\n\n/-! ## (F8) The full-ground price bound -/\n\n/-- `prod_i phi(p_i) ≤ 1` for `p ∈ [0, 1]^n`, from `0 ≤ phi ≤ 1` on `[0, 1]`\n(`Fins" + }, + { + "kind": "theorem", + "unqualified_name": "f8_prod_le_prod_phi", + "line": 698, + "source_header": "p j ≤ 1) :\n ∏ i, phi (p i) ≤ 1 :=\n Finset.prod_le_one₀ (fun i _ => f7_phi_nonneg (hp i).1) (fun i _ => f7_phi_le_one (p i))\n\n/-- `prod_i c_i ≤ prod_i phi(p_i)` for `0 ≤ c_i ≤ phi(p_i)` (`Finset.prod_le_prod₀`" + }, + { + "kind": "theorem", + "unqualified_name": "f8_fullGroundPriceBound_of_phiBound", + "line": 703, + "source_header": "0 ≤ c j ∧ c j ≤ phi (p j)) :\n ∏ i, c i ≤ ∏ i, phi (p i) :=\n Finset.prod_le_prod₀ (fun i _ => (hc i).1) (fun i _ => (hc i).2)\n\n/-- Display (F8) from display (F7): given `HazardPhiBound`, the full-ground price bound holds.\nFix `n`, a proper downset `A` on `Fin n`, `p ∈ [0, 1]^n` and `0 ≤ c ≤ phi ∘ p`. The cap `1` is\n`f8_prod_le_prod_phi` and `f8_prod_phi_le_one`; when `0 < mu_p(A)`, (F7) gives\n`H_A prod_i phi(p_i) ≤ -log mu_p(A)` and `0 < H_A` (`P15Elementary.hazardStarPositive`), so\n`prod_i phi(p_i) = H_A⁻¹ (H_A prod_i phi(p_i)) ≤ H_A⁻¹ [-log mu_p(A)]` (`inv_mul_cancel_left₀`,\n`mul_le_mul_of_nonneg_left`); `P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard. -/\ntheor" + }, + { + "kind": "theorem", + "unqualified_name": "bi_prod_phi_nonneg", + "line": 725, + "source_header": ":=\n mul_le_mul_of_nonneg_left h7' (inv_nonneg.mpr hH.le)\n _ = 1 / hazardStar A * -Real.log (muOf A p) := by rw [one_div]\n\n/-! ## (F8), exactness remark: the full-ground budget equivalence -/\n\n/-- `0 ≤ prod_i phi(p_i)` for `p ∈ [0, 1]^" + }, + { + "kind": "theorem", + "unqualified_name": "bi_budget_of_one_le_hazardStar", + "line": 732, + "source_header": "n : ℕ} (p : Fin n → ℝ) (hp : ∀ j, 0 ≤ p j ∧ p j ≤ 1) :\n 0 ≤ ∏ i, phi (p i) :=\n Finset.prod_nonneg fun i _ => f7_phi_nonneg (hp i).1\n\n/-- The (⇐) direction, display (F8) with `rho = 1`: given display (F7) and `1 ≤ H_A`, every\n`p ∈ [0, 1]^n` and `0 ≤ c ≤ phi ∘ p` satisfy `prod_i c_i ≤ cappedHazard 1 (mu_p(A))`. The cap\n`1` is `f8_prod_le_prod_phi` and `f8_prod_phi_le_one`; when `0 < mu_p(A)`,\n`prod_i phi(p_i) ≤ H_A prod_i phi(p_i)` (`le_mul_of_one_le_left`, from `0 ≤ prod_i phi(p_i)`\nand `1 ≤ H_A`) and `H_A prod_i phi(p_i) ≤ -log mu_p(A)` by (F7);\n`P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard. -/\ntheorem bi_budget_of_one_le_hazardStar (h7 : UniversalLaw.Spec.P15.HazardPhiBound) {n : ℕ}\n {A : Finset (Finset (Fin n))} (hn : 1 ≤ n) (hA : IsProperDownset A)\n (h1 : 1 ≤ hazardSta" + }, + { + "kind": "theorem", + "unqualified_name": "bi_muOf_pStar_pos", + "line": 753, + "source_header": "∏ i, phi (p i) := le_mul_of_one_le_left hphi0 h1\n _ ≤ -Real.log (muOf A p) := h7'\n _ = 1 * -Real.log (muOf A p) := (one_mul _).symm\n\n/-- `0 < mu_{p_star}(A)` for a proper downset `A`: every weight at the constant vector\n`p_star ∈ (0, 1)` is nonnegative (`P15Budget.Aux.weight_nonneg`), and the member `∅ ∈ A`\ncontributes `prod_{v} (1 - p_star) > 0` (`Finset.prod_pos`), so `Finset.single_le_sum` giv" + }, + { + "kind": "theorem", + "unqualified_name": "bi_one_le_hazardStar_of_budget", + "line": 772, + "source_header": "show (0 : ℝ) < 1 - pStar\n linarith\n unfold muOf\n exact lt_of_lt_of_le hempty_w (Finset.single_le_sum (fun U _ => hw_nonneg U) hA.1)\n\n/-- The (⇒) direction: if every `p ∈ [0, 1]^n` and `0 ≤ c ≤ phi ∘ p` satisfy\n`prod_i c_i ≤ cappedHazard 1 (mu_p(A))`, then `1 ≤ H_A`. Instantiate at `p ≡ p_star`, `c ≡ 1`,\nadmissible since `0 ≤ p_star ≤ 1` and `phi p_star = 1` (`P15Elementary.phiAtPStar`); then\n`prod_i 1 = 1` (`Finset.prod_const_one`), `0 < mu_{p_star}(A)` (`bi_muOf_pStar_pos`) selects\nthe branch `min 1 (1 * -log mu_{p_star}(A))` of `cappedHazard`, and `le_min_iff` extracts\n`1 ≤ -log mu_{p_star}(A)`, which is `hazardStar A` by definition. -/\ntheorem bi_one_le_hazardStar_of_budget {n : ℕ} {A : Finset (Finset (Fin n))}\n (hA : IsProperDownset A)\n (hall : ∀ (p c :" + }, + { + "kind": "theorem", + "unqualified_name": "bi_fullGroundBudgetIff_of_phiBound", + "line": 799, + "source_header": ":= bi_muOf_pStar_pos hA\n unfold cappedHazard at h\n simp only [hm, ↓reduceIte, one_mul] at h\n unfold hazardStar\n exact (le_min_iff.1 h).2\n\n/-- The budget equivalence from display (F7): given `HazardPhiBound`, for `n ≥ 1` and a proper\ndownset `A` on `Fin n`, the universal capped budget at `rho = 1` holds iff `1 ≤ H_A`. The two\ndirections are `bi_one_le_hazardStar_of_budget` and `bi_budget_of_one_le_hazardS" + }, + { + "kind": "theorem", + "unqualified_name": "lp_capacityFamily_properDownset", + "line": 811, + "source_header": "tro hall\n exact bi_one_le_hazardStar_of_budget hA hall\n · intro h1 p c hp hc\n exact bi_budget_of_one_le_hazardStar h7 hn hA h1 p c hp hc\n\n/-! ## (F12) The local price bound\n\n### Elementary facts -/\n\n/-- The capacity family `{T ⊆ Fin n : |T| ≤ a}` is a proper downset when `a < n`: it contains\nthe empty set, misses `univ` (of size `n > a" + }, + { + "kind": "theorem", + "unqualified_name": "lp_exists_enum", + "line": 831, + "source_header": "hVU\n have hU' : U.card ≤ a := (mem_filter.mp hU).2\n exact mem_filter.mpr ⟨mem_powerset.mpr (subset_univ V), le_trans (card_le_card hVU) hU'⟩\n\n/-! ### Enumerating a finite set by `Fin (card)` -/\n\n/-- Every `B : Finset X` is enumerated injectively by `Fin B.card`, w" + }, + { + "kind": "theorem", + "unqualified_name": "lp_map_univ_eq", + "line": 846, + "source_header": "ype.ext h)\n · intro v\n constructor\n · intro hv\n exact ⟨B.equivFin ⟨v, hv⟩, by simp⟩\n · rintro ⟨k, rfl⟩\n exact (B.equivFin.symm k).2\n\n/-- An injection `e : Fin n → X` with range `B` maps `univ` onto `B`. -/\ntheorem lp_map_univ_eq {X : Type}" + }, + { + "kind": "theorem", + "unqualified_name": "lp_prod_univ_eq", + "line": 854, + "source_header": "k = v) :\n (univ : Finset (Fin n)).map ⟨e, he⟩ = B := by\n ext v\n rw [hrange v]\n simp only [mem_map, mem_univ, true_and, Function.Embedding.coeFn_mk]\n\n/-- Products over `B` are products over `Fin n` along the enumeration. -/\ntheorem lp_prod_univ_eq {X : Type" + }, + { + "kind": "theorem", + "unqualified_name": "lp_map_filter_eq", + "line": 861, + "source_header": "tive e) (hrange : ∀ v, v ∈ B ↔ ∃ k, e k = v) (f : X → ℝ) :\n ∏ k, f (e k) = ∏ v ∈ B, f v := by\n rw [← lp_map_univ_eq e he hrange, Finset.prod_map]\n rfl\n\n/-- For `S ⊆ B`, the image of the preimage `{k : e k ∈ S}` is `S`. -/\ntheorem lp_map_filter_eq {X : Type} [DecidableEq X] {B : Finset X} {n : ℕ} (e : Fin n → X)\n (he : Functio" + }, + { + "kind": "theorem", + "unqualified_name": "lp_filter_map_eq", + "line": 875, + "source_header": "ction.Embedding.coeFn_mk]\n constructor\n · rintro ⟨k, hk, rfl⟩\n exact hk\n · intro hv\n obtain ⟨k, rfl⟩ := (hrange v).mp (hS hv)\n exact ⟨k, hv, rfl⟩\n\n/-- The preimage of the image of `T` is `T` (injectivity of the enumeration). -/\ntheorem lp_filter_map_eq {X : Type} [Deci" + }, + { + "kind": "theorem", + "unqualified_name": "lp_localGood_eq_muOf", + "line": 887, + "source_header": "ter, mem_univ, true_and, mem_map, Function.Embedding.coeFn_mk]\n constructor\n · rintro ⟨a, ha, hak⟩\n rwa [he hak] at ha\n · intro hk\n exact ⟨k, hk, rfl⟩\n\n/-! ### Transport of the local good probability to the capacity family -/\n\n/-- Along an enumeration `e : Fin n → X` of the block `X_i`, the local good probability\n`mu_p(D_i)` is the product measure of the capacity family `{T : |T| ≤ a_i}` on `Fin n` under\nthe transported vector `p ∘ e`. Uses `LocalRestriction` (a block subset is good iff its size is\nat most `a_i`) and the bijection `T ↦ T.map e` between subsets of `Fin n` and subsets of the\nblock, which preserves size and matches the two weight products. -/\ntheorem lp_localGood_eq_muOf {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) (p : X → ℝ) (i : Fin F.b) {n : ℕ} (e :" + }, + { + "kind": "theorem", + "unqualified_name": "lp_localPriceBoundFull_of_phiBound", + "line": 943, + "source_header": ".map ⟨e, he⟩, p v) * ∏ v ∈ block F i \\ T.map ⟨e, he⟩, (1 - p v)\n unfold weight\n rw [Finset.prod_map, ← hmapuniv, ← Finset.map_sdiff, Finset.prod_map]\n rfl\n\n/-! ### Display (F12) in hypothesis form -/\n\n/-- Display (F12) under the hypothesis `HazardPhiBound` (display (F7)): for every realized\nfamily with `d_i ≥ 2`, every `p ∈ [0,1]^X`, every `0 ≤ c_v ≤ phi(p_v)` and every block with\n`mu_p(D_i) > 0`, `price(X_i) ≤ rho_star · (-log mu_p(D_i))` and `price(X_i) ≤ 1`. -/\ntheorem lp_localPriceBoundFull_of" + }, + { + "kind": "theorem", + "unqualified_name": "f2_rhoStar_nonneg", + "line": 1004, + "source_header": "od]\n _ ≤ -Real.log (localGood F p i) := h7'\n have hrho : rhoStar = 1 / hStar := rfl\n rw [hrho, one_div, inv_mul_eq_div, le_div_iff₀ hhpos, mul_comm]\n exact key\n\n/-! ## (F2) The full transformed-price budget -/\n\n/-- `0 ≤ rh" + }, + { + "kind": "theorem", + "unqualified_name": "f2_fullTransformedPriceBudget_of_local", + "line": 1014, + "source_header": "ave h : (1 : ℝ) < 3 - Real.log (3 * Real.exp 1 - 2) :=\n UniversalLaw.Proofs.P15Elementary.Aux.one_lt_hStar\n unfold rhoStar\n exact div_nonneg zero_le_one (by linarith)\n\n/-- Display (F2) from display (F12): given the local price bound for every realized family, the\nfull transformed-price budget holds for every realized family. The hypothesis `h12` is the\nregistered `Prop` `LocalPriceBoundFull`, quantified over the ground type so that it can be\ndischarged by the inventory theorem `localPriceBoundFull`. -/\ntheorem f2_fullTransformedPriceBudget_of_local\n (h12 : ∀ {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)" + }, + { + "kind": "theorem", + "unqualified_name": "rhoStarEnclosure", + "line": 1044, + "source_header": "-Real.log (mu F p) :=\n mul_le_mul_of_nonneg_left\n ((UniversalLaw.Proofs.P15Hazard.globalAssemblyHazard F hF p hp).2 hmu)\n f2_rhoStar_nonneg\n\nend Aux\n\n/-! ## Inventory theorems\n\nEach theorem below has as its type exactly one registered `Prop`; the chain is\n`coordinatewiseConcavity → hazardProductBound → hazardPhiBound → fullGroundPriceBound,\nfullGroundBudgetIff, localPriceBoundFull → fullTransformedPriceBudget`, and `rhoStarEnclosure`\nis independent of it. -/\n\n/-- Proves: `UniversalLaw.Spec.P15.RhoStarEnclosure` (claim `p15-full-price`, display (F3)).\nMethod: `rho_star < U` iff `3e - 2 < exp(3 - 1/U)` and `L < rho_star` iff `exp(3 - 1/L) < 3e - 2`\n(`Real.log_lt_iff_lt_exp`, `Real.lt_log_iff_exp_lt`, `div_lt_iff₀`, `lt_div_iff₀`); with\n`3 - 1/U = 2 + x_U`, `exp(3 - 1/U) = (exp 1)^2 * exp x_U` (`Real.exp_add`, `exp_two_eq`), and\n`Real.exp_bound` at degree 26 for `e` and degree 16 for `exp x_U`, `exp x_L` gives exact rational\nenclosures (`Aux.f3_exp_one_gt/lt`, `Aux.f3_exp_xU_ge`, `Aux.f3_exp_xL_le`) that `norm_num`\ncompares in `Aux.f3_log_lt`, `Aux.f3_lt_log`; `rhoStarUpper < 6/7` is `norm_num` on rationals.\nDoes not establish: the informal display (F3) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); the source's `full_price.py`\nFraction procedure (not specified and not reproduced here: the route above is a different\ncertificate of the same enclosure), nor any change to the `specified` status that main's\n`docs/FORMAL_VERIFICATION_ROLLOUT_20260927.md` records f" + }, + { + "kind": "theorem", + "unqualified_name": "coordinatewiseConcavity", + "line": 1068, + "source_header": "ersalLaw.Spec.P15.RhoStarEnclosure := by\n unfold UniversalLaw.Spec.P15.RhoStarEnclosure\n exact ⟨Aux.f3_lower_lt_rhoStar, Aux.f3_rhoStar_lt_upper, Aux.f3_upper_lt_six_sevenths⟩\n\n/-- Proves: `UniversalLaw.Spec.P15.CoordinatewiseConcavity` (claim `p15-full-price`, display (F5)).\nMethod: split `mu_p(A)` at the coordinate `i` (display (F4), `Aux.cc_muOf_update`): with\n`p_i = 1 - exp(-s)` it equals `S_in + (S_out - S_in) exp(-s)`, where `0 ≤ S_in ≤ S_out` for a\ndownset (`Aux.cc_sum_in_le_sum_out`, the injection `U ↦ U.erase i`) and `S_out > 0` since `∅ ∈ A`\nand every `p_j(t) < 1` on the cube (`Aux.cc_sum_out_pos`); then `s ↦ -log(a + b exp(-s))` with\n`a, b ≥ 0`, `a + b > 0` is concave by `concaveOn_of_deriv2_nonpos`, its second derivative being\n`-a b exp(-s) / (a + b exp(-s))^2 ≤ 0` (`Aux.cc_concaveOn_negLog`, via `HasDerivAt.log`,\n`HasDerivAt.div`, `HasDerivAt.deriv`).\nDoes not establish: the informal display (F5) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); joint concavity, or the derivative\nformulas (F4)-(F5) themselves as registered statements (not specified; concavity is their\nconsequenc" + }, + { + "kind": "theorem", + "unqualified_name": "hazardProductBound", + "line": 1086, + "source_header": "seConcavity : UniversalLaw.Spec.P15.CoordinatewiseConcavity := by\n intro n A _ hA i t ht\n obtain ⟨h0, -, hdown⟩ := hA\n exact Aux.cc_concaveOn_hazardCoord_update h0 hdown i t ht\n\n/-- Proves: `UniversalLaw.Spec.P15.HazardProductBound` (claim `p15-full-price`, display (F6)).\nMethod: chord inequality of the separate coordinatewise concavity `coordinatewiseConcavity`\n(display (F5)) on `[0,1]`: `f(s) ≥ (1-s) f(0) + s f(1) ≥ s f(1)` since `f(0) = -log mu ≥ 0`\n(`Aux.f6_hazardCoord_nonneg`, from `mu_p(A) ≤ 1` by `sum_weight_eq_one` and `weight_nonneg`);\niterate over the coordinates with `Finset.induction_on` (`Aux.f6_prod_hazardCoord_le`), raising\none coordinate to `1` at each step (`Aux.f6_chord`), and identify `F_A(1, …, 1) = H_A`\n(`Aux.f6_hazardCoord_one`, since `1 - exp(-1) = p_star`).\nDoes not establish: the informal display (F6) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); the inequality as an informal\nstatement (the Prop is s" + }, + { + "kind": "theorem", + "unqualified_name": "hazardPhiBound", + "line": 1100, + "source_header": "ribed in the register, not derived here. -/\ntheorem hazardProductBound : UniversalLaw.Spec.P15.HazardProductBound :=\n Aux.f6_hazardProductBound_of_concavity coordinatewiseConcavity\n\n/-- Proves: `UniversalLaw.Spec.P15.HazardPhiBound` (claim `p15-full-price`, display (F7)).\nMethod: put `t_i := phi(p_i) ∈ [0,1]` (`Aux.f7_phi_mem`) and `p'_i := 1 - exp(-t_i) ∈ [0, p_i]`\n(`Aux.f7_one_sub_exp_neg_phi_le`, from `phi p ≤ -log(1-p)` and `Real.exp_log`); for a downset\n`mu(A)` is antitone in the probability vector (`Aux.f7_muOf_antitone`, built from the\none-coordinate split `Aux.cc_muOf_update` of display (F4) with `S_in ≤ S_out` by\n`Finset.sum_image` along `U ↦ U.erase i`, iterated by `Finset.induction_on`), so\n`0 < mu_p(A) ≤ mu_p'(A)` and `Real.log_le_log` give `-log mu_p(A) ≥ -log mu_p'(A) = F_A(t)`;\ndisplay (F6) `hazardProductBound` then gives `F_A(t) ≥ (prod_i t_i) H_A`, and `mul_comm`\nmatches the Prop's order.\nDoes not establish: the informal display (F7) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); the inequality as an informal\nstatement (the Prop is statement only), nor anything at `mu_p(A) = 0`, where the source reads\nthe inequality as an extended one and" + }, + { + "kind": "theorem", + "unqualified_name": "fullGroundPriceBound", + "line": 1117, + "source_header": "which is transcribed in the register, not derived here. -/\ntheorem hazardPhiBound : UniversalLaw.Spec.P15.HazardPhiBound :=\n Aux.f7_hazardPhiBound_of_productBound hazardProductBound\n\n/-- Proves: `UniversalLaw.Spec.P15.FullGroundPriceBound` (claim `p15-full-price`, display (F8)).\nMethod: `prod_i c_i ≤ prod_i phi(p_i)` for `0 ≤ c_i ≤ phi(p_i)` (`Finset.prod_le_prod₀`) and\n`prod_i phi(p_i) ≤ 1` from `0 ≤ phi ≤ 1` on `[0,1]` (`Finset.prod_le_one₀`, `Real.log_nonpos`)\ngive the cap; when `mu_p(A) > 0`, display (F7), `hazardPhiBound`, gives\n`H_A prod_i phi(p_i) ≤ -log mu_p(A)` and `H_A > 0` (`P15Elementary.hazardStarPositive`), so\n`prod_i phi(p_i) ≤ (1/H_A) [-log mu_p(A)]` (`inv_mul_cancel_left₀`, `mul_le_mul_of_nonneg_left`);\n`P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard.\nDoes not establish: the informal display (F8) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); that the full-ground generator\ncovers any obstruction (the source: \"It does not assert that this generator alone covers an\narbitrary" + }, + { + "kind": "theorem", + "unqualified_name": "fullGroundBudgetIff", + "line": 1132, + "source_header": "s transcribed in the\nregister, not derived here. -/\ntheorem fullGroundPriceBound : UniversalLaw.Spec.P15.FullGroundPriceBound :=\n Aux.f8_fullGroundPriceBound_of_phiBound hazardPhiBound\n\n/-- Proves: `UniversalLaw.Spec.P15.FullGroundBudgetIff` (claim `p15-full-price`, display (F8), the\nexactness remark following it).\nMethod: (⇐) is display (F8) with `rho = 1`: `prod_i c_i ≤ prod_i phi(p_i) ≤ 1`\n(`Finset.prod_le_prod₀`, `Finset.prod_le_one₀`) and, when `mu_p(A) > 0`,\n`prod_i phi(p_i) ≤ H_A prod_i phi(p_i) ≤ -log mu_p(A)` from `1 ≤ H_A` (`le_mul_of_one_le_left`)\nand display (F7), `hazardPhiBound`, reaching the cap by `P15Budget.Aux.le_cappedHazard_of`.\n(⇒) instantiates the budget at `p ≡ p_star`, `c ≡ 1` (admissible by `P15Elementary.Aux.pStar_pos`,\n`pStar_lt_one` and `phi p_star = 1`, `P15Elementary.phiAtPStar`); `mu_{p_star}(A) > 0` since\n`∅ ∈ A` contributes `(1 - p_star)^n > 0` (`Finset.single_le_sum`, `P15Budget.Aux.weight_nonneg`),\nso `1 ≤ min 1 (-log mu_{p_star}(A))` and `le_min_iff` gives `1 ≤ H_A`.\nDoes not establish: the informal display (F8) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); coverage of arbitrary `A` (the\nsource: \"it does not infer coverag" + }, + { + "kind": "theorem", + "unqualified_name": "localPriceBoundFull", + "line": 1149, + "source_header": "ich\nis transcribed in the register, not derived here. -/\ntheorem fullGroundBudgetIff : UniversalLaw.Spec.P15.FullGroundBudgetIff :=\n Aux.bi_fullGroundBudgetIff_of_phiBound hazardPhiBound\n\n/-- Proves: `UniversalLaw.Spec.P15.LocalPriceBoundFull` (claim `p15-full-price`, display (F12)).\nMethod: enumerate the block by `Fin n_i` (`Aux.lp_exists_enum`), transport `mu_p(D_i)` to the\ncapacity family `{|T| ≤ a_i}` via `LocalRestriction` (`Aux.lp_localGood_eq_muOf`), apply\n`hazardPhiBound` (display (F7)) to that proper downset (`Aux.lp_capacityFamily_properDownset`),\nbound `h_star ≤ H_{n_i,a_i}` by `CapacityWorstCase` and `∏ c ≤ ∏ phi ≤ 1` by\n`Finset.prod_le_prod₀`, `Finset.prod_le_one₀`; `rho_star = 1 / h_star` is definitional.\nDoes not establish: the informal display (F12) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); the stronger inequality\n`price ≤ q_i` (\"The inequality price<=q_i is NOT required and is in general stronger than what\nis proved here\"); the disposition of `p15-full-price`, which i" + }, + { + "kind": "theorem", + "unqualified_name": "fullTransformedPriceBudget", + "line": 1164, + "source_header": "ocalPriceBoundFull {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) :\n UniversalLaw.Spec.P15.LocalPriceBoundFull F :=\n Aux.lp_localPriceBoundFull_of_phiBound hazardPhiBound F\n\n/-- Proves: `UniversalLaw.Spec.P15.FullTransformedPriceBudget` (claim `p15-full-price`, display (F2)).\nMethod: `covercost ≤ 1` by the cover `{∅}` (`P15Budget.Aux.coverCost_le_one`); for `K ≥ K_H(d)`\nthe full blocks cover, so `covercost ≤ sum_i price(X_i)` (`P15Budget.Aux.coverCost_le_sum_block`);\nwhen `mu_p(D) > 0` every `mu_p(D_i) > 0` (`P15Hazard.Aux.localGood_pos_of_mu_pos`) and the local\nbound (F12), `localPriceBoundFull`, gives `price(X_i) ≤ rho_star [-log mu_p(D_i)]`;\n`Finset.sum_le_sum`, `Finset.mul_sum` and the global assembly (F13),\n`P15Hazard.globalAssemblyHazard`, give `sum_i price(X_i) ≤ rho_star [-log mu_p(D)]` with\n`rho_star ≥ 0`; `P15Budget.Aux.le_cappedHazard_of` reaches the capped hazard.\nDoes not establish: the informal display (F2) or its review and acceptance; the alignment of the\nformal objects with the source's (PENDING_INDEPENDENT_REVIEW); optimality of `rho_star` (that is\n`SharpnessOfRhoStar`); any unrestricted downset or prize statement (the source: \"palette size\nremains K_H(d), which can depend on H and d\"); the nonauthor review recorded in LANDING_CLAIMS\n(REVIEWED_SCOPED), which is not reproduced or extended here; the disposition of\n`p15-full-price`, which is transcribe" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/RNCluster.lean", + "sha256": "829f8ad5677c52d55ae7c4c3ea36d817692c3d122273e29dfe2068b00dde442a", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "rc_tail_one_eq", + "line": 50, + "source_header": "x\n\n/-! ### (a) Tails of a probability mass function on `ℕ` -/\n\n/-- `∑_{n ≥ 1} μ n = 1 - μ 0` for a summable family of total mass one. -/\ntheorem rc_tail_one_eq (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) :\n ∑' n : ℕ, μ (n + 1) = 1" + }, + { + "kind": "theorem", + "unqualified_name": "rc_tail_two_eq", + "line": 59, + "source_header": "arith\n\n/-- `∑_{n ≥ 2} μ n = 1 - μ 0 - μ 1` for a summable family of total mass one. -/\ntheorem rc_tail_two_eq (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) :\n ∑' n : ℕ, μ (n + 2) = 1 - μ" + }, + { + "kind": "theorem", + "unqualified_name": "rc_tail_one_le_mean", + "line": 67, + "source_header": "inarith\n\n/-- Markov for the mean: `∑_{n ≥ 1} μ n ≤ ∑ n μ n` for a nonnegative family with summable\nmean. -/\ntheorem rc_tail_one_le_mean (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)\n (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) :\n ∑' n : ℕ, μ (n + 1) ≤ ∑' n : ℕ, (n :" + }, + { + "kind": "theorem", + "unqualified_name": "rc_one_sub_head_le_mean", + "line": 84, + "source_header": "_of_eq h2\n\n/-- `1 - μ 0 ≤ ∑ n μ n` for a probability mass function with summable mean. -/\ntheorem rc_one_sub_head_le_mean (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)\n (h1 : ∑' n, μ n = 1) (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) :\n 1 - μ 0 ≤ ∑' n : ℕ, (n" + }, + { + "kind": "theorem", + "unqualified_name": "rc_two_mul_tail_two_le_mean", + "line": 91, + "source_header": "hs h1] at h\n\n/-- `2 (1 - μ 0 - μ 1) ≤ ∑ n μ n`: the mean dominates twice the mass of `{n ≥ 2}` (this is the\nsource's remark `2a ≤ A`, before dividing by `r^3`). -/\ntheorem rc_two_mul_tail_two_le_mean (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)\n (h1 : ∑' n, μ n = 1) (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) :\n 2 * (1 - μ 0 - μ 1) ≤ ∑' n : ℕ," + }, + { + "kind": "theorem", + "unqualified_name": "rc_hasSum_poissonPMF", + "line": 111, + "source_header": "narith [h0 1]\n\n/-! ### (b) The Poisson family -/\n\n/-- `poissonPMF lam` has total mass one for `lam ≥ 0` (Mathlib's\n`ProbabilityTheory.hasSum_one_poissonMeasure`, whose summand is definitionally\n`poissonPMF lam n`). -/\ntheorem rc_hasSum_poissonPMF (lam : ℝ) (hl : 0 ≤ lam) : HasSum (" + }, + { + "kind": "theorem", + "unqualified_name": "rc_poissonPMF_zero", + "line": 121, + "source_header": "am, hl⟩\n exact h\n\n/-- `poissonPMF lam 0 = e^{-lam}`. -/\ntheorem rc_poissonPMF_zero (lam : ℝ) : poissonPMF lam" + }, + { + "kind": "theorem", + "unqualified_name": "rc_poissonPMF_one", + "line": 125, + "source_header": "simp [poissonPMF]\n\n/-- `poissonPMF lam 1 = e^{-lam} lam`. -/\ntheorem rc_poissonPMF_one (lam : ℝ) : poissonPMF lam 1 =" + }, + { + "kind": "theorem", + "unqualified_name": "rc_poisson_tail_one", + "line": 129, + "source_header": "y\n simp [poissonPMF]\n\n/-- The Poisson tail `∑_{n ≥ 1} Pois(lam)(n) = 1 - e^{-lam}` for `lam ≥ 0`. -/\ntheorem rc_poisson_tail_one (lam : ℝ) (hl : 0 ≤ lam) :\n ∑' n : ℕ, poissonPMF lam (n + 1" + }, + { + "kind": "theorem", + "unqualified_name": "rc_poisson_tail_two", + "line": 137, + "source_header": "F_zero] at h\n linarith\n\n/-- The Poisson tail `∑_{n ≥ 2} Pois(lam)(n) = 1 - e^{-lam} - lam e^{-lam}` for `lam ≥ 0`. -/\ntheorem rc_poisson_tail_two (lam : ℝ) (hl : 0 ≤ lam) :\n ∑' n : ℕ, poissonPMF lam (n + 2) = 1 - Real.exp (-lam" + }, + { + "kind": "theorem", + "unqualified_name": "rc_half_le_one_sub_exp", + "line": 147, + "source_header": "nPMF_one] at h\n linarith\n\n/-- `x/2 ≤ 1 - e^{-x}` for `0 ≤ x ≤ 1/2`, from `|e^y - 1 - y| ≤ y^2` on `|y| ≤ 1`. -/\ntheorem rc_half_le_one_sub_exp (x : ℝ) (h0 : 0 ≤ x) (h1 : x ≤ 1 / 2) :" + }, + { + "kind": "theorem", + "unqualified_name": "rc_poisson_tail_two_le_sq", + "line": 154, + "source_header": "at h\n nlinarith [h.1, h.2]\n\n/-- `Pois(lam)(n ≥ 2) = 1 - e^{-lam} - lam e^{-lam} ≤ lam^2` for `lam ≥ 0`, from\n`1 + y ≤ e^y` multiplied by `1 + lam ≥ 0`. -/\ntheorem rc_poisson_tail_two_le_sq (lam : ℝ) (h0 : 0 ≤ lam) :\n 1 - Real.exp (-lam) - la" + }, + { + "kind": "theorem", + "unqualified_name": "rc_pmfTV_poissonPMF_zero", + "line": 162, + "source_header": "[hprod, Real.exp_pos (-lam)]\n\n/-! ### (c) Total variation against `δ_0` and against tail events -/\n\n/-- The upper half's witness: `pmfTV μ (poissonPMF 0) = 1 - μ 0` for a probability mass\nfunction `μ` (`poissonPMF 0 = δ_0`). -/\ntheorem rc_pmfTV_poissonPMF_zero (μ : ℕ → ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)\n (h1 : ∑' n, μ n = 1) :" + }, + { + "kind": "theorem", + "unqualified_name": "rc_abs_tail_sub_le_pmfTV", + "line": 188, + "source_header": "l, rc_tail_one_eq μ hs h1]\n ring\n\n/-- Half the `l^1` distance dominates the difference of the masses of every tail event\n`{n ≥ k}`, for two summable families of total mass one: the head and the tail of `μ - ν` sum to\nzero, so the tail difference is bounded by the head's `l^1` mass and by its own. -/\ntheorem rc_abs_tail_sub_le_pmfTV (μ ν : ℕ → ℝ) (hμ : Summable μ) (hν : Summable ν)\n (h1 : ∑' n, μ n = 1) (h1' : ∑' n, ν n = 1) (k : ℕ) :\n |(∑' n : ℕ, μ (n + k))" + }, + { + "kind": "theorem", + "unqualified_name": "rc_tail_two_bound", + "line": 215, + "source_header": "[heq, abs_neg] at hhead\n linarith\n\n/-- The tail `{n ≥ 2}` against `Pois(lam)`:\n`|(1 - μ 0 - μ 1) - (1 - e^{-lam} - lam e^{-lam})| ≤ pmfTV μ (poissonPMF lam)`. -/\ntheorem rc_tail_two_bound (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) (lam : ℝ)\n (hl : 0 ≤ lam) :\n |(1 - μ 0 - μ 1) - (1 - Real.exp (-lam) - lam * Real.exp (-la" + }, + { + "kind": "theorem", + "unqualified_name": "rc_tail_one_bound", + "line": 225, + "source_header": "h1, rc_poisson_tail_two lam hl] at h\n\n/-- The tail `{n ≥ 1}` against `Pois(lam)`:\n`|(1 - μ 0) - (1 - e^{-lam})| ≤ pmfTV μ (poissonPMF lam)`. -/\ntheorem rc_tail_one_bound (μ : ℕ → ℝ) (hs : Summable μ) (h1 : ∑' n, μ n = 1) (lam : ℝ)\n (hl : 0 ≤ lam) :\n |(1 - μ 0) - (1 - Real." + }, + { + "kind": "theorem", + "unqualified_name": "rc_lower_half", + "line": 234, + "source_header": "hs h1, rc_poisson_tail_one lam hl] at h\n\n/-! ### (d) The two halves at a fixed `r` -/\n\n/-- The lower half at a fixed `r` with `0 < r ≤ min (a/2) (min (1/(a + 2A)) (1/2))`, for a\nprobability mass function `μ` with summable mean satisfying (H1) and (H2) at `r`: every\n`lam ≥ 0` is at distance at least `(a/2) r^3`. -/\ntheorem rc_lower_half (μ : ℕ → ℝ) (a A r : ℝ) (hA : 0 < A) (hr : 0 < r)\n (hr_a : r ≤ a / 2) (hr_A : r ≤ 1 / (a + 2 * A)) (hr_half : r ≤ 1 / 2)\n (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ) (h1 : ∑' n, μ n = 1)\n (hm : Summable (fun n : ℕ => (n : ℝ) * μ n)) (hmean : ∑' n : ℕ, (n : ℝ) * μ n ≤ A * r ^ 3)\n (hH2 : a * r ^ 3 ≤ 1 - μ 0 - μ 1) (lam : ℝ) (hlam : 0 ≤ lam) :" + }, + { + "kind": "theorem", + "unqualified_name": "rc_upper_half", + "line": 274, + "source_header": "nlinarith [hprod]\n linarith [hk1.1]\n\n/-- The upper half at a fixed `r`, witness `lam = 0`: `pmfTV μ (poissonPMF 0) = 1 - μ 0 ≤\n∑ n μ n ≤ A r^3`. -/\ntheorem rc_upper_half (μ : ℕ → ℝ) (A r : ℝ) (h0 : ∀ n, 0 ≤ μ n) (hs : Summable μ)\n (h1 : ∑' n, μ n = 1) (hm : Summable (fun n : ℕ => (n : ℝ) * μ n))\n (hmean : ∑' n : ℕ, (n : ℝ) * μ n ≤ A * r" + }, + { + "kind": "theorem", + "unqualified_name": "rareClusterPoissonObstructionO", + "line": 285, + "source_header": "d_le_mean μ h0 hs h1 hm).trans hmean\n\nend Aux\n\n/-! ## Theorem O's shape: the abstract implication (H1) ∧ (H2) ⇒ (3.1) -/\n\n/-- Proves: `UniversalLaw.Spec.RN.RareClusterPoissonObstructionO` (claim `OA-C6-RARE-CLUSTER-20260929-v1`).\nMethod: the antecedents at `r0` give `2a ≤ A` (`Aux.rc_two_mul_tail_two_le_mean`,\n`le_of_mul_le_mul_right`), so `rStar := min r0 (min (a/2) (min (1/(a + 2A)) (1/2)))` is positive;\nthe upper half is the witness `lam = 0` with `pmfTV (μ r) (poissonPMF 0) = 1 - μ r 0 ≤ ∑ n μ r n`\n(`Aux.rc_upper_half`, from `Aux.rc_pmfTV_poissonPMF_zero` and `Aux.rc_one_sub_head_le_mean`);\nthe lower half tests the tail `{n ≥ 2}` when `lam ≤ r^2` and the tail `{n ≥ 1}` when\n`lam > r^2` (`Aux.rc_lower_half`, from `Aux.rc_abs_tail_sub_le_pmfTV`, the Poisson tails via\n`ProbabilityTheory.hasSum_one_poissonMeasure`, `Real.add_one_le_exp` and\n`Real.abs_exp_sub_one_sub_id_le`).\nDoes not establish: the informal Theorem O (3.1) of the source as the source's statement (the\nalignment of `pmfTV`, `poissonPMF` and the family `μ` with the source's `dTV`, `Pois(lambda)` and\n`Law N_r` is PENDING_INDEPENDENT_REVIEW); the result (Theorem O) or its proof as a reviewed fact;\n`2a ≤ A` as a registered statement (it is derived internally from the antecedents at `r0`, as in\nthe source, and is neither a hypothesis nor a conclusion of the Prop); that (H1) or (H2) hold for\nthe Gaussian window count (the source takes them from [D5] Theorem G_d and [C6] Corollary\nTheta); the mean-matched statement `lambda = mu`; Theorems C and S, the factorial-moment\nmatching or the independent-replica limit; the conditional-law liminf remark; that the upper half\nis the source's infimum bound verbatim (the Prop's existential form with witness `lam = 0` is\nwhat is proved); the statement module's own `Does not claim:` text (the statement packet is not\nedited here); the disposition of `OA-C6-RARE-CLUSTER-20260929-v1`, for which the register row\ntranscribes none (`disposition_transcribed: null`; title: PROOF_INDEX reviewed scoped result,\nconditional packet) and which is in any case transcribed there, not derived here; nonauthor\nreview or acceptance of OA-C6-RARE-CLUSTER-20260929-v1. -/\ntheorem rareClusterPoissonObstructionO (μ : ℝ → ℕ → ℝ) (a A : ℝ) :\n Universa" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Interfaces.lean", + "sha256": "cac965c9f6095a0812891b609be56e0fed885861f5c95cc0e9518e7908642fce", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "c1_aemeasurable_of_map_eq_gaussian", + "line": 61, + "source_header": "x\n\n/-! ## `c1_`: the `m = 1` cone moment identity (`ConeMomentD1Identity`) -/\n\n/-! ### (a) A map with a non-degenerate Gaussian law is a.e.-measurable -/\n\n/-- If `Measure.map A P` is the Gaussian `gaussianReal 0 v` with `v ≠ 0`, then `A` is\na.e.-measurable: otherwise the image measure would be a Dirac measure\n(`Measure.map_of_not_aemeasurable_of_ne_zero`), giving a singleton of measure one, whereas the\nGaussian charges no singleton (`nullSingletonClass_gaussianReal`). -/\ntheorem c1_aemeasurable_of_map_eq_gaussian {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω)\n [IsProbabilityMeasure P] (A : Ω → ℝ) {v : NNReal} (hv : v ≠ 0)\n (h : Measure.map A P = gaussianReal 0 v) : AEMeasura" + }, + { + "kind": "theorem", + "unqualified_name": "c1_measurable_indicator_sq", + "line": 81, + "source_header": "zero h1\n\n/-! ### (b) Second moments of the centred Gaussian -/\n\n/-- The integrand `a ↦ 1_{Iio 0}(a) a^2` is measurable. -/\ntheorem c1_measurable_indicator_sq :\n Measurable (fun a : ℝ => Set.indicator (Set.Iio (0 : ℝ)) (fun a =" + }, + { + "kind": "theorem", + "unqualified_name": "c1_second_moment_gaussianReal", + "line": 88, + "source_header": "ableSet_Iio\n\n/-- The second moment of `gaussianReal 0 v` is `v`, from Mathlib's\n`variance_fun_id_gaussianReal` rewritten with `variance_eq_integral` (the mean is `0`). -/\ntheorem c1_second_moment_gaussianReal (v : NNReal) :\n ∫ t, t ^ 2 ∂(gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "c1_integrable_sq_gaussianReal", + "line": 96, + "source_header": "simpa using h\n\n/-- `a ↦ a^2` is integrable against `gaussianReal 0 v` (`memLp_id_gaussianReal` at `p = 2`). -/\ntheorem c1_integrable_sq_gaussianReal (v : NNReal) :\n Integrable (fun a : ℝ => a ^ 2) (ga" + }, + { + "kind": "theorem", + "unqualified_name": "c1_setIntegral_sq_Iio_eq_Ioi", + "line": 102, + "source_header": "impa using this\n\n/-- Symmetry of the centred Gaussian: the second moment over `Iio 0` equals the second moment\nover `Ioi 0`, by `gaussianReal_map_neg` and a change of variables `a ↦ -a` (`integral_map`),\nusing `neg_lt_zero` and `neg_sq` pointwise. -/\ntheorem c1_setIntegral_sq_Iio_eq_Ioi (v : NNReal) :\n ∫ a in Set.Iio (0 : ℝ), a ^ 2 ∂(gaussianReal 0 v) =\n ∫ a in Set.Ioi (0 : ℝ), a ^ 2 ∂(" + }, + { + "kind": "theorem", + "unqualified_name": "c1_setIntegral_sq_Iio", + "line": 122, + "source_header": "measurableSet_Ioi\n\n/-- The negative half of the second moment of `gaussianReal 0 v`, `v ≠ 0`, is `v / 2`:\n`integral_add_compl` over `Iio 0` and its complement `Ici 0`, `integral_Ici_eq_integral_Ioi`\n(the Gaussian charges no singleton), the symmetry lemma, and the full second moment `v`. -/\ntheorem c1_setIntegral_sq_Iio (v : NNReal) (hv : v ≠ 0) :\n ∫ a in Set.Iio (0 : ℝ), a ^ 2 ∂(gaussianReal" + }, + { + "kind": "theorem", + "unqualified_name": "c1_integral_indicator_eq", + "line": 134, + "source_header": "t hsplit\n linarith\n\n/-! ### (c) Transport along the law of `A` -/\n\n/-- For a map `A` with law `gaussianReal 0 (8/3)` under a probability measure `P`, the integral\nof `1_{Iio 0}(A) A^2` equals the set integral of `a ↦ a^2` over `Iio 0` against\n`gaussianReal 0 (8/3)`: a.e.-measurability of `A` from its law, then `integral_map` and\n`integral_indicator`. Stated for an abstract `(Ω, P, A)` so that the interface's own instance\nfields `I.mΩ`, `I.isProb` are supplied explicitly at the point of use. -/\ntheorem c1_integral_indicator_eq {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω)\n [IsProbabilityMeasure P] (A : Ω → ℝ)\n (hlaw : Measure.map A P = gaussianReal 0 (8 / 3 : NNReal)) :\n ∫ ω, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) (A ω) ∂P =\n ∫ a in Set.Iio (0 : ℝ), a ^ 2 ∂(gaussianR" + }, + { + "kind": "theorem", + "unqualified_name": "tm_hasDerivAt_exp_sq", + "line": 153, + "source_header": "ator measurableSet_Iio]\n\n/-! ## `tm_`: the trace moments (`TraceMoments`) -/\n\n/-! ### (a) Calculus: the fourth derivative of `exp (c t^2 / 2)` at `0` -/\n\n/-- Derivative of `t ↦ exp (c t^2 / 2)`: `c t exp (c t^2 / 2)` (chain rule through\n`HasDerivAt.exp`). -/\ntheorem tm_hasDerivAt_exp_sq (c t : ℝ) :\n HasDerivAt (fun t : ℝ => Real.exp (c * t ^ 2 / 2)) (c * t" + }, + { + "kind": "theorem", + "unqualified_name": "tm_iteratedDeriv_four", + "line": 169, + "source_header": "h2 using 1\n push_cast\n ring\n\n/-- The fourth derivative of `t ↦ exp (c t^2 / 2)` at `0` is `3 c^2`: four explicit\n`HasDerivAt` steps, chained through `iteratedDeriv_succ` and `iteratedDeriv_one`. -/\ntheorem tm_iteratedDeriv_four (c : ℝ) :\n iteratedDeriv 4 (fun t : ℝ => Real.exp" + }, + { + "kind": "theorem", + "unqualified_name": "tm_fourth_moment", + "line": 214, + "source_header": "riv_one, d1, d2, d3, d4]\n simp\n\n/-! ### (b) Moments of the centred real Gaussian `gaussianReal 0 v`\n\nThe second moment `∫ t^2 = v` is `c1_second_moment_gaussianReal` above (the `tm_` copy was\nremoved at integration). -/\n\n/-- Fourth moment of `N(0, v)`: `∫ t^4 = 3 v^2`, from the fourth derivative at `0` of the\nmoment generating function `t ↦ exp (v t^2 / 2)` (`iteratedDeriv_mgf_zero`,\n`mgf_fun_id_gaussianReal`, `tm_iteratedDeriv_four`). -/\ntheorem tm_fourth_moment (v : NNReal) :\n ∫ t, t ^ 4 ∂(" + }, + { + "kind": "theorem", + "unqualified_name": "tm_exp_moment", + "line": 230, + "source_header": "riv_four] at h\n simpa using h.symm\n\n/-- Exponential moment of `N(0, 5/3)`: `∫ exp (-t^2/2) = sqrt (3/8)`. The density\n`(sqrt (10 π / 3))⁻¹ exp (-3 t^2 / 10)` times `exp (-t^2/2)` is\n`(sqrt (10 π / 3))⁻¹ exp (-(4/5) t^2)`, whose Lebesgue integral is `sqrt (π / (4/5))`\n(`integral_gaussian`); the square roots combine to `sqrt (3/8)`. -/\ntheorem tm_exp_moment :\n ∫ t, Real.exp (-(t ^ 2) / 2) ∂(gaussianReal 0" + }, + { + "kind": "theorem", + "unqualified_name": "tm_aemeasurable_triple", + "line": 252, + "source_header": "ivity)]\n congr 1\n field_simp\n ring\n\n/-! ### (c) The marginal law of `s` from the interface's product law -/\n\n/-- The triple `(s, x, y)` is a.e.-measurable: its image measure under `P` is the product\nGaussian law (`sxy_law`); were the triple not a.e.-measurable, `Measure.map` would be a Dirac\nmass (`Measure.map_of_not_aemeasurable_of_ne_zero`), which gives a singleton measure `1`,\nwhereas the product of non-degenerate Gaussians has `NullSingletonClass`. -/\ntheorem tm_aemeasurable_triple (I : ConeMomentInterface) :\n @AEMeasurable _ _ _" + }, + { + "kind": "theorem", + "unqualified_name": "tm_aemeasurable_s", + "line": 276, + "source_header": "e_singleton] at h1\n exact one_ne_zero h1\n\n/-- `s` is a.e.-measurable, as the first component of the a.e.-measurable triple. -/\ntheorem tm_aemeasurable_s (I : ConeMomentIn" + }, + { + "kind": "theorem", + "unqualified_name": "tm_law_s", + "line": 280, + "source_header": "I.s I.P :=\n (tm_aemeasurable_triple I).fst\n\n/-- The law of `s` is `N(0, 5/3)`: the first marginal of the product law `sxy_law`\n(`AEMeasurable.map_map_of_aemeasurable`, `Measure.map_fst_prod`; the composite\n`Prod.fst ∘ (s, x, y)` is `s`). -/\ntheorem tm_law_s (I : ConeMomentInterface) :\n @Measure.map _ _ I.m" + }, + { + "kind": "theorem", + "unqualified_name": "tm_integral_comp_s", + "line": 292, + "source_header": ", measure_univ, one_smul] at h\n exact h.symm\n\n/-! ### (d) Transport of an integral along `s` to the marginal law -/\n\n/-- For a measurable `f : ℝ → ℝ`, `∫ f (s ω) dP = ∫ f t d(gaussianReal 0 (5/3))`\n(`integral_map` along the a.e.-measurable `s`, then `tm_law_s`). -/\ntheorem tm_integral_comp_s (I : ConeMomentInterface) (f : ℝ → ℝ) (hf : Measurable f) :\n ∫ ω, f (I.s ω) ∂" + }, + { + "kind": "theorem", + "unqualified_name": "rl_rhs_integral", + "line": 303, + "source_header": "m_aemeasurable_s I) hf.aestronglyMeasurable).symm\n\n/-! ## `rl_`: the law of `R^2` (`RayleighSquareLaw`) -/\n\n/-! ### (a) Elementary integrals -/\n\n/-- The right-hand side of `RayleighSquareLaw`: `∫_0^a exp (-z/2)/2 dz = 1 - exp (-a/2)`, by\nthe fundamental theorem of calculus with antiderivative `z ↦ -exp (-z/2)`. -/\ntheorem rl_rhs_integral (a : ℝ) :\n ∫ z in (0" + }, + { + "kind": "theorem", + "unqualified_name": "rl_radial_integral", + "line": 325, + "source_header": "ntegral_eq_sub_of_hasDerivAt hderiv hint]\n simp\n ring\n\n/-- The radial integral of the planar Gaussian density over the disk of radius `sqrt a`:\n`∫_0^{sqrt a} r (2π)⁻¹ exp (-r^2/2) dr = (2π)⁻¹ (1 - exp (-a/2))`, by the fundamental\ntheorem of calculus with antiderivative `r ↦ -(2π)⁻¹ exp (-r^2/2)`. -/\ntheorem rl_radial_integral (a : ℝ) (ha : 0 ≤ a) :\n ∫ r in (0 : ℝ)..Real.sqrt a, r * ((2 * Real.pi)⁻¹ * Real.exp (-(r ^ 2" + }, + { + "kind": "theorem", + "unqualified_name": "rl_angular_integral", + "line": 351, + "source_header": "of_hasDerivAt hderiv hint, Real.sq_sqrt ha]\n simp\n ring\n\n/-- The angular integral: `∫_{Ioo (-π) π} 1 = 2π`. -/\ntheorem rl_angular_integral" + }, + { + "kind": "theorem", + "unqualified_name": "rl_pdf_mul", + "line": 357, + "source_header": "ENNReal.toReal_ofReal (by linarith [Real.pi_pos])]\n ring\n\n/-! ### (b) The planar standard Gaussian density -/\n\n/-- The product of two standard Gaussian densities is the planar density\n`(2π)⁻¹ exp (-(x^2 + y^2)/2)`. -/\ntheorem rl_pdf_mul (x y : ℝ) :\n gaussianPDFReal 0 1 x * gaussianPDFReal" + }, + { + "kind": "theorem", + "unqualified_name": "rl_measurableSet_disk", + "line": 377, + "source_header": "2) := by\n rw [hs, ← Real.exp_add]\n congr 2\n ring\n\n/-- The closed disk `{p | p.1^2 + p.2^2 ≤ a}` is measurable. -/\ntheorem rl_measurableSet_dis" + }, + { + "kind": "theorem", + "unqualified_name": "rl_measurableSet_radial", + "line": 382, + "source_header": "p.2 ^ 2 ≤ a} :=\n measurableSet_le (by fun_prop) measurable_const\n\n/-- The set `{r | r^2 ≤ a}` is measurable. -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "rl_polar_integrand", + "line": 386, + "source_header": "ℝ | r ^ 2 ≤ a} :=\n measurableSet_le (by fun_prop) measurable_const\n\n/-- In polar coordinates the disk integrand `p.1 • 1_D (density ∘ polarCoord.symm) p` is the\nradial function `1_{r^2 ≤ a} (r (2π)⁻¹ exp (-r^2/2))` of `p.1` times the constant `1` of\n`p.2` (the form `setIntegral_prod_mul` separates). -/\ntheorem rl_polar_integrand (a : ℝ) (p : ℝ × ℝ) :\n p.1 • Set.indicator {q : ℝ × ℝ | q.1 ^ 2 + q.2 ^ 2 ≤ a}\n (fun q => gaussianPDFReal 0 1 q.1 * gaussianPDFReal 0 1 q.2) (polarCoord.symm p) =\n Set.indicator {r : ℝ | r ^ 2 ≤ a}\n (fun r => r * ((2 * Real.pi)⁻¹" + }, + { + "kind": "theorem", + "unqualified_name": "rl_Ioi_inter_eq", + "line": 401, + "source_header": "d_eq, rl_pdf_mul, hsq,\n smul_eq_mul, mul_one]\n split_ifs <;> simp\n\n/-- For `a ≥ 0`, `Ioi 0 ∩ {r | r^2 ≤ a} = Ioc 0 (sqrt a)`. -/\ntheorem rl_Ioi_inter_eq (a : ℝ) (ha : 0 ≤ a" + }, + { + "kind": "theorem", + "unqualified_name": "rl_disk_integral", + "line": 412, + "source_header": ".2 hr⟩\n · rintro ⟨h0, hr⟩\n exact ⟨h0, (Real.le_sqrt h0.le ha).1 hr⟩\n\n/-- The Bochner integral of the planar standard Gaussian density over the closed disk of\nradius `sqrt a` is `1 - exp (-a/2)`: polar coordinates (`integral_comp_polarCoord_symm`),\nseparation of variables (`setIntegral_prod_mul`), the angular integral `2π` and the radial\nintegral `(2π)⁻¹ (1 - exp (-a/2))`. -/\ntheorem rl_disk_integral (a : ℝ) (ha : 0 ≤ a) :\n ∫ p in {p : ℝ × ℝ | p.1 ^ 2 + p.2 ^ 2 ≤ a}," + }, + { + "kind": "theorem", + "unqualified_name": "rl_disk_measure", + "line": 452, + "source_header": "h2, h3]\n refine h4.trans ?_\n rw [h5, rl_angular_integral]\n field_simp\n\n/-- The measure of the closed disk of radius `sqrt a` under the standard planar Gaussian\n`gaussianReal 0 1 ⊗ gaussianReal 0 1` is `1 - exp (-a/2)`: the product of the two\n`withDensity` measures is `withDensity` of the product density (`prod_withDensity`), whose\nvalue on the (measurable) disk is the `lintegral` of the density there (`withDensity_apply`),\nwhich is `ENNReal.ofReal` of the Bochner integral `rl_disk_integral`\n(`ofReal_integral_eq_lintegral_ofReal`). -/\ntheorem rl_disk_measure (a : ℝ) (ha : 0 ≤ a) :\n ((gaussianReal 0 1).prod (gaussianReal 0 1)) {p : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "rl_aemeasurable_xy", + "line": 478, + "source_header": "only [gaussianPDF]\n rw [ENNReal.ofReal_mul (gaussianPDFReal_nonneg _ _ _)]\n\n/-! ### (c) The interface: measurability and the law of `(x, y)`\n\nA.e.-measurability of the triple `(s, x, y)` is `tm_aemeasurable_triple` above (the `rl_` copy\nwas removed at integration). -/\n\n/-- The pair `(x, y)` is a.e.-measurable, as the second component of the triple. -/\ntheorem rl_aemeasurable_xy (I : Co" + }, + { + "kind": "theorem", + "unqualified_name": "rl_law_xy", + "line": 488, + "source_header": "le _ _ _ I.mΩ (fun ω => (I.x ω, I.y ω)) I.P :=\n (tm_aemeasurable_triple I).snd\n\n/-- The law of `(x, y)` is `gaussianReal 0 1 ⊗ gaussianReal 0 1`: the second marginal of the\nproduct law `sxy_law` (`AEMeasurable.map_map_of_aemeasurable`, `Measure.map_snd_prod`; the\ncomposite `Prod.snd ∘ (s, x, y)` is `(x, y)`). -/\ntheorem rl_law_xy (I : ConeMomentInterface) :\n @Measure.map _ _ I.mΩ _" + }, + { + "kind": "theorem", + "unqualified_name": "rl_prob_eq_disk_measure", + "line": 501, + "source_header": "rw [I.sxy_law, Measure.map_snd_prod, measure_univ, one_smul] at h\n exact h.symm\n\n/-- The probability of `{x^2 + y^2 ≤ a}` under `P` is the Gaussian measure of the closed disk: the\ndisk is a measurable set and `(x, y)` is a.e.-measurable, so `Measure.map_apply_of_aemeasurable`\ntransports the law `rl_law_xy` (a.e.-measurable transport; the sample-space preimage is only\nshown to be null-measurable for `I.P`, which is not assumed complete). -/\ntheorem rl_prob_eq_disk_measure (I : ConeMomentInterface) (a : ℝ) :\n I.P {ω | I.x ω ^ 2 + I.y ω ^ 2 ≤ a} =" + }, + { + "kind": "theorem", + "unqualified_name": "coneMomentD1Identity", + "line": 516, + "source_header": "ly_of_aemeasurable (rl_aemeasurable_xy I) (rl_measurableSet_disk a)]\n rfl\n\nend Aux\n\n/-! ## The `m = 1` cone moment identity for every inhabitant of the interface -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ConeMomentD1Identity` (claim `side24-coefficient`).\nMethod: transport along the law field `I.A_law` (`Aux.c1_integral_indicator_eq`, applied to\n`I.Ω`, `I.mΩ`, `I.P`, `I.isProb`, `I.A`; it uses `integral_map` after a.e.-measurability of\n`I.A` from `Aux.c1_aemeasurable_of_map_eq_gaussian`, the Dirac-versus-`NullSingletonClass`\nargument), then the negative half of the second moment of\n`gaussianReal 0 (8/3)` is `(8/3)/2` (`Aux.c1_setIntegral_sq_Iio`, from `integral_add_compl`,\n`integral_Ici_eq_integral_Ioi`, the symmetry `gaussianReal_map_neg` and the variance\n`variance_fun_id_gaussianReal`), and `push_cast`/`norm_num` give `4/3 = coneMomentD1`.\nDoes not establish: the informal identity `D_1 = E[A^2 1{A<0}] = 4/3` of the source as the\nsource's object (the alignment of `ConeMomentInterface`, its field `A_law` and `coneMomentD1`\nwith the source's `A ~ N(0, 8/3)` and `D_1` is PENDING_INDEPENDENT_REVIEW); that `D_1` is the\nparent's cone moment `D_u` of (15.1) for the reference law; that `ConeMomentInterface` has an\ninhabitant, or that its laws are the conditional law `A | V = 0` of the reference field; any\nenclosure of the coefficient; `ConeMomentD2Identity`, `TraceMoments` or `RayleighSquareLaw`;\nthe disposition of `side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the\nregister, not derived here; nonauthor review or acceptance of\nSIDE24-COEFFICIENT-D23-20260924-v1. -/\ntheorem coneMomentD1I" + }, + { + "kind": "theorem", + "unqualified_name": "traceMoments", + "line": 543, + "source_header": "w,\n Aux.c1_setIntegral_sq_Iio (8 / 3 : NNReal) (by norm_num)]\n push_cast\n norm_num\n\n/-! ## The Section 1 trace moments for every inhabitant of the interface -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.TraceMoments` (claim `side24-coefficient`).\nMethod: the law of `I.s` is `gaussianReal 0 (5/3)` (`Aux.tm_law_s`: the first marginal of the\ninterface's product law `sxy_law`, after `Aux.tm_aemeasurable_triple` derives a.e.-measurability\nof the triple from the law by the Dirac-versus-`NullSingletonClass` argument); each of the three\nintegrals is transported to that law by `integral_map` (`Aux.tm_integral_comp_s`) and computed\nthere: `∫ t^2 = 5/3` (`Aux.c1_second_moment_gaussianReal`, shared with `ConeMomentD1Identity`,\nfrom `variance_fun_id_gaussianReal`),\n`∫ t^4 = 3 (5/3)^2 = 25/3` (`Aux.tm_fourth_moment`, from `iteratedDeriv_mgf_zero` and the\nexplicit fourth derivative `Aux.tm_iteratedDeriv_four`), and `∫ exp (-t^2/2) = sqrt (3/8)`\n(`Aux.tm_exp_moment`, from `integral_gaussianReal_eq_integral_smul` and `integral_gaussian`).\nDoes not establish: the informal Section 1 display of the source as the source's object (the\nalignment of the interface fields `s`, `P`, `sxy_law` and of `gaussianReal` with the source's\n`s ~ N(0, 5/3)` is PENDING_INDEPENDENT_REVIEW); that any inhabitant of `ConeMomentInterface`\nexists, or that its laws are the conditional law `A | V = 0` of the reference field (the laws are\nhypothesis fields of the given `I`, not derived here); the main-side constants\n`UniversalLaw.Side24.fourth_moment_of_trace` and `exponential_moment_of_trace`, which\nkernel-check `3 (5/3)^2 = 25/3` and `1 + 5/3 = 8/3` on main and are neither imported nor\nre-stated here (the same arithmetic is discharged inline by `ring`); `ConeMomentD2Identity`,\n`RayleighSquareLaw` or any cone moment; any enclosure of the coefficient; the statement module's\nown `Does not claim:` text (the statement packet is not edited here); the disposition of\n`side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the register, not derived here;\nnonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1." + }, + { + "kind": "theorem", + "unqualified_name": "rayleighSquareLaw", + "line": 585, + "source_header": "ral_comp_s I (fun t => Real.exp (-(t ^ 2) / 2)) (by fun_prop)\n rw [e, Aux.tm_exp_moment]\n\n/-! ## The law of `R^2` for every inhabitant of the interface -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.RayleighSquareLaw` (claim `side24-coefficient`).\nMethod: for `a ≥ 0`, `P {x^2 + y^2 ≤ a}` is the measure of the closed disk of radius `sqrt a`\nunder `gaussianReal 0 1 ⊗ gaussianReal 0 1` (`Aux.rl_prob_eq_disk_measure`, from the law\n`Aux.rl_law_xy` of `(x, y)` obtained as the second marginal of the interface's product law\n`sxy_law`, after `Aux.tm_aemeasurable_triple`, shared with `TraceMoments`, derives\na.e.-measurability of the triple from the\nlaw by the Dirac-versus-`NullSingletonClass` argument); that disk measure is\n`ENNReal.ofReal (1 - exp (-a/2))` (`Aux.rl_disk_measure`: `prod_withDensity`,\n`withDensity_apply`, `ofReal_integral_eq_lintegral_ofReal`, then polar coordinates\n`integral_comp_polarCoord_symm` and `setIntegral_prod_mul` in `Aux.rl_disk_integral`, with the\nangular integral `2π` and the radial integral by the fundamental theorem of calculus); the\nright-hand side `∫_0^a exp (-z/2)/2 dz` is the same number `1 - exp (-a/2)`\n(`Aux.rl_rhs_integral`), and `ENNReal.toReal_ofReal` closes.\nDoes not establish: the informal Section 1 display \"The variable R^2 has density e^(-z/2)/2\" of\nthe source as the source's object, nor its review and acceptance (the alignment of the interface\nfields `x`, `y`, `P`, `sxy_law` and of `gaussianReal` with the source's `x, y ~ N(0, 1)` is\nPENDING_INDEPENDENT_REVIEW); from the Prop's own `Does not claim:` line, \"the law (statement\nonly)\": the law is proved here only for the formal objects of the Prop, as the distribution\nfunction `P(R^2 ≤ a)` for `a ≥ 0`, not as a density and not for the source's variable; and\n\"measurability of the event (if the event is not measurable, `P` is its outer measure)\":\nthe formal event `{x^2 + y^2 ≤ a}` is the preimage of the closed disk, a measurable set\n(`Aux.rl_measurableSet_disk`), under the a.e.-measurable coordinate map `(x, y)`\n(`Aux.rl_aemeasurable_xy`); `Measure.map_apply_of_aemeasurable` transports the measure along that\nmap, so `P` of the event equals the disk measure under the law. The preimage is thereby\nnull-measurable for `I.P` (`AEMeasurable.nullMeasurableSet_preimage`); `MeasurableSet` of the\nsample-space preimage is not asserted (`ConeMomentInterface` assumes neither that `I.P` is\ncomplete nor that the coordinate fields are measurable), and nothing is established about any\nother event; that any inhabitant of\n`ConeMomentInterface` exists, or that its laws are the conditional law `A | V = 0` of the\nreference field (the laws are hypothesis fields of the given `I`, not derived here);\n`ConeMomentD2Identity` or any cone moment; any enclosure of the coefficient; the statement\nmodule's own text (the statement packet is not edited here); the disposition of\n`side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the register, not derived here;\nnonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/\nthe" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Images.lean", + "sha256": "ca643c39144400074658c39bbdd0f04ac47d29bd0c59fc2327d5a90d4f5ae392", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "ib_iteratedFDeriv_tsum_of_isOpen", + "line": 75, + "source_header": "x\n\n/-! ## `ib_`: helpers for `ImageBound` -/\n\n/-- Local version of Mathlib's `iteratedFDeriv_tsum`: for summands that are each `C^N` on the whole\nspace, summable bounds over an open preconnected set `U` on their derivatives of every order `≤ N`\ngive, for every `k ≤ N`, the term-wise `k`-th iterated derivative at every point of `U`. Same\ninduction as Mathlib's global lemma, with the local `hasFDerivAt_tsum_of_isPreconnected` and\n`Filter.EventuallyEq.fderiv_eq` on `U`. -/\ntheorem ib_iteratedFDeriv_tsum_of_isOpen {α E F : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]\n [NormedAddCommGroup F] [CompleteSpace F] [NormedSpace ℝ F]\n {f : α → E → F} {v : ℕ → α → ℝ} {N : ℕ∞} {U : Set E}\n (hU : IsOpen U) (hU' : IsPreconnected U)\n (hf : ∀ i, ContDiff ℝ N (f i))\n (hv : ∀ k : ℕ, (k : ℕ∞) ≤ N → Summable (v k))\n (h'f : ∀ (k : ℕ) (i : α) (x : E), (k : ℕ∞) ≤ N → x ∈ U →\n ‖iteratedFDeriv ℝ k (f i) x‖ ≤ v k i)\n {k : ℕ} (hk : (k : ℕ∞) ≤ N) {x : E} (hx : x ∈ U) :\n iteratedFDeriv ℝ k (fun y => ∑' n, f n y) x = ∑' n, iteratedFDeriv ℝ k (f" + }, + { + "kind": "theorem", + "unqualified_name": "ib_pairingSum_mono", + "line": 114, + "source_header": "_tsum\n\n/-- The pairing sums are monotone in `r ≥ 0`: every term is a nonnegative multiple of `r^m`. -/\ntheorem ib_pairingSum_mono (q : ℕ) {r s : ℝ} (hr : 0 ≤ r) (hrs : r ≤ s) :\n pairingSum q r ≤ pairing" + }, + { + "kind": "theorem", + "unqualified_name": "ib_pairingSum_le", + "line": 124, + "source_header": ")) hden\n\n/-- For `q ≤ 6` and `r ≥ 0`, `pairingSum q r ≤ 76 (1 + r)^6`. -/\ntheorem ib_pairingSum_le (q : ℕ) (hq : q ≤ 6) {r : ℝ} (hr : 0 ≤ r) :\n pairingSum q r ≤ 76 * (1" + }, + { + "kind": "theorem", + "unqualified_name": "ib_poly_gauss_le", + "line": 131, + "source_header": "q hq _ h1\n\n/-- `(1 + r)^6 e^(-r^2/2) ≤ 720 e^2 e^(-r^2/4)` for `r ≥ 0`: `(1 + r)^6 ≤ 6! e^(1 + r)` and\n`1 + r - r^2/2 ≤ 2 - r^2/4`, that is `(r - 2)^2 ≥ 0`. -/\ntheorem ib_poly_gauss_le {r : ℝ} (hr : 0 ≤ r) :\n (1 + r) ^ 6 * Real.exp (-(r ^ 2) / 2) ≤ 720 * Real.exp 2 * Real.exp (-(" + }, + { + "kind": "theorem", + "unqualified_name": "ib_exp_shift_le", + "line": 149, + "source_header": ":= by ring\n\n/-- `exp(-‖z + v‖^2/4) ≤ exp(‖z‖^2/4) exp(-‖v‖^2/8)`, from `‖v‖ ≤ ‖z + v‖ + ‖z‖`. -/\ntheorem ib_exp_shift_le {d : ℕ} (z v : E d) :\n Real.exp (-(‖z + v‖ ^ 2) / 4) ≤ Real.exp (‖z‖ ^ 2 / 4) * Real.exp (-(" + }, + { + "kind": "theorem", + "unqualified_name": "ib_exp_lattice_eighth", + "line": 161, + "source_header": "+ v‖ - ‖z‖)]\n\n/-- `exp(-‖24 n‖^2/8) = ∏ i, exp(-72 n_i^2)`. -/\ntheorem ib_exp_lattice_eighth (d : ℕ) (n : Fin d → ℤ) :\n Real.exp (-(‖latticeVec d n‖ ^ 2) / 8) = ∏ i, Real.exp (-72 * ((n i" + }, + { + "kind": "theorem", + "unqualified_name": "ib_translate_bound", + "line": 170, + "source_header": "_ => ?_\n ring\n\n/-- On the unit ball, every derivative of order `k ≤ 6` of a lattice translate of `Kinf d` is\nbounded by the summable family `C ∏ i, exp(-72 n_i^2)`. -/\ntheorem ib_translate_bound {d : ℕ} (k : ℕ) (hk : k ≤ 6) (n : Fin d → ℤ) {z : E d}\n (hz : z ∈ Metric.ball (0 : E d) 1) :\n ‖iteratedFDeriv ℝ k (Kinf d) (z + latticeVec d n)‖ ≤\n 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * ∏ i, Real.exp (-72 * ((n" + }, + { + "kind": "theorem", + "unqualified_name": "ib_latticeVec_zero", + "line": 202, + "source_header": ") ^ 2) := by ring\n\n/-- `latticeVec d 0 = 0`. -/\ntheorem ib_latticeVec_zero (d : ℕ) :" + }, + { + "kind": "theorem", + "unqualified_name": "ib_theta0_ge_one", + "line": 207, + "source_header": "simp [latticeVec]\n\n/-- `θ(0) = ∑_n exp(-‖24 n‖^2/2) ≥ 1`: the summand at `n = 0` is `1` and the others are positive. -/\ntheorem ib_theta0_ge_one (d : ℕ)" + }, + { + "kind": "theorem", + "unqualified_name": "ib_K24_eq", + "line": 213, + "source_header": "ticeVec_zero] using h\n\n/-- `K_24` as a sum of scaled lattice translates of `Kinf d`. -/\ntheorem ib_K24_eq (d : ℕ) :\n K24 d = fun z => ∑' n : Fin d → ℤ, (thetaSum24 d 0)⁻¹ • Kinf" + }, + { + "kind": "theorem", + "unqualified_name": "ib_contDiff_term", + "line": 221, + "source_header": ", div_eq_inv_mul]\n rfl\n\n/-- Each scaled translate is `C^∞`. -/\ntheorem ib_contDiff_term (d : ℕ) (c : ℝ) (n : Fin d → ℤ) :\n ContDiff ℝ ∞ (fun z : E d => c • Kin" + }, + { + "kind": "theorem", + "unqualified_name": "ib_iteratedFDeriv_term", + "line": 226, + "source_header": "Diff_const)).const_smul c\n\n/-- The iterated derivative of a scaled translate. -/\ntheorem ib_iteratedFDeriv_term (d k : ℕ) (c : ℝ) (n : Fin d → ℤ) (z : E d) :\n iteratedFDeriv ℝ k (fun z : E d => c • Kinf d (z + latticeVec d n)) z =\n c • iteratedFDeriv ℝ k (K" + }, + { + "kind": "theorem", + "unqualified_name": "ib_summable_bound", + "line": 238, + "source_header": "ratedFDeriv_comp_add_right]\n\n/-- The summable bound family is summable. -/\ntheorem ib_summable_bound (d : ℕ) :\n Summable (fun n : Fin d → ℤ =>\n 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * ∏ i, Real.exp" + }, + { + "kind": "theorem", + "unqualified_name": "ib_term_bound", + "line": 245, + "source_header": "72 (by norm_num))).mul_left _\n\n/-- The derivative bound of a scaled translate on the unit ball, for a scale `0 ≤ c ≤ 1`. -/\ntheorem ib_term_bound {d : ℕ} {c : ℝ} (hc0 : 0 ≤ c) (hc1 : c ≤ 1) (k : ℕ) (hk : k ≤ 6)\n (n : Fin d → ℤ) {z : E d} (hz : z ∈ Metric.ball (0 : E d) 1) :\n ‖iteratedFDeriv ℝ k (fun z : E d => c • Kinf d (z + latticeVec d n)) z‖ ≤\n 76 * (720 * Real.exp 2) * Real.exp (1 / 4) * ∏ i, Real." + }, + { + "kind": "theorem", + "unqualified_name": "ib_K24_deriv", + "line": 257, + "source_header": ":= ib_translate_bound k hk n hz\n\n/-- The term-wise iterated derivative of `K_24` at `0`, as continuous multilinear maps. -/\ntheorem ib_K24_deriv (d q : ℕ) (hq : q ≤ 6) :\n iteratedFDeriv ℝ q (K24 d) 0 =\n ∑' n : Fin d → ℤ, (thetaSum24 d 0)⁻¹ • iteratedFDe" + }, + { + "kind": "theorem", + "unqualified_name": "ib_intNormSq_ge_one", + "line": 280, + "source_header": "ib_iteratedFDeriv_term, zero_add]\n\n/-- Nonzero integer vectors have `intNormSq d n ≥ 1`. -/\ntheorem ib_intNormSq_ge_one {d : ℕ} {n : Fin d →" + }, + { + "kind": "theorem", + "unqualified_name": "ib_lattice_term", + "line": 293, + "source_header": "eg _)\n (Finset.mem_univ i)\n\n/-- For `n ≠ 0`: `‖24 n‖^6 exp(-‖24 n‖^2/2) = 24^6 imageTerm d n`. -/\ntheorem ib_lattice_term (d : ℕ) {n : Fin d → ℤ} (hn : n ≠ 0) :\n ‖latticeVec d n‖ ^ 6 * Real.exp (-(‖latticeVec d" + }, + { + "kind": "theorem", + "unqualified_name": "ib_gauss_le_image", + "line": 303, + "source_header": "ormSq d n := by ring\n rw [he]\n ring\n\n/-- For `n ≠ 0`: `exp(-‖24 n‖^2/2) ≤ imageTerm d n` (the factor `|n|^6 ≥ 1`). -/\ntheorem ib_gauss_le_image (d : ℕ) {n : Fin d → ℤ} (hn : n ≠ 0) :\n Real.exp (-(‖(0 : E d) + la" + }, + { + "kind": "theorem", + "unqualified_name": "ib_final_constant", + "line": 316, + "source_header": "_of_nonneg_right h3 (Real.exp_pos _).le\n\n/-- The image bound's constant: `1458 (76 · 24^6 + 15) e^(-288) < imageConstE`. -/\ntheorem ib_final_constant :\n 1458 * (76 * 24" + }, + { + "kind": "theorem", + "unqualified_name": "ec_mem_jetDirs", + "line": 325, + "source_header": "imageConstE := by norm_num [imageConstE]\n\n/-! ## `ec_`: helpers for `EntrywiseCovarianceBound` (`ec_length_jetDirs_le` also serves `co_C24_symm`) -/\n\n/-- When `u` is itself a frame vector (`hu : ∃ j, u = R j`), every direction attached to a joint\ncoordinate is a frame vector `R j`. -/\ntheorem ec_mem_jetDirs {d : ℕ} {u : E d} {R : Fin d → E d} (hu : ∃ j, u = R j)\n (x : JointIndex d) {v : E" + }, + { + "kind": "theorem", + "unqualified_name": "ec_length_jetDirs_le", + "line": 341, + "source_header": "· exact ⟨p.1.1, h⟩\n · exact ⟨p.1.2, h⟩\n\n/-- Each joint coordinate carries at most three directions. -/\ntheorem ec_length_jetDirs_le {d : ℕ} (u : E d) (R : Fin d → E d) (x : J" + }, + { + "kind": "theorem", + "unqualified_name": "ec_svecScale_bounds", + "line": 346, + "source_header": "rcases x with i | (_ | p) <;> simp [jetDirs]\n\n/-- The `svec` scale is `1` or `√2`: nonnegative and at most `√2`. -/\ntheorem ec_svecScale_bounds {d : ℕ} (x : JointIndex d) :" + }, + { + "kind": "theorem", + "unqualified_name": "ec_scale_le", + "line": 360, + "source_header": "one, h1⟩\n · exact ⟨Real.sqrt_nonneg _, le_rfl⟩\n\n/-- `|svecScale a · svecScale b · (-1)^n| ≤ 2`. -/\ntheorem ec_scale_le {d : ℕ} (a b : JointIndex d) (n : ℕ) :" + }, + { + "kind": "theorem", + "unqualified_name": "co_kinf_analytic", + "line": 370, + "source_header": "eg _)\n _ = 2 := Real.mul_self_sqrt (by norm_num)\n\n/-! ## `co_`: helpers for `CovarianceOrdering` -/\n\n/-- `Kinf d` is analytic (`C^ω`): the exponential of a polynomial. -/\nt" + }, + { + "kind": "theorem", + "unqualified_name": "co_kinf_perm", + "line": 377, + "source_header": "ontDiff_exp.comp ((contDiff_norm_sq ℝ).neg.div_const 2)\n\n/-- The iterated derivatives of `Kinf d` are symmetric at every point (analyticity and\n`ContDiffAt.iteratedFDeriv_comp_perm`). -/\ntheorem co_kinf_perm {d n : ℕ} (y : E d) (v : Fin n → E d) (σ : Equiv.Perm (Fin n)) :\n iteratedFDeriv" + }, + { + "kind": "theorem", + "unqualified_name": "co_kinf_neg_apply", + "line": 383, + "source_header": "_kinf_analytic d).contDiffAt.iteratedFDeriv_comp_perm v σ\n\n/-- Evenness of `Kinf d` at a general point: `D^q Kinf (-y) v = (-1)^q D^q Kinf y v`. -/\ntheorem co_kinf_neg_apply {d : ℕ} (q : ℕ) (y : E d) (v : Fin q → E d) :\n iteratedFDeriv ℝ q (Kinf" + }, + { + "kind": "theorem", + "unqualified_name": "co_latticeVec_neg", + "line": 401, + "source_header": "rw [h2, ← mul_assoc, ← pow_add, ← two_mul, pow_mul]\n simp\n\n/-- `latticeVec d (-n) = -latticeVec d n`. -/\ntheorem co_latticeVec_neg" + }, + { + "kind": "theorem", + "unqualified_name": "co_K24_apply", + "line": 406, + "source_header": "ec d (-n) = -latticeVec d n := by\n ext i\n simp [latticeVec]\n\n/-- The term-wise derivative of `K_24` at `0`, evaluated at a tuple. -/\ntheorem co_K24_apply (d q : ℕ) (hq : q ≤ 6) (v : Fin q → E d) :\n iteratedFDeriv ℝ q (K24 d) 0 v =\n (thetaSum24 d 0)⁻¹ * ∑" + }, + { + "kind": "theorem", + "unqualified_name": "co_K24_odd", + "line": 426, + "source_header": "ceVec d n) v\n from tsum_congr fun n => rfl, tsum_mul_left]\n\n/-- Odd-order derivatives of `K_24` at `0` of order at most `6` vanish (reindex the lattice sum by\n`n ↦ -n`, with `co_kinf_neg_apply`). -/\ntheorem co_K24_odd (d q : ℕ) (hq : q ≤ 6) (hodd :" + }, + { + "kind": "theorem", + "unqualified_name": "co_derivContraction_cast", + "line": 442, + "source_header": "_neg\n have h0 : ∑' n, f n = 0 := by linarith\n rw [h0, mul_zero]\n\n/-- `derivContraction` through a length cast. -/\ntheorem co_derivContraction_cast {d : ℕ} (K : E d → ℝ) (x : E d) (l : List (E d)) (n : ℕ)\n (h : l.length = n) :\n derivContraction d" + }, + { + "kind": "def", + "unqualified_name": "co_rot", + "line": 449, + "source_header": "ℝ n K x (fun i => l.get (Fin.cast h.symm i)) := by\n subst h\n rfl\n\n/-- The block rotation `i ↦ i + m` (mod `m + k`) of `Fin (m + k)" + }, + { + "kind": "theorem", + "unqualified_name": "co_kinf_swap", + "line": 468, + "source_header": "simp only [h1, dite_false]\n split_ifs with h2 <;> simp <;> omega\n\n/-- Swapping the two blocks of a contraction list does not change a contraction of `Kinf d`. -/\ntheorem co_kinf_swap {d : ℕ} (x : E d) (l₁ l₂ : List (E d)) :\n derivContrac" + }, + { + "kind": "theorem", + "unqualified_name": "co_K24_swap", + "line": 490, + "source_header": "(by omega), List.getElem_append_right (by omega)]\n congr 1\n omega\n\n/-- The same block swap for `K_24` at `0`, for lists of total length at most `6`. -/\ntheorem co_K24_swap {d : ℕ} (l₁ l₂ : List (E d)) (hl : (l₁ ++ l₂).length ≤ 6) :\n derivCon" + }, + { + "kind": "theorem", + "unqualified_name": "co_K24_odd_list", + "line": 501, + "source_header": "refine tsum_congr fun n => ?_\n exact co_kinf_swap (latticeVec d n) l₁ l₂\n\n/-- A contraction of `K_24` at `0` against a list of odd length at most `6` vanishes. -/\ntheorem co_K24_odd_list {d : ℕ} (l : List (E d)) (hl : l" + }, + { + "kind": "theorem", + "unqualified_name": "co_C24_symm", + "line": 506, + "source_header": "gth) :\n derivContraction d (K24 d) 0 l = 0 :=\n co_K24_odd d _ hl hodd _\n\n/-- `C_24` is symmetric, for every `u` and every `R`. -/\ntheorem co_C24_symm {d : ℕ} (u : E" + }, + { + "kind": "theorem", + "unqualified_name": "co_C24_hermitian", + "line": 535, + "source_header": "ngth_append, add_comm]; exact ho\n rw [co_K24_odd_list _ hba hodd]\n ring\n\n/-- `C_24` is Hermitian (real symmetric). -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "co_quad_le", + "line": 539, + "source_header": "sHermitian :=\n Matrix.IsHermitian.ext fun i j => by simp [co_C24_symm u R i j]\n\n/-- An entrywise bound `|A i j| ≤ c` bounds the quadratic form by `c · card · (x ⬝ᵥ x)`. -/\ntheorem co_quad_le {ι : Type*} [Fintype ι] (A : Matrix ι ι ℝ) {c : ℝ} (hc : 0 ≤ c)\n (hA : ∀ i" + }, + { + "kind": "theorem", + "unqualified_name": "co_card_le", + "line": 571, + "source_header": "ul_of_nonneg_left h3 hc\n _ = c * Fintype.card ι * (x ⬝ᵥ x) := by rw [h4]; ring\n\n/-- `card (JointIndex d) ≤ 13` for `d" + }, + { + "kind": "theorem", + "unqualified_name": "co_margin", + "line": 582, + "source_header": "[JointIndex, Fintype.card_sum]\n rw [h2]\n have : d * d ≤ 9 := by nlinarith\n omega\n\n/-- The margin: `2 image" + }, + { + "kind": "theorem", + "unqualified_name": "imageBound", + "line": 590, + "source_header": "eConstE * 13 ≤ epsilon / 3 := by\n norm_num [imageConstE, epsilon]\n\nend Aux\n\nopen Aux\n\n/-- Proves: `UniversalLaw.Spec.Side24.ImageBound` (claim `side24-coefficient`), for the formal\n`K24`, `Kinf` and `thetaSum24` of `Specifications.Side24`: for `d ∈ {2, 3}`, every order `q ≤ 6`\nand every unit tuple `u`, `|D^q K_24(0) u - D^q K_∞(0) u| < imageConstE`.\nMethod: `D^q K_24(0) = θ(0)⁻¹ ∑_n D^q K_∞(24 n)` by the local term-wise derivative on the unit\nball (`Aux.ib_K24_deriv`, from `Aux.ib_iteratedFDeriv_tsum_of_isOpen`); splitting off `n = 0` in\nboth sums gives `θ(0)⁻¹ (∑_{n ≠ 0} D^q K_∞(24 n) u - (θ(0) - 1) D^q K_∞(0) u)`, bounded, with\n`θ(0) ≥ 1` (`Aux.ib_theta0_ge_one`) and `0 ≤ θ(0) - 1 ≤ ∑_{n ≠ 0} imageTerm d n` (`|n|^6 ≥ 1`,\n`Aux.ib_gauss_le_image`), by `76 · 24^6 · 1458 e^(-288) + 15 · 1458 e^(-288)` through the packet's\ntheorems\n`Side24Analysis.derivativeBoundAtLeastOne`, `derivativeBoundAtZero` and `latticeImageSumBound`,\nand `1458 (76 · 24^6 + 15) e^(-288) < imageConstE` through `Side24Elementary.exponentialBounds`.\nDoes not establish: display (2) of the source as the source's object (the alignment of `E d`,\n`Kinf`, `K24`, `thetaSum24`, `IsUnitTuple` and Mathlib's `iteratedFDeriv` with the source's\n`R^d`, `K_infty`, `K_24`, unit directions and derivatives is PENDING_INDEPENDENT_REVIEW); any\nbound for `q > 6` or `d ∉ {2, 3}`; differentiability of `K24` as a statement (it is used inside the\nproof, on the unit ball, through the helper `Aux.ib_iteratedFDeriv_tsum_of_isOpen`, which is a\nhelper of this module, not an inventory theorem and not a Mathlib result); the Prop's hypothesis\n`ThetaSummable d` is not used (the packet's `thetaSummable` proves it for every `d`); the\nstatement module's own `Does not claim:` text, which describes the statement packet and is not\nedited here; the round-4 triage verdict on `ImageBound` (BLOCKED_MISSING_MATHLIB), which is\ntranscribed in the register and not altered here; any enclosure of the coefficient `c_{d,24}`;\nthe disposition of `side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the register,\nnot derived here; nonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. It\npromotes, closes, discharg" + }, + { + "kind": "theorem", + "unqualified_name": "entrywiseCovarianceBound", + "line": 721, + "source_header": "^ 6 + 15) * Real.exp (-288) := hnum.trans hTb\n _ < imageConstE := ib_final_constant\n\n/-- Proves: `UniversalLaw.Spec.Side24.EntrywiseCovarianceBound` (claim `side24-coefficient`),\nfor the formal `C24` and `Cref` of `Specifications.Side24`: for `d ∈ {2, 3}` and every\northonormal frame `R` with `u = R 0`, `|C_24 a b - C_ref a b| ≤ 2 imageConstE` for every pair of\njoint coordinates.\nMethod: the two entries share the factor `svecScale a · svecScale b · (-1)^|b|`, of absolute value\nat most `2`, and their derivative contractions are along the list `jetDirs a ++ jetDirs b` of at\nmost six frame vectors, each of norm one; `imageBound` bounds the difference of the contractions\nby `imageConstE` (strictly).\nDoes not establish: the source's Section 3 sentence as the source's object (the alignment of\n`jetDirs`, `svecScale`, `jointCov`, `C24` and `Cref` with the source's jet, `svec` scaling and\njoint covariances is PENDING_INDEPENDENT_REVIEW); that `C24` or `Cref` is the covariance of any\nrandom vector (no field is constructed); the spectral-norm bound `20E` (not specified); the\nordering `CovarianceOrdering` (a separate theorem of this module); the Prop's hypothesis\n`ThetaSummable d` is passed to `imageBound`, which does not use it; the round-4 triage verdict on\n`EntrywiseCovarianceBound` (BLOCKED_MISSING_MATHLIB), which is transcribed in the register and not\naltered here; any enclosure of the coefficient `c_{d,24}`; the disposition of\n`side24-coefficient` (REVIEWED_SCOPED); nonauthor review or acceptance of\nSIDE24-COEFFICIENT-D23-20260924-v1. It promotes, closes, discharges or reclassifies nothing" + }, + { + "kind": "theorem", + "unqualified_name": "covarianceOrdering", + "line": 768, + "source_header": "mageConstE :=\n mul_le_mul (ec_scale_le a b _) himg.le (abs_nonneg _) (by norm_num)\n\n/-- Proves: `UniversalLaw.Spec.Side24.CovarianceOrdering` (claim `side24-coefficient`), for the\nformal `C24` and `Cref` of `Specifications.Side24`: for `d ∈ {2, 3}` and every orthonormal frame\n`R` with `u = R 0`, `C_24 - (1 - epsilon) C_ref` and `(1 + epsilon) C_ref - C_24` are positive\nsemidefinite in Mathlib's sense (`Matrix.PosSemidef`, which includes `IsHermitian`).\nMethod: `C_24` is symmetric (`Aux.co_C24_hermitian`): by the term-wise derivative a contraction of\n`K_24` at `0` of total order at most `6` is `θ(0)⁻¹ ∑_n` of contractions of the analytic `Kinf d`\nat `24 n`, which are\ninvariant under the block swap (`ContDiffAt.iteratedFDeriv_comp_perm`), and odd total orders\nvanish by reindexing `n ↦ -n` together with `D^q Kinf(-y) = (-1)^q D^q Kinf(y)`\n(`Aux.co_kinf_neg_apply`, from the round-5 helper `Side24Covariance.Aux.cv_kinf_comp_neg`), so the\nsign `(-1)^|b|` may be replaced by `(-1)^|a|`. `C_ref` is\nsymmetric and `C_ref - I/3` positive semidefinite by `Side24Covariance.referenceCovarianceLowerBound`.\nWith `Δ = C_24 - C_ref`, `|Δ a b| ≤ 2 imageConstE` (`entrywiseCovarianceBound`), so\n`|x ⬝ Δ x| ≤ 2 imageConstE · card · (x ⬝ x)` (Cauchy-Schwarz), the cardinality of the joint index\nis at most `d + 1 + d^2 ≤ 13` for `d ≤ 3` (its exact value `6` or `10` is not used), and\n`26 imageConstE (x ⬝ x) ≤ (epsilon / 3) (x ⬝ x) ≤ epsilon (x ⬝ C_ref x)` (`Aux.co_margin` and\n`C_ref - I/3 ≥ 0`), which gives both orderings.\nDoes not establish: display (3) of the source as the source's object (the alignment of `C24`,\n`Cref` and Mathlib's `Matrix.PosSemidef`, `IsHermitian` included, with the source's covariances and\npositive-semidefinite order is PENDING_INDEPENDENT_REVIEW); that `C24` or `Cref` is the\ncovariance of any random vector (no field is constructed); the passage to marginal and\nconditional covariances (not specified); the source's route through the spectral-norm bound `20E`\nand `60E < epsilon` (not reproduced: the proof uses the cruder `2E` times at most `13` coordinates\nand `26E ≤ epsilon / 3`, that is `78E ≤ epsilon`, decided by `norm_num` in the helper\n`Aux.co_margin`; main's `UniversalLaw.Side24.covariance_relative_bound` is neither imported, cited\nnor relied on);\nsymmetry of `Cref d u R` for a general `u` or frame (it is taken from the round-5 theorem at\n`u = R 0` in an orthonormal frame; the helper `Aux.co_C24_hermitian`, stated for every `d`, `u`\nand `R`, is a helper, not an inventory theorem); the Prop's hypothesis `ThetaSummable d` is only\nforwarded, through `entrywiseCovarianceBound`, to `imageBound`, which does not use it; the round-4\ntriage verdict on `CovarianceOrdering` (BLOCKED_MISSING_MATHLIB), which is transcribed in the\nregister and not altered here; any enclosure of the coefficient `c_{d,24}`; the disposition of\n`side24-coefficient` (REVIEWED_SCOPED); nonauthor review or acceptance of\nSIDE24-COEFFICIENT-D23-20260924-v1. It promotes, closes, discharges or reclas" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Structure.lean", + "sha256": "a3c9f514a4d482a99402a57c0097e1819fedbfd71faffaafade3b2050d797598", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "block_nonempty", + "line": 25, + "source_header": "x\n\n/-! ### Blocks of a realized family -/\n\n/-- The blocks of a realized family are nonempty (they have `a_i d_i + 1 ≥ 1` elements). -/\ntheorem block_nonempty {X : Type} [Fintype X] {F : RealizedData X} (hF : IsRealizedFamily F)\n (i : Fin F.b) : (block F i).Non" + }, + { + "kind": "theorem", + "unqualified_name": "blk_eq_of_mem_block", + "line": 33, + "source_header": "pos _\n\n/-- An element of `block F i` has block index `i`. -/\ntheorem blk_eq_of_mem_block {X : Type} [Fintype X] {F : RealizedData X} {i : Fin F.b} {v : X}\n (hv : v ∈ block F i) : F.bl" + }, + { + "kind": "theorem", + "unqualified_name": "mem_block_iff", + "line": 38, + "source_header": "sing hv\n\n/-- Membership in a block. -/\ntheorem mem_block_iff {X : Type} [Fintype X] {F : RealizedData X} {i : Fin F.b} {v : X} :\n v ∈ block F i ↔ F." + }, + { + "kind": "theorem", + "unqualified_name": "block_injective", + "line": 43, + "source_header": "p [block]\n\n/-- The block map of a realized family is injective (blocks are nonempty fibres). -/\ntheorem block_injective {X : Type} [Fintype X] {F : RealizedData X}\n (hF : IsRealizedFamily F) : Function.Injectiv" + }, + { + "kind": "theorem", + "unqualified_name": "famPrice_fullBlockFamily", + "line": 51, + "source_header": "_block hvj]\n\n/-- The price of the full-block family is the sum of the block prices. -/\ntheorem famPrice_fullBlockFamily {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) (c : X → ℝ) :\n famPrice c (fullBlockFamily F) = ∑ i, genPrice" + }, + { + "kind": "theorem", + "unqualified_name": "block_benchmark816", + "line": 58, + "source_header": "ective hF h)]\n\n/-! ### The six-block benchmark -/\n\ntheorem block_benchmark816 (i : Fin 6) :\n block benchmark816 i = {i} ×ˢ (univ : Fi" + }, + { + "kind": "theorem", + "unqualified_name": "card_block_benchmark816'", + "line": 66, + "source_header": "exact Iff.rfl\n\ntheorem card_block_benchmark816' (i : Fin 6) : (block benchmark81" + }, + { + "kind": "theorem", + "unqualified_name": "card_block_benchmark816", + "line": 69, + "source_header": "ntype.card_fin]\n\n/-- The same statement at the dependent index type `Fin benchmark816.b` (definitionally `Fin 6`),\nso that it can be used by `rw` on goals produced from the general definitions. -/\ntheorem card_block_benchmark816 (i : Fin benchmark816.b) : (block benchmark" + }, + { + "kind": "theorem", + "unqualified_name": "mem_H_benchmark816'", + "line": 74, + "source_header": "k_benchmark816' i\n\ntheorem mem_H_benchmark816' {e : Finset (Fin 6)} (he : e ∈ completeClutter" + }, + { + "kind": "theorem", + "unqualified_name": "mem_H_benchmark816", + "line": 78, + "source_header": "t he\n exact he.2\n\ntheorem mem_H_benchmark816 {e : Finset (Fin benchmark816.b)} (he : e ∈ benchmark816.H)" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816_isRealized", + "line": 82, + "source_header": "_benchmark816' he\n\ntheorem benchmark816_isRealized : IsRealizedFa" + }, + { + "kind": "theorem", + "unqualified_name": "famPrice_const_benchmark816", + "line": 92, + "source_header": "benchmark816 hf])\n\n/-- The price of the six full blocks at a constant price vector. -/\ntheorem famPrice_const_benchmark816 (r : ℝ) :\n famPrice (fun _ => r) (fullBlockFamily benchmar" + }, + { + "kind": "theorem", + "unqualified_name": "neg_log_one_sub_gt", + "line": 103, + "source_header": "_eq_mul]\n norm_num\n\n/-- Lower bound on `-log(1 - x)` from the Taylor estimate of Mathlib with three terms. -/\ntheorem neg_log_one_sub_gt (x : ℝ) (hx0 : 0 < x) (hx1 : x < 1 / 4) :\n x + x ^ 2 /" + }, + { + "kind": "theorem", + "unqualified_name": "completeClutter_edge_iff", + "line": 119, + "source_header": "linarith [h2, key]\n\n\n/-! ### Palette numbers of complete clutters -/\n\n/-- For the clutter of all `(s+1)`-subsets, the edge condition of a palette says exactly that every\nlabel lies in at most `s` of the label sets. -/\ntheorem completeClutter_edge_iff (b s : ℕ) {K : ℕ} (P : Fin b → Finset (Fin K)) :\n (∀ e ∈ completeClutter b s, ∀ ℓ : Fin K, ∃ i ∈ e, ℓ ∉ P i) ↔\n ∀ ℓ : Fin K, (univ.filter (fu" + }, + { + "kind": "theorem", + "unqualified_name": "sum_card_eq_sum_fiber", + "line": 147, + "source_header": "have := h ℓ\n omega\n\n/-- Double counting: the total size of the label sets is the sum over labels of their\nmultiplicities. -/\ntheorem sum_card_eq_sum_fiber {b K : ℕ} (P : Fin b → Finset (Fin K)) :\n ∑ i, (P i).card = ∑ ℓ : Fin K, (univ.filt" + }, + { + "kind": "theorem", + "unqualified_name": "palette_lower_bounds", + "line": 159, + "source_header": "rd_filter]\n exact sum_comm\n\n/-- The two necessary conditions for a feasible palette of the complete clutter. -/\ntheorem palette_lower_bounds {b s K : ℕ} {d : Fin b → ℕ}\n (hK : IsPaletteFeasible b (completeClutter b s) d K) :\n (∀ i" + }, + { + "kind": "def", + "unqualified_name": "prefixSum", + "line": 171, + "source_header": "d_fin, smul_eq_mul, mul_comm]\n\n/-- Prefix sums of the demands: `c_i = sum_{j < i} d_j`. -/\ndef prefixSum {b : ℕ}" + }, + { + "kind": "theorem", + "unqualified_name": "prefixSum_add_le_of_lt", + "line": 175, + "source_header": "iv.filter (fun j => j < i), d j\n\ntheorem prefixSum_add_le_of_lt {b : ℕ} (d : Fin b → ℕ) {i i' : Fin b} (h : i < i') :\n prefi" + }, + { + "kind": "theorem", + "unqualified_name": "prefixSum_add_le", + "line": 187, + "source_header": "· exact h\n · exact hj.trans h\n\ntheorem prefixSum_add_le {b : ℕ} (d : Fin b → ℕ) (i : Fin b) :" + }, + { + "kind": "def", + "unqualified_name": "cycLabel", + "line": 194, + "source_header": "e_sum_of_subset (subset_univ _)\n\n/-- The cyclic label of a position. -/\ndef cycLabel (K" + }, + { + "kind": "def", + "unqualified_name": "cycPalette", + "line": 197, + "source_header": "Fin K := ⟨n % K, Nat.mod_lt _ hK⟩\n\n/-- The cyclic palette: block `i` receives the labels of the positions `c_i, ..., c_i + d_i - 1`\nreduced modulo `K`. -/\ndef cycPalette {b : ℕ} (d : Fin b → ℕ) (K : ℕ) (hK :" + }, + { + "kind": "theorem", + "unqualified_name": "mem_cycPalette", + "line": 202, + "source_header": "m d i + d i)).image (cycLabel K hK)\n\ntheorem mem_cycPalette {b : ℕ} (d : Fin b → ℕ) (K : ℕ) (hK : 0 < K) (i : Fin b) (ℓ : Fin K) :\n ℓ ∈ cycPalette d K hK i ↔\n ∃ n, n ∈ Ico (prefixSum d i) (p" + }, + { + "kind": "theorem", + "unqualified_name": "card_cycPalette", + "line": 208, + "source_header": "simp only [mem_image, Fin.ext_iff]\n\ntheorem card_cycPalette {b : ℕ} (d : Fin b → ℕ) (K : ℕ) (hK : 0 < K) (i : Fin b)\n (hd : d i ≤ K)" + }, + { + "kind": "def", + "unqualified_name": "firstPos", + "line": 227, + "source_header": "at h1\n omega\n\nopen Classical in\n/-- The first position of block `i` carrying the label `ℓ` (or `0` if there is none). -/\nnoncomputable def firstPos {b : ℕ} (d :" + }, + { + "kind": "theorem", + "unqualified_name": "firstPos_spec", + "line": 230, + "source_header": "i) ∧ n % K = ℓ then Nat.find h else 0\n\ntheorem firstPos_spec {b : ℕ} (d : Fin b → ℕ) (K ℓ : ℕ) (i : Fin b)\n (hex : ∃ n, n ∈ Ico (prefixSum d i) (prefixSum d i + d i) ∧ n % K = ℓ) :\n firstPos d K ℓ i ∈ Ico (prefixSum d i) (prefixSum" + }, + { + "kind": "theorem", + "unqualified_name": "card_residue_le", + "line": 237, + "source_header": "split_ifs\n exact Nat.find_spec hex\n\n/-- At most `s` positions below `s * K` carry a given residue modulo `K`. -/\ntheorem card_residue_le {K s D : ℕ} (hK : 0 < K) (hD : D ≤ s * K) (ℓ : ℕ) :\n ((range D" + }, + { + "kind": "theorem", + "unqualified_name": "palette_witness", + "line": 253, + "source_header": "2]\n _ = n' := Nat.div_add_mod n' K\n\n/-- The cyclic palette is feasible for the complete clutter whenever the two necessary conditions\nhold. -/\ntheorem palette_witness {b s K : ℕ} (d : Fin b → ℕ) (hdK : ∀ i, d i ≤ K)\n (hsum : ∑ i, d i ≤ s * K) : IsPa" + }, + { + "kind": "theorem", + "unqualified_name": "paletteNumber_completeClutter", + "line": 287, + "source_header": "refixSum_add_le_of_lt d hlt\n omega\n\n/-- The palette number of the complete clutter, display (P9), in expanded form. -/\ntheorem paletteNumber_completeClutter (b s : ℕ) (d : Fin b → ℕ) (hs : 1 ≤ s) :\n paletteNumber b (completeClutter b s) d =\n max (un" + }, + { + "kind": "theorem", + "unqualified_name": "isPaletteFeasible_sum", + "line": 317, + "source_header": "rw [mul_comm]; exact h2 : ∑ i, d i ≤ K * s)\n\n\n/-! ### Palettes exist and are upward closed -/\n\n/-- Disjoint label intervals give a feasible palette of size `sum d_i` for any clutter whose edges\nhave at least two elements. -/\ntheorem isPaletteFeasible_sum {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)\n (hH : ∀ e ∈ H, 2" + }, + { + "kind": "theorem", + "unqualified_name": "isPaletteFeasible_mono", + "line": 341, + "source_header": "ave := prefixSum_add_le_of_lt d hlt\n omega\n\n/-- Feasibility is upward closed in the palette size (for clutters with edges of size `≥ 2`). -/\ntheorem isPaletteFeasible_mono {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)\n (hH : ∀ e ∈ H, 2 ≤ e.card) {K K' : ℕ} (hKK' : K ≤ K')\n (h : IsPale" + }, + { + "kind": "theorem", + "unqualified_name": "isPaletteFeasible_paletteNumber", + "line": 369, + "source_header": ", _, hcast⟩ := hmem\n rw [← hcast]\n simp\n\n/-- The palette number is attained and bounded by `sum d_i` when every edge has size `≥ 2`. -/\ntheorem isPaletteFeasible_paletteNumber {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)\n (hH : ∀ e ∈ H, 2 ≤ e.ca" + }, + { + "kind": "theorem", + "unqualified_name": "isPaletteFeasible_of_paletteNumber_le", + "line": 376, + "source_header": "⟨∑ i, d i, isPaletteFeasible_sum H d hH⟩\n exact h\n\ntheorem isPaletteFeasible_of_paletteNumber_le {b : ℕ} (H : Finset (Finset (Fin b)))\n (d : Fin b → ℕ) (hH : ∀ e ∈ H, 2 ≤ e.card) {K : ℕ} (hK : palet" + }, + { + "kind": "theorem", + "unqualified_name": "paletteNumber_le_of_feasible", + "line": 381, + "source_header": "H d hH hK (isPaletteFeasible_paletteNumber H d hH)\n\ntheorem paletteNumber_le_of_feasible {b : ℕ} (H : Finset (Finset (Fin b))) (d : Fin b → ℕ)\n {K : ℕ} (hK : I" + }, + { + "kind": "theorem", + "unqualified_name": "palette_of_decomposable", + "line": 391, + "source_header": "ype} [Fintype X] [DecidableEq X] {F : RealizedData X}\n\n/-- A `K`-decomposition of `U` yields a palette with `|U ∩ X_i| ≤ a_i |P_i|`: `P_i` is the set of\nparts meeting `X_i`. -/\ntheorem palette_of_decomposable {K : ℕ} {U : Finset X} (h : IsKDecomposable F K U) :\n ∃ P : Fin F.b → Finset (Fin K), (∀ i, (U ∩ block F i).card ≤ F.a i * (P i)" + }, + { + "kind": "def", + "unqualified_name": "idxIn", + "line": 426, + "source_header": "em_image]\n exact ⟨v, hv.1, blk_eq_of_mem_block hv.2⟩\n\n/-- The index of `v` within `U ∩ X_i` (`0` if `v` is not there). -/\nnoncomputable def idxIn (F :" + }, + { + "kind": "theorem", + "unqualified_name": "idxIn_lt", + "line": 430, + "source_header": "ock F i then ((U ∩ block F i).equivFin ⟨v, h⟩).val else 0\n\ntheorem idxIn_lt (F : RealizedData X) (U : Finset X) (i : Fin F.b) {v : X}\n (hv :" + }, + { + "kind": "theorem", + "unqualified_name": "idxIn_inj", + "line": 436, + "source_header": ".card := by\n unfold idxIn\n split_ifs\n exact Fin.isLt _\n\ntheorem idxIn_inj (F : RealizedData X) (U : Finset X) (i : Fin F.b) {v w : X}\n (hv : v ∈ U ∩ block F i) (hw : w ∈ U ∩ b" + }, + { + "kind": "def", + "unqualified_name": "labOf", + "line": 444, + "source_header": "n.injective (Fin.ext h)\n exact congrArg Subtype.val this\n\n/-- The `r`-th label of `P_i`, as an `Option`. -/\nnoncomputable def labOf {b K : ℕ} (P : Fin b" + }, + { + "kind": "theorem", + "unqualified_name": "labOf_mem", + "line": 449, + "source_header": ").card then some ((P i).orderEmbOfFin rfl ⟨r, h⟩) else none\n\ntheorem labOf_mem {b K : ℕ} (P : Fin b → Finset (Fin K)) (i : Fin b) (" + }, + { + "kind": "theorem", + "unqualified_name": "labOf_inj", + "line": 457, + "source_header": "n.some_inj] at h\n rw [← h]\n exact orderEmbOfFin_mem _ _ _\n\ntheorem labOf_inj {b K : ℕ} (P : Fin b → Finset (Fin K)) (i : Fin b) {r r' : ℕ} {ℓ : Fin K}\n (h :" + }, + { + "kind": "theorem", + "unqualified_name": "labOf_isSome", + "line": 465, + "source_header": ").injective (h.trans h'.symm)\n exact Fin.mk.inj_iff.1 this\n\ntheorem labOf_isSome {b K : ℕ} (P : Fin b → Finset (Fin K)) (i : Fin b) {r" + }, + { + "kind": "def", + "unqualified_name": "colOf", + "line": 471, + "source_header": "= some ℓ := by\n unfold labOf\n split_ifs\n exact ⟨_, rfl⟩\n\n/-- The colour of `v`: the `(idx v / a_i)`-th label of `P_{blk v}`. -/\nnoncomputable def colOf (F : RealizedData X) (U : Finset X) {K : ℕ" + }, + { + "kind": "def", + "unqualified_name": "partOf", + "line": 476, + "source_header": "=\n labOf P (F.blk v) (idxIn F U (F.blk v) v / F.a (F.blk v))\n\n/-- The colour class of `ℓ` inside `U`. -/\nnoncomputable def partOf (F : RealizedData X) (U : Finset X) {K" + }, + { + "kind": "theorem", + "unqualified_name": "colOf_isSome", + "line": 481, + "source_header": "n K) : Finset X :=\n U.filter (fun v => colOf F U P v = some ℓ)\n\ntheorem colOf_isSome (hF : IsRealizedFamily F) {U : Finset X} {K : ℕ}\n {P : Fin F.b → Finset (Fin K)} (hcard : ∀ i, (U ∩ block F i).card ≤ F.a i * (P" + }, + { + "kind": "theorem", + "unqualified_name": "partOf_good", + "line": 494, + "source_header": "= h2\n _ = (P (F.blk v)).card * F.a (F.blk v) := mul_comm _ _\n\ntheorem partOf_good (hF : IsRealizedFamily F) {U : Finset X} {K : ℕ}\n {P : Fin F.b → Finset (Fin K)}\n (hedge : ∀ e ∈ F.H, ∀ ℓ : Fin K" + }, + { + "kind": "theorem", + "unqualified_name": "partOf_disjoint", + "line": 545, + "source_header": "f at h1\n rw [hbv] at h1\n exact hni (labOf_mem P i _ ℓ h1)\n\ntheorem partOf_disjoint (F : RealizedData X) (U : Finset X) {K : ℕ}\n (P : Fin F.b → Finset (Fin K)) {ℓ ℓ' : Fin K}" + }, + { + "kind": "theorem", + "unqualified_name": "biUnion_partOf", + "line": 554, + "source_header": "] at hv hv'\n apply h\n rw [← Option.some_inj, ← hv.2, ← hv'.2]\n\ntheorem biUnion_partOf (hF : IsRealizedFamily F) {U : Finset X} {K : ℕ}\n {P : Fin F.b → Finset (Fin K)} (hcard : ∀ i, (U ∩ block F i).card ≤ F.a i * (P i)" + }, + { + "kind": "theorem", + "unqualified_name": "decomposable_of_palette", + "line": 566, + "source_header": "me hF hcard hv\n exact ⟨ℓ, mem_univ _, mem_filter.2 ⟨hv, hℓ⟩⟩\n\n/-- A palette with `|U ∩ X_i| ≤ a_i |P_i|` yields a `K`-decomposition of `U`. -/\ntheorem decomposable_of_palette (hF : IsRealizedFamily F) {K : ℕ} {U : Finset X}\n (P : Fin F.b → Finset (Fin K)) (hcard : ∀ i, (U ∩ block F i).card ≤ F.a i * (P i).card)\n (hedge :" + }, + { + "kind": "theorem", + "unqualified_name": "block_disjoint", + "line": 575, + "source_header": "nt F U P h,\n biUnion_partOf hF hcard⟩\n\nomit [DecidableEq X] in\n/-- Blocks are pairwise disjoint. -/\ntheorem block_disjoint (F : RealizedData X)" + }, + { + "kind": "theorem", + "unqualified_name": "localDecomposability_expanded", + "line": 581, + "source_header": "t h ((blk_eq_of_mem_block hv).symm.trans (blk_eq_of_mem_block hv'))\n\n/-- Section 3: `I_k(D_i) = {S : |S| ≤ a_i k}`, in expanded form. -/\ntheorem localDecomposability_expanded (hF : IsRealizedFamily F) (i : Fin F.b) (k : ℕ)\n (S : Finset" + }, + { + "kind": "theorem", + "unqualified_name": "mem_supp_iff", + "line": 622, + "source_header": "ecidableEq X] {F : RealizedData X}\n\nomit [Fintype X] [DecidableEq X] in\ntheorem mem_supp" + }, + { + "kind": "theorem", + "unqualified_name": "good_of_subset_block", + "line": 624, + "source_header": "F.b} : i ∈ supp F U ↔ ∃ v ∈ U, F.blk v = i := by\n rw [supp, mem_image]\n\n/-- A subset of one block with at most `a_i` elements is good. -/\ntheorem good_of_subset_block (hF : IsRealizedFamily F) {i : Fin F.b} {S :" + }, + { + "kind": "theorem", + "unqualified_name": "erase_inter_block_of_blk_ne", + "line": 647, + "source_header": "p)\n have h2 := hF.2.2.2.1 e he\n rw [card_singleton] at h1\n omega\n\n/-- Removing an element outside `X_i` does not change the intersection with `X_i`. -/\ntheorem erase_inter_block_of_blk_ne {U : Finset X} {v : X}" + }, + { + "kind": "theorem", + "unqualified_name": "minimalForbidden_iff", + "line": 658, + "source_header": "⟨hw, hb⟩\n · rintro ⟨hw, hb⟩\n refine ⟨⟨fun hwv => h (hwv ▸ hb), hw⟩, hb⟩\n\n/-- Proposition P1 in expanded form. -/\ntheorem minimalForbidden_iff (hF : IsRealizedFamily F) (U : Finset X) :\n IsMinimalForbidden F U ↔" + }, + { + "kind": "theorem", + "unqualified_name": "minForb816_iff", + "line": 766, + "source_header": "ting the minimal forbidden sets of the six-block benchmark -/\n\nsection Count816\n\n/-- Proposition P1 for the six-block data (`a_i = 1`). -/\ntheorem minForb816_iff (U : Finset (Fin 6 × Fin 409)) :\n IsMinimalForbidden benchmark816 U ↔\n ((∃ i, U ⊆ block benchmark81" + }, + { + "kind": "theorem", + "unqualified_name": "supp_eq_singleton_of_pair", + "line": 773, + "source_header": "Transversal benchmark816 e U) :=\n minimalForbidden_iff benchmark816_isRealized U\n\ntheorem supp_eq_singleton_of_pair {U : Finset (Fin 6 × Fin 409)} {i : Fin benchmark816.b}" + }, + { + "kind": "def", + "unqualified_name": "pairs816", + "line": 786, + "source_header": "rd_pos.1 (by omega)\n exact mem_supp_iff.2 ⟨v, hv, blk_eq_of_mem_block (hU hv)⟩\n\n/-- T" + }, + { + "kind": "theorem", + "unqualified_name": "mem_pairs816", + "line": 790, + "source_header": "nset (Fin benchmark816.b)).biUnion (fun i => (block benchmark816 i).powersetCard 2)\n\ntheorem mem_pairs816 {U : Finset" + }, + { + "kind": "theorem", + "unqualified_name": "card_pairs816", + "line": 794, + "source_header": "= 2 := by\n simp only [pairs816, mem_biUnion, mem_univ, true_a" + }, + { + "kind": "def", + "unqualified_name": "transOf", + "line": 816, + "source_header": "sals\n\nvariable {ι β : Type} [Fintype ι] [DecidableEq ι] [Fintype β] [DecidableEq β]\n\n/-- The candidate transversals of `e` in a product ground type: the images of `e` under\n`i ↦ (σ i, g i)` for `g` ranging over a product set (`b₀` is a dummy value off `e`). -/\ndef transOf (F : RealizedData (ι" + }, + { + "kind": "theorem", + "unqualified_name": "sigma_injective", + "line": 825, + "source_header": "un i => (σ i, g i)))\n\nomit [Fintype ι] [DecidableEq ι] [Fintype β] [DecidableEq β] in\ntheorem sigma_injective {F : RealizedData (ι × β)} {σ : Fin F.b → ι} (b₀ : β)" + }, + { + "kind": "theorem", + "unqualified_name": "mem_transOf", + "line": 831, + "source_header": "σ _ _).2 rfl\n have hj : F.blk (σ i, b₀) = j := (hσ _ _).2 h\n exact hi.symm.trans hj\n\ntheorem mem_transOf {F : RealizedData (ι × β)} {σ : Fin F.b → ι} {b₀ : β}\n (hσ : ∀ (v : ι × β) (i : Fin F.b), F.blk v = i ↔ v.1 = σ i) (e : Fi" + }, + { + "kind": "theorem", + "unqualified_name": "card_transOf", + "line": 902, + "source_header": ")\n rw [mem_image]\n exact ⟨F.blk v, hv1, this.symm⟩\n\nomit [Fintype ι] in\ntheorem card_transOf {F : RealizedData (ι × β)} {σ : Fin F.b → ι} {b₀ : β}\n (hσ : ∀ (v : ι × β) (i : Fin F.b), F.blk v = i ↔ v.1" + }, + { + "kind": "theorem", + "unqualified_name": "hσ816", + "line": 940, + "source_header": "ht hi, mem_singleton] at h1 h2\n rw [h1, h2]\n\nend Transversals\n\nsection Count816b\n\n/-- The index map of the six-block benchmark is the identity (definitionally). -/\ntheorem hσ816 : ∀ (v : Fin 6 × Fin 409) (i : Fin benchmar" + }, + { + "kind": "def", + "unqualified_name": "transAll816", + "line": 945, + "source_header": "6.blk v = i ↔ v.1 = (fun i => i : Fin benchmark816.b → Fin 6) i :=\n fun _ _ => Iff.rfl" + }, + { + "kind": "theorem", + "unqualified_name": "mem_transAll816", + "line": 949, + "source_header": "nset (Fin 6 × Fin 409)) :=\n benchmark816.H.biUnion (transOf benchmark816 (fun i => i) 0)\n\ntheorem mem_transAll816 {U : Finset (Fin 6" + }, + { + "kind": "theorem", + "unqualified_name": "card_H816", + "line": 953, + "source_header": "nsversal benchmark816 e U := by\n simp only [t" + }, + { + "kind": "theorem", + "unqualified_name": "card_transAll816", + "line": 958, + "source_header": "3).card = 15\n rw [completeClutter, card_powersetCard, card_" + }, + { + "kind": "theorem", + "unqualified_name": "disjoint_pairs816_transAll816", + "line": 974, + "source_header": "it is a naming linter, not a check.\nset_option linter.constructorName" + }, + { + "kind": "theorem", + "unqualified_name": "minForbSet_eq", + "line": 986, + "source_header": "816 he\n rw [hsupp] at h1\n rw [h1, card_singleton] at h2\n exact absurd h2 (by norm_num)\n\ntheorem minForbSet_eq :\n {U : Finset" + }, + { + "kind": "theorem", + "unqualified_name": "minForbSet1_eq", + "line": 993, + "source_header": "oe_union, Set.mem_union, mem_coe, mem_pairs816, mem_transAll816]\n exact minForb816_iff U\n\ntheorem minForbSet1_eq :\n {U : Finset (Fin 6 × Fin 409)" + }, + { + "kind": "theorem", + "unqualified_name": "minForbSet4_eq", + "line": 1008, + "source_header": "⟨Or.inl ⟨i, hUi, hcard⟩, ?_⟩\n rw [supp_eq_singleton_of_pair hUi hcard, card_singleton]\n\ntheorem minForbSet4_eq :\n {U : Finset (Fin 6 × Fin 409) |" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816IsRealized", + "line": 1027, + "source_header": "r ⟨e, he, hsupp, hone⟩, ?_⟩\n rw [hsupp, mem_H_benchmark816 he]\n\nend Count816b\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816IsRealized` (claim `p15-realized-covers`, Section 6\nof P15_REALIZED_COVERS.md: six blocks of `409` coordinates with `a_i = 1`, `d_i = 408`, `H` all\nfour-block subsets).\nMethod: block cardinality `1 * 409 = 409` via the product decomposition of the fibre; clutter\nproperty of `powersetCard 4` by `eq_of_subset_of_card_le`.\nDoes not establish: anything about the informal six-block realization beyond this data record\nsatisfying the formal side conditions; no review, acceptance or" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816Price", + "line": 1037, + "source_header": "6IsRealized : UniversalLaw.Spec.P15.Benchmark816IsRealized :=\n Aux.benchmark816_isRealized\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816Price` (claim `p15-realized-covers`, Section 6:\n\"6/(40900^409)>0\").\nMethod: the full-block family is the image of the injective block map, so its price is the sum\nof six block prices `(1/40900)^409`.\nDoes not establish: that this cover is optimal or that it covers the obstruction\n(`Benchmark816Cover` is a separate `Prop`); no" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816RationalPrice", + "line": 1047, + "source_header": "?_, by positivity⟩\n rw [Aux.famPrice_const_benchmark816, one_div, div_eq_mul_inv, ← inv_pow]\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816RationalPrice` (claim `p15-price-budget-restricted`,\ndisplay (T7) and the explicit rational price of Section 4 of price_budget PROOF.md).\nMethod: `log x ≤ x - 1` for the upper bound; Mathlib's Taylor estimate\n`Real.abs_log_sub_add_sum_range_le` with three terms for `p + p^2/2 < -log(1 - p)`; exact\nrational arithmetic by `norm_num`; the full-block price as six equal block prices.\nDoes not establish: the (T1) budget itself, admissibility of any other price vector, or the\ninformal claim; no review or acc" + }, + { + "kind": "theorem", + "unqualified_name": "elementaryPaletteFormula", + "line": 1074, + "source_header": "linarith\n · exfalso\n exact h (by norm_num)\n · exact Aux.famPrice_const_benchmark816 _\n\n/-- Proves: `UniversalLaw.Spec.P15.ElementaryPaletteFormula` (claim `p15-realized-covers`, display\n(P9) of P15_REALIZED_COVERS.md: for `H` all `(s+1)`-subsets, `K_H(d) = max(max_i d_i,\nceil(sum_i d_i / s))`).\nMethod: for the complete clutter the edge condition says each label lies in at most `s` label\nsets; double counting gives the two necessary conditions `d_i ≤ K` and `sum d_i ≤ s K`; the\ncyclic palette (block `i` takes positions `c_i, …, c_i + d_i - 1` reduced modulo `K`) realizes\nthem; `IsLeast.csInf_eq` identifies `sInf`.\nDoes not establish: the matroid palette formula of Section 5, anything about non-complete\nclutters, or the informal claim; the hypotheses `s ≤ b` and `1 ≤ d_i` of the `Prop` are not\nneeded by this proof and are simply carried; no review or" + }, + { + "kind": "theorem", + "unqualified_name": "triangleNeedsThree", + "line": 1087, + "source_header": ".P15.ElementaryPaletteFormula :=\n fun b s d hs _ _ => Aux.paletteNumber_completeClutter b s d hs\n\n/-- Proves: `UniversalLaw.Spec.P15.TriangleNeedsThree` (claim `p15-realized-covers`, Section 5:\nthe triangle at unit demands needs `3` colors).\nMethod: the complete-clutter formula at `b = 3`, `s = 1`, `d = 1`: `max 1 ⌈3/1⌉₊ = 3`.\nDoes not establish: the informal remark about \"size-two edge loads\"" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816Palette", + "line": 1097, + "source_header": "rfl]\n rw [sup_const univ_nonempty, sum_const, card_univ, Fintype.card_fin, smul_eq_mul]\n norm_num\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816Palette` (claim `p15-realized-covers`, Section 6:\n`K_H(408,...,408) = 816`).\nMethod: the complete-clutter formula at `b = 6`, `s = 3`, `d = 408`: `max 408 ⌈2448/3⌉₊ = 816`.\nDoes not establish: that the full blocks cover the obstruction (`Benchmark816Cover`), or the\ninformal claim" + }, + { + "kind": "theorem", + "unqualified_name": "localDecomposability", + "line": 1108, + "source_header": "_num)]\n rw [sup_const univ_nonempty, sum_const, card_univ, Fintype.card_fin, smul_eq_mul]\n norm_num\n\n/-- Proves: `UniversalLaw.Spec.P15.LocalDecomposability` (claim `p15-realized-covers`, Section 3 of\nP15_REALIZED_COVERS.md: `I_k(D_i) = {S : |S| <= a_i k}`).\nMethod: a decomposition of `S ⊆ X_i` into `k` good parts has parts of size `≤ a_i`; conversely\nthe chunks of size `≤ a_i` of an enumeration of `S` are good (one block, support of size `≤ 1`\ncontains no edge of size `≥ 2`), via the general palette/decomposition correspondence.\nDoes not establish: the informal claim or its review; alignment of `IsKDecomposable` with the\ninformal `I_k`. -/\ntheorem localDecomposability {X : Ty" + }, + { + "kind": "theorem", + "unqualified_name": "localObstructionIsFullBlock", + "line": 1119, + "source_header": "w.Spec.P15.LocalDecomposability F :=\n fun hF i k S hS => Aux.localDecomposability_expanded hF i k S hS\n\n/-- Proves: `UniversalLaw.Spec.P15.LocalObstructionIsFullBlock` (claim `p15-realized-covers`,\ndisplay (P3): the only `d_i`-obstructed subset of `X_i` is `X_i`).\nMethod: `LocalDecomposability` at `k = d_i` and `|X_i| = a_i d_i + 1`.\nDoes not establish: the informal claim or its review. -/\ntheorem localObstructionIsFullBlock {X : Type} [" + }, + { + "kind": "theorem", + "unqualified_name": "fullBlockCoverIff", + "line": 1135, + "source_header": "exact eq_of_subset_of_card_le hS (by omega)\n · intro h\n rw [h, hcard]\n exact Nat.lt_succ_self _\n\n/-- Proves: `UniversalLaw.Spec.P15.FullBlockCoverIff` (claim `p15-realized-covers`, Proposition\nP2, display (P7): the family of full blocks covers `O_K(D)` iff `K >= K_H(d)`).\nMethod: a set containing no full block has `|U ∩ X_i| ≤ a_i d_i`, so a palette for `d` at `K`\ncolours it; conversely the set missing one chosen vertex per block is `K`-decomposable, and the\nparts meeting each block form a feasible palette, so `K_H(d) ≤ K`. Attainment of `K_H(d)` and\nupward closure of feasibility are proved via disjoint label intervals.\nDoes not establish: optimality of other covers, the unrestricted prize, the informal claim or\nits review (disposition transcribed in the statement: HOLD_WITH_DOMAIN). -/\ntheorem fullBlockCoverIff" + }, + { + "kind": "theorem", + "unqualified_name": "wholeGroundChromaticNumber", + "line": 1195, + "source_header": "∩ block F i).card ≤ F.a i * F.d i := by omega\n _ ≤ F.a i * (P i).card := Nat.mul_le_mul_left _ (hPd i)\n\n/-- Proves: `UniversalLaw.Spec.P15.WholeGroundChromaticNumber` (claim `p15-realized-covers`,\nSection 4: the chromatic number of the entire ground set is `K_H(d+1)`).\nMethod: the palette/decomposition correspondence with `|X_i| = a_i d_i + 1`, which lies in\n`(a_i d_i, a_i (d_i + 1)]`, so the demands are exactly `d_i + 1`.\nDoes not establish: the informal claim or its review. -/\ntheorem wholeGroundChromaticNumber {X : Ty" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816WholeGround", + "line": 1227, + "source_header": "(F.d i + 1) := by rw [mul_add, mul_one]; omega\n _ ≤ F.a i * (P i).card := Nat.mul_le_mul_left _ (hPd i)\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816WholeGround` (claim `p15-realized-covers`, Section\n6: the whole ground set needs `818` colors).\nMethod: `WholeGroundChromaticNumber` for the six-block data and the complete-clutter palette\nformula at demands `409`: `max 409 ⌈2454/3⌉₊ = 818`.\nDoes not establish: the i" + }, + { + "kind": "theorem", + "unqualified_name": "minimalForbiddenCharacterisation", + "line": 1244, + "source_header": "intype.card_fin, smul_eq_mul]\n norm_num\n constructor\n · rw [h 818, hpal]\n · rw [h 817, hpal]\n norm_num\n\n/-- Proves: `UniversalLaw.Spec.P15.MinimalForbiddenCharacterisation` (claim `p15-realized-covers`,\nProposition P1 of P15_REALIZED_COVERS.md: the inclusion-minimal forbidden sets are exactly the\n`(a_i+1)`-subsets of a single block and the transversals of the edges).\nMethod: a capacity violation in block `i` forces `U ⊆ X_i` with `|U| = a_i + 1` (removing any\noutside vertex or any vertex keeps the violation); otherwise an edge `e ⊆ supp U` forces each\nvertex to be alone in its block with its block in `e`. Conversely both families are forbidden\nand every one-vertex deletion is good (one-block sets of size `≤ a_i`; the clutter property for\ntransversals).\nDoes not establish: the informal claim or its review; alignment of `IsMinimalForbidden` with the\ninformal notion. -/\ntheorem minimalForbiddenCharacterisation {X : Type" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816MinimalForbiddenCounts", + "line": 1258, + "source_header": "Data X) : UniversalLaw.Spec.P15.MinimalForbiddenCharacterisation F :=\n fun hF U => Aux.minimalForbidden_iff hF U\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816MinimalForbiddenCounts` (claim\n`p15-realized-covers`, display (P10): `6 * binom(409,2)` internal pairs, `15 * 409^4` crossing\ntransversal quadruples, and nothing else).\nMethod: Proposition P1 (`MinimalForbiddenCharacterisation`) for the six-block data; the pairs\nare the disjoint union over the six blocks of `powersetCard 2`; the transversals of a four-edge\nare the images of `e` under `i ↦ (i, g i)` for `g` in a product set of size `409^4`, counted by\n`card_image_of_injOn` and `Fintype.card_piFinset`; the two families are disjoint by the size of\nthe support. No enumeration of subsets is performed.\nDoes not establish: the informal claim or its review; the evaluations `500616` and\n`419743994415` (core-Lean targets on" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Analysis.lean", + "sha256": "7cf64095450464b5974e381f9c6d1ed238473dd931ff558cad67db1d9a62acbc", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "th_latticeVec_apply", + "line": 83, + "source_header": "x\n\n/-! ## `th_`: the theta family (`ThetaSummable`) -/\n\n/-! ### (a) Coordinates and squared norm of the lattice vector `24 n` -/\n\n/-- The `i`-th coordinate of `latticeVec d n` is `24 n_i`. -/\ntheorem th_latticeVec_apply (d : ℕ) (n : Fin d → ℤ) (i : Fin d) :\n latticeVec d n i = 24 * (n" + }, + { + "kind": "theorem", + "unqualified_name": "th_norm_latticeVec_sq", + "line": 92, + "source_header": "iceVec]\n\n/-- `‖24 n‖^2 = 576 * ∑ i, n_i^2` (`EuclideanSpace.norm_sq_eq`, coordinatewise). -/\ntheorem th_norm_latticeVec_sq (d : ℕ) (n : Fin d → ℤ) :\n ‖latticeVec d n‖ ^ 2 = 576 * intN" + }, + { + "kind": "theorem", + "unqualified_name": "th_exp_neg_norm_latticeVec_sq", + "line": 100, + "source_header": "s]\n ring\n\n/-- `exp(-‖24 n‖^2/4) = ∏ i, exp(-144 n_i^2)`, by `Real.exp_sum` and the previous lemma. -/\ntheorem th_exp_neg_norm_latticeVec_sq (d : ℕ) (n : Fin d → ℤ) :\n Real.exp (-(‖latticeVec d n‖ ^ 2) / 4) = ∏ i, Real.exp (-144 * ((n i : ℤ" + }, + { + "kind": "theorem", + "unqualified_name": "th_summable_gauss_int", + "line": 109, + "source_header": "> ?_\n ring\n\n/-! ### (b) One-dimensional Gaussian summability on `ℤ` -/\n\n/-- `m ↦ exp(-c m^2)` is summable on `ℤ` for `c > 0`: Mathlib's\n`HurwitzKernelBounds.summable_f_int 0 0` at `t = c/π` after `-π m^2 (c/π) = -c m^2`. -/\ntheorem th_summable_gauss_int (c : ℝ) (hc : 0 < c) :\n Summable (fun m : ℤ => Real.exp (-c" + }, + { + "kind": "theorem", + "unqualified_name": "th_summable_pi_prod", + "line": 121, + "source_header": "1\n field_simp\n\n/-! ### (c) Products of a summable nonnegative function over `Fin d → ℤ` -/\n\n/-- For a nonnegative summable `g : ℤ → ℝ`, the product `n ↦ ∏ i, g (n i)` is summable over\n`Fin d → ℤ`: a finite set `s` of lattice points lies in the box `Fintype.piFinset t` with\n`t i = s.image (· i)`, over which the sum factors as `∏ i, ∑ m ∈ t i, g m ≤ (∑' m, g m)^d`. -/\ntheorem th_summable_pi_prod (d : ℕ) (g : ℤ → ℝ) (hg0 : ∀ m, 0 ≤ g m) (hg : Summable g) :\n Summable (fun n : Fin d →" + }, + { + "kind": "theorem", + "unqualified_name": "th_exp_shift_le", + "line": 144, + "source_header": "g m) ^ d := by simp\n\n/-! ### (d) The pointwise shift bound -/\n\n/-- `exp(-‖z + v‖^2/2) ≤ exp(‖z‖^2/2) exp(-‖v‖^2/4)`: from `‖v‖ ≤ ‖z + v‖ + ‖z‖` one has\n`‖v‖^2/4 ≤ (‖z + v‖ + ‖z‖)^2/4 ≤ ‖z + v‖^2/2 + ‖z‖^2/2`. -/\ntheorem th_exp_shift_le (d : ℕ) (z v : E d) :\n Real.exp (-(‖z + v‖ ^ 2) / 2) ≤ Real.exp (‖z‖ ^ 2 / 2) * Re" + }, + { + "kind": "theorem", + "unqualified_name": "th_summable_dominant", + "line": 159, + "source_header": "nonneg (‖z + v‖ - ‖z‖)]\n\n/-- The dominating family `n ↦ exp(‖z‖^2/2) ∏ i, exp(-144 n_i^2)` is summable over\n`Fin d → ℤ`. -/\ntheorem th_summable_dominant (d : ℕ) (z : E d) :\n Summable (fun n : Fin d → ℤ =>\n Real.exp (‖z‖ ^ 2 / 2) * ∏ i, Real.exp (-14" + }, + { + "kind": "theorem", + "unqualified_name": "th_term_le_dominant", + "line": 167, + "source_header": "by norm_num))).mul_left _\n\n/-- Each theta term is bounded by the corresponding dominating term. -/\ntheorem th_term_le_dominant (d : ℕ) (z : E d) (n : Fin d → ℤ) :\n Real.exp (-(‖z + latticeVec d n‖ ^ 2) / 2) ≤\n Real.exp (‖z‖ ^ 2 / 2) * ∏ i, Real.exp (" + }, + { + "kind": "theorem", + "unqualified_name": "dp_contDiff_Kinf", + "line": 176, + "source_header": "exp_neg_norm_latticeVec_sq]\n\n/-! ## `dp_`: the derivative pairing bound (`DerivativePairingBound`) -/\n\n/-! ### Smoothness and first derivative of the reference kernel `Kinf` -/\n\n/-- `Kinf d = exp (-‖·‖^2 / 2)` is `C^∞` on `E d`. -/\ntheorem dp_contDiff_Kin" + }, + { + "kind": "theorem", + "unqualified_name": "dp_hasFDerivAt_Kinf", + "line": 187, + "source_header": "exact Real.contDiff_exp.comp h\n\n/-- The first derivative of `Kinf d` at `x` is `Kinf d x • (-(innerSL ℝ x))`, i.e.\n`v ↦ -⟪x, v⟫ Kinf d x`. -/\ntheorem dp_hasFDerivAt_Kinf (d : ℕ) (x : E d) :\n HasFDerivAt (Kinf" + }, + { + "kind": "theorem", + "unqualified_name": "dp_fderiv_Kinf", + "line": 203, + "source_header": "v\n simp [Kinf]\n left\n ring\n\n/-- The derivative function of `Kinf d`. -/\ntheorem dp_fderiv_Kinf (d : ℕ) :\n fderiv ℝ (Kinf d) =" + }, + { + "kind": "theorem", + "unqualified_name": "dp_contDiff_g", + "line": 208, + "source_header": "y => (dp_hasFDerivAt_Kinf d y).fderiv\n\n/-! ### The operator-valued factor `g y = -(innerSL ℝ y)` -/\n\n/-- `y ↦ -(innerSL ℝ y)` is `C^∞` (it is a continuous linear map). -/\ntheorem dp_contDiff_g (d : ℕ) : Con" + }, + { + "kind": "theorem", + "unqualified_name": "dp_g_eq", + "line": 214, + "source_header": "inuousLinearMap.contDiff (innerSL ℝ)).neg\n\n/-- The factor as the coercion of the continuous linear map `-(innerSL ℝ)`. -/\ntheorem dp_g_eq (d : ℕ) :\n (fun y" + }, + { + "kind": "theorem", + "unqualified_name": "dp_norm_g_zero", + "line": 220, + "source_header": "erSL ℝ (E := E d))) := by\n funext y\n simp\n\n/-- Order zero: `‖g x‖ = ‖x‖` (`innerSL_apply_norm`). -/\ntheorem dp_norm_g_zero (d : ℕ) (x : E d) :\n ‖iteratedFDeriv" + }, + { + "kind": "theorem", + "unqualified_name": "dp_norm_g_one", + "line": 225, + "source_header": "tedFDeriv_zero, norm_neg, innerSL_apply_norm]\n\n/-- Order one: `‖D g x‖ = ‖innerSL ℝ‖ ≤ 1` (`norm_innerSL_le`). -/\ntheorem dp_norm_g_one (d : ℕ) (x : E d) :\n ‖iteratedFD" + }, + { + "kind": "theorem", + "unqualified_name": "dp_g_higher", + "line": 231, + "source_header": "Map.fderiv, norm_neg]\n exact norm_innerSL_le ℝ\n\n/-- Orders `k ≥ 2` of the linear factor vanish. -/\ntheorem dp_g_higher (d : ℕ) (x : E d) (k : ℕ) (hk : 2 ≤ k) :\n iterate" + }, + { + "kind": "theorem", + "unqualified_name": "dp_recursion", + "line": 242, + "source_header": "ero_apply]\n exact LinearIsometryEquiv.map_zero _\n\n/-! ### The Hermite-type recursion for the operator norms -/\n\n/-- Hermite-type recursion for `b_q = ‖D^q Kinf (x)‖`:\n`b_{q+2} ≤ ‖x‖ b_{q+1} + (q+1) b_q`, from `norm_iteratedFDeriv_fderiv`, the explicit first\nderivative, and the Leibniz bound `norm_iteratedFDeriv_smul_le` in which only the terms\n`i = q` and `i = q + 1` of the binomial sum survive. -/\ntheorem dp_recursion (d : ℕ) (x : E d) (q : ℕ) :\n ‖iteratedFDeriv ℝ (q + 2) (Kinf d) x‖ ≤\n ‖x‖ * ‖iteratedFDeriv ℝ (q + 1) (Kinf d) x" + }, + { + "kind": "theorem", + "unqualified_name": "dp_Kinf_pos", + "line": 269, + "source_header": "l_nonneg (by positivity : (0 : ℝ) ≤ (q : ℝ) + 1) hb)]\n\n/-! ### The seven explicit orders -/\n\n/-- `Kinf d x > 0`" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b0", + "line": 274, + "source_header": "nf_pos (d : ℕ) (x : E d) : 0 < Kinf d x := Real.exp_pos _\n\n/-- `b_0 = Kinf d x`. -/\ntheorem dp_b0 (d" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b1", + "line": 278, + "source_header": "Deriv_zero, Real.norm_eq_abs, abs_of_pos (dp_Kinf_pos d x)]\n\n/-- `b_1 = Kinf d x * ‖x‖`. -/\ntheorem dp_b1 (d : ℕ)" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b2", + "line": 283, + "source_header": "ply_norm,\n Real.norm_eq_abs, abs_of_pos (dp_Kinf_pos d x)]\n\n/-- `b_2 ≤ Kinf d x * (‖x‖^2 + 1)`. -/\ntheorem dp_b2 (d : ℕ) (x : E d) :" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b3", + "line": 291, + "source_header": "d x 0\n rw [dp_b1, dp_b0] at h\n push_cast at h\n nlinarith [h]\n\n/-- `b_3 ≤ Kinf d x * (‖x‖^3 + 3 ‖x‖)`. -/\ntheorem dp_b3 (d : ℕ) (x : E d) :" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b4", + "line": 301, + "source_header": "_\n push_cast at h\n nlinarith [mul_le_mul_of_nonneg_left h2 hr]\n\n/-- `b_4 ≤ Kinf d x * (‖x‖^4 + 6 ‖x‖^2 + 3)`. -/\ntheorem dp_b4 (d : ℕ) (x : E d) :\n ‖iter" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b5", + "line": 311, + "source_header": "eg _\n push_cast at h\n nlinarith [mul_le_mul_of_nonneg_left h3 hr]\n\n/-- `b_5 ≤ Kinf d x * (‖x‖^5 + 10 ‖x‖^3 + 15 ‖x‖)`. -/\ntheorem dp_b5 (d : ℕ) (x : E d) :\n ‖iteratedFD" + }, + { + "kind": "theorem", + "unqualified_name": "dp_b6", + "line": 321, + "source_header": "nneg _\n push_cast at h\n nlinarith [mul_le_mul_of_nonneg_left h4 hr]\n\n/-- `b_6 ≤ Kinf d x * (‖x‖^6 + 15 ‖x‖^4 + 45 ‖x‖^2 + 15)`. -/\ntheorem dp_b6 (d : ℕ) (x : E d) :\n ‖iteratedFDeriv ℝ 6 (Kin" + }, + { + "kind": "theorem", + "unqualified_name": "dp_pairing_all", + "line": 332, + "source_header": "nonneg _\n push_cast at h\n nlinarith [mul_le_mul_of_nonneg_left h5 hr]\n\n/-- For `q ≤ 6`, `b_q ≤ Kinf d x * pairingSum q ‖x‖`: the explicit bounds `dp_b0` to `dp_b6`\nmatch the unfolded pairing sums (`Finset.sum_range_succ`, `Nat.factorial`). -/\ntheorem dp_pairing_all (d : ℕ) (x : E d) (q : ℕ) (hq : q" + }, + { + "kind": "theorem", + "unqualified_name": "dp_abs_le_opNorm", + "line": 362, + "source_header": "simp [pairingSum, Finset.sum_range_succ, Nat.factorial]\n try ring\n\n/-! ### Contraction at a unit tuple -/\n\n/-- At a unit tuple the contraction is bounded by the operator norm\n(`ContinuousMultilinearMap.le_opNorm` with `∏ ‖u i‖ = 1`). -/\ntheorem dp_abs_le_opNorm (d q : ℕ) (x : E d) (u : Fin q → E d) (hu : IsUnitTuple d q" + }, + { + "kind": "theorem", + "unqualified_name": "d1_pairingSum_le_of_one_le", + "line": 373, + "source_header": "(fun i _ => hu i)\n rw [hp, mul_one] at h\n simpa [Real.norm_eq_abs] using h\n\n/-! ## `d1_`: the derivative bound at `|x| ≥ 1` (`DerivativeBoundAtLeastOne`) -/\n\n/-! ### The elementary pairing-sum bound at `r ≥ 1` -/\n\n/-- For `q ≤ 6` and `1 ≤ r`, `pairingSum q r ≤ 76 r^6`. Each pairing sum unfolds\n(`Finset.sum_range_succ`, `Nat.factorial`) to a polynomial with nonnegative coefficients summing\nto `1, 1, 2, 4, 10, 26, 76` for `q = 0, …, 6`; every monomial `r^k`, `k ≤ 6`, is at most `r^6`\n(`pow_le_pow_right₀`, `one_le_pow₀`). -/\ntheorem d1_pairingSum_le_of" + }, + { + "kind": "theorem", + "unqualified_name": "d1_derivativeBoundAtLeastOne_of_derivativePairingBound", + "line": 393, + "source_header": "ge_zero,\n Nat.factorial] <;> norm_num <;> nlinarith [h0, h1, h2, h3, h4, h5, hr]\n\n/-! ### Hypothesis form: the Prop from `DerivativePairingBound` -/\n\n/-- `DerivativeBoundAtLeastOne` from `DerivativePairingBound`: at `1 ≤ ‖x‖` the pairing bound\n`|D^q Kinf (x) u| ≤ exp(-‖x‖²/2) · pairingSum q ‖x‖` and `pairingSum q ‖x‖ ≤ 76 ‖x‖^6`\n(`d1_pairingSum_le_of_one_le`) give the Prop by `mul_le_mul_of_nonneg_left` with\n`0 ≤ exp(-‖x‖²/2)` (`Real.exp_pos`). -/\ntheorem d1_derivativeBoundAtLeastOne_of_derivativePairingBound\n (h : UniversalLaw.Spec." + }, + { + "kind": "theorem", + "unqualified_name": "d0_pairingSum_zero_le", + "line": 412, + "source_header": "mul_of_nonneg_left hps hexp\n _ = 76 * ‖x‖ ^ 6 * Real.exp (-(‖x‖ ^ 2) / 2) := by ring\n\n/-! ## `d0_`: the derivative bound at the origin (`DerivativeBoundAtZero`) -/\n\n/-! ### The pairing sums at the origin -/\n\n/-- At `r = 0` the pairing sums of order `q ≤ 6` are `1, 0, 1, 0, 3, 0, 15` (only the `j = q/2`\nterm of an even order survives, `0 ^ 0 = 1`), he" + }, + { + "kind": "theorem", + "unqualified_name": "d0_derivativeBoundAtZero_of_derivativePairingBound", + "line": 421, + "source_header": "y\n interval_cases q <;> simp [pairingSum, Finset.sum_range_succ, Nat.factorial] <;> norm_num\n\n/-! ### The hypothesis form: the bound at the origin from the pairing bound -/\n\n/-- `DerivativeBoundAtZero` from `DerivativePairingBound` taken as a hypothesis: specialise the\npairing bound to `x = 0`, where `‖0‖ = 0` and `exp (-(0 ^ 2) / 2) = 1`, and bound\n`pairingSum q 0 ≤ 15` by `d0_pairingSum_zero_le`. -/\ntheorem d0_derivativeBoundAtZero_of_derivativePairingBound\n (h : Univ" + }, + { + "kind": "theorem", + "unqualified_name": "rb_kinf_contDiff", + "line": 436, + "source_header": "d)‖ = pairingSum q 0 := by\n simp\n rw [hx] at h0\n exact h0.trans (d0_pairingSum_zero_le q hq)\n\n/-! ## `rb_`: the Section 1 reference blocks (`ReferenceOddAndPinBlocks`) -/\n\n/-! ### (a) Smoothness and first derivative of the reference kernel -/\n\n/-- `Kinf d = exp (-‖·‖^2 / 2)` is `C^∞` (" + }, + { + "kind": "theorem", + "unqualified_name": "rb_hasFDerivAt_kinf", + "line": 445, + "source_header": "d) := by\n unfold Kinf\n exact ContDiff.exp (ContDiff.div_const (ContDiff.neg (contDiff_norm_sq ℝ)) 2)\n\n/-- The Fréchet derivative of `Kinf d` at `y`, as `HasFDerivAt` (chain rule through\n`hasStrictFDerivAt_norm_sq` and `HasFDerivAt.exp`). -/\ntheorem rb_hasFDerivAt_kinf {d : ℕ} (y : E d" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_kinf", + "line": 457, + "source_header": ".congr_of_eventuallyEq (Filter.Eventually.of_forall fun z => ?_)\n simp [div_eq_mul_inv]\n exact h1.exp\n\n/-- `fderiv ℝ (Kinf d) y v = -(⟪y, v⟫ * K" + }, + { + "kind": "theorem", + "unqualified_name": "rb_peel", + "line": 464, + "source_header": "* Kinf d y) := by\n rw [(rb_hasFDerivAt_kinf y).fderiv]\n simp [Kinf, two_smul, innerSL_apply_apply]\n ring\n\n/-! ### (b) Peeling one direction off an iterated derivative -/\n\n/-- For a `C^∞` real function `f`, `D^{n+1} f x [m] = D^n (y ↦ D f y (m (Fin.last n))) x [Fin.init m]`\n(`iteratedFDeriv_succ_apply_right` with `iteratedFDeriv_clm_apply_const_apply`). -/\ntheorem rb_peel {d : ℕ} (f : E d → ℝ) (hf : ContDiff ℝ (⊤ : ℕ∞) f) (n : ℕ) (x : E d)\n (m : Fin (n + 1) → E d) :\n it" + }, + { + "kind": "theorem", + "unqualified_name": "rb_inner_contDiff", + "line": 476, + "source_header": "ly_right]\n rw [iteratedFDeriv_clm_apply_const_apply (contDiff_infty_iff_fderiv.mp hf).2\n (mod_cast le_top)]\n\n/-- `y" + }, + { + "kind": "theorem", + "unqualified_name": "rb_g1_contDiff", + "line": 480, + "source_header": "_contDiff {d : ℕ} (v : E d) : ContDiff ℝ (⊤ : ℕ∞) (fun y : E d => ⟪y, v⟫) :=\n contDiff_id.inner ℝ contDiff_const\n\n/-! ### (c) Level one: `g₁ y = -(⟪y, v⟫ Kinf d y)` -/\n\n/-- Smoothness of the level-one" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_g1", + "line": 487, + "source_header": ":\n ContDiff ℝ (⊤ : ℕ∞) (fun y : E d => -(⟪y, v⟫ * Kinf d y)) :=\n ((rb_inner_contDiff v).mul rb_kinf_contDiff).neg\n\n/-- Derivative of the level-one function in direction `w`. -/\ntheorem rb_fderiv_g1 {d : ℕ} (v y w :" + }, + { + "kind": "theorem", + "unqualified_name": "rb_g2_contDiff", + "line": 497, + "source_header": "(rb_hasFDerivAt_kinf y)).neg\n rw [h.fderiv]\n simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]\n ring\n\n/-! ### (d) Level two: `g₂ y = -(⟪w, v⟫ Kinf d y) + ⟪y, v⟫ ⟪y, w⟫ Kinf d y` -/\n\n/-- Smoothness of the level-two function. -/\ntheorem rb_g" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_g2", + "line": 505, + "source_header": "(contDiff_const.mul rb_kinf_contDiff).neg.add\n (((rb_inner_contDiff v).mul (rb_inner_contDiff w)).mul rb_kinf_contDiff))\n\n/-- Derivative of the level-two function in direction `a`. -/\ntheorem rb_fderiv_g2 {d : ℕ} (v w y a : E d) :\n fderiv ℝ (fun y : E d => -(⟪w, v⟫ * Kinf d y) + ⟪y, v⟫ * ⟪y, w⟫ * Kinf d y) y a =" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_g3_zero", + "line": 519, + "source_header": "w y))).mul (rb_hasFDerivAt_kinf y))\n rw [h.fderiv]\n simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]\n ring\n\n/-! ### (e) Level three at the origin, general directions -/\n\n/-- Derivative at `0` of the level-three function in direction `c`: the three pairings. -/\ntheorem rb_fderiv_g3_zero {d : ℕ} (v w a c : E d) :\n fderiv ℝ (fun y : E d => ⟪w, v⟫ * ⟪y, a⟫ * Kinf d y\n + (⟪a, v⟫ * ⟪y, w⟫ + ⟪y, v⟫" + }, + { + "kind": "theorem", + "unqualified_name": "rb_order_four", + "line": 543, + "source_header": "inner ℝ (hasFDerivAt_const a 0))).mul\n (rb_hasFDerivAt_kinf 0))\n rw [h.fderiv]\n simp [Kinf, fderivInnerCLM_apply]\n ring\n\n/-- Fourth-order contraction of `Kinf d` at `0`: `D^4 Kinf 0 [c, a, w, v]` is the sum of the\nthree pairings `⟪w, v⟫⟪c, a⟫ + ⟪a, v⟫⟪c, w⟫ + ⟪c, v⟫⟪a, w⟫`. -/\ntheorem rb_order_four {" + }, + { + "kind": "theorem", + "unqualified_name": "rb_P3_contDiff", + "line": 569, + "source_header": "a, v⟫ * ⟪y, w⟫ + ⟪y, v⟫ * ⟪a, w⟫) * Kinf d y\n - ⟪y, v⟫ * ⟪y, w⟫ * ⟪y, a⟫ * Kinf d y) 0 c = _\n exact rb_fderiv_g3_zero v w a c\n\n/-! ### (f) Levels three to five along one direction `u` (Hermite forms) -/\n\n/-- Smoothness of `(3 ⟪u,u⟫ ⟪y,u⟫ - ⟪y,u⟫^3) Kinf d y`. -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_P3", + "line": 578, + "source_header": "(rb_inner_contDiff u)).sub\n (((rb_inner_contDiff u).mul (rb_inner_contDiff u)).mul (rb_inner_contDiff u))).mul\n rb_kinf_contDiff\n\n/-- Derivative along `u` of the level-three Hermite form. -/\ntheorem rb_fderiv_P3 {d : ℕ} (u y : E d) :\n fderiv ℝ (fun y : E d => (3 * ⟪u, u⟫ * ⟪y, u⟫ - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y," + }, + { + "kind": "theorem", + "unqualified_name": "rb_P4_contDiff", + "line": 592, + "source_header": ".mul hin).mul hin)).mul (rb_hasFDerivAt_kinf y)\n rw [h.fderiv]\n simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]\n ring\n\n/-- Smoothness of the level-four Hermite form. -/\ntheorem rb_P4_contDiff {d : ℕ} (u : E d) : ContDiff ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_P4", + "line": 601, + "source_header": "d\n ((((rb_inner_contDiff u).mul (rb_inner_contDiff u)).mul (rb_inner_contDiff u)).mul\n (rb_inner_contDiff u))).mul rb_kinf_contDiff\n\n/-- Derivative along `u` of the level-four Hermite form. -/\ntheorem rb_fderiv_P4 {d : ℕ} (u y : E d) :\n fderiv ℝ (fun y : E d => (3 * ⟪u, u⟫ * ⟪u, u⟫ - 6 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫)\n + ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) y u =" + }, + { + "kind": "theorem", + "unqualified_name": "rb_fderiv_P5_zero", + "line": 617, + "source_header": "hin).mul hin).mul hin)).mul (rb_hasFDerivAt_kinf y)\n rw [h.fderiv]\n simp [Kinf, two_smul, innerSL_apply_apply, fderivInnerCLM_apply]\n ring\n\n/-- Derivative at `0` along `u` of the level-five Hermite form: `-15 ⟪u, u⟫^3`. -/\ntheorem rb_fderiv_P5_zero {d : ℕ} (u : E d) :\n fderiv ℝ (fun y : E d => (-15 * (⟪u, u⟫ * ⟪u, u⟫) * ⟪y, u⟫\n + 10 * ⟪u," + }, + { + "kind": "theorem", + "unqualified_name": "rb_order_six", + "line": 634, + "source_header": ").sub\n ((((hin.mul hin).mul hin).mul hin).mul hin)).mul (rb_hasFDerivAt_kinf 0)\n rw [h.fderiv]\n simp [Kinf, fderivInnerCLM_apply]\n ring\n\n/-- Sixth-order contraction of `Kinf d` at `0` along one direction: `-" + }, + { + "kind": "theorem", + "unqualified_name": "rb_order_two", + "line": 674, + "source_header": "+ 10 * ⟪u, u⟫ * (⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫)\n - ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫ * ⟪y, u⟫) * Kinf d y) 0 u = _\n exact rb_fderiv_P5_zero u\n\n/-! ### (g) Second-order contraction and the blocks in an orthonormal frame -/\n\n/-- Second-order contra" + }, + { + "kind": "theorem", + "unqualified_name": "rb_gradCov", + "line": 685, + "source_header": "dFDeriv_one_apply]\n simp only [rb_fderiv_kinf]\n show fderiv ℝ (fun y : E d => -(⟪y, b⟫ * Kinf d y)) 0 a = -⟪a, b⟫\n rw [rb_fderiv_g1]\n simp [Kinf]\n\n/-- The gradient block of" + }, + { + "kind": "theorem", + "unqualified_name": "rb_pinCov", + "line": 692, + "source_header": "d (Kinf d) R = 1 := by\n ext i j\n simp only [gradCov, Matrix.of_apply, rb_order_two, neg_neg, Matrix.one_apply]\n exact orthonormal_iff_ite.mp hR i j\n\n/-- The pin block of `Kinf d` with `u = R 0` in an orthonormal frame is `diagonal (3, 1, …, 1)`. -/\ntheorem rb_pinCov {d : ℕ} (h" + }, + { + "kind": "theorem", + "unqualified_name": "rb_thirdGradCov", + "line": 710, + "source_header": "j\n norm_num\n · simp [Ne.symm hj]\n · by_cases hj : j = ⟨0, hd⟩\n · subst hj\n simp [hi, Ne.symm hi]\n · simp [hi, Ne.symm hi, Ne.symm hj]\n\n/-- The third-derivative/gradient covariance vector of `Kinf d` with `u = R 0` is\n`(-3, 0, …, 0)`. -/\ntheorem rb_thir" + }, + { + "kind": "theorem", + "unqualified_name": "rb_thirdVar", + "line": 722, + "source_header": "rb_order_four, hite]\n by_cases hj : j = ⟨0, hd⟩\n · simp [hj]; norm_num\n · have hj' : ¬ ((⟨0, hd⟩ : Fin d) = j) := fun h => hj h.symm\n simp [hj, hj']\n\n/-- The third-derivative variance of `Kinf d` along a u" + }, + { + "kind": "theorem", + "unqualified_name": "rb_condThirdVariance", + "line": 729, + "source_header": "Orthonormal ℝ R) :\n thirdVar d (Kinf d) (R ⟨0, hd⟩) = 15 := by\n have hite := orthonormal_iff_ite.mp hR\n simp only [thirdVar, rb_order_six, hite]\n simp\n\n/-- The Schur complement `condThirdVariance` of `Kinf d` in an orthonormal frame is `" + }, + { + "kind": "theorem", + "unqualified_name": "rp_det_pinDiagonal", + "line": 738, + "source_header": "rw [rb_thirdVar hd R hR, rb_gradCov R hR, rb_thirdGradCov hd R hR, inv_one,\n Matrix.one_mulVec]\n simp [dotProduct, ite_mul, Finset.sum_ite_eq']\n norm_num\n\n/-! ## `rp_`: the reference pin-density product (`ReferencePinDensityProduct`) -/\n\n/-! ### The density algebra at the reference blocks -/\n\n/-- `det (diagonal (3, 1, …, 1)) = 3` (the single `3" + }, + { + "kind": "theorem", + "unqualified_name": "rp_density_algebra", + "line": 748, + "source_header": "(d : ℕ) (hd : 0 < d) :\n (Matrix.diagonal fun i : Fin d => if i = ⟨0, hd⟩ then (3 : ℝ) else 1).det = 3 := by\n rw [Matrix.det_diagonal, Finset.prod_ite_eq']\n simp\n\n/-- The product of the two centred Gaussian densities at `0`, for the covariance blocks `1` and\n`diagonal (3, 1, …, 1)`: `(2π)^(-d/2) · (2π)^(-d/2) · 3^(-1/2) = (2π)^(-d) / √3`. -/\ntheorem rp_density_algebra (d : ℕ) (hd : 0 < d) :" + }, + { + "kind": "theorem", + "unqualified_name": "rp_referencePinDensityProduct_of_blockIdentities", + "line": 762, + "source_header": "2 = -(d : ℝ) by ring,\n show (-1 : ℝ) / 2 = -(1 / 2) by norm_num, Real.rpow_neg (by norm_num : (0 : ℝ) ≤ 3),\n Real.sqrt_eq_rpow]\n exact (div_eq_mul_inv _ _).symm\n\n/-! ### The common core: the Prop from the two block identities -/\n\n/-- `ReferencePinDensityProduct` from the two block identities `gradCov d (Kinf d) R = 1` and\n`pinCov d (Kinf d) (R 0) R = diagonal (3, 1, …, 1)` (for `d ∈ {2, 3}` and orthonormal `R`), by\nrewriting the blocks and `rp_density_algebra`. -/\ntheorem rp_referencePinDensityProduct_of_blockIdentities\n (hblk : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n gradCov d" + }, + { + "kind": "theorem", + "unqualified_name": "rp_referencePinDensityProduct_of_referenceOddAndPinBlocks", + "line": 777, + "source_header": "UniversalLaw.Spec.Side24.ReferencePinDensityProduct := by\n intro d hd23 hd R hR\n obtain ⟨hG, hV⟩ := hblk d hd23 hd R hR\n rw [hG, hV]\n exact rp_density_algebra d hd\n\n/-! ### The hypothesis form: the Prop from `ReferenceOddAndPinBlocks` -/\n\n/-- `ReferencePinDensityProduct` from `ReferenceOddAndPinBlocks` taken as a hypothesis: only its\nfirst conjunct (`gradCov d (Kinf d) R = 1`) and fourth conjunct\n(`pinCov d (Kinf d) (R 0) R = diagonal (3, 1, …, 1)`) are used. -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "ir_epsilon_pos", + "line": 790, + "source_header": "eferencePinDensityProduct := by\n apply rp_referencePinDensityProduct_of_blockIdentities\n intro d hd23 hd R hR\n obtain ⟨hG, -, -, hV, -⟩ := h d hd23 hd R hR\n exact ⟨hG, hV⟩\n\n/-! ## `ir_`: the Sectio" + }, + { + "kind": "theorem", + "unqualified_name": "ir_epsilon_lt", + "line": 799, + "source_header": "ndRatioBounds`) -/\n\n/-! ### (a) Elementary facts about `epsilon = 10^(-108)` -/\n\n/-- `0 < epsilon`. -/\ntheorem ir_epsilon_pos : (0 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "ir_one_sub_epsilon_pos", + "line": 804, + "source_header": "positivity\n\n/-- `epsilon < 1/100`: a crude upper bound sufficient for every sig" + }, + { + "kind": "theorem", + "unqualified_name": "ir_one_le_one_add_epsilon", + "line": 809, + "source_header": "lt : epsilon < (1 / 100 : ℝ) := by\n unfold epsilon\n norm_num\n\n/-- `0 < 1 - epsilo" + }, + { + "kind": "theorem", + "unqualified_name": "ir_rpow_le_pow_five", + "line": 814, + "source_header": ": ℝ) < 1 - epsilon := by\n have := ir_epsilon_lt\n linarith\n\n/-- `1 ≤ 1 + epsilon`. -/\ntheorem ir_one_le_one_add_epsilon : (1 : ℝ) ≤ 1 + epsilon := by\n have := ir_epsilon_pos\n linarith\n\n/-! ### (b) The two one-sided power estimates -/\n\n/-- For a real exponent `b ≤ 5`, `(1 + epsilon)^b ≤ (1 + epsilon)^5`: monotonicity of the real\npower in the exponent for a base `≥ 1` (`R" + }, + { + "kind": "theorem", + "unqualified_name": "ir_bernoulli", + "line": 824, + "source_header": "(1 + epsilon) ^ b ≤ (1 + epsilon) ^ 5 := by\n have h := Real.rpow_le_rpow_of_exponent_le ir_one_le_one_add_epsilon hb\n rwa [show (5 : ℝ) = ((5 : ℕ) : ℝ) by norm_num, Real.rpow_natCast] at h\n\n/-- Bernoulli's inequality at `s = -" + }, + { + "kind": "theorem", + "unqualified_name": "ir_lower_rational", + "line": 832, + "source_header": "^ a := by\n have hε := ir_epsilon_lt\n have h := one_add_mul_self_le_rpow_one_add (show (-1 : ℝ) ≤ -epsilon by linarith) ha\n rw [show (1 : ℝ) + -epsilon = 1 - epsilon by ring] at h\n linarith\n\n/-! ### (c) The two exact rational inequalities (de" + }, + { + "kind": "theorem", + "unqualified_name": "ir_upper_rational", + "line": 839, + "source_header": "1 - 13 epsilon)(1 + epsilon)^5 ≤ 1 - 5 epsilon`, exact rational arithmetic. -/\ntheorem ir_lower_rational : (1 - 13 * epsilon) * (1 + epsilon) ^ 5 ≤ 1 - 5 * epsilon := by\n u" + }, + { + "kind": "theorem", + "unqualified_name": "ir_lower_bound", + "line": 844, + "source_header": "+ epsilon)^5 ≤ (1 + 28 epsilon)(1 - 5 epsilon)`, exact rational arithmetic. -/\ntheorem ir_upper_rational : (1 + epsilon) ^ 5 ≤ (1 + 28 * epsilon) * (1 - 5 * epsilon) := by\n unfold epsilon\n norm_num\n\n/-! ### (d) The ratio bounds for arbitrary exponents in `[1, 5]` -/\n\n/-- Lower bound: for `1 ≤ a ≤ 5` and `1 ≤" + }, + { + "kind": "theorem", + "unqualified_name": "ir_upper_bound", + "line": 862, + "source_header": "mul_le_mul_of_nonneg_left (ir_rpow_le_pow_five b hb5) (by linarith)\n _ ≤ 1 - 5 * epsilon := ir_lower_rational\n _ ≤ 1 - a * epsilon := by linarith\n _ ≤ (1 - epsilon) ^ a := ir_bernoulli a ha1\n\n/-- Upper bound: for `a ≤ 5` and `1" + }, + { + "kind": "theorem", + "unqualified_name": "ir_ratio_bounds", + "line": 877, + "source_header": ") * (1 - b * epsilon) :=\n mul_le_mul_of_nonneg_left (by linarith) (by linarith)\n _ ≤ (1 + 28 * epsilon) * (1 - epsilon) ^ b :=\n mul_le_mul_of_nonneg_left (ir_bernoulli b hb1) (by linarith)\n\n/-- Both ratio bounds together, for `1 ≤ a ≤ 5` and `1 ≤ b ≤ 5`. -/\ntheorem ir" + }, + { + "kind": "theorem", + "unqualified_name": "ir_exponentA_two", + "line": 883, + "source_header": ": b ≤ 5) :\n 1 - 13 * epsilon ≤ (1 - epsilon) ^ a / (1 + epsilon) ^ b ∧\n (1 + epsilon) ^ a / (1 - epsilon) ^ b ≤ 1 + 28 * epsilon :=\n ⟨ir_lower_bound a b ha1 h" + }, + { + "kind": "theorem", + "unqualified_name": "ir_exponentB_two", + "line": 890, + "source_header": "(e) The exponents in dimensions two and three -/\n\n/-- `exponentA 2 = 13/6` (`m = 1`, `n = 1`: `1 + 2/3 +" + }, + { + "kind": "theorem", + "unqualified_name": "ir_exponentA_three", + "line": 895, + "source_header": "= 13 / 6 := by\n simp [exponentA, symCoordDim]\n norm_num\n\n/-- `exponentB 2 = 5/2` (`d = 2`, `n = 1`: `2 + 1/2`)." + }, + { + "kind": "theorem", + "unqualified_name": "ir_exponentB_three", + "line": 900, + "source_header": "2 := by\n simp [exponentB, symCoordDim]\n norm_num\n\n/-- `exponentA 3 = 25/6` (`m = 2`, `n = 3`: `2 + 2/3 +" + }, + { + "kind": "theorem", + "unqualified_name": "li_geom_tail", + "line": 905, + "source_header": "3 = 25 / 6 := by\n simp [exponentA, symCoordDim]\n norm_num\n\n/-- `exponentB 3 = 9/2` (`d = 3`, `n = 3`: `3 + 3/2`). -/\ntheorem ir_exponentB_three : exponentB 3 = 9 / 2 := by\n simp [exponentB, symCoordDim]\n norm_num\n\n/-! ## `li_`: the lattice-image sum bound (`LatticeImageSumBound`) -/\n\n/-! ### (a) The geometric tail `(n+1)^9 exp(-288 (n+1)^2) ≤ exp(-288) (1/2)^n` -/\n\n/-- Induction on `n` from the registered successive-term ratio: the ratio of consecutive terms\n`j^9 exp(-288 j^2" + }, + { + "kind": "theorem", + "unqualified_name": "li_pow6_succ_le", + "line": 927, + "source_header": "ℝ) + 1) ^ 9 * Real.exp (-288 * ((n : ℝ) + 1) ^ 2)) :=\n h1\n _ ≤ (1 / 2) * (Real.exp (-288) * (1 / 2) ^ n) := mul_le_mul h2.le ih hnn (by norm_num)\n _ = Real.exp (-288) * ((1 / 2) ^ n * (1 / 2)) := by" + }, + { + "kind": "theorem", + "unqualified_name": "li_exp_succ_le", + "line": 935, + "source_header": ":= by\n refine le_trans ?_ (li_geom_tail n)\n have h0 : (0 : ℝ) ≤ n := by positivity\n have h1 : (1 : ℝ) ≤ (n : ℝ) + 1 := by linarith\n exact mul_le_mul_of_nonneg_righ" + }, + { + "kind": "theorem", + "unqualified_name": "li_summable_int_tsum_le", + "line": 943, + "source_header": "(-288) * (1 / 2) ^ n := by\n refine le_trans ?_ (li_geom_tail n)\n have h0 : (0 : ℝ) ≤ n := by positivity\n have h1 : (1 : ℝ) ≤ ((n : ℝ) + 1) ^ 9 := one_le_pow₀ (by linarith)\n exact le_mul_of_one_le_left (Real.exp_pos _).le h1\n\n/-! ### (b) One-dimensional sums over `ℤ` -/\n\n/-- A nonnegative `φ : ℤ → ℝ` whose values at `n+1` and at `-(n+1)` are at most\n`exp(-288) (1/2)^n` is summable over `ℤ`, with `∑' φ ≤ φ 0 + 4 exp(-288)`: split `ℤ` into `ℕ`\nand the negatives (`tsum_of_nat_of_neg_add_one`), peel off `φ 0` (`Summable.tsum_eq_zero_add`)\nand compare both tails with the geometric series (`tsum_geometric_two`). -/\ntheorem li_summable_int_tsum_le (φ :" + }, + { + "kind": "theorem", + "unqualified_name": "li_gauss_int", + "line": 981, + "source_header": "ve hsum2 : ∑' n : ℕ, φ (-((n : ℤ) + 1)) ≤ 2 * Real.exp (-288) := by\n rw [← hgeo_sum]\n exact hs2.tsum_le_tsum hneg hgeo\n refine ⟨Summable.of_nat_of_neg_add_one hs0 hs2, ?_⟩\n rw [tsum_of_nat_of_neg_add_one hs0 hs2]\n linarith\n\n/-- The Gaussian weight `m ↦ exp(-288 m^2)` is su" + }, + { + "kind": "theorem", + "unqualified_name": "li_pow_gauss_int", + "line": 1002, + "source_header": "ine ⟨h.1, h.2.trans ?_⟩\n have he := UniversalLaw.Proofs.Side24Elementary.Aux.exp_neg_lt\n have hp : (1 : ℝ) / 10 ^ 125 ≤ 1 / 4 := by norm_num\n have h0 : Real.exp (-288 * ((0 : ℤ) : ℝ) ^ 2) = 1 := by simp\n simp only [h0]\n linarith\n\n/-- The weight `m ↦ m^6 exp(-288 m^2)` is summable over `ℤ` with sum `" + }, + { + "kind": "theorem", + "unqualified_name": "li_sum_prod_le", + "line": 1020, + "source_header": "eal.exp_pos _).le)\n (fun n => by\n push_cast\n exact li_pow6_succ_le n)\n (fun n => by\n push_cast\n rw [neg_sq, Even.neg_pow (by decide : Even 6)]\n exact li_pow6_succ_le n)\n refine ⟨h.1, h.2.trans ?_⟩\n simp\n\n/-! ### (c) Finite sums of products over `Fin d → ℤ` -/\n\n/-- For `h : Fin d → ℤ → ℝ` nonnegative and summable in each coordinate, the sum of\n`∏ k, h k (n k)` over a finite set `s` of lattice points is at most `∏ k, ∑' m, h k m`: `s` lies\nin the box `Fintype.piFinset (fun k => s.image (· k))`, over which the sum factors\n(`Finset.prod_univ_sum`), and each factor is a partial sum of" + }, + { + "kind": "theorem", + "unqualified_name": "li_prod_ite_eq", + "line": 1043, + "source_header": "nset.prod_nonneg fun k _ => h0 _ _\n _ = ∏ k, ∑ m ∈ t k, h k m := (Finset.prod_univ_sum t fun k m => h k m).symm\n _ ≤ ∏ k, ∑' m, h k m :=\n Finset.prod_le_prod₀ (fun k _ => Finset.sum_nonneg fun m _ => h0 k m) (fun k _ => hle k)\n\n/-- A product over `Fin d` with one" + }, + { + "kind": "theorem", + "unqualified_name": "li_prod_exp", + "line": 1052, + "source_header": "et.univ.erase i, G k := by\n rw [← Finset.mul_prod_erase Finset.univ (fun k => if k = i then F k else G k)\n (Finset.mem_univ i), ite_eq_left rfl]\n congr 1\n exact Finset.prod_congr rfl fun k hk =>" + }, + { + "kind": "theorem", + "unqualified_name": "li_sum_cube_le", + "line": 1057, + "source_header": "p(-288 n_k^2) = exp(-288 |n|^2)` (`Real.exp_sum`). -/\ntheorem li_prod_exp (d : ℕ) (n : Fin d → ℤ) :\n ∏ k : Fin d, Real.exp (-288 * ((n k : ℤ) : ℝ) ^ 2) = Real.exp (-288 * intNormSq d n) := by\n rw [← Real.exp_sum, intNormSq, Finset.mul_sum]\n\n/-! ### (d) The pointwise domination for `d ≤ 3` -/\n\n/-- Power mean for at most three nonnegative term" + }, + { + "kind": "theorem", + "unqualified_name": "li_imageTerm_nonneg", + "line": 1077, + "source_header": "set.sum_nonneg fun i _ => pow_nonneg (ha i) 3\n calc (∑ i, a i) ^ 3 ≤ (∑ i, a i ^ 3) * (d : ℝ) ^" + }, + { + "kind": "theorem", + "unqualified_name": "li_imageTerm_le", + "line": 1084, + "source_header": "`imageTerm d n ≥ 0`. -/\ntheorem li_imageTerm_nonneg (d : ℕ) (n : Fin d → ℤ) : 0 ≤ imageTerm d n := by\n unfold imageTerm\n split_ifs\n · exact le_rfl\n · exact mul_nonneg (pow_nonneg (Finset.sum_nonneg fun i _ => sq_nonneg _) 3) (Real.exp_pos _).le\n\n/-- Pointwise domination for `d ≤ 3`: `imageTerm d n ≤ 9 ∑ i, ∏ k, h_i k (n k)`, where\n`h_i i m = m^6 exp(-288 m^2)` and `h_i k m = exp(-288 m^2)` for `k ≠ i`. Each product equals\n`(n_i^2)^3 exp(-288 |n|^2)` (`li_prod_ite_eq`, `li_prod_exp`), and `(∑ n_k^2)^3 ≤ 9 ∑ (n_i^2)^3`\nis `li_sum_cube_le" + }, + { + "kind": "theorem", + "unqualified_name": "li_partial_sum_le", + "line": 1114, + "source_header": "i, (((n i : ℤ) : ℝ) ^ 2) ^ 3) * Real.exp (-288 * ∑ i, ((n i : ℤ) : ℝ) ^ 2) :=\n mul_le_mul_of_nonneg_right h (Real.exp_pos _).le\n _ = 9 * ((∑ i, (((n i : ℤ) : ℝ) ^ 2) ^ 3) * Real.exp (-288 * ∑ i, ((n i : ℤ) : ℝ) ^ 2)) := by\n ring\n\n/-! ### (e) The uniform partial-sum bound -/\n\n/-- For `d ≤ 3` and every finite `s`, `∑ n ∈ s, imageTerm d n ≤ 1458 exp(-288)`: the pointwise\nbound `li_imageTerm_le`, the box bound `li_sum_prod_le` for each `i`, the one-dimensional sums\n`A ≤ 2` an" + }, + { + "kind": "theorem", + "unqualified_name": "dc_one_add_epsilon_pos", + "line": 1184, + "source_header": "288))) := by\n rw [Finset.sum_const, Finset.card_univ, Fintype.card_fin, nsmul_eq_mul]\n _ ≤ 9 * (3 * (16 * Real.exp (-288))) := by\n have hd' : (d : ℝ) ≤ 3 := by exact_mod_cast hd\n gcongr\n _ ≤ 1458 * Real.exp (-288) := by linarith\n\n/-! ## `dc_`: the Section 4 Gaussian density comparison (`DensityComparison`) -/\n\n/-! ### (a) Elementary facts about `epsilon = 10^(-108)`\n\n`" + }, + { + "kind": "theorem", + "unqualified_name": "dc_expand_identity", + "line": 1196, + "source_header": "_epsilon_pos` and `ir_one_sub_epsilon_pos` above\n(the `dc_` copies were removed at integration); only `0 < 1 + epsilon` is added here. -/\n\n/-- `0 < 1 + epsilon`. -/\ntheorem dc_one_add_epsilon_pos : (0 : ℝ) < 1 + epsilon := by\n have := ir_epsilon_pos\n linarith\n\n/-! ### (b) Loewner order: antitonicity of" + }, + { + "kind": "theorem", + "unqualified_name": "dc_conj_identity", + "line": 1211, + "source_header": "A hA\n calc (C - A) * A⁻¹ * (C - A) + (C - A)\n = C * A⁻¹ * C - C * (A⁻¹ * A) - (A * A⁻¹) * C + (A * A⁻¹) * A + (C - A) := by\n noncomm_ring\n _ = C * A⁻¹ * C - C := by\n rw [h1, h2]\n simp only [Mat" + }, + { + "kind": "theorem", + "unqualified_name": "dc_inv_sub_inv_posSemidef", + "line": 1223, + "source_header": "have h2 : C⁻¹ * C = 1 := Matrix.nonsing_inv_mul C hC\n calc C⁻¹ * (C * A⁻¹ * C - C) * C⁻¹\n = (C⁻¹ * C) * A⁻¹ * (C * C⁻¹) - C⁻¹ * (C * C⁻¹) := by\n noncomm_ring\n _ = A⁻¹ - C⁻¹ := by\n rw [h1, h2]\n simp only [Matrix.mul_one, Matrix.one_mul]\n\n/-- (L1) For real matrices: `A` positive definite, `C` positive definite and `C - A` p" + }, + { + "kind": "theorem", + "unqualified_name": "dc_quad_le", + "line": 1241, + "source_header": "tian.eq] at h1\n have h2 := h1.add hAC\n rwa [dc_expand_identity A C hAu] at h2\n have h3 : ((C⁻¹).conjTranspose * (C * A⁻¹ * C - C) * C⁻¹).PosSemidef :=\n hP.conjTranspose_mul_mul_same C⁻¹\n rw [hC.inv.isHermitian.eq] at h3\n rwa [dc_conj_identity A C hCu] at h3\n\n/-- The quadratic" + }, + { + "kind": "theorem", + "unqualified_name": "dc_one_le_det", + "line": 1249, + "source_header": "- A).PosSemidef) (x : Fin k → ℝ) :\n dotProduct x (Matrix.mulVec C⁻¹ x) ≤ dotProduct x (Matrix.mulVec A⁻¹ x) := by\n have h := (dc_inv_sub_inv_posSemidef hA hC hAC).dotProduct_mulVec_nonneg x\n simp only [star_trivial, Matrix.sub_mulVec, dotProduct_sub] at h\n linarith\n\n/-! ### (c) Loewner order: monotonicity of the determinant (L2) -/\n\n/-- A real matrix `M` with `M - 1` positive semidefinite has determinant at least" + }, + { + "kind": "theorem", + "unqualified_name": "dc_det_le_det", + "line": 1273, + "source_header": "nvalues i - 1 ∈ spectrum ℝ M - ({1} : Set ℝ) :=\n Set.sub_mem_sub hmem (Set.mem_singleton (1 : ℝ))\n rw [spectrum.sub_singleton_eq] at h\n simpa using h\n have h0 : (0 : ℝ) ≤ hherm.eigenvalues i - 1 := hspec hmem'\n simp only [RCLike.ofReal_real_eq_id, id]\n linarith\n\n/-- (L2) For real matri" + }, + { + "kind": "theorem", + "unqualified_name": "dc_det_smul", + "line": 1324, + "source_header": "⁻¹).det := by\n ring\n have hSS2 : 0 ≤ S.det * S.det := mul_self_nonneg _\n calc A.det = S.det * S.det := hdetA\n _ = S.det * S.det * 1 := (mul_one _).symm\n _ ≤ S.det * S.det * (S⁻¹ * C * S⁻¹).det := mul_le_mul_o" + }, + { + "kind": "theorem", + "unqualified_name": "dc_scale_identity", + "line": 1331, + "source_header": ".symm\n\n/-! ### (d) Determinant scaling and real-power bookkeeping -/\n\n/-- `det (c • C) = c ^ k * det C` for a `k × k` real matrix. -/\ntheorem dc_det_smul {k : ℕ} (C : Matrix (Fin k) (Fin k) ℝ) (c : ℝ) :\n (c • C).det = c ^ k * C.det := by\n rw [Matrix.det_smul, Fintype.c" + }, + { + "kind": "theorem", + "unqualified_name": "dc_assemble_lower", + "line": 1348, + "source_header": "ve hapos : a ^ ((k : ℝ) / 2) ≠ 0 := (Real.rpow_pos_of_pos ha _).ne'\n have hbpos : b ^ ((k : ℝ) / 2) ≠ 0 := (Real.rpow_pos_of_pos hb _).ne'\n rw [Real.div_rpow ha.le hb.le, Real.mul_rpow (pow_nonneg ha.le k) hD.le,\n Real.mul_rpow (pow_nonneg hb.le k) hD.le, hak, hbk]\n field_simp\n\n/-! ### (e) Assembly of the two pointwise inequalities from abstract rea" + }, + { + "kind": "theorem", + "unqualified_name": "dc_assemble_upper", + "line": 1358, + "source_header": "hd : dB ≤ dC) (hdC : 0 ≤ dC) (he : eA ≤ eC) (heA : 0 ≤ eA) :\n s * (P * dA * eA) ≤ P * dC * eC := by\n calc s * (P * dA * eA) = P * (s * dA) * eA := by ring\n _ = P * dB * eA := by rw [hs]\n _ ≤ P * dC * eC := mul_le_mul (mul_le_mul_of_nonneg_left hd hP) he heA (mul_" + }, + { + "kind": "theorem", + "unqualified_name": "thetaSummable", + "line": 1369, + "source_header": "hdA : 0 ≤ dA) (he : eC ≤ eB) (heC : 0 ≤ eC) :\n P * dC * eC ≤ s * (P * dB * eB) := by\n calc P * dC * eC ≤ P * dA * eB :=\n mul_le_mul (mul_le_mul_of_nonneg_left hd hP) he heC (mul_nonneg hP hdA)\n _ = P * (s * dB) * eB := by rw [hs]\n _ = s * (P * dB * eB) := by ring\n\nend Aux\n\n/-! ## The theta family is summable at every point, in every dimension -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ThetaSummable` (claim `side24-coefficient`).\nMethod: comparison `Summable.of_nonneg_of_le` with the dominating family\n`exp(‖z‖^2/2) ∏ i, exp(-144 n_i^2)` (`Aux.th_term_le_dominant`, from `‖24 n‖^2 = 576 ∑ n_i^2`\nand `Real.exp_sum`); that family is summable (`Aux.th_summable_dominant`) because\n`m ↦ exp(-144 m^2)` is summable on `ℤ` (`HurwitzKernelBounds.summable_f_int`) and products of\na nonnegative summable function are summable over `Fin d → ℤ` (`Aux.th_summable_pi_prod`, via\n`Fintype.piFinset`, `Finset.prod_univ_sum` and `summable_of_sum_le`).\nDoes not establish: the informal convergence statement of the source as the source's object\n(the alignment of `E d`, `latticeVec` and this family with the source's `R^d`, `24 Z^d` and\n`K_24` is PENDING_INDEPENDENT_REVIEW); any value, positivity, smoothness or Poisson-summation\nproperty of `thetaSum24` or `K24`; `ImageBound`, `LatticeImageSumBound` or the derivative\nbounds of Section 2; any enclosure of the coefficient; the statement module's own\n`Does not claim:` text (the state" + }, + { + "kind": "theorem", + "unqualified_name": "derivativePairingBound", + "line": 1391, + "source_header": "r review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/\ntheorem thetaSummable (d : ℕ) : UniversalLaw.Spec.Side24.ThetaSummable d := by\n intro z\n exact Summable.of_nonneg_of_le (fun n => (Real.exp_pos _).le)\n (fun n => Aux.th_term_le_dominant d z n) (Aux.th_summable_dominant d z)\n\n/-! ## Inventory theorem -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.DerivativePairingBound` (register row `side24-coefficient`,\nSection 2 first display of SIDE24-COEFFICIENT-D23-20260924-v1).\nMethod: the contraction at a unit tuple is at most the operator norm `‖iteratedFDeriv ℝ q (Kinf d) x‖`\n(`Aux.dp_abs_le_opNorm`, from `ContinuousMultilinearMap.le_opNorm`); the operator norms satisfy the\nHermite-type recursion `b_{q+2} ≤ ‖x‖ b_{q+1} + (q+1) b_q` (`Aux.dp_recursion`, from\n`norm_iteratedFDeriv_fderiv`, the explicit derivative `fderiv ℝ (Kinf d) y = Kinf d y • (-(innerSL ℝ y))`\nand the Leibniz bound `norm_iteratedFDeriv_smul_le`, the linear factor's derivatives of order `≥ 2`\nvanishing), and with `b_0 = Kinf d x`, `b_1 = Kinf d x ‖x‖` the orders `q ≤ 6` are matched to the\nunfolded `pairingSum q ‖x‖` (`Aux.dp_pairing_all`, `interval_cases`, `nlinarith`).\nDoes not establish: the informal Section 2 display or its review and acceptance; the alignment of the\nformal objects (`Kinf`, `IsUnitTuple`, `pairingSum`, Mathlib's `iteratedFDeriv ℝ q`) with the source's\n(PENDING_INDEPENDENT_REVIEW); validity for `q > 6` (the Prop restricts to `q ≤ 6`, as the source do" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeBoundAtLeastOne", + "line": 1412, + "source_header": "osition of `side24-coefficient`, which is REVIEWED_SCOPED as transcribed in the register, not\nderived here. -/\ntheorem derivativePairingBound : UniversalLaw.Spec.Side24.DerivativePairingBound := by\n intro d q hq x u hu\n exact (Aux.dp_abs_le_opNorm d q x u hu).trans (Aux.dp_pairing_all d x q hq)\n\n/-! ## The Section 2 derivative bound at `|x| ≥ 1` -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.DerivativeBoundAtLeastOne` (register row `side24-coefficient`,\nSection 2 of SIDE24-COEFFICIENT-D23-20260924-v1, \"At |x|>=1 this is at most 76 |x|^6 e^(-|x|^2/2)\").\nMethod: the Section 2 pairing bound `|D^q Kinf (x) u| ≤ exp(-‖x‖²/2) · pairingSum q ‖x‖` is the\ninventory theorem `derivativePairingBound` of this module (the Hermite-type recursion\n`b_{q+2} ≤ ‖x‖ b_{q+1} + (q+1) b_q` for the operator norms, `Aux.dp_recursion`, with\n`ContinuousMultilinearMap.le_opNorm` at a unit tuple); the hypothesis-form helper\n`Aux.d1_derivativeBoundAtLeastOne_of_derivativePairingBound` combines it with the elementary\ninequality `pairingSum q r ≤ 76 r^6` for `1 ≤ r`, `q ≤ 6` (`Aux.d1_pairingSum_le_of_one_le`:\n`interval_cases`, `Finset.sum_range_succ`, `Nat.factorial`, `norm_num`, and the monomial bounds\n`r^k ≤ r^6` from `pow_le_pow_right₀`, `one_le_pow₀`), by `mul_le_mul_of_nonneg_left` with\n`0 ≤ exp(-‖x‖²/2)`.\nDoes not establish: the informal Section 2 display or its review and acceptance; the alignment of the\nformal objects (`Kinf`, `IsUnitTuple`, `pairingSum`, Mathlib's `iteratedFDeriv ℝ q`) with the source's\n(PENDING_INDEPENDENT_REVIEW); any identification with the main-branch targets\n`UniversalLaw.Side24.pairing_sum_six` and `pairing_sum_le_six`, which kernel-check the coefficient\narithmetic `1+15+45+15=76` and `76` bounding the smaller orders there, not here; validity for `q > 6` or\nfor `‖x‖ < 1` (the Prop restri" + }, + { + "kind": "theorem", + "unqualified_name": "derivativeBoundAtZero", + "line": 1436, + "source_header": "{d,24}`; the disposition of `side24-coefficient`, which is REVIEWED_SCOPED as transcribed\nin the register, not derived here. -/\ntheorem derivativeBoundAtLeastOne : UniversalLaw.Spec.Side24.DerivativeBoundAtLeastOne :=\n Aux.d1_derivativeBoundAtLeastOne_of_derivativePairingBound derivativePairingBound\n\n/-! ## The Section 2 derivative bound at the origin -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.DerivativeBoundAtZero` (register row `side24-coefficient`,\nSection 2 of SIDE24-COEFFICIENT-D23-20260924-v1, \"contraction has absolute value at most 15\").\nMethod: the hypothesis-form helper `Aux.d0_derivativeBoundAtZero_of_derivativePairingBound`\nspecialises the pairing bound `DerivativePairingBound` to `x = 0`, where `‖0‖ = 0`,\n`exp (-(0 ^ 2) / 2) = 1` and `pairingSum q 0 ≤ 15` for `q ≤ 6` (`Aux.d0_pairingSum_zero_le`:\nthe values are `1, 0, 1, 0, 3, 0, 15`, by `interval_cases`, `Finset.sum_range_succ`, `norm_num`);\nthe pairing bound itself is the inventory theorem `derivativePairingBound` of this module\n(`Aux.dp_recursion`, `Aux.dp_pairing_all`, `Aux.dp_abs_le_opNorm`).\nDoes not establish: the informal Section 2 display or its review and acceptance; the alignment of\nthe formal objects (`Kinf`, `IsUnitTuple`, `pairingSum`, Mathlib's `iteratedFDeriv ℝ q` at `0`) with\nthe source's (PENDING_INDEPENDENT_REVIEW); the double-factorial identity `5!! = 15` as such, which\nis kernel-checked on main (`UniversalLaw.Side24.sixth_moment_double_factorial`) and is neither\nre-proved nor cited here (only `pairingSum 6 0 = 15` is computed); validity for `q > 6` (the Prop\nrestricts to `q ≤ 6`, as the source does); any value" + }, + { + "kind": "theorem", + "unqualified_name": "referenceOddAndPinBlocks", + "line": 1457, + "source_header": "coefficient `c_{d,24}`; the disposition of\n`side24-coefficient`, which is REVIEWED_SCOPED as transcribed in the register, not derived here. -/\ntheorem derivativeBoundAtZero : UniversalLaw.Spec.Side24.DerivativeBoundAtZero :=\n Aux.d0_derivativeBoundAtZero_of_derivativePairingBound derivativePairingBound\n\n/-! ## The Section 1 reference blocks of `K_infty` in every orthonormal frame -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ReferenceOddAndPinBlocks` (claim `side24-coefficient`).\nMethod: the derivative contractions of `Kinf d` at `0` are evaluated by peeling one direction\nat a time (`Aux.rb_peel`, from `iteratedFDeriv_succ_apply_right` and\n`iteratedFDeriv_clm_apply_const_apply`) with explicit `HasFDerivAt` closed forms of the\nintermediate functions (`Aux.rb_fderiv_kinf`, `rb_fderiv_g1`, `rb_fderiv_g2`,\n`rb_fderiv_g3_zero`, `rb_fderiv_P3`, `rb_fderiv_P4`, `rb_fderiv_P5_zero`), giving\n`Aux.rb_order_two` (`-⟪a, b⟫`), `Aux.rb_order_four` (the three pairings) and `Aux.rb_order_six`\n(`-15 ⟪u, u⟫^3`); in an orthonormal frame (`orthonormal_iff_ite`) the five blocks follow\n(`Aux.rb_gradCov`, `rb_thirdVar`, `rb_thirdGradCov`, `rb_pinCov`, `rb_condThirdVariance`,\nthe last with `inv_one`, `Matrix.one_mulVec` and `Finset.sum_ite_eq'`).\nDoes not establish: the informal Section 1 block values of the source as the source's objects\n(the alignment of `E d`, `Kinf`, `derivContraction`, `gradCov`, `pinCov`, `thirdGradCov`,\n`thirdVar` and `condThirdVariance` with the source's `R^d`, `K_infty`, covariances and\nconditional variance is PENDING_INDEPENDENT_REVIEW); that any of these matrices is the\ncovariance of a random vector or field (none is constructed in the statement module); the\nstatement module's own `Does not claim:` text (\"the identities (statement only); `15 - 9 = 6` is\nkernel-checked on main (`UniversalLaw.Side24.conditional_third_derivative_variance`), not\nhere\"), which describes the statement packet, is not edited here, and main's theorem is neither\ncited nor relied on; `ReferencePinDensityProduct`, `CovarianceOrdering`,\n`EntrywiseCovarianceBound` or any other Prop of the modul" + }, + { + "kind": "theorem", + "unqualified_name": "referencePinDensityProduct", + "line": 1486, + "source_header": "acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. -/\ntheorem referenceOddAndPinBlocks : UniversalLaw.Spec.Side24.ReferenceOddAndPinBlocks := by\n intro d _ hd R hR\n exact ⟨Aux.rb_gradCov R hR, Aux.rb_thirdVar hd R hR, Aux.rb_thirdGradCov hd R hR,\n Aux.rb_pinCov hd R hR, Aux.rb_condThirdVariance hd R hR⟩\n\n/-! ## The Section 1 reference pin-density product -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.ReferencePinDensityProduct` (register row `side24-coefficient`,\nSection 1 of SIDE24-COEFFICIENT-D23-20260924-v1, \"p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3)\").\nMethod: the hypothesis form `Aux.rp_referencePinDensityProduct_of_referenceOddAndPinBlocks` takes\nthe inventory theorem `referenceOddAndPinBlocks` of this module and uses only its first conjunct\n`gradCov d (Kinf d) R = 1` and fourth conjunct `pinCov d (Kinf d) (R 0) R = diagonal (3, 1, …, 1)`\n(both from the contractions `Aux.rb_order_two`, `Aux.rb_order_four` in an orthonormal frame); the\ncommon core `Aux.rp_referencePinDensityProduct_of_blockIdentities` rewrites the two blocks and\nfinishes with the density algebra `Aux.rp_density_algebra` (`Matrix.det_one`, `Matrix.det_diagonal`,\n`Finset.prod_ite_eq'`, `Matrix.mulVec_zero`, `Real.rpow_add`, `Real.rpow_neg`, `Real.sqrt_eq_rpow`).\nDoes not establish: the informal Section 1 display or its review and acceptance; the alignment of\nthe formal objects (`gaussDensity`, `gradCov`, `pinCov`, `derivContraction` through Mathlib's\n`iteratedFDeriv ℝ` at `0`, `Orthonormal ℝ R`) with the source's (PENDING_INDEPENDENT_REVIEW); the\ndeterminant identity `det diag(3,1,…,1) = 3` as the main-branch target\n`UniversalLaw.Side24.pin_determinant_and_joint_dimension`, which is kernel-checked on main and is\nneither cited nor re-used here (the determinant is recomputed by `Matrix.det_diagonal` in\n`Aux.rp_det_pinDiagonal`); that `gaussDensity` is the density of any random vector or that any field\nis constructed; the remaining conjuncts of `ReferenceOddAndPinBlocks` (`Var(t) = 15`,\n`Cov(t, G) = (-3, 0, …, 0)`, `tau^2 = 6`), which this theorem does not use; the value for\n`d ∉ {2, 3}`" + }, + { + "kind": "theorem", + "unqualified_name": "integrandRatioBounds", + "line": 1512, + "source_header": "t `c_{d,24}`; the disposition of `side24-coefficient`, which is REVIEWED_SCOPED as\ntranscribed in the register, not derived here. -/\ntheorem referencePinDensityProduct : UniversalLaw.Spec.Side24.ReferencePinDensityProduct :=\n Aux.rp_referencePinDensityProduct_of_referenceOddAndPinBlocks referenceOddAndPinBlocks\n\n/-! ## The Section 4 integrand-ratio bounds in dimensions two and three -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.IntegrandRatioBounds` (claim `side24-coefficient`).\nMethod: case split `d = 2`, `d = 3`, where the exponents evaluate to `a = 13/6, b = 5/2` and\n`a = 25/6, b = 9/2` (`Aux.ir_exponentA_two`, `Aux.ir_exponentB_two`, `Aux.ir_exponentA_three`,\n`Aux.ir_exponentB_three`); for arbitrary `1 ≤ a, b ≤ 5` both bounds follow\n(`Aux.ir_ratio_bounds`) from Bernoulli's inequality `1 - a epsilon ≤ (1 - epsilon)^a`\n(`one_add_mul_self_le_rpow_one_add`, `Aux.ir_bernoulli`), exponent monotonicity\n`(1 + epsilon)^b ≤ (1 + epsilon)^5` (`Real.rpow_le_rpow_of_exponent_le`,\n`Aux.ir_rpow_le_pow_five`), `le_div_iff₀` / `div_le_iff₀`, and the two exact rational\ninequalities `(1 - 13 epsilon)(1 + epsilon)^5 ≤ 1 - 5 epsilon` and\n`(1 + epsilon)^5 ≤ (1 + 28 epsilon)(1 - 5 epsilon)` decided by `norm_num`\n(`Aux.ir_lower_rational`, `Aux.ir_upper_rational`).\nDoes not establish: the informal Section 4 display of the source as the source's object (the\nalignment of `epsilon`, `exponentA`, `exponentB` and these power quotients with the source's\n`epsilon`, `a`, `b` and integrand ratio is PENDING_INDEPENDENT_REVIEW); that the integrand ratio\nof the source equals these power quotients (not specified in the statement packet); the\narithmetic `13 ≤ 32`, `28 ≤ 32` and `32*10^(-108) < 10^(-106)` (kernel-checked on main in\n`UniversalLaw.Side24.ratio_constant_ordering` and `density_comparison_below_reported`, not\nhere); `DensityComparison` or any covariance ordering; any enclosure of the coefficient; the\nstatement module's own `Does not cla" + }, + { + "kind": "theorem", + "unqualified_name": "latticeImageSumBound", + "line": 1543, + "source_header": "hd\n rcases hd with rfl | rfl\n · rw [Aux.ir_exponentA_two, Aux.ir_exponentB_two]\n exact Aux.ir_ratio_bounds _ _ (by norm_num) (by norm_num) (by norm_num) (by norm_num)\n · rw [Aux.ir_exponentA_three, Aux.ir_exponentB_three]\n exact Aux.ir_ratio_bounds _ _ (by norm_num) (by norm_num) (by norm_num) (by norm_num)\n\n/-! ## The lattice-image sum bound for `d ≤ 3` -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.LatticeImageSumBound` (claim `side24-coefficient`).\nMethod: both conjuncts from the uniform partial-sum bound `Aux.li_partial_sum_le` via\n`summable_of_sum_le` and `Real.tsum_le_of_sum_le` (terms nonnegative, `Aux.li_imageTerm_nonneg`);\nthe partial sums are dominated pointwise by `9 ∑ i, ∏ k, h_i k (n k)` (`Aux.li_imageTerm_le`,\nfrom the power mean `pow_sum_div_card_le_sum_pow` and `Real.exp_sum`), each finite sum of\nproducts sits in a `Fintype.piFinset` box and factors (`Aux.li_sum_prod_le`, via\n`Finset.prod_univ_sum` and `Summable.sum_le_tsum`), and the one-dimensional sums over `ℤ` are\nbounded by `2` and `4 exp(-288)` (`Aux.li_gauss_int`, `Aux.li_pow_gauss_int`) through\n`tsum_of_nat_of_neg_add_one`, the geometric series `tsum_geometric_two` and the registered\n`SuccessiveTermRatio` (`SpecificationProofs.Side24Elementary.successiveTermRatio`), giving\n`432 exp(-288) ≤ 1458 exp(-288)`.\nDoes not establish: the informal Section 2 lattice display of the source as the source's object\n(the alignment of `intNormSq`, `imageTerm` and this `tsum` over `Fin d → ℤ` with the source's\n`sum_{n ≠ 0} |n|^6 e^(-288|n|^2)` is PENDING_INDEPENDENT_REVIEW); the intermediate shell count\n`729 ∑_j j^9 e^(-288 j^2)` of the source, which the Prop does not specify and this proof does not\nreproduce; the arithmetic `27·27 = 729`, `729·2 = 1458` kernel-checked on main, not here;\n`ImageBound`, the derivative" + }, + { + "kind": "theorem", + "unqualified_name": "densityComparison", + "line": 1569, + "source_header": "-COEFFICIENT-D23-20260924-v1. -/\ntheorem latticeImageSumBound : UniversalLaw.Spec.Side24.LatticeImageSumBound := by\n intro d hd\n exact ⟨summable_of_sum_le (fun n => Aux.li_imageTerm_nonneg d n) (Aux.li_partial_sum_le d hd),\n Real.tsum_le_of_sum_le (fun n => Aux.li_imageTerm_nonneg d n) (Aux.li_partial_sum_le d hd)⟩\n\n/-! ## The Section 4 Gaussian density comparison -/\n\n/-- Proves: `UniversalLaw.Spec.Side24.DensityComparison` (claim `side24-coefficient`).\nMethod: with `A = (1 - epsilon) • C0` and `B = (1 + epsilon) • C0` (positive definite by\n`Matrix.PosDef.smul`), the Loewner lemmas `Aux.dc_det_le_det` (`det A ≤ det C ≤ det B`, via\n`CFC.sqrt`, `Matrix.PosSemidef.conjTranspose_mul_mul_same`,\n`Matrix.posSemidef_iff_isHermitian_and_spectrum_nonneg` and\n`Matrix.IsHermitian.det_eq_prod_eigenvalues`) and `Aux.dc_quad_le`\n(`x ⬝ B⁻¹ x ≤ x ⬝ C⁻¹ x ≤ x ⬝ A⁻¹ x`, via `Aux.dc_inv_sub_inv_posSemidef`) give the two\ndeterminant and exponent comparisons; `Aux.dc_scale_identity` with `Matrix.det_smul` turns\n`((1 ∓ epsilon)/(1 ± epsilon))^(n/2) · det((1 ∓ epsilon) • C0)^(-1/2)` into\n`det((1 ± epsilon) • C0)^(-1/2)`; `Real.rpow_le_rpow_of_nonpos`, `Real.exp_le_exp` and\n`Aux.dc_assemble_lower` / `Aux.dc_assemble_upper` finish after unfolding `gaussDensity`.\nDoes not establish: the informal Section 4 display of the source as the source's object (the\nalignment of `gaussDensity`, `symCoordDim`, `epsilon` and the positive-semidefinite hypotheses\nwith the source's densities, `n = m(m+1)/2`, `epsilon` and ordering is\nPENDING_INDEPENDENT_REVIEW); the cone-moment consequence `(1 ± epsilon)^m D0` and the scaling\n`a^m` of `h(A) = det(A)^2 1{A<0}` (not specified in the statement packet); that\n`(1 ± epsilon) • C0` or `C` are covariances of any random object; `CovarianceOrdering` or any\nordering of `C24` against `Cref`; any enclosure of the coefficient; the statement module's own" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Hazard.lean", + "sha256": "65584aea77eefd1f59aee51554d94b9ea9c390f7a62da40e4210f8487dbdf8f1", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "blockWeight", + "line": 32, + "source_header": "x\n\n/-! ### The block-local weight -/\n\n/-- The block-restricted weight `w_i(S) = prod_{v in S} p_v prod_{v in X_i \\ S} (1 - p_v)`; the\nintegrand of `localGood`. -/\nnoncomputable def blockWeight {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X → ℝ) (i : Fin F.b) (S : Finset X" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_eq", + "line": 40, + "source_header": "p v)\n\n/-- `localGood` is the sum of the indicator of the downset times the block weight. -/\ntheorem localGood_eq {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (p : X → ℝ)\n (i : Fin F.b) :\n localGood F p i =\n ∑ S ∈ (block F i).powerset, Set.indicator (downset F) (blockWeight F" + }, + { + "kind": "theorem", + "unqualified_name": "blockWeight_nonneg", + "line": 46, + "source_header": ":= rfl\n\n/-- Block weights are nonnegative for `p in [0,1]^X`. -/\ntheorem blockWeight_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) (S : Finset X) :\n 0 ≤ blockWeigh" + }, + { + "kind": "theorem", + "unqualified_name": "sum_blockWeight_eq_one", + "line": 54, + "source_header": "(hp v).2]\n\n/-- The block weights of all subsets of a block sum to one (`Finset.prod_add`). -/\ntheorem sum_blockWeight_eq_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X → ℝ) (i : Fin F.b) :\n ∑ S ∈ (block F i).powerset, blockWeight" + }, + { + "kind": "theorem", + "unqualified_name": "sum_blockWeight_filter_supset", + "line": 64, + "source_header": "xact h.symm\n\n/-- The marginal identity: for `S ⊆ X_i`, the block weights of the supersets of `S` inside the\nblock sum to `prod_{v in S} p_v` (bijection `T ↦ T \\ S` onto `2^(X_i \\ S)`). -/\ntheorem sum_blockWeight_filter_supset {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) (p : X → ℝ) (i : Fin F.b) {S : Finset X} (hS : S ⊆ block F i) :\n ∑ T ∈ (block F i).powerset with S ⊆ T, blockWeight F p i T =" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_nonneg", + "line": 105, + "source_header": "h2, mul_one]\n\n/-! ### Bounds on the local good and failure probabilities -/\n\n/-- `0 ≤ mu_p(D_i)`. -/\ntheorem localGood_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) : 0" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_le_one", + "line": 114, + "source_header": "onneg F hp i T) S\n\n/-- `mu_p(D_i) ≤ 1`. -/\ntheorem localGood_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) :" + }, + { + "kind": "theorem", + "unqualified_name": "localFailure_nonneg", + "line": 121, + "source_header": "ht_nonneg F hp i S)\n\n/-- `0 ≤ q_i`. -/\ntheorem localFailure_nonneg {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) : 0" + }, + { + "kind": "theorem", + "unqualified_name": "localFailure_le_one", + "line": 127, + "source_header": "alGood_le_one F hp i]\n\n/-- `q_i ≤ 1`. -/\ntheorem localFailure_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) :" + }, + { + "kind": "theorem", + "unqualified_name": "one_sub_localFailure", + "line": 133, + "source_header": "ocalGood_nonneg F hp i]\n\n/-- `1 - q_i = mu_p(D_i)`. -/\ntheorem one_sub_localFailure {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X → ℝ) (i : Fin F.b) : 1 - localFailur" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_le_one_sub_prod", + "line": 139, + "source_header": "nfold localFailure\n ring\n\n/-- Every subset of the block containing `a_i + 1` or more coordinates is bad, so\n`mu_p(D_i) ≤ 1 - prod_{v in S} p_v` for every such `S ⊆ X_i` (marginal identity plus the\ntermwise bound `indicator ≤ weight`). -/\ntheorem localGood_le_one_sub_prod {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) {i : Fin F.b} {S : Finset X}\n (hS : S ⊆ block F i) (hcard : F.a i + 1 ≤ S.card) :\n localGo" + }, + { + "kind": "theorem", + "unqualified_name": "prod_le_localFailure_of_card", + "line": 166, + "source_header": "F p i hS] at h4\n linarith\n\n/-- The block-local price bound of the (T3)/(T5) arguments: for `S ⊆ X_i` with\n`|S| ≥ a_i + 1`, `prod_{v in S} p_v ≤ q_i`. -/\ntheorem prod_le_localFailure_of_card {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) {i : Fin F.b}\n {S : Finset X} (hS : S ⊆ block F i) (hcard : F.a i + 1 ≤ S.card) :\n ∏ v" + }, + { + "kind": "theorem", + "unqualified_name": "prod_block_le_localFailure", + "line": 175, + "source_header": "e_one_sub_prod F hp hS hcard]\n\n/-- The full block has `a_i d_i + 1 ≥ a_i + 1` coordinates, so `prod_{v in X_i} p_v ≤ q_i`. -/\ntheorem prod_block_le_localFailure {X : Type} [Fintype X] [DecidableEq X]\n {F : RealizedData X} (hF : IsRealizedFamily F) {p : X → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (i : Fin F.b) :\n ∏ v ∈ bloc" + }, + { + "kind": "theorem", + "unqualified_name": "neg_log_one_sub_ge", + "line": 185, + "source_header": "ight (F.a i) (hF.2.1 i)\n omega\n\n/-! ### The transformed price `phi` -/\n\n/-- `q ≤ -log(1 - q)` for `q < 1` (from `1 - q ≤ exp(-q)`). -/\ntheorem neg_log_one_sub_ge {q : ℝ} (" + }, + { + "kind": "theorem", + "unqualified_name": "le_phi_self", + "line": 196, + "source_header": "rw [Real.log_exp] at h2\n linarith\n\n/-- `q ≤ phi(q)` for `q ≤ 1` (in particular on `[0, 1]`). -/\ntheorem le_phi_" + }, + { + "kind": "theorem", + "unqualified_name": "pairwiseDisjoint_inter_block", + "line": 203, + "source_header": "1 (neg_log_one_sub_ge h)\n · exact h1\n\n/-! ### Blocks partition the ground set -/\n\n/-- The traces `T ∩ X_i` of a set on the blocks are pairwise disjoint. -/\ntheorem pairwiseDisjoint_inter_block {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) (T : Finset X) :\n (↑(univ : Finset (Fin F.b)) : Set (Fin F.b)).Pairwi" + }, + { + "kind": "theorem", + "unqualified_name": "biUnion_inter_block", + "line": 217, + "source_header": "hvj\n exact hij (hvi.2.symm.trans hvj.2)\n\n/-- The traces of a set on the blocks reassemble it. -/\ntheorem biUnion_inter_block {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (T : Finset X) : (univ : Finset (Fin" + }, + { + "kind": "theorem", + "unqualified_name": "prod_eq_prod_blocks", + "line": 223, + "source_header": "block F i) = T := by\n ext v\n simp [block]\n\n/-- A product over a set factors over its traces on the blocks. -/\ntheorem prod_eq_prod_blocks {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (f : X → ℝ) (T : Finset X) :" + }, + { + "kind": "theorem", + "unqualified_name": "compl_inter_block", + "line": 230, + "source_header": "od_biUnion (pairwiseDisjoint_inter_block F T)\n\n/-- The complement's trace on a block is the block minus the trace. -/\ntheorem compl_inter_block {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (U : Finset X) (i : Fin F.b) : (univ" + }, + { + "kind": "theorem", + "unqualified_name": "weight_eq_prod_blockWeight", + "line": 237, + "source_header": "mem_sdiff, mem_univ, true_and, not_and]\n tauto\n\n/-- The weight of a subset factors over the blocks: `w(U) = prod_i w_i(U ∩ X_i)`. -/\ntheorem weight_eq_prod_blockWeight {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (p : X → ℝ) (U : Finset X) : we" + }, + { + "kind": "theorem", + "unqualified_name": "isGood_inter_block", + "line": 248, + "source_header": "_congr rfl fun i _ => ?_\n rw [compl_inter_block]\n\n/-! ### Good sets have good block restrictions -/\n\n/-- `U in D` implies `U ∩ X_i in D`. -/\ntheorem isGood_inter_block {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n {U : Finset X} (hU :" + }, + { + "kind": "theorem", + "unqualified_name": "indicator_weight_le", + "line": 257, + "source_header": "U.1 j)\n · exact image_subset_image inter_subset_left\n\n/-- Termwise: `1_D(U) w(U) ≤ prod_i 1_D(U ∩ X_i) w_i(U ∩ X_i)`. -/\ntheorem indicator_weight_le {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (U : Finset X) :\n Set.indicator (downset F) (weight p) U ≤\n ∏ i, Set.in" + }, + { + "kind": "theorem", + "unqualified_name": "sum_prod_blocks", + "line": 270, + "source_header": "cator_nonneg (fun T _ => blockWeight_nonneg F hp i T) _\n\n/-! ### The factorisation of a block-local product over `2^X` -/\n\n/-- `sum_{U ⊆ X} prod_i g_i(U ∩ X_i) = prod_i sum_{S ⊆ X_i} g_i(S)`: the bijection\n`U ↦ (i ↦ U ∩ X_i)` from `2^X` onto `prod_i 2^(X_i)` with inverse `x ↦ ⋃_i x_i`. -/\ntheorem sum_prod_blocks {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (g : Fin F.b → Finset X → ℝ) :\n ∑ U ∈ (univ : Finset X).powerset, ∏ i, g i (U" + }, + { + "kind": "theorem", + "unqualified_name": "mu_le_prod_localGood", + "line": 303, + "source_header": "ro hv\n exact ⟨⟨i, hv⟩, hx' i hv⟩\n · intro U _\n rfl\n\n/-- The factorisation `mu_p(D) ≤ prod_i mu_p(D_i)` for `p in [0,1]^X`: termwise domination of\n`1_D(U) w(U)` by the product of block restrictions, then the block-product bijection. -/\ntheorem mu_le_prod_localGood {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ}" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_pos_of_mu_pos", + "line": 318, + "source_header": "Finset.prod_congr rfl fun i _ => ?_\n rw [localGood_eq]\n\n/-- When `mu_p(D) > 0`, every local good probability is positive (a zero factor would zero the\nproduct that dominates `mu_p(D)`). -/\ntheorem localGood_pos_of_mu_pos {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v" + }, + { + "kind": "theorem", + "unqualified_name": "neg_log_prod_localGood", + "line": 329, + "source_header": "p\n rw [Finset.prod_eq_zero (mem_univ i) h0] at this\n linarith\n\n/-- `-log prod_i mu_p(D_i) = sum_i -log mu_p(D_i)` when `mu_p(D) > 0`. -/\ntheorem neg_log_prod_localGood {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (hmu : 0 < mu F p) :\n -R" + }, + { + "kind": "theorem", + "unqualified_name": "neg_log_prod_localGood_le", + "line": 335, + "source_header": "localGood_pos_of_mu_pos F hp hmu i).ne'), Finset.sum_neg_distrib]\n\n/-- `-log prod_i mu_p(D_i) ≤ -log mu_p(D)` when `mu_p(D) > 0`. -/\ntheorem neg_log_prod_localGood_le {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1) (hmu : 0 <" + }, + { + "kind": "theorem", + "unqualified_name": "localPriceChain", + "line": 343, + "source_header": "g_le_neg (Real.log_le_log hmu (mu_le_prod_localGood F hp))\n\nend Aux\n\n/-! ## Inventory theorems -/\n\n/-- Proves: `UniversalLaw.Spec.P15.LocalPriceChain` (claim `p15-realized-covers`, display (P4)).\nMethod: `Finset.prod_le_prod₀` for `0 ≤ c ≤ p`; the block-local marginal bound\n`Aux.prod_le_localFailure_of_card` at `S = X_i` (the full block has `a_i d_i + 1 ≥ a_i + 1`\ncoordinates and is therefore bad); `q ≤ phi(q)` on `[0,1]` from `1 - q ≤ exp(-q)`.\nDoes not establish: the informal display (P4) or its review and acceptance; the alignment of\n`localFailure` with the source's `q_i` (PENDING_INDEPENDENT_REVIEW); the identification\n`prod p_v = P(U_i = X_i)` as a probabilistic statement; the disposition HOLD_WITH_DOMAIN of\n`p15-realized-covers`, which is transcribed in the register, not derived here. -/\ntheorem localPriceChain {X : Type} [Fintype X] [DecidableE" + }, + { + "kind": "theorem", + "unqualified_name": "independentBlockHazard", + "line": 361, + "source_header": "exact Finset.prod_le_prod₀ (fun v _ => (hc v).1) (fun v _ => (hc v).2)\n\n/-- Proves: `UniversalLaw.Spec.P15.IndependentBlockHazard` (claim `p15-realized-covers`, display\n(P5)).\nMethod: `1 - q_i = mu_p(D_i)`; the factorisation `Aux.mu_le_prod_localGood` (block-product\nbijection on `2^X`, no independence assumption); when `mu_p(D) > 0` every `mu_p(D_i) > 0`, so\n`Real.log_prod` turns `-log prod` into `sum -log`, each `q_i ≤ -log(1 - q_i)` by\n`Aux.neg_log_one_sub_ge`, and `-log prod ≤ -log mu` by monotonicity of `log`.\nDoes not establish: the informal display (P5) or its review and acceptance; any independence of\ncrossing events (none is used); the price bound `sum_i price(G_i) ≤ sum_i q_i` (that is (P4)\nsummed, not part of this `Prop`); the alignment of the formal `mu`, `localFailure` with the\nsource's objects (PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of\n`p15-realized-covers`. -/\ntheorem independentBlockHazard {X : Type} [Fintype X] [DecidableEq X]" + }, + { + "kind": "theorem", + "unqualified_name": "globalAssemblyHazard", + "line": 387, + "source_header": "= Aux.localGood_pos_of_mu_pos F hp hmu i\n unfold localFailure\n linarith\n\n/-- Proves: `UniversalLaw.Spec.P15.GlobalAssemblyHazard` (claim `p15-full-price`, display (F13)).\nMethod: the factorisation `Aux.mu_le_prod_localGood` (every good set has good block\nrestrictions; the weight factors over the blocks; the block-product bijection on `2^X`), then,\nwhen `mu_p(D) > 0`, every `mu_p(D_i) > 0`, `Real.log_prod` and the monotonicity of `log`.\nDoes not establish: the informal display (F13) or its review and acceptance; the local bound\n(F12) or the full-price theorem (F2); any independence of crossing failures (none is used); the\nalignment of the formal `mu`, `localGood` with the source's `mu_p(D)`, `mu_p(D_i)`\n(PENDING_INDEPENDENT_REVIEW); the disposition of `p15-full-price`, which is transcribed in the\nregister, not derived here. -/\ntheorem globalAssemblyHazard {X : Type} [Fintype X] [DecidableEq" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Budget.lean", + "sha256": "6b5c5515345b3a8609fd7198f2da07e94a136dcf662445f1e528c63266671c46", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "famPrice_nonneg", + "line": 35, + "source_header": "x\n\n/-! ### Cover prices and the infimum `coverCost` -/\n\n/-- Family prices are nonnegative for nonnegative prices. -/\ntheorem famPrice_nonneg {Y : Type} {c : Y → ℝ} (hc : ∀ v, 0 ≤ c v) (G : Finset (Finset Y)) :\n 0 ≤ famPric" + }, + { + "kind": "theorem", + "unqualified_name": "coverSet_bddBelow", + "line": 42, + "source_header": "hc v\n\n/-- The set of prices of generator covers is bounded below by `0`. -/\ntheorem coverSet_bddBelow {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (K : ℕ)\n {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) :\n BddBelow {t : ℝ | ∃ G : Finset (Finset X), IsGeneratorCover F K G ∧ famPrice c" + }, + { + "kind": "theorem", + "unqualified_name": "coverCost_le_famPrice", + "line": 50, + "source_header": "eg hc G\n\n/-- The infimum is at most the price of any generator cover. -/\ntheorem coverCost_le_famPrice {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n (K : ℕ) {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) {G : Finset (Finset X)}\n (hG : IsGeneratorCover F K G) : coverCost F K c ≤ fam" + }, + { + "kind": "theorem", + "unqualified_name": "isGeneratorCover_singleton_empty", + "line": 56, + "source_header": "hG, rfl⟩\n\n/-- `{∅}` covers every obstruction. -/\ntheorem isGeneratorCover_singleton_empty {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) (K : ℕ) : IsGeneratorCo" + }, + { + "kind": "theorem", + "unqualified_name": "famPrice_singleton_empty", + "line": 61, + "source_header": "y_subset U⟩\n\n/-- The cover `{∅}` has price `1`. -/\ntheorem famPrice_singleton_empty {Y : Type} (c : Y → ℝ) : famPr" + }, + { + "kind": "theorem", + "unqualified_name": "coverCost_le_one", + "line": 65, + "source_header": "ce, genPrice]\n\n/-- `covercost ≤ 1` (the cover `{∅}`). -/\ntheorem coverCost_le_one {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X) (K : ℕ)\n {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) : cove" + }, + { + "kind": "theorem", + "unqualified_name": "coverCost_le_sum_block", + "line": 71, + "source_header": "ton_empty] at h\n\n/-- For `K ≥ K_H(d)` the full blocks cover, so `covercost ≤ sum_i price(X_i)`. -/\ntheorem coverCost_le_sum_block {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) {c : X → ℝ} (hc : ∀ v, 0 ≤ c v) {K : ℕ}\n (hK : paletteNumber F.b F.H F.d ≤ K) :\n coverCost F K c ≤ ∑ i, genPr" + }, + { + "kind": "theorem", + "unqualified_name": "le_cappedHazard_of", + "line": 81, + "source_header": "ice F K hc hcover\n\n/-- A quantity at most `1` and, for `m > 0`, at most `ρ (-log m)` is at most the capped hazard. -/\ntheorem le_cappedHazard_of {ρ m x : ℝ} (hx1 : x ≤ 1) (hx2 : 0 < m → x ≤ ρ * -Real.log m) :\n x" + }, + { + "kind": "theorem", + "unqualified_name": "sum_localFailure_le_neg_log_mu", + "line": 89, + "source_header": "x2 h)\n · exact hx1\n\n/-- `sum_i q_i ≤ -log mu_p(D)` when `mu_p(D) > 0` (display (P5)/(T6), from `P15Hazard`). -/\ntheorem sum_localFailure_le_neg_log_mu {X : Type} [Fintype X] [DecidableEq X]\n {F : RealizedData X} (hF : IsRealizedFamily F) {p : X → ℝ} (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1)\n (hmu : 0 < mu F p) : ∑ i, localFailure F p i" + }, + { + "kind": "theorem", + "unqualified_name": "phi_le_div", + "line": 96, + "source_header": "exact h.1.trans h.2\n\n/-! ### The ratio bound of (T3)/(T5) -/\n\n/-- `phi(p) ≤ p/(1-p)` for `0 ≤ p < 1` (display (T2)). -/\ntheorem phi_le_div {p : ℝ} (h0 : 0 ≤ p) (h1 : p <" + }, + { + "kind": "theorem", + "unqualified_name": "genPrice_le_ratio", + "line": 104, + "source_header": "ry.logRatioBound p h0 h1)\n\n/-- The first two steps of (T3): `prod_{X_i} c ≤ prod_{X_i} p/(1-p)`, split along `S ⊆ X_i`. -/\ntheorem genPrice_le_ratio {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p c : X → ℝ} (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) {i : Fin F.b}\n (hp : ∀ v ∈ block F i, 0 ≤ p v ∧ p v < 1) {S : Finset X} (hS : S ⊆ block F i) :\n genPrice c (block F i) ≤\n (∏ v ∈ S, p v) * ((∏ v ∈ block F i \\ S, p v) * ∏" + }, + { + "kind": "theorem", + "unqualified_name": "prod_le_pow_of_le", + "line": 121, + "source_header": "prod_sdiff hS).symm]\n ring\n\n/-- A product of coordinates in `[0, B]` is at most `B^|s|`. -/\ntheorem prod_le_pow_of_le {X : Type} {s : Finset X} {p : X → ℝ} {B : ℝ}\n (hp : ∀ v ∈ s, 0 ≤ p v ∧ p v ≤ B" + }, + { + "kind": "theorem", + "unqualified_name": "prod_inv_le_pow", + "line": 127, + "source_header": ".1) (fun v hv => (hp v hv).2)\n\n/-- A product of `(1 - p_v)⁻¹` with `p_v ≤ B < 1` is at most `((1 - B)⁻¹)^|s|`. -/\ntheorem prod_inv_le_pow {X : Type} {s : Finset X} {p : X → ℝ} {B : ℝ} (hB : B < 1)\n (hp : ∀ v ∈ s, p v ≤ B) : ∏ v ∈ s, (1" + }, + { + "kind": "theorem", + "unqualified_name": "genPrice_le_prod_mul_ratio", + "line": 135, + "source_header": "narith) (by linarith [hp v hv])\n\n/-- The ratio bound: for `0 ≤ c ≤ phi(p)`, `0 ≤ p ≤ B < 1` on the block and `S ⊆ X_i`,\n`price(X_i) ≤ (prod_{S} p) * B^(n - |S|) * (1 - B)^(-n)`. -/\ntheorem genPrice_le_prod_mul_ratio {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p c : X → ℝ} (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) {i : Fin F.b} {B : ℝ} (hB0 : 0 ≤ B)\n (hB : B < 1) (hp : ∀ v ∈ block F i, 0 ≤ p v ∧ p v ≤ B) {S : Finset X}\n (hS : S ⊆ block F i) :\n genPrice c (block F i) ≤\n (∏ v ∈ S, p v) * (B ^ ((block F i).card - S.card)" + }, + { + "kind": "theorem", + "unqualified_name": "quarter_pow_identity", + "line": 153, + "source_header": "v hv).2]))\n (pow_nonneg hB0 _)\n\n/-- The exponent identity behind (T3): `(1/4)^m (4/3)^(m+k) = 4^k / 3^(m+k)`. -/\ntheorem quarter_pow_identity (m k : ℕ) :\n (1 / 4 : ℝ) ^ m * (4 /" + }, + { + "kind": "theorem", + "unqualified_name": "quarter_ratio_le", + "line": 159, + "source_header": "pow, one_pow, pow_add]\n field_simp\n\n/-- Display (T3) in the form used here: for `a ≥ 1`, `n ≥ 2a + 1`,\n`(1/4)^(n-a-1) (3/4)^(-n) ≤ 16/27`. -/\ntheorem quarter_ratio_le {a n : ℕ} (ha : 1 ≤ a) (hn : 2 * a + 1 ≤ n) :\n (1 / 4 : ℝ) ^ (n - (a" + }, + { + "kind": "theorem", + "unqualified_name": "localGood_congr", + "line": 168, + "source_header": "(a + 1)) ha hn\n exact h.1.trans h.2\n\n/-! ### Block-local hypotheses -/\n\n/-- `localGood` depends on `p` only through its values on the block. -/\ntheorem localGood_congr {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p p' : X → ℝ} {i : Fin F.b} (h : ∀ v ∈ block F i, p v = p' v)" + }, + { + "kind": "theorem", + "unqualified_name": "localFailure_congr", + "line": 184, + "source_header": "otMem hmem, Set.indicator_of_notMem hmem]\n\n/-- `localFailure` depends on `p` only through its values on the block. -/\ntheorem localFailure_congr {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData X)\n {p p' : X → ℝ} {i : Fin F.b} (h : ∀ v ∈ block F i, p v = p' v) :" + }, + { + "kind": "theorem", + "unqualified_name": "prod_le_localFailure_of_card_local", + "line": 191, + "source_header": "old localFailure\n rw [localGood_congr F h]\n\n/-- The marginal bound `prod_{v in S} p_v ≤ q_i` of `P15Hazard` under block-local hypotheses\nonly (`p` is replaced by its restriction to the block, zero elsewhere). -/\ntheorem prod_le_localFailure_of_card_local {X : Type} [Fintype X] [DecidableEq X]\n (F : RealizedData X) {p : X → ℝ} {i : Fin F.b} (hp : ∀ v ∈ block F i, 0 ≤ p v ∧ p v ≤ 1)\n {S : Finset X} (hS : S ⊆ block F i) (hcard : F.a i + 1 ≤ S." + }, + { + "kind": "theorem", + "unqualified_name": "genPrice_le_budget", + "line": 208, + "source_header": "x.prod_le_localFailure_of_card F hp' hS hcard\n\n/-! ### The local budget (T4) -/\n\n/-- Display (T4), first inequality: for `a_i ≥ 1`, `d_i ≥ 2`, `0 ≤ p ≤ 1/4` and\n`0 ≤ c ≤ phi(p)`, `price(X_i) ≤ (16/27) q_i`. -/\ntheorem genPrice_le_budget {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) (hd : ∀ i, 2 ≤ F.d i) {p c : X → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1 / 4) (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) (i : Fin F.b) :\n genPri" + }, + { + "kind": "theorem", + "unqualified_name": "sum_genPrice_le_budget", + "line": 238, + "source_header": ":= mul_le_mul_of_nonneg_left hprodS (by norm_num)\n\n/-- The summed budget: `sum_i price(X_i) ≤ (16/27) (-log mu_p(D))` when `mu_p(D) > 0`. -/\ntheorem sum_genPrice_le_budget {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamily F) (hd : ∀ i, 2 ≤ F.d i) {p c : X → ℝ}\n (hp : ∀ v, 0 ≤ p v ∧ p v ≤ 1 / 4) (hc : ∀ v, 0 ≤ c v ∧ c v ≤ phi (p v))\n (hmu : 0 < mu F p) :\n ∑ i, genP" + }, + { + "kind": "theorem", + "unqualified_name": "weight_nonneg", + "line": 252, + "source_header": "ocalFailure_le_neg_log_mu hF hp1 hmu) (by norm_num)\n\n/-! ### Positivity of `mu_p(D)` -/\n\n/-- The weight is nonnegative for `p in [0,1]^X`. -/\ntheorem weight_nonneg {Y : Type} [Fintype Y] [DecidableEq Y] {p : Y → ℝ}\n (hp :" + }, + { + "kind": "theorem", + "unqualified_name": "isGood_empty", + "line": 261, + "source_header": "Finset.prod_nonneg fun v _ => ?_)\n linarith [(hp v).2]\n\n/-- The empty set is good when every edge of `H` has at least two elements. -/\ntheorem isGood_empty {X : Type} [Fintype X] [DecidableEq X] {F : Real" + }, + { + "kind": "theorem", + "unqualified_name": "mu_pos", + "line": 270, + "source_header": "have h2 := hH e he\n rw [h0, card_empty] at h2\n omega\n\n/-- `mu_p(D) > 0` for `0 ≤ p < 1` coordinatewise: the empty set is good and has positive weight. -/\ntheorem mu_pos {X : Type} [Fintype X] [DecidableEq X] {F : RealizedData X}\n (hF : IsRealizedFamil" + }, + { + "kind": "theorem", + "unqualified_name": "log_benchmark_le", + "line": 283, + "source_header": "]\n exact Finset.prod_pos fun v _ => by linarith [(hp v).2]\n\n/-! ### The six-block benchmark at `p = 1/40900` -/\n\n/-- `log(40900/40899) ≤ 1/40899`. -/" + }, + { + "kind": "theorem", + "unqualified_name": "phi_benchmark", + "line": 290, + "source_header": "b_one_of_pos (by norm_num : (0 : ℝ) < 40900 / 40899)\n linarith\n\n/-- `phi(1/40900) = log(40900/40899)`. -/\nt" + }, + { + "kind": "theorem", + "unqualified_name": "genPrice_benchmark_le", + "line": 298, + "source_header": "_neg]\n exact min_eq_right (log_benchmark_le.trans (by norm_num))\n\n/-- Each full-block price at `c ≤ log(40900/40899)` is at most `1/40899`. -/\ntheorem genPrice_benchmark_le {c : Fin 6 × Fin 409 → ℝ}\n (hc : ∀ v, 0 ≤ c v ∧ c v ≤ Real.log (40900 / 40899)) (i : Fin" + }, + { + "kind": "theorem", + "unqualified_name": "famPrice_benchmark_le_one", + "line": 308, + "source_header": "40899 := pow_le_of_le_one (by norm_num) (by norm_num) (by norm_num)\n\n/-- The full-block price at `c ≤ log(40900/40899)` is at most `6/40899 ≤ 1`. -/\ntheorem famPrice_benchmark_le_one {c : Fin 6 × Fin 409 → ℝ}\n (hc : ∀ v, 0 ≤ c v ∧ c v ≤ Real.log" + }, + { + "kind": "theorem", + "unqualified_name": "coverCostHazardBound", + "line": 325, + "source_header": "rw [nsmul_eq_mul]\n norm_num\n _ ≤ 1 := by norm_num\n\nend Aux\n\n/-! ## Inventory theorems -/\n\n/-- Proves: `UniversalLaw.Spec.P15.CoverCostHazardBound` (claim `p15-realized-covers`, display\n(P8)).\nMethod: the set of cover prices is bounded below by `0`; the cover `{∅}` has price `1`, so\n`covercost ≤ 1` (`csInf_le`); for `K ≥ K_H(d)` the full blocks cover (`fullBlockCoverIff`), so\n`covercost ≤ sum_i price(X_i) ≤ sum_i q_i` (display (P4), `P15Hazard.localPriceChain`) and, when\n`mu_p(D) > 0`, `sum_i q_i ≤ -log mu_p(D)` (display (P5), `P15Hazard.independentBlockHazard`).\nDoes not establish: the informal display (P8) or its review and acceptance; anything for prices\n`c_v > p_v`; attainment of the infimum; the alignment of `coverCost`, `mu`, `localFailure` with\nthe source's objects (PENDING_INDEPENDENT_REVIEW); the unrestricted P15 prize or original P15-B;\nthe disposition HOLD_WITH_DOMAIN of `p15-realized-covers`, which is transcribed in the register,\nnot derived here. -/\ntheorem coverCostHazardBound {X : Type} [Fintype X] [DecidableEq X" + }, + { + "kind": "theorem", + "unqualified_name": "restrictedLocalBudget", + "line": 351, + "source_header": "_ ≤ -Real.log (mu F p) := Aux.sum_localFailure_le_neg_log_mu hF hp hmu\n\n/-- Proves: `UniversalLaw.Spec.P15.RestrictedLocalBudget` (claim `p15-price-budget-restricted`,\ndisplay (T4)).\nMethod: `phi(p) ≤ -log(1-p) ≤ p/(1-p)` (display (T2), `P15Elementary.logRatioBound`); a subset\n`S ⊆ X_i` with `|S| = a_i + 1` exists since `|X_i| = a_i d_i + 1`; `prod_{X_i} c ≤ prod_{X_i}\np/(1-p) ≤ (prod_S p) (1/4)^(n-a-1) (4/3)^n = (prod_S p) 4^(a+1)/3^n ≤ (16/27) prod_S p`\n(display (T3), `P15Elementary.ratioExponentBound` with `n ≥ 2a + 1` from `d_i ≥ 2`); `prod_S p ≤\nq_i` (block-local marginal bound of `P15Hazard`); `(16/27) q ≤ q ≤ phi(q)` on `[0, 1]`.\nDoes not establish: the informal display (T4) or its review and acceptance; sharpness of the\nrange `p_v ≤ 1/4` (the source: \"a sufficient range, not an asserted sharp threshold\"); anything\nat `d_i = 1` (the source's refutation stands); the alignment of `localFailure`, `phi` with the\nsource's objects (PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of\n`p15-price-budget-restricted`, which is transcribed in the register, not derived here. -/\ntheorem restrictedLocalBudget {X : Type} [Fintype X] [DecidableEq" + }, + { + "kind": "theorem", + "unqualified_name": "rhoTestSufficient", + "line": 375, + "source_header": "one_mul _\n _ ≤ phi (localFailure F p i) := P15Hazard.Aux.le_phi_self hq1\n\n/-- Proves: `UniversalLaw.Spec.P15.RhoTestSufficient` (claim `p15-price-budget-restricted`,\ndisplay (T5)).\nMethod: the same ratio argument as (T3) with the common bound `p_*`: for `S ⊆ X_i` with\n`|S| = a_i + 1`, `prod_{X_i} c ≤ prod_{X_i} p/(1-p) ≤ (prod_S p) p_*^(n-a-1) (1-p_*)^(-n) =\n(prod_S p) rho(a_i, d_i, p_*) ≤ prod_S p` since `n = a_i d_i + 1`, and `prod_S p ≤ q_i` by the\nblock-local marginal bound (`p` restricted to the block, as only the block's coordinates enter\n`q_i`).\nDoes not establish: the informal display (T5) or its review and acceptance; anything when\n`rho > 1` (the source: \"rho>1 is not a counterexample and must not be labeled infeasible\"); the\nalignment of `localFailure`, `phi`, `rhoTest` with the source's objects\n(PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of `p15-price-budget-restricted`,\nwhich is transcribed in the register, not derived here. -/\ntheorem rhoTestSufficient {X : Type} [Fintype X] [Decida" + }, + { + "kind": "theorem", + "unqualified_name": "restrictedTransformedPriceBudget", + "line": 413, + "source_header": "prodS0\n _ = ∏ v ∈ S, p v := mul_one _\n _ ≤ localFailure F p i := hprodS\n\n/-- Proves: `UniversalLaw.Spec.P15.RestrictedTransformedPriceBudget` (claim\n`p15-price-budget-restricted`, display (T1)).\nMethod: `covercost ≤ 1` by the cover `{∅}`; for `K ≥ K_H(d)` the full blocks cover\n(`fullBlockCoverIff`), so `covercost ≤ sum_i price(X_i) ≤ (16/27) sum_i q_i` (display (T4), the\nlocal budget of this module) and, when `mu_p(D) > 0`, `sum_i q_i ≤ -log mu_p(D)` (display (T6),\n`P15Hazard.independentBlockHazard`); the capped hazard handles `mu_p(D) = 0` by its convention.\nDoes not establish: the informal display (T1) or its review and acceptance; any retraction of the\ndemand-one refutation; the unrestricted prize; new classical coloring theory; attainment of the\ninfimum; the alignment of `coverCost`, `mu`, `phi` with the source's objects\n(PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of `p15-price-budget-restricted`,\nwhich is transcribed in the register, not derived here. -/\ntheorem restrictedTransformedPriceBudget {X : Type} [Fintype X] [DecidableEq X]" + }, + { + "kind": "theorem", + "unqualified_name": "benchmark816TransformedRange", + "line": 431, + "source_header": "Cost_le_sum_block hF hc0 hK).trans (Aux.sum_genPrice_le_budget hF hd hp hc hmu)\n\n/-- Proves: `UniversalLaw.Spec.P15.Benchmark816TransformedRange` (claim\n`p15-price-budget-restricted`, Section 4 of price_budget PROOF.md).\nMethod: `1 - 1/40900 = (40900/40899)⁻¹`, `Real.log_inv` and `log(40900/40899) ≤ 1/40899 ≤ 1`\nfor the value of `phi`; the cover from `fullBlockCoverIff` and `K_H(408, ..., 408) = 816`\n(`P15Structure.benchmark816Palette`); the price bound from six block prices `≤ (1/40899)^409 ≤\n1/40899` and from the summed local budget (T4) at `p_v = 1/40900 ≤ 1/4`, `d_i = 408 ≥ 2`, with\n`mu_p(D) > 0` because the empty set is good with positive weight; the `covercost` bound is\n`RestrictedTransformedPriceBudget` at these data.\nDoes not establish: the informal Section 4 or its review and acceptance; optimality of the\n816-label cover; the whole-ground value `818` (a separate `Prop`); the alignment of the formal\nobjects with the source's (PENDING_INDEPENDENT_REVIEW); the disposition HOLD_WITH_DOMAIN of\n`p15-price-budget-restricted`, which is transcribed in the register, not derived here. -/\ntheorem" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/RNProbability.lean", + "sha256": "3bdc6055c8fe9419addc3ad7bf77c5a88efe387470d9c7201331343859808636", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "mul_indicator_one_eq", + "line": 31, + "source_header": "x\n\n/-- `N · 1_E = 1_E · N` pointwise. -/\ntheorem mul_indicator_one_eq {Ω : Type} (Ev : Set Ω) (N : Ω → ℕ) (ω : Ω) :\n (N ω : ℝ) * Ev.indicator (fun _ => (1 : ℝ)) ω = Ev.indicator (fun ω => (N ω : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "conditionalMeanIdentityN3", + "line": 40, + "source_header": "Aux\n\n/-- Proves: `UniversalLaw.Spec.RN.ConditionalMeanIdentityN3` (register claims\n`rn-count-interface`, `math.rn-count-interface`).\nMethod: unfold `ProbabilityTheory.cond = (P E)⁻¹ • P.restrict E`, `integral_smul_measure`,\n`integral_indicator`, cancel `P(E) · P(E)⁻¹`.\nDoes not establish: the informal Theorem N, the bounded-conditional-mean equivalence, the lower\ncomparison `q ≥ c r^3`, anything about the Gaussian model, review or acceptance. -/\ntheorem conditionalMeanIdentityN3 : ConditionalMeanIdent" + }, + { + "kind": "theorem", + "unqualified_name": "holderCountBoundN1", + "line": 52, + "source_header": "_mul]\n\n/-- Proves: `UniversalLaw.Spec.RN.HolderCountBoundN1` (register claims `rn-count-interface`,\n`math.rn-count-interface`).\nMethod: Mathlib's Hölder inequality `integral_mul_le_Lp_mul_Lq_of_nonneg` with the conjugate\nexponent `q = p/(p-1)`, `MemLp` of `N` recovered from the integrability of `N^p`, and\n`∫ 1_E^q = P(E)`.\nDoes not establish: the informal Theorem N, that any Gaussian count satisfies the moment\nhypothesis, any rate in `r`, review or acceptance. -/\ntheorem holderCountBoundN1 : HolderCount" + }, + { + "kind": "theorem", + "unqualified_name": "holderConsequenceN2", + "line": 98, + "source_header": "act key\n\n/-- Proves: `UniversalLaw.Spec.RN.HolderConsequenceN2` (register claims `rn-count-interface`,\n`math.rn-count-interface`).\nMethod: `holderCountBoundN1`, then monotonicity of `x ↦ x^(1/p)` and `x ↦ x^(1-1/p)` on\n`[0, ∞)` and the rpow algebra `(A r^(-β))^(1/p) (C r^3)^(1-1/p) = A^(1/p) C^(1-1/p)\nr^((3(p-1)-β)/p)`.\nDoes not establish: the informal Theorem N, that the exponent can be rounded up to `3`, that\nany Gaussian count satisfies the hypotheses, review or acceptance. -/\ntheorem holderConsequenceN2 : HolderCons" + }, + { + "kind": "theorem", + "unqualified_name": "uniformLaw_Iic", + "line": 137, + "source_header": "space Aux\n\n/-- The uniform law of `Iic a` for `0 ≤ a ≤ 1` is `a`. -/\ntheorem uniformLaw_Iic {a : ℝ} (ha0 : 0 ≤ a) (ha1 : a ≤ 1) :\n (uniformLaw (Set.Iic a))" + }, + { + "kind": "theorem", + "unqualified_name": "integral_counterCount", + "line": 149, + "source_header": "ofReal ha0]\n\n/-- `∫ N_r dU = ceil(log(1/r)) · U(E_r)`. -/\ntheorem integral_counterCount (r : ℝ) :\n ∫ u, counterCount r u ∂uniformLaw =\n (⌈Real.log (1 / r)⌉₊ : ℝ) * (uniformLaw (Set.Iic (r" + }, + { + "kind": "theorem", + "unqualified_name": "integral_counterCount_rpow", + "line": 157, + "source_header": "mul, mul_one]\n\n/-- `∫ N_r^p dU = ceil(log(1/r))^p · U(E_r)` for `p ≠ 0`. -/\ntheorem integral_counterCount_rpow (r : ℝ) {p : ℝ} (hp : p ≠ 0) :\n ∫ u, counterCount r u ^ p ∂uniformLaw =\n (⌈Real.log (1 / r)⌉₊ : ℝ) ^ p * (uniformLaw (Set.Iic (" + }, + { + "kind": "theorem", + "unqualified_name": "n4_fixed", + "line": 170, + "source_header": "_mul, mul_comm]\n\n/-- The two displays of (N4) for a fixed `0 < r ≤ e^(-1)`. -/\ntheorem n4_fixed (r : ℝ) (hr : 0 < r) (hre : r ≤ Real.exp (-1)) :\n (uniformLaw (Set.Iic (r ^ 3))).toReal = r ^ 3 ∧\n (∫ u, counterCount r u ∂uniformLaw) / r ^ 3 = (⌈Real.l" + }, + { + "kind": "theorem", + "unqualified_name": "one_le_log_one_div", + "line": 181, + "source_header": "hr3.ne', mul_one]\n\n/-- `log (1/r) ≥ 1` for `0 < r ≤ e^(-1)`. -/\ntheorem one_le_log_one_div {r : ℝ} (hr : 0 < r) (hre : r ≤ Real.exp (-1)) :\n 1" + }, + { + "kind": "theorem", + "unqualified_name": "pow_three_eq_exp", + "line": 188, + "source_header": "xp_neg]\n exact hre\n\n/-- `r^3 = exp(-3 log(1/r))` for `r > 0`. -/\ntheorem pow_three_eq_exp {r : ℝ} (hr : 0 < r) :\n r ^ 3 = Real.exp (-(3" + }, + { + "kind": "theorem", + "unqualified_name": "integral_exp_neg_div_Ioi_zero", + "line": 199, + "source_header": "1\n push_cast\n ring\n\n/-- `∫_0^∞ exp(-s/B) ds = B` for `B > 0`. -/\ntheorem integral_exp_neg_div_Ioi_zero {B : ℝ} (hB : 0 < B) :\n ∫ s in Set.Ioi (0 : ℝ)" + }, + { + "kind": "theorem", + "unqualified_name": "uniformCounterexampleN4", + "line": 211, + "source_header": "fun]\n exact h\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.RN.UniformCounterexampleN4` (register claims\n`rn-count-interface`, `math.rn-count-interface`).\nMethod: `U(E_r) = r^3` from `volume.restrict` on `Icc 0 1`; `∫ N_r dU = ceil(log(1/r)) r^3`\nby `integral_indicator_const`; the limit from `log ∘ inv → ∞` on `𝓝[>] 0` and\n`x ≤ ⌈x⌉₊`; the moment bound with the explicit constant `A_p = 2^n n!`, `n = ⌈p⌉₊`, via\n`⌈t⌉₊^p ≤ (2t)^n` for `t = log(1/r) ≥ 1` and `t^n ≤ n! e^t`.\nDoes not establish: the source's sharper bound `sup_(t>=1) e^(-3t)(t+1)^p`, the one-`p`\nsharpness construction, anything about the Gaussian field, the informal Theorem N, review or\nacceptance. -/\ntheorem uniformCounterexampleN4" + }, + { + "kind": "theorem", + "unqualified_name": "exponentialTailLayerCakeN5", + "line": 270, + "source_header": "ght (by positivity) hexp2\n\n/-- Proves: `UniversalLaw.Spec.RN.ExponentialTailLayerCakeN5` (register claims\n`rn-count-interface`, `math.rn-count-interface`).\nMethod: with `t₀ = B log(A/q) ≥ 0`, the pointwise bound `N 1_E ≤ t₀ 1_E + (N - t₀)⁺`; the\nlayer-cake formula `Integrable.integral_eq_integral_meas_lt` for `(N - t₀)⁺`; the tail\nhypothesis at `t = s + t₀`; and `∫_0^∞ A e^(-(s+t₀)/B) ds = A B e^(-t₀/B) = B q`\n(`integral_comp_mul_left_Ioi`, `integral_exp_neg_Ioi_zero`).\nDoes not establish: the source's intermediate identity `∫_0^∞ min(q, A e^(-t/B)) dt`, that\nthe logarithmic loss is attained, anything about the Gaussian model, the informal Theorem N,\nreview or acceptance. -/\ntheorem exponentialTailLayerCakeN5 :" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/P15Elementary.lean", + "sha256": "d4d87bba1da9473cd3c5bda9c702ba4dd036de06085d5ad589f17988bf8695b1", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "two_lt_exp_one", + "line": 39, + "source_header": "x\n\n/-! ### Real-analytic constants -/\n\n/-- `2 < e` from Mathlib's decimal bound. -/\ntheorem two_lt_exp_one : (2 : ℝ) < Real." + }, + { + "kind": "theorem", + "unqualified_name": "three_exp_sub_two_pos", + "line": 45, + "source_header": "arith\n\n/-- `3e - 2 > 0`. -/\ntheorem three_exp_sub_two_pos : (0 : ℝ) < 3 * Real.ex" + }, + { + "kind": "theorem", + "unqualified_name": "exp_two_eq", + "line": 49, + "source_header": "inarith\n\n/-- `exp 2 = (exp 1)^2`. -/\ntheorem exp_two_eq : Real.exp 2 = Real." + }, + { + "kind": "theorem", + "unqualified_name": "exp_neg_two_eq", + "line": 53, + "source_header": "norm_num\n\n/-- `exp (-2) = (exp (-1))^2`. -/\ntheorem exp_neg_two_eq : Real.exp (-2) = Real.e" + }, + { + "kind": "theorem", + "unqualified_name": "exp_neg_three_eq", + "line": 57, + "source_header": "]; norm_num\n\n/-- `exp (-3) = (exp (-1))^3`. -/\ntheorem exp_neg_three_eq : Real.exp (-3) = Real" + }, + { + "kind": "theorem", + "unqualified_name": "log_three_exp_sub_two_lt_two", + "line": 61, + "source_header": "ul]; norm_num\n\n/-- `log(3e - 2) < 2`, from `3e - 2 < e^2`, i.e. `(e-1)(e-2) > 0`. -/\ntheorem log_three_exp_sub_two_lt_two : Real.log (3 * Real" + }, + { + "kind": "theorem", + "unqualified_name": "one_lt_hStar", + "line": 67, + "source_header": "one\n nlinarith\n\n/-- `1 < h_star`. -/\ntheorem one_lt_" + }, + { + "kind": "theorem", + "unqualified_name": "taylor_sum_eq", + "line": 71, + "source_header": "_lt_two; linarith\n\n/-- The Taylor sum of the Section 6 certificate, evaluated exactly. -/\ntheorem taylor_sum_eq :\n (∑ j ∈ Finset.range 6, (11 / 6 : ℝ) ^ j / (Nat.factorial j : ℝ)) =\n 197 /" + }, + { + "kind": "theorem", + "unqualified_name": "exp_eleven_sixths_gt", + "line": 78, + "source_header": "ctorial]\n norm_num\n\n/-- `197/32 < exp(11/6)` by the degree-5 Taylor lower bound. -/\ntheorem exp_eleven_sixths_gt : (197 / 32 : ℝ" + }, + { + "kind": "theorem", + "unqualified_name": "three_exp_sub_two_lt", + "line": 84, + "source_header": "m_eq] at h\n linarith\n\n/-- `3e - 2 < 197/32` from `e < 2.7182818286`. -/\ntheorem three_exp_sub_two_lt : 3 * Real.exp" + }, + { + "kind": "theorem", + "unqualified_name": "log_three_exp_sub_two_lt", + "line": 88, + "source_header": "exp_one_lt_d9; linarith\n\n/-- `log(3e - 2) < 11/6`. -/\ntheorem log_three_exp_sub_two_lt : Real.log (3 *" + }, + { + "kind": "theorem", + "unqualified_name": "seven_sixths_lt_hStar", + "line": 93, + "source_header": "o_lt exp_eleven_sixths_gt\n\n/-- `7/6 < h_star`. -/\ntheorem seven_sixths_lt_" + }, + { + "kind": "theorem", + "unqualified_name": "rhoStar_lt_six_sevenths", + "line": 97, + "source_header": "ee_exp_sub_two_lt; linarith\n\n/-- `rho_star < 6/7`. -/\ntheorem rhoStar_lt_s" + }, + { + "kind": "theorem", + "unqualified_name": "pStar_pos", + "line": 104, + "source_header": "ff₀ (by linarith)]\n linarith\n\n/-- `0 < p_star`. -" + }, + { + "kind": "theorem", + "unqualified_name": "pStar_gt_half", + "line": 108, + "source_header": "l.exp_neg_one_lt_half; linarith\n\n/-- `1/2 < p_star`. -/\ntheo" + }, + { + "kind": "theorem", + "unqualified_name": "pStar_lt_one", + "line": 112, + "source_header": "eal.exp_neg_one_lt_half; linarith\n\n/-- `p_star < 1`." + }, + { + "kind": "theorem", + "unqualified_name": "sum_weight_eq_one", + "line": 116, + "source_header": "have := Real.exp_pos (-1); linarith\n\n/-! ### Product weights -/\n\n/-- The weights of all subsets sum to one (`Finset.prod_add` with `f = p`, `g = 1 - p`). -/\ntheorem sum_weight_eq_one {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) :\n ∑ U ∈ (Finset.un" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_succ_left", + "line": 127, + "source_header": "hl] at h\n unfold weight\n exact h.symm\n\n/-! ### Binomial lower tails -/\n\n/-- One more trial: `P(Bin(n+1,p) ≤ k) = P(Bin(n,p) ≤ k) - C(n,k) p^(k+1) (1-p)^(n-k)` for\n`k ≤ n` (Pascal's rule, induction on `k`). -/\ntheorem binomTail_succ_left (n k : ℕ) (p : ℝ) (hk : k ≤ n) :\n binomTail (n + 1) k p =\n binomTail n k p - (Nat.choose" + }, + { + "kind": "theorem", + "unqualified_name": "muOf_capacityFamily", + "line": 153, + "source_header": "w [h1, h2, pow_succ]\n push_cast\n ring\n\n/-- (F9) as an identity: the product measure of the capacity family at a constant vector is the\nbinomial lower tail (stated for `a ≤ n`). -/\ntheorem muOf_capacityFamily (n a : ℕ) (han : a ≤ n) (c : ℝ) :\n muOf (capac" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_antitone_step", + "line": 171, + "source_header": "act Finset.sum_congr rfl (fun j _ => by ring)\n\n/-- The lower tail decreases when one trial is added (`a ≤ n`, `0 ≤ c ≤ 1`). -/\ntheorem binomTail_antitone_step (n a : ℕ) (han : a ≤ n) (c : ℝ) (h0 : 0 ≤ c) (h1 : c ≤ 1" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_le_of_le", + "line": 179, + "source_header": "h0 _)) (pow_nonneg (by linarith) _)\n linarith\n\n/-- Monotonicity in the number of trials: `binomTail n a c ≤ binomTail m a c` for `a ≤ m ≤ n`. -/\ntheorem binomTail_le_of_le (a m n : ℕ) (hm : a ≤ m) (hmn : m ≤ n) (c : ℝ) (h0 : 0 ≤ c)" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_pos", + "line": 186, + "source_header": "il_antitone_step k a (le_trans hm hk) c h0 h1) ih\n\n/-- The lower tail is positive for `0 ≤ c < 1` (the `j = 0` term is `(1-c)^n > 0`). -/\ntheorem binomTail_pos (n a : ℕ) (c :" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_three_one", + "line": 199, + "source_header": "neg h0 _)) (pow_nonneg (by linarith) _))\n linarith\n\n/-- `P(Bin(3, p_star) ≤ 1) = 3e^{-2} - 2e^{-3}`. -/\ntheorem binomTail_three_one : binomT" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_block", + "line": 212, + "source_header": "size `cap + 1` -/\n\nsection OneBlock\n\nvariable (cap : ℕ)\n\n/-- The single block is the whole ground set. -/\ntheorem oneBlock_block" + }, + { + "kind": "theorem", + "unqualified_name": "card_le_of_ne_univ", + "line": 218, + "source_header": "lock\n rw [Fin.fin_one_eq_zero i]\n simp [demandOneBlock]\n\n/-- A proper subset of a `(cap+1)`-set has at most `cap` elements. -/\ntheorem card_le_of_ne_univ (U : Finse" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_isGood", + "line": 227, + "source_header": "f_eq_univ U).mp e)\n rw [Fintype.card_fin] at h1 h2\n omega\n\n/-- Goodness is the capacity constraint. -/\ntheorem oneBlock_isGood (U : Finset (Fin (" + }, + { + "kind": "theorem", + "unqualified_name": "decomp_one", + "line": 234, + "source_header": "demandOneBlock cap) U) ↔ U.card ≤ cap\n simp [oneBlock_block]\n\n/-- One-piece decomposability is goodness (for any family). -/\ntheorem decomp_one {X : Type} [Fintype X] [DecidableEq X] (F : Realized" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_obstruction", + "line": 246, + "source_header": "j j' hjj' => absurd (Subsingleton.elim j j') hjj', ?_⟩\n simp\n\n/-- At `K = 1` the sole obstruction is the full block. -/\ntheorem oneBlock_obstruction (U : Finset (Fin (cap + 1)" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_isRealized", + "line": 260, + "source_header": "· rintro rfl\n rw [Finset.card_univ, Fintype.card_fin]; omega\n\n/-- The side conditions hold for `cap ≥ 1`. -/\ntheorem oneBlock_" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_mu", + "line": 273, + "source_header": ", ∀ f ∈ (∅ : Finset (Finset (Fin 1))),\n e ⊆ f → e = f\n simp\n\n/-- `mu_p(D) = 1 - prod_v p_v`: every set but the full block is good. -/\ntheorem oneBlock_mu (" + }, + { + "kind": "theorem", + "unqualified_name": "oneBlock_coverCost_ge_one", + "line": 301, + "source_header": "weight p Finset.univ = ∏ v, p v := by unfold weight; simp\n linarith\n\n/-- At unit prices every cover of `{X}` costs at least one. -/\ntheorem oneBlock_coverCo" + }, + { + "kind": "theorem", + "unqualified_name": "twoCoord_eq", + "line": 322, + "source_header": "Finset.single_le_sum (fun g _ => by simp [genPrice]) hg\n\nend OneBlock\n\n/-- The two-coordinate record of the price boundary is the `cap =" + }, + { + "kind": "theorem", + "unqualified_name": "triangle_feasible3", + "line": 325, + "source_header": "nd-one block. -/\ntheorem twoCoord_eq : twoCoord = demandOneBlock 1 := rfl\n\n/-! ### The triangle palette instance -/\n\n/-- Three singletons are a feasible palette of size three for the triangle. -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "triangle_not_feasible0", + "line": 332, + "source_header": ") (fun _ => 1) 3 := by\n refine ⟨fun i => {i}, fun i => by simp, ?_⟩\n decide\n\n/-- No palette of size zero. -/\ntheorem tria" + }, + { + "kind": "theorem", + "unqualified_name": "triangle_not_feasible1", + "line": 340, + "source_header": "ype.card (Fin 0) := Finset.card_le_univ _\n rw [Fintype.card_fin] at h0\n omega\n\n/-- No palette of size one (finite check). -/\ntheorem tr" + }, + { + "kind": "theorem", + "unqualified_name": "triangle_not_feasible2", + "line": 345, + "source_header": "3 (completeClutter 3 1) (fun _ => 1) 1 := by\n unfold IsPaletteFeasible\n decide\n\n/-- No palette of size two (finite check over the `4^3` label-set assignments). -/\ntheorem" + }, + { + "kind": "theorem", + "unqualified_name": "twoCoordGeneratorPrices", + "line": 352, + "source_header": "pleteClutter 3 1) (fun _ => 1) 2 := by\n unfold IsPaletteFeasible\n decide\n\nend Aux\n\n/-! ## Price boundary (demand one) -/\n\n/-- Proves: `UniversalLaw.Spec.P15.TwoCoordGeneratorPrices` (register rows `p15-price-boundary`,\n`math.p15-price-boundary`).\nMethod: unfold `genPrice`/`twoCoordC`, evaluate the four finite products with `simp`/`norm_num`.\nDoes not establish: the demand-one refutation itself (`DemandOneRefutation`), any review or\nacceptance of P15-PRICE-BOUNDARY-20260924-v1; the disposition EXACT_COUNTEREXAMPLE is\ntranscribed in the register, not derived h" + }, + { + "kind": "theorem", + "unqualified_name": "logOnePlusBelowIdentity", + "line": 369, + "source_header": "mp [genPrice, twoCoordC]\n · simp [genPrice, twoCoordC, Finset.prod_const]\n norm_num\n\n/-- Proves: `UniversalLaw.Spec.P15.LogOnePlusBelowIdentity` (register row `p15-price-boundary`).\nMethod: `Real.log_lt_sub_one_of_pos` at `1 + x`.\nDoes not establish: anything about the refutation beyond this elementary inequ" + }, + { + "kind": "theorem", + "unqualified_name": "demandOneRefutation", + "line": 378, + "source_header": "s (by linarith : (0 : ℝ) < 1 + x)\n (by intro h; linarith : (1 : ℝ) + x ≠ 1)\n linarith\n\n/-- Proves: `UniversalLaw.Spec.P15.DemandOneRefutation` (register rows `p15-price-boundary`,\n`math.p15-price-boundary`).\nMethod: `twoCoord` is definitionally the `cap = 1` demand-one block, so the one-block lemmas\ngive the side conditions, the obstruction `{X}` and `mu_p(D) = 1 - (1/2)^2 = 3/4`; `K_H(d) = 1`\nby `Nat.sInf_le`/`le_csInf` (no palette of size `0`); admissibility and `phi(1/2) = log 2` from\n`Real.log_two_gt_d9`/`Real.log_two_lt_d9`; every cover contains a generator `g ⊆ X`, whose price\n`(2/3)^|g| ≥ 4/9`, and `{X}` attains `4/9` (`IsLeast.csInf_eq`); `log(4/3) < 1/3` from\n`Real.log_lt_sub_one_of_pos`.\nDoes not establish: that the refutation contradicts original P15-B (\"It does not contradict the\noriginal P15-B amalgamation\"), anything at the `408` scale or about the unrestricted prize, the\nsource's integral representation of `log 2`, nonauthor review or acceptance; the disposition\nEXACT_COUNTEREXAMPLE is transcrib" + }, + { + "kind": "theorem", + "unqualified_name": "logRatioBound", + "line": 467, + "source_header": "ro v\n show (2 / 3 : ℝ) ≤ phi (1 / 2)\n rw [hphi]; linarith\n · rw [hch, hcc]; linarith\n\n/-! ## Restricted price budget: elementary displays -/\n\n/-- Proves: `UniversalLaw.Spec.P15.LogRatioBound` (register row `p15-price-budget-restricted`).\nMethod: `Real.log_le_sub_one_of_pos` at `(1 - p)⁻¹` and `Real.log_inv`.\nDoes not establish: display (T1) or the restricted budget; the source's integral representation\no" + }, + { + "kind": "theorem", + "unqualified_name": "capTestAtTwoThirds", + "line": 483, + "source_header": "l.log_inv] at h\n have e : (1 - p)⁻¹ - 1 = p / (1 - p) := by\n field_simp\n ring\n linarith\n\n/-- Proves: `UniversalLaw.Spec.P15.CapTestAtTwoThirds` (register row `p15-price-budget-restricted`).\nMethod: `log 3 > 1` from `exp 1 < 3` (Mathlib's `Real.exp_one_lt_d9`); for `2/3 ≤ q < 1`,\n`-log(1-q) ≥ log 3 > 1` so the `min` is `1`; at `q = 1` the definition of `phi` gives `1`.\nDoes not establish: the checker program of the source's Section 5, n" + }, + { + "kind": "theorem", + "unqualified_name": "ratioExponentBound", + "line": 506, + "source_header": "hle\n rw [one_div, Real.log_inv] at hl\n exact min_eq_left (by linarith)\n · subst h\n simp\n\n/-- Proves: `UniversalLaw.Spec.P15.RatioExponentBound` (register row `p15-price-budget-restricted`).\nMethod: `3^n ≥ 3^(2a+1)` and the exact identity `4^(a+1)/3^(2a+1) = (4/3)(4/9)^a`; then\n`(4/9)^a ≤ 4/9` for `a ≥ 1`.\nDoes not establish: the ratio steps of (T3) preceding the exponent" + }, + { + "kind": "theorem", + "unqualified_name": "rhoStarBelowSixSevenths", + "line": 524, + "source_header": "/ 9 : ℝ) ^ a ≤ (4 / 9) ^ 1 := pow_le_pow_of_le_one (by norm_num) (by norm_num) ha\n nlinarith [h]\n\n/-! ## Full price: the constant `rho_star` -/\n\n/-- Proves: `UniversalLaw.Spec.P15.RhoStarBelowSixSevenths` (register row `p15-full-price`).\nMethod: `3e - 2 < 197/32 < exp(11/6)` (decimal bound on `e`; degree-5 Taylor lower bound on\n`exp`), hence `h_star > 7/6` and `rho_star = 1/h_star < 6/7`.\nDoes not establish: the 20-digit enclosure (F3) (`RhoStarEnclosure`), the budget (F2), or any\nreview/acceptance of P15-FULL-TRANSFORMED-PRICE-20260924-v1 (disposition REVIEWED_SCOPED is\ntransc" + }, + { + "kind": "theorem", + "unqualified_name": "sixSeventhsCertificate", + "line": 535, + "source_header": "hoStarBelowSixSevenths : UniversalLaw.Spec.P15.RhoStarBelowSixSevenths :=\n Aux.rhoStar_lt_six_sevenths\n\n/-- Proves: `UniversalLaw.Spec.P15.SixSeventhsCertificate` (register row `p15-full-price`).\nMethod: `Real.exp_one_lt_d9` for `e < 31967/11760`; `norm_num` for the two rational identities;\n`Real.sum_le_exp_of_nonneg` with six terms for `197/32 < exp(11/6)`; then `log` monotonicity.\nDoes not establish: the series and geometric-tail bounds the source uses for `e < 31967/11760`\n(a sharper Mathlib bound is used instead)," + }, + { + "kind": "theorem", + "unqualified_name": "hStarExceedsOne", + "line": 548, + "source_header": "en_sixths_gt, Aux.seven_sixths_lt_hStar, Aux.rhoStar_lt_six_sevenths⟩\n rw [Aux.taylor_sum_eq]\n norm_num\n\n/-- Proves: `UniversalLaw.Spec.P15.HStarExceedsOne` (register row `p15-full-price`).\nMethod: `2 < e` from `Real.exp_one_gt_d9`; `ring` for the factorisation; `u = exp(-1) < 1/2`\nand `u(1-u)(1-2u) > 0` for `3e^{-2} - 2e^{-3} < e^{-1}`; `log(3e-2) < 2` from `3e-2 < e^2`.\nDoes not establish: (F11) for general" + }, + { + "kind": "theorem", + "unqualified_name": "phiAtPStar", + "line": 562, + "source_header": "ul_pos hu (by linarith : (0 : ℝ) < 1 - Real.exp (-1)))\n (by linarith : (0 : ℝ) < 1 - 2 * Real.exp (-1))]\n\n/-- Proves: `UniversalLaw.Spec.P15.PhiAtPStar` (register row `p15-full-price`).\nMethod: `p_star < 1`, `1 - p_star = exp(-1)`, `Real.log_exp`.\nDoes not establish: equality" + }, + { + "kind": "theorem", + "unqualified_name": "hazardStarPositive", + "line": 574, + "source_header": "uceIte]\n have e : (1 : ℝ) - (1 - Real.exp (-1)) = Real.exp (-1) := by ring\n rw [e, Real.log_exp]\n norm_num\n\n/-! ## Full price: hazard positivity, binomial identities, worst case -/\n\n/-- Proves: `UniversalLaw.Spec.P15.HazardStarPositive` (register row `p15-full-price`).\nMethod: at the constant vector `p_star ∈ (0,1)` all weights are nonnegative, the empty set\ncontributes `(1-p_star)^n > 0`, and since `X ∉ A` the mass is at most `1 - p_star^n < 1`\n(all weights sum to one by `Finset.prod_add`); then `Real.log_neg`.\nDoes not establish:" + }, + { + "kind": "theorem", + "unqualified_name": "oddMajorityIdentity", + "line": 620, + "source_header": "hp0 _\n have hlt : muOf A (fun _ : Fin n => pStar) < 1 := by linarith\n have := Real.log_neg hpos hlt\n linarith\n\n/-- Proves: `UniversalLaw.Spec.P15.OddMajorityIdentity` (register row `p15-full-price`).\nMethod: the one-trial recursion `binomTail (n+1) k = binomTail n k - C(n,k) p^(k+1) (1-p)^(n-k)`\n(Pascal's rule, induction on `k`) applied twice, Pascal's rule once more, `ring`; the second\nform by `Nat.choose_symm_half`; negativity from `p(1-2p) < 0` and a positive factor.\nDoes not establish: (F11) itself (the ch" + }, + { + "kind": "theorem", + "unqualified_name": "binomTail_odd_chain", + "line": 659, + "source_header": ") (pow_pos (by linarith) _))\n (pow_pos (by linarith) _)\n exact mul_neg_of_neg_of_pos hneg hpos\n\nnamespace Aux\n\n/-- The chain of (F10) at `p ∈ (1/2, 1)`: `P(Bin(2a+1,p) ≤ a) ≤ P(Bin(3,p) ≤ 1)` for `a ≥ 1`. -/\ntheorem binomTail_od" + }, + { + "kind": "theorem", + "unqualified_name": "capacityWorstCase", + "line": 671, + "source_header": "ave h := (oddMajorityIdentity k c).2.2 hc hc1\n rw [show 2 * (k + 1) + 1 = 2 * k + 3 by ring]\n linarith\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.P15.CapacityWorstCase` (register row `p15-full-price`).\nMethod: `mu_{p_star}(capacityFamily n a) = binomTail n a p_star` (`Finset.sum_powerset_apply_card`),\nthe tail decreases in `n` (one-trial recursion) and along `a ↦ a+1` at `p_star > 1/2` (F10), so\n`binomTail n a ≤ binomTail 3 1` and `-log` reverses the order; `binomTail 3 1 p_star` evaluates\nto `3e^{-2} - 2e^{-3} = (3e-2)e^{-3}`, whose `-log` is `h_star`; `h_star > 1` as in\n`HStarExceedsOne`.\nDoes not establish: the local price bound (F12) or the assembly (F13); the source's remark \"it\nis not a finite-grid extrapolation\" is" + }, + { + "kind": "theorem", + "unqualified_name": "demandOneBoundary", + "line": 705, + "source_header": "m]\n ring\n rw [e, Real.log_mul (ne_of_gt Aux.three_exp_sub_two_pos) (Real.exp_pos _).ne', Real.log_exp]\n ring\n\n/-! ## Full price Section 5: the exact demand boundary -/\n\n/-- Proves: `UniversalLaw.Spec.P15.DemandOneBoundary` (register row `p15-full-price`).\nMethod: one-block lemmas (block = ground set, good ⇔ `|U| ≤ cap`, obstruction `{X}` at `K = 1`,\n`mu_p(D) = 1 - prod p_v` via `Finset.prod_add`, unit-price covers cost at least one by\n`le_csInf`); `p_star^(cap+1) < p_star` for `cap ≥ 1`; `Real.log_lt_log`; for `rho ≤ 1` the capped\nhazard is `min(1, rho(-log mu)) ≤ -log mu < 1 ≤ covercost`.\nDoes not establish: any retraction of original P15-B (\"whose local-budget premise is missing in\nthat case\"); the equality `coverco" + }, + { + "kind": "theorem", + "unqualified_name": "triangleNeedsThree", + "line": 748, + "source_header": "=> pStar)) := min_le_right _ _\n _ < 1 := by linarith\n _ ≤ coverCost (demandOneBlock cap) 1 (fun _ => (1 : ℝ)) := hcc\n\n/-! ## Realized covers Section 5: the triangle -/\n\n/-- Proves: `UniversalLaw.Spec.P15.TriangleNeedsThree` (register row `p15-realized-covers`).\nMethod: `K_H(d) = sInf` of the feasible set; three singletons are feasible at `K = 3`\n(`Nat.sInf_le`); sizes `0`, `1`, `2` are infeasible (`K = 0` by cardinality, `K = 1, 2` by\nkernel `decide` over the finitely many label-set assignments), so `le_csInf` gives `3 ≤ sInf`.\nDoes not establish: display (P9) (`ElementaryPaletteFormula`), the matroid palette formu" + }, + { + "kind": "theorem", + "unqualified_name": "muOf_capacityFamily_all", + "line": 774, + "source_header": "angle_not_feasible2 hK\n\n/-! ## Full price Sections 3 and 5: (F9) for every `a`, and the sharpness of `rho_star` -/\n\nnamespace Aux\n\n/-- (F9) as an identity for every `a` (no `a ≤ n` hypothesis): the extra terms `j > n` of the\ntail vanish since `Nat.c" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_block", + "line": 796, + "source_header": "ilter]\n refine Finset.sum_congr rfl (fun j _ => ?_)\n split_ifs with h\n · ring\n · rw [Nat.choose_eq_zero_of_lt (by omega)]; simp\n\n/-! ### The triple block: one block, `a = 1`, `d = 2`, ground set of size three," + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_isGood", + "line": 804, + "source_header": "ripleBlock_block (i : Fin 1) : block tripleBlock i = Finset.univ := by\n unfold block\n rw [Fin.fin_one_eq_zero i]\n simp [tripleBlock]" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_decomp", + "line": 810, + "source_header": "tripleBlock i).card ≤ 1) ∧\n (∀ e ∈ (∅ : Finset (Finset (Fin 1))), ¬ e ⊆ supp tripleBlock U) ↔ U.card ≤ 1\n simp [tripleBlock_block]\n\n/-- Two-decomposability is `|U| ≤ 2`: two good parts have at most two elements in all\n(`Finset.card_biUnion_le`), and a set of size `≤ 2" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_obstruction", + "line": 847, + "source_header": "mp only; split_ifs <;> simp\n · intro j j' hjj'\n fin_cases j <;> fin_cases j' <;> simp_all [hxy.symm]\n · ext v\n simp\n\n/-- At `K = 2` the sole" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_isRealized", + "line": 861, + "source_header": "intro h\n by_contra hne\n have := card_le_of_ne_univ 2 U hne\n omega\n · rintro rfl\n rw [Finset.card_univ, Fintype.card_fin]; omega\n\n/-- T" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_fullBlockFamily", + "line": 874, + "source_header": "Fin 1))), 2 ≤ e.card\n simp\n · change ∀ e ∈ (∅ : Finset (Finset (Fin 1))), ∀ f ∈ (∅ : Finset (Finset (Fin 1)))," + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_palette", + "line": 884, + "source_header": "Finset.mem_singleton]\n constructor\n · rintro ⟨i, rfl⟩\n exact tripleBlock_block i\n · rintro rfl\n exact ⟨(0 : Fin 1), tripleBlock_block 0⟩\n\n/-- `K_H(d) = 2` for one block of demand two and no edges" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_mu", + "line": 899, + "source_header": "K\n have h2le : 2 ≤ (P 0).card := hP 0\n have h0 : (P 0).card ≤ Fintype.card (Fin K) := Finset.card_le_univ _\n rw [Fintype.card_fin] at h0\n omega\n\n/-- `mu_p(D)` for the" + }, + { + "kind": "theorem", + "unqualified_name": "genPrice_one", + "line": 911, + "source_header": "r h)]\n simp [h]\n · rw [Set.indicator_of_notMem\n (show U ∉ downset tripleBlock from fun hm => h ((tripleBlock_isGood U).mp hm))]\n simp [h]\n\n/-- At" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_cover_ge_one", + "line": 915, + "source_header": "ator costs one (the empty generator included). -/\ntheorem genPrice_one (g : Finset (Fin 3)) : genPrice (fun _ => (1 : ℝ)) g = 1 := by\n simp [genPrice]\n\n/-- At unit prices every cover of `{X}` costs at lea" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_fullBlock_cover", + "line": 926, + "source_header": "g := (genPrice_one g).symm\n _ ≤ ∑ g ∈ G, genPrice (fun _ => (1 : ℝ)) g :=\n Finset.single_le_sum (fun g _ => by rw [genPrice_one]; norm_num) hg\n\n/-- The full" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_fullBlock_price", + "line": 934, + "source_header": ") := by\n intro U hU\n rw [tripleBlock_obstruction] at hU\n rw [tripleBlock_fullBlockFamily]\n exact ⟨Finset.univ, Finset.mem_singleton_self _, by rw [hU]⟩\n\n/-- The" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_coverCost", + "line": 940, + "source_header": "lock_fullBlock_price :\n famPrice (fun _ => (1 : ℝ)) (fullBlockFamily tripleBlock) = 1 := by\n rw [tripleBlock_fullBlockFamily]\n simp [famPrice, g" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_mu_pStar", + "line": 949, + "source_header": "⟨⟨fullBlockFamily tripleBlock, tripleBlock_fullBlock_cover,\n tripleBlock_fullBlock_price⟩, ?_⟩\n rintro t ⟨G, hG, rfl⟩\n exact tripleBlock_cover_ge_one G hG\n\n/-- `mu_{p_sta" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_hazard", + "line": 954, + "source_header": "_mu_pStar :\n mu tripleBlock (fun _ => pStar) = 3 * Real.exp (-2) - 2 * Real.exp (-3) := by\n rw [tripleBlock_mu, muOf_capacityFamily_all, binomTail_th" + }, + { + "kind": "theorem", + "unqualified_name": "tripleBlock_sharp", + "line": 959, + "source_header": "is `h_star`. -/\ntheorem tripleBlock_hazard : -Real.log (mu tripleBlock (fun _ => pStar)) = hStar := by\n rw [tripleBlock_mu_pStar]\n exact capacityWorstCase.2.2.1\n\n/-- Any `ρ < ρ_star = 1/h_star` makes the capped" + }, + { + "kind": "theorem", + "unqualified_name": "capacityHazardIsBinomial", + "line": 980, + "source_header": "↓reduceIte]\n rw [hlog]\n calc min 1 (ρ * hStar) ≤ ρ * hStar := min_le_right _ _\n _ < rhoStar * hStar := mul_lt_mul_of_pos_right hρ hh\n _ = 1 := hrho\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.P15.CapacityHazardIsBinomial` (claim `p15-full-price`, display (F9)).\nMethod: `hazardStar` unfolds to `-log (muOf (capacityFamily n a) p_star)`, and the mass of the\ncapacity family at a constant vector is `binomTail n a` for EVERY `a` (`Finset.sum_powerset_apply_card`\ngroups the subsets by cardinality; for `a > n` the extra terms `j > n` vanish since\n`Nat.choose n j = 0`), which extends `Aux.muOf_capacityFamily` beyond `a ≤ n`.\nDoes not establish: the informal claim's review or acceptance; the alignment of `capacityFamily` and\n`binomTail` with the source's `A = {S : |S| ≤ a}` and `P(Bin(n, p_star) ≤ a)`\n(PENDING_INDEPENDENT_REVI" + }, + { + "kind": "theorem", + "unqualified_name": "sharpnessOfRhoStar", + "line": 994, + "source_header": "(F2). -/\ntheorem capacityHazardIsBinomial : UniversalLaw.Spec.P15.CapacityHazardIsBinomial := by\n intro n a\n unfold hazardStar\n rw [Aux.muOf_capacityFamily_all n a]\n\n/-- Proves: `UniversalLaw.Spec.P15.SharpnessOfRhoStar` (claim `math.p15-full-price`, full-price note Section 5).\nMethod: for `tripleBlock` the single block is the ground set, good sets are those of size `≤ 1`, and a\nset is `2`-decomposable iff it has size `≤ 2` (two singletons/empties; `Finset.card_biUnion_le` for the\nconverse), so the obstruction at `K = 2` is `{X}`; `K_H(d) = 2` by `Nat.sInf_le`/`le_csInf`; at unit\nprices every generator costs `1`, every cover of `{X}` costs `≥ 1` (`Finset.single_le_sum`) and the\nfull-block cover `{X}` costs `1`, hence `coverCost = 1` (`IsLeast.csInf_eq`); `mu_p(D)` is the mass of\nthe capacity family `(3, 1)`, i.e. `binomTail 3 1 p_star = 3e^{-2} - 2e^{-3}`, whose `-log` is `h_star`\n(the identity proved in `capacityWorstCase`); for `ρ < ρ_star = 1/h_star`,\n`min 1 (ρ h_star) ≤ ρ h_star < 1`.\nDoes not establish: the informal sharpness claim's review or acceptance; the alignment of the Lean\n`tripleBlock`, `obstruction`, `coverCost` and `cappedHazard` with the source's objects\n(PENDING_INDEPENDENT_REVIEW); sharpness for any family other than the triple block; the budget (F2)\nitself; any necessity" + } + ] + }, + { + "path": "specifications/lean_statement_proofs_20261011/SpecificationProofs/Side24Covariance.lean", + "sha256": "08317c620ae7b85ce2d253f0a106a6cee0099566a09debeb703acbce4744ae30", + "declarations_lexical": [ + { + "kind": "theorem", + "unqualified_name": "cv_kinf_comp_neg", + "line": 78, + "source_header": "x\n\n/-! ## `cv_`: odd orders of `Kinf d` vanish at the origin -/\n\n/-- `Kinf d` is even: `Kinf d ∘ (-id) = Kinf d` (`norm_neg`). -/\ntheorem cv_kinf_comp_neg {d : ℕ} :\n (Kinf d ∘ (-ContinuousLinearMap.id ℝ (E d))) = K" + }, + { + "kind": "theorem", + "unqualified_name": "cv_iteratedFDeriv_odd", + "line": 86, + "source_header": "Kinf]\n\n/-- Every odd-order iterated derivative of `Kinf d` at `0` vanishes, in arbitrary directions:\n`ContinuousLinearMap.iteratedFDeriv_comp_right` with the evenness `cv_kinf_comp_neg` gives\n`D^n Kinf 0 [m] = (-1)^n D^n Kinf 0 [m]` (`ContinuousMultilinearMap.map_smul_univ`). -/\ntheorem cv_iteratedFDeriv_odd {d : ℕ} (n : ℕ) (hn : Odd n) (m : Fin n → E d) :\n iteratedFDeriv ℝ n (Kinf d)" + }, + { + "kind": "theorem", + "unqualified_name": "cv_odd_zero", + "line": 104, + "source_header": "inarith\n\n/-- A contraction of `Kinf d` at `0` against a list of odd length vanishes. -/\ntheorem cv_odd_zero {d : ℕ} (l : List (E d)) (hl : Odd l.length) :\n derivContraction d (Kinf d" + }, + { + "kind": "theorem", + "unqualified_name": "cv_GG", + "line": 109, + "source_header": "dd _ hl _\n\n/-! ## `cv_`: the entries of `Cref d u R` in a general frame -/\n\n/-- Gradient/gradient entry: `(-1)^1 · (-⟪R i, R j⟫) = ⟪R i, R j⟫`. -/\ntheorem cv_GG {d : ℕ} (u : E d) (R : Fin d → E d) (i j : Fin d) :\n Cref d u R (Sum.inl i) (Sum.inl j)" + }, + { + "kind": "theorem", + "unqualified_name": "cv_Gt", + "line": 116, + "source_header": "rb_order_two]\n\n/-- Gradient/`t` entry: `(-1)^3 · D^4 Kinf 0 [R i, u, u, u] = -3 ⟪u, u⟫ ⟪R i, u⟫`. -/\ntheorem cv_Gt {d : ℕ} (u : E d) (R : Fin d → E d) (i : Fin d) (t : Unit) :\n Cref d u R (Sum.inl i) (Sum.inr (Sum.inl t)) = -(3 * (⟪u," + }, + { + "kind": "theorem", + "unqualified_name": "cv_tG", + "line": 122, + "source_header": "er_four]\n ring\n\n/-- `t`/gradient entry: `(-1)^1 · D^4 Kinf 0 [u, u, u, R j] = -3 ⟪u, u⟫ ⟪u, R j⟫`. -/\ntheorem cv_tG {d : ℕ} (u : E d) (R : Fin d → E d) (j : Fin d) (t : Unit) :\n Cref d u R (Sum.inr (Sum.inl t)) (Sum.inl j) = -(3 * (⟪u" + }, + { + "kind": "theorem", + "unqualified_name": "cv_tt", + "line": 128, + "source_header": "rder_four]\n ring\n\n/-- `t`/`t` entry: `(-1)^3 · D^6 Kinf 0 [u, …, u] = 15 ⟪u, u⟫^3`. -/\ntheorem cv_tt {d : ℕ} (u : E d) (R : Fin d → E d) (t t' : Unit) :\n Cref d u R (Sum.inr (Sum.inl t)) (Sum.inr (Sum.inl t')) =\n 15 * (⟪u, u⟫" + }, + { + "kind": "theorem", + "unqualified_name": "cv_GH", + "line": 135, + "source_header": "b_order_six]\n ring\n\n/-- Gradient/Hessian entry: an order-three contraction, hence `0`. -/\ntheorem cv_GH {d : ℕ} (u : E d) (R : Fin d → E d) (i : Fin d) (q : SymIndex d) :\n Cref d u R (Sum.inl i) (Sum" + }, + { + "kind": "theorem", + "unqualified_name": "cv_HG", + "line": 141, + "source_header": "_ ⟨1, rfl⟩, mul_zero]\n\n/-- Hessian/gradient entry: an order-three contraction, hence `0`. -/\ntheorem cv_HG {d : ℕ} (u : E d) (R : Fin d → E d) (p : SymIndex d) (j : Fin d) :\n Cref d u R (Sum.inr (Sum." + }, + { + "kind": "theorem", + "unqualified_name": "cv_tH", + "line": 147, + "source_header": "o _ ⟨1, rfl⟩, mul_zero]\n\n/-- `t`/Hessian entry: an order-five contraction, hence `0`. -/\ntheorem cv_tH {d : ℕ} (u : E d) (R : Fin d → E d) (t : Unit) (q : SymIndex d) :\n Cref d u R (Sum.inr (Sum.inl t))" + }, + { + "kind": "theorem", + "unqualified_name": "cv_Ht", + "line": 153, + "source_header": "ero _ ⟨2, rfl⟩, mul_zero]\n\n/-- Hessian/`t` entry: an order-five contraction, hence `0`. -/\ntheorem cv_Ht {d : ℕ} (u : E d) (R : Fin d → E d) (p : SymIndex d) (t : Unit) :\n Cref d u R (Sum.inr (Sum.inr p)" + }, + { + "kind": "theorem", + "unqualified_name": "cv_HH", + "line": 159, + "source_header": "_zero _ ⟨2, rfl⟩, mul_zero]\n\n/-- Hessian/Hessian entry: `s_p s_q (-1)^2` times the three pairings of\n`D^4 Kinf 0 [R p₁, R p₂, R q₁, R q₂]`. -/\ntheorem cv_HH {d : ℕ} (u : E d) (R : Fin d → E d) (p q : SymIndex d) :\n Cref d u R (Sum.inr (Sum.inr p)) (Sum.inr (Sum.inr q)) =\n svecScale d (Sum.inr (Sum.inr p)) * svecScale d (Sum.inr (Sum.inr q)) *\n (⟪R q.1.1, R q.1.2⟫ * ⟪R p.1.1, R p.1.2⟫ + ⟪R p.1.2, R q.1.2⟫ * ⟪R p.1.1, R q.1.1⟫\n + ⟪R p.1.1, R" + }, + { + "kind": "theorem", + "unqualified_name": "cv_decomp", + "line": 170, + "source_header": "sis.Aux.rb_order_four]\n simp\n\n/-! ## `cv_`: the decomposition into positive semidefinite summands -/\n\n/-- In an orthonormal frame with `u = R 0`, `Cref - (1/3) I` is, entrywise, a nonnegative\ndiagonal matrix plus `(2/3) v vᵀ` with `v = e_{G_0} - (9/2) e_t` plus `w wᵀ` with `w` the\nindicator of the diagonal Hessian coordinates. -/\ntheorem cv_decomp {d : ℕ} (hd : 0 < d) (R : Fin d → E d) (hR : Orthonormal ℝ R) :\n Cref d (R ⟨0, hd⟩) R - (1 / 3 : ℝ) • (1 : Matrix (JointIndex d) (JointIndex d) ℝ) =\n Matrix.diagonal (Sum.elim (fun i : Fin d => if i = ⟨0, hd⟩ then (0 : ℝ) else 2 / 3)\n (Sum.elim (fun _ : Unit => (7 / 6 : ℝ)) (fun _ : SymIndex d => (5 / 3 : ℝ))))\n + (2 / 3 : ℝ) • Matrix.vecMulVec\n (Sum.elim (fun i : Fin d => if i = ⟨0, hd⟩ then (1 : ℝ) else 0)\n (Sum.elim (fun _ : Unit => (-9 / 2 : ℝ)) (fun _ : SymIndex d => (0 : ℝ))))\n (Sum.elim (fun i : Fin d => if i = ⟨0, hd⟩ then (1 : ℝ) else 0)\n (Sum.elim (fun _ : Unit => (-9 / 2 : ℝ)) (fun _ : SymIndex d => (0 : ℝ))))\n + Matrix.vecMulVec\n (Sum.elim (fun _ : Fin d => (0 : ℝ))\n (Sum.elim (fun _ : Unit => (0 : ℝ))\n (fun p : SymIndex d => if p.1.1 = p.1.2 then (1 : ℝ) else 0)))\n (Sum.elim (fun _ : Fin d => (0 : ℝ))\n (Sum.elim (fun _ : Unit => (0 : ℝ))\n (fun p : SymIndex d => if p.1" + }, + { + "kind": "theorem", + "unqualified_name": "cv_psd", + "line": 221, + "source_header": "iff] <;> first | omega | norm_num\n\n/-- `Cref - (1/3) I` is positive semidefinite in every orthonormal frame with `u = R 0`, for every\n`d > 0`: the three summands of `cv_decomp` are positive semidefinite. -/\ntheorem cv_psd {d : ℕ} (hd : 0 < d) (R : Fin d → E d) (hR : Orthonormal ℝ R) :\n (Cref d (R ⟨0, hd⟩) R -\n (1 / 3 : ℝ) • (1 : Matrix (JointInd" + }, + { + "kind": "theorem", + "unqualified_name": "referenceCovarianceLowerBound", + "line": 247, + "source_header": "1.2 then (1 : ℝ) else 0)))\n\nend Aux\n\n/-- Proves: `UniversalLaw.Spec.Side24.ReferenceCovarianceLowerBound` (claim\n`side24-coefficient`), for the formal `Cref` of `Specifications.Side24`.\nMethod: odd-order contractions of the even kernel `Kinf d` vanish at `0` (`Aux.cv_odd_zero`,\nvia `ContinuousLinearMap.iteratedFDeriv_comp_right` and `ContinuousMultilinearMap.map_smul_univ`);\nthe orders two, four and six are the round-4 helpers `Side24Analysis.Aux.rb_order_two`,\n`rb_order_four`, `rb_order_six`; in an orthonormal frame with `u = R 0`,\n`Cref - I/3 = diagonal (0, 2/3, …, 2/3; 7/6; 5/3, …, 5/3) + (2/3) v vᵀ + w wᵀ` entrywise\n(`Aux.cv_decomp`, `v = e_{G_0} - (9/2) e_t`, `w` the indicator of the diagonal Hessian\ncoordinates), and each summand is positive semidefinite (`Aux.cv_psd`, which holds for every\n`d > 0`; the hypothesis `d = 2 ∨ d = 3` of the `Prop` is not used by the proof).\nDoes not establish: the informal Section 3 display \"C_ref >= I/3\" of the source as the source's\nobject (the alignment of `E d`, `Kinf`, `derivContraction`, `jetDirs`, `svecScale`, `jointCov` and\n`Cref` with the source's `R^d`, `K_infty`, jet and joint covariance, and of Mathlib's\n`Matrix.PosSemidef` (which includes `IsHermitian`) with the source's `>=` order, is\nPENDING_INDEPENDENT_REVIEW); that `Cref` is the covariance of any random vector (no field is\nconstructed); symmetry of `Cref d u R` for general `u` or a general frame (only the `IsHermitian`\nhalf of the `Prop`'s `PosSemidef`, at `u = R 0` in an orthonormal frame with `0 < d`, is proved);\nthe statement module's own `Does not claim:` text (\"the bound (statement only); the odd-block\neigenvalues `8 ± sqrt 58` and the minors `2/3`, `7/9` are kernel-checked on main\n(`UniversalLaw.Side24.odd_block_eigenvalues`, `odd_block_shifted_minors`,\n`smaller_eigenvalue_exceeds_third`), not here\"), which describes the statement packet and is not\nedited here; main's `UniversalLaw.Side24.odd_block_eigenvalues`, `odd_block_shifted_minors` and\n`smaller_eigenvalue_exceeds_third` are neither imported, cited nor relied on (the certificate's\nentry arithmetic is discharged inline by `simp`/`norm_num` in `Aux.cv_decomp`), and no minor\n(in particular not `7/9`), no eigenvalue `8 ± sqrt 58` and no comparison of the smaller\neigenvalue with `1/3` is computed or stated here; anything about `C_24`, `CovarianceOrdering` or\n`EntrywiseCovarianceBound`; any enclosure of the coefficient `c_{d,24}`; the disposition of\n`side24-coefficient` (REVIEWED_SCOPED), which is transcribed in the register, not derived here;\nnonauthor review or acceptance of SIDE24-COEFFICIENT-D23-20260924-v1. It promotes, closes,\ndischarges or reclassifies nothing. -/\ntheorem referenceCovarianceLowerBound : UniversalLaw.Spec" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "MATH_GROUP:MATH:specifications/lean_statements_20261010", + "category": "current_math_source_group", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications.lean", + "sha256": "9a05b58eb94b0f24c9b8118b625ff003ca99ff2257734fe3d1f1d57ce3c9b976" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/P15.lean", + "sha256": "a30d9e6938b64d4e2728c5380d41b3a627cde42448df254069293e3839a41ca6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Field.lean", + "sha256": "f22c91e082cd7e738ba47c9c3534e47ac687d066f0b78586d15103cf1132535e" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/Side24.lean", + "sha256": "3164ccfd527d5d443c3830ae871e5592abc6658dc3678006da368fdace3818e3" + }, + { + "path": "cbz/evidence/website-foundation-20261029/sources/Math-/specifications/lean_statements_20261010/Specifications/RN.lean", + "sha256": "cad83a9d18029e66f2563f16a0850e846eb01dad0c3f08da6959ce0c186ae59c" + } + ], + "source_record_sha256": "df9346abab791d359a1c8e208e8cda6049b2a3c13f440930170b3d09a73baf86", + "exact_boundary": { + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "path_boundary": "specifications/lean_statements_20261010", + "source_files": [ + { + "path": "specifications/lean_statements_20261010/Specifications.lean", + "sha256": "9a05b58eb94b0f24c9b8118b625ff003ca99ff2257734fe3d1f1d57ce3c9b976", + "declarations_lexical": [] + }, + { + "path": "specifications/lean_statements_20261010/Specifications/P15.lean", + "sha256": "a30d9e6938b64d4e2728c5380d41b3a627cde42448df254069293e3839a41ca6", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "weight", + "line": 69, + "source_header": "5\n\n/-! ## Product measure, prices, the transformed price `phi` and the capped hazard -/\n\n/-- Independent-coordinate weight of a subset `U` of a finite ground type `Y` under the\nprobability vector `p`: `prod_{v in U} p_v * prod_{v notin U} (1 - p_v)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"Select the ORIGINAL coordinates independently with arbitrary probabilities p_v in [0,1], and let 0<=c_v<=p_v.\"\nInterface: none; `p` is any real vector (the sources take `p_v in [0,1]`, imposed as a hypothesis where used).\nDoes not claim: that these weights sum to one over all subsets (not stated separately). -/\nnoncomputable def weight {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) (U : Finset Y" + }, + { + "kind": "def", + "unqualified_name": "muOf", + "line": 81, + "source_header": "p v)\n\n/-- Product-measure mass `mu_p(A)` of a finite family `A` of subsets of a finite ground type:\nthe sum of the weights of its members.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"F_A(t)=-log mu_(p(t))(A),\"\nInterface: none.\nDoes not claim: anything; this is the probability that the random set of independently selected coordinates lies in `A`. -/\nnoncomputable def muOf {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))\n (p : Y →" + }, + { + "kind": "def", + "unqualified_name": "genPrice", + "line": 92, + "source_header": "ght p U\n\n/-- Price of a generator `g`: `product_(v in g) c_v`; the empty generator has price `1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"A generator's price is product_(v in g)c_v, and family price is the sum of generator prices.\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def genPrice {Y : Type} (c : Y → ℝ) (g : Fins" + }, + { + "kind": "def", + "unqualified_name": "famPrice", + "line": 101, + "source_header": "∈ g, c v\n\n/-- Price of a generator family `G`: the sum of its generator prices; the empty family has\nprice `0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"The empty generator has price1; the empty family has price0.\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def famPrice {Y : Type} (c : Y → ℝ) (G : Finset (Fin" + }, + { + "kind": "def", + "unqualified_name": "phi", + "line": 111, + "source_header": "enPrice c g\n\n/-- The transformed price ceiling `phi(t) = min(1, -log(1 - t))` with `phi(1) = 1`. The guard\n`t < 1` renders the source's convention at `t = 1` (Mathlib's `Real.log 0 = 0` would otherwise\ngive `0`); for `t > 1`, outside the source's domain, the value `1` is a placeholder.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"where phi(t)=min(1,-log(1-t)), phi(1)=1.\"\nInterface: none.\nDoes not claim: any value outside `[0, 1]`. -/\nnoncomputable def ph" + }, + { + "kind": "def", + "unqualified_name": "cappedHazard", + "line": 122, + "source_header": "- t)) else 1\n\n/-- The capped, scaled hazard `min(1, rho * [-log m])` of a probability `m`, with the sources'\nconvention that the hazard of a zero probability is `+infinity`, so that the cap `1` applies:\n`cappedHazard rho m = 1` when `m <= 0`. With `rho = 1` this is `min(1, -log mu_p(D))` of (P8);\nwith `rho = 16/27` the right side of (T1); with `rho = rho_star` the right side of (F2).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"If some q_i=1 the trivial price-one cover handles the endpoint.\"\nInterface: none.\nDoes not claim: anything; the branch at `m <= 0` is the sources' endpoint convention, not a result. -/\nnoncomputable def cappedHazar" + }, + { + "kind": "structure", + "unqualified_name": "RealizedData", + "line": 134, + "source_header": ".log m)) else 1\n\n/-! ## The realized capacity/clutter family -/\n\n/-- Data of a realized family on a finite ground type `X`: `b` blocks, the block map `blk`\n(the blocks `X_i` are its fibres, hence disjoint and covering), capacities `a_i`, demands `d_i`\nand the clutter `H` of forbidden block supports. The side conditions of the sources are the\nseparate `Prop` `IsRealizedFamily`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"Choose positive integers a_i,d_i and disjoint original-coordinate blocks X_i with\"\nInterface: none; every field is a finite datum, nothing is a hypothesis field.\nDoes not claim: that the data satisfy the sources' side conditions (that is `IsRealizedFamily`). -/\nstructure RealizedData (X : Type) where\n /-- The number of blocks. -/\n b : ℕ\n /-- The block of each original coordinate. -/\n blk : X → Fin b\n /-- The capacities `a_i`. -/\n a : Fin b → ℕ\n /-- The demands `d_i`. -/\n d : Fin b → ℕ\n /-- The clutter `H` of forbidden block supports. -/" + }, + { + "kind": "def", + "unqualified_name": "block", + "line": 157, + "source_header": "H : Finset (Finset (Fin b))\n\n/-- The original-coordinate block `X_i = {v : blk v = i}`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"disjoint original-coordinate blocks X_i\"\nInterface: none.\nDoes not claim: anything. -/\ndef block {X : Type} [Fintype X] (F : RealizedD" + }, + { + "kind": "def", + "unqualified_name": "IsRealizedFamily", + "line": 166, + "source_header": "v.filter (fun v => F.blk v = i)\n\n/-- The side conditions of the realized family: `a_i >= 1`, `d_i >= 1` (\"positive integers\na_i,d_i\"), `|X_i| = a_i d_i + 1`, every edge of `H` has size at least `2`, and `H` is a clutter\n(no edge properly contains another; edges are distinct as members of a `Finset`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" n_i=|X_i|=a_i d_i+1.\"\nInterface: none; this `Prop` IS the interface of the sources, stated for a data record.\nDoes not claim: that any particular data record satisfies it. -/\ndef IsRealizedFamily {X : Type} [Finty" + }, + { + "kind": "def", + "unqualified_name": "supp", + "line": 178, + "source_header": "∈ F.H, ∀ f ∈ F.H, e ⊆ f → e = f)\n\n/-- The block support `supp(U) = {i : U intersect X_i is nonempty}`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"supp(U)={i:U intersect X_i is nonempty}. (P1)\"\nInterface: none.\nDoes not claim: anything. -/\ndef supp {X : Type} (F : RealizedData X" + }, + { + "kind": "def", + "unqualified_name": "IsGood", + "line": 187, + "source_header": "Finset (Fin F.b) :=\n U.image F.blk\n\n/-- Membership in the downset `D` of display (P1): `|U intersect X_i| <= a_i` for every `i`, and\n`supp(U)` contains no edge of `H`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"D={U subset X: |U intersect X_i|<=a_i for every i,\"\nInterface: none.\nDoes not claim: that `D` is decreasing or contains the empty set (facts of the sources, not stated separately). -/\ndef IsGood {X : Type} [Fintype X] [DecidableEq X] (F :" + }, + { + "kind": "def", + "unqualified_name": "downset", + "line": 197, + "source_header": "≤ F.a i) ∧ ∀ e ∈ F.H, ¬ e ⊆ supp F U\n\n/-- The downset `D` as a set of subsets of `X`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" supp(U) contains no edge of H},\"\nInterface: none.\nDoes not claim: anything. -/\ndef downset {X : Type} [Fintype X] [DecidableEq X" + }, + { + "kind": "def", + "unqualified_name": "IsKDecomposable", + "line": 206, + "source_header": ": Set (Finset X) :=\n {U | IsGood F U}\n\n/-- `U in I_k(D)`: `U` is partitionable into at most `k` members of `D` (a family of `k`\npairwise disjoint good parts, possibly empty, with union `U`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"write I_k(D) for sets partitionable into at most k members of D\"\nInterface: none.\nDoes not claim: equivalence with coverings by at most `k` good sets (true for a decreasing family, not stated). -/\ndef IsKDecomposable {X : Type} [Fintype X] [DecidableEq X] (F : Realized" + }, + { + "kind": "def", + "unqualified_name": "obstruction", + "line": 219, + "source_header": ".univ : Finset (Fin k)).biUnion parts = U\n\n/-- The obstruction `O_K(D) = 2^X \\ I_K(D)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"O_k(D)=2^X\\I_k(D) for its obstruction\"\nInterface: none.\nDoes not claim: anything. -/\ndef obstruction {X : Type} [Fintype X] [DecidableEq X] (F : R" + }, + { + "kind": "def", + "unqualified_name": "IsGeneratorCover", + "line": 229, + "source_header": "inset X) :=\n {U | ¬ IsKDecomposable F K U}\n\n/-- `G` is a generator cover of `O_K(D)`: every obstructed set contains some `g in G`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"A generator cover G of O_k(D) means every obstructed set contains some g in G.\"\nInterface: none.\nDoes not claim: anything. -/\ndef IsGeneratorCover {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData" + }, + { + "kind": "def", + "unqualified_name": "coverCost", + "line": 239, + "source_header": "inset X, U ∈ obstruction F K → ∃ g ∈ G, g ⊆ U\n\n/-- The exact optimal cover price `covercost_c(O_K(D))`: the infimum of the family prices of all\ngenerator covers of `O_K(D)`. The set of covers is finite and nonempty (`{empty set}` always\ncovers), so the infimum is a minimum; that fact is not proved here.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"Therefore the EXACT optimal cover price is\"\nInterface: none.\nDoes not claim: that the infimum is attained (finite, not proved here); for `c` with negative entries, outside the sources' domain, `sInf` of an unbounded set is Mathlib's default. -/\nnoncomputable def coverCost {X : Type} [Fintype X] [DecidableEq X] (" + }, + { + "kind": "def", + "unqualified_name": "mu", + "line": 251, + "source_header": "X), IsGeneratorCover F K G ∧ famPrice c G = t}\n\n/-- The product measure `mu_p(D)` of the downset: the sum over `U in D` of\n`prod_{v in U} p_v prod_{v notin U} (1 - p_v)`, written as a sum over `2^X` of the indicator of\n`D` times the weight.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"For EVERY independent original probability vector p in [0,1]^X,\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def mu {X : Type} [Fintype X] [De" + }, + { + "kind": "def", + "unqualified_name": "localGood", + "line": 262, + "source_header": ".powerset, Set.indicator (downset F) (weight p) U\n\n/-- The actual local good probability `mu_p(D_i) = P(U intersect X_i in D)`, with\n`D_i = D intersect 2^(X_i)`: the sum over subsets `S` of the block of the indicator of `D` times\nthe block-restricted weight.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \"Write q_i=P(U intersect X_i notin D_i) for the ACTUAL capacity restriction.\"\nInterface: none.\nDoes not claim: the identification `D_i = {S subset X_i : |S| <= a_i}` (that is `LocalRestriction`). -/\nnoncomputable def localGood {X : Type} [Fintype X] [DecidableEq X] (F" + }, + { + "kind": "def", + "unqualified_name": "localFailure", + "line": 275, + "source_header": "(∏ v ∈ S, p v) * ∏ v ∈ block F i \\ S, (1 - p v)) S\n\n/-- The local failure probability `q_i = P(U_i notin D_i) = 1 - mu_p(D_i)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"With q_i=P(U_i notin D_i),\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def localFailure {X : Type} [Fintype X] [DecidableEq X] (" + }, + { + "kind": "def", + "unqualified_name": "IsPaletteFeasible", + "line": 285, + "source_header": "p : X → ℝ) (i : Fin F.b) : ℝ :=\n 1 - localGood F p i\n\n/-! ## Palette demand -/\n\n/-- `K` is a feasible palette size for the clutter `H` and demands `d`: there are label sets\n`P_i subset {0, ..., K-1}` with `|P_i| >= d_i` and empty intersection over every `H`-edge\n(no label lies in `P_i` for all `i in e`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" intersection_(i in e) P_i = empty, for every e in H. (P6)\"\nInterface: none.\nDoes not claim: upward closure in `K` (true, not stated). -/\ndef IsPaletteFeasible (b : ℕ) (H" + }, + { + "kind": "def", + "unqualified_name": "paletteNumber", + "line": 299, + "source_header": "(P i).card) ∧\n ∀ e ∈ H, ∀ ℓ : Fin K, ∃ i ∈ e, ℓ ∉ P i\n\n/-- The palette demand `K_H(d)`: the least feasible palette size, as `sInf` of the feasible set\n(Mathlib's `sInf` on `ℕ` is the least element of a nonempty set and `0` for the empty set). The\nsources define it as \"the minimum size K\"; nonemptiness of the feasible set is the separate\n`Prop` `PaletteNumberAttained`, not proved here.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"Let K_H(d) be the minimum size K of an integer palette universe admitting subsets P_i with |P_i|>=d_i and\"\nInterface: none.\nDoes not claim: that the feasible set is nonempty; the source's remark that one may take `|P_i| = d_i`. -/\nnoncomputable def paletteNumbe" + }, + { + "kind": "def", + "unqualified_name": "PaletteNumberAttained", + "line": 311, + "source_header": "in b → ℕ) : ℕ :=\n sInf {K : ℕ | IsPaletteFeasible b H d K}\n\n/-- The feasible set of palette sizes is nonempty, i.e. `K_H(d)` is itself feasible (the minimum\nis attained), for every realized family.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"By discarding excess labels within blocks, one may take |P_i|=d_i.\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the statement (not proved here; disjoint palettes of sizes `d_i` are a witness in the sources' argument). -/\ndef PaletteNumb" + }, + { + "kind": "def", + "unqualified_name": "fullBlockFamily", + "line": 321, + "source_header": "F → IsPaletteFeasible F.b F.H F.d (paletteNumber F.b F.H F.d)\n\n/-- The specified cover: the family `G = {X_1, ..., X_b}` of full blocks.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"the fixed family G={X_1,...,X_b} covers O_K(D) if and only if\"\nInterface: none.\nDoes not claim: anything. -/\ndef fullBlockFamily {X : Type} [Fintype" + }, + { + "kind": "def", + "unqualified_name": "IsMinimalForbidden", + "line": 331, + "source_header": "Finset X) :=\n (Finset.univ : Finset (Fin F.b)).image (block F)\n\n/-! ## Realized covers: Propositions P1, P2 and the local covers (P3)-(P5) -/\n\n/-- `U` is an inclusion-minimal forbidden set: not good, and every proper subset obtained by\nremoving one element is good.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"The inclusion-minimal forbidden ORIGINAL sets are exactly\"\nInterface: none.\nDoes not claim: anything. -/\ndef IsMinimalForbidden {X : Type} [Fintyp" + }, + { + "kind": "def", + "unqualified_name": "IsTransversal", + "line": 344, + "source_header": "Finset X) : Prop :=\n ¬ IsGood F U ∧ ∀ v ∈ U, IsGood F (U.erase v)\n\n/-- `U` is a transversal `{x_i : i in e}` of the edge `e`: its support is `e` and it meets each\nblock of `e` in exactly one coordinate.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"(b) for each e in H, EVERY transversal {x_i:i in e}, with x_i in X_i.\"\nInterface: none.\nDoes not claim: anything. -/\ndef IsTransversal {X : Type} [Fintype X] [DecidableEq X]" + }, + { + "kind": "def", + "unqualified_name": "MinimalForbiddenCharacterisation", + "line": 355, + "source_header": "inset X) : Prop :=\n supp F U = e ∧ ∀ i ∈ e, (U ∩ block F i).card = 1\n\n/-- Proposition P1: the inclusion-minimal forbidden sets are exactly (a) the `(a_i+1)`-subsets\nof a single block and (b) the transversals of the edges of `H`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"(a) every (a_i+1)-subset of a single X_i;\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the characterisation (statement only); its completeness clause is what the source calls \"completeness, not just existence of some witnesses\". -/\ndef MinimalForbiddenCharacterisation" + }, + { + "kind": "def", + "unqualified_name": "LocalRestriction", + "line": 367, + "source_header": ", U ⊆ block F i ∧ U.card = F.a i + 1) ∨ ∃ e ∈ F.H, IsTransversal F e U)\n\n/-- Display (P2): the actual local restriction is `D_i = D intersect 2^(X_i) = {S subset X_i :\n|S| <= a_i}`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"D_i=D intersect 2^(X_i)={S subset X_i: |S|<=a_i}. (P2)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the identity (statement only). -/\ndef LocalRestr" + }, + { + "kind": "def", + "unqualified_name": "LocalDecomposability", + "line": 378, + "source_header": "in F.b) (S : Finset X), S ⊆ block F i →\n (IsGood F S ↔ S.card ≤ F.a i)\n\n/-- Section 3: `I_k(D_i) = {S : |S| <= a_i k}` for subsets `S` of the block `X_i`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" I_k(D_i)={S:|S|<=a_i k}.\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the identity (statement only). -/\ndef LocalDecompo" + }, + { + "kind": "def", + "unqualified_name": "LocalObstructionIsFullBlock", + "line": 388, + "source_header": "Finset X), S ⊆ block F i →\n (IsKDecomposable F k S ↔ S.card ≤ F.a i * k)\n\n/-- Display (P3): for `k = d_i` the only obstructed subset of `X_i` is `X_i` itself, so\n`G_i = {X_i}` is an exact local obstruction cover.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" G_i={X_i} (P3)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the statement (statement only). -/\ndef LocalObstructionIsFul" + }, + { + "kind": "def", + "unqualified_name": "LocalPriceChain", + "line": 400, + "source_header": "inset X), S ⊆ block F i →\n (¬ IsKDecomposable F (F.d i) S ↔ S = block F i)\n\n/-- Display (P4): for `0 <= c_v <= p_v <= 1`, `price(G_i) = prod_{v in X_i} c_v <= prod p_v\n<= q_i <= phi(q_i)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" =P(U_i=X_i)<=q_i<=phi(q_i), (P4)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis; `p`, `c` with the displayed ranges.\nDoes not claim: the chain (statement only); the identity `prod p_v = P(U_i = X_i)` is the definition of the weight. -/\ndef Loc" + }, + { + "kind": "def", + "unqualified_name": "IndependentBlockHazard", + "line": 413, + "source_header": "p v ≤ localFailure F p i ∧\n localFailure F p i ≤ phi (localFailure F p i)\n\n/-- Display (P5) (also (T6)): `mu_p(D) <= prod_i (1 - q_i)` and, when `mu_p(D) > 0`,\n`sum_i q_i <= -log prod_i (1 - q_i) <= -log mu_p(D)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" <=-log(product_i(1-q_i))<=-log mu_p(D). (P5)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis; `p in [0,1]^X`.\nDoes not claim: the inequalities (statement only); independence of crossing events (\"Crossing events are not declared independent\"). -/\ndef Independ" + }, + { + "kind": "def", + "unqualified_name": "FullBlockCoverIff", + "line": 427, + "source_header": "e F p i)) ∧\n -Real.log (∏ i, (1 - localFailure F p i)) ≤ -Real.log (mu F p))\n\n/-! ## Realized covers: the full-block cover criterion (P7) and the hazard bound (P8) -/\n\n/-- Proposition P2, display (P7): the fixed family `G = {X_1, ..., X_b}` covers `O_K(D)` if and\nonly if `K >= K_H(d)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" K>=K_H(d). (P7)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis; `K_H(d)` is `paletteNumber`.\nDoes not claim: the criterion (statement only); optimality of any other cover (\"It does not prove that no different cover with the same budget works at fewer colors\"); unrestricted prize optimality; disposition transcribed from LANDING_CLAIMS for p15-realized-covers: HOLD_WITH_DOMAIN; nonauthor review and acceptance are not claimed here. -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "CoverCostHazardBound", + "line": 440, + "source_header": "∀ K : ℕ,\n IsGeneratorCover F K (fullBlockFamily F) ↔ paletteNumber F.b F.H F.d ≤ K\n\n/-- Display (P8): for `0 <= c_v <= p_v <= 1` and `K >= K_H(d)`,\n`covercost_c(O_K(D)) <= min(1, -log mu_p(D))`, with the endpoint convention of `cappedHazard`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"covercost_c(O_K(D)) <= min(1,-log mu_p(D)). (P8)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis; `p in [0,1]^X`; prices in the range `0 <= c_v <= p_v` only (\"No assertion is made here for the additional prices p_v p_v`; the unrestricted P15 prize; original P15-B; disposition transcribed from LANDING_CLAIMS for p15-realized-covers: HOLD_WITH_DOMAIN; nonauthor review and acceptance are not claimed here. -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "WholeGroundChromaticNumber", + "line": 451, + "source_header": "∀ K : ℕ, paletteNumber F.b F.H F.d ≤ K → coverCost F K c ≤ cappedHazard 1 (mu F p)\n\n/-- Section 4 comparison: the chromatic number of the ENTIRE ground set `X` (the least `K` with\n`X in I_K(D)`) is `K_H(d+1)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"the chromatic number of the ENTIRE ground set X is K_H(d+1), because ceil(n_i/a_i)=d_i+1.\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the statement (statement only). -/\ndef WholeGro" + }, + { + "kind": "def", + "unqualified_name": "completeClutter", + "line": 463, + "source_header": ": ℕ,\n IsKDecomposable F K Finset.univ ↔ paletteNumber F.b F.H (fun i => F.d i + 1) ≤ K\n\n/-! ## Realized covers Section 5: the elementary palette formula (P9) -/\n\n/-- The clutter of all `(s+1)`-subsets of `b` block indices.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"A fully elementary case is H consisting of all (s+1)-subsets of b indices, 1<=s<=b.\"\nInterface: none.\nDoes not claim: anything; for `s = b` the famil" + }, + { + "kind": "def", + "unqualified_name": "ElementaryPaletteFormula", + "line": 474, + "source_header": "(b s : ℕ) : Finset (Finset (Fin b)) :=\n (Finset.univ : Finset (Fin b)).powersetCard (s + 1)\n\n/-- Display (P9): for `H` all `(s+1)`-subsets of `b` indices, `1 <= s <= b`, and positive\ndemands, `K_H(d) = max(max_i d_i, ceil(sum_i d_i / s))`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" K_H(d)=max(max_i d_i, ceil(sum_i d_i/s)). (P9)\"\nInterface: none; the positivity of the demands is the sources' standing assumption (\"positive integers a_i,d_i\"), added as a hypothesis.\nDoes not claim: the formula (statement only); t" + }, + { + "kind": "def", + "unqualified_name": "TriangleNeedsThree", + "line": 486, + "source_header": "ber b (completeClutter b s) d =\n max (Finset.univ.sup d) ⌈((∑ i, d i : ℕ) : ℚ) / (s : ℚ)⌉₊\n\n/-- Section 5: the triangle on three block indices (all `2`-subsets) at unit demands needs `3`\ncolors.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"at unit demands needs3 colors, although a formula considering only size-two edge loads would give2.\"\nInterface: none.\nDoes not claim" + }, + { + "kind": "def", + "unqualified_name": "benchmark816", + "line": 496, + "source_header": "le). -/\ndef TriangleNeedsThree : Prop :=\n paletteNumber 3 (completeClutter 3 1) (fun _ => 1) = 3\n\n/-! ## Realized covers Section 6: the six-block 816-label realization -/\n\n/-- The six-block realization: ground type `Fin 6 × Fin 409` (six blocks of `409` coordinates,\n`2454` in all), block map the first projection, `a_i = 1`, `d_i = 408`, and `H` all `15`\nfour-block subsets.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"Take six blocks, a_i=1 and d_i=408. Thus EACH original block has409 vertices and the original ground set has2454 vertices. H consists of all15 four-block subsets.\"\nInterface: none; a concrete data record.\nDoes not claim: that it satisfies `IsRealizedFamily` (that is `Benchmark816IsRealized`); that any earlier six-block application had these coordinates (\"it is not a statement that every earlier six-block ap" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816IsRealized", + "line": 513, + "source_header": "09) where\n b := 6\n blk := Prod.fst\n a := fun _ => 1\n d := fun _ => 408\n H := completeClutter 6 3\n\n/-- The six-block data satisfy the side conditions of a realized family.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"Every D-color class contains at most one vertex per block and occupies at most three blocks.\"\nInterface: none.\nDoes not claim" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816Palette", + "line": 522, + "source_header": "in principle; not proved here). -/\ndef Benchmark816IsRealized : Prop :=\n IsRealizedFamily benchmark816\n\n/-- Section 6: `K_H(408, ..., 408) = 816` for `H` all four-block subsets of six.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" K_H(408,...,408)=816.\"\nInterface: none.\nDoes not claim: the value (statement only); the arithmetic" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816Cover", + "line": 531, + "source_header": "t here. -/\ndef Benchmark816Palette : Prop :=\n paletteNumber 6 (completeClutter 6 3) (fun _ => 408) = 816\n\n/-- Section 6: the six full blocks cover the obstruction at `816` colors and not at `815`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"At816 colors it covers the obstruction; at815 it does not, because omitting one vertex from each block leaves2448 vertices, each color holds at most3, and815*3<2448.\"\nInterface: none.\nDoes not claim: the statement (finite over `2^2454` subsets" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816WholeGround", + "line": 541, + "source_header": "816 (fullBlockFamily benchmark816) ∧\n ¬ IsGeneratorCover benchmark816 815 (fullBlockFamily benchmark816)\n\n/-- Section 6: the whole ground set needs `818` colors (`2454/3 = 818`): it is `818`-decomposable\nand not `817`-decomposable.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"The whole ground set, unlike the cover-avoiding sets, needs818 colors, since2454/3=818.\"\nInterface: none.\nDoes not claim: the st" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816MinimalForbiddenCounts", + "line": 551, + "source_header": "und : Prop :=\n IsKDecomposable benchmark816 818 Finset.univ ∧ ¬ IsKDecomposable benchmark816 817 Finset.univ\n\n/-- Display (P10): the minimal forbidden sets of the six-block realization are\n`6 * binom(409, 2)` internal pairs (support of size one) and `15 * 409^4` crossing transversal\nquadruples (support of size four), and nothing else.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" 15*409^4=419743994415 crossing transversal quadruples. (P10)\"\nInterface: none.\nDoes not claim: the counts (statement only); the evaluations `500616` and `419743994415` are core-Lean targets on main; the source stresses these are \"not a claim tha" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816Price", + "line": 567, + "source_header": "rd {U : Finset (Fin 6 × Fin 409) | IsMinimalForbidden benchmark816 U} =\n 6 * Nat.choose 409 2 + 15 * 409 ^ 4\n\n/-- Section 6: at `p_v = c_v = 1/40900` the cover price of the six full blocks is exactly\n`6/(40900^409) > 0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" 6/(40900^409)>0.\"\nInterface: none.\nDoes not claim:" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816UnionBound", + "line": 578, + "source_header": "Price (fun _ => (1 : ℝ) / 40900) (fullBlockFamily benchmark816) = 6 / 40900 ^ 409 ∧\n (0 : ℝ) < 6 / 40900 ^ 409\n\n/-- Display (P11): at `p_v = 1/40900`, `Q = 1 - mu_p(D) <= 500616/40900^2 + 15/100^4 =\n2449227/8180000000 < 3/10000`, and the good probability exceeds `0.9997`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" =2449227/8180000000 < 3/10000. (P11)\"\nInterface: none.\nDoes not claim: the bound (statement only; \"only a union bound, not an equality of the global" + }, + { + "kind": "def", + "unqualified_name": "twoCoord", + "line": 591, + "source_header": "0000 ∧\n (2449227 / 8180000000 : ℝ) < 3 / 10000 ∧\n (9997 / 10000 : ℝ) < mu benchmark816 (fun _ => (1 : ℝ) / 40900)\n\n/-! ## Price boundary: the exact two-coordinate refutation at demand one -/\n\n/-- The smallest one-block member: `X = {x, y}`, `a_1 = d_1 = 1`, no edges.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"The prescribed cover is {{x,y}" + }, + { + "kind": "def", + "unqualified_name": "twoCoordP", + "line": 606, + "source_header": "-/\ndef twoCoord : RealizedData (Fin 2) where\n b := 1\n blk := fun _ => 0\n a := fun _ => 1\n d := fun _ => 1\n H := ∅\n\n/-- The probabilities `p_x = p_y = 1/2` of the refutation.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"Take independent original probabilities p" + }, + { + "kind": "def", + "unqualified_name": "twoCoordC", + "line": 614, + "source_header": "ces c_x=c_y=2/3.\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def twoCoordP : Fin 2 → ℝ := fun _ => 1 / 2\n\n/-- The prices `c_x = c_y = 2/3` of the refutation.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"These are admissible TRANSFORMED prices: phi(1/2)=log 2>2/3.\"\nInterfa" + }, + { + "kind": "def", + "unqualified_name": "TwoCoordGeneratorPrices", + "line": 622, + "source_header": "claim: admissibility (that is part of `DemandOneRefutation`). -/\nnoncomputable def twoCoordC : Fin 2 → ℝ := fun _ => 2 / 3\n\n/-- The four generator costs `1, 2/3, 2/3, 4/9` of the empty set, the two singletons and `X`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"The possible generator costs are1,2/3,2/3,4/9 for the empty\"\nInterface: none.\nDoes not claim" + }, + { + "kind": "def", + "unqualified_name": "DemandOneRefutation", + "line": 632, + "source_header": "woCoordC ∅ = 1 ∧ genPrice twoCoordC {0} = 2 / 3 ∧ genPrice twoCoordC {1} = 2 / 3 ∧\n genPrice twoCoordC Finset.univ = 4 / 9\n\n/-- The exact refutation: the data are a realized family with `K_H(d) = 1` and one-piece\nobstruction `{X}`; the prices are admissible transformed prices (`phi(1/2) = log 2 > 2/3`);\n`mu_p(D) = 3/4`, `min(1, -log mu_p(D)) = log(4/3) < 1/3`; every cover costs at least `4/9`,\n`covercost_c(O_1(D)) = 4/9 > 1/3 > log(4/3)`; hence the capped hazard is strictly below the\nexact cover cost at the same palette.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \" covercost_c(O_1(D))=4/9 > 1/3 > log(4/3).\"\nInterface: none; everything is concrete.\nDoes not claim: the statement (statement only; the finite parts are decidable in principle, the two logarithm inequalities are analysis); that this contradicts original P15-B (\"It does not contradict the original P15-B amalgamation\"); anything about the `408`-scale or the unrestricted prize; the integral representation `log 2 = 2 integral_0^(1/3) 1/(1-t^2) dt` is not specified; disposition transcribed from LANDING_CLAIMS for p1" + }, + { + "kind": "def", + "unqualified_name": "LogOnePlusBelowIdentity", + "line": 654, + "source_header": "twoCoord 1 twoCoordC = 4 / 9 ∧ (1 / 3 : ℝ) < 4 / 9 ∧\n cappedHazard 1 (mu twoCoord twoCoordP) < coverCost twoCoord 1 twoCoordC\n\n/-- The elementary inequality `log(1 + x) < x` for `x > 0` used by the refutation.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"using log(1+x)0.\"\nInterface: none.\nD" + }, + { + "kind": "def", + "unqualified_name": "LogRatioBound", + "line": 663, + "source_header": "ly; the source proves it, this module does not). -/\ndef LogOnePlusBelowIdentity : Prop :=\n ∀ x : ℝ, 0 < x → Real.log (1 + x) < x\n\n/-! ## Price budget: the restricted transformed-price extension (T1)-(T5), (T7) -/\n\n/-- Display (T2): `-log(1 - p) <= p/(1 - p)` for `0 <= p < 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" -log(1-p)=integral_0^p dt/(1-t) <= p/(1-p). (T2)\"\nInterf" + }, + { + "kind": "def", + "unqualified_name": "RatioExponentBound", + "line": 674, + "source_header": "e integral representation is not specified. -/\ndef LogRatioBound : Prop :=\n ∀ p : ℝ, 0 ≤ p → p < 1 → -Real.log (1 - p) ≤ p / (1 - p)\n\n/-- The exponent arithmetic of display (T3): for `a >= 1` and `n >= 2a + 1`,\n`4^(a+1)/3^n <= (4/3)(4/9)^a <= 16/27`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" <= (4/3)*(4/9)^a <=16/27. (T3)\"\nInterface: none.\nDoes not claim: the inequalities (statement only); the preceding ratio steps of (T3) (price over `prod_{v in S} p_v`) are stated through their cons" + }, + { + "kind": "def", + "unqualified_name": "RestrictedLocalBudget", + "line": 685, + "source_header": "rop :=\n ∀ a n : ℕ, 1 ≤ a → 2 * a + 1 ≤ n →\n (4 : ℝ) ^ (a + 1) / 3 ^ n ≤ (4 / 3) * (4 / 9) ^ a ∧ (4 / 3 : ℝ) * (4 / 9) ^ a ≤ 16 / 27\n\n/-- Display (T4): under `a_i >= 1`, `d_i >= 2`, `0 <= p_v <= 1/4` and `0 <= c_v <= phi(p_v)`, the\nfull-block generator satisfies `price({X_i}) <= (16/27) q_i <= phi(q_i)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" price({X}) <= (16/27)q <= phi(q). (T4)\"\nInterface: the family data `F` with `IsRealizedFamily F` and `d_i >= 2` as hypotheses.\nDoes not claim: the bound (statement only); the source notes \"The extra demand hypothesis d>=2 is load-bearing\" and that `p_v <= 1/4` \"is a sufficient" + }, + { + "kind": "def", + "unqualified_name": "RestrictedTransformedPriceBudget", + "line": 698, + "source_header": "∀ i : Fin F.b, genPrice c (block F i) ≤ (16 / 27) * localFailure F p i ∧\n (16 / 27) * localFailure F p i ≤ phi (localFailure F p i)\n\n/-- The restricted transformed-price extension, display (T1): for every realized family with\n`a_i >= 1`, `d_i >= 2`, independent `0 <= p_v <= 1/4`, EVERY `0 <= c_v <= phi(p_v)` and the SAME\n`K >= K_H(d)`, `covercost_c(O_K(D)) <= min(1, (16/27)[-log mu_p(D)])`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" covercost_c(O_K(D)) <= min(1,(16/27)*[-log mu_p(D)]). (T1)\"\nInterface: the family data `F` with `IsRealizedFamily F` and `d_i >= 2` as hypotheses; `K_H(d)` is `paletteNumber`; the zero-probability endpoint follows the `cappedHazard` convention.\nDoes not claim: the bound (statement only); any retraction of the demand-one refutation; the unrestricted prize; new classical coloring theory; disposition transcribed from LANDING_CLAIMS for p15-price-budget-restricted: HOLD_WITH_DOMAIN; nonauthor review (\"nonauthor review open\") and acce" + }, + { + "kind": "def", + "unqualified_name": "rhoTest", + "line": 713, + "source_header": ") → (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →\n ∀ K : ℕ, paletteNumber F.b F.H F.d ≤ K →\n coverCost F K c ≤ cappedHazard (16 / 27) (mu F p)\n\n/-- The sufficient ratio `rho(a, d, p_*) = p_*^(ad - a) / (1 - p_*)^(ad + 1)` of display (T5).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" rho(a,d,p_*)=p_*^(ad-a)/(1-p_*)^(ad+1). (T5)\"\nInterface: none; natural-number" + }, + { + "kind": "def", + "unqualified_name": "RhoTestSufficient", + "line": 722, + "source_header": "1`.\nDoes not claim: anything. -/\nnoncomputable def rhoTest (a d : ℕ) (pBound : ℝ) : ℝ :=\n pBound ^ (a * d - a) / (1 - pBound) ^ (a * d + 1)\n\n/-- Display (T5) as a sufficient test, block by block: if a common upper bound `p_* < 1` has\n`0 <= p_v <= p_*` for every coordinate `v` of the block `X_i` and `rho(a_i, d_i, p_*) <= 1`, then\nfor all `0 <= c_v <= phi(p_v)` the full-block price is at most `q_i`. The source: \"This is only a\nsufficient test; rho>1 is not a counterexample and must not be labeled infeasible.\"\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \"If rho<=1 the same argument proves price({X})<=q for that block.\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis; the bound `p_*` is imposed only on the coordinates of the block under test (the source: \"for any common upper bound p_*<1\", \"for that block\"), the price bound `0 <= c_v <= phi(p_v)` on every coordinate as in (T1).\nDoes not claim: the statement (statement only); anything when `rho > 1` (the source: a bloc" + }, + { + "kind": "def", + "unqualified_name": "CapTestAtTwoThirds", + "line": 738, + "source_header": "n F.b, (∀ v ∈ block F i, 0 ≤ p v ∧ p v ≤ pBound) →\n rhoTest (F.a i) (F.d i) pBound ≤ 1 →\n genPrice c (block F i) ≤ localFailure F p i\n\n/-- Section 5 of the price budget: the cap test `q >= 2/3` gives `phi(q) = 1`, since `log 3 > 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \"or if q>=2/3 (then phi(q)=1, since log3>1)\"\nInterface: none.\nDoes not claim: the statement (statement" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816TransformedRange", + "line": 747, + "source_header": "e checker program of that section is not specified. -/\ndef CapTestAtTwoThirds : Prop :=\n 1 < Real.log 3 ∧ ∀ q : ℝ, 2 / 3 ≤ q → q ≤ 1 → phi q = 1\n\n/-- Section 4 of the price budget: for the six-block realization at `p_v = 1/40900`, the SAME\n`816`-label full-block cover is valid for the FULL transformed range\n`0 <= c_v <= log(40900/40899)` (which is `phi(1/40900)`): it covers `O_816(D)` and its price meets\nthe (T1) budget `min(1, (16/27)[-log mu_p(D)])`; consequently so does the optimal cover cost.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" 0<=c_v<=log(40900/40899),\"\nInterface: none; the specified cover is `fullBlockFamily benchmark816`; the last conjunct is the (T1) consequence for the infimum over all covers.\nDoes not claim: the stateme" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816RationalPrice", + "line": 765, + "source_header": "k816 (fun _ => (1 : ℝ) / 40900)) ∧\n coverCost benchmark816 816 c ≤\n cappedHazard (16 / 27) (mu benchmark816 (fun _ => (1 : ℝ) / 40900))\n\n/-- Display (T7) and the explicit rational price of Section 4: at maximal equal prices the union\nprice is `6 log(40900/40899)^409 <= 6/(40899^409)`; `c = p + p^2/2 = 81801/3345620000` for\n`p = 1/40900` is admissible (`c < phi(p)`) and its cover price is exactly `6 c^409`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" 6*log(40900/40899)^409 <=6/(40899^409). (T7)\"\nInterface: none.\nDoes not claim: the statements (statement only); the rational identity `1/40900 + (1/40900)^2/2 = 81801/3345620000` is exact arithmetic not re-p" + }, + { + "kind": "def", + "unqualified_name": "pStar", + "line": 780, + "source_header": "345620000 : ℝ) < phi (1 / 40900) ∧\n famPrice (fun _ => (81801 : ℝ) / 3345620000) (fullBlockFamily benchmark816) =\n 6 * (81801 / 3345620000) ^ 409\n\n/-! ## Full price: constants (F1), the result (F2) and the enclosure (F3) -/\n\n/-- `p_star = 1 - exp(-1)`, display (F1).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b" + }, + { + "kind": "def", + "unqualified_name": "hStar", + "line": 790, + "source_header": "bd6f5967b53c4178590da993f9\nAnchor: \" p_star=1-exp(-1),\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def pStar : ℝ := 1 - Real.exp (-1)\n\n/-- `h_star = 3 - log(3e - 2)`, display (F1); ASCII `3e-2` of the source means `3*e - 2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53" + }, + { + "kind": "def", + "unqualified_name": "rhoStar", + "line": 798, + "source_header": "-log(3e-2),\"\nInterface: none.\nDoes not claim: `h_star > 1` (that is `HStarExceedsOne`). -/\nnoncomputable def hStar : ℝ := 3 - Real.log (3 * Real.exp 1 - 2)\n\n/-- `rho_star = 1/h_star = 1/(3 - log(3e - 2))`, display (F1); written out so that it is\ndefinitionally `1 / hStar`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" rho_star=1/h_star. (F1)\"\nInterf" + }, + { + "kind": "def", + "unqualified_name": "rhoStarLower", + "line": 807, + "source_header": "3) or `rho_star < 6/7` (those are `RhoStarEnclosure`, `RhoStarBelowSixSevenths`). -/\nnoncomputable def rhoStar : ℝ := 1 / (3 - Real.log (3 * Real.exp 1 - 2))\n\n/-- Lower endpoint `0.84547981724898672067` of display (F3), as a rational over `10^20`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd032" + }, + { + "kind": "def", + "unqualified_name": "rhoStarUpper", + "line": 815, + "source_header": "hor: \" 0.84547981724898672067 < rho_star\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def rhoStarLower : ℝ := 84547981724898672067 / 10 ^ 20\n\n/-- Upper endpoint `0.84547981724898672068` of display (F3), as a rational over `10^20`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" < 0.84547981724898672068 < 6/7. (F3)\"\nInter" + }, + { + "kind": "def", + "unqualified_name": "FullTransformedPriceBudget", + "line": 823, + "source_header": "ng; adjacency of the endpoints and `upper * 7 < 6 * 10^20` are core-Lean targets on main. -/\nnoncomputable def rhoStarUpper : ℝ := 84547981724898672068 / 10 ^ 20\n\n/-- The headline result F, display (F2): for every realized family with `a_i >= 1`, `d_i >= 2`,\nEVERY independent `p in [0,1]^X`, every `0 <= c_v <= phi(p_v)` and the SAME `K >= K_H(d)`,\n`covercost_c(O_K(D)) <= min(1, rho_star [-log mu_p(D)])`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" covercost_c(O_K(D)) <= min(1,rho_star[-log mu_p(D)]). (F2)\"\nInterface: the family data `F` with `IsRealizedFamily F` and `d_i >= 2` as hypotheses; `K_H(d)` is `paletteNumber`; the zero-probability endpoints follow the `cappedHazard` convention (\"the price-one cap proves the assertion\").\nDoes not claim: the bound (statement only); optimality of `rho_star` (that is `SharpnessOfRhoStar`); any unrestricted downset or prize statement (the source: \"palette size remains K_H(d), which can depend on H and d\"); the nonauthor review recorded in LANDING_CL" + }, + { + "kind": "def", + "unqualified_name": "RhoStarEnclosure", + "line": 837, + "source_header": "X → ℝ), (∀ v, 0 ≤ p v ∧ p v ≤ 1) → (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →\n ∀ K : ℕ, paletteNumber F.b F.H F.d ≤ K → coverCost F K c ≤ cappedHazard rhoStar (mu F p)\n\n/-- Display (F3): `0.84547981724898672067 < rho_star < 0.84547981724898672068 < 6/7`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" 0.84547981724898672067 < rho_star\"\nInterface: none.\nDoes not claim: the enclosure (statement only; the source's `full_price.py` Fraction procedure is not a kernel proof and is not" + }, + { + "kind": "def", + "unqualified_name": "RhoStarBelowSixSevenths", + "line": 846, + "source_header": "L_VERIFICATION_ROLLOUT_20260927.md`, still at `specified`. -/\ndef RhoStarEnclosure : Prop :=\n rhoStarLower < rhoStar ∧ rhoStar < rhoStarUpper ∧ rhoStarUpper < 6 / 7\n\n/-- The simpler rational factor: `rho_star < 6/7`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"Thus 6/7 is a simpler valid" + }, + { + "kind": "def", + "unqualified_name": "IsProperDownset", + "line": 855, + "source_header": "terface: none.\nDoes not claim: the inequality (statement only); `16/27 < 6/7` is a core-Lean target on main. -/\ndef RhoStarBelowSixSevenths : Prop :=\n rhoStar < 6 / 7\n\n/-! ## Full price Section 2: the hazard interpolation bounds (F4)-(F8) -/\n\n/-- `A` is a proper decreasing family containing the empty set: `empty in A`, `X notin A`, and\n`A` is closed under taking subsets.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"Let A be any proper decreasing fa" + }, + { + "kind": "def", + "unqualified_name": "hazardCoord", + "line": 867, + "source_header": "oes not claim: anything. -/\ndef IsProperDownset {Y : Type} [Fintype Y] (A : Finset (Finset Y)) : Prop :=\n ∅ ∈ A ∧ Finset.univ ∉ A ∧ ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A\n\n/-- `F_A(t) = -log mu_(p(t))(A)` with `p_i(t) = 1 - exp(-t_i)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" p_i(t)=1-exp(-t_i)," + }, + { + "kind": "def", + "unqualified_name": "hazardStar", + "line": 877, + "source_header": "g. -/\nnoncomputable def hazardCoord {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))\n (t : Y → ℝ) : ℝ :=\n -Real.log (muOf A (fun i => 1 - Real.exp (-t i)))\n\n/-- `H_A = F_A(1, ..., 1) = -log mu_(p_star, ..., p_star)(A)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" H_A=F_A(1,...,1)>0.\"" + }, + { + "kind": "def", + "unqualified_name": "HazardStarPositive", + "line": 886, + "source_header": "ity (that is `HazardStarPositive`). -/\nnoncomputable def hazardStar {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y)) : ℝ :=\n -Real.log (muOf A (fun _ => pStar))\n\n/-- `H_A > 0` for every proper decreasing family on `n >= 1` coordinates containing the empty set.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"The probability is positive on this compact cube because the e" + }, + { + "kind": "def", + "unqualified_name": "CoordinatewiseConcavity", + "line": 895, + "source_header": "esis.\nDoes not claim: the statement (statement only). -/\ndef HazardStarPositive : Prop :=\n ∀ (n : ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A → 0 < hazardStar A\n\n/-- Display (F5) as separate coordinatewise concavity of `F_A` on `[0,1]` in each coordinate,\nthe other coordinates held fixed in `[0,1]`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"Only SEPARATE coordinatewise concavity is asserted; joint concavity is not needed or claimed.\"\nInterface: `A` with `IsProperDownset A` as hypothesis.\nDoes not claim: t" + }, + { + "kind": "def", + "unqualified_name": "HazardProductBound", + "line": 907, + "source_header": "≤ n → IsProperDownset A →\n ∀ (i : Fin n) (t : Fin n → ℝ), (∀ j, 0 ≤ t j ∧ t j ≤ 1) →\n ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) (fun s : ℝ => hazardCoord A (Function.update t i s))\n\n/-- Display (F6): `F_A(t) >= (prod_i t_i) H_A` on the cube `[0,1]^n`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" F_A(t) >= (pro" + }, + { + "kind": "def", + "unqualified_name": "HazardPhiBound", + "line": 917, + "source_header": "uctBound : Prop :=\n ∀ (n : ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A →\n ∀ t : Fin n → ℝ, (∀ j, 0 ≤ t j ∧ t j ≤ 1) → (∏ i, t i) * hazardStar A ≤ hazardCoord A t\n\n/-- Display (F7): for `p in [0,1]^n` with `mu_p(A) > 0`, `-log mu_p(A) >= H_A prod_i phi(p_i)`;\nwhen `mu_p(A) = 0` the source reads the inequality as an extended one and nothing is stated.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" -log mu_" + }, + { + "kind": "def", + "unqualified_name": "FullGroundPriceBound", + "line": 929, + "source_header": "ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A →\n ∀ p : Fin n → ℝ, (∀ j, 0 ≤ p j ∧ p j ≤ 1) → 0 < muOf A p →\n hazardStar A * ∏ i, phi (p i) ≤ -Real.log (muOf A p)\n\n/-- Display (F8): for transformed prices `0 <= c_i <= phi(p_i)`,\n`prod_i c_i <= min(1, [-log mu_p(A)]/H_A)`, with the `cappedHazard` endpoint convention.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" product_i c_i <= min(1, [-log mu_p(A)]/H_A). (F8)\"\nInterface: `A` with `IsProperDownset A` as hypothesis.\nDoes not claim: the inequality (st" + }, + { + "kind": "def", + "unqualified_name": "PhiAtPStar", + "line": 941, + "source_header": "(Fin n))), 1 ≤ n → IsProperDownset A →\n ∀ (p c : Fin n → ℝ), (∀ j, 0 ≤ p j ∧ p j ≤ 1) → (∀ j, 0 ≤ c j ∧ c j ≤ phi (p j)) →\n ∏ i, c i ≤ cappedHazard (1 / hazardStar A) (muOf A p)\n\n/-- `phi(p_star) = 1`: at the reference vector `p_i = p_star`, `c_i = 1`, the two sides of (F7)\nare equal.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f596" + }, + { + "kind": "def", + "unqualified_name": "FullGroundBudgetIff", + "line": 951, + "source_header": "Anchor: \"at every p_i=p_star and every c_i=1, the two sides of (F7) are equal\"\nInterface: none.\nDoes not claim: the identity (statement only). -/\ndef PhiAtPStar : Prop :=\n phi pStar = 1\n\n/-- Exactness of `1/H_A`: a full-ground generator universally meets the capped hazard budget\n(for all `p in [0,1]^n` and all transformed prices) precisely when `H_A >= 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"a full-ground generator universally meets the capped hazard budget precisely when H_A>=1\"\nInterface: `A` with `I" + }, + { + "kind": "def", + "unqualified_name": "capacityFamily", + "line": 963, + "source_header": "n))), 1 ≤ n → IsProperDownset A →\n ((∀ (p c : Fin n → ℝ), (∀ j, 0 ≤ p j ∧ p j ≤ 1) → (∀ j, 0 ≤ c j ∧ c j ≤ phi (p j)) →\n ∏ i, c i ≤ cappedHazard 1 (muOf A p)) ↔ 1 ≤ hazardStar A)\n\n/-! ## Full price Section 3: capacity families and the sharp worst case (F9)-(F11) -/\n\n/-- The capacity family `{S subset {0, ..., n-1} : |S| <= a}`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd" + }, + { + "kind": "def", + "unqualified_name": "binomTail", + "line": 974, + "source_header": "on n coordinates,\"\nInterface: none.\nDoes not claim: anything. -/\ndef capacityFamily (n a : ℕ) : Finset (Finset (Fin n)) :=\n (Finset.univ : Finset (Fin n)).powerset.filter (fun U => U.card ≤ a)\n\n/-- The binomial lower tail `P(Bin(n, p) <= a) = sum_{j <= a} C(n, j) p^j (1 - p)^(n - j)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326af" + }, + { + "kind": "def", + "unqualified_name": "CapacityHazardIsBinomial", + "line": 983, + "source_header": "(F9)\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def binomTail (n a : ℕ) (p : ℝ) : ℝ :=\n ∑ j ∈ Finset.range (a + 1), (Nat.choose n j : ℝ) * p ^ j * (1 - p) ^ (n - j)\n\n/-- Display (F9): `H_(n,a) = -log P(Bin(n, p_star) <= a)`, i.e. the product measure of the\ncapacity family at `p_star` is the binomial tail.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" H_(n,a)=-log" + }, + { + "kind": "def", + "unqualified_name": "OddMajorityIdentity", + "line": 993, + "source_header": "e identity (statement only; a finite identity for each `n`, general in `n`). -/\ndef CapacityHazardIsBinomial : Prop :=\n ∀ n a : ℕ, hazardStar (capacityFamily n a) = -Real.log (binomTail n a pStar)\n\n/-- Display (F10): for `S ~ Bin(2a+1, p)`,\n`P(Bin(2a+3, p) <= a+1) - P(S <= a) = (1-p)^2 P(S = a+1) - p^2 P(S = a) = p(1-2p) P(S = a)`, and\nthis is negative for `1/2 < p < 1` (the source writes `p > 1/2`; at `p = 1` the difference is\n`0`, so the strict inequality is stated for `p < 1`, which covers `p_star`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" =p(1-2p)P(S=a)<0. (F10)\"\nI" + }, + { + "kind": "def", + "unqualified_name": "CapacityWorstCase", + "line": 1011, + "source_header": "Tail (2 * a + 1) a p =\n p * (1 - 2 * p) * ((Nat.choose (2 * a + 1) a : ℝ) * p ^ a * (1 - p) ^ (a + 1)) ∧\n (1 / 2 < p → p < 1 → binomTail (2 * a + 3) (a + 1) p - binomTail (2 * a + 1) a p < 0)\n\n/-- Display (F11): for `a >= 1` and `n >= 2a + 1`, `H_(n,a) >= H_(3,1) = -log[3exp(-2) - 2exp(-3)]\n= 3 - log(3e - 2) = h_star > 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" =3-log(3e-2)=" + }, + { + "kind": "def", + "unqualified_name": "HStarExceedsOne", + "line": 1025, + "source_header": "1) ≤ hazardStar (capacityFamily n a)) ∧\n hazardStar (capacityFamily 3 1) = -Real.log (3 * Real.exp (-2) - 2 * Real.exp (-3)) ∧\n -Real.log (3 * Real.exp (-2) - 2 * Real.exp (-3)) = hStar ∧\n 1 < hStar\n\n/-- The last step of (F11): `e > 2`, `e^2 - (3e - 2) = (e - 1)(e - 2) > 0`, hence\n`3exp(-2) - 2exp(-3) < exp(-1)` and `h_star > 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha" + }, + { + "kind": "def", + "unqualified_name": "LocalPriceBoundFull", + "line": 1039, + "source_header": "l.exp 1 ∧\n Real.exp 1 ^ 2 - (3 * Real.exp 1 - 2) = (Real.exp 1 - 1) * (Real.exp 1 - 2) ∧\n 0 < (Real.exp 1 - 1) * (Real.exp 1 - 2) ∧\n 3 * Real.exp (-2) - 2 * Real.exp (-3) < Real.exp (-1) ∧\n 1 < hStar\n\n/-! ## Full price Sections 3-4: local price bound (F12) and global assembly (F13) -/\n\n/-- Display (F12): for each block with `d_i >= 2` and positive local good probability, under\n`0 <= c_v <= phi(p_v)`, `price({X_i}) <= rho_star [-log mu_p(D_i)]`, and the price is at most\none.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" price({X_i}) <= rho_star [-log mu_p(D_i)], (F12)\"\nInterface: the family data `F` with `IsRealizedFamily F` and `d_i >= 2` as hypotheses.\nDoes not claim: the bound (statement only);" + }, + { + "kind": "def", + "unqualified_name": "GlobalAssemblyHazard", + "line": 1056, + "source_header": "∀ v, 0 ≤ p v ∧ p v ≤ 1) → (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →\n ∀ i : Fin F.b, 0 < localGood F p i →\n genPrice c (block F i) ≤ rhoStar * (-Real.log (localGood F p i)) ∧\n genPrice c (block F i) ≤ 1\n\n/-- Display (F13): `mu_p(D) <= prod_i mu_p(D_i)` and, when `mu_p(D) > 0`,\n`sum_i [-log mu_p(D_i)] <= -log mu_p(D)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" sum_i [-log mu_p(D_i)] <= -log mu_p(D). (F13)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesi" + }, + { + "kind": "def", + "unqualified_name": "tripleBlock", + "line": 1068, + "source_header": "eEq X] (F : RealizedData X) : Prop :=\n IsRealizedFamily F → ∀ p : X → ℝ, (∀ v, 0 ≤ p v ∧ p v ≤ 1) →\n mu F p ≤ ∏ i, localGood F p i ∧\n (0 < mu F p → ∑ i, -Real.log (localGood F p i) ≤ -Real.log (mu F p))\n\n/-! ## Full price Section 5: sharpness and the exact demand boundary -/\n\n/-- One block with `a = 1`, `d = 2`, `n = 3`, no edges.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b5" + }, + { + "kind": "def", + "unqualified_name": "SharpnessOfRhoStar", + "line": 1083, + "source_header": "the full triple is not.\"\nInterface: none; a concrete data record.\nDoes not claim: anything. -/\ndef tripleBlock : RealizedData (Fin 3) where\n b := 1\n blk := fun _ => 0\n a := fun _ => 1\n d := fun _ => 2\n H := ∅\n\n/-- Sharpness of `rho_star` even among alternative covers: for the triple block at `K = 2`, the\nobstruction is exactly `{X}`; at `p_i = p_star`, `c_i = 1` (admissible since `phi(p_star) = 1`)\nevery generator has price one, every cover of the obstruction costs at least one and the\none-generator full-block cover `{X}` attains it (so the exact cover cost is one), the hazard is\n`h_star`, and replacing `rho_star` by any smaller constant makes the right side of (F2) strictly\nless than one.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"Replacing rho_star by any smaller constant in (F2) would make its right side strictly less than one.\"\nInterface: none; everything is concrete.\nDoes not claim: the statements (" + }, + { + "kind": "def", + "unqualified_name": "demandOneBlock", + "line": 1108, + "source_header": "BlockFamily tripleBlock) = 1 ∧\n coverCost tripleBlock 2 (fun _ => (1 : ℝ)) = 1 ∧\n -Real.log (mu tripleBlock (fun _ => pStar)) = hStar ∧\n ∀ ρ : ℝ, ρ < rhoStar → cappedHazard ρ (mu tripleBlock (fun _ => pStar)) < 1\n\n/-- One block with capacity `cap`, demand `1`, `n = cap + 1`, no edges.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"If d=1," + }, + { + "kind": "def", + "unqualified_name": "DemandOneBoundary", + "line": 1121, + "source_header": ": none; a concrete data record for each `cap`.\nDoes not claim: anything. -/\ndef demandOneBlock (cap : ℕ) : RealizedData (Fin (cap + 1)) where\n b := 1\n blk := fun _ => 0\n a := fun _ => cap\n d := fun _ => 1\n H := ∅\n\n/-- The exact demand boundary: for every `a >= 1`, in the demand-one block at `K = 1` the sole\nobstruction is the full block; at `p_i = p_star`, `c_i = 1` every cover costs at least one, but\n`mu_p(D) = 1 - p_star^(a+1) > 1 - p_star = exp(-1)`, so the hazard is less than one and no\nconstant `rho <= 1` makes the same-palette transformed-price guarantee hold.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" mu_p(D)=1-p_star^(a+1)>1-p_star=ex" + }, + { + "kind": "def", + "unqualified_name": "SixSeventhsCertificate", + "line": 1142, + "source_header": "ap + 1) ∧\n -Real.log (mu (demandOneBlock cap) (fun _ => pStar)) < 1 ∧\n ∀ ρ : ℝ, ρ ≤ 1 →\n cappedHazard ρ (mu (demandOneBlock cap) (fun _ => pStar)) <\n coverCost (demandOneBlock cap) 1 (fun _ => (1 : ℝ))\n\n/-! ## Full price Section 6: rational certificates for `rho_star < 6/7` -/\n\n/-- The short rational certificate chain of Section 6: `e < 31967/11760 < 87/32`,\n`87/32 - 31967/11760 = 11/23520`, `sum_{j=0}^5 (11/6)^j/j! - 197/32 = 26081/933120 > 0`,\nhence `3e - 2 < 197/32 < exp(11/6)`, `h_star > 7/6` and `rho_star < 6/7`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"Therefore 3e-2<197/327/6 and rho_star<6/7.\"\nInterface: none.\nDoes not claim: th" + } + ] + }, + { + "path": "specifications/lean_statements_20261010/Specifications/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 65, + "source_header": "y\n\n/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this\nnamespace). The duplication is deliberate: modules of this packet import only Mathlib. -/\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 77, + "source_header": "in d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 86, + "source_header": "i : ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 97, + "source_header": "^ 2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 109, + "source_header": "taSum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : F" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 120, + "source_header": "L (x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g :" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 129, + "source_header": "ec d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 138, + "source_header": "ℕ, ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 180, + "source_header": "y ∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 190, + "source_header": ": ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoi" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 199, + "source_header": "ℝ) (x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 215, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNon" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 225, + "source_header": "iticalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsInd" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 235, + "source_header": "alPoint d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 244, + "source_header": ": ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnon" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 253, + "source_header": "nS (d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence modul" + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 283, + "source_header": "tGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsC" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 302, + "source_header": "NondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the sourc" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 315, + "source_header": "IsCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNond" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 351, + "source_header": "gMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 363, + "source_header": "p :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pai" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 374, + "source_header": "ndDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d :" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 385, + "source_header": "E d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gau" + }, + { + "kind": "def", + "unqualified_name": "IsWindowPair", + "line": 407, + "source_header": "A ∧\n ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)\n\n/-! ### Populations of pairs -/\n\n/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with\n`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none beyond the shared predicates.\nDoes not claim: anything about the off-diagonal (far) population separately (Section" + }, + { + "kind": "structure", + "unqualified_name": "PairLawInterface", + "line": 442, + "source_header": ": ℝ) (g : E d → ℝ) (M S : E d) : Prop :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S\n\n/-! ### The typed pair law as an interface -/\n\n/-- Interface for the weighted regression (typed pair) law: the only object consumed by the\nstatements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death\npartner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the\nlaw `Q^W = (W_r/Z_r) Q_{r,b,k,R}` with `W_r = |det H_M det H_S| 1{H_M<0, index(H_S)=d-1}`.\nThat law, its weight, its normalizer and the regression construction are informal in the\nsource and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark\n`k` and orthonormal frame `R` with values in `[0, 1]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S.\"\nInterface: `p` is given; its only hypothesis fields are the bounds `0 ≤ p ≤ 1`. The parameters `G` and `I` record which field and which elder relation the law refers to; no field ties `p` to them.\nDoes not claim: existence of the regression law, the typed weight, the full normalizer `Z_r > 0`, or that `p` is the probability of any event under any measure declared here; that `p` depends on `G` or `I` in any way (no field mentions them; they only record which field and elder relation the law is meant to refer to). -/\nstructure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)\n (I : SuperlevelBarInterface d L) where\n /-- Section 1 clause: \"Let p_r(b,k,R) be the Q^W probability that the global ordinary\n superlevel elder death partner of M is S.\" -/\n p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R\n /-- `p` is a proba" + }, + { + "kind": "def", + "unqualified_name": "ParentUniformSelectionA", + "line": 466, + "source_header": "ility: at most one. -/\n p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1\n\n/-! ### The parent statements (1.1), (1.2), (1.3) -/\n\n/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`\nand `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)\nsuch that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all\northonormal frames `R`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There exist r_*>0 and C 0` and\nwindows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a\nconstant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and\nelder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,\n`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),\"\nInterface: `G` and `I` are given; \"versions\" are any `νc`, `νe` satisfying `IsLifetimeDensityVersion` (integral identity), not a Kac-Rice representation; the coefficient `c_{B,K}` is existential, not the Gaussian integral (11.3).\nDoes not claim: the parent result or its proof; the exact coefficient formula (11.3); existence of the versions; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef ParentCompactWindowDensityB (d :" + }, + { + "kind": "def", + "unqualified_name": "IsUnrestrictedLeadingCoefficient", + "line": 510, + "source_header": "r : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.\nThe essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the\nconclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,\nnot by the integral (13.6)/(15.2).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There is a positive finite constant c_{d,L} such that\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the explicit Gaussian/angular representation (15.2) of `c_{d,L}`; uniqueness of `c` (which follows from the asymptotics but is not stated); existence of versions. -/\ndef IsUnrestrictedLeadingC" + }, + { + "kind": "def", + "unqualified_name": "ParentUnrestrictedLeadingDensityC", + "line": 531, + "source_header": "∧\n Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe\n (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the\nunrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth\nheights, all positive gap marks, all separations; essential global maximum excluded) admit\nversions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the parent result or its proof (dominated convergence of Section 13, off-diagonal bound (14.1)); the representation (15.2); the compact-window `O(ell^(2/3))` difference for the unrestricted densities; any numerical enclosure of `c_{d,L}` (the SIDE24 coefficient track is separate); nonauthor review or acceptance. -/\ndef ParentUnrestr" + }, + { + "kind": "def", + "unqualified_name": "RemainderBoundedR1", + "line": 545, + "source_header": "(I : SuperlevelBarInterface d L) : Prop :=\n 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c\n\n/-! ### The bounded remainder (R1) -/\n\n/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed\n`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here\nby `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of\nthe unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,\n`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.\nThe `O(1)` remainder is stated with an explicit absolute-value bound.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a\nAnchor: \"|nu_cand(ell)-c ell^(-1/3)| <= C,\"\nInterface: `G` and `I` are given; `c` is any real satisfying the parent leading-coefficient property (the source says the coefficient \"is exactly the parent's equation (15.2)\"; that integral is not transcribed, so `c` is pinned through (1.3) instead); versions are characterised by the integral identity only. The statement does not mention the typed pair law: Theorem R does not consume (1.1).\nDoes not claim: the result or its proof (quadratic determinant cancellation (R7), coupling (R4), cap-loss bound (R12)); convergence of the remainder; a second coefficient; numerical `C` or `ell_*`; the compact-window `O(ell^(2/3))` difference without cutoffs; the parent interfaces it imports (D1-A-E); nonauthor review or acceptance. If no `c` satisfies the parent property the statement holds vacuously; that is a transcription of its dependency on (1.3), not a claim. -" + }, + { + "kind": "def", + "unqualified_name": "PlanarElderLowerE2", + "line": 569, + "source_header": "c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧\n |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C\n\n/-! ### Planar elder lower bound and density gap (d = 2) -/\n\n/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with\nbirth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging\nover `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all\n`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \"1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff\n`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the\ncompact-window candidate and ordinary elder densities satisfy\n`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper\ninput is an explicit hypothesis, not folded into the conclusion. The lower half, which the\nsource derives from (E2) alone, is stated under the same hypothesis because the source displays\n(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower\nhalf, recorded here as such.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \" <= C_{B,K} ell^(2/3). (E11)\"\nInterface: `G`, `I` and `PL` are given; the hypothesis `ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi` is the consumed parent upper input (a statement shape, not the parent result); versions are characterised by the integral identity only; the weighted Kac-Rice / radial ledger of [LP, Sections 9-11] that the source consumes is not transcribed. The interface does not determine `p` or the field: the Prop is a predicate on the interface objects, not a closed statement about the source's objects; nothing is asserted about its universal closure over all inhabitants, and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the result or its proof; the upper half independently of the parent (1.1); the parent (1.1) itself; the lower half without the hypothesis (the source has it from (E2) alone); sharpness of the `O(1)` remainder of (R1); removal of the compact-mark restriction; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef PlanarDensityGapE11 (L : ℝ) (G :" + } + ] + }, + { + "path": "specifications/lean_statements_20261010/Specifications/Field.lean", + "sha256": "f22c91e082cd7e738ba47c9c3534e47ac687d066f0b78586d15103cf1132535e", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 40, + "source_header": "y\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) : T" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 49, + "source_header": "d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 58, + "source_header": ": ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 69, + "source_header": "2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 81, + "source_header": "Sum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 92, + "source_header": "(x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g : E" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 101, + "source_header": "d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g :" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 110, + "source_header": "ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 152, + "source_header": "∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian (d" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 162, + "source_header": "ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoint" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 171, + "source_header": "(x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d :" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 187, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNonde" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 197, + "source_header": "icalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsIndex" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 207, + "source_header": "Point d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnoncomp" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 216, + "source_header": "ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 225, + "source_header": "(d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module." + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 255, + "source_header": "ap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsCan" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 274, + "source_header": "ndegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the source)" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 287, + "source_header": "sCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNondeg" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 323, + "source_header": "ax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d :" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 335, + "source_header": ":=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pair" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 346, + "source_header": "Domain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d : ℕ" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 357, + "source_header": "d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gauss" + } + ] + }, + { + "path": "specifications/lean_statements_20261010/Specifications/Side24.lean", + "sha256": "3164ccfd527d5d443c3830ae871e5592abc6658dc3678006da368fdace3818e3", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 52, + "source_header": "y\n\n/-- The ambient Euclidean space `R^d` of the field; `d ∈ {2, 3}` in the source.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Use its centered variance-one field with the exact normalized covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: anything about the field or the torus `R^d/(24 Z^d)`. -/\nabbrev E (d : ℕ) : T" + }, + { + "kind": "def", + "unqualified_name": "coneMomentD1", + "line": 60, + "source_header": "d)\n\n/-! ## Exact constants of the note -/\n\n/-- The cone moment `D_1 = 4/3` of the reference law for `m = d - 1 = 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"D_1=E[A^2 1{A<0}]=4/3.\"\nInterface: none; a rational constant.\nDoes not claim: the identity with the Gaussian expectation (that is `ConeMomentD1Identity`); the arithmetic `(1/2)(8/3) = 4/3` is kernel-checked on main (`UniversalLaw.Side24.cone_moment_m1_thirds`), not here. -/\nnoncomputable def coneMomen" + }, + { + "kind": "def", + "unqualified_name": "coneMomentD2", + "line": 70, + "source_header": "= 4 / 3\n\n/-- The cone moment `D_2 = 29/6 - sqrt 6` of the reference law for `m = d - 1 = 2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \" = 29/6-sqrt(6).\"\nInterface: none; an explicit real constant.\nDoes not claim: the identity with the Gaussian cone expectation (that is `ConeMomentD2Identity` and `ConeMomentD2Algebra`); the rational part `29/6` and `4 sqrt(3/8) = sqrt 6` are kernel-checked on main (`UniversalLaw.Side24.cone_moment_m2_algebra`), not here. -/\nnoncomputable def coneMom" + }, + { + "kind": "def", + "unqualified_name": "coneMomentRef", + "line": 78, + "source_header": "al.sqrt 6\n\n/-- The reference cone moment `D_m` as a function of `m = d - 1`: `D_1` for `m = 1`, `D_2` for\n`m = 2`, and `0` (unspecified by the source) otherwise.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"c_d,ref = Gamma(7/6)*(3/2)^(1/3)*D_(d-1)\"\nInterface: none.\nDoes not claim: any value outside `m ∈ {1, 2}`; the value `0` there is a placeholder, not a cone moment. -/\nnoncomputable def coneMomentRef" + }, + { + "kind": "def", + "unqualified_name": "cRef", + "line": 88, + "source_header": "ntD2 else 0\n\n/-- The nonperiodic reference coefficient of display (1):\n`c_{d,ref} = Gamma(7/6) (3/2)^(1/3) D_{d-1} / [2 sqrt 3 pi^(d-1) sqrt pi]`, `d = 2, 3`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"/ [2sqrt(3)*pi^(d-1)*sqrt(pi)], d=2,3.\"\nInterface: none; `Real.Gamma`, `Real.sqrt`, `Real.pi` and real powers are Mathlib's.\nDoes not claim: that this equals the periodic coefficient (the source says it is NOT claimed equal); any value for `d ∉ {2, 3}`; the derivation from the parent formula (that is `ReferenceCoefficientIdentity`); any numerical value of `Gamma(7/6)`. -/\nnoncomputable def cRe" + }, + { + "kind": "def", + "unqualified_name": "imageConstE", + "line": 99, + "source_header": "sqrt Real.pi)\n\n/-- The image constant `E = 21175738586478 * 10^(-125)` of display (2), as a rational over a\npower of ten.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"= 21175738586478 *10^(-125).\"\nInterface: none.\nDoes not claim: the factorisation `1458*(76*24^6+15) = 21175738586478`, kernel-checked on main (`UniversalLaw.Side24.image_constant_value`), not here. -/\nnoncomputable def" + }, + { + "kind": "def", + "unqualified_name": "epsilon", + "line": 108, + "source_header": "6478 / 10 ^ 125\n\n/-- The relative covariance allowance `epsilon = 10^(-108)` of display (3).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"epsilon=10^(-108), since60E 6` (the source restricts to `q ≤ 6`); nothing here encloses the coef" + }, + { + "kind": "def", + "unqualified_name": "DerivativeBoundAtLeastOne", + "line": 234, + "source_header": "Real.exp (-(‖x‖ ^ 2) / 2) * pairingSum q ‖x‖\n\n/-- Section 2: at `|x| ≥ 1` every unit-direction contraction of order `q ≤ 6` of\n`phi(x) = exp(-|x|^2/2)` is bounded by `76 |x|^6 exp(-|x|^2/2)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"At |x|>=1 this is at most76 |x|^6 e^(-|x|^2/2).\"\nInterface: none.\nDoes not claim: the bound (statement only); the coefficient arithmetic `1+15+45+15=76` and `76` bounding the smaller orders are kernel-checked on main (`UniversalLaw.Side24.pairing_sum_six`, `pairing_sum_le_six`), not here; nothing here encloses the coeff" + }, + { + "kind": "def", + "unqualified_name": "DerivativeBoundAtZero", + "line": 245, + "source_header": "x u| ≤ 76 * ‖x‖ ^ 6 * Real.exp (-(‖x‖ ^ 2) / 2)\n\n/-- Section 2: at zero every unit-direction contraction of order `q ≤ 6` of `phi` has absolute\nvalue at most `15`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"contraction has absolute value at most15.\"\nInterface: none.\nDoes not claim: the bound (statement only); `5!! = 15` is kernel-checked on main (`UniversalLaw.Side24.sixth_moment_double_factorial" + }, + { + "kind": "def", + "unqualified_name": "intNormSq", + "line": 256, + "source_header": "q u →\n |iteratedFDeriv ℝ q (Kinf d) 0 u| ≤ 15\n\n/-- The squared Euclidean length `|n|^2 = sum_i n_i^2` of an integer point.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"sum_{n!=0} |n|^6 e^(-288|n|^2)\"\nInterface: none.\nDoes not claim: anything. -/\nnonc" + }, + { + "kind": "def", + "unqualified_name": "imageTerm", + "line": 265, + "source_header": ") (n : Fin d → ℤ) : ℝ :=\n ∑ i, ((n i : ℤ) : ℝ) ^ 2\n\n/-- The lattice-image term `|n|^6 exp(-288 |n|^2)` for `n ≠ 0`, and `0` at `n = 0`\n(`288 = 24^2/2`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"sum_{n!=0} |n|^6 e^(-288|n|^2)\"\nInterface: none.\nDoes not claim: `24^2/2 = 288`, kernel-checked on main (`UniversalLaw.Side24.period_exponent`), not here. -/\nno" + }, + { + "kind": "def", + "unqualified_name": "LatticeImageSumBound", + "line": 275, + "source_header": "e intNormSq d n ^ 3 * Real.exp (-288 * intNormSq d n)\n\n/-- Section 2 lattice bound: for `d ≤ 3`, the image family is summable and\n`sum_{n ≠ 0} |n|^6 exp(-288|n|^2) ≤ 1458 exp(-288)`. Summability is stated so the `tsum` is\nnot the vacuous `0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"<=1458 e^(-288).\"\nInterface: none.\nDoes not claim: the bound (statement only); the intermediate `729 sum_j j^9 e^(-288 j^2)` shell count is not specified; `27*27 = 729`, `729*2 = 1458` are kernel-checked on main (`UniversalLaw.Side24.lattice_shell_c" + }, + { + "kind": "def", + "unqualified_name": "SuccessiveTermRatio", + "line": 288, + "source_header": "n : Fin d → ℤ, imageTerm d n) ≤ 1458 * Real.exp (-288)\n\n/-- Section 2: successive terms `j^9 exp(-288 j^2)`, `j ≥ 1`, have ratio at most\n`512 exp(-864)`, and that constant is below `1/2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"successive terms have ratio at most512e^(-864)<1/2.\"\nInterface: none.\nDoes not claim: the bounds (statement only); `2^9 = 512`, `288*3 = 864` are kernel-checked on main (`UniversalLaw.Side24.geometric_ratio" + }, + { + "kind": "def", + "unqualified_name": "ExponentialBounds", + "line": 301, + "source_header": "(-288 * (j : ℝ) ^ 2))) ∧\n 512 * Real.exp (-864) < 1 / 2\n\n/-- Section 2 exponential facts: `exp(288/125) > 10`, hence `exp(-288) < 10^(-125)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"hence e^(-288)<10^(-125) and the geometric-ratio inequality follows too.\"\nInterface: none; `Real.exp` is Mathlib's.\nDoes not claim: the inequalities (statement only); the rational Taylor sum through degree 20 exceeding `10` is kernel-checked on main (the `UniversalLaw.Side24` Taylor-sum target i" + }, + { + "kind": "def", + "unqualified_name": "ImageBound", + "line": 310, + "source_header": "10 < Real.exp (288 / 125) ∧ Real.exp (-288) < 1 / 10 ^ 125\n\n/-- Display (2): for `d ∈ {2, 3}`, every unit-direction contraction through total order `6`,\nmixed directions included, satisfies `|D^q K_24(0) - D^q K_infty(0)| < E`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"|D^q K_24(0)-D^q K_infty(0)|\"\nInterface: summability of the theta family is the premise `ThetaSummable d`; derivatives are Mathlib's `iteratedFDeriv ℝ q`.\nDoes not claim: the bound (statement only); differentiability of `K_24` (if `K_24` is not `C^q` the derivative is `0` in Lean); nothing here encloses the coeffici" + }, + { + "kind": "abbrev", + "unqualified_name": "SymIndex", + "line": 322, + "source_header": "(K24 d) 0 u - iteratedFDeriv ℝ q (Kinf d) 0 u| < imageConstE\n\n/-! ## Section 3: the joint covariance of `(G, t, svec H)` in a frame -/\n\n/-- Index set of the `svec` coordinates: ordered pairs `(i, j)` with `i ≤ j`, of cardinality\n`d(d+1)/2` (`3` for `d = 2`, `6` for `d = 3`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and\"\nInterface:" + }, + { + "kind": "abbrev", + "unqualified_name": "JointIndex", + "line": 333, + "source_header": "bbrev SymIndex (d : ℕ) : Type := {p : Fin d × Fin d // p.1 ≤ p.2}\n\n/-- Index set of the joint vector `(G, t, svec H)`: `d` gradient coordinates, one third\nderivative `t`, and `d(d+1)/2` `svec` coordinates; dimension `6` for `d = 2` and `10` for `d = 3`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"sqrt(2) times independent off-diagonal entries. Its dimension is at most10.\"\nInterface: none.\nDoes not claim: the dimension count `6`, `10`, kernel-checked on main (`UniversalLaw.Side24.pin_determinant_a" + }, + { + "kind": "def", + "unqualified_name": "jetDirs", + "line": 342, + "source_header": "e. -/\nabbrev JointIndex (d : ℕ) : Type := Fin d ⊕ Unit ⊕ SymIndex d\n\n/-- The list of differentiation directions attached to a joint coordinate, in the orthonormal\nframe `R` with `u = R 0`: `G_i = ∂_{R i} f`, `t = ∂_u^3 f`, `H_{ij} = ∂_{R i} ∂_{R j} f`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and\"\nInterface: none.\nDoes not claim: anything. -/\ndef jetDirs (d : ℕ) (u : E d) (R : Fin d → E d) : JointIndex d → List (E d)\n | Sum.inl i => [R i]\n | Sum.inr" + }, + { + "kind": "def", + "unqualified_name": "svecScale", + "line": 354, + "source_header": "Sum.inl _) => [u, u, u]\n | Sum.inr (Sum.inr p) => [R p.1.1, R p.1.2]\n\n/-- The `svec` scaling: `1` on gradient, `t` and diagonal Hessian coordinates, `sqrt 2` on\noff-diagonal Hessian coordinates.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"sqrt(2) times independent off-diagonal entries. Its dimension is at most10.\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def svecScale (d : ℕ) : JointIndex d → ℝ\n | Su" + }, + { + "kind": "def", + "unqualified_name": "derivContraction", + "line": 365, + "source_header": ".inr (Sum.inr p) => if p.1.1 = p.1.2 then 1 else Real.sqrt 2\n | _ => 1\n\n/-- The derivative of `K` at `x` contracted against a list of directions:\n`D^{|l|} K(x)[l_1, …, l_{|l|}]`, through Mathlib's `iteratedFDeriv`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Each covariance entry differs from the reference by at most2E, by (2).\"\nInterface: none.\nDoes not claim: differentiability of `K` (if absent the derivative is `0` in Lean). -/\nnoncomputable" + }, + { + "kind": "def", + "unqualified_name": "jointCov", + "line": 375, + "source_header": "l : List (E d)) : ℝ :=\n iteratedFDeriv ℝ l.length K x (fun i => l.get i)\n\n/-- The joint covariance matrix of `(G, t, svec H)` at a point of a centred stationary field\nwith covariance `K`, in the frame `R` with `u = R 0`, through the stationary rule\n`Cov(∂^α f, ∂^β f) = (-1)^{|β|} ∂^{α+β} K(0)`, with the `svec` scaling. With `K = K_infty`\nthis is `C_ref`; with `K = K_24` it is `C_24`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Each covariance entry differs from the reference by at most2E, by (2).\"\nInterface: none; the covariance is DEFINED by the derivative rule, no field is constructed.\nDoes not claim: that this matrix is the covariance of any random vector (no field is constructed here); symmetry or positive semidefiniteness of the matrix. -/\nnoncomputable def jointCov (d : ℕ) (K : E d →" + }, + { + "kind": "def", + "unqualified_name": "gradCov", + "line": 390, + "source_header": ".length *\n derivContraction d K 0 (jetDirs d u R a ++ jetDirs d u R b)\n\n/-- The gradient covariance block `Cov(G_i, G_j) = -∂_{R i} ∂_{R j} K(0)` in the frame `R`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"covariance differentiation gives\"\nInterface: none.\nDoes not claim: that it equals the identity for `K_infty` (that is `ReferenceOddAndPinBlocks`). -/\nnoncomputable d" + }, + { + "kind": "def", + "unqualified_name": "pinCov", + "line": 399, + "source_header": "in d) (Fin d) ℝ :=\n Matrix.of fun i j => - derivContraction d K 0 [R i, R j]\n\n/-- The pin covariance block of `V = H u`, coordinates `V_i = ∂_u ∂_{R i} f`:\n`Cov(V_i, V_j) = ∂_u ∂_{R i} ∂_u ∂_{R j} K(0)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Thus V=Hu has covariance diag(3,1,...,1), tau^2=Var(t|G=0)=6, and\"\nInterface: none.\nDoes not claim: that it equals `diag(3,1,...,1)` for `K_infty` (that is `ReferenceOddAndPinBlocks`). -/\nnoncomputable def pinCov (" + }, + { + "kind": "def", + "unqualified_name": "thirdGradCov", + "line": 410, + "source_header": "d) (Fin d) ℝ :=\n Matrix.of fun i j => derivContraction d K 0 [u, R i, u, R j]\n\n/-- The covariance vector `Cov(t, G_j) = -∂_u^3 ∂_{R j} K(0)` of `t = ∂_u^3 f` with the gradient.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Var(t)=15, Cov(t,G)=(-3,0,...,0),\"\nInterface: none.\nDoes not claim: its reference value `(-3, 0, …, 0)` (that is `ReferenceOddAndPinBlocks`). -/\nnoncomputab" + }, + { + "kind": "def", + "unqualified_name": "thirdVar", + "line": 419, + "source_header": ": Fin d → E d) : Fin d → ℝ :=\n fun j => - derivContraction d K 0 [u, u, u, R j]\n\n/-- The variance `Var(t) = -∂_u^6 K(0)` of `t = ∂_u^3 f`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Var(t)=15, Cov(t,G)=(-3,0,...,0),\"\nInterface: none.\nDoes not claim: its reference value `15` (that is `ReferenceO" + }, + { + "kind": "def", + "unqualified_name": "condThirdVariance", + "line": 428, + "source_header": "d : ℕ) (K : E d → ℝ) (u : E d) : ℝ :=\n - derivContraction d K 0 [u, u, u, u, u, u]\n\n/-- The conditional variance `tau^2 = Var(t | G = 0)` as the Schur complement\n`Var(t) - Cov(t,G) Cov(G)^(-1) Cov(G,t)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"tau^2=Var(t|G=0)=6\"\nInterface: none; the Gaussian conditional variance is written as the Schur complement (a standard identity, used here as the definition).\nDoes not claim: invertibility of `Cov(G)` (Mathlib's matrix inverse is `0` on a singular matrix); the value `6` (that is `ReferenceOddAndPinBlocks`). -/\nnonc" + }, + { + "kind": "def", + "unqualified_name": "Cref", + "line": 439, + "source_header": "oduct (thirdGradCov d K u R) (Matrix.mulVec (gradCov d K R)⁻¹ (thirdGradCov d K u R))\n\n/-- The reference joint covariance `C_ref` (kernel `K_infty`) in the frame `R`, `u = R 0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"(1-epsilon) C_ref <= C_24 <= (1+epsilon) C_ref,\"\nInterface: none.\nDoes not claim: its displayed block values (`ReferenceOddAndPinBlocks`), or that it is frame independent. -/\nnoncomputable de" + }, + { + "kind": "def", + "unqualified_name": "C24", + "line": 449, + "source_header": "Fin d → E d) :\n Matrix (JointIndex d) (JointIndex d) ℝ :=\n jointCov d (Kinf d) u R\n\n/-- The exact periodic joint covariance `C_24` (kernel `K_24`) in the frame `R`, `u = R 0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"(1-epsilon) C_ref <= C_24 <= (1+epsilon) C_ref,\"\nInterface: summability of the theta family is a premise wherever this matrix is used.\nDoes not claim: rotational invariance (the source asserts none for `C_24`). -/\nnoncomputable" + }, + { + "kind": "def", + "unqualified_name": "CovarianceOrdering", + "line": 459, + "source_header": "R : Fin d → E d) :\n Matrix (JointIndex d) (JointIndex d) ℝ :=\n jointCov d (K24 d) u R\n\n/-- Display (3): for `d ∈ {2, 3}`, in every orthonormal frame `R` (with `u = R 0`),\n`(1-epsilon) C_ref ≤ C_24 ≤ (1+epsilon) C_ref` in the positive-semidefinite order.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"The inequalities are in the positive-semidefinite ordering and hold in every\"\nInterface: summability of the theta family is the premise `ThetaSummable d`; the matrices are defined by the derivative rule of `jointCov`.\nDoes not claim: the ordering (statement only); the passage to marginal and conditional covariances (not specified); `60E < epsilon` is kernel-checked on main (`UniversalLaw.Side24.covariance_relative_bound`), not here; nothing here" + }, + { + "kind": "def", + "unqualified_name": "EntrywiseCovarianceBound", + "line": 472, + "source_header": ".PosSemidef ∧\n ((1 + epsilon) • Cref d (R ⟨0, hd⟩) R - C24 d (R ⟨0, hd⟩) R).PosSemidef\n\n/-- Section 3: each entry of `C_24` differs from the corresponding entry of `C_ref` by at most\n`2E`, in every orthonormal frame.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Each covariance entry differs from the reference by at most2E, by (2).\"\nInterface: summability of the theta family is the premise `ThetaSummable d`.\nDoes not claim: the bound (statement only); the spectral-norm bound" + }, + { + "kind": "def", + "unqualified_name": "ReferenceCovarianceLowerBound", + "line": 485, + "source_header": "JointIndex d,\n |C24 d (R ⟨0, hd⟩) R a b - Cref d (R ⟨0, hd⟩) R a b| ≤ 2 * imageConstE\n\n/-- Section 3: `C_ref ≥ I/3` in the positive-semidefinite order, in every orthonormal frame.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Thus C_ref >= I/3 and\"\nInterface: none.\nDoes not claim: the bound (statement only); the odd-block eigenvalues `8 ± sqrt 58` and the minors `2/3`, `7/9` are kernel-checked on main (`UniversalLaw.Side24.odd_block_eigenvalues`, `odd_block_shifted_mino" + }, + { + "kind": "def", + "unqualified_name": "ReferenceOddAndPinBlocks", + "line": 495, + "source_header": "(Cref d (R ⟨0, hd⟩) R - (1 / 3 : ℝ) • (1 : Matrix (JointIndex d) (JointIndex d) ℝ)).PosSemidef\n\n/-- Section 1 reference blocks, in every orthonormal frame with `u = R 0`: `Cov(G) = I_d`,\n`Var(t) = 15`, `Cov(t, G) = (-3, 0, …, 0)`, `Cov(V) = diag(3, 1, …, 1)` and `tau^2 = 6`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Var(t)=15, Cov(t,G)=(-3,0,...,0),\"\nInterface: none; the blocks are the derivative-rule matrices of `K_infty`.\nDoes not claim: the identities (statement only); `15 - 9 = 6` is kernel-checked on main (`UniversalLaw" + }, + { + "kind": "def", + "unqualified_name": "gaussDensity", + "line": 510, + "source_header": "onal (fun i => if i = ⟨0, hd⟩ then 3 else 1) ∧\n condThirdVariance d (Kinf d) (R ⟨0, hd⟩) R = 6\n\n/-! ## Section 4: Gaussian density comparison -/\n\n/-- The centred Gaussian density on `R^n` with covariance `C`:\n`(2 pi)^(-n/2) det(C)^(-1/2) exp(-x^T C^(-1) x / 2)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Comparing Gaussian determinants\"\nInterface: none.\nDoes not claim: that this is a probability density when `C` is singular (the matrix inverse is then `0` i" + }, + { + "kind": "def", + "unqualified_name": "symCoordDim", + "line": 523, + "source_header": "^ (-(n : ℝ) / 2) * C.det ^ (-(1 : ℝ) / 2) *\n Real.exp (-(dotProduct x (Matrix.mulVec C⁻¹ x)) / 2)\n\n/-- The number `n = m(m+1)/2` of independent symmetric-matrix coordinates.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Let C be a centered covariance in n=m(m+1)/2" + }, + { + "kind": "def", + "unqualified_name": "DensityComparison", + "line": 531, + "source_header": "ic-matrix\"\nInterface: none.\nDoes not claim: anything. -/\ndef symCoordDim (m : ℕ) : ℕ := m * (m + 1) / 2\n\n/-- Section 4 density comparison: if `(1-epsilon) C0 ≤ C ≤ (1+epsilon) C0` in the\npositive-semidefinite order, with `C0` positive definite, then pointwise\n`[(1-epsilon)/(1+epsilon)]^(n/2) phi_{(1-epsilon)C0} ≤ phi_C ≤ [(1+epsilon)/(1-epsilon)]^(n/2) phi_{(1+epsilon)C0}`,\n`n = m(m+1)/2`, `epsilon = 10^(-108)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"[(1-epsilon)/(1+epsilon)]^(n/2) phi_((1-epsilon)C0)\"\nInterface: none; `C.PosDef` is stated as a premise although it follows from `C0.PosDef` and the ordering.\nDoes not claim: the comparison (statement only); the cone-moment consequence `(1 ± epsilon)^m D0` and the scaling `a^m` of `h(A) = det(A)^2 1{A<0}` (not specified" + }, + { + "kind": "def", + "unqualified_name": "exponentA", + "line": 552, + "source_header": "1 - epsilon)) ^ ((symCoordDim m : ℝ) / 2) *\n gaussDensity (symCoordDim m) ((1 + epsilon) • C0) x\n\n/-- The exponent `a = m + 2/3 + n/2` of Section 4, with `m = d - 1`, `n = m(m+1)/2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"a=m+2/3+n/2, b=d+n/2.\"\nInterface: none.\nDoes not claim: the values `13/6`, `25/6`, kernel-ch" + }, + { + "kind": "def", + "unqualified_name": "exponentB", + "line": 561, + "source_header": ". -/\nnoncomputable def exponentA (d : ℕ) : ℝ :=\n ((d - 1 : ℕ) : ℝ) + 2 / 3 + (symCoordDim (d - 1) : ℝ) / 2\n\n/-- The exponent `b = d + n/2` of Section 4, with `n = (d-1)d/2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"a=m+2/3+n/2, b=d+n/2.\"\nInterface: none.\nDoes not claim: the inequalities `a+2b<14`, `2a+b<13`, kernel-" + }, + { + "kind": "def", + "unqualified_name": "IntegrandRatioBounds", + "line": 570, + "source_header": "t_bounds`), not here. -/\nnoncomputable def exponentB (d : ℕ) : ℝ :=\n (d : ℝ) + (symCoordDim (d - 1) : ℝ) / 2\n\n/-- Section 4 ratio bounds: for `d ∈ {2, 3}`,\n`1 - 13 epsilon ≤ (1-epsilon)^a / (1+epsilon)^b` and `(1+epsilon)^a / (1-epsilon)^b ≤ 1 + 28 epsilon`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"ratio between1-13epsilon and\"\nInterface: none.\nDoes not claim: the bounds (statement only); that the integrand ratio of the source equals these power quotients (not specified); `13 ≤ 32`, `28 ≤ 32` and `32*10^(-108) < 10^(-106)` are kernel-checked on main (`UniversalLaw.Side" + }, + { + "kind": "def", + "unqualified_name": "ReferencePinDensityProduct", + "line": 582, + "source_header": "(1 + epsilon) ^ exponentB d ∧\n (1 + epsilon) ^ exponentA d / (1 - epsilon) ^ exponentB d ≤ 1 + 28 * epsilon\n\n/-! ## Section 1: reference densities and the reference coefficient identity -/\n\n/-- Section 1: in every orthonormal frame with `u = R 0`, the reference gradient and pin\ndensities at zero satisfy `p_G(0) p_V(0) = (2 pi)^(-d) / sqrt 3`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3).\"\nInterface: none; the densities are `gaussDensity` of the derivative-rule blocks of `K_infty`.\nDoes not claim: the identity (statement only); `det diag(3,1,…,1) = 3` is kernel-checked on m" + }, + { + "kind": "def", + "unqualified_name": "sphereArea", + "line": 597, + "source_header": "R) 0 *\n gaussDensity d (pinCov d (Kinf d) (R ⟨0, hd⟩) R) 0 =\n (2 * Real.pi) ^ (-(d : ℝ)) / Real.sqrt 3\n\n/-- Ordinary sphere area `|S^(d-1)|`: `2 pi` for `d = 2`, `4 pi` for `d = 3`, `0` otherwise.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Substituting these moments and |S^1|=2pi, |S^2|=4pi into the exact parent coef" + }, + { + "kind": "def", + "unqualified_name": "ReferenceCoefficientIdentity", + "line": 606, + "source_header": "3}`. -/\nnoncomputable def sphereArea (d : ℕ) : ℝ :=\n if d = 2 then 2 * Real.pi else if d = 3 then 4 * Real.pi else 0\n\n/-- Display (1) as an identity: the parent prefactor `Gamma(7/6) / [24^(1/3) sqrt pi]` times\n`p_G(0) p_V(0) = (2 pi)^(-d) / sqrt 3`, times `tau^(4/3)` with `tau = sqrt 6`, times `D_{d-1}`,\ntimes `|S^(d-1)|`, equals `c_{d,ref}` (using `6^(2/3)/24^(1/3) = (3/2)^(1/3)`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"This eliminates BOTH the angular and cone integrals for the reference expression.\"\nInterface: none.\nDoes not claim: the identity (statement only); that the left side is the parent formula (15.2) evaluated at the reference law (the angular integrand is constant by rotational invariance of `K_infty`, a fact not specified here); `6^2*2 = 3*24` is kernel-checked on main (`UniversalLaw." + }, + { + "kind": "structure", + "unqualified_name": "ConeMomentInterface", + "line": 621, + "source_header": "(-(d : ℝ)) / Real.sqrt 3) * (Real.sqrt 6) ^ ((4 : ℝ) / 3) *\n coneMomentRef (d - 1) * sphereArea d =\n cRef d\n\n/-! ## Section 1: the cone moments as Gaussian expectations -/\n\n/-- Interface for the Gaussian variables of the reference cone moments. GIVEN: a probability\nspace; the `m = 1` transverse entry `A` with law `N(0, 8/3)`; the `m = 2` coordinates\n`s, x, y` (shared trace shift and traceless part) jointly independent with laws `N(0, 5/3)`,\n`N(0, 1)`, `N(0, 1)`, stated as a product law. Existence of such variables is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Var(s)=5/3 and Var(x)=Var(y)=1. The negative-definite cone is s<-R,\"\nInterface: every field is a given property; the laws are `ProbabilityTheory.gaussianReal` with the displayed variances.\nDoes not claim: that these laws are the conditional law `A | V = 0` of the reference field (the source derives them; here they are hypotheses); the derivation of `Var(s) = 5/3` from the `(2/3) delta delta + …` formula (kernel-checked arithmetic on main, `UniversalLaw.Side24.trace_and_traceless_variances`). -/\nstructure ConeMomentInterface where\n /-- The sample space. -/\n Ω : Type\n /-- Its sigma-algebra. -/\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure. -/\n P : Measure Ω\n /-- `P` is a probability measure. -/\n [isProb : IsProbabilityMeasure P]\n /-- Section 1 clause \"For m=1 the variance of A is8/3.\": the scalar transverse Hessian. -/\n A : Ω → ℝ\n /-- Law of `A`: centred Gaussian of variance `8/3`. -/\n A_law : Measure.map A P = ProbabilityTheory.gaussianReal 0 (8 / 3)\n /-- Section 1 clause \"write A=[[s+x,y],[y,s-x]]\": the shared scalar shift `s`. -/\n s : Ω → ℝ\n /-- The traceless coordinate `x`. -/\n x : Ω → ℝ\n /-- The traceless coordinate `y`. -/\n y : Ω → ℝ\n /-- Section 1 clause \"s,x,y are independent, Var(s)=5/3 and Var(x)=Var(y)=1\": the joint law\n of `(s, x, y)` is the product of `N(0,5/3)`, `N(0,1)`, `N(0,1)`. -/\n sxy_law : Measure.map (fun ω => (s ω, x ω, y ω)" + }, + { + "kind": "def", + "unqualified_name": "transverseMatrix", + "line": 657, + "source_header": "P =\n (ProbabilityTheory.gaussianReal 0 (5 / 3)).prod\n ((ProbabilityTheory.gaussianReal 0 1).prod (ProbabilityTheory.gaussianReal 0 1))\n\n/-- The `m = 2` transverse Hessian `A = [[s+x, y], [y, s-x]]`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"For m=2 write A=[[s+x,y],[y,s-x]]. The" + }, + { + "kind": "def", + "unqualified_name": "NegDefCone", + "line": 666, + "source_header": "Does not claim: anything. -/\nnoncomputable def transverseMatrix (s x y : ℝ) : Matrix (Fin 2) (Fin 2) ℝ :=\n Matrix.of ![![s + x, y], ![y, s - x]]\n\n/-- The negative-definite cone `A < 0` for the `m = 2` matrix, as positive definiteness of `-A`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"R=sqrt(x^2+y^2), and det A=s^2-R^2.\"\nInterface: none.\nDoes not c" + }, + { + "kind": "def", + "unqualified_name": "coneIntegrand", + "line": 675, + "source_header": "R` (not specified; the cone is taken by its definition). -/\ndef NegDefCone (q : ℝ × ℝ × ℝ) : Prop :=\n (-(transverseMatrix q.1 q.2.1 q.2.2)).PosDef\n\n/-- The cone-moment integrand `h(A) = det(A)^2 1{A<0}` for the `m = 2` matrix.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"R=sqrt(x^2+y^2), and det A=s^2-R^2.\"" + }, + { + "kind": "def", + "unqualified_name": "ConeMomentD1Identity", + "line": 685, + "source_header": "e def coneIntegrand (q : ℝ × ℝ × ℝ) : ℝ :=\n Set.indicator {q : ℝ × ℝ × ℝ | NegDefCone q}\n (fun q => (transverseMatrix q.1 q.2.1 q.2.2).det ^ 2) q\n\n/-- Section 1 identity `D_1 = E[A^2 1{A<0}] = 4/3` for `A ~ N(0, 8/3)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"D_1=E[A^2 1{A<0}]=4/3.\"\nInterface: `I : ConeMomentInterface` is given; the law of `A` is its hypothesis field.\nDoes not claim: the identity (statement only); that `D_1` is the parent's" + }, + { + "kind": "def", + "unqualified_name": "ConeMomentD2Identity", + "line": 694, + "source_header": "nt. -/\ndef ConeMomentD1Identity (I : ConeMomentInterface) : Prop :=\n ∫ ω, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) (I.A ω) ∂I.P = coneMomentD1\n\n/-- Section 1 identity `D_2 = E[det(A)^2 1{A<0}] = (1/2)[25/3 - 20/3 + 8 - 8 sqrt(3/8)]` for\n`A = [[s+x, y], [y, s-x]]` with the product Gaussian law.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)]\"\nInterface: `I : ConeMomentInterface` is given; the joint law is its hypothesis field.\nDoes not claim: the identity (statement only); the Rayleigh integration route; that `D_2` is the parent's `D_u` f" + }, + { + "kind": "def", + "unqualified_name": "ConeMomentD2Algebra", + "line": 705, + "source_header": "dentity (I : ConeMomentInterface) : Prop :=\n ∫ ω, coneIntegrand (I.s ω, I.x ω, I.y ω) ∂I.P =\n (1 / 2) * (25 / 3 - 20 / 3 + 8 - 8 * Real.sqrt (3 / 8))\n\n/-- Section 1 algebra `(1/2)[25/3 - 20/3 + 8 - 8 sqrt(3/8)] = 29/6 - sqrt 6`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \" = 29/6-sqrt(6).\"\nInterface: none.\nDoes not claim: the identity (statement only); its rati" + }, + { + "kind": "def", + "unqualified_name": "TraceMoments", + "line": 714, + "source_header": "ide24.cone_moment_m2_algebra`), not here. -/\ndef ConeMomentD2Algebra : Prop :=\n (1 / 2 : ℝ) * (25 / 3 - 20 / 3 + 8 - 8 * Real.sqrt (3 / 8)) = coneMomentD2\n\n/-- Section 1 moments of the trace shift `s ~ N(0, 5/3)`: `E s^2 = 5/3`, `E s^4 = 25/3`,\n`E exp(-s^2/2) = sqrt(3/8)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"E s^2=5/3, E s^4=25/3 and\"\nInterface: `I : ConeMomentInterface` is given.\nDoes not claim: the identities (statement only); `3 (5/3)^2 = 25/3` and `1 + 5/3 = 8/3` are kernel-" + }, + { + "kind": "def", + "unqualified_name": "RayleighSquareLaw", + "line": 726, + "source_header": ": ConeMomentInterface) : Prop :=\n ∫ ω, I.s ω ^ 2 ∂I.P = 5 / 3 ∧\n ∫ ω, I.s ω ^ 4 ∂I.P = 25 / 3 ∧\n ∫ ω, Real.exp (-(I.s ω ^ 2) / 2) ∂I.P = Real.sqrt (3 / 8)\n\n/-- Section 1: `R^2 = x^2 + y^2` has density `exp(-z/2)/2` on `(0, ∞)`, written through its\ndistribution function `P(R^2 ≤ a) = ∫_0^a exp(-z/2)/2 dz` for `a ≥ 0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"The variable R^2 has density e^(-z/2)/2.\"\nInterface: `I : ConeMomentInterface` is given.\nDoes not claim: the law (st" + }, + { + "kind": "def", + "unqualified_name": "ElementaryConeIntegral", + "line": 737, + "source_header": "ighSquareLaw (I : ConeMomentInterface) : Prop :=\n ∀ a : ℝ, 0 ≤ a →\n (I.P {ω | I.x ω ^ 2 + I.y ω ^ 2 ≤ a}).toReal = ∫ z in (0 : ℝ)..a, Real.exp (-z / 2) / 2\n\n/-- Section 1 elementary integral: for `a ≥ 0`,\n`∫_0^a (a-z)^2 exp(-z/2) dz/2 = a^2 - 4a + 8 - 8 exp(-a/2)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"integral_0^a (a-z)^2 e^(-z/2) dz/2 = a^2-4a+8-8e^(-a/2).\"\nInterface" + }, + { + "kind": "structure", + "unqualified_name": "PeriodicCoefficientInterface", + "line": 749, + "source_header": "ElementaryConeIntegral : Prop :=\n ∀ a : ℝ, 0 ≤ a →\n ∫ z in (0 : ℝ)..a, (a - z) ^ 2 * Real.exp (-z / 2) / 2 =\n a ^ 2 - 4 * a + 8 - 8 * Real.exp (-a / 2)\n\n/-! ## The exact periodic coefficient as an interface, and the headline statements -/\n\n/-- Interface for the exact periodic coefficient `c_{d,24}`, \"precisely its equation (15.2)\"\nof the parent. GIVEN: the coefficient `c24`; the ordinary sphere-area measure on `S^(d-1)`;\nthe gradient density `p_G(0)`, the pin density `p_{V_u}(0)`, the conditional standard\ndeviation `tau_u` and the cone moment `D_u` of the parent's (15.1). Hypothesis fields: the\nsphere measure is carried by the unit sphere with the areas `2 pi`, `4 pi`; the parent's\npositivity clause \"Finite-jet rank proves tau_u>0, positive densities p_G(0),p_Vu(0), and\nD_u>0\"; the densities and `tau_u^2` agree with the Gaussian density formula and the Schur\ncomplement of the derivative-rule blocks of `K_24`; summability of the theta family; and\nthe parent's display (15.2)\n`c_{d,L}= Gamma(7/6) / [24^(1/3) sqrt(pi)] * integral_{S^(d-1)} p_G(0) p_Vu(0) tau_u^(4/3) D_u d sigma(u)`\n(source id `lifetime-parent`, Section 15). The cone moment `D_u` is NOT pinned to `K_24`\nhere: writing it needs the conditional Gaussian law `A_u | V_u = 0`, which this module does\nnot construct.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Let c_d,24 be precisely its equation (15.2), using ordinary sphere area, ordered\"\nInterface: every field is a given object or a hypothesis; nothing is derived; in particular `coneMoment` is characterised only by its docstring.\nDoes not claim: existence of an object satisfying this interface; that `c24` is the finite-bar asymptotic constant (that reading is conditional on the parent's results, which are not touched); that the parent's \"ordered maximum/saddle roles and the full height/gradient pin Jacobian\" are encoded beyond the prefactor of (15.2). -/\nstructure PeriodicCoefficientInterface where\n /-- The exact periodic coefficient `c_{d,24}`, as a function of the dimension. -/\n c24 : ℕ → ℝ\n /-- Scope clause \"using ordinary sphere area\": the surface measure `sigma` on `S^(d-1)`. -/\n sphereMeasure : (d : ℕ) → Measure (E d)\n /-- The sphere measure is carried by the unit sphere. -/\n sphereMeasure_support : ∀ d : ℕ, sphereMeasure d ((Metric.sphere (0 : E d) 1)ᶜ) = 0\n /-- Section 1 clause \"|S^1|=2pi, |S^2|=4pi\": total areas in dimensions `2` and `3`. -/\n sphereMeasure_area :\n (sphereMeasure 2 Set.univ).toReal = 2 * Real.pi ∧ (sphereMeasure 3 Set.univ).toReal = 4 * Real.pi\n /-- Parent (15.2) ingredient: the gradient density at zero `p_G(0)`. -/\n pG0 : ℕ → ℝ\n /-- Parent (15.2) ingredient: the pin density at zero `p_{V_u}(0)` for the direction `u`. -/\n pV0 : (d : ℕ) → E d → ℝ\n /-- Parent (15.1) ingredient: `tau_u`, with `tau_u^2 = Var(t_u | G = 0)`. -/\n tau : (d : ℕ) → E d → ℝ\n /-- Parent (15.1) ingredient: `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]`, the Gaussian cone\n expectation under the conditional law of the transverse Hessian; GIVEN, not constructed. -/\n coneMoment : (d : ℕ) → E d → ℝ\n /-- Parent clause: positive density `p_G(0)`. -/\n pG0_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → 0 < pG0 d\n /-- Parent clause: positive density `p_{V_u}(0)` for every unit direction. -/\n pV0_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < pV0 d u\n /-- Parent clause: `tau_u > 0` for every unit direction. -/\n tau_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < tau d u\n /-- Parent clause: `D_u > 0` for every unit direction. -/\n coneMoment_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < coneMoment d u\n /-- The theta family of `K_24` is summable. -/\n theta_summable : ∀ d : ℕ, d = 2 ∨ d = 3 → ThetaSummable d\n /-- `p_G(0)` is the centred Gaussian density at zero with the gradient block of `K_24`, in\n every orthonormal frame. -/\n pG0_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ R : Fin d → E d, Orthonormal ℝ R →\n pG0 d = gaussDensity d (gradCov d (K24 d) R) 0\n /-- `p_{V_u}(0)` is the centred Gaussian density at zero with the pin block of `K_24`, in\n every orthonormal frame with `u = R 0`. -/\n pV0_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n pV0 d (R ⟨0, hd⟩) = gaussDensity d (pinCov d (K24 d) (R ⟨0, hd⟩) R) 0\n /-- `tau_u^2` is the Schur complement `Var(t_u) - Cov(t_u,G) Cov(G)^(-1) Cov(G,t_u)` of the\n derivative-rule blocks of `K_24`, in every orthonormal frame with `u = R 0`. -/\n tau_sq : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n tau d (R ⟨0, hd⟩) ^ 2 = condThirdVariance d (K24 d) (R ⟨0, hd⟩) R\n /-- Parent display (15.2), for `d ∈ {2, 3}`. -/\n eq_15" + }, + { + "kind": "def", + "unqualified_name": "CoefficientEnclosure", + "line": 815, + "source_header": "2 : ∀ d : ℕ, d = 2 ∨ d = 3 →\n c24 d = Real.Gamma (7 / 6) / ((24 : ℝ) ^ ((1 : ℝ) / 3) * Real.sqrt Real.pi) *\n ∫ u, pG0 d * pV0 d u * tau d u ^ ((4 : ℝ) / 3) * coneMoment d u ∂(sphereMeasure d)\n\n/-- The headline statement of the source: the two enclosures\n`0.07340691930603427103 < c_{2,24} < 0.07340691930603427104` and\n`0.04177593184059834334 < c_{3,24} < 0.04177593184059834335`, for any coefficient satisfying\nthe interface.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"0.07340691930603427103 < c_2,24 < 0.07340691930603427104,\"\nInterface: `I : PeriodicCoefficientInterface` is given; its `c24` is pinned only by the hypothesis fields of the interface (parent (15.2) with a GIVEN cone moment). The interface does not determine `c24`: the Prop is a predicate on the interface object, not a closed statement; its universal closure over all inhabitants is false whenever the interface is inhabited (scaling `coneMoment` by a positive constant scales `c24` through `eq_15_2` and gives another inhabitant), and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the enclosures (statement only: nothing here encloses the coefficient); that an object satisfying the interface exists or is the coefficient of the source; the parent's results or the persistence interpretation; any finite-radius error estimate, unrestricted remainder or RN/24-jet statement; the arithmetic skeleton (endpoint adjacency, `d3 < d2`, endpoints in `(0, 1/10" + }, + { + "kind": "def", + "unqualified_name": "ReferenceComparison", + "line": 827, + "source_header": "eba7), not here; nonauthor review or acceptance. -/\ndef CoefficientEnclosure (I : PeriodicCoefficientInterface) : Prop :=\n d2Lower < I.c24 2 ∧ I.c24 2 < d2Upper ∧ d3Lower < I.c24 3 ∧ I.c24 3 < d3Upper\n\n/-- Display (4): `|c_{d,24} / c_{d,ref} - 1| < 10^(-106)` for `d = 2, 3`, for any coefficient\nsatisfying the interface.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"|c_d,24/c_d,ref -1| < 10^(-106), d=2,3.\"\nInterface: `I : PeriodicCoefficientInterface` is given; `c_{d,ref}` is the explicit `cRef`. The interface does not determine `c24`: the Prop is a predicate on the interface object, not a closed statement; its universal closure over all inhabitants is false whenever the interface is inhabited (scaling `coneMoment` by a positive constant scales `c24` through `eq_15_2` and gives another inhabitant), and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the bound (statement only); equality of the periodic and reference constants (the source says it is NOT claimed); `32*10^(-108) < 10^(-106)`" + }, + { + "kind": "abbrev", + "unqualified_name": "TransRow", + "line": 837, + "source_header": "below_reported`), not here; nothing here encloses the coefficient. -/\ndef ReferenceComparison (I : PeriodicCoefficientInterface) : Prop :=\n ∀ d : ℕ, d = 2 ∨ d = 3 → |I.c24 d / cRef d - 1| < 1 / 10 ^ 106\n\n/-! ## Round 7: the successor interface that pins the cone moment\n\nEverything above this line is byte-identical to the module at Math- `8acc4856`. The declarations below\ntranscribe the parent's (15.1) `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]` (source id `lifetime-parent`,\nSection 15) for the formal kernel `K_24`: the conditional law of the transverse Hessian block `A_u`\ngiven the pin `V_u = 0` is written, for a centred Gaussian vector, through the Schur complement of the\nderivative-rule blocks (the SIDE24 note's Section 3 reading of conditioning), and the cone expectation\nis the Lebesgue integral of `det(A)^2 1{A<0}` against Mathlib's `multivariateGaussian` with that\ncovariance. The successor `PeriodicCoefficientInterface2` keeps every field of\n`PeriodicCoefficientInterface` and adds the parent's nondegeneracy clause for the pin block and the\nconditional block and the definition of `coneMoment`; the two successor Props restate the headline\ndisplays over it. Formal progress of every declaration here: `specified`. Nothing here is proved,\nnothing above changes, no label moves, and no inhabitant of either interface is constructed.\n\nWhat the successor does NOT pin (recorded for the design review, main#307 6137276515): `sphereMeasure` stays a given measure\nconstrained only by its support and total area, so `c24` is determined by the fields only up to that\nchoice; frame invariance of `coneMomentOf` under transverse-frame changes (the parent asserts it) is\nnot a field, so the frame-quantified `coneMoment_def` is a consistency burden on the interface rather\nthan a theorem here. The uniform-in-`u` bounds of the source would make the sphere-measure choice immaterial to\nthe two successor inequalities, not to the value of `c24`. -/\n\n/-- Transverse coordinates of the frame: the indices `i ≠ 0` (the axial direction is `u = R 0`), the\n`m = d - 1` directions of `u`-perp.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753e" + }, + { + "kind": "abbrev", + "unqualified_name": "TransIndex", + "line": 867, + "source_header": "ting m=d-1 and A for the transverse Hessian, Gaussian conditioning on V=0 gives\"\nInterface: none; a subtype of `Fin d`.\nDoes not claim: anything. -/\nabbrev TransRow (d : ℕ) : Type := {i : Fin d // 0 < i.val}\n\n/-- Transverse `svec` coordinates: the `svec` indices `(i, j)`, `i ≤ j`, with both entries transverse\n(`0 < i`), of cardinality `m(m+1)/2` (`1` for `d = 2`, `3` for `d = 3`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Use" + }, + { + "kind": "def", + "unqualified_name": "transScale", + "line": 876, + "source_header": "svec lists diagonal Hessian entries and\"\nInterface: none; a subtype of `SymIndex d`.\nDoes not claim: the cardinalities (not specified). -/\nabbrev TransIndex (d : ℕ) : Type := {p : SymIndex d // 0 < p.1.1.val}\n\n/-- The `svec` scaling restricted to transverse coordinates: `1` on the diagonal, `sqrt 2` off it\n(the restriction of `svecScale` to the Hessian block).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd" + }, + { + "kind": "def", + "unqualified_name": "transCov", + "line": 886, + "source_header": "dent off-diagonal entries. Its dimension is at most10.\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def transScale (d : ℕ) (a : TransIndex d) : ℝ :=\n if a.1.1.1 = a.1.1.2 then 1 else Real.sqrt 2\n\n/-- The covariance block of the transverse Hessian entries `A_ij = ∂_{R i} ∂_{R j} f`, `i, j ≠ 0`, by the\nstationary rule `Cov(∂^α f, ∂^β f) = (-1)^{|β|} ∂^{α+β} K(0)` at even total order (sign `+`), with the\n`svec` scaling: the restriction of `jointCov` to the transverse `svec` coordinates.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Cov(H_ij,H_kl)=delta_ij delta_kl+delta_ik delta_jl+delta_il delta_jk,\"\nInterface: none; the matrix is DEFINED by the derivative rule, no field is constructed.\nDoes not claim: that this matrix is the covariance of any random" + }, + { + "kind": "def", + "unqualified_name": "transPinCov", + "line": 899, + "source_header": ": ℕ) (K : E d → ℝ) (R : Fin d → E d) :\n Matrix (TransIndex d) (TransIndex d) ℝ :=\n Matrix.of fun a b => transScale d a * transScale d b *\n derivContraction d K 0 [R a.1.1.1, R a.1.1.2, R b.1.1.1, R b.1.1.2]\n\n/-- The cross-covariance block of the transverse Hessian entries with the pin coordinates\n`V_i = ∂_u ∂_{R i} f`: `Cov(A_ab, V_i) = ∂_{R a} ∂_{R b} ∂_u ∂_{R i} K(0)`, with the `svec` scaling.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Thus V=Hu has covariance diag(3,1,...,1), tau^2=Var(t|G=0)=6, and\"\nInterface: none; defined" + }, + { + "kind": "def", + "unqualified_name": "condHessianCov", + "line": 910, + "source_header": "noncomputable def transPinCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :\n Matrix (TransIndex d) (Fin d) ℝ :=\n Matrix.of fun a i => transScale d a * derivContraction d K 0 [R a.1.1.1, R a.1.1.2, u, R i]\n\n/-- The conditional covariance of the transverse Hessian given `V_u = 0`, as the Schur complement\n`Cov(A) - Cov(A,V) Cov(V)^(-1) Cov(V,A)` of the derivative-rule blocks (the same pattern as\n`condThirdVariance`, with `pinCov` as `Cov(V)`): the Gaussian conditional covariance when `Cov(V)` is\nnondegenerate.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"to their conditional covariances. For the latter, the Schur-complement quadratic\"\nInterface: none; the Gaussian conditional covariance is written as the Schur complement (a standard identity for a nondegenerate conditioning block, used here as the definition).\nDoes not claim: invertibility of `pinCov` (Mathlib's matrix inverse is `0` on a singular matrix, and the expression then degenerates to `transCov`; the ordinary-inverse Schur identification requires an invertible pin block, and the successor interface's field `pinCov_posDef` supplies that hypothesis); that it is the covariance of any conditional law (no field is construct" + }, + { + "kind": "def", + "unqualified_name": "symOf", + "line": 923, + "source_header": "utable def condHessianCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :\n Matrix (TransIndex d) (TransIndex d) ℝ :=\n transCov d K R - transPinCov d K u R * (pinCov d K u R)⁻¹ * (transPinCov d K u R).transpose\n\n/-- The symmetric transverse matrix read off an `svec` coordinate vector, undoing the `sqrt 2` scaling\nof the off-diagonal entries: entry `(i, j)` is `v_(i,j)` on the diagonal and `v_(min,max) / sqrt 2` off it.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Let C be a c" + }, + { + "kind": "def", + "unqualified_name": "coneIntegrandTrans", + "line": 936, + "source_header": "d)) :\n Matrix (TransRow d) (TransRow d) ℝ :=\n Matrix.of fun i j =>\n if h : i.1 ≤ j.1 then v ⟨⟨(i.1, j.1), h⟩, i.2⟩ / (if i = j then 1 else Real.sqrt 2)\n else v ⟨⟨(j.1, i.1), le_of_not_ge h⟩, j.2⟩ / Real.sqrt 2\n\n/-- The cone-moment integrand `h(A) = det(A)^2 1{A<0}` on `svec` coordinates, the negative-definite\ncone taken as positive definiteness of `-A` (as in `NegDefCone`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Integrate the nonnegative function h(A)=det(A)^2 1{A<0}. Under covariance scaling\"\nInt" + }, + { + "kind": "def", + "unqualified_name": "coneMomentOf", + "line": 947, + "source_header": "gral is `0`). -/\nnoncomputable def coneIntegrandTrans (d : ℕ) (v : EuclideanSpace ℝ (TransIndex d)) : ℝ :=\n Set.indicator {v : EuclideanSpace ℝ (TransIndex d) | (-(symOf d v)).PosDef}\n (fun v => (symOf d v).det ^ 2) v\n\n/-- The Gaussian cone expectation of the parent's (15.1), `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]`,\nwritten for a kernel `K` as the integral of the cone integrand against the centred multivariate\nGaussian law with the conditional covariance `condHessianCov d K u R`, in the frame `R` with `u = R 0`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"D_u=E[(det A_u)^2 1{A_u<0} | V_u=0].\"\nInterface: none; Mathlib's `ProbabilityTheory.multivariateGaussian` is the law: for a covariance that is not positive semidefinite it falls back to the Dirac mass at `0`, and a singular positive-semidefinite covariance gives a degenerate Gaussian (the Dirac mass when the covariance is zero), which is why the successor interface carries `condHessianCov_posDef`.\nDoes not claim: that this number is the parent's `D_u` for any field (no field and no conditional law is constructed: the Gaussian law is written from the formal covariance matrix); invariance under transverse-frame changes (the parent asserts it; not stated he" + }, + { + "kind": "structure", + "unqualified_name": "PeriodicCoefficientInterface2", + "line": 958, + "source_header": "ity` over `ConeMomentInterface`). -/\nnoncomputable def coneMomentOf (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) : ℝ :=\n ∫ v, coneIntegrandTrans d v ∂(ProbabilityTheory.multivariateGaussian 0 (condHessianCov d K u R))\n\n/-- Successor of `PeriodicCoefficientInterface` (numbered, the predecessor unchanged): every field of\nthe predecessor, plus the parent's Section 15 clause that `A_u` conditional on `V_u = 0` is a centred\nNONDEGENERATE Gaussian symmetric matrix (as positive definiteness of the pin block and of the\nconditional block of `K_24`, in every orthonormal frame with `u = R 0`), plus the definition of the\ncone moment: `coneMoment d u` is the Gaussian cone expectation `coneMomentOf d (K24 d) u R`. With these\nfields `coneMoment` is no longer free, so the doubling inhabitant that makes the universal closure of\n`CoefficientEnclosure` and `ReferenceComparison` false is excluded.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Here A_u conditional on V_u=0 is an actual centered nondegenerate Gaussian symmetric matrix\"\nInterface: every field is a given object or a hypothesis; nothing is derived. Still GIVEN and not pinned beyond support and total area: `sphereMeasure`, so `c24` is determined by the fields only up to the choice of that measure among measures carried by the unit sphere with the displayed areas. Frame invariance of `coneMomentOf` is not a field: `coneMoment_def` is required in every orthonormal frame with `u = R 0`, so an interface inhabitant exists only if the formal `coneMomentOf` is frame invariant (the parent asserts this for the actual object; it is not shown here).\nDoes not claim: existence of an object satisfying this interface; that the formal Schur complement and `multivariateGaussian` are the conditional law of any field (no field is constructed); that `c24` is the finite-bar asymptotic constant (conditional on the parent's results, which are not touched); frame invariance; anything about the predecessor interface, which is unchanged. -/\nstructure PeriodicCoefficientInterface2 extends PeriodicCoefficientInterface where\n /-- Parent clause \"an actual centered nondegenerate Gaussian symmetric matrix\": the pin block\n `Cov(V_u)` of `K_24` is positive definite in every orthonormal frame with `u = R 0`. The ordinary-inverse\n Schur identification of `condHessianCov` with the Gaussian conditional covariance requires an invertible pin\n block; this field supplies that hypothesis. -/\n pinCov_posDef : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n (pinCov d (K24 d) (R ⟨0, hd⟩) R).PosDef\n /-- The same clause for the conditional transverse block: positive definite, so the law in\n `coneMomentOf` is a nondegenerate Gaussian. For a covariance that is not positive semidefinite, Mathlib's\n `multivariateGaussian` falls back to the Dirac mass at `0`; a singular positive-semidefinite covariance gives a\n degenerate Gaussian, including the Dirac mass when the covariance is zero; omitting a PosDef field would not\n establish singularity. The inherited `coneMoment_pos` with `coneMoment_def` excludes the Dirac case, whose\n cone moment is `0`. -/\n condHessianCov_posDef : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n (condHessianCov d (K24 d) (R ⟨0, hd⟩) R).PosDef\n /-- Parent (15.1): `D_u` is the Gaussian cone expectation under the conditional law of the\n transverse Hessian of `" + }, + { + "kind": "def", + "unqualified_name": "CoefficientEnclosure2", + "line": 990, + "source_header": "_24` given `V_u = 0`, in every orthonormal frame with `u = R 0`. -/\n coneMoment_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n coneMoment d (R ⟨0, hd⟩) = coneMomentOf d (K24 d) (R ⟨0, hd⟩) R\n\n/-- Successor of `CoefficientEnclosure` over the successor interface: the same two enclosures\n`0.07340691930603427103 < c_{2,24} < 0.07340691930603427104` and\n`0.04177593184059834334 < c_{3,24} < 0.04177593184059834335`, for any object satisfying\n`PeriodicCoefficientInterface2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"0.04177593184059834334 < c_3,24 < 0.04177593184059834335.\"\nInterface: `I : PeriodicCoefficientInterface2` is given; `c24` is pinned by `eq_15_2` with the cone moment now defined by `coneMoment_def`, the densities by `pG0_def`, `pV0_def`, `tau_sq`, and the sphere measure still only by support and total area; the Prop is a predicate on the interface object, stated for every inhabitant.\nDoes not claim: the enclosures (statement only: nothing here encloses the coefficient; a theorem would need a proof-producing interval pipeline for `Gamma(7/6)`, `pi`, `exp`, the theta sums and the Gaussian cone integral);" + }, + { + "kind": "def", + "unqualified_name": "ReferenceComparison2", + "line": 1002, + "source_header": "e source's; anything about `CoefficientEnclosure`, which is unchanged; nonauthor review or acceptance. -/\ndef CoefficientEnclosure2 (I : PeriodicCoefficientInterface2) : Prop :=\n CoefficientEnclosure I.toPeriodicCoefficientInterface\n\n/-- Successor of `ReferenceComparison` over the successor interface: display (4),\n`|c_{d,24} / c_{d,ref} - 1| < 10^(-106)` for `d = 2, 3`, for any object satisfying\n`PeriodicCoefficientInterface2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"|c_d,24/c_d,ref -1| < 10^(-106), d=2,3. (4)\"\nInterface: `I : PeriodicCoefficientInterface2` is given; `c_{d,ref}` is the explicit `cRef`; the cone moment is pinned by `coneMoment_def` and the sphere measure only by support and total area (the source's bounds are uniform in `u`, which is what would make that choice immaterial to this inequality, though not to the value of `c24`; not shown here).\nDoes not claim: the bound (statement only; a theorem would need the Section 4 comparison of the Gaussian cone expectation under the ordered covariances, the Section 3 passage of (3) to the conditional covariance, and the frame-uniform integrand ratio, over the proof packet's `CovarianceOrdering`, `ReferenceCovarianceLowerBound`, `DensityComparison` and `IntegrandRatioBounds`); equality of the pe" + } + ] + }, + { + "path": "specifications/lean_statements_20261010/Specifications/RN.lean", + "sha256": "cad83a9d18029e66f2563f16a0850e846eb01dad0c3f08da6959ce0c186ae59c", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 107, + "source_header": "y\n\n/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same bodies, this\nnamespace; see the module header for the two module-specific `Does not claim:` lines). The\nduplication is deliberate: modules of this packet import only Mathlib. -/\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 120, + "source_header": "in d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 129, + "source_header": "i : ℝ))\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w :" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 139, + "source_header": "x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x :" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 148, + "source_header": "v ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 164, + "source_header": "an d g x w w)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector (a hypothesis where used). -/\nnoncomputable def pinM (d : ℕ) (r : ℝ)" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 173, + "source_header": "-((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector (a hypothesis where used). -/\nnoncomputable def pinS (d : ℕ) (r : ℝ" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 182, + "source_header": ":=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 0 1`,\n`E[N 1_E] ≤ (E N^p)^(1/p) P(E)^(1-1/p)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"E[N_r 1_Er] <= (E N_r^p)^(1/p) P(E_r)^(1-1/p).\"\nInterface: none; the probability space, event and count are universally quantified, integrability of `N^p` is a hypothesis.\nDoes not claim: that any count of the Gaussian model satisfies the moment hypothesis; the result or its proof; any rate in `r`; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN of rn-count-interface is transcribed by the register, not here). -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "HolderConsequenceN2", + "line": 224, + "source_header": "Ev).toReal ^ (1 - 1 / p)\n\n/-- Shape of (N2), the consequence of (N1) with a power-law moment bound: if\n`E N^p ≤ A r^(-β)` and `P(E) ≤ C r^3` then\n`E[N 1_E] ≤ A^(1/p) C^(1-1/p) r^((3(p-1)-β)/p)`. The powers refer to the `p`-th MOMENT\nitself, as the source insists.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"E[N_r 1_Er] <= A^(1/p) C^(1-1/p)\"\nInterface: none; `A`, `β`, `C`, `p`, `r` and the probability space are universally quantified, the two bounds are hypotheses.\nDoes not claim: that the exponent can be rounded up to `3`; that any Gaussian count satisfies the hypotheses; the result or its proof; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN of rn-count-interface is transcribed by the register, not here). -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "ConditionalMeanIdentityN3", + "line": 243, + "source_header": "r ^ ((3 * (p - 1) - β) / p)\n\n/-- Shape of (N3), the exact identity `E[N 1_E] = q E[N | E]` with `q = P(E) > 0`, stated\nwith Mathlib's conditional measure `P[|E] = P(E)⁻¹ P|_E` for the conditional expectation.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"E[N_r 1_Er]=q E[N_r | E_r].\"\nInterface: none; the probability space, event and count are universally quantified, `P(E) > 0` and integrability of `N` are hypotheses.\nDoes not claim: the equivalence with a bounded conditional mean, the lower comparison `q ≥ c r^3`, or anything about the Gaussian model; the result or its proof; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN of rn-count-interface is transcribed by the register, not here). -/\ndef Con" + }, + { + "kind": "def", + "unqualified_name": "uniformLaw", + "line": 257, + "source_header": "(ProbabilityTheory.cond P Ev)\n\n/-- The law of `U` uniform on `[0,1]`: Lebesgue measure restricted to `[0, 1]`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"On one space take U uniform on [0,1].\"\nInterface: none; an explicit construction.\nDoes not claim: that this measure is a probability measure (true, not stated as a result here). -/\nnoncomput" + }, + { + "kind": "def", + "unqualified_name": "counterCount", + "line": 265, + "source_header": "me.restrict (Set.Icc (0 : ℝ) 1)\n\n/-- The counterexample count `N_r = ceil(log(1/r)) 1_{E_r}` with `E_r = {U ≤ r^3}`, as a\nfunction of the uniform variable `u`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"N_r=ceil(log(1/r)) 1_Er.\"\nInterface: none; an explicit construction.\nDoes not claim: that this count is a realization of any Gaussian field quantity (the source says it is NOT). -/\nnoncomputable def" + }, + { + "kind": "def", + "unqualified_name": "UniformCounterexampleN4", + "line": 275, + "source_header": ")).indicator (fun _ => (1 : ℝ)) u\n\n/-- Shape of the sharp counterexample (N4): for `0 < r ≤ e^(-1)`, `P(E_r) = r^3` and\n`E N_r / r^3 = ceil(log(1/r))`, which tends to infinity as `r ↓ 0`, while for EACH finite\n`p ≥ 1` the `p`-th moments `E N_r^p` are bounded uniformly in `r` (by a constant that may\ndepend on `p`). So every finite moment does not preserve the cubic exponent.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"E N_r/r^3=ceil(log(1/r)) -> infinity.\"\nInterface: none; the construction is explicit (`uniformLaw`, `counterCount`).\nDoes not claim: the explicit bound `sup_(t>=1) e^(-3t)(t+1)^p` (only existence of a `p`-dependent bound); the one-`p` sharpness construction `N_r=ceil(r^(-3/p))1_Er`; the exponential-tail remark after (N5); that the construction says anything about the Gaussian field; the result or its proof; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN of rn-count-interface is transcribed by the register, not here). -/" + }, + { + "kind": "def", + "unqualified_name": "ExponentialTailLayerCakeN5", + "line": 293, + "source_header": "unterCount r u ^ p ∂uniformLaw ≤ A)\n\n/-- Shape of (N5), the exponential-tail layer-cake bound: if `P(N > t) ≤ A exp(-t/B)` for\nall `t ≥ 0` with `A ≥ 1`, `B > 0`, and `q = P(E) > 0`, then\n`E[N 1_E] ≤ B q [1 + log(A/q)]`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"= B q[1+log(A/q)].\"\nInterface: none; the probability space, event, count and tail constants are universally quantified, the tail bound is a hypothesis.\nDoes not claim: the intermediate integral identity `integral_0^infinity min(q,Ae^(-t/B))dt`; that the logarithmic loss is attained (the source's remark about (N4)); anything about the Gaussian model; the result or its proof; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN of rn-count-interface is transcribed by the register, not here). -/" + }, + { + "kind": "structure", + "unqualified_name": "PinnedLawInterface", + "line": 310, + "source_header": "* (1 + Real.log (A / (P Ev).toReal))\n\n/-! ### The pinned weighted law as an interface -/\n\n/-- Interface for the pinned Gaussian regression law and its determinant tilt. The sample\nspace `Ω` and its sigma-algebra are parameters; the sample paths `F`, the regression law\n`Q_r = Q r b k R` on the `2(d+1)` pin observations at `M = -(r/2)u`, `S = (r/2)u`\n(`u = R e_1`), the typed endpoint weight `W_r`, the tilted law `Q_r^W` and the contact\nkernel `Lambda_j` are GIVEN. The hypothesis fields transcribe: smooth `L`-periodic sample\npaths; `Q_r` is a probability measure under which, in the pin regime `0 < r < L`, the\n`2(d+1)` pin equations hold almost surely; `W_r ≥ 0` vanishes unless `H_M` is negative\ndefinite and `H_S` has index `d-1`; in the same regime `Z_r = E_(Q_r) W_r > 0` and\n`dQ_r^W = (W_r/Z_r) dQ_r` exactly (`Measure.withDensity`); and `Q_r^W` is a probability\nmeasure. The regime `0 < r < L` is this module's reading of the source clause \"For small r>0\nthe pins are\": for `0 < r < L` the pins `M`, `S` are distinct modulo `L Z^d` (`‖S - M‖ = r`\nwhile every nonzero lattice vector has norm at least `L`), so the pin equations are\nconsistent with `L`-periodicity; without the gate the structure would have no inhabitant for\n`L > 0` (at `r = L` along a coordinate frame the two pins coincide on the torus, so the pin\nvalues `b` and `b - k r^3` would be prescribed at one point). The Gaussian-regression\nconstruction of `Q_r`, the determinant factors `|det H_M| |det H_S|` of `W_r` and the\nKac-Rice contact representation (13) of `Lambda_j` are informal in the sources and are NOT\ntranscribed. Existence of such an object is not asserted (a Dirac mass at one smooth\n`L`-periodic sample path with the prescribed pin values, a nondegenerate maximum at `M` and a\nnondegenerate index-`(d-1)` saddle at `S`, with `W = 1` on that path, would satisfy the gated\nfields; this consistency remark is not a statement of this module).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"Q_r denotes continuous Gaussian regression on these 2(d+1) observations.\"\nInterface: every field is a given property of the law, never derived; in particular `Λ` is only a given kernel (its continuity and positivity are part of the Theorem A statement, not of this interface); the pin regime `0 < r < L` gating `Q_pinned`, `Z_pos` and `QW_eq` is part of the hypothesis fields, not a derived fact.\nDoes not claim: that `Q_r` is the Gaussian regression of any field; that `W_r` equals `F_d(H_M) F_(d-1)(H_S)`; the normalizer floor `Z_r >= z_* r^2`; that `Λ` is given by (13); existence or uniqueness of an object satisfying the interface (an inhabitant is not asserted; the consistency remark above is not stated); that `0 < r < L` is the sources' unspecified `small r` threshold. -/\nstructure PinnedLawInterface (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω] where\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"The real Fourier series therefore has smooth versions\"; every\n sample path is `C^n` for every finite `n`. -/\n smooth : ∀ (ω : Ω) (n : ℕ), ContDiff ℝ n (F ω)\n /-- Section 1 clause: the field lives \"On X=R^d/(L Z^d)\"; every sample path is `L`-periodic. -/\n periodic : ∀ (ω : Ω) (x : E d) (n : Fin d → ℤ), F ω (x + latticeVec d L n) = F ω x\n /-- Section 1 clause: \"Q_r denotes continuous Gaussian regression on these 2(d+1)\n observations\", indexed by radius `r`, birth `b`, gap mark `k` and frame `R`. -/\n Q : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Measure Ω\n /-- `Q_r` is a probability measure. -/\n Q_prob : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), IsProbabilityMeasure (Q r b k R)\n /-- Section 1 clause: the pins \"f(M)=b, f(S)=b-k r^3, grad f(M)=grad f(S)=0\" hold\n `Q_r`-almost surely in the pin regime `0 < r < L` (source: \"For small r>0 the pins are\"). -/\n Q_pinned : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →\n ∀ᵐ ω ∂(Q r b k R),\n F ω (pinM d r (R 0)) = b ∧ F ω (pinS d r (R 0)) = b - k * r ^ 3 ∧\n IsCriticalPoint d (F ω) (pinM d r (R 0)) ∧ IsCriticalPoint d (F ω) (pinS d r (R 0))\n /-- Section 1 clause: the \"actual endpoint weight\" `W_r=F_d(H_M) F_(d-1)(H_S)`, as a\n given functional of the sample. -/\n W : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Ω → ℝ\n /-- `W_r ≥ 0` (a product of filtered absolute determinants). -/\n W_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (ω : Ω), 0 ≤ W r b k R ω\n /-- Section 1 clause: `F_j(H)=|det H| 1{H has j negative eigenvalues}`, \"with value zero\n on singular matrices\"; so `W_r ≠ 0` forces `H_M` negative definite and `H_S` of index\n `d-1`. -/\n W_typed : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (ω : Ω), W r b k R ω ≠ 0 →\n HessianHasInertia d (F ω) (pinM d r (R 0)) d ∧ HessianHasInertia d (F ω) (pinS d r (R 0)) (d - 1)\n /-- Section 1 clause: the \"FULL normalizer\" `Z_r=E_(Q_r) W_r` is positive in the pin\n regime `0 < r < L`. -/\n Z_pos : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →\n 0 < ∫ ω, W r b k R ω ∂(Q r b k R)\n /-- The tilted law `Q_r^W`. -/\n QW : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Measure Ω\n /-- Section 1 clause: `dQ_r^W=(W_r/Z_r)dQ_r`, exactly, in the pin regime `0 < r < L`. -/\n QW_eq : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →\n QW r b k R = (Q r b k R).withDensity\n (fun ω => ENNReal.ofReal (W r b k R ω / ∫ ω', W r b k R ω' ∂(Q r b k R)))\n /-- `Q_r^W` is a probability measure. -/\n QW_prob : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), IsProbabilityMeasure (QW r b k R)\n /-- Section 5 clause (13): \"The contact kernel is Lambda_j(x;b,k,u)\", a given function of\n the index `j`, birth `b`, gap mark `k`, ax" + }, + { + "kind": "def", + "unqualified_name": "windowCount", + "line": 383, + "source_header": "al direction `u` and position `x`. -/\n Λ : ℕ → ℝ → ℝ → E d → E d → ℝ\n\n/-! ### Counts and regions -/\n\n/-- `N_(r,j)(E)`: the number of index-`j` critical points of `g` in `A` with height STRICTLY\nbetween `b - k r^3` and `b` (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"N_(r,j)(E)=#{x in E: grad f(x)=0, index H_x=j,\"\nInterface: none.\nDoes not claim: finiteness of the counted set; that boundary heights may be included (the source's remark about zero expected boundary counts is not stated). -/\nnoncomputable def" + }, + { + "kind": "def", + "unqualified_name": "windowCountAll", + "line": 396, + "source_header": "nt d g x ∧ HessianHasInertia d g x j ∧\n b - k * r ^ 3 < g x ∧ g x < b}\n\n/-- All-index window count: the number of critical points of `g` in `A` (degenerate ones\nincluded) with height strictly between `b - k r^3` and `b`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b\nAnchor: \"`N` is the number of critical points of `f` in `X minus {M, S}` with height in `I_r`, all\"\nInterface: none.\nDoes not claim: finiteness of the counted set; equality with the sum of the index counts (true off the degenerate locus, not stated). -/\nnoncomputab" + }, + { + "kind": "def", + "unqualified_name": "windowCountIndexSum", + "line": 406, + "source_header": "d {x : E d | x ∈ A ∧ IsCriticalPoint d g x ∧ b - k * r ^ 3 < g x ∧ g x < b}\n\n/-- `N(E) = sum_j N_j(E)`: the all-index window count of the remote-collision note, the sum\nover `j = 0, ..., d` of the index-`j` window counts (critical points with nonsingular Hessian\nof index `j`; an index above `d` does not occur in `R^d`).\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/remote_collision_20260928/PROOF.md sha256 b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2\nAnchor: \"N(E) = sum_j N_j(E).\"\nInterface: none.\nDoes not claim: finiteness of the counted sets; equality with `windowCountAll` (the two agree only off the degenerate locus). -/\nnoncomputable" + }, + { + "kind": "def", + "unqualified_name": "allHeightCount", + "line": 417, + "source_header": "A : Set (E d)) : ℕ :=\n ∑ j ∈ Finset.range (d + 1), windowCount d g b k r j A\n\n/-- `N_j(E)`: the number of index-`j` critical points of `g` in `A` at all heights.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05\nAnchor: \"let N_j(rE) count index-j critical points in rE at **all heights**.\"\nInterface: none.\nDoes not claim: finiteness of the counted set. -/\nnon" + }, + { + "kind": "def", + "unqualified_name": "remoteRegion", + "line": 426, + "source_header": "Set.ncard {x : E d | x ∈ A ∧ IsCriticalPoint d g x ∧ HessianHasInertia d g x j}\n\n/-- The remote region `D_rho = {x : dist_X(x,0) >= rho}`, represented in the fundamental\ndomain so that a Borel subset of it carries one representative per torus point.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"Fix 0=rho}.\"\nInterface: none.\nDoes not claim: anything about the representation of torus" + }, + { + "kind": "def", + "unqualified_name": "torusMinusPins", + "line": 436, + "source_header": "(L ρ : ℝ) : Set (E d) :=\n {x : E d | x ∈ FundDomain d L ∧ ρ ≤ torusDist d L x 0}\n\n/-- The torus with the two pins removed, `X minus {M, S}`, represented in the fundamental\ndomain: points at positive torus distance from both `M = -(r/2)u` and `S = (r/2)u`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b\nAnchor: \"critical points of `f` in `X minus {M, S}`\"\nInterface: none.\nDoes not claim: anything b" + }, + { + "kind": "def", + "unqualified_name": "torusWindowCount", + "line": 446, + "source_header": "ndDomain d L ∧ 0 < torusDist d L x (pinM d r u) ∧ 0 < torusDist d L x (pinS d r u)}\n\n/-- The torus-wide all-index window count `N` of the C6 notes: critical points other than\n`M, S` with height in `I_r = (b - k r^3, b)`, under the frame `R` (axial direction `R 0`).\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b\nAnchor: \"`N` is the number of critical points of `f` in `X minus {M, S}` with height in `I_r`, all\"\nInterface: `I : PinnedLawInterface` supplies the sample paths.\nDoes not claim: finiteness or measurability of the count as a function of the sample. -/\nnoncomputable def torusWindowCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]\n (I : Pin" + }, + { + "kind": "def", + "unqualified_name": "nearPinPairCount", + "line": 457, + "source_header": "ℝ (E d)) (ω : Ω) : ℕ :=\n windowCountAll d (I.F ω) b k r (torusMinusPins d L r (R 0))\n\n/-- Ordered pairs of distinct window critical points (both in `X minus {M, S}`, both with\nheight in `I_r`, at positive torus distance from each other) such that the FIRST witness is\nwithin torus distance `η` of a pin. All mutual separations are included, down to collision.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"one witness is within fixed `η` of a pin.\"\nInterface: none.\nDoes not claim: finiteness or measurability of the counted set (`Set.ncard` is `0` on an infinite set);\nthat an ordered pair whose only near-pin witness is in second position is counted (it is not: it is\nthe swap of a counted pair, so in the finite case the source's \"at least one witness near a pin\"\ncount lies between this count and twice it, and a bound `C r^3` on this count is a bound `2 C r^3`\non the source's; the two functionals are not literally the same). -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "scaledAt", + "line": 476, + "source_header": ".2 < b ∧\n (torusDist d L q.1 (pinM d r u) < η ∨ torusDist d L q.1 (pinS d r u) < η)}\n\n/-- The scaled chart `x0 + r E0` read through the frame `R`: the image of a coordinate set\n`E0` (coordinates `p` with `p 0` axial) under `p ↦ x0 + r ∑ p_i R_i`. With `x0 = 0` these\nare the midpoint scaled coordinates `X = r(u, v)`, in which the pins are `(±1/2, 0)`; with\n`x0 = M` they are the endpoint chart `M + r(p, q)`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"Scaled coordinates are `X = r(u, v)` from the midpoint, so the pins are `(±1/2, 0)`.\"\nInterface: none.\nDoes not claim: that the image lies in one fundamental domain (the sources take `r` small enough for the chart to embed in the torus). -/\nnoncomputable def scaledAt (d : ℕ) (" + }, + { + "kind": "def", + "unqualified_name": "collar", + "line": 489, + "source_header": "E d)\n (E0 : Set (E d)) : Set (E d) :=\n (fun p : E d => x0 + r • ∑ i, p i • R i) '' E0\n\n/-- The compact collar `C(eta, R)` in midpoint scaled coordinates: the ball of radius `R`\n(boundary included) with the two open balls of radius `eta` about the scaled pins\n`(-1/2, 0)` and `(1/2, 0)` removed.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"with the two open balls of radius `eta` about `(-1/2, 0)` and `(1/2, 0)` removed\"\nInterface: none.\nDoes not claim: anything beyond the definition; RECONCILIATION.md writes the same set `C_{η,R}` without defining it, and this definition is ta" + }, + { + "kind": "def", + "unqualified_name": "omegaD", + "line": 501, + "source_header": "0 : Fin d) (-(1 : ℝ) / 2)‖ ∧\n η ≤ ‖p - EuclideanSpace.single (0 : Fin d) ((1 : ℝ) / 2)‖}\n\n/-- The weight `omega_d(p, q) = max(|q|, r |p|)^(2-d)` of the endpoint chart, where `p` is\nthe axial coordinate (`p 0`) and `q` the transverse part; `omega_2 = 1`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"omega_d(p, q) = max(|q|, r |p|)^(2-d)\"\nInterface: none.\nDoes not claim: integrability of the weight over the punctured ball (part of the" + }, + { + "kind": "def", + "unqualified_name": "meanWindowCount", + "line": 511, + "source_header": "E d) : ℝ :=\n (max ‖p - EuclideanSpace.single (0 : Fin d) (p 0)‖ (r * |p 0|)) ^ ((2 : ℝ) - d)\n\n/-- `E_(Q_r^W) N_(r,j)(A)`: the expected index-`j` window count in `A` under the tilted law.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"E_(Q_r^W) N_(r,j)(E)\"\nInterface: `I : PinnedLawInterface` supplies the sample paths and the tilted law; the Kac-Rice representation (12) of this expectation is NOT used.\nDoes not claim: integrability of the count (if it is not integrable the Bochner integral is `0`). -/\nnoncomputable def meanWindowCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]\n (I : PinnedLawInte" + }, + { + "kind": "def", + "unqualified_name": "meanAllHeightCount", + "line": 522, + "source_header": "(j : ℕ)\n (A : Set (E d)) : ℝ :=\n ∫ ω, (windowCount d (I.F ω) b k r j A : ℝ) ∂(I.QW r b k R)\n\n/-- `E_(Q_r^W) N_j(A)`: the expected index-`j` all-height count in `A` under the tilted law.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05\nAnchor: \"E_(Q_r^W) N_j(rE)\"\nInterface: `I : PinnedLawInterface` supplies the sample paths and the tilted law; the weighted Kac-Rice intensity (16) is NOT used.\nDoes not claim: integrability of the count. -/\nnoncomputable def meanAllHeightCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]\n (I : PinnedLawIn" + }, + { + "kind": "def", + "unqualified_name": "FixedRemoteMeanMeasureA2", + "line": 533, + "source_header": "d)) (j : ℕ)\n (A : Set (E d)) : ℝ :=\n ∫ ω, (allHeightCount d (I.F ω) j A : ℝ) ∂(I.QW r b k R)\n\n/-! ### Fixed-remote Theorem A, displays (2) and (3) -/\n\n/-- Shape of Theorem A, display (2) (fixed-remote mean measure): for fixed `d ≥ 2`, `L > 0`,\n`0 < ρ < L/4`, compact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `kLo > 0`, there are\n`r_* > 0` and `C` (quantified OUTSIDE the universal quantifiers) such that for all\n`0 < r ≤ r_*`, `b ∈ B`, `k ∈ K`, frames `R`, indices `j ≤ d` and Borel `E ⊆ D_ρ`,\n`| E_(Q_r^W) N_(r,j)(E)/(k r^3) - ∫_E Lambda_j(x;b,k,u) dx | ≤ C r |E|`; and the kernel\n`Lambda_j` is continuous on `D_ρ`, bounded above and away from zero uniformly on the\ncompact parameter sets.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"| E_(Q_r^W) N_(r,j)(E)/(k r^3)\"\nInterface: `I` (sample paths, laws `Q_r`, `Q_r^W`, weight, kernel `Λ`) is a given object; the statement is about any `Λ` and any laws satisfying `PinnedLawInterface`; the Kac-Rice representation (12) and the contact formula (13) are not transcribed.\nDoes not claim: the result or its proof (uniform remote nondegeneracy, coupling (5), weight expansion (10), normalizer (11)); identification of `I.Λ` with the kernel (13); the total-variation convergence remark; the multi-witness Section 6; any numerical `C` or `r_*`; uniformity as `ρ → 0`; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN is transcribed by the register, not here). -/\ndef FixedRemoteMeanMeasureA2 (d : ℕ) [NeZero d] (L" + }, + { + "kind": "def", + "unqualified_name": "FixedRemoteCountBoundA3", + "line": 561, + "source_header": "I r b k R j A / (k * r ^ 3) - ∫ x in A, I.Λ j b k (R 0) x| ≤\n C * r * (volume A).toReal\n\n/-- Shape of Theorem A, display (3) (fixed-remote count and event bounds): with the same\nfixed data and existential `r_* > 0`, `C`, for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K`, frames,\nindices and Borel `E ⊆ D_ρ`, `E_(Q_r^W) N_(r,j)(E) ≤ C k r^3 |E|` and\n`P_(Q_r^W){N_(r,j)(E) ≥ 1} ≤ C k r^3 |E|`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"E_(Q_r^W) N_(r,j)(E) <= C k r^3 |E|,\"\nInterface: `I` is a given object as in `FixedRemoteMeanMeasureA2`.\nDoes not claim: a matching lower bound on the event probability (the source says this is NOT one); the unnormalized numerator bound (14); the result or its proof; any numerical constant; nonauthor review or acceptance. -/\ndef FixedRemoteCountBoundA3 (d : ℕ) [NeZero d] (" + }, + { + "kind": "def", + "unqualified_name": "FixedAnnulusWindowCandidateA2", + "line": 581, + "source_header": "R) {ω | 1 ≤ windowCount d (I.F ω) b k r j A}).toReal ≤\n C * k * r ^ 3 * (volume A).toReal\n\n/-! ### Fixed scaled annulus (d = 2): the height-window candidate (A2) and the all-height\nbridge (2) -/\n\n/-- Shape of the fixed-annulus height-window candidate statement (A2): `d = 2`, fixed `L > 0`,\ncompact marks (`b ∈ [bLo, bHi]`, `0 < kLo ≤ k ≤ kHi`), fixed scaled annulus\n`K = {A0 ≤ |(u,t)| ≤ B0}` with `1 < A0 < B0`; there are `C, r_* > 0`, uniform in the frame,\nthe marks, the Borel `E0 ⊆ K` and `j ∈ {0,1,2}`, such that\n`E_(Q_r^W) N_j(r E0) ≤ C k r^3 area(E0)` for `0 < r ≤ r_*`, where `N_j(r E0)` counts\nindex-`j` critical points in `r E0` with height STRICTLY between `b - k r^3` and `b`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md sha256 1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b\nAnchor: \"E_Qr^W N_j(r E0) <= C*k*r^3*area(E0),\"\nInterface: `I` is a given object; `r E0` is embedded in the torus through the frame by `scaledAt`; the six-pin regression (A3)-(A5), the normalizer (A8) and the weighted Kac-Rice formula (A21) are not transcribed.\nDoes not claim: the result or its proof (contact vector (A10), eigenfloor (A12), cutoff (A13), three-Hessian estimate (A18), inner-strip bound (A26)); the all-index sum or the Markov event bound; an all-height assertion; uniformity in `L`, as `k → 0`, as `B0 → ∞`, or for `d ≥ 3`; any numerical constant; nonauthor review or acceptance (the landing disposition REVIEWED_SCOPED is transcribed by the register, not here). -/\ndef FixedAnnulusWindowCandidateA2 (" + }, + { + "kind": "def", + "unqualified_name": "AnnulusBridgeAllHeight2", + "line": 605, + "source_header": "meanWindowCount 2 L Ω I r b k R j (scaledAt 2 R r 0 E0) ≤\n C * k * r ^ 3 * (volume E0).toReal\n\n/-- Shape of the all-height fixed-annulus bridge candidate statement, display (2): `d = 2`,\nfixed `L > 0`, compact marks, fixed scaled annulus `K_AB = {A ≤ |(u,v)| ≤ B}` with\n`1 < A < B`; there are `C, r_* > 0`, uniform in the marks, frames, Borel `E ⊆ K_AB` and\n`j ∈ {0,1,2}`, such that `E_(Q_r^W) N_j(rE) ≤ C r^3 area(E)` for `0 < r ≤ r_*`, where\n`N_j(rE)` counts index-`j` critical points in `rE` at ALL heights. The review interfaces\nR1-R7 of the source are the steps of its proof, not parts of this statement.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05\nAnchor: \"E_(Q_r^W) N_j(rE) <= C r^3 area(E), 0 0`, all frames and indices, existential constants) -/\n\n/-- Shape of row D5-a (P2, punctured pin disks): all heights; for Borel\n`E ⊂ {0 < p² + q² ≤ 1/16}` in the endpoint chart, `E_{Q_r^W} N_j(M + rE) ≤ C r³|E|`, and\nthe same at `S`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"E_{Q_r^W} N_j(M + rE) ≤ C r³|E|\"\nInterface: `I` is a given object; the chart `M + rE` is `scaledAt` based at the pin.\nDoes not claim: the P2 source (PUNCTURED_PIN_PROOF.md) or its proof; the P2 continuum review or the proposed register transitions of the reconciliation; any numerical constant; nonauthor review or acceptance. -/\ndef D5aPunctur" + }, + { + "kind": "def", + "unqualified_name": "D5bMicrodisk", + "line": 650, + "source_header": "ightCount 2 L Ω I r b k R j (scaledAt 2 R r (pinS 2 r (R 0)) E0) ≤\n C * r ^ 3 * (volume E0).toReal\n\n/-- Shape of row D5-b (microdisk): all heights; for fixed `κ > 0`, the expected index-`j`\ncount in the punctured disk of physical radius `κ r²` about each pin is `O(r⁵)`: there are\n`C, r_* > 0` with `E_{Q_r^W} N_j(disk) ≤ C r^5` for `0 < r ≤ r_*`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"the nested disks of radius `κr²` about each pin, for fixed `κ`: `O(r⁵)`\"\nInterface: `I` is a given object; the disk is punctured at the pin (the pin itself is a critical point under the law), following the dimension-lift reading \"nested ball\" inside the punctured ball `D`.\nDoes not claim: the P2 source or its nested-disk corollary; any numerical constant; uniformity in `κ`; nonauthor review or acceptance. -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "D5cCollarC1", + "line": 669, + "source_header": "t 2 L Ω I r b k R j\n {x : E 2 | 0 < ‖x - pinS 2 r (R 0)‖ ∧ ‖x - pinS 2 r (R 0)‖ ≤ κ * r ^ 2} ≤ C * r ^ 5\n\n/-- Shape of row D5-c (C1, compact collar): all heights; for fixed `R ≥ 1` and\n`0 < η ≤ 1/4`, for Borel `E ⊂ C_{η,R}` in midpoint scaled coordinates,\n`E_{Q_r^W} N_j(rE) ≤ C r³|E|`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"for Borel `E ⊂ C_{η,R}`, `η ≤ 1/4`, fixed `R ≥ 1`\"\nInterface: `I` is a given object; `C_{η,R}` is `collar 2 η R` (definition taken from the dimension-lift source, since RECONCILIATION.md does not define it).\nDoes not claim: the C1 source (COLLAR_PROOF.md) or its proof; the normalizer (P14) it imports; any numerical constant; nonauthor review or acceptance. -/\nd" + }, + { + "kind": "def", + "unqualified_name": "D5dSummedPinNeighbourhoodC2", + "line": 687, + "source_header": "meanAllHeightCount 2 L Ω I r b k R j (scaledAt 2 R r 0 E0) ≤\n C * r ^ 3 * (volume E0).toReal\n\n/-- Shape of row D5-d (C2, the summed pin-neighbourhood bound): all heights; for fixed\n`R ≥ 1`, `E_{Q_r^W} N_j(r B_R ∖ {M,S}) ≤ C_R r³`, the scaled ball of radius `R` with the\ntwo pins removed.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"E_{Q_r^W} N_j(r B_R ∖ {M,S}) ≤ C_R r³\"\nInterface: `I` is a given object.\nDoes not claim: the composition `D5-a + D5-c at η = 1/4` as a proof; the \"collar to the reviewed annulus\" remark; any numerical constant; nonauthor review or acceptance. -/\ndef D5dSummedPi" + }, + { + "kind": "def", + "unqualified_name": "D5eIntermediateShellsI3I4", + "line": 705, + "source_header": "ace.single (0 : Fin 2) (-(1 : ℝ) / 2) ∧\n p ≠ EuclideanSpace.single (0 : Fin 2) ((1 : ℝ) / 2)}) ≤ C * r ^ 3\n\n/-- Shape of row D5-e (I3/I4, intermediate shells): window `I_r`; the dyadic shells and\n`{A_0 r ≤ |X| ≤ ρ}` satisfy `E N ≤ C r³(A_0^{−2} + ρ²)`: there are `C, s_0 > 0` such that\nfor `A_0 ≥ 4` and `A_0 r < ρ ≤ s_0` the expected index-`j` window count in\n`{A_0 r ≤ |X| ≤ ρ}` (distance from the midpoint) is at most `C r^3 (A_0^(-2) + ρ^2)`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"E N ≤ C r³(A_0^{−2} + ρ²)\"\nInterface: `I` is a given object; the side conditions `A_0 ≥ 4`, `A_0 r < ρ ≤ s_0` are taken from the dimension-lift display (1.6), since RECONCILIATION.md states the row without them.\nDoes not claim: the single-shell display (1.5) (stated in `DimensionLiftIntermediateShellsI`); the I3/I4 source (intermediate_window_20260928) or its proof; any numerical constant; nonauthor review or acceptance. -/\ndef D5eInte" + }, + { + "kind": "def", + "unqualified_name": "D5fGlobalWindowFirstMomentI5", + "line": 724, + "source_header": "meanWindowCount 2 L Ω I r b k R j {x : E 2 | A0 * r ≤ ‖x‖ ∧ ‖x‖ ≤ ρ} ≤\n C * r ^ 3 * ((A0 ^ 2)⁻¹ + ρ ^ 2)\n\n/-- Shape of row D5-f (I5, global window first moment and planar event order): window\n`I_r`; `E_{Q_r^W} N_{r,j}(T² ∖ {M,S}) ≤ C r³`, and for the event `A_r` that some critical\npoint other than `M, S` has height in `I_r`, `c r³ ≤ P(A_r) ≤ C r³` with `c > 0`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"E_{Q_r^W} N_{r,j}(T² ∖ {M,S}) ≤ C r³\"\nInterface: `I` is a given object; `A_r` is the event `{N ≥ 1}` for the all-index torus-wide window count.\nDoes not claim: the tiling composition `D5-d (R = 4) + I4 + remote Theorem A` as a proof; the lower bound's source (remote_collision Corollary F-) or the I5 source; any numerical constant; nonauthor review or acceptance; any register transition proposed by the reconciliation; that the count `torusWindowCount` (every critical point off the pins, degenerate ones included) equals the sum of the index counts: it dominates the source's all-index `N`, and the two agree only off the degenerate locus. -/\ndef D5fGloba" + }, + { + "kind": "def", + "unqualified_name": "DimensionLiftPuncturedPinBallP", + "line": 745, + "source_header": "nt 2 L Ω I r b k R ω}).toReal ∧\n ((I.QW r b k R) {ω | 1 ≤ torusWindowCount 2 L Ω I r b k R ω}).toReal ≤ C * r ^ 3)\n\n/-! ### The dimension lift: Theorems P_d, C_d, I_d, G_d (every fixed d ≥ 2) -/\n\n/-- Shape of Theorem P_d (all-height punctured pin ball), display (1.2): fixed `d ≥ 2`,\n`L > 0`, compact marks; there are `C, C', r_* > 0` such that for `0 < r ≤ r_*`, all `b, k, R, j`\nand every Borel `E ⊆ D = {0 < p² + |q|² ≤ 1/16}` in the endpoint chart,\n`E_(Q_r^W) N_j(M + r E) ≤ C r^3 ∫_E omega_d ≤ C' r^3`, and the same about `S`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"E_(Q_r^W) N_j(M + r E) <= C r^3 integral_E omega_d(p, q) dp dq <= C' r^3.\"\nInterface: `I` is a given object; the chart is `scaledAt` based at the pin; the weight is `omegaD`.\nDoes not claim: the result or its proof (devices D1-D5, stable gradient frame, density and conditional moments, weighted Kac-Rice (4.10), crossover); the nested-ball `O(r^5)` corollary (stated for `d = 2` as `D5bMicrodisk`); the planar P2 identification; any numerical constant; uniformity in `d`; nonauthor review or acceptance. -/\ndef DimensionLiftPuncturedPin" + }, + { + "kind": "def", + "unqualified_name": "DimensionLiftCompactCollarC", + "line": 771, + "source_header": "E0) ≤\n C * r ^ 3 * ∫ p in E0, omegaD d r p ∧\n C * r ^ 3 * ∫ p in E0, omegaD d r p ≤ C' * r ^ 3)\n\n/-- Shape of Theorem C_d (compact collar), display (1.3): fixed `d ≥ 2`, `L > 0`, compact\nmarks, fixed `R ≥ 1` and `0 < η ≤ 1/4`; there are `C, r_* > 0` such that for every Borel\n`E ⊆ C(η, R)`, `E_(Q_r^W) N_j(r E) ≤ C r^3 |E|` for `0 < r ≤ r_*`, all `b, k, R, j`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"E_(Q_r^W) N_j(r E) <= C r^3 |E|.\"\nInterface: `I` is a given object; `C(η, R)` is `collar d η R`.\nDoes not claim: the consequence (1.4) for the scaled ball with pins removed (stated for `d = 2` as `D5dSummedPinNeighbourhoodC2`); the result or its proof; any numerical constant; nonauthor review or acceptance. -/\ndef DimensionLiftCompact" + }, + { + "kind": "def", + "unqualified_name": "DimensionLiftIntermediateShellsI", + "line": 789, + "source_header": "ar d η R0 →\n meanAllHeightCount d L Ω I r b k R j (scaledAt d R r 0 E0) ≤\n C * r ^ 3 * (volume E0).toReal\n\n/-- Shape of Theorem I_d (intermediate height-window shells), displays (1.5) and (1.6):\nthere are `C, s_0 > 0` such that for `0 < r ≤ s/4` and `0 < s ≤ s_0`,\n`E_(Q_r^W) N_(r,j)({ s ≤ |X| ≤ 2 s }) ≤ C r^3 [ (r/s)^2 + s^2 ]`, and hence, uniformly for\n`A_0 ≥ 4` and `A_0 r < ρ ≤ s_0`, `E_(Q_r^W) N_(r,j)({ A_0 r ≤ |X| ≤ ρ }) ≤ C r^3 (A_0^(-2) + ρ^2)`.\n`|X|` is the distance from the midpoint.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"E_(Q_r^W) N_(r,j)({ s <= |X| <= 2 s }) <= C r^3 [ (r/s)^2 + s^2 ],\"\nInterface: `I` is a given object.\nDoes not claim: the result or its proof (polynomial row rank, Euler suppression, shell ledger, dyadic sum); the planar I3/I4 identification; any numerical constant; nonauthor review or acceptance. -/\ndef DimensionLiftIntermedia" + }, + { + "kind": "def", + "unqualified_name": "DimensionLiftGlobalWindowG", + "line": 814, + "source_header": "meanWindowCount d L Ω I r b k R j {x : E d | A0 * r ≤ ‖x‖ ∧ ‖x‖ ≤ ρ} ≤\n C * r ^ 3 * ((A0 ^ 2)⁻¹ + ρ ^ 2))\n\n/-- Shape of Theorem G_d (global height-window first moment), display (1.7): fixed `d ≥ 2`,\n`L > 0`, compact marks; there are `C, r_* > 0` such that\n`E_(Q_r^W) N_(r,j)( X minus {M, S} ) ≤ C r^3` for `0 < r ≤ r_*`, all `b, k, R, j`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"E_(Q_r^W) N_(r,j)( X minus {M, S} ) <= C r^3.\"\nInterface: `I` is a given object.\nDoes not claim: the tiling proof (P_d, C_d, I_d and the fixed-remote Theorem A); Corollaries F_d and M_d; the planar I5 identification; the `d = 3` SIDE24 application; any regional supersession of historical carriers; any numerical constant; nonauthor review or acceptance. -/\ndef DimensionLiftGl" + }, + { + "kind": "def", + "unqualified_name": "FourierCutoffPlanarSecondFactorialF4", + "line": 830, + "source_header": "thonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →\n meanWindowCount d L Ω I r b k R j (torusMinusPins d L r (R 0)) ≤ C * r ^ 3\n\n/-! ### C6: Fourier cutoff (F4), Palm route (Theorem Q, Corollary Theta) -/\n\n/-- Shape of the planar Fourier-cutoff consequence (F4): in `d = 2`, GIVEN the\ndimension-matched first-moment hypothesis `G_2` (`E_(Q_r^W) N ≤ C r^3` for small `r`,\nuniformly in the marks and frames), there are `C` and `r_* > 0` such that\n`E_(Q_r^W) N(N-1) ≤ C r^3 log(1/r)` for `0 < r ≤ r_*`, all `b, k, R`. The source derives\nthis from Theorem W with `p = 2`; the hypothesis `G_2` is stated as a hypothesis here, not\ndischarged.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_fourier_cutoff_20260929/PROOF.md sha256 c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733\nAnchor: \"E_Qr^W N(N-1) <= C r^3 log(1/r),\"\nInterface: `I` is a given object; `N` is `torusWindowCount`; `(N)_2 = N(N-1)` is `Nat.descFactorial N 2`.\nDoes not claim: Theorem F (the cap `Psi_F` and its tail (F1)-(F2)); Theorem W for general `d` and `p` (F3); that `G_2` holds (the source takes it from the reviewed planar I5 composition); Proposition B; that the logarithm is sharp or removable; any numerical constant; nonauthor review or acceptance; that the count `torusWindowCount` (every critical point off the pins, degenerate ones included) equals the sum of the index counts: it dominates the source's all-index `N`, and the two agree only off the degenerate locus. -/\ndef Fo" + }, + { + "kind": "def", + "unqualified_name": "PalmRouteFactorialMomentsQ", + "line": 856, + "source_header": "∫ ω, (Nat.descFactorial (torusWindowCount 2 L Ω I r b k R ω) 2 : ℝ) ∂(I.QW r b k R) ≤\n C * r ^ 3 * Real.log (1 / r)\n\n/-- Shape of Theorem Q (Palm route, factorial moments in every fixed dimension): fixed\n`d ≥ 2`, `L > 0`, compact marks; for every fixed integer `q ≥ 2` there are `C_q, r_* > 0`\nsuch that `E_(Q_r^W)[ (N)_q ] ≤ C_q r^3` for `0 < r ≤ r_*`, all `b, k, R`. The radius\nthreshold is allowed to depend on `q` (the source's quantifier order is \"There are\n`C_q, r_* > 0` such that for `0 < r ≤ r_*`, all `b, k, R` and every fixed integer `q ≥ 2`\";\nthe weaker reading with `r_*` after `q` is stated).\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b\nAnchor: \"E_(Q_r^W)[ (N)_q ] <= C_q r^3.\"\nInterface: `I` is a given object; `N` is `torusWindowCount`; `(N)_q` is `Nat.descFactorial N q`.\nDoes not claim: the result or its proof (the cap `Psi` in `d` dimensions, the parametric Rouché tail, the marked Kac-Rice formula with Hölder insertion, the regimes R1-R4); the dependence on [C6L] and [DL] at their bytes; a lower bound for `q ≥ 3`; Corollary P; any numerical constant; nonauthor review or acceptance; that the count `torusWindowCount` (every critical point off the pins, degenerate ones included) equals the sum of the index counts: it dominates the source's all-index `N`, and the two agree only off the degenerate locus. -/\ndef PalmRoute" + }, + { + "kind": "def", + "unqualified_name": "PalmRouteSecondFactorialTheta", + "line": 876, + "source_header": "sis (Fin d) ℝ (E d),\n ∫ ω, (Nat.descFactorial (torusWindowCount d L Ω I r b k R ω) q : ℝ) ∂(I.QW r b k R) ≤\n Cq * r ^ 3\n\n/-- Shape of Corollary Theta (the C6 order is `r^3`): in every fixed `d ≥ 2`, there are\n`c > 0`, `C` and `r_* > 0` such that `c r^3 ≤ E_(Q_r^W)[ N(N-1) ] ≤ C r^3` and\n`c r^3 ≤ Q_r^W{ N ≥ 2 } ≤ C r^3` for `0 < r ≤ r_*`, all `b, k, R`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b\nAnchor: \"c r^3 <= E_(Q_r^W)[ N(N-1) ] <= C r^3,\"\nInterface: `I` is a given object; `N` is `torusWindowCount`.\nDoes not claim: the lower bounds' source ([EDL] (A4)) or the upper bounds' sources (Theorem Q, [DL] Corollary M_d); that the logarithm of the Fourier cutoff is removed as a reviewed fact; any statement about the positions of the pairs; any numerical constant; nonauthor review or acceptance; that the count `torusWindowCount` (every critical point off the pins, degenerate ones included) equals the sum of the index counts: it dominates the source's all-index `N`, and the two agree only off the degenerate locus. -/\ndef PalmRouteS" + }, + { + "kind": "def", + "unqualified_name": "pmfTV", + "line": 897, + "source_header": "2 ≤ torusWindowCount d L Ω I r b k R ω}).toReal ∧\n ((I.QW r b k R) {ω | 2 ≤ torusWindowCount d L Ω I r b k R ω}).toReal ≤ C * r ^ 3\n\n/-! ### C6 rare-cluster consequences: Theorem O (abstract, on laws on ℕ) -/\n\n/-- Total-variation distance between two probability mass functions on `ℕ`: half the `l^1`\ndistance (the source's convention; equal to the supremum over events for probability laws).\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb\nAnchor: \"For probability laws, dTV is the supremum over measurable events, equivalently half the l1 distance on this countable state space.\"\nInterface: none; if the `l^1` series is not summable the `tsu" + }, + { + "kind": "def", + "unqualified_name": "poissonPMF", + "line": 909, + "source_header": "ith the event supremum (true for probability laws, not stated). -/\nnoncomputable def pmfTV (μ ν : ℕ → ℝ) : ℝ :=\n (1 / 2) * ∑' n : ℕ, |μ n - ν n|\n\n/-- The Poisson probability mass function `Pois(lam)(n) = exp(-lam) lam^n / n!`\n(for `lam ≥ 0`; `Pois(0) = δ_0`).\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb\nAnchor: \"dTV(Law N, Pois(lambda))\"\nInterface: none; an explicit formula (the so" + }, + { + "kind": "def", + "unqualified_name": "RareClusterPoissonObstructionO", + "line": 919, + "source_header": "one (true for `lam ≥ 0`, not stated). -/\nnoncomputable def poissonPMF (lam : ℝ) (n : ℕ) : ℝ :=\n Real.exp (-lam) * lam ^ n / (Nat.factorial n : ℝ)\n\n/-- Shape of Theorem O (sharp ordinary-Poisson obstruction): for a family of laws\n`μ_r` on `ℕ` (the law of the window count `N_r`) which, for all sufficiently small `r`\n(that is, for `0 < r ≤ r_0` for some `r_0 > 0`), are probability mass functions with\nsummable mean satisfying only (H1) `E N_r ≤ A r^3` and (H2) `P(N_r ≥ 2) ≥ a r^3` with\n`a > 0`: then, for all sufficiently small `r`,\n`(a/2) r^3 ≤ inf_{lambda ≥ 0} dTV(Law N_r, Pois(lambda)) ≤ A r^3`: every nonnegative\nintensity is at distance at least `(a/2) r^3`, and some intensity is within `A r^3`. The\nhypotheses are imposed only on `0 < r ≤ r_0`, as in the source (\"for all sufficiently small\nr\"); imposing (H2) for every `r > 0` would be unsatisfiable (`a r^3 ≤ 1` fails for large\n`r`) and would make the statement hold for every family. The source's remark that the\npremises imply `2a ≤ A` is not taken as a hypothesis.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb\nAnchor: \"(a/2) r^3 <= inf_{lambda>=0} dTV(Law N, Pois(lambda)) <= A r^3.\"\nInterface: the laws `μ_r` are given probability mass functions on `ℕ` (nonnegative, summing to one, with summable mean) for `0 < r ≤ r_0`; the hypotheses (H1), (H2) are hypotheses on that range only; nothing ties `μ_r` to the Gaussian model here (the source says the only analytic inputs are H1, H2, Hq).\nDoes not claim: the result (Theorem O) or its proof; that `2a ≤ A` (derived in the source, not a hypothesis here); that H1 or H2 hold for the Gaussian window count (the source takes them from [D5] Theorem G_d and [C6] Corollary Theta); the mean-matched statement `lambda = mu`; Theorems C and S, the factorial-moment matching or the independent-replica limit; the conditional-law liminf remark; that the upper half is the source's infimum bound verbatim: `∃ lam ≥ 0, dTV(Law N_r, Pois(lam)) ≤ A r^3` implies `inf_{lam ≥ 0} dTV ≤ A r^3` and is stronger unless the infimum is attained, and the existential form is used because the source's proof exhibits the witness `lam = 0` (the source: The upper bound in (3.1) u" + }, + { + "kind": "def", + "unqualified_name": "RemoteCollisionSecondFactorialD", + "line": 945, + "source_header": "tar →\n (∀ lam : ℝ, 0 ≤ lam → (a / 2) * r ^ 3 ≤ pmfTV (μ r) (poissonPMF lam)) ∧\n (∃ lam : ℝ, 0 ≤ lam ∧ pmfTV (μ r) (poissonPMF lam) ≤ A * r ^ 3)\n\n/-! ### Remote collision (Corollary D) and the OPEN witness-collision target -/\n\n/-- Shape of Corollary D (second factorial moment in the fixed remote region): fixed `d ≥ 2`,\n`L > 0`, `0 < ρ < L/4`, compact marks; there are `C` and `r_* > 0` such that for\n`0 < r ≤ r_*`, all marks and frames and every Borel `E ⊆ D_ρ`,\n`E_(Q_r^W) N(E)(N(E)-1) ≤ C r^5 |E|` and `Q_r^W{ N(E) ≥ 2 } ≤ C r^5 |E|`, where\n`N(E) = sum_j N_j(E)` is the sum of the index-`j` window counts in `E`\n(`windowCountIndexSum`, the source's definition). Pairs at every mutual separation inside\n`D_ρ`, down to coincidence, are included.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/remote_collision_20260928/PROOF.md sha256 b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2\nAnchor: \"E_(Q_r^W) N(E)(N(E)-1) <= C r^5 |E|,\"\nInterface: `I` is a given object; the pair Kac-Rice formula (3.1) and the divided-difference coordinates (4.1) are not transcribed.\nDoes not claim: Theorem C (the ordered near-pair count) or its proof (Lemmas 1-5); Corollaries E and F; a torus-wide second factorial moment or `math.rn-region.witness-collision` in its full sense; pairs with a witness near the pins; equality of `N(E)` with the all-critical-point count `windowCountAll` (they agree only off the degenerate locus); any numerical constant; nonauthor review or acceptance. -/\ndef Re" + }, + { + "kind": "def", + "unqualified_name": "WitnessCollisionNearPinPairsTarget", + "line": 971, + "source_header": "5 * (volume A).toReal ∧\n ((I.QW r b k R) {ω | 2 ≤ windowCountIndexSum d (I.F ω) b k r A}).toReal ≤\n C * r ^ 5 * (volume A).toReal\n\n/-- OPEN OBLIGATION, stated as a TARGET and not as a result. GRAPH node\n`math.rn-region.witness-collision` (classification OPEN_ACTIVE, catalog C6): the regional\nshrinking pin/witness-collision mechanism. The reconciliation describes what is missing as\na torus-wide second factorial moment of the window count \"with pairs where at least one\nwitness is within fixed `η` of a pin\", at every mutual separation (the fixed-remote `P_η`\nof Corollary D covers only pairs with both witnesses at distance `≥ η` from the pins). The\nProp below is that target: fixed `d ≥ 2`, `L > 0`, `η > 0`, compact marks; there are `C` and\n`r_* > 0` with `E_(Q_r^W) #{ordered window pairs with the first witness within η of a pin} ≤ C r^3`\nfor `0 < r ≤ r_*`, all `b, k, R`. No source in this packet establishes it; its register\nstatus is OPEN and this declaration does not change that.\n\nScope note (statement-shape review 5483861746 on Math- PR #419, 2026-10-11, AMEND_SCOPE_NOTE;\nnothing below changes the Prop): (i) the source's §5 states its open obligation for the planar\ncase and makes no claim for `d > 2`; the formal target quantifies every `d ≥ 2`, so its instances\nwith `d > 2` are a proposed generalisation carried by this packet, not a transcription of the\nsource's scope. (ii) `nearPinPairCount` counts ordered pairs whose FIRST witness is within `η` of\na pin; the source's \"at least one witness\" set is the union of that set with its swap, so (in the\nfinite case) it has between one and two times as many elements, and a bound `C r^3` here is a\nbound `2 C r^3` for the source's count: the orders agree, the functionals do not literally\ncoincide. (iii) `Set.ncard` is `0` on an infinite set and `PinnedLawInterface` supplies neither\nalmost-sure finiteness nor measurability of the pair population, so an infinite population would\nmake the integrand vanish spuriously; reading this Prop as the source's second factorial moment\nneeds those two facts about the law, which the interface does not provide and this Prop does not\nassume. The weighted law `I.QW` is a given field, not the source's six-pin regression.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"A torus-wide second factorial moment `E_{Q_r^W} N(N−1)` for the window count, with pairs where at least\"\nInterface: `I` is a given object; the pair count is `nearPinPairCount`.\nDoes not claim: that this target holds, is attainable, or is implied by any reviewed source (the Palm route's Theorem Q is an author-side candidate whose `q = 2` case would imply it; that candidate is stated separately as `PalmRouteFactorialMomentsQ` and is not consumed here); that the lower obstruction `E N(N−1) ≥ 2c r³` is stated here; the optimal order; any status transition of the node. -/\ndef Wit" + } + ] + } + ] + }, + "reason": "143 Prop definitions and interfaces specify targets; they are not theorem proofs. Strict source/Git identity passes; no amount of axiom-free elaboration closes these targets.", + "attempts": [ + "Preserved worker build/cache/source-gate attempts and resource limits in sources/lean-foundation/REPORT.txt and RESULT.json.", + "No completed current Math project build, full axiom census or kernel replay was observed for this exact boundary." + ], + "original_record": { + "id": "MATH:specifications/lean_statements_20261010", + "repository_commit": "8151f592918a845bf19eb8eafaf8444540a32734", + "boundary": "specifications/lean_statements_20261010", + "status": "QUARANTINED_CURRENT_CLOSURE", + "owner": null, + "reason": "143 Prop definitions and interfaces specify targets; they are not theorem proofs. Strict source/Git identity passes; no amount of axiom-free elaboration closes these targets.", + "mathematical_status": "NOT_RECLASSIFIED_AS_FALSE_OR_UNPROVED_BY_RESOURCE_FAILURE", + "source_files": [ + { + "path": "specifications/lean_statements_20261010/Specifications.lean", + "sha256": "9a05b58eb94b0f24c9b8118b625ff003ca99ff2257734fe3d1f1d57ce3c9b976", + "declarations_lexical": [] + }, + { + "path": "specifications/lean_statements_20261010/Specifications/P15.lean", + "sha256": "a30d9e6938b64d4e2728c5380d41b3a627cde42448df254069293e3839a41ca6", + "declarations_lexical": [ + { + "kind": "def", + "unqualified_name": "weight", + "line": 69, + "source_header": "5\n\n/-! ## Product measure, prices, the transformed price `phi` and the capped hazard -/\n\n/-- Independent-coordinate weight of a subset `U` of a finite ground type `Y` under the\nprobability vector `p`: `prod_{v in U} p_v * prod_{v notin U} (1 - p_v)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"Select the ORIGINAL coordinates independently with arbitrary probabilities p_v in [0,1], and let 0<=c_v<=p_v.\"\nInterface: none; `p` is any real vector (the sources take `p_v in [0,1]`, imposed as a hypothesis where used).\nDoes not claim: that these weights sum to one over all subsets (not stated separately). -/\nnoncomputable def weight {Y : Type} [Fintype Y] [DecidableEq Y] (p : Y → ℝ) (U : Finset Y" + }, + { + "kind": "def", + "unqualified_name": "muOf", + "line": 81, + "source_header": "p v)\n\n/-- Product-measure mass `mu_p(A)` of a finite family `A` of subsets of a finite ground type:\nthe sum of the weights of its members.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"F_A(t)=-log mu_(p(t))(A),\"\nInterface: none.\nDoes not claim: anything; this is the probability that the random set of independently selected coordinates lies in `A`. -/\nnoncomputable def muOf {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))\n (p : Y →" + }, + { + "kind": "def", + "unqualified_name": "genPrice", + "line": 92, + "source_header": "ght p U\n\n/-- Price of a generator `g`: `product_(v in g) c_v`; the empty generator has price `1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"A generator's price is product_(v in g)c_v, and family price is the sum of generator prices.\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def genPrice {Y : Type} (c : Y → ℝ) (g : Fins" + }, + { + "kind": "def", + "unqualified_name": "famPrice", + "line": 101, + "source_header": "∈ g, c v\n\n/-- Price of a generator family `G`: the sum of its generator prices; the empty family has\nprice `0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"The empty generator has price1; the empty family has price0.\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def famPrice {Y : Type} (c : Y → ℝ) (G : Finset (Fin" + }, + { + "kind": "def", + "unqualified_name": "phi", + "line": 111, + "source_header": "enPrice c g\n\n/-- The transformed price ceiling `phi(t) = min(1, -log(1 - t))` with `phi(1) = 1`. The guard\n`t < 1` renders the source's convention at `t = 1` (Mathlib's `Real.log 0 = 0` would otherwise\ngive `0`); for `t > 1`, outside the source's domain, the value `1` is a placeholder.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"where phi(t)=min(1,-log(1-t)), phi(1)=1.\"\nInterface: none.\nDoes not claim: any value outside `[0, 1]`. -/\nnoncomputable def ph" + }, + { + "kind": "def", + "unqualified_name": "cappedHazard", + "line": 122, + "source_header": "- t)) else 1\n\n/-- The capped, scaled hazard `min(1, rho * [-log m])` of a probability `m`, with the sources'\nconvention that the hazard of a zero probability is `+infinity`, so that the cap `1` applies:\n`cappedHazard rho m = 1` when `m <= 0`. With `rho = 1` this is `min(1, -log mu_p(D))` of (P8);\nwith `rho = 16/27` the right side of (T1); with `rho = rho_star` the right side of (F2).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"If some q_i=1 the trivial price-one cover handles the endpoint.\"\nInterface: none.\nDoes not claim: anything; the branch at `m <= 0` is the sources' endpoint convention, not a result. -/\nnoncomputable def cappedHazar" + }, + { + "kind": "structure", + "unqualified_name": "RealizedData", + "line": 134, + "source_header": ".log m)) else 1\n\n/-! ## The realized capacity/clutter family -/\n\n/-- Data of a realized family on a finite ground type `X`: `b` blocks, the block map `blk`\n(the blocks `X_i` are its fibres, hence disjoint and covering), capacities `a_i`, demands `d_i`\nand the clutter `H` of forbidden block supports. The side conditions of the sources are the\nseparate `Prop` `IsRealizedFamily`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"Choose positive integers a_i,d_i and disjoint original-coordinate blocks X_i with\"\nInterface: none; every field is a finite datum, nothing is a hypothesis field.\nDoes not claim: that the data satisfy the sources' side conditions (that is `IsRealizedFamily`). -/\nstructure RealizedData (X : Type) where\n /-- The number of blocks. -/\n b : ℕ\n /-- The block of each original coordinate. -/\n blk : X → Fin b\n /-- The capacities `a_i`. -/\n a : Fin b → ℕ\n /-- The demands `d_i`. -/\n d : Fin b → ℕ\n /-- The clutter `H` of forbidden block supports. -/" + }, + { + "kind": "def", + "unqualified_name": "block", + "line": 157, + "source_header": "H : Finset (Finset (Fin b))\n\n/-- The original-coordinate block `X_i = {v : blk v = i}`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"disjoint original-coordinate blocks X_i\"\nInterface: none.\nDoes not claim: anything. -/\ndef block {X : Type} [Fintype X] (F : RealizedD" + }, + { + "kind": "def", + "unqualified_name": "IsRealizedFamily", + "line": 166, + "source_header": "v.filter (fun v => F.blk v = i)\n\n/-- The side conditions of the realized family: `a_i >= 1`, `d_i >= 1` (\"positive integers\na_i,d_i\"), `|X_i| = a_i d_i + 1`, every edge of `H` has size at least `2`, and `H` is a clutter\n(no edge properly contains another; edges are distinct as members of a `Finset`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" n_i=|X_i|=a_i d_i+1.\"\nInterface: none; this `Prop` IS the interface of the sources, stated for a data record.\nDoes not claim: that any particular data record satisfies it. -/\ndef IsRealizedFamily {X : Type} [Finty" + }, + { + "kind": "def", + "unqualified_name": "supp", + "line": 178, + "source_header": "∈ F.H, ∀ f ∈ F.H, e ⊆ f → e = f)\n\n/-- The block support `supp(U) = {i : U intersect X_i is nonempty}`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"supp(U)={i:U intersect X_i is nonempty}. (P1)\"\nInterface: none.\nDoes not claim: anything. -/\ndef supp {X : Type} (F : RealizedData X" + }, + { + "kind": "def", + "unqualified_name": "IsGood", + "line": 187, + "source_header": "Finset (Fin F.b) :=\n U.image F.blk\n\n/-- Membership in the downset `D` of display (P1): `|U intersect X_i| <= a_i` for every `i`, and\n`supp(U)` contains no edge of `H`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"D={U subset X: |U intersect X_i|<=a_i for every i,\"\nInterface: none.\nDoes not claim: that `D` is decreasing or contains the empty set (facts of the sources, not stated separately). -/\ndef IsGood {X : Type} [Fintype X] [DecidableEq X] (F :" + }, + { + "kind": "def", + "unqualified_name": "downset", + "line": 197, + "source_header": "≤ F.a i) ∧ ∀ e ∈ F.H, ¬ e ⊆ supp F U\n\n/-- The downset `D` as a set of subsets of `X`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" supp(U) contains no edge of H},\"\nInterface: none.\nDoes not claim: anything. -/\ndef downset {X : Type} [Fintype X] [DecidableEq X" + }, + { + "kind": "def", + "unqualified_name": "IsKDecomposable", + "line": 206, + "source_header": ": Set (Finset X) :=\n {U | IsGood F U}\n\n/-- `U in I_k(D)`: `U` is partitionable into at most `k` members of `D` (a family of `k`\npairwise disjoint good parts, possibly empty, with union `U`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"write I_k(D) for sets partitionable into at most k members of D\"\nInterface: none.\nDoes not claim: equivalence with coverings by at most `k` good sets (true for a decreasing family, not stated). -/\ndef IsKDecomposable {X : Type} [Fintype X] [DecidableEq X] (F : Realized" + }, + { + "kind": "def", + "unqualified_name": "obstruction", + "line": 219, + "source_header": ".univ : Finset (Fin k)).biUnion parts = U\n\n/-- The obstruction `O_K(D) = 2^X \\ I_K(D)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"O_k(D)=2^X\\I_k(D) for its obstruction\"\nInterface: none.\nDoes not claim: anything. -/\ndef obstruction {X : Type} [Fintype X] [DecidableEq X] (F : R" + }, + { + "kind": "def", + "unqualified_name": "IsGeneratorCover", + "line": 229, + "source_header": "inset X) :=\n {U | ¬ IsKDecomposable F K U}\n\n/-- `G` is a generator cover of `O_K(D)`: every obstructed set contains some `g in G`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"A generator cover G of O_k(D) means every obstructed set contains some g in G.\"\nInterface: none.\nDoes not claim: anything. -/\ndef IsGeneratorCover {X : Type} [Fintype X] [DecidableEq X] (F : RealizedData" + }, + { + "kind": "def", + "unqualified_name": "coverCost", + "line": 239, + "source_header": "inset X, U ∈ obstruction F K → ∃ g ∈ G, g ⊆ U\n\n/-- The exact optimal cover price `covercost_c(O_K(D))`: the infimum of the family prices of all\ngenerator covers of `O_K(D)`. The set of covers is finite and nonempty (`{empty set}` always\ncovers), so the infimum is a minimum; that fact is not proved here.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"Therefore the EXACT optimal cover price is\"\nInterface: none.\nDoes not claim: that the infimum is attained (finite, not proved here); for `c` with negative entries, outside the sources' domain, `sInf` of an unbounded set is Mathlib's default. -/\nnoncomputable def coverCost {X : Type} [Fintype X] [DecidableEq X] (" + }, + { + "kind": "def", + "unqualified_name": "mu", + "line": 251, + "source_header": "X), IsGeneratorCover F K G ∧ famPrice c G = t}\n\n/-- The product measure `mu_p(D)` of the downset: the sum over `U in D` of\n`prod_{v in U} p_v prod_{v notin U} (1 - p_v)`, written as a sum over `2^X` of the indicator of\n`D` times the weight.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"For EVERY independent original probability vector p in [0,1]^X,\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def mu {X : Type} [Fintype X] [De" + }, + { + "kind": "def", + "unqualified_name": "localGood", + "line": 262, + "source_header": ".powerset, Set.indicator (downset F) (weight p) U\n\n/-- The actual local good probability `mu_p(D_i) = P(U intersect X_i in D)`, with\n`D_i = D intersect 2^(X_i)`: the sum over subsets `S` of the block of the indicator of `D` times\nthe block-restricted weight.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \"Write q_i=P(U intersect X_i notin D_i) for the ACTUAL capacity restriction.\"\nInterface: none.\nDoes not claim: the identification `D_i = {S subset X_i : |S| <= a_i}` (that is `LocalRestriction`). -/\nnoncomputable def localGood {X : Type} [Fintype X] [DecidableEq X] (F" + }, + { + "kind": "def", + "unqualified_name": "localFailure", + "line": 275, + "source_header": "(∏ v ∈ S, p v) * ∏ v ∈ block F i \\ S, (1 - p v)) S\n\n/-- The local failure probability `q_i = P(U_i notin D_i) = 1 - mu_p(D_i)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"With q_i=P(U_i notin D_i),\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def localFailure {X : Type} [Fintype X] [DecidableEq X] (" + }, + { + "kind": "def", + "unqualified_name": "IsPaletteFeasible", + "line": 285, + "source_header": "p : X → ℝ) (i : Fin F.b) : ℝ :=\n 1 - localGood F p i\n\n/-! ## Palette demand -/\n\n/-- `K` is a feasible palette size for the clutter `H` and demands `d`: there are label sets\n`P_i subset {0, ..., K-1}` with `|P_i| >= d_i` and empty intersection over every `H`-edge\n(no label lies in `P_i` for all `i in e`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" intersection_(i in e) P_i = empty, for every e in H. (P6)\"\nInterface: none.\nDoes not claim: upward closure in `K` (true, not stated). -/\ndef IsPaletteFeasible (b : ℕ) (H" + }, + { + "kind": "def", + "unqualified_name": "paletteNumber", + "line": 299, + "source_header": "(P i).card) ∧\n ∀ e ∈ H, ∀ ℓ : Fin K, ∃ i ∈ e, ℓ ∉ P i\n\n/-- The palette demand `K_H(d)`: the least feasible palette size, as `sInf` of the feasible set\n(Mathlib's `sInf` on `ℕ` is the least element of a nonempty set and `0` for the empty set). The\nsources define it as \"the minimum size K\"; nonemptiness of the feasible set is the separate\n`Prop` `PaletteNumberAttained`, not proved here.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"Let K_H(d) be the minimum size K of an integer palette universe admitting subsets P_i with |P_i|>=d_i and\"\nInterface: none.\nDoes not claim: that the feasible set is nonempty; the source's remark that one may take `|P_i| = d_i`. -/\nnoncomputable def paletteNumbe" + }, + { + "kind": "def", + "unqualified_name": "PaletteNumberAttained", + "line": 311, + "source_header": "in b → ℕ) : ℕ :=\n sInf {K : ℕ | IsPaletteFeasible b H d K}\n\n/-- The feasible set of palette sizes is nonempty, i.e. `K_H(d)` is itself feasible (the minimum\nis attained), for every realized family.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"By discarding excess labels within blocks, one may take |P_i|=d_i.\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the statement (not proved here; disjoint palettes of sizes `d_i` are a witness in the sources' argument). -/\ndef PaletteNumb" + }, + { + "kind": "def", + "unqualified_name": "fullBlockFamily", + "line": 321, + "source_header": "F → IsPaletteFeasible F.b F.H F.d (paletteNumber F.b F.H F.d)\n\n/-- The specified cover: the family `G = {X_1, ..., X_b}` of full blocks.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"the fixed family G={X_1,...,X_b} covers O_K(D) if and only if\"\nInterface: none.\nDoes not claim: anything. -/\ndef fullBlockFamily {X : Type} [Fintype" + }, + { + "kind": "def", + "unqualified_name": "IsMinimalForbidden", + "line": 331, + "source_header": "Finset X) :=\n (Finset.univ : Finset (Fin F.b)).image (block F)\n\n/-! ## Realized covers: Propositions P1, P2 and the local covers (P3)-(P5) -/\n\n/-- `U` is an inclusion-minimal forbidden set: not good, and every proper subset obtained by\nremoving one element is good.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"The inclusion-minimal forbidden ORIGINAL sets are exactly\"\nInterface: none.\nDoes not claim: anything. -/\ndef IsMinimalForbidden {X : Type} [Fintyp" + }, + { + "kind": "def", + "unqualified_name": "IsTransversal", + "line": 344, + "source_header": "Finset X) : Prop :=\n ¬ IsGood F U ∧ ∀ v ∈ U, IsGood F (U.erase v)\n\n/-- `U` is a transversal `{x_i : i in e}` of the edge `e`: its support is `e` and it meets each\nblock of `e` in exactly one coordinate.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"(b) for each e in H, EVERY transversal {x_i:i in e}, with x_i in X_i.\"\nInterface: none.\nDoes not claim: anything. -/\ndef IsTransversal {X : Type} [Fintype X] [DecidableEq X]" + }, + { + "kind": "def", + "unqualified_name": "MinimalForbiddenCharacterisation", + "line": 355, + "source_header": "inset X) : Prop :=\n supp F U = e ∧ ∀ i ∈ e, (U ∩ block F i).card = 1\n\n/-- Proposition P1: the inclusion-minimal forbidden sets are exactly (a) the `(a_i+1)`-subsets\nof a single block and (b) the transversals of the edges of `H`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"(a) every (a_i+1)-subset of a single X_i;\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the characterisation (statement only); its completeness clause is what the source calls \"completeness, not just existence of some witnesses\". -/\ndef MinimalForbiddenCharacterisation" + }, + { + "kind": "def", + "unqualified_name": "LocalRestriction", + "line": 367, + "source_header": ", U ⊆ block F i ∧ U.card = F.a i + 1) ∨ ∃ e ∈ F.H, IsTransversal F e U)\n\n/-- Display (P2): the actual local restriction is `D_i = D intersect 2^(X_i) = {S subset X_i :\n|S| <= a_i}`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"D_i=D intersect 2^(X_i)={S subset X_i: |S|<=a_i}. (P2)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the identity (statement only). -/\ndef LocalRestr" + }, + { + "kind": "def", + "unqualified_name": "LocalDecomposability", + "line": 378, + "source_header": "in F.b) (S : Finset X), S ⊆ block F i →\n (IsGood F S ↔ S.card ≤ F.a i)\n\n/-- Section 3: `I_k(D_i) = {S : |S| <= a_i k}` for subsets `S` of the block `X_i`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" I_k(D_i)={S:|S|<=a_i k}.\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the identity (statement only). -/\ndef LocalDecompo" + }, + { + "kind": "def", + "unqualified_name": "LocalObstructionIsFullBlock", + "line": 388, + "source_header": "Finset X), S ⊆ block F i →\n (IsKDecomposable F k S ↔ S.card ≤ F.a i * k)\n\n/-- Display (P3): for `k = d_i` the only obstructed subset of `X_i` is `X_i` itself, so\n`G_i = {X_i}` is an exact local obstruction cover.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" G_i={X_i} (P3)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the statement (statement only). -/\ndef LocalObstructionIsFul" + }, + { + "kind": "def", + "unqualified_name": "LocalPriceChain", + "line": 400, + "source_header": "inset X), S ⊆ block F i →\n (¬ IsKDecomposable F (F.d i) S ↔ S = block F i)\n\n/-- Display (P4): for `0 <= c_v <= p_v <= 1`, `price(G_i) = prod_{v in X_i} c_v <= prod p_v\n<= q_i <= phi(q_i)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" =P(U_i=X_i)<=q_i<=phi(q_i), (P4)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis; `p`, `c` with the displayed ranges.\nDoes not claim: the chain (statement only); the identity `prod p_v = P(U_i = X_i)` is the definition of the weight. -/\ndef Loc" + }, + { + "kind": "def", + "unqualified_name": "IndependentBlockHazard", + "line": 413, + "source_header": "p v ≤ localFailure F p i ∧\n localFailure F p i ≤ phi (localFailure F p i)\n\n/-- Display (P5) (also (T6)): `mu_p(D) <= prod_i (1 - q_i)` and, when `mu_p(D) > 0`,\n`sum_i q_i <= -log prod_i (1 - q_i) <= -log mu_p(D)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" <=-log(product_i(1-q_i))<=-log mu_p(D). (P5)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis; `p in [0,1]^X`.\nDoes not claim: the inequalities (statement only); independence of crossing events (\"Crossing events are not declared independent\"). -/\ndef Independ" + }, + { + "kind": "def", + "unqualified_name": "FullBlockCoverIff", + "line": 427, + "source_header": "e F p i)) ∧\n -Real.log (∏ i, (1 - localFailure F p i)) ≤ -Real.log (mu F p))\n\n/-! ## Realized covers: the full-block cover criterion (P7) and the hazard bound (P8) -/\n\n/-- Proposition P2, display (P7): the fixed family `G = {X_1, ..., X_b}` covers `O_K(D)` if and\nonly if `K >= K_H(d)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" K>=K_H(d). (P7)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis; `K_H(d)` is `paletteNumber`.\nDoes not claim: the criterion (statement only); optimality of any other cover (\"It does not prove that no different cover with the same budget works at fewer colors\"); unrestricted prize optimality; disposition transcribed from LANDING_CLAIMS for p15-realized-covers: HOLD_WITH_DOMAIN; nonauthor review and acceptance are not claimed here. -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "CoverCostHazardBound", + "line": 440, + "source_header": "∀ K : ℕ,\n IsGeneratorCover F K (fullBlockFamily F) ↔ paletteNumber F.b F.H F.d ≤ K\n\n/-- Display (P8): for `0 <= c_v <= p_v <= 1` and `K >= K_H(d)`,\n`covercost_c(O_K(D)) <= min(1, -log mu_p(D))`, with the endpoint convention of `cappedHazard`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"covercost_c(O_K(D)) <= min(1,-log mu_p(D)). (P8)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis; `p in [0,1]^X`; prices in the range `0 <= c_v <= p_v` only (\"No assertion is made here for the additional prices p_v p_v`; the unrestricted P15 prize; original P15-B; disposition transcribed from LANDING_CLAIMS for p15-realized-covers: HOLD_WITH_DOMAIN; nonauthor review and acceptance are not claimed here. -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "WholeGroundChromaticNumber", + "line": 451, + "source_header": "∀ K : ℕ, paletteNumber F.b F.H F.d ≤ K → coverCost F K c ≤ cappedHazard 1 (mu F p)\n\n/-- Section 4 comparison: the chromatic number of the ENTIRE ground set `X` (the least `K` with\n`X in I_K(D)`) is `K_H(d+1)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"the chromatic number of the ENTIRE ground set X is K_H(d+1), because ceil(n_i/a_i)=d_i+1.\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis.\nDoes not claim: the statement (statement only). -/\ndef WholeGro" + }, + { + "kind": "def", + "unqualified_name": "completeClutter", + "line": 463, + "source_header": ": ℕ,\n IsKDecomposable F K Finset.univ ↔ paletteNumber F.b F.H (fun i => F.d i + 1) ≤ K\n\n/-! ## Realized covers Section 5: the elementary palette formula (P9) -/\n\n/-- The clutter of all `(s+1)`-subsets of `b` block indices.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"A fully elementary case is H consisting of all (s+1)-subsets of b indices, 1<=s<=b.\"\nInterface: none.\nDoes not claim: anything; for `s = b` the famil" + }, + { + "kind": "def", + "unqualified_name": "ElementaryPaletteFormula", + "line": 474, + "source_header": "(b s : ℕ) : Finset (Finset (Fin b)) :=\n (Finset.univ : Finset (Fin b)).powersetCard (s + 1)\n\n/-- Display (P9): for `H` all `(s+1)`-subsets of `b` indices, `1 <= s <= b`, and positive\ndemands, `K_H(d) = max(max_i d_i, ceil(sum_i d_i / s))`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" K_H(d)=max(max_i d_i, ceil(sum_i d_i/s)). (P9)\"\nInterface: none; the positivity of the demands is the sources' standing assumption (\"positive integers a_i,d_i\"), added as a hypothesis.\nDoes not claim: the formula (statement only); t" + }, + { + "kind": "def", + "unqualified_name": "TriangleNeedsThree", + "line": 486, + "source_header": "ber b (completeClutter b s) d =\n max (Finset.univ.sup d) ⌈((∑ i, d i : ℕ) : ℚ) / (s : ℚ)⌉₊\n\n/-- Section 5: the triangle on three block indices (all `2`-subsets) at unit demands needs `3`\ncolors.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"at unit demands needs3 colors, although a formula considering only size-two edge loads would give2.\"\nInterface: none.\nDoes not claim" + }, + { + "kind": "def", + "unqualified_name": "benchmark816", + "line": 496, + "source_header": "le). -/\ndef TriangleNeedsThree : Prop :=\n paletteNumber 3 (completeClutter 3 1) (fun _ => 1) = 3\n\n/-! ## Realized covers Section 6: the six-block 816-label realization -/\n\n/-- The six-block realization: ground type `Fin 6 × Fin 409` (six blocks of `409` coordinates,\n`2454` in all), block map the first projection, `a_i = 1`, `d_i = 408`, and `H` all `15`\nfour-block subsets.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"Take six blocks, a_i=1 and d_i=408. Thus EACH original block has409 vertices and the original ground set has2454 vertices. H consists of all15 four-block subsets.\"\nInterface: none; a concrete data record.\nDoes not claim: that it satisfies `IsRealizedFamily` (that is `Benchmark816IsRealized`); that any earlier six-block application had these coordinates (\"it is not a statement that every earlier six-block ap" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816IsRealized", + "line": 513, + "source_header": "09) where\n b := 6\n blk := Prod.fst\n a := fun _ => 1\n d := fun _ => 408\n H := completeClutter 6 3\n\n/-- The six-block data satisfy the side conditions of a realized family.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"Every D-color class contains at most one vertex per block and occupies at most three blocks.\"\nInterface: none.\nDoes not claim" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816Palette", + "line": 522, + "source_header": "in principle; not proved here). -/\ndef Benchmark816IsRealized : Prop :=\n IsRealizedFamily benchmark816\n\n/-- Section 6: `K_H(408, ..., 408) = 816` for `H` all four-block subsets of six.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" K_H(408,...,408)=816.\"\nInterface: none.\nDoes not claim: the value (statement only); the arithmetic" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816Cover", + "line": 531, + "source_header": "t here. -/\ndef Benchmark816Palette : Prop :=\n paletteNumber 6 (completeClutter 6 3) (fun _ => 408) = 816\n\n/-- Section 6: the six full blocks cover the obstruction at `816` colors and not at `815`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"At816 colors it covers the obstruction; at815 it does not, because omitting one vertex from each block leaves2448 vertices, each color holds at most3, and815*3<2448.\"\nInterface: none.\nDoes not claim: the statement (finite over `2^2454` subsets" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816WholeGround", + "line": 541, + "source_header": "816 (fullBlockFamily benchmark816) ∧\n ¬ IsGeneratorCover benchmark816 815 (fullBlockFamily benchmark816)\n\n/-- Section 6: the whole ground set needs `818` colors (`2454/3 = 818`): it is `818`-decomposable\nand not `817`-decomposable.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \"The whole ground set, unlike the cover-avoiding sets, needs818 colors, since2454/3=818.\"\nInterface: none.\nDoes not claim: the st" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816MinimalForbiddenCounts", + "line": 551, + "source_header": "und : Prop :=\n IsKDecomposable benchmark816 818 Finset.univ ∧ ¬ IsKDecomposable benchmark816 817 Finset.univ\n\n/-- Display (P10): the minimal forbidden sets of the six-block realization are\n`6 * binom(409, 2)` internal pairs (support of size one) and `15 * 409^4` crossing transversal\nquadruples (support of size four), and nothing else.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" 15*409^4=419743994415 crossing transversal quadruples. (P10)\"\nInterface: none.\nDoes not claim: the counts (statement only); the evaluations `500616` and `419743994415` are core-Lean targets on main; the source stresses these are \"not a claim tha" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816Price", + "line": 567, + "source_header": "rd {U : Finset (Fin 6 × Fin 409) | IsMinimalForbidden benchmark816 U} =\n 6 * Nat.choose 409 2 + 15 * 409 ^ 4\n\n/-- Section 6: at `p_v = c_v = 1/40900` the cover price of the six full blocks is exactly\n`6/(40900^409) > 0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" 6/(40900^409)>0.\"\nInterface: none.\nDoes not claim:" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816UnionBound", + "line": 578, + "source_header": "Price (fun _ => (1 : ℝ) / 40900) (fullBlockFamily benchmark816) = 6 / 40900 ^ 409 ∧\n (0 : ℝ) < 6 / 40900 ^ 409\n\n/-- Display (P11): at `p_v = 1/40900`, `Q = 1 - mu_p(D) <= 500616/40900^2 + 15/100^4 =\n2449227/8180000000 < 3/10000`, and the good probability exceeds `0.9997`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md sha256 c0dbb821fb57b685a20cc321e4074456f39a9697f3104afd1f728e4732179bb9\nAnchor: \" =2449227/8180000000 < 3/10000. (P11)\"\nInterface: none.\nDoes not claim: the bound (statement only; \"only a union bound, not an equality of the global" + }, + { + "kind": "def", + "unqualified_name": "twoCoord", + "line": 591, + "source_header": "0000 ∧\n (2449227 / 8180000000 : ℝ) < 3 / 10000 ∧\n (9997 / 10000 : ℝ) < mu benchmark816 (fun _ => (1 : ℝ) / 40900)\n\n/-! ## Price boundary: the exact two-coordinate refutation at demand one -/\n\n/-- The smallest one-block member: `X = {x, y}`, `a_1 = d_1 = 1`, no edges.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"The prescribed cover is {{x,y}" + }, + { + "kind": "def", + "unqualified_name": "twoCoordP", + "line": 606, + "source_header": "-/\ndef twoCoord : RealizedData (Fin 2) where\n b := 1\n blk := fun _ => 0\n a := fun _ => 1\n d := fun _ => 1\n H := ∅\n\n/-- The probabilities `p_x = p_y = 1/2` of the refutation.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"Take independent original probabilities p" + }, + { + "kind": "def", + "unqualified_name": "twoCoordC", + "line": 614, + "source_header": "ces c_x=c_y=2/3.\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def twoCoordP : Fin 2 → ℝ := fun _ => 1 / 2\n\n/-- The prices `c_x = c_y = 2/3` of the refutation.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"These are admissible TRANSFORMED prices: phi(1/2)=log 2>2/3.\"\nInterfa" + }, + { + "kind": "def", + "unqualified_name": "TwoCoordGeneratorPrices", + "line": 622, + "source_header": "claim: admissibility (that is part of `DemandOneRefutation`). -/\nnoncomputable def twoCoordC : Fin 2 → ℝ := fun _ => 2 / 3\n\n/-- The four generator costs `1, 2/3, 2/3, 4/9` of the empty set, the two singletons and `X`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"The possible generator costs are1,2/3,2/3,4/9 for the empty\"\nInterface: none.\nDoes not claim" + }, + { + "kind": "def", + "unqualified_name": "DemandOneRefutation", + "line": 632, + "source_header": "woCoordC ∅ = 1 ∧ genPrice twoCoordC {0} = 2 / 3 ∧ genPrice twoCoordC {1} = 2 / 3 ∧\n genPrice twoCoordC Finset.univ = 4 / 9\n\n/-- The exact refutation: the data are a realized family with `K_H(d) = 1` and one-piece\nobstruction `{X}`; the prices are admissible transformed prices (`phi(1/2) = log 2 > 2/3`);\n`mu_p(D) = 3/4`, `min(1, -log mu_p(D)) = log(4/3) < 1/3`; every cover costs at least `4/9`,\n`covercost_c(O_1(D)) = 4/9 > 1/3 > log(4/3)`; hence the capped hazard is strictly below the\nexact cover cost at the same palette.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \" covercost_c(O_1(D))=4/9 > 1/3 > log(4/3).\"\nInterface: none; everything is concrete.\nDoes not claim: the statement (statement only; the finite parts are decidable in principle, the two logarithm inequalities are analysis); that this contradicts original P15-B (\"It does not contradict the original P15-B amalgamation\"); anything about the `408`-scale or the unrestricted prize; the integral representation `log 2 = 2 integral_0^(1/3) 1/(1-t^2) dt` is not specified; disposition transcribed from LANDING_CLAIMS for p1" + }, + { + "kind": "def", + "unqualified_name": "LogOnePlusBelowIdentity", + "line": 654, + "source_header": "twoCoord 1 twoCoordC = 4 / 9 ∧ (1 / 3 : ℝ) < 4 / 9 ∧\n cappedHazard 1 (mu twoCoord twoCoordP) < coverCost twoCoord 1 twoCoordC\n\n/-- The elementary inequality `log(1 + x) < x` for `x > 0` used by the refutation.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/P15_PRICE_BOUNDARY.md sha256 498af650ef7139c39d2630561dbfd0822c495ce6308a6cac8b767aefe0c2a40b\nAnchor: \"using log(1+x)0.\"\nInterface: none.\nD" + }, + { + "kind": "def", + "unqualified_name": "LogRatioBound", + "line": 663, + "source_header": "ly; the source proves it, this module does not). -/\ndef LogOnePlusBelowIdentity : Prop :=\n ∀ x : ℝ, 0 < x → Real.log (1 + x) < x\n\n/-! ## Price budget: the restricted transformed-price extension (T1)-(T5), (T7) -/\n\n/-- Display (T2): `-log(1 - p) <= p/(1 - p)` for `0 <= p < 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" -log(1-p)=integral_0^p dt/(1-t) <= p/(1-p). (T2)\"\nInterf" + }, + { + "kind": "def", + "unqualified_name": "RatioExponentBound", + "line": 674, + "source_header": "e integral representation is not specified. -/\ndef LogRatioBound : Prop :=\n ∀ p : ℝ, 0 ≤ p → p < 1 → -Real.log (1 - p) ≤ p / (1 - p)\n\n/-- The exponent arithmetic of display (T3): for `a >= 1` and `n >= 2a + 1`,\n`4^(a+1)/3^n <= (4/3)(4/9)^a <= 16/27`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" <= (4/3)*(4/9)^a <=16/27. (T3)\"\nInterface: none.\nDoes not claim: the inequalities (statement only); the preceding ratio steps of (T3) (price over `prod_{v in S} p_v`) are stated through their cons" + }, + { + "kind": "def", + "unqualified_name": "RestrictedLocalBudget", + "line": 685, + "source_header": "rop :=\n ∀ a n : ℕ, 1 ≤ a → 2 * a + 1 ≤ n →\n (4 : ℝ) ^ (a + 1) / 3 ^ n ≤ (4 / 3) * (4 / 9) ^ a ∧ (4 / 3 : ℝ) * (4 / 9) ^ a ≤ 16 / 27\n\n/-- Display (T4): under `a_i >= 1`, `d_i >= 2`, `0 <= p_v <= 1/4` and `0 <= c_v <= phi(p_v)`, the\nfull-block generator satisfies `price({X_i}) <= (16/27) q_i <= phi(q_i)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" price({X}) <= (16/27)q <= phi(q). (T4)\"\nInterface: the family data `F` with `IsRealizedFamily F` and `d_i >= 2` as hypotheses.\nDoes not claim: the bound (statement only); the source notes \"The extra demand hypothesis d>=2 is load-bearing\" and that `p_v <= 1/4` \"is a sufficient" + }, + { + "kind": "def", + "unqualified_name": "RestrictedTransformedPriceBudget", + "line": 698, + "source_header": "∀ i : Fin F.b, genPrice c (block F i) ≤ (16 / 27) * localFailure F p i ∧\n (16 / 27) * localFailure F p i ≤ phi (localFailure F p i)\n\n/-- The restricted transformed-price extension, display (T1): for every realized family with\n`a_i >= 1`, `d_i >= 2`, independent `0 <= p_v <= 1/4`, EVERY `0 <= c_v <= phi(p_v)` and the SAME\n`K >= K_H(d)`, `covercost_c(O_K(D)) <= min(1, (16/27)[-log mu_p(D)])`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" covercost_c(O_K(D)) <= min(1,(16/27)*[-log mu_p(D)]). (T1)\"\nInterface: the family data `F` with `IsRealizedFamily F` and `d_i >= 2` as hypotheses; `K_H(d)` is `paletteNumber`; the zero-probability endpoint follows the `cappedHazard` convention.\nDoes not claim: the bound (statement only); any retraction of the demand-one refutation; the unrestricted prize; new classical coloring theory; disposition transcribed from LANDING_CLAIMS for p15-price-budget-restricted: HOLD_WITH_DOMAIN; nonauthor review (\"nonauthor review open\") and acce" + }, + { + "kind": "def", + "unqualified_name": "rhoTest", + "line": 713, + "source_header": ") → (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →\n ∀ K : ℕ, paletteNumber F.b F.H F.d ≤ K →\n coverCost F K c ≤ cappedHazard (16 / 27) (mu F p)\n\n/-- The sufficient ratio `rho(a, d, p_*) = p_*^(ad - a) / (1 - p_*)^(ad + 1)` of display (T5).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" rho(a,d,p_*)=p_*^(ad-a)/(1-p_*)^(ad+1). (T5)\"\nInterface: none; natural-number" + }, + { + "kind": "def", + "unqualified_name": "RhoTestSufficient", + "line": 722, + "source_header": "1`.\nDoes not claim: anything. -/\nnoncomputable def rhoTest (a d : ℕ) (pBound : ℝ) : ℝ :=\n pBound ^ (a * d - a) / (1 - pBound) ^ (a * d + 1)\n\n/-- Display (T5) as a sufficient test, block by block: if a common upper bound `p_* < 1` has\n`0 <= p_v <= p_*` for every coordinate `v` of the block `X_i` and `rho(a_i, d_i, p_*) <= 1`, then\nfor all `0 <= c_v <= phi(p_v)` the full-block price is at most `q_i`. The source: \"This is only a\nsufficient test; rho>1 is not a counterexample and must not be labeled infeasible.\"\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \"If rho<=1 the same argument proves price({X})<=q for that block.\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesis; the bound `p_*` is imposed only on the coordinates of the block under test (the source: \"for any common upper bound p_*<1\", \"for that block\"), the price bound `0 <= c_v <= phi(p_v)` on every coordinate as in (T1).\nDoes not claim: the statement (statement only); anything when `rho > 1` (the source: a bloc" + }, + { + "kind": "def", + "unqualified_name": "CapTestAtTwoThirds", + "line": 738, + "source_header": "n F.b, (∀ v ∈ block F i, 0 ≤ p v ∧ p v ≤ pBound) →\n rhoTest (F.a i) (F.d i) pBound ≤ 1 →\n genPrice c (block F i) ≤ localFailure F p i\n\n/-- Section 5 of the price budget: the cap test `q >= 2/3` gives `phi(q) = 1`, since `log 3 > 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \"or if q>=2/3 (then phi(q)=1, since log3>1)\"\nInterface: none.\nDoes not claim: the statement (statement" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816TransformedRange", + "line": 747, + "source_header": "e checker program of that section is not specified. -/\ndef CapTestAtTwoThirds : Prop :=\n 1 < Real.log 3 ∧ ∀ q : ℝ, 2 / 3 ≤ q → q ≤ 1 → phi q = 1\n\n/-- Section 4 of the price budget: for the six-block realization at `p_v = 1/40900`, the SAME\n`816`-label full-block cover is valid for the FULL transformed range\n`0 <= c_v <= log(40900/40899)` (which is `phi(1/40900)`): it covers `O_816(D)` and its price meets\nthe (T1) budget `min(1, (16/27)[-log mu_p(D)])`; consequently so does the optimal cover cost.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" 0<=c_v<=log(40900/40899),\"\nInterface: none; the specified cover is `fullBlockFamily benchmark816`; the last conjunct is the (T1) consequence for the infimum over all covers.\nDoes not claim: the stateme" + }, + { + "kind": "def", + "unqualified_name": "Benchmark816RationalPrice", + "line": 765, + "source_header": "k816 (fun _ => (1 : ℝ) / 40900)) ∧\n coverCost benchmark816 816 c ≤\n cappedHazard (16 / 27) (mu benchmark816 (fun _ => (1 : ℝ) / 40900))\n\n/-- Display (T7) and the explicit rational price of Section 4: at maximal equal prices the union\nprice is `6 log(40900/40899)^409 <= 6/(40899^409)`; `c = p + p^2/2 = 81801/3345620000` for\n`p = 1/40900` is admissible (`c < phi(p)`) and its cover price is exactly `6 c^409`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/price_budget_20260924/PROOF.md sha256 3b79d2de60d77df9dd0d81cea60935d3dbceeb26fcf2d38d62667a425180a535\nAnchor: \" 6*log(40900/40899)^409 <=6/(40899^409). (T7)\"\nInterface: none.\nDoes not claim: the statements (statement only); the rational identity `1/40900 + (1/40900)^2/2 = 81801/3345620000` is exact arithmetic not re-p" + }, + { + "kind": "def", + "unqualified_name": "pStar", + "line": 780, + "source_header": "345620000 : ℝ) < phi (1 / 40900) ∧\n famPrice (fun _ => (81801 : ℝ) / 3345620000) (fullBlockFamily benchmark816) =\n 6 * (81801 / 3345620000) ^ 409\n\n/-! ## Full price: constants (F1), the result (F2) and the enclosure (F3) -/\n\n/-- `p_star = 1 - exp(-1)`, display (F1).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b" + }, + { + "kind": "def", + "unqualified_name": "hStar", + "line": 790, + "source_header": "bd6f5967b53c4178590da993f9\nAnchor: \" p_star=1-exp(-1),\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def pStar : ℝ := 1 - Real.exp (-1)\n\n/-- `h_star = 3 - log(3e - 2)`, display (F1); ASCII `3e-2` of the source means `3*e - 2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53" + }, + { + "kind": "def", + "unqualified_name": "rhoStar", + "line": 798, + "source_header": "-log(3e-2),\"\nInterface: none.\nDoes not claim: `h_star > 1` (that is `HStarExceedsOne`). -/\nnoncomputable def hStar : ℝ := 3 - Real.log (3 * Real.exp 1 - 2)\n\n/-- `rho_star = 1/h_star = 1/(3 - log(3e - 2))`, display (F1); written out so that it is\ndefinitionally `1 / hStar`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" rho_star=1/h_star. (F1)\"\nInterf" + }, + { + "kind": "def", + "unqualified_name": "rhoStarLower", + "line": 807, + "source_header": "3) or `rho_star < 6/7` (those are `RhoStarEnclosure`, `RhoStarBelowSixSevenths`). -/\nnoncomputable def rhoStar : ℝ := 1 / (3 - Real.log (3 * Real.exp 1 - 2))\n\n/-- Lower endpoint `0.84547981724898672067` of display (F3), as a rational over `10^20`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd032" + }, + { + "kind": "def", + "unqualified_name": "rhoStarUpper", + "line": 815, + "source_header": "hor: \" 0.84547981724898672067 < rho_star\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def rhoStarLower : ℝ := 84547981724898672067 / 10 ^ 20\n\n/-- Upper endpoint `0.84547981724898672068` of display (F3), as a rational over `10^20`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" < 0.84547981724898672068 < 6/7. (F3)\"\nInter" + }, + { + "kind": "def", + "unqualified_name": "FullTransformedPriceBudget", + "line": 823, + "source_header": "ng; adjacency of the endpoints and `upper * 7 < 6 * 10^20` are core-Lean targets on main. -/\nnoncomputable def rhoStarUpper : ℝ := 84547981724898672068 / 10 ^ 20\n\n/-- The headline result F, display (F2): for every realized family with `a_i >= 1`, `d_i >= 2`,\nEVERY independent `p in [0,1]^X`, every `0 <= c_v <= phi(p_v)` and the SAME `K >= K_H(d)`,\n`covercost_c(O_K(D)) <= min(1, rho_star [-log mu_p(D)])`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" covercost_c(O_K(D)) <= min(1,rho_star[-log mu_p(D)]). (F2)\"\nInterface: the family data `F` with `IsRealizedFamily F` and `d_i >= 2` as hypotheses; `K_H(d)` is `paletteNumber`; the zero-probability endpoints follow the `cappedHazard` convention (\"the price-one cap proves the assertion\").\nDoes not claim: the bound (statement only); optimality of `rho_star` (that is `SharpnessOfRhoStar`); any unrestricted downset or prize statement (the source: \"palette size remains K_H(d), which can depend on H and d\"); the nonauthor review recorded in LANDING_CL" + }, + { + "kind": "def", + "unqualified_name": "RhoStarEnclosure", + "line": 837, + "source_header": "X → ℝ), (∀ v, 0 ≤ p v ∧ p v ≤ 1) → (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →\n ∀ K : ℕ, paletteNumber F.b F.H F.d ≤ K → coverCost F K c ≤ cappedHazard rhoStar (mu F p)\n\n/-- Display (F3): `0.84547981724898672067 < rho_star < 0.84547981724898672068 < 6/7`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" 0.84547981724898672067 < rho_star\"\nInterface: none.\nDoes not claim: the enclosure (statement only; the source's `full_price.py` Fraction procedure is not a kernel proof and is not" + }, + { + "kind": "def", + "unqualified_name": "RhoStarBelowSixSevenths", + "line": 846, + "source_header": "L_VERIFICATION_ROLLOUT_20260927.md`, still at `specified`. -/\ndef RhoStarEnclosure : Prop :=\n rhoStarLower < rhoStar ∧ rhoStar < rhoStarUpper ∧ rhoStarUpper < 6 / 7\n\n/-- The simpler rational factor: `rho_star < 6/7`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"Thus 6/7 is a simpler valid" + }, + { + "kind": "def", + "unqualified_name": "IsProperDownset", + "line": 855, + "source_header": "terface: none.\nDoes not claim: the inequality (statement only); `16/27 < 6/7` is a core-Lean target on main. -/\ndef RhoStarBelowSixSevenths : Prop :=\n rhoStar < 6 / 7\n\n/-! ## Full price Section 2: the hazard interpolation bounds (F4)-(F8) -/\n\n/-- `A` is a proper decreasing family containing the empty set: `empty in A`, `X notin A`, and\n`A` is closed under taking subsets.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"Let A be any proper decreasing fa" + }, + { + "kind": "def", + "unqualified_name": "hazardCoord", + "line": 867, + "source_header": "oes not claim: anything. -/\ndef IsProperDownset {Y : Type} [Fintype Y] (A : Finset (Finset Y)) : Prop :=\n ∅ ∈ A ∧ Finset.univ ∉ A ∧ ∀ U ∈ A, ∀ V : Finset Y, V ⊆ U → V ∈ A\n\n/-- `F_A(t) = -log mu_(p(t))(A)` with `p_i(t) = 1 - exp(-t_i)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" p_i(t)=1-exp(-t_i)," + }, + { + "kind": "def", + "unqualified_name": "hazardStar", + "line": 877, + "source_header": "g. -/\nnoncomputable def hazardCoord {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y))\n (t : Y → ℝ) : ℝ :=\n -Real.log (muOf A (fun i => 1 - Real.exp (-t i)))\n\n/-- `H_A = F_A(1, ..., 1) = -log mu_(p_star, ..., p_star)(A)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" H_A=F_A(1,...,1)>0.\"" + }, + { + "kind": "def", + "unqualified_name": "HazardStarPositive", + "line": 886, + "source_header": "ity (that is `HazardStarPositive`). -/\nnoncomputable def hazardStar {Y : Type} [Fintype Y] [DecidableEq Y] (A : Finset (Finset Y)) : ℝ :=\n -Real.log (muOf A (fun _ => pStar))\n\n/-- `H_A > 0` for every proper decreasing family on `n >= 1` coordinates containing the empty set.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"The probability is positive on this compact cube because the e" + }, + { + "kind": "def", + "unqualified_name": "CoordinatewiseConcavity", + "line": 895, + "source_header": "esis.\nDoes not claim: the statement (statement only). -/\ndef HazardStarPositive : Prop :=\n ∀ (n : ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A → 0 < hazardStar A\n\n/-- Display (F5) as separate coordinatewise concavity of `F_A` on `[0,1]` in each coordinate,\nthe other coordinates held fixed in `[0,1]`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"Only SEPARATE coordinatewise concavity is asserted; joint concavity is not needed or claimed.\"\nInterface: `A` with `IsProperDownset A` as hypothesis.\nDoes not claim: t" + }, + { + "kind": "def", + "unqualified_name": "HazardProductBound", + "line": 907, + "source_header": "≤ n → IsProperDownset A →\n ∀ (i : Fin n) (t : Fin n → ℝ), (∀ j, 0 ≤ t j ∧ t j ≤ 1) →\n ConcaveOn ℝ (Set.Icc (0 : ℝ) 1) (fun s : ℝ => hazardCoord A (Function.update t i s))\n\n/-- Display (F6): `F_A(t) >= (prod_i t_i) H_A` on the cube `[0,1]^n`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" F_A(t) >= (pro" + }, + { + "kind": "def", + "unqualified_name": "HazardPhiBound", + "line": 917, + "source_header": "uctBound : Prop :=\n ∀ (n : ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A →\n ∀ t : Fin n → ℝ, (∀ j, 0 ≤ t j ∧ t j ≤ 1) → (∏ i, t i) * hazardStar A ≤ hazardCoord A t\n\n/-- Display (F7): for `p in [0,1]^n` with `mu_p(A) > 0`, `-log mu_p(A) >= H_A prod_i phi(p_i)`;\nwhen `mu_p(A) = 0` the source reads the inequality as an extended one and nothing is stated.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" -log mu_" + }, + { + "kind": "def", + "unqualified_name": "FullGroundPriceBound", + "line": 929, + "source_header": "ℕ) (A : Finset (Finset (Fin n))), 1 ≤ n → IsProperDownset A →\n ∀ p : Fin n → ℝ, (∀ j, 0 ≤ p j ∧ p j ≤ 1) → 0 < muOf A p →\n hazardStar A * ∏ i, phi (p i) ≤ -Real.log (muOf A p)\n\n/-- Display (F8): for transformed prices `0 <= c_i <= phi(p_i)`,\n`prod_i c_i <= min(1, [-log mu_p(A)]/H_A)`, with the `cappedHazard` endpoint convention.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" product_i c_i <= min(1, [-log mu_p(A)]/H_A). (F8)\"\nInterface: `A` with `IsProperDownset A` as hypothesis.\nDoes not claim: the inequality (st" + }, + { + "kind": "def", + "unqualified_name": "PhiAtPStar", + "line": 941, + "source_header": "(Fin n))), 1 ≤ n → IsProperDownset A →\n ∀ (p c : Fin n → ℝ), (∀ j, 0 ≤ p j ∧ p j ≤ 1) → (∀ j, 0 ≤ c j ∧ c j ≤ phi (p j)) →\n ∏ i, c i ≤ cappedHazard (1 / hazardStar A) (muOf A p)\n\n/-- `phi(p_star) = 1`: at the reference vector `p_i = p_star`, `c_i = 1`, the two sides of (F7)\nare equal.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f596" + }, + { + "kind": "def", + "unqualified_name": "FullGroundBudgetIff", + "line": 951, + "source_header": "Anchor: \"at every p_i=p_star and every c_i=1, the two sides of (F7) are equal\"\nInterface: none.\nDoes not claim: the identity (statement only). -/\ndef PhiAtPStar : Prop :=\n phi pStar = 1\n\n/-- Exactness of `1/H_A`: a full-ground generator universally meets the capped hazard budget\n(for all `p in [0,1]^n` and all transformed prices) precisely when `H_A >= 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"a full-ground generator universally meets the capped hazard budget precisely when H_A>=1\"\nInterface: `A` with `I" + }, + { + "kind": "def", + "unqualified_name": "capacityFamily", + "line": 963, + "source_header": "n))), 1 ≤ n → IsProperDownset A →\n ((∀ (p c : Fin n → ℝ), (∀ j, 0 ≤ p j ∧ p j ≤ 1) → (∀ j, 0 ≤ c j ∧ c j ≤ phi (p j)) →\n ∏ i, c i ≤ cappedHazard 1 (muOf A p)) ↔ 1 ≤ hazardStar A)\n\n/-! ## Full price Section 3: capacity families and the sharp worst case (F9)-(F11) -/\n\n/-- The capacity family `{S subset {0, ..., n-1} : |S| <= a}`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd" + }, + { + "kind": "def", + "unqualified_name": "binomTail", + "line": 974, + "source_header": "on n coordinates,\"\nInterface: none.\nDoes not claim: anything. -/\ndef capacityFamily (n a : ℕ) : Finset (Finset (Fin n)) :=\n (Finset.univ : Finset (Fin n)).powerset.filter (fun U => U.card ≤ a)\n\n/-- The binomial lower tail `P(Bin(n, p) <= a) = sum_{j <= a} C(n, j) p^j (1 - p)^(n - j)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326af" + }, + { + "kind": "def", + "unqualified_name": "CapacityHazardIsBinomial", + "line": 983, + "source_header": "(F9)\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def binomTail (n a : ℕ) (p : ℝ) : ℝ :=\n ∑ j ∈ Finset.range (a + 1), (Nat.choose n j : ℝ) * p ^ j * (1 - p) ^ (n - j)\n\n/-- Display (F9): `H_(n,a) = -log P(Bin(n, p_star) <= a)`, i.e. the product measure of the\ncapacity family at `p_star` is the binomial tail.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" H_(n,a)=-log" + }, + { + "kind": "def", + "unqualified_name": "OddMajorityIdentity", + "line": 993, + "source_header": "e identity (statement only; a finite identity for each `n`, general in `n`). -/\ndef CapacityHazardIsBinomial : Prop :=\n ∀ n a : ℕ, hazardStar (capacityFamily n a) = -Real.log (binomTail n a pStar)\n\n/-- Display (F10): for `S ~ Bin(2a+1, p)`,\n`P(Bin(2a+3, p) <= a+1) - P(S <= a) = (1-p)^2 P(S = a+1) - p^2 P(S = a) = p(1-2p) P(S = a)`, and\nthis is negative for `1/2 < p < 1` (the source writes `p > 1/2`; at `p = 1` the difference is\n`0`, so the strict inequality is stated for `p < 1`, which covers `p_star`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" =p(1-2p)P(S=a)<0. (F10)\"\nI" + }, + { + "kind": "def", + "unqualified_name": "CapacityWorstCase", + "line": 1011, + "source_header": "Tail (2 * a + 1) a p =\n p * (1 - 2 * p) * ((Nat.choose (2 * a + 1) a : ℝ) * p ^ a * (1 - p) ^ (a + 1)) ∧\n (1 / 2 < p → p < 1 → binomTail (2 * a + 3) (a + 1) p - binomTail (2 * a + 1) a p < 0)\n\n/-- Display (F11): for `a >= 1` and `n >= 2a + 1`, `H_(n,a) >= H_(3,1) = -log[3exp(-2) - 2exp(-3)]\n= 3 - log(3e - 2) = h_star > 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" =3-log(3e-2)=" + }, + { + "kind": "def", + "unqualified_name": "HStarExceedsOne", + "line": 1025, + "source_header": "1) ≤ hazardStar (capacityFamily n a)) ∧\n hazardStar (capacityFamily 3 1) = -Real.log (3 * Real.exp (-2) - 2 * Real.exp (-3)) ∧\n -Real.log (3 * Real.exp (-2) - 2 * Real.exp (-3)) = hStar ∧\n 1 < hStar\n\n/-- The last step of (F11): `e > 2`, `e^2 - (3e - 2) = (e - 1)(e - 2) > 0`, hence\n`3exp(-2) - 2exp(-3) < exp(-1)` and `h_star > 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha" + }, + { + "kind": "def", + "unqualified_name": "LocalPriceBoundFull", + "line": 1039, + "source_header": "l.exp 1 ∧\n Real.exp 1 ^ 2 - (3 * Real.exp 1 - 2) = (Real.exp 1 - 1) * (Real.exp 1 - 2) ∧\n 0 < (Real.exp 1 - 1) * (Real.exp 1 - 2) ∧\n 3 * Real.exp (-2) - 2 * Real.exp (-3) < Real.exp (-1) ∧\n 1 < hStar\n\n/-! ## Full price Sections 3-4: local price bound (F12) and global assembly (F13) -/\n\n/-- Display (F12): for each block with `d_i >= 2` and positive local good probability, under\n`0 <= c_v <= phi(p_v)`, `price({X_i}) <= rho_star [-log mu_p(D_i)]`, and the price is at most\none.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" price({X_i}) <= rho_star [-log mu_p(D_i)], (F12)\"\nInterface: the family data `F` with `IsRealizedFamily F` and `d_i >= 2` as hypotheses.\nDoes not claim: the bound (statement only);" + }, + { + "kind": "def", + "unqualified_name": "GlobalAssemblyHazard", + "line": 1056, + "source_header": "∀ v, 0 ≤ p v ∧ p v ≤ 1) → (∀ v, 0 ≤ c v ∧ c v ≤ phi (p v)) →\n ∀ i : Fin F.b, 0 < localGood F p i →\n genPrice c (block F i) ≤ rhoStar * (-Real.log (localGood F p i)) ∧\n genPrice c (block F i) ≤ 1\n\n/-- Display (F13): `mu_p(D) <= prod_i mu_p(D_i)` and, when `mu_p(D) > 0`,\n`sum_i [-log mu_p(D_i)] <= -log mu_p(D)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" sum_i [-log mu_p(D_i)] <= -log mu_p(D). (F13)\"\nInterface: the family data `F` with `IsRealizedFamily F` as hypothesi" + }, + { + "kind": "def", + "unqualified_name": "tripleBlock", + "line": 1068, + "source_header": "eEq X] (F : RealizedData X) : Prop :=\n IsRealizedFamily F → ∀ p : X → ℝ, (∀ v, 0 ≤ p v ∧ p v ≤ 1) →\n mu F p ≤ ∏ i, localGood F p i ∧\n (0 < mu F p → ∑ i, -Real.log (localGood F p i) ≤ -Real.log (mu F p))\n\n/-! ## Full price Section 5: sharpness and the exact demand boundary -/\n\n/-- One block with `a = 1`, `d = 2`, `n = 3`, no edges.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b5" + }, + { + "kind": "def", + "unqualified_name": "SharpnessOfRhoStar", + "line": 1083, + "source_header": "the full triple is not.\"\nInterface: none; a concrete data record.\nDoes not claim: anything. -/\ndef tripleBlock : RealizedData (Fin 3) where\n b := 1\n blk := fun _ => 0\n a := fun _ => 1\n d := fun _ => 2\n H := ∅\n\n/-- Sharpness of `rho_star` even among alternative covers: for the triple block at `K = 2`, the\nobstruction is exactly `{X}`; at `p_i = p_star`, `c_i = 1` (admissible since `phi(p_star) = 1`)\nevery generator has price one, every cover of the obstruction costs at least one and the\none-generator full-block cover `{X}` attains it (so the exact cover cost is one), the hazard is\n`h_star`, and replacing `rho_star` by any smaller constant makes the right side of (F2) strictly\nless than one.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"Replacing rho_star by any smaller constant in (F2) would make its right side strictly less than one.\"\nInterface: none; everything is concrete.\nDoes not claim: the statements (" + }, + { + "kind": "def", + "unqualified_name": "demandOneBlock", + "line": 1108, + "source_header": "BlockFamily tripleBlock) = 1 ∧\n coverCost tripleBlock 2 (fun _ => (1 : ℝ)) = 1 ∧\n -Real.log (mu tripleBlock (fun _ => pStar)) = hStar ∧\n ∀ ρ : ℝ, ρ < rhoStar → cappedHazard ρ (mu tripleBlock (fun _ => pStar)) < 1\n\n/-- One block with capacity `cap`, demand `1`, `n = cap + 1`, no edges.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"If d=1," + }, + { + "kind": "def", + "unqualified_name": "DemandOneBoundary", + "line": 1121, + "source_header": ": none; a concrete data record for each `cap`.\nDoes not claim: anything. -/\ndef demandOneBlock (cap : ℕ) : RealizedData (Fin (cap + 1)) where\n b := 1\n blk := fun _ => 0\n a := fun _ => cap\n d := fun _ => 1\n H := ∅\n\n/-- The exact demand boundary: for every `a >= 1`, in the demand-one block at `K = 1` the sole\nobstruction is the full block; at `p_i = p_star`, `c_i = 1` every cover costs at least one, but\n`mu_p(D) = 1 - p_star^(a+1) > 1 - p_star = exp(-1)`, so the hazard is less than one and no\nconstant `rho <= 1` makes the same-palette transformed-price guarantee hold.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \" mu_p(D)=1-p_star^(a+1)>1-p_star=ex" + }, + { + "kind": "def", + "unqualified_name": "SixSeventhsCertificate", + "line": 1142, + "source_header": "ap + 1) ∧\n -Real.log (mu (demandOneBlock cap) (fun _ => pStar)) < 1 ∧\n ∀ ρ : ℝ, ρ ≤ 1 →\n cappedHazard ρ (mu (demandOneBlock cap) (fun _ => pStar)) <\n coverCost (demandOneBlock cap) 1 (fun _ => (1 : ℝ))\n\n/-! ## Full price Section 6: rational certificates for `rho_star < 6/7` -/\n\n/-- The short rational certificate chain of Section 6: `e < 31967/11760 < 87/32`,\n`87/32 - 31967/11760 = 11/23520`, `sum_{j=0}^5 (11/6)^j/j! - 197/32 = 26081/933120 > 0`,\nhence `3e - 2 < 197/32 < exp(11/6)`, `h_star > 7/6` and `rho_star < 6/7`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/full_price_20260924/PROOF.md sha256 87521901ca8e5405b4d1e47f1deb1cd0326affbd6f5967b53c4178590da993f9\nAnchor: \"Therefore 3e-2<197/327/6 and rho_star<6/7.\"\nInterface: none.\nDoes not claim: th" + } + ] + }, + { + "path": "specifications/lean_statements_20261010/Specifications/Lifetime.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 65, + "source_header": "y\n\n/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same text, this\nnamespace). The duplication is deliberate: modules of this packet import only Mathlib. -/\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 77, + "source_header": "in d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 86, + "source_header": "i : ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 97, + "source_header": "^ 2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 109, + "source_header": "taSum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : F" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 120, + "source_header": "L (x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g :" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 129, + "source_header": "ec d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 138, + "source_header": "ℕ, ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 180, + "source_header": "y ∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 190, + "source_header": ": ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoi" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 199, + "source_header": "ℝ) (x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 215, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNon" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 225, + "source_header": "iticalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsInd" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 235, + "source_header": "alPoint d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 244, + "source_header": ": ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnon" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 253, + "source_header": "nS (d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence modul" + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 283, + "source_header": "tGap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsC" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 302, + "source_header": "NondegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the sourc" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 315, + "source_header": "IsCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNond" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 351, + "source_header": "gMax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 363, + "source_header": "p :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pai" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 374, + "source_header": "ndDomain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d :" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 385, + "source_header": "E d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gau" + }, + { + "kind": "def", + "unqualified_name": "IsWindowPair", + "line": 407, + "source_header": "A ∧\n ∫ ℓ in A, ν ℓ = (∫ ω, ((pairCount d L Pair (G.F ω) A : ℕ) : ℝ) ∂G.P) / L ^ d)\n\n/-! ### Populations of pairs -/\n\n/-- Compact-window population of Theorem B: ordered maximum / index-(d-1)-saddle pairs with\n`0 < distance <= ρ`, birth `f(M)` in `B = [bLo, bHi]` and scaled gap in `K = [kLo, kHi]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none beyond the shared predicates.\nDoes not claim: anything about the off-diagonal (far) population separately (Section" + }, + { + "kind": "structure", + "unqualified_name": "PairLawInterface", + "line": 442, + "source_header": ": ℝ) (g : E d → ℝ) (M S : E d) : Prop :=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S\n\n/-! ### The typed pair law as an interface -/\n\n/-- Interface for the weighted regression (typed pair) law: the only object consumed by the\nstatements is the probability `p_r(b,k,R)` that the global ordinary superlevel elder death\npartner of the pinned maximum `M = -(r/2)u` is the pinned saddle `S = (r/2)u`, under the\nlaw `Q^W = (W_r/Z_r) Q_{r,b,k,R}` with `W_r = |det H_M det H_S| 1{H_M<0, index(H_S)=d-1}`.\nThat law, its weight, its normalizer and the regression construction are informal in the\nsource and are NOT transcribed; `p` is a GIVEN function of radius `r`, birth `b`, gap mark\n`k` and orthonormal frame `R` with values in `[0, 1]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let p_r(b,k,R) be the Q^W probability that the **global ordinary superlevel elder death partner** of M is S.\"\nInterface: `p` is given; its only hypothesis fields are the bounds `0 ≤ p ≤ 1`. The parameters `G` and `I` record which field and which elder relation the law refers to; no field ties `p` to them.\nDoes not claim: existence of the regression law, the typed weight, the full normalizer `Z_r > 0`, or that `p` is the probability of any event under any measure declared here; that `p` depends on `G` or `I` in any way (no field mentions them; they only record which field and elder relation the law is meant to refer to). -/\nstructure PairLawInterface (d : ℕ) (L : ℝ) (G : GaussianFieldInterface d L)\n (I : SuperlevelBarInterface d L) where\n /-- Section 1 clause: \"Let p_r(b,k,R) be the Q^W probability that the global ordinary\n superlevel elder death partner of M is S.\" -/\n p : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → ℝ\n /-- `p` is a probability: nonnegative. -/\n p_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 ≤ p r b k R\n /-- `p` is a proba" + }, + { + "kind": "def", + "unqualified_name": "ParentUniformSelectionA", + "line": 466, + "source_header": "ility: at most one. -/\n p_le_one : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), p r b k R ≤ 1\n\n/-! ### The parent statements (1.1), (1.2), (1.3) -/\n\n/-- Shape of Theorem A (1.1), uniform selection candidate: for fixed `d ≥ 2`, `L > 0`,\ncompact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `0 < kLo ≤ kHi`, there exist `r_* > 0`\nand `C` (quantified OUTSIDE the universal quantifiers over `r`, `b`, `k` and the frame)\nsuch that `0 <= 1 - p_r(b,k,R) <= C r^3` for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K` and all\northonormal frames `R`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There exist r_*>0 and C 0` and\nwindows `B`, `K` of positive length with `kLo > 0`, there are a distance cutoff `r_* > 0`, a\nconstant `c_{B,K} > 0` and a constant `C_{B,K}` such that the compact-window candidate and\nelder lifetime densities admit versions `νc`, `νe` with `νc(ℓ) ~ c_{B,K} ℓ^(-1/3)`,\n`νe(ℓ) ~ c_{B,K} ℓ^(-1/3)` as `ℓ ↓ 0` (filter `nhdsWithin 0 (Set.Ioi 0)`) and\n`0 ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all sufficiently small `ℓ > 0`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"0 <= nu_cand(ell)-nu_eld(ell) <= C_{B,K} ell^(2/3),\"\nInterface: `G` and `I` are given; \"versions\" are any `νc`, `νe` satisfying `IsLifetimeDensityVersion` (integral identity), not a Kac-Rice representation; the coefficient `c_{B,K}` is existential, not the Gaussian integral (11.3).\nDoes not claim: the parent result or its proof; the exact coefficient formula (11.3); existence of the versions; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef ParentCompactWindowDensityB (d :" + }, + { + "kind": "def", + "unqualified_name": "IsUnrestrictedLeadingCoefficient", + "line": 510, + "source_header": "r : ℝ, 0 < ℓStar ∧ ∀ ℓ : ℝ, 0 < ℓ → ℓ ≤ ℓStar →\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C * ℓ ^ ((2 : ℝ) / 3)\n\n/-- `c` is a leading coefficient of the unrestricted finite-lifetime densities: `c > 0` and\nversions `νc`, `νe` of the unrestricted candidate density and of the finite ordinary\nsuperlevel H0 bar density satisfy `νc(ℓ) ~ c ℓ^(-1/3)` and `νe(ℓ) ~ c ℓ^(-1/3)` as `ℓ ↓ 0`.\nThe essential global-maximum class is excluded from `νe` through `IsFiniteBar`. This is the\nconclusion of (1.3) for a given `c`; it characterises `c_{d,L}` by its leading-term role,\nnot by the integral (13.6)/(15.2).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"There is a positive finite constant c_{d,L} such that\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the explicit Gaussian/angular representation (15.2) of `c_{d,L}`; uniqueness of `c` (which follows from the asymptotics but is not stated); existence of versions. -/\ndef IsUnrestrictedLeadingC" + }, + { + "kind": "def", + "unqualified_name": "ParentUnrestrictedLeadingDensityC", + "line": 531, + "source_header": "∧\n Asymptotics.IsEquivalent (nhdsWithin (0 : ℝ) (Set.Ioi 0)) νe\n (fun ℓ : ℝ => c * ℓ ^ ((-1 : ℝ) / 3))\n\n/-- Shape of Theorem C (1.3), unrestricted finite-lifetime leading density candidate: for\nfixed `d ≥ 2` and `L > 0` there is a positive finite constant `c_{d,L}` such that the\nunrestricted candidate density and the finite ordinary superlevel H0 bar density (all birth\nheights, all positive gap marks, all separations; essential global maximum excluded) admit\nversions with `ν(ℓ) ~ c_{d,L} ℓ^(-1/3)` as `ℓ ↓ 0`. Leading term only.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"nu_cand^all(ell) ~ c_{d,L} ell^(-1/3),\"\nInterface: `G` and `I` are given; versions are characterised by the integral identity only.\nDoes not claim: the parent result or its proof (dominated convergence of Section 13, off-diagonal bound (14.1)); the representation (15.2); the compact-window `O(ell^(2/3))` difference for the unrestricted densities; any numerical enclosure of `c_{d,L}` (the SIDE24 coefficient track is separate); nonauthor review or acceptance. -/\ndef ParentUnrestr" + }, + { + "kind": "def", + "unqualified_name": "RemainderBoundedR1", + "line": 545, + "source_header": "(I : SuperlevelBarInterface d L) : Prop :=\n 2 ≤ d → 0 < L → ∃ c : ℝ, IsUnrestrictedLeadingCoefficient d L G I c\n\n/-! ### The bounded remainder (R1) -/\n\n/-- Shape of Theorem R (R1), bounded unrestricted short-lifetime remainder: for fixed\n`d ≥ 2`, `L > 0` and with `c = c_{d,L}` the parent leading coefficient (characterised here\nby `IsUnrestrictedLeadingCoefficient`), there are `ell_* > 0` and `C` such that versions of\nthe unrestricted candidate and finite-bar densities satisfy, for `0 < ℓ ≤ ell_*`,\n`|νc(ℓ) - c ℓ^(-1/3)| ≤ C`, `0 ≤ νc(ℓ) - νe(ℓ) ≤ C` and `|νe(ℓ) - c ℓ^(-1/3)| ≤ C`.\nThe `O(1)` remainder is stated with an explicit absolute-value bound.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md sha256 380b7d0abdb0fe2de5a6564565af9560d3f1b1ce22fd5538927db0c52f4f3a4a\nAnchor: \"|nu_cand(ell)-c ell^(-1/3)| <= C,\"\nInterface: `G` and `I` are given; `c` is any real satisfying the parent leading-coefficient property (the source says the coefficient \"is exactly the parent's equation (15.2)\"; that integral is not transcribed, so `c` is pinned through (1.3) instead); versions are characterised by the integral identity only. The statement does not mention the typed pair law: Theorem R does not consume (1.1).\nDoes not claim: the result or its proof (quadratic determinant cancellation (R7), coupling (R4), cap-loss bound (R12)); convergence of the remainder; a second coefficient; numerical `C` or `ell_*`; the compact-window `O(ell^(2/3))` difference without cutoffs; the parent interfaces it imports (D1-A-E); nonauthor review or acceptance. If no `c` satisfies the parent property the statement holds vacuously; that is a transcription of its dependency on (1.3), not a claim. -" + }, + { + "kind": "def", + "unqualified_name": "PlanarElderLowerE2", + "line": 569, + "source_header": "c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C ∧\n 0 ≤ νc ℓ - νe ℓ ∧ νc ℓ - νe ℓ ≤ C ∧\n |νe ℓ - c * ℓ ^ ((-1 : ℝ) / 3)| ≤ C\n\n/-! ### Planar elder lower bound and density gap (d = 2) -/\n\n/-- Shape of the planar direct lower bound (E2): on the fixed planar torus (`d = 2`), with\nbirth `b` in a fixed compact interval, `k ∈ [kLo, kHi]` with `kLo > 0` and frames ranging\nover `O(2)`, there are `c > 0` and `r_* > 0` such that `1 - p_r(b,k,R) ≥ c r^3` for all\n`0 < r ≤ r_*`, uniformly in `b`, `k` and the frame.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \"1-p_r(b,k,R) >= c r^3, 0 0` there are a distance cutoff\n`r_* > 0`, constants `c_{B,K} > 0`, `C_{B,K}` and `ell_* > 0` such that versions of the\ncompact-window candidate and ordinary elder densities satisfy\n`c_{B,K} ℓ^(2/3) ≤ νc(ℓ) - νe(ℓ) ≤ C_{B,K} ℓ^(2/3)` for all `0 < ℓ ≤ ell_*`. The parent upper\ninput is an explicit hypothesis, not folded into the conclusion. The lower half, which the\nsource derives from (E2) alone, is stated under the same hypothesis because the source displays\n(E11) as one two-sided inequality; that is a hypothesis the source does not need for the lower\nhalf, recorded here as such.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/window_multiplicity_laws_20260928/ELDER_LOWER_AND_DENSITY_GAP.md sha256 8ce05a43bde8e0d718f09e2da1ffe75d3ec5893489254afdbf5b58b602cdba0c\nAnchor: \" <= C_{B,K} ell^(2/3). (E11)\"\nInterface: `G`, `I` and `PL` are given; the hypothesis `ParentUniformSelectionA 2 L G I PL bLo bHi kLo kHi` is the consumed parent upper input (a statement shape, not the parent result); versions are characterised by the integral identity only; the weighted Kac-Rice / radial ledger of [LP, Sections 9-11] that the source consumes is not transcribed. The interface does not determine `p` or the field: the Prop is a predicate on the interface objects, not a closed statement about the source's objects; nothing is asserted about its universal closure over all inhabitants, and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the result or its proof; the upper half independently of the parent (1.1); the parent (1.1) itself; the lower half without the hypothesis (the source has it from (E2) alone); sharpness of the `O(1)` remainder of (R1); removal of the compact-mark restriction; that the cutoff `r_*` is the one of (1.1); any numerical constant; nonauthor review or acceptance. -/\ndef PlanarDensityGapE11 (L : ℝ) (G :" + } + ] + }, + { + "path": "specifications/lean_statements_20261010/Specifications/Field.lean", + "sha256": "f22c91e082cd7e738ba47c9c3534e47ac687d066f0b78586d15103cf1132535e", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 40, + "source_header": "y\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) : T" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 49, + "source_header": "d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ)" + }, + { + "kind": "def", + "unqualified_name": "thetaSum", + "line": 58, + "source_header": ": ℝ))\n\n/-- The unnormalised periodized Gaussian (theta) sum `sum_{n in Z^d} exp(-|z+Ln|^2/2)`,\nwritten as a `tsum` over `Z^d`. If the family were not summable the `tsum` would be `0`;\nsummability is a hypothesis field of `GaussianFieldInterface`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of the family is the field `GaussianFieldInterface.summable`, not derived here.\nDoes not claim: convergence of the sum. -/\nnoncomputable def thetaSum (d : ℕ) (L : ℝ) (z : E" + }, + { + "kind": "def", + "unqualified_name": "periodicCovariance", + "line": 69, + "source_header": "2) / 2)\n\n/-- The periodized Gaussian covariance\n`K_L(z) = sum_n exp(-|z+Ln|^2/2) / sum_n exp(-|Ln|^2/2)`; the denominator is the theta\nsum at `z = 0`, so `K_L(0) = 1` (variance one) whenever that denominator is nonzero (the\nsummability field is meant to provide this; not shown here).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: summability of both theta sums is the field `GaussianFieldInterface.summable`.\nDoes not claim: positivity of the Fourier coefficients (Section 2 of the source) or any property of `K_L` beyond its definition. -/\nnoncomputable def periodicCovariance (d : ℕ) (L : ℝ) (z :" + }, + { + "kind": "def", + "unqualified_name": "covQuadForm", + "line": 81, + "source_header": "Sum d L 0\n\n/-- The `K_L`-quadratic form `sum_{i,j} a_i a_j K_L(x_i - x_j)` of a finite real linear\ncombination `sum_i a_i f(x_i)` of point evaluations: its variance under a centred\nstationary field with covariance `K_L`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: nonnegativity of this form is the field `GaussianFieldInterface.quad_nonneg`.\nDoes not claim: positive definiteness (Section 2 of the source). -/\nnoncomputable def covQuadForm (d : ℕ) (L : ℝ) {m : ℕ} (x : Fin m → E d) (a : Fin" + }, + { + "kind": "def", + "unqualified_name": "IsLPeriodic", + "line": 92, + "source_header": "(x i - x j)\n\n/-- `L`-periodicity of a function on `R^d`: invariance under every lattice translation.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the defining predicate of a function on the torus.\nDoes not claim: anything about the field. -/\ndef IsLPeriodic (d : ℕ) (L : ℝ) (g : E" + }, + { + "kind": "def", + "unqualified_name": "IsSmooth", + "line": 101, + "source_header": "d L n) = g x\n\n/-- Smoothness of a sample path: `C^n` for every finite `n` (written without `⊤`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"In particular the field has a smooth version and all finite moments of its global derivative suprema exist.\"\nInterface: smoothness of every sample path is the field `GaussianFieldInterface.smooth`.\nDoes not claim: existence of a smooth version, or moment bounds on derivative suprema. -/\ndef IsSmooth (d : ℕ) (g :" + }, + { + "kind": "structure", + "unqualified_name": "GaussianFieldInterface", + "line": 110, + "source_header": "ContDiff ℝ n g\n\n/-- Interface for the centred stationary Gaussian field of variance one on the torus\n`R^d/(L Z^d)` with covariance `K_L`. The field is GIVEN: its probability space, its sample\npaths, their smoothness and periodicity, the Gaussian law of every finite real linear\ncombination of point evaluations (law `gaussianReal 0 v` with `v` the `K_L`-quadratic\nform) and the covariance identity are hypothesis fields, as is summability of the theta\nsums. Existence of such an object is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: every field of this structure is a given property of the field, never derived.\nDoes not claim: existence or uniqueness in law of the field; the Fourier representation and positive spectrum of Section 2; almost-sure Morse genericity of Section 8. -/\nstructure GaussianFieldInterface (d : ℕ) (L : ℝ) where\n /-- The underlying probability space (sample space). -/\n Ω : Type\n -- Its sigma-algebra (square-bracket field, as in Mathlib's bundled categories). It is not\n -- registered for typeclass resolution after this declaration; consumers bring it into\n -- scope with `haveI := G.mΩ`.\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure `P`. -/\n P : Measure Ω\n -- `P` is a probability measure (square-bracket field).\n [isProb : IsProbabilityMeasure P]\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"the field has a smooth version\"; every sample path is smooth. -/\n smooth : ∀ ω, IsSmooth d (F ω)\n /-- Section 1 clause: the field lives \"On the flat torus X = R^d/(L Z^d)\"; every sample path\n is `L`-periodic. -/\n periodic : ∀ ω, IsLPeriodic d L (F ω)\n /-- Section 1 clause: the theta sums defining `K_L` converge (taken as a hypothesis). -/\n summable : ∀ z : E d, Summable (fun n : Fin d → ℤ => Real.exp (-(‖z + latticeVec d L n‖ ^ 2) / 2))\n /-- The `K_L`-quadratic form is nonnegative (so it is a variance). -/\n quad_nonneg : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ), 0 ≤ covQuadForm d L x a\n /-- Section 1 clause: \"the centered stationary Gaussian field of variance one with covariance\"\n `K_L`; every finite real linear combination of point evaluations has the centred Gaussian\n law whose variance is the `K_L`-quadratic form. -/\n gaussian : ∀ {m : ℕ} (x : Fin m → E d) (a : Fin m → ℝ),\n Measure.map (fun ω => ∑ i, a i * F ω (x i)) P =\n ProbabilityTheory.gaussianReal 0 ⟨covQuadForm d L x a, quad_nonneg x a⟩\n /-- Covariance identity `E[f(x) f(y)] = K_L(x - y)` (centred, stationary). -/\n covariance : ∀ x y : E d, ∫ ω, F ω x * F ω y" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 152, + "source_header": "∂P = periodicCovariance d L (x - y)\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian (d" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 162, + "source_header": "ℝ :=\n iteratedFDeriv ℝ 2 g x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoint" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 171, + "source_header": "(x : E d) : Prop :=\n fderiv ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d :" + }, + { + "kind": "def", + "unqualified_name": "IsNondegMax", + "line": 187, + "source_header": "(∀ w ∈ W, w ≠ 0 → 0 < hessian d g x w w)\n\n/-- Nondegenerate local maximum: a critical point whose Hessian has `d` negative\neigenvalues (negative definite).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that every local maximum of a sample path is nondegenerate (Morse genericity is Section 8 of the source). -/\ndef IsNonde" + }, + { + "kind": "def", + "unqualified_name": "IsIndexSaddle", + "line": 197, + "source_header": "icalPoint d g x ∧ HessianHasInertia d g x d\n\n/-- Index-(d-1) saddle: a critical point whose Hessian has `d - 1` negative and one\npositive eigenvalue.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: that such a saddle is a merging saddle of any superlevel bar. -/\ndef IsIndex" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 207, + "source_header": "Point d g x ∧ HessianHasInertia d g x (d - 1)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnoncomp" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 216, + "source_header": "ℕ) (r : ℝ) (u : E d) : E d :=\n -((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector; this pin is an auxiliary definition consumed by no statement of this packet (the typed pair law `p` is a primitive), so it is attached to no claim. -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 225, + "source_header": "(d : ℕ) (r : ℝ) (u : E d) : E d :=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: that the height gap of an elder pair is the persistence of a bar in any persistence module." + }, + { + "kind": "def", + "unqualified_name": "scaledGap", + "line": 255, + "source_header": "ap (d : ℕ) (g : E d → ℝ) (M S : E d) : ℝ :=\n g M - g S\n\n/-- Scaled gap `(f(M) - f(S)) / distance^3` of an ordered pair, with the torus distance.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 00, and let nu_eld^all(ell) count all finite ordinary superlevel H0 persistence bars, both in expectation per unit volume.\"\nInterface: none.\nDoes not claim: positivity of the height gap (added separately where the source requires it). -/\ndef IsCan" + }, + { + "kind": "def", + "unqualified_name": "IsMorseDistinct", + "line": 274, + "source_header": "ndegMax d g M ∧ IsIndexSaddle d g S ∧ 0 < torusDist d L M S\n\n/-- Morse genericity with distinct critical values on the torus: every critical point is\nnondegenerate (has some inertia) and critical points at distinct torus positions have\ndistinct critical values.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Countable exhaustion now proves that Q is almost surely Morse with distinct critical values.\"\nInterface: none; used only as a hypothesis of the elder-partner interface clause.\nDoes not claim: that sample paths are almost surely Morse (Section 8 of the source)" + }, + { + "kind": "structure", + "unqualified_name": "SuperlevelBarInterface", + "line": 287, + "source_header": "sCriticalPoint d g y →\n 0 < torusDist d L x y → g x ≠ g y)\n\n/-- Interface for the superlevel-set H0 persistence objects used by the lifetime track:\nthe maximin death height `d_f(M)`, the essential (global-maximum) class, and the ordinary\nelder death partner relation. These are GIVEN relations; the fields transcribe the source\nclauses that characterise them on smooth periodic functions, and the elder relation is\npinned only on the Morse distinct-value locus, exactly as the source does.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the Morse distinct-value locus it expresses ordinary elder death at S; an essential maximum has no older endpoint.\"\nInterface: `deathHeight`, `IsEssential`, `ElderPartner` are given; `deathHeight_maximin`, `essential_iff`, `elderPartner_iff` are their hypothesis clauses.\nDoes not claim: Borel measurability of the elder event (Section 8 / the Section 9 replacement), identification with a persistence-module elder rule, or any behaviour off the Morse distinct-value locus. -/\nstructure SuperlevelBarInterface (d : ℕ) (L : ℝ) where\n /-- Section 8 clause: the maximin connection level\n `d_f(M)=sup_{gamma(0)=M, f(gamma(1))>f(M)} min_t f(gamma(t))`. -/\n deathHeight : (E d → ℝ) → E d → ℝ\n /-- The essential class: the global maximum, which \"has no older endpoint\" and whose\n superlevel H0 bar is not finite. -/\n IsEssential : (E d → ℝ) → E d → Prop\n /-- Section 1 clause: \"the global ordinary superlevel elder death partner of M is S\". -/\n ElderPartner : (E d → ℝ) → E d → E d → Prop\n /-- `M` is essential exactly when no point is strictly higher (so the supremum in the\n maximin is over an empty set, \"equal to -infinity\"). -/\n essential_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, IsEssential g M ↔ ∀ y : E d, g y ≤ g M\n /-- Section 8 maximin clause, in the form `h < d_f(M)` iff some path from `M` to a strictly\n higher point stays strictly above `h`. -/\n deathHeight_maximin : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g →\n ∀ M : E d, ¬ IsEssential g M → ∀ h : ℝ,\n h < deathHeight g M ↔\n ∃ y : E d, g M < g y ∧ ∃ γ : Path M y, ∀ t : unitInterval, h < g (γ t)\n /-- Section 8 / Section 14 clause: on the Morse distinct-value locus, \"equality\n d_f(M)=f(S)\" with `M` a nondegenerate maximum and `S` an index-(d-1) saddle \"expresses\n ordinary elder death at S\". -/\n elderPartner_iff : ∀ (g : E d → ℝ), IsSmooth d g → IsLPeriodic d L g → IsMorseDistinct d L g →\n ∀ M S : E d, ElderPartner g M S ↔\n (IsNondeg" + }, + { + "kind": "def", + "unqualified_name": "IsFiniteBar", + "line": 323, + "source_header": "ax d g M ∧ IsIndexSaddle d g S ∧ ¬ IsEssential g M ∧ deathHeight g M = g S)\n\n/-- Finite ordinary superlevel H0 bar, as an ordered pair: a nondegenerate maximum `M`\n(birth) with its ordinary elder death partner `S`, an index-(d-1) saddle at positive torus\ndistance. The essential global-maximum class is excluded because `ElderPartner` requires\n`¬ IsEssential` on the Morse locus.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"each finite superlevel H0 bar has exactly one local-maximum birth and one index-(d-1) merging-saddle death.\"\nInterface: `I : SuperlevelBarInterface d L` is given.\nDoes not claim: the identification of these pairs with bars of a persistence module; that the count of such pairs equals the finite-bar count off the Morse locus. -/\ndef IsFiniteBar (d :" + }, + { + "kind": "def", + "unqualified_name": "pairSet", + "line": 335, + "source_header": ":=\n IsCandidatePair d L g M S ∧ 0 < heightGap d g M S ∧ I.ElderPartner g M S\n\n/-- The set of pairs of a population `Pair` with both points in the fundamental domain and\nlifetime (height gap) in `A`; `Pair g M S` is the membership predicate of the population.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of this set (a field of the density-version predicate). -/\ndef pairSet (d : ℕ) (L : ℝ) (Pair" + }, + { + "kind": "def", + "unqualified_name": "pairCount", + "line": 346, + "source_header": "Domain d L ∧ p.2 ∈ FundDomain d L ∧ Pair g p.1 p.2 ∧ heightGap d g p.1 p.2 ∈ A}\n\n/-- Number of pairs of the population with lifetime in `A` and base points in the\nfundamental domain (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Let nu_cand(ell) be their expected lifetime density per unit volume; let nu_eld(ell) count only pairs which are actual ordinary elder partners.\"\nInterface: the population predicate `Pair` is a parameter.\nDoes not claim: finiteness of the counted set. -/\nnoncomputable def pairCount (d : ℕ" + }, + { + "kind": "def", + "unqualified_name": "IsLifetimeDensityVersion", + "line": 357, + "source_header": "d → Prop)\n (g : E d → ℝ) (A : Set ℝ) : ℕ :=\n Set.ncard (pairSet d L Pair g A)\n\n/-- `ν` is a VERSION of the expected per-unit-volume lifetime density of the population\n`Pair` under the field `G`: it is nonnegative and measurable, the pair sets are almost\nsurely finite with integrable counts, `ν` is integrable on every Borel `A ⊆ (0, ∞)`, and\n`∫_A ν = E[#pairs with lifetime in A and base point in [0,L)^d] / L^d` for every such `A`.\nThe source's densities are only defined up to such versions. The sigma-algebra of the sample\nspace is brought into scope by the inlined term-level `haveI := G.mΩ` (a square-bracket\nfield of a bundled record is not registered for typeclass resolution after the declaration).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"These densities admit versions with\"\nInterface: the field `G` and the population predicate `Pair` are given; the Kac-Rice representation of the expectation (Sections 9-10 of the source) is NOT used; the density is characterised only by the integral identity.\nDoes not claim: existence of a version; the weighted Kac-Rice identity; the radial ledger (10.2). Measurability of the pair count as a function of the sample is REQUIRED by the predicate (through `Integrable`, hence `AEStronglyMeasurable`), not established here. -/\ndef IsLifetimeDensityVersion (d : ℕ) (L : ℝ) (G : Gauss" + } + ] + }, + { + "path": "specifications/lean_statements_20261010/Specifications/Side24.lean", + "sha256": "3164ccfd527d5d443c3830ae871e5592abc6658dc3678006da368fdace3818e3", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 52, + "source_header": "y\n\n/-- The ambient Euclidean space `R^d` of the field; `d ∈ {2, 3}` in the source.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Use its centered variance-one field with the exact normalized covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: anything about the field or the torus `R^d/(24 Z^d)`. -/\nabbrev E (d : ℕ) : T" + }, + { + "kind": "def", + "unqualified_name": "coneMomentD1", + "line": 60, + "source_header": "d)\n\n/-! ## Exact constants of the note -/\n\n/-- The cone moment `D_1 = 4/3` of the reference law for `m = d - 1 = 1`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"D_1=E[A^2 1{A<0}]=4/3.\"\nInterface: none; a rational constant.\nDoes not claim: the identity with the Gaussian expectation (that is `ConeMomentD1Identity`); the arithmetic `(1/2)(8/3) = 4/3` is kernel-checked on main (`UniversalLaw.Side24.cone_moment_m1_thirds`), not here. -/\nnoncomputable def coneMomen" + }, + { + "kind": "def", + "unqualified_name": "coneMomentD2", + "line": 70, + "source_header": "= 4 / 3\n\n/-- The cone moment `D_2 = 29/6 - sqrt 6` of the reference law for `m = d - 1 = 2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \" = 29/6-sqrt(6).\"\nInterface: none; an explicit real constant.\nDoes not claim: the identity with the Gaussian cone expectation (that is `ConeMomentD2Identity` and `ConeMomentD2Algebra`); the rational part `29/6` and `4 sqrt(3/8) = sqrt 6` are kernel-checked on main (`UniversalLaw.Side24.cone_moment_m2_algebra`), not here. -/\nnoncomputable def coneMom" + }, + { + "kind": "def", + "unqualified_name": "coneMomentRef", + "line": 78, + "source_header": "al.sqrt 6\n\n/-- The reference cone moment `D_m` as a function of `m = d - 1`: `D_1` for `m = 1`, `D_2` for\n`m = 2`, and `0` (unspecified by the source) otherwise.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"c_d,ref = Gamma(7/6)*(3/2)^(1/3)*D_(d-1)\"\nInterface: none.\nDoes not claim: any value outside `m ∈ {1, 2}`; the value `0` there is a placeholder, not a cone moment. -/\nnoncomputable def coneMomentRef" + }, + { + "kind": "def", + "unqualified_name": "cRef", + "line": 88, + "source_header": "ntD2 else 0\n\n/-- The nonperiodic reference coefficient of display (1):\n`c_{d,ref} = Gamma(7/6) (3/2)^(1/3) D_{d-1} / [2 sqrt 3 pi^(d-1) sqrt pi]`, `d = 2, 3`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"/ [2sqrt(3)*pi^(d-1)*sqrt(pi)], d=2,3.\"\nInterface: none; `Real.Gamma`, `Real.sqrt`, `Real.pi` and real powers are Mathlib's.\nDoes not claim: that this equals the periodic coefficient (the source says it is NOT claimed equal); any value for `d ∉ {2, 3}`; the derivation from the parent formula (that is `ReferenceCoefficientIdentity`); any numerical value of `Gamma(7/6)`. -/\nnoncomputable def cRe" + }, + { + "kind": "def", + "unqualified_name": "imageConstE", + "line": 99, + "source_header": "sqrt Real.pi)\n\n/-- The image constant `E = 21175738586478 * 10^(-125)` of display (2), as a rational over a\npower of ten.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"= 21175738586478 *10^(-125).\"\nInterface: none.\nDoes not claim: the factorisation `1458*(76*24^6+15) = 21175738586478`, kernel-checked on main (`UniversalLaw.Side24.image_constant_value`), not here. -/\nnoncomputable def" + }, + { + "kind": "def", + "unqualified_name": "epsilon", + "line": 108, + "source_header": "6478 / 10 ^ 125\n\n/-- The relative covariance allowance `epsilon = 10^(-108)` of display (3).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"epsilon=10^(-108), since60E 6` (the source restricts to `q ≤ 6`); nothing here encloses the coef" + }, + { + "kind": "def", + "unqualified_name": "DerivativeBoundAtLeastOne", + "line": 234, + "source_header": "Real.exp (-(‖x‖ ^ 2) / 2) * pairingSum q ‖x‖\n\n/-- Section 2: at `|x| ≥ 1` every unit-direction contraction of order `q ≤ 6` of\n`phi(x) = exp(-|x|^2/2)` is bounded by `76 |x|^6 exp(-|x|^2/2)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"At |x|>=1 this is at most76 |x|^6 e^(-|x|^2/2).\"\nInterface: none.\nDoes not claim: the bound (statement only); the coefficient arithmetic `1+15+45+15=76` and `76` bounding the smaller orders are kernel-checked on main (`UniversalLaw.Side24.pairing_sum_six`, `pairing_sum_le_six`), not here; nothing here encloses the coeff" + }, + { + "kind": "def", + "unqualified_name": "DerivativeBoundAtZero", + "line": 245, + "source_header": "x u| ≤ 76 * ‖x‖ ^ 6 * Real.exp (-(‖x‖ ^ 2) / 2)\n\n/-- Section 2: at zero every unit-direction contraction of order `q ≤ 6` of `phi` has absolute\nvalue at most `15`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"contraction has absolute value at most15.\"\nInterface: none.\nDoes not claim: the bound (statement only); `5!! = 15` is kernel-checked on main (`UniversalLaw.Side24.sixth_moment_double_factorial" + }, + { + "kind": "def", + "unqualified_name": "intNormSq", + "line": 256, + "source_header": "q u →\n |iteratedFDeriv ℝ q (Kinf d) 0 u| ≤ 15\n\n/-- The squared Euclidean length `|n|^2 = sum_i n_i^2` of an integer point.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"sum_{n!=0} |n|^6 e^(-288|n|^2)\"\nInterface: none.\nDoes not claim: anything. -/\nnonc" + }, + { + "kind": "def", + "unqualified_name": "imageTerm", + "line": 265, + "source_header": ") (n : Fin d → ℤ) : ℝ :=\n ∑ i, ((n i : ℤ) : ℝ) ^ 2\n\n/-- The lattice-image term `|n|^6 exp(-288 |n|^2)` for `n ≠ 0`, and `0` at `n = 0`\n(`288 = 24^2/2`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"sum_{n!=0} |n|^6 e^(-288|n|^2)\"\nInterface: none.\nDoes not claim: `24^2/2 = 288`, kernel-checked on main (`UniversalLaw.Side24.period_exponent`), not here. -/\nno" + }, + { + "kind": "def", + "unqualified_name": "LatticeImageSumBound", + "line": 275, + "source_header": "e intNormSq d n ^ 3 * Real.exp (-288 * intNormSq d n)\n\n/-- Section 2 lattice bound: for `d ≤ 3`, the image family is summable and\n`sum_{n ≠ 0} |n|^6 exp(-288|n|^2) ≤ 1458 exp(-288)`. Summability is stated so the `tsum` is\nnot the vacuous `0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"<=1458 e^(-288).\"\nInterface: none.\nDoes not claim: the bound (statement only); the intermediate `729 sum_j j^9 e^(-288 j^2)` shell count is not specified; `27*27 = 729`, `729*2 = 1458` are kernel-checked on main (`UniversalLaw.Side24.lattice_shell_c" + }, + { + "kind": "def", + "unqualified_name": "SuccessiveTermRatio", + "line": 288, + "source_header": "n : Fin d → ℤ, imageTerm d n) ≤ 1458 * Real.exp (-288)\n\n/-- Section 2: successive terms `j^9 exp(-288 j^2)`, `j ≥ 1`, have ratio at most\n`512 exp(-864)`, and that constant is below `1/2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"successive terms have ratio at most512e^(-864)<1/2.\"\nInterface: none.\nDoes not claim: the bounds (statement only); `2^9 = 512`, `288*3 = 864` are kernel-checked on main (`UniversalLaw.Side24.geometric_ratio" + }, + { + "kind": "def", + "unqualified_name": "ExponentialBounds", + "line": 301, + "source_header": "(-288 * (j : ℝ) ^ 2))) ∧\n 512 * Real.exp (-864) < 1 / 2\n\n/-- Section 2 exponential facts: `exp(288/125) > 10`, hence `exp(-288) < 10^(-125)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"hence e^(-288)<10^(-125) and the geometric-ratio inequality follows too.\"\nInterface: none; `Real.exp` is Mathlib's.\nDoes not claim: the inequalities (statement only); the rational Taylor sum through degree 20 exceeding `10` is kernel-checked on main (the `UniversalLaw.Side24` Taylor-sum target i" + }, + { + "kind": "def", + "unqualified_name": "ImageBound", + "line": 310, + "source_header": "10 < Real.exp (288 / 125) ∧ Real.exp (-288) < 1 / 10 ^ 125\n\n/-- Display (2): for `d ∈ {2, 3}`, every unit-direction contraction through total order `6`,\nmixed directions included, satisfies `|D^q K_24(0) - D^q K_infty(0)| < E`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"|D^q K_24(0)-D^q K_infty(0)|\"\nInterface: summability of the theta family is the premise `ThetaSummable d`; derivatives are Mathlib's `iteratedFDeriv ℝ q`.\nDoes not claim: the bound (statement only); differentiability of `K_24` (if `K_24` is not `C^q` the derivative is `0` in Lean); nothing here encloses the coeffici" + }, + { + "kind": "abbrev", + "unqualified_name": "SymIndex", + "line": 322, + "source_header": "(K24 d) 0 u - iteratedFDeriv ℝ q (Kinf d) 0 u| < imageConstE\n\n/-! ## Section 3: the joint covariance of `(G, t, svec H)` in a frame -/\n\n/-- Index set of the `svec` coordinates: ordered pairs `(i, j)` with `i ≤ j`, of cardinality\n`d(d+1)/2` (`3` for `d = 2`, `6` for `d = 3`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and\"\nInterface:" + }, + { + "kind": "abbrev", + "unqualified_name": "JointIndex", + "line": 333, + "source_header": "bbrev SymIndex (d : ℕ) : Type := {p : Fin d × Fin d // p.1 ≤ p.2}\n\n/-- Index set of the joint vector `(G, t, svec H)`: `d` gradient coordinates, one third\nderivative `t`, and `d(d+1)/2` `svec` coordinates; dimension `6` for `d = 2` and `10` for `d = 3`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"sqrt(2) times independent off-diagonal entries. Its dimension is at most10.\"\nInterface: none.\nDoes not claim: the dimension count `6`, `10`, kernel-checked on main (`UniversalLaw.Side24.pin_determinant_a" + }, + { + "kind": "def", + "unqualified_name": "jetDirs", + "line": 342, + "source_header": "e. -/\nabbrev JointIndex (d : ℕ) : Type := Fin d ⊕ Unit ⊕ SymIndex d\n\n/-- The list of differentiation directions attached to a joint coordinate, in the orthonormal\nframe `R` with `u = R 0`: `G_i = ∂_{R i} f`, `t = ∂_u^3 f`, `H_{ij} = ∂_{R i} ∂_{R j} f`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Use the joint vector (G,t,svec H), where svec lists diagonal Hessian entries and\"\nInterface: none.\nDoes not claim: anything. -/\ndef jetDirs (d : ℕ) (u : E d) (R : Fin d → E d) : JointIndex d → List (E d)\n | Sum.inl i => [R i]\n | Sum.inr" + }, + { + "kind": "def", + "unqualified_name": "svecScale", + "line": 354, + "source_header": "Sum.inl _) => [u, u, u]\n | Sum.inr (Sum.inr p) => [R p.1.1, R p.1.2]\n\n/-- The `svec` scaling: `1` on gradient, `t` and diagonal Hessian coordinates, `sqrt 2` on\noff-diagonal Hessian coordinates.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"sqrt(2) times independent off-diagonal entries. Its dimension is at most10.\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def svecScale (d : ℕ) : JointIndex d → ℝ\n | Su" + }, + { + "kind": "def", + "unqualified_name": "derivContraction", + "line": 365, + "source_header": ".inr (Sum.inr p) => if p.1.1 = p.1.2 then 1 else Real.sqrt 2\n | _ => 1\n\n/-- The derivative of `K` at `x` contracted against a list of directions:\n`D^{|l|} K(x)[l_1, …, l_{|l|}]`, through Mathlib's `iteratedFDeriv`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Each covariance entry differs from the reference by at most2E, by (2).\"\nInterface: none.\nDoes not claim: differentiability of `K` (if absent the derivative is `0` in Lean). -/\nnoncomputable" + }, + { + "kind": "def", + "unqualified_name": "jointCov", + "line": 375, + "source_header": "l : List (E d)) : ℝ :=\n iteratedFDeriv ℝ l.length K x (fun i => l.get i)\n\n/-- The joint covariance matrix of `(G, t, svec H)` at a point of a centred stationary field\nwith covariance `K`, in the frame `R` with `u = R 0`, through the stationary rule\n`Cov(∂^α f, ∂^β f) = (-1)^{|β|} ∂^{α+β} K(0)`, with the `svec` scaling. With `K = K_infty`\nthis is `C_ref`; with `K = K_24` it is `C_24`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Each covariance entry differs from the reference by at most2E, by (2).\"\nInterface: none; the covariance is DEFINED by the derivative rule, no field is constructed.\nDoes not claim: that this matrix is the covariance of any random vector (no field is constructed here); symmetry or positive semidefiniteness of the matrix. -/\nnoncomputable def jointCov (d : ℕ) (K : E d →" + }, + { + "kind": "def", + "unqualified_name": "gradCov", + "line": 390, + "source_header": ".length *\n derivContraction d K 0 (jetDirs d u R a ++ jetDirs d u R b)\n\n/-- The gradient covariance block `Cov(G_i, G_j) = -∂_{R i} ∂_{R j} K(0)` in the frame `R`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"covariance differentiation gives\"\nInterface: none.\nDoes not claim: that it equals the identity for `K_infty` (that is `ReferenceOddAndPinBlocks`). -/\nnoncomputable d" + }, + { + "kind": "def", + "unqualified_name": "pinCov", + "line": 399, + "source_header": "in d) (Fin d) ℝ :=\n Matrix.of fun i j => - derivContraction d K 0 [R i, R j]\n\n/-- The pin covariance block of `V = H u`, coordinates `V_i = ∂_u ∂_{R i} f`:\n`Cov(V_i, V_j) = ∂_u ∂_{R i} ∂_u ∂_{R j} K(0)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Thus V=Hu has covariance diag(3,1,...,1), tau^2=Var(t|G=0)=6, and\"\nInterface: none.\nDoes not claim: that it equals `diag(3,1,...,1)` for `K_infty` (that is `ReferenceOddAndPinBlocks`). -/\nnoncomputable def pinCov (" + }, + { + "kind": "def", + "unqualified_name": "thirdGradCov", + "line": 410, + "source_header": "d) (Fin d) ℝ :=\n Matrix.of fun i j => derivContraction d K 0 [u, R i, u, R j]\n\n/-- The covariance vector `Cov(t, G_j) = -∂_u^3 ∂_{R j} K(0)` of `t = ∂_u^3 f` with the gradient.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Var(t)=15, Cov(t,G)=(-3,0,...,0),\"\nInterface: none.\nDoes not claim: its reference value `(-3, 0, …, 0)` (that is `ReferenceOddAndPinBlocks`). -/\nnoncomputab" + }, + { + "kind": "def", + "unqualified_name": "thirdVar", + "line": 419, + "source_header": ": Fin d → E d) : Fin d → ℝ :=\n fun j => - derivContraction d K 0 [u, u, u, R j]\n\n/-- The variance `Var(t) = -∂_u^6 K(0)` of `t = ∂_u^3 f`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Var(t)=15, Cov(t,G)=(-3,0,...,0),\"\nInterface: none.\nDoes not claim: its reference value `15` (that is `ReferenceO" + }, + { + "kind": "def", + "unqualified_name": "condThirdVariance", + "line": 428, + "source_header": "d : ℕ) (K : E d → ℝ) (u : E d) : ℝ :=\n - derivContraction d K 0 [u, u, u, u, u, u]\n\n/-- The conditional variance `tau^2 = Var(t | G = 0)` as the Schur complement\n`Var(t) - Cov(t,G) Cov(G)^(-1) Cov(G,t)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"tau^2=Var(t|G=0)=6\"\nInterface: none; the Gaussian conditional variance is written as the Schur complement (a standard identity, used here as the definition).\nDoes not claim: invertibility of `Cov(G)` (Mathlib's matrix inverse is `0` on a singular matrix); the value `6` (that is `ReferenceOddAndPinBlocks`). -/\nnonc" + }, + { + "kind": "def", + "unqualified_name": "Cref", + "line": 439, + "source_header": "oduct (thirdGradCov d K u R) (Matrix.mulVec (gradCov d K R)⁻¹ (thirdGradCov d K u R))\n\n/-- The reference joint covariance `C_ref` (kernel `K_infty`) in the frame `R`, `u = R 0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"(1-epsilon) C_ref <= C_24 <= (1+epsilon) C_ref,\"\nInterface: none.\nDoes not claim: its displayed block values (`ReferenceOddAndPinBlocks`), or that it is frame independent. -/\nnoncomputable de" + }, + { + "kind": "def", + "unqualified_name": "C24", + "line": 449, + "source_header": "Fin d → E d) :\n Matrix (JointIndex d) (JointIndex d) ℝ :=\n jointCov d (Kinf d) u R\n\n/-- The exact periodic joint covariance `C_24` (kernel `K_24`) in the frame `R`, `u = R 0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"(1-epsilon) C_ref <= C_24 <= (1+epsilon) C_ref,\"\nInterface: summability of the theta family is a premise wherever this matrix is used.\nDoes not claim: rotational invariance (the source asserts none for `C_24`). -/\nnoncomputable" + }, + { + "kind": "def", + "unqualified_name": "CovarianceOrdering", + "line": 459, + "source_header": "R : Fin d → E d) :\n Matrix (JointIndex d) (JointIndex d) ℝ :=\n jointCov d (K24 d) u R\n\n/-- Display (3): for `d ∈ {2, 3}`, in every orthonormal frame `R` (with `u = R 0`),\n`(1-epsilon) C_ref ≤ C_24 ≤ (1+epsilon) C_ref` in the positive-semidefinite order.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"The inequalities are in the positive-semidefinite ordering and hold in every\"\nInterface: summability of the theta family is the premise `ThetaSummable d`; the matrices are defined by the derivative rule of `jointCov`.\nDoes not claim: the ordering (statement only); the passage to marginal and conditional covariances (not specified); `60E < epsilon` is kernel-checked on main (`UniversalLaw.Side24.covariance_relative_bound`), not here; nothing here" + }, + { + "kind": "def", + "unqualified_name": "EntrywiseCovarianceBound", + "line": 472, + "source_header": ".PosSemidef ∧\n ((1 + epsilon) • Cref d (R ⟨0, hd⟩) R - C24 d (R ⟨0, hd⟩) R).PosSemidef\n\n/-- Section 3: each entry of `C_24` differs from the corresponding entry of `C_ref` by at most\n`2E`, in every orthonormal frame.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Each covariance entry differs from the reference by at most2E, by (2).\"\nInterface: summability of the theta family is the premise `ThetaSummable d`.\nDoes not claim: the bound (statement only); the spectral-norm bound" + }, + { + "kind": "def", + "unqualified_name": "ReferenceCovarianceLowerBound", + "line": 485, + "source_header": "JointIndex d,\n |C24 d (R ⟨0, hd⟩) R a b - Cref d (R ⟨0, hd⟩) R a b| ≤ 2 * imageConstE\n\n/-- Section 3: `C_ref ≥ I/3` in the positive-semidefinite order, in every orthonormal frame.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Thus C_ref >= I/3 and\"\nInterface: none.\nDoes not claim: the bound (statement only); the odd-block eigenvalues `8 ± sqrt 58` and the minors `2/3`, `7/9` are kernel-checked on main (`UniversalLaw.Side24.odd_block_eigenvalues`, `odd_block_shifted_mino" + }, + { + "kind": "def", + "unqualified_name": "ReferenceOddAndPinBlocks", + "line": 495, + "source_header": "(Cref d (R ⟨0, hd⟩) R - (1 / 3 : ℝ) • (1 : Matrix (JointIndex d) (JointIndex d) ℝ)).PosSemidef\n\n/-- Section 1 reference blocks, in every orthonormal frame with `u = R 0`: `Cov(G) = I_d`,\n`Var(t) = 15`, `Cov(t, G) = (-3, 0, …, 0)`, `Cov(V) = diag(3, 1, …, 1)` and `tau^2 = 6`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Var(t)=15, Cov(t,G)=(-3,0,...,0),\"\nInterface: none; the blocks are the derivative-rule matrices of `K_infty`.\nDoes not claim: the identities (statement only); `15 - 9 = 6` is kernel-checked on main (`UniversalLaw" + }, + { + "kind": "def", + "unqualified_name": "gaussDensity", + "line": 510, + "source_header": "onal (fun i => if i = ⟨0, hd⟩ then 3 else 1) ∧\n condThirdVariance d (Kinf d) (R ⟨0, hd⟩) R = 6\n\n/-! ## Section 4: Gaussian density comparison -/\n\n/-- The centred Gaussian density on `R^n` with covariance `C`:\n`(2 pi)^(-n/2) det(C)^(-1/2) exp(-x^T C^(-1) x / 2)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Comparing Gaussian determinants\"\nInterface: none.\nDoes not claim: that this is a probability density when `C` is singular (the matrix inverse is then `0` i" + }, + { + "kind": "def", + "unqualified_name": "symCoordDim", + "line": 523, + "source_header": "^ (-(n : ℝ) / 2) * C.det ^ (-(1 : ℝ) / 2) *\n Real.exp (-(dotProduct x (Matrix.mulVec C⁻¹ x)) / 2)\n\n/-- The number `n = m(m+1)/2` of independent symmetric-matrix coordinates.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Let C be a centered covariance in n=m(m+1)/2" + }, + { + "kind": "def", + "unqualified_name": "DensityComparison", + "line": 531, + "source_header": "ic-matrix\"\nInterface: none.\nDoes not claim: anything. -/\ndef symCoordDim (m : ℕ) : ℕ := m * (m + 1) / 2\n\n/-- Section 4 density comparison: if `(1-epsilon) C0 ≤ C ≤ (1+epsilon) C0` in the\npositive-semidefinite order, with `C0` positive definite, then pointwise\n`[(1-epsilon)/(1+epsilon)]^(n/2) phi_{(1-epsilon)C0} ≤ phi_C ≤ [(1+epsilon)/(1-epsilon)]^(n/2) phi_{(1+epsilon)C0}`,\n`n = m(m+1)/2`, `epsilon = 10^(-108)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"[(1-epsilon)/(1+epsilon)]^(n/2) phi_((1-epsilon)C0)\"\nInterface: none; `C.PosDef` is stated as a premise although it follows from `C0.PosDef` and the ordering.\nDoes not claim: the comparison (statement only); the cone-moment consequence `(1 ± epsilon)^m D0` and the scaling `a^m` of `h(A) = det(A)^2 1{A<0}` (not specified" + }, + { + "kind": "def", + "unqualified_name": "exponentA", + "line": 552, + "source_header": "1 - epsilon)) ^ ((symCoordDim m : ℝ) / 2) *\n gaussDensity (symCoordDim m) ((1 + epsilon) • C0) x\n\n/-- The exponent `a = m + 2/3 + n/2` of Section 4, with `m = d - 1`, `n = m(m+1)/2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"a=m+2/3+n/2, b=d+n/2.\"\nInterface: none.\nDoes not claim: the values `13/6`, `25/6`, kernel-ch" + }, + { + "kind": "def", + "unqualified_name": "exponentB", + "line": 561, + "source_header": ". -/\nnoncomputable def exponentA (d : ℕ) : ℝ :=\n ((d - 1 : ℕ) : ℝ) + 2 / 3 + (symCoordDim (d - 1) : ℝ) / 2\n\n/-- The exponent `b = d + n/2` of Section 4, with `n = (d-1)d/2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"a=m+2/3+n/2, b=d+n/2.\"\nInterface: none.\nDoes not claim: the inequalities `a+2b<14`, `2a+b<13`, kernel-" + }, + { + "kind": "def", + "unqualified_name": "IntegrandRatioBounds", + "line": 570, + "source_header": "t_bounds`), not here. -/\nnoncomputable def exponentB (d : ℕ) : ℝ :=\n (d : ℝ) + (symCoordDim (d - 1) : ℝ) / 2\n\n/-- Section 4 ratio bounds: for `d ∈ {2, 3}`,\n`1 - 13 epsilon ≤ (1-epsilon)^a / (1+epsilon)^b` and `(1+epsilon)^a / (1-epsilon)^b ≤ 1 + 28 epsilon`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"ratio between1-13epsilon and\"\nInterface: none.\nDoes not claim: the bounds (statement only); that the integrand ratio of the source equals these power quotients (not specified); `13 ≤ 32`, `28 ≤ 32` and `32*10^(-108) < 10^(-106)` are kernel-checked on main (`UniversalLaw.Side" + }, + { + "kind": "def", + "unqualified_name": "ReferencePinDensityProduct", + "line": 582, + "source_header": "(1 + epsilon) ^ exponentB d ∧\n (1 + epsilon) ^ exponentA d / (1 - epsilon) ^ exponentB d ≤ 1 + 28 * epsilon\n\n/-! ## Section 1: reference densities and the reference coefficient identity -/\n\n/-- Section 1: in every orthonormal frame with `u = R 0`, the reference gradient and pin\ndensities at zero satisfy `p_G(0) p_V(0) = (2 pi)^(-d) / sqrt 3`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"p_G(0) p_V(0) = (2pi)^(-d) / sqrt(3).\"\nInterface: none; the densities are `gaussDensity` of the derivative-rule blocks of `K_infty`.\nDoes not claim: the identity (statement only); `det diag(3,1,…,1) = 3` is kernel-checked on m" + }, + { + "kind": "def", + "unqualified_name": "sphereArea", + "line": 597, + "source_header": "R) 0 *\n gaussDensity d (pinCov d (Kinf d) (R ⟨0, hd⟩) R) 0 =\n (2 * Real.pi) ^ (-(d : ℝ)) / Real.sqrt 3\n\n/-- Ordinary sphere area `|S^(d-1)|`: `2 pi` for `d = 2`, `4 pi` for `d = 3`, `0` otherwise.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Substituting these moments and |S^1|=2pi, |S^2|=4pi into the exact parent coef" + }, + { + "kind": "def", + "unqualified_name": "ReferenceCoefficientIdentity", + "line": 606, + "source_header": "3}`. -/\nnoncomputable def sphereArea (d : ℕ) : ℝ :=\n if d = 2 then 2 * Real.pi else if d = 3 then 4 * Real.pi else 0\n\n/-- Display (1) as an identity: the parent prefactor `Gamma(7/6) / [24^(1/3) sqrt pi]` times\n`p_G(0) p_V(0) = (2 pi)^(-d) / sqrt 3`, times `tau^(4/3)` with `tau = sqrt 6`, times `D_{d-1}`,\ntimes `|S^(d-1)|`, equals `c_{d,ref}` (using `6^(2/3)/24^(1/3) = (3/2)^(1/3)`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"This eliminates BOTH the angular and cone integrals for the reference expression.\"\nInterface: none.\nDoes not claim: the identity (statement only); that the left side is the parent formula (15.2) evaluated at the reference law (the angular integrand is constant by rotational invariance of `K_infty`, a fact not specified here); `6^2*2 = 3*24` is kernel-checked on main (`UniversalLaw." + }, + { + "kind": "structure", + "unqualified_name": "ConeMomentInterface", + "line": 621, + "source_header": "(-(d : ℝ)) / Real.sqrt 3) * (Real.sqrt 6) ^ ((4 : ℝ) / 3) *\n coneMomentRef (d - 1) * sphereArea d =\n cRef d\n\n/-! ## Section 1: the cone moments as Gaussian expectations -/\n\n/-- Interface for the Gaussian variables of the reference cone moments. GIVEN: a probability\nspace; the `m = 1` transverse entry `A` with law `N(0, 8/3)`; the `m = 2` coordinates\n`s, x, y` (shared trace shift and traceless part) jointly independent with laws `N(0, 5/3)`,\n`N(0, 1)`, `N(0, 1)`, stated as a product law. Existence of such variables is not asserted.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Var(s)=5/3 and Var(x)=Var(y)=1. The negative-definite cone is s<-R,\"\nInterface: every field is a given property; the laws are `ProbabilityTheory.gaussianReal` with the displayed variances.\nDoes not claim: that these laws are the conditional law `A | V = 0` of the reference field (the source derives them; here they are hypotheses); the derivation of `Var(s) = 5/3` from the `(2/3) delta delta + …` formula (kernel-checked arithmetic on main, `UniversalLaw.Side24.trace_and_traceless_variances`). -/\nstructure ConeMomentInterface where\n /-- The sample space. -/\n Ω : Type\n /-- Its sigma-algebra. -/\n [mΩ : MeasurableSpace Ω]\n /-- The probability measure. -/\n P : Measure Ω\n /-- `P` is a probability measure. -/\n [isProb : IsProbabilityMeasure P]\n /-- Section 1 clause \"For m=1 the variance of A is8/3.\": the scalar transverse Hessian. -/\n A : Ω → ℝ\n /-- Law of `A`: centred Gaussian of variance `8/3`. -/\n A_law : Measure.map A P = ProbabilityTheory.gaussianReal 0 (8 / 3)\n /-- Section 1 clause \"write A=[[s+x,y],[y,s-x]]\": the shared scalar shift `s`. -/\n s : Ω → ℝ\n /-- The traceless coordinate `x`. -/\n x : Ω → ℝ\n /-- The traceless coordinate `y`. -/\n y : Ω → ℝ\n /-- Section 1 clause \"s,x,y are independent, Var(s)=5/3 and Var(x)=Var(y)=1\": the joint law\n of `(s, x, y)` is the product of `N(0,5/3)`, `N(0,1)`, `N(0,1)`. -/\n sxy_law : Measure.map (fun ω => (s ω, x ω, y ω)" + }, + { + "kind": "def", + "unqualified_name": "transverseMatrix", + "line": 657, + "source_header": "P =\n (ProbabilityTheory.gaussianReal 0 (5 / 3)).prod\n ((ProbabilityTheory.gaussianReal 0 1).prod (ProbabilityTheory.gaussianReal 0 1))\n\n/-- The `m = 2` transverse Hessian `A = [[s+x, y], [y, s-x]]`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"For m=2 write A=[[s+x,y],[y,s-x]]. The" + }, + { + "kind": "def", + "unqualified_name": "NegDefCone", + "line": 666, + "source_header": "Does not claim: anything. -/\nnoncomputable def transverseMatrix (s x y : ℝ) : Matrix (Fin 2) (Fin 2) ℝ :=\n Matrix.of ![![s + x, y], ![y, s - x]]\n\n/-- The negative-definite cone `A < 0` for the `m = 2` matrix, as positive definiteness of `-A`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"R=sqrt(x^2+y^2), and det A=s^2-R^2.\"\nInterface: none.\nDoes not c" + }, + { + "kind": "def", + "unqualified_name": "coneIntegrand", + "line": 675, + "source_header": "R` (not specified; the cone is taken by its definition). -/\ndef NegDefCone (q : ℝ × ℝ × ℝ) : Prop :=\n (-(transverseMatrix q.1 q.2.1 q.2.2)).PosDef\n\n/-- The cone-moment integrand `h(A) = det(A)^2 1{A<0}` for the `m = 2` matrix.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"R=sqrt(x^2+y^2), and det A=s^2-R^2.\"" + }, + { + "kind": "def", + "unqualified_name": "ConeMomentD1Identity", + "line": 685, + "source_header": "e def coneIntegrand (q : ℝ × ℝ × ℝ) : ℝ :=\n Set.indicator {q : ℝ × ℝ × ℝ | NegDefCone q}\n (fun q => (transverseMatrix q.1 q.2.1 q.2.2).det ^ 2) q\n\n/-- Section 1 identity `D_1 = E[A^2 1{A<0}] = 4/3` for `A ~ N(0, 8/3)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"D_1=E[A^2 1{A<0}]=4/3.\"\nInterface: `I : ConeMomentInterface` is given; the law of `A` is its hypothesis field.\nDoes not claim: the identity (statement only); that `D_1` is the parent's" + }, + { + "kind": "def", + "unqualified_name": "ConeMomentD2Identity", + "line": 694, + "source_header": "nt. -/\ndef ConeMomentD1Identity (I : ConeMomentInterface) : Prop :=\n ∫ ω, Set.indicator (Set.Iio (0 : ℝ)) (fun a => a ^ 2) (I.A ω) ∂I.P = coneMomentD1\n\n/-- Section 1 identity `D_2 = E[det(A)^2 1{A<0}] = (1/2)[25/3 - 20/3 + 8 - 8 sqrt(3/8)]` for\n`A = [[s+x, y], [y, s-x]]` with the product Gaussian law.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"D_2 = (1/2)[25/3-20/3+8-8sqrt(3/8)]\"\nInterface: `I : ConeMomentInterface` is given; the joint law is its hypothesis field.\nDoes not claim: the identity (statement only); the Rayleigh integration route; that `D_2` is the parent's `D_u` f" + }, + { + "kind": "def", + "unqualified_name": "ConeMomentD2Algebra", + "line": 705, + "source_header": "dentity (I : ConeMomentInterface) : Prop :=\n ∫ ω, coneIntegrand (I.s ω, I.x ω, I.y ω) ∂I.P =\n (1 / 2) * (25 / 3 - 20 / 3 + 8 - 8 * Real.sqrt (3 / 8))\n\n/-- Section 1 algebra `(1/2)[25/3 - 20/3 + 8 - 8 sqrt(3/8)] = 29/6 - sqrt 6`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \" = 29/6-sqrt(6).\"\nInterface: none.\nDoes not claim: the identity (statement only); its rati" + }, + { + "kind": "def", + "unqualified_name": "TraceMoments", + "line": 714, + "source_header": "ide24.cone_moment_m2_algebra`), not here. -/\ndef ConeMomentD2Algebra : Prop :=\n (1 / 2 : ℝ) * (25 / 3 - 20 / 3 + 8 - 8 * Real.sqrt (3 / 8)) = coneMomentD2\n\n/-- Section 1 moments of the trace shift `s ~ N(0, 5/3)`: `E s^2 = 5/3`, `E s^4 = 25/3`,\n`E exp(-s^2/2) = sqrt(3/8)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"E s^2=5/3, E s^4=25/3 and\"\nInterface: `I : ConeMomentInterface` is given.\nDoes not claim: the identities (statement only); `3 (5/3)^2 = 25/3` and `1 + 5/3 = 8/3` are kernel-" + }, + { + "kind": "def", + "unqualified_name": "RayleighSquareLaw", + "line": 726, + "source_header": ": ConeMomentInterface) : Prop :=\n ∫ ω, I.s ω ^ 2 ∂I.P = 5 / 3 ∧\n ∫ ω, I.s ω ^ 4 ∂I.P = 25 / 3 ∧\n ∫ ω, Real.exp (-(I.s ω ^ 2) / 2) ∂I.P = Real.sqrt (3 / 8)\n\n/-- Section 1: `R^2 = x^2 + y^2` has density `exp(-z/2)/2` on `(0, ∞)`, written through its\ndistribution function `P(R^2 ≤ a) = ∫_0^a exp(-z/2)/2 dz` for `a ≥ 0`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"The variable R^2 has density e^(-z/2)/2.\"\nInterface: `I : ConeMomentInterface` is given.\nDoes not claim: the law (st" + }, + { + "kind": "def", + "unqualified_name": "ElementaryConeIntegral", + "line": 737, + "source_header": "ighSquareLaw (I : ConeMomentInterface) : Prop :=\n ∀ a : ℝ, 0 ≤ a →\n (I.P {ω | I.x ω ^ 2 + I.y ω ^ 2 ≤ a}).toReal = ∫ z in (0 : ℝ)..a, Real.exp (-z / 2) / 2\n\n/-- Section 1 elementary integral: for `a ≥ 0`,\n`∫_0^a (a-z)^2 exp(-z/2) dz/2 = a^2 - 4a + 8 - 8 exp(-a/2)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"integral_0^a (a-z)^2 e^(-z/2) dz/2 = a^2-4a+8-8e^(-a/2).\"\nInterface" + }, + { + "kind": "structure", + "unqualified_name": "PeriodicCoefficientInterface", + "line": 749, + "source_header": "ElementaryConeIntegral : Prop :=\n ∀ a : ℝ, 0 ≤ a →\n ∫ z in (0 : ℝ)..a, (a - z) ^ 2 * Real.exp (-z / 2) / 2 =\n a ^ 2 - 4 * a + 8 - 8 * Real.exp (-a / 2)\n\n/-! ## The exact periodic coefficient as an interface, and the headline statements -/\n\n/-- Interface for the exact periodic coefficient `c_{d,24}`, \"precisely its equation (15.2)\"\nof the parent. GIVEN: the coefficient `c24`; the ordinary sphere-area measure on `S^(d-1)`;\nthe gradient density `p_G(0)`, the pin density `p_{V_u}(0)`, the conditional standard\ndeviation `tau_u` and the cone moment `D_u` of the parent's (15.1). Hypothesis fields: the\nsphere measure is carried by the unit sphere with the areas `2 pi`, `4 pi`; the parent's\npositivity clause \"Finite-jet rank proves tau_u>0, positive densities p_G(0),p_Vu(0), and\nD_u>0\"; the densities and `tau_u^2` agree with the Gaussian density formula and the Schur\ncomplement of the derivative-rule blocks of `K_24`; summability of the theta family; and\nthe parent's display (15.2)\n`c_{d,L}= Gamma(7/6) / [24^(1/3) sqrt(pi)] * integral_{S^(d-1)} p_G(0) p_Vu(0) tau_u^(4/3) D_u d sigma(u)`\n(source id `lifetime-parent`, Section 15). The cone moment `D_u` is NOT pinned to `K_24`\nhere: writing it needs the conditional Gaussian law `A_u | V_u = 0`, which this module does\nnot construct.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Let c_d,24 be precisely its equation (15.2), using ordinary sphere area, ordered\"\nInterface: every field is a given object or a hypothesis; nothing is derived; in particular `coneMoment` is characterised only by its docstring.\nDoes not claim: existence of an object satisfying this interface; that `c24` is the finite-bar asymptotic constant (that reading is conditional on the parent's results, which are not touched); that the parent's \"ordered maximum/saddle roles and the full height/gradient pin Jacobian\" are encoded beyond the prefactor of (15.2). -/\nstructure PeriodicCoefficientInterface where\n /-- The exact periodic coefficient `c_{d,24}`, as a function of the dimension. -/\n c24 : ℕ → ℝ\n /-- Scope clause \"using ordinary sphere area\": the surface measure `sigma` on `S^(d-1)`. -/\n sphereMeasure : (d : ℕ) → Measure (E d)\n /-- The sphere measure is carried by the unit sphere. -/\n sphereMeasure_support : ∀ d : ℕ, sphereMeasure d ((Metric.sphere (0 : E d) 1)ᶜ) = 0\n /-- Section 1 clause \"|S^1|=2pi, |S^2|=4pi\": total areas in dimensions `2` and `3`. -/\n sphereMeasure_area :\n (sphereMeasure 2 Set.univ).toReal = 2 * Real.pi ∧ (sphereMeasure 3 Set.univ).toReal = 4 * Real.pi\n /-- Parent (15.2) ingredient: the gradient density at zero `p_G(0)`. -/\n pG0 : ℕ → ℝ\n /-- Parent (15.2) ingredient: the pin density at zero `p_{V_u}(0)` for the direction `u`. -/\n pV0 : (d : ℕ) → E d → ℝ\n /-- Parent (15.1) ingredient: `tau_u`, with `tau_u^2 = Var(t_u | G = 0)`. -/\n tau : (d : ℕ) → E d → ℝ\n /-- Parent (15.1) ingredient: `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]`, the Gaussian cone\n expectation under the conditional law of the transverse Hessian; GIVEN, not constructed. -/\n coneMoment : (d : ℕ) → E d → ℝ\n /-- Parent clause: positive density `p_G(0)`. -/\n pG0_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → 0 < pG0 d\n /-- Parent clause: positive density `p_{V_u}(0)` for every unit direction. -/\n pV0_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < pV0 d u\n /-- Parent clause: `tau_u > 0` for every unit direction. -/\n tau_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < tau d u\n /-- Parent clause: `D_u > 0` for every unit direction. -/\n coneMoment_pos : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ u : E d, ‖u‖ = 1 → 0 < coneMoment d u\n /-- The theta family of `K_24` is summable. -/\n theta_summable : ∀ d : ℕ, d = 2 ∨ d = 3 → ThetaSummable d\n /-- `p_G(0)` is the centred Gaussian density at zero with the gradient block of `K_24`, in\n every orthonormal frame. -/\n pG0_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ R : Fin d → E d, Orthonormal ℝ R →\n pG0 d = gaussDensity d (gradCov d (K24 d) R) 0\n /-- `p_{V_u}(0)` is the centred Gaussian density at zero with the pin block of `K_24`, in\n every orthonormal frame with `u = R 0`. -/\n pV0_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n pV0 d (R ⟨0, hd⟩) = gaussDensity d (pinCov d (K24 d) (R ⟨0, hd⟩) R) 0\n /-- `tau_u^2` is the Schur complement `Var(t_u) - Cov(t_u,G) Cov(G)^(-1) Cov(G,t_u)` of the\n derivative-rule blocks of `K_24`, in every orthonormal frame with `u = R 0`. -/\n tau_sq : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n tau d (R ⟨0, hd⟩) ^ 2 = condThirdVariance d (K24 d) (R ⟨0, hd⟩) R\n /-- Parent display (15.2), for `d ∈ {2, 3}`. -/\n eq_15" + }, + { + "kind": "def", + "unqualified_name": "CoefficientEnclosure", + "line": 815, + "source_header": "2 : ∀ d : ℕ, d = 2 ∨ d = 3 →\n c24 d = Real.Gamma (7 / 6) / ((24 : ℝ) ^ ((1 : ℝ) / 3) * Real.sqrt Real.pi) *\n ∫ u, pG0 d * pV0 d u * tau d u ^ ((4 : ℝ) / 3) * coneMoment d u ∂(sphereMeasure d)\n\n/-- The headline statement of the source: the two enclosures\n`0.07340691930603427103 < c_{2,24} < 0.07340691930603427104` and\n`0.04177593184059834334 < c_{3,24} < 0.04177593184059834335`, for any coefficient satisfying\nthe interface.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"0.07340691930603427103 < c_2,24 < 0.07340691930603427104,\"\nInterface: `I : PeriodicCoefficientInterface` is given; its `c24` is pinned only by the hypothesis fields of the interface (parent (15.2) with a GIVEN cone moment). The interface does not determine `c24`: the Prop is a predicate on the interface object, not a closed statement; its universal closure over all inhabitants is false whenever the interface is inhabited (scaling `coneMoment` by a positive constant scales `c24` through `eq_15_2` and gives another inhabitant), and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the enclosures (statement only: nothing here encloses the coefficient); that an object satisfying the interface exists or is the coefficient of the source; the parent's results or the persistence interpretation; any finite-radius error estimate, unrestricted remainder or RN/24-jet statement; the arithmetic skeleton (endpoint adjacency, `d3 < d2`, endpoints in `(0, 1/10" + }, + { + "kind": "def", + "unqualified_name": "ReferenceComparison", + "line": 827, + "source_header": "eba7), not here; nonauthor review or acceptance. -/\ndef CoefficientEnclosure (I : PeriodicCoefficientInterface) : Prop :=\n d2Lower < I.c24 2 ∧ I.c24 2 < d2Upper ∧ d3Lower < I.c24 3 ∧ I.c24 3 < d3Upper\n\n/-- Display (4): `|c_{d,24} / c_{d,ref} - 1| < 10^(-106)` for `d = 2, 3`, for any coefficient\nsatisfying the interface.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"|c_d,24/c_d,ref -1| < 10^(-106), d=2,3.\"\nInterface: `I : PeriodicCoefficientInterface` is given; `c_{d,ref}` is the explicit `cRef`. The interface does not determine `c24`: the Prop is a predicate on the interface object, not a closed statement; its universal closure over all inhabitants is false whenever the interface is inhabited (scaling `coneMoment` by a positive constant scales `c24` through `eq_15_2` and gives another inhabitant), and `specified` refers to the statement shape at the source's object, which is not constructed.\nDoes not claim: the bound (statement only); equality of the periodic and reference constants (the source says it is NOT claimed); `32*10^(-108) < 10^(-106)`" + }, + { + "kind": "abbrev", + "unqualified_name": "TransRow", + "line": 837, + "source_header": "below_reported`), not here; nothing here encloses the coefficient. -/\ndef ReferenceComparison (I : PeriodicCoefficientInterface) : Prop :=\n ∀ d : ℕ, d = 2 ∨ d = 3 → |I.c24 d / cRef d - 1| < 1 / 10 ^ 106\n\n/-! ## Round 7: the successor interface that pins the cone moment\n\nEverything above this line is byte-identical to the module at Math- `8acc4856`. The declarations below\ntranscribe the parent's (15.1) `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]` (source id `lifetime-parent`,\nSection 15) for the formal kernel `K_24`: the conditional law of the transverse Hessian block `A_u`\ngiven the pin `V_u = 0` is written, for a centred Gaussian vector, through the Schur complement of the\nderivative-rule blocks (the SIDE24 note's Section 3 reading of conditioning), and the cone expectation\nis the Lebesgue integral of `det(A)^2 1{A<0}` against Mathlib's `multivariateGaussian` with that\ncovariance. The successor `PeriodicCoefficientInterface2` keeps every field of\n`PeriodicCoefficientInterface` and adds the parent's nondegeneracy clause for the pin block and the\nconditional block and the definition of `coneMoment`; the two successor Props restate the headline\ndisplays over it. Formal progress of every declaration here: `specified`. Nothing here is proved,\nnothing above changes, no label moves, and no inhabitant of either interface is constructed.\n\nWhat the successor does NOT pin (recorded for the design review, main#307 6137276515): `sphereMeasure` stays a given measure\nconstrained only by its support and total area, so `c24` is determined by the fields only up to that\nchoice; frame invariance of `coneMomentOf` under transverse-frame changes (the parent asserts it) is\nnot a field, so the frame-quantified `coneMoment_def` is a consistency burden on the interface rather\nthan a theorem here. The uniform-in-`u` bounds of the source would make the sphere-measure choice immaterial to\nthe two successor inequalities, not to the value of `c24`. -/\n\n/-- Transverse coordinates of the frame: the indices `i ≠ 0` (the axial direction is `u = R 0`), the\n`m = d - 1` directions of `u`-perp.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753e" + }, + { + "kind": "abbrev", + "unqualified_name": "TransIndex", + "line": 867, + "source_header": "ting m=d-1 and A for the transverse Hessian, Gaussian conditioning on V=0 gives\"\nInterface: none; a subtype of `Fin d`.\nDoes not claim: anything. -/\nabbrev TransRow (d : ℕ) : Type := {i : Fin d // 0 < i.val}\n\n/-- Transverse `svec` coordinates: the `svec` indices `(i, j)`, `i ≤ j`, with both entries transverse\n(`0 < i`), of cardinality `m(m+1)/2` (`1` for `d = 2`, `3` for `d = 3`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Use" + }, + { + "kind": "def", + "unqualified_name": "transScale", + "line": 876, + "source_header": "svec lists diagonal Hessian entries and\"\nInterface: none; a subtype of `SymIndex d`.\nDoes not claim: the cardinalities (not specified). -/\nabbrev TransIndex (d : ℕ) : Type := {p : SymIndex d // 0 < p.1.1.val}\n\n/-- The `svec` scaling restricted to transverse coordinates: `1` on the diagonal, `sqrt 2` off it\n(the restriction of `svecScale` to the Hessian block).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd" + }, + { + "kind": "def", + "unqualified_name": "transCov", + "line": 886, + "source_header": "dent off-diagonal entries. Its dimension is at most10.\"\nInterface: none.\nDoes not claim: anything. -/\nnoncomputable def transScale (d : ℕ) (a : TransIndex d) : ℝ :=\n if a.1.1.1 = a.1.1.2 then 1 else Real.sqrt 2\n\n/-- The covariance block of the transverse Hessian entries `A_ij = ∂_{R i} ∂_{R j} f`, `i, j ≠ 0`, by the\nstationary rule `Cov(∂^α f, ∂^β f) = (-1)^{|β|} ∂^{α+β} K(0)` at even total order (sign `+`), with the\n`svec` scaling: the restriction of `jointCov` to the transverse `svec` coordinates.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Cov(H_ij,H_kl)=delta_ij delta_kl+delta_ik delta_jl+delta_il delta_jk,\"\nInterface: none; the matrix is DEFINED by the derivative rule, no field is constructed.\nDoes not claim: that this matrix is the covariance of any random" + }, + { + "kind": "def", + "unqualified_name": "transPinCov", + "line": 899, + "source_header": ": ℕ) (K : E d → ℝ) (R : Fin d → E d) :\n Matrix (TransIndex d) (TransIndex d) ℝ :=\n Matrix.of fun a b => transScale d a * transScale d b *\n derivContraction d K 0 [R a.1.1.1, R a.1.1.2, R b.1.1.1, R b.1.1.2]\n\n/-- The cross-covariance block of the transverse Hessian entries with the pin coordinates\n`V_i = ∂_u ∂_{R i} f`: `Cov(A_ab, V_i) = ∂_{R a} ∂_{R b} ∂_u ∂_{R i} K(0)`, with the `svec` scaling.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Thus V=Hu has covariance diag(3,1,...,1), tau^2=Var(t|G=0)=6, and\"\nInterface: none; defined" + }, + { + "kind": "def", + "unqualified_name": "condHessianCov", + "line": 910, + "source_header": "noncomputable def transPinCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :\n Matrix (TransIndex d) (Fin d) ℝ :=\n Matrix.of fun a i => transScale d a * derivContraction d K 0 [R a.1.1.1, R a.1.1.2, u, R i]\n\n/-- The conditional covariance of the transverse Hessian given `V_u = 0`, as the Schur complement\n`Cov(A) - Cov(A,V) Cov(V)^(-1) Cov(V,A)` of the derivative-rule blocks (the same pattern as\n`condThirdVariance`, with `pinCov` as `Cov(V)`): the Gaussian conditional covariance when `Cov(V)` is\nnondegenerate.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"to their conditional covariances. For the latter, the Schur-complement quadratic\"\nInterface: none; the Gaussian conditional covariance is written as the Schur complement (a standard identity for a nondegenerate conditioning block, used here as the definition).\nDoes not claim: invertibility of `pinCov` (Mathlib's matrix inverse is `0` on a singular matrix, and the expression then degenerates to `transCov`; the ordinary-inverse Schur identification requires an invertible pin block, and the successor interface's field `pinCov_posDef` supplies that hypothesis); that it is the covariance of any conditional law (no field is construct" + }, + { + "kind": "def", + "unqualified_name": "symOf", + "line": 923, + "source_header": "utable def condHessianCov (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) :\n Matrix (TransIndex d) (TransIndex d) ℝ :=\n transCov d K R - transPinCov d K u R * (pinCov d K u R)⁻¹ * (transPinCov d K u R).transpose\n\n/-- The symmetric transverse matrix read off an `svec` coordinate vector, undoing the `sqrt 2` scaling\nof the off-diagonal entries: entry `(i, j)` is `v_(i,j)` on the diagonal and `v_(min,max) / sqrt 2` off it.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Let C be a c" + }, + { + "kind": "def", + "unqualified_name": "coneIntegrandTrans", + "line": 936, + "source_header": "d)) :\n Matrix (TransRow d) (TransRow d) ℝ :=\n Matrix.of fun i j =>\n if h : i.1 ≤ j.1 then v ⟨⟨(i.1, j.1), h⟩, i.2⟩ / (if i = j then 1 else Real.sqrt 2)\n else v ⟨⟨(j.1, i.1), le_of_not_ge h⟩, j.2⟩ / Real.sqrt 2\n\n/-- The cone-moment integrand `h(A) = det(A)^2 1{A<0}` on `svec` coordinates, the negative-definite\ncone taken as positive definiteness of `-A` (as in `NegDefCone`).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"Integrate the nonnegative function h(A)=det(A)^2 1{A<0}. Under covariance scaling\"\nInt" + }, + { + "kind": "def", + "unqualified_name": "coneMomentOf", + "line": 947, + "source_header": "gral is `0`). -/\nnoncomputable def coneIntegrandTrans (d : ℕ) (v : EuclideanSpace ℝ (TransIndex d)) : ℝ :=\n Set.indicator {v : EuclideanSpace ℝ (TransIndex d) | (-(symOf d v)).PosDef}\n (fun v => (symOf d v).det ^ 2) v\n\n/-- The Gaussian cone expectation of the parent's (15.1), `D_u = E[(det A_u)^2 1{A_u<0} | V_u=0]`,\nwritten for a kernel `K` as the integral of the cone integrand against the centred multivariate\nGaussian law with the conditional covariance `condHessianCov d K u R`, in the frame `R` with `u = R 0`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"D_u=E[(det A_u)^2 1{A_u<0} | V_u=0].\"\nInterface: none; Mathlib's `ProbabilityTheory.multivariateGaussian` is the law: for a covariance that is not positive semidefinite it falls back to the Dirac mass at `0`, and a singular positive-semidefinite covariance gives a degenerate Gaussian (the Dirac mass when the covariance is zero), which is why the successor interface carries `condHessianCov_posDef`.\nDoes not claim: that this number is the parent's `D_u` for any field (no field and no conditional law is constructed: the Gaussian law is written from the formal covariance matrix); invariance under transverse-frame changes (the parent asserts it; not stated he" + }, + { + "kind": "structure", + "unqualified_name": "PeriodicCoefficientInterface2", + "line": 958, + "source_header": "ity` over `ConeMomentInterface`). -/\nnoncomputable def coneMomentOf (d : ℕ) (K : E d → ℝ) (u : E d) (R : Fin d → E d) : ℝ :=\n ∫ v, coneIntegrandTrans d v ∂(ProbabilityTheory.multivariateGaussian 0 (condHessianCov d K u R))\n\n/-- Successor of `PeriodicCoefficientInterface` (numbered, the predecessor unchanged): every field of\nthe predecessor, plus the parent's Section 15 clause that `A_u` conditional on `V_u = 0` is a centred\nNONDEGENERATE Gaussian symmetric matrix (as positive definiteness of the pin block and of the\nconditional block of `K_24`, in every orthonormal frame with `u = R 0`), plus the definition of the\ncone moment: `coneMoment d u` is the Gaussian cone expectation `coneMomentOf d (K24 d) u R`. With these\nfields `coneMoment` is no longer free, so the doubling inhabitant that makes the universal closure of\n`CoefficientEnclosure` and `ReferenceComparison` false is excluded.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Here A_u conditional on V_u=0 is an actual centered nondegenerate Gaussian symmetric matrix\"\nInterface: every field is a given object or a hypothesis; nothing is derived. Still GIVEN and not pinned beyond support and total area: `sphereMeasure`, so `c24` is determined by the fields only up to the choice of that measure among measures carried by the unit sphere with the displayed areas. Frame invariance of `coneMomentOf` is not a field: `coneMoment_def` is required in every orthonormal frame with `u = R 0`, so an interface inhabitant exists only if the formal `coneMomentOf` is frame invariant (the parent asserts this for the actual object; it is not shown here).\nDoes not claim: existence of an object satisfying this interface; that the formal Schur complement and `multivariateGaussian` are the conditional law of any field (no field is constructed); that `c24` is the finite-bar asymptotic constant (conditional on the parent's results, which are not touched); frame invariance; anything about the predecessor interface, which is unchanged. -/\nstructure PeriodicCoefficientInterface2 extends PeriodicCoefficientInterface where\n /-- Parent clause \"an actual centered nondegenerate Gaussian symmetric matrix\": the pin block\n `Cov(V_u)` of `K_24` is positive definite in every orthonormal frame with `u = R 0`. The ordinary-inverse\n Schur identification of `condHessianCov` with the Gaussian conditional covariance requires an invertible pin\n block; this field supplies that hypothesis. -/\n pinCov_posDef : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n (pinCov d (K24 d) (R ⟨0, hd⟩) R).PosDef\n /-- The same clause for the conditional transverse block: positive definite, so the law in\n `coneMomentOf` is a nondegenerate Gaussian. For a covariance that is not positive semidefinite, Mathlib's\n `multivariateGaussian` falls back to the Dirac mass at `0`; a singular positive-semidefinite covariance gives a\n degenerate Gaussian, including the Dirac mass when the covariance is zero; omitting a PosDef field would not\n establish singularity. The inherited `coneMoment_pos` with `coneMoment_def` excludes the Dirac case, whose\n cone moment is `0`. -/\n condHessianCov_posDef : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n (condHessianCov d (K24 d) (R ⟨0, hd⟩) R).PosDef\n /-- Parent (15.1): `D_u` is the Gaussian cone expectation under the conditional law of the\n transverse Hessian of `" + }, + { + "kind": "def", + "unqualified_name": "CoefficientEnclosure2", + "line": 990, + "source_header": "_24` given `V_u = 0`, in every orthonormal frame with `u = R 0`. -/\n coneMoment_def : ∀ d : ℕ, d = 2 ∨ d = 3 → ∀ (hd : 0 < d) (R : Fin d → E d), Orthonormal ℝ R →\n coneMoment d (R ⟨0, hd⟩) = coneMomentOf d (K24 d) (R ⟨0, hd⟩) R\n\n/-- Successor of `CoefficientEnclosure` over the successor interface: the same two enclosures\n`0.07340691930603427103 < c_{2,24} < 0.07340691930603427104` and\n`0.04177593184059834334 < c_{3,24} < 0.04177593184059834335`, for any object satisfying\n`PeriodicCoefficientInterface2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"0.04177593184059834334 < c_3,24 < 0.04177593184059834335.\"\nInterface: `I : PeriodicCoefficientInterface2` is given; `c24` is pinned by `eq_15_2` with the cone moment now defined by `coneMoment_def`, the densities by `pG0_def`, `pV0_def`, `tau_sq`, and the sphere measure still only by support and total area; the Prop is a predicate on the interface object, stated for every inhabitant.\nDoes not claim: the enclosures (statement only: nothing here encloses the coefficient; a theorem would need a proof-producing interval pipeline for `Gamma(7/6)`, `pi`, `exp`, the theta sums and the Gaussian cone integral);" + }, + { + "kind": "def", + "unqualified_name": "ReferenceComparison2", + "line": 1002, + "source_header": "e source's; anything about `CoefficientEnclosure`, which is unchanged; nonauthor review or acceptance. -/\ndef CoefficientEnclosure2 (I : PeriodicCoefficientInterface2) : Prop :=\n CoefficientEnclosure I.toPeriodicCoefficientInterface\n\n/-- Successor of `ReferenceComparison` over the successor interface: display (4),\n`|c_{d,24} / c_{d,ref} - 1| < 10^(-106)` for `d = 2, 3`, for any object satisfying\n`PeriodicCoefficientInterface2`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path coefficients/side24_v1/PROOF.md sha256 c06daccc4ba4b9168522b9888b76a7d599934fc3b91bd753ee5d492262917769\nAnchor: \"|c_d,24/c_d,ref -1| < 10^(-106), d=2,3. (4)\"\nInterface: `I : PeriodicCoefficientInterface2` is given; `c_{d,ref}` is the explicit `cRef`; the cone moment is pinned by `coneMoment_def` and the sphere measure only by support and total area (the source's bounds are uniform in `u`, which is what would make that choice immaterial to this inequality, though not to the value of `c24`; not shown here).\nDoes not claim: the bound (statement only; a theorem would need the Section 4 comparison of the Gaussian cone expectation under the ordered covariances, the Section 3 passage of (3) to the conditional covariance, and the frame-uniform integrand ratio, over the proof packet's `CovarianceOrdering`, `ReferenceCovarianceLowerBound`, `DensityComparison` and `IntegrandRatioBounds`); equality of the pe" + } + ] + }, + { + "path": "specifications/lean_statements_20261010/Specifications/RN.lean", + "sha256": "cad83a9d18029e66f2563f16a0850e846eb01dad0c3f08da6959ce0c186ae59c", + "declarations_lexical": [ + { + "kind": "abbrev", + "unqualified_name": "E", + "line": 107, + "source_header": "y\n\n/-! ### Shared objects, re-declared from `Specifications/Field.lean` (same bodies, this\nnamespace; see the module header for the two module-specific `Does not claim:` lines). The\nduplication is deliberate: modules of this packet import only Mathlib. -/\n\n/-- The ambient Euclidean space `R^d` in which the torus `X = R^d/(L Z^d)` is realised\nby `L`-periodic functions.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"On the flat torus X = R^d/(L Z^d), let f be the centered stationary Gaussian field of variance one with covariance\"\nInterface: none; this is the ambient space `EuclideanSpace ℝ (Fin d)`.\nDoes not claim: that the torus is represented by any quotient type; periodicity is a hypothesis on functions. -/\nabbrev E (d : ℕ) :" + }, + { + "kind": "def", + "unqualified_name": "latticeVec", + "line": 120, + "source_header": "in d)\n\n/-- The lattice vector `L n` for `n ∈ Z^d`, written in the standard coordinate vectors.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"K_L(z) = sum_{n in Z^d} exp(-|z+Ln|^2/2)\"\nInterface: none.\nDoes not claim: anything beyond the definition of the vector `L n`. -/\nnoncomputable def latticeVec (d : ℕ) (L : ℝ) (n : Fin d → ℤ" + }, + { + "kind": "def", + "unqualified_name": "hessian", + "line": 129, + "source_header": "i : ℝ))\n\n/-- The Hessian of `g` at `x` as a bilinear form, through the second iterated Fréchet\nderivative: `hessian d g x v w = D^2 g(x)[v, w]`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"A maximum has d negative Hessian eigenvalues; the relevant saddle has d-1 negative and one positive eigenvalue.\"\nInterface: none.\nDoes not claim: symmetry of the form (true for `C^2` functions, not stated here). -/\nnoncomputable def hessian (d : ℕ) (g : E d → ℝ) (x v w :" + }, + { + "kind": "def", + "unqualified_name": "IsCriticalPoint", + "line": 139, + "source_header": "x ![v, w]\n\n/-- Critical point: vanishing Fréchet derivative (`grad f = 0`).\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"grad f(M)=grad f(S)=0.\"\nInterface: none.\nDoes not claim: differentiability of `g` at `x` (if `g` is not differentiable, `fderiv` is `0`). -/\ndef IsCriticalPoint (d : ℕ) (g : E d → ℝ) (x :" + }, + { + "kind": "def", + "unqualified_name": "HessianHasInertia", + "line": 148, + "source_header": "v ℝ g x = 0\n\n/-- Sylvester-inertia encoding of \"the Hessian at `x` is nondegenerate with exactly `j`\nnegative and `d - j` positive eigenvalues\": there are complementary subspaces `V`, `W` of\ndimensions `j` and `d - j` on which the Hessian form is negative definite, respectively\npositive definite. Intended to agree with the eigenvalue count for symmetric (`C^2`)\nHessians; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"The index counts negative eigenvalues.\"\nInterface: none.\nDoes not claim: equivalence with an eigenvalue count for a non-symmetric form. -/\ndef HessianHasInertia (d : ℕ) (g : E d → ℝ) (x : E d) (" + }, + { + "kind": "def", + "unqualified_name": "pinM", + "line": 164, + "source_header": "an d g x w w)\n\n/-- The pin `M = -(r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector (a hypothesis where used). -/\nnoncomputable def pinM (d : ℕ) (r : ℝ)" + }, + { + "kind": "def", + "unqualified_name": "pinS", + "line": 173, + "source_header": "-((r / 2) • u)\n\n/-- The pin `S = (r/2) u` of the embedded local cylinder with axial unit vector `u`.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"M=-(r/2)u, S=(r/2)u,\"\nInterface: none.\nDoes not claim: that `u` is a unit vector (a hypothesis where used). -/\nnoncomputable def pinS (d : ℕ) (r : ℝ" + }, + { + "kind": "def", + "unqualified_name": "torusDist", + "line": 182, + "source_header": ":=\n (r / 2) • u\n\n/-- Torus distance between two points of `R^d`: the infimum over the lattice of\n`|x - y + L n|`. For `L > 0` it is intended to vanish exactly when `x` and `y` represent the\nsame torus point; not shown here.\n\nSource: d6g8k5htny-coder/Math- commit c39164254ad1529ed49543743598d5dcb24bab98 path imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md sha256 9350ad6eaba6626b93c3dedeef9e2ff816e5cdf1c8318e85fb27499141c84bc7\nAnchor: \"Count ordered maximum/saddle pairs with 0 1`,\n`E[N 1_E] ≤ (E N^p)^(1/p) P(E)^(1-1/p)`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"E[N_r 1_Er] <= (E N_r^p)^(1/p) P(E_r)^(1-1/p).\"\nInterface: none; the probability space, event and count are universally quantified, integrability of `N^p` is a hypothesis.\nDoes not claim: that any count of the Gaussian model satisfies the moment hypothesis; the result or its proof; any rate in `r`; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN of rn-count-interface is transcribed by the register, not here). -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "HolderConsequenceN2", + "line": 224, + "source_header": "Ev).toReal ^ (1 - 1 / p)\n\n/-- Shape of (N2), the consequence of (N1) with a power-law moment bound: if\n`E N^p ≤ A r^(-β)` and `P(E) ≤ C r^3` then\n`E[N 1_E] ≤ A^(1/p) C^(1-1/p) r^((3(p-1)-β)/p)`. The powers refer to the `p`-th MOMENT\nitself, as the source insists.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"E[N_r 1_Er] <= A^(1/p) C^(1-1/p)\"\nInterface: none; `A`, `β`, `C`, `p`, `r` and the probability space are universally quantified, the two bounds are hypotheses.\nDoes not claim: that the exponent can be rounded up to `3`; that any Gaussian count satisfies the hypotheses; the result or its proof; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN of rn-count-interface is transcribed by the register, not here). -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "ConditionalMeanIdentityN3", + "line": 243, + "source_header": "r ^ ((3 * (p - 1) - β) / p)\n\n/-- Shape of (N3), the exact identity `E[N 1_E] = q E[N | E]` with `q = P(E) > 0`, stated\nwith Mathlib's conditional measure `P[|E] = P(E)⁻¹ P|_E` for the conditional expectation.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"E[N_r 1_Er]=q E[N_r | E_r].\"\nInterface: none; the probability space, event and count are universally quantified, `P(E) > 0` and integrability of `N` are hypotheses.\nDoes not claim: the equivalence with a bounded conditional mean, the lower comparison `q ≥ c r^3`, or anything about the Gaussian model; the result or its proof; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN of rn-count-interface is transcribed by the register, not here). -/\ndef Con" + }, + { + "kind": "def", + "unqualified_name": "uniformLaw", + "line": 257, + "source_header": "(ProbabilityTheory.cond P Ev)\n\n/-- The law of `U` uniform on `[0,1]`: Lebesgue measure restricted to `[0, 1]`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"On one space take U uniform on [0,1].\"\nInterface: none; an explicit construction.\nDoes not claim: that this measure is a probability measure (true, not stated as a result here). -/\nnoncomput" + }, + { + "kind": "def", + "unqualified_name": "counterCount", + "line": 265, + "source_header": "me.restrict (Set.Icc (0 : ℝ) 1)\n\n/-- The counterexample count `N_r = ceil(log(1/r)) 1_{E_r}` with `E_r = {U ≤ r^3}`, as a\nfunction of the uniform variable `u`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"N_r=ceil(log(1/r)) 1_Er.\"\nInterface: none; an explicit construction.\nDoes not claim: that this count is a realization of any Gaussian field quantity (the source says it is NOT). -/\nnoncomputable def" + }, + { + "kind": "def", + "unqualified_name": "UniformCounterexampleN4", + "line": 275, + "source_header": ")).indicator (fun _ => (1 : ℝ)) u\n\n/-- Shape of the sharp counterexample (N4): for `0 < r ≤ e^(-1)`, `P(E_r) = r^3` and\n`E N_r / r^3 = ceil(log(1/r))`, which tends to infinity as `r ↓ 0`, while for EACH finite\n`p ≥ 1` the `p`-th moments `E N_r^p` are bounded uniformly in `r` (by a constant that may\ndepend on `p`). So every finite moment does not preserve the cubic exponent.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"E N_r/r^3=ceil(log(1/r)) -> infinity.\"\nInterface: none; the construction is explicit (`uniformLaw`, `counterCount`).\nDoes not claim: the explicit bound `sup_(t>=1) e^(-3t)(t+1)^p` (only existence of a `p`-dependent bound); the one-`p` sharpness construction `N_r=ceil(r^(-3/p))1_Er`; the exponential-tail remark after (N5); that the construction says anything about the Gaussian field; the result or its proof; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN of rn-count-interface is transcribed by the register, not here). -/" + }, + { + "kind": "def", + "unqualified_name": "ExponentialTailLayerCakeN5", + "line": 293, + "source_header": "unterCount r u ^ p ∂uniformLaw ≤ A)\n\n/-- Shape of (N5), the exponential-tail layer-cake bound: if `P(N > t) ≤ A exp(-t/B)` for\nall `t ≥ 0` with `A ≥ 1`, `B > 0`, and `q = P(E) > 0`, then\n`E[N 1_E] ≤ B q [1 + log(A/q)]`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/three_fronts_20260924/RN_COUNT_INTERFACE.md sha256 aa993f5217bd70e6d1060402d121ab659f6582a098e29042c67585a345a8e3ab\nAnchor: \"= B q[1+log(A/q)].\"\nInterface: none; the probability space, event, count and tail constants are universally quantified, the tail bound is a hypothesis.\nDoes not claim: the intermediate integral identity `integral_0^infinity min(q,Ae^(-t/B))dt`; that the logarithmic loss is attained (the source's remark about (N4)); anything about the Gaussian model; the result or its proof; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN of rn-count-interface is transcribed by the register, not here). -/" + }, + { + "kind": "structure", + "unqualified_name": "PinnedLawInterface", + "line": 310, + "source_header": "* (1 + Real.log (A / (P Ev).toReal))\n\n/-! ### The pinned weighted law as an interface -/\n\n/-- Interface for the pinned Gaussian regression law and its determinant tilt. The sample\nspace `Ω` and its sigma-algebra are parameters; the sample paths `F`, the regression law\n`Q_r = Q r b k R` on the `2(d+1)` pin observations at `M = -(r/2)u`, `S = (r/2)u`\n(`u = R e_1`), the typed endpoint weight `W_r`, the tilted law `Q_r^W` and the contact\nkernel `Lambda_j` are GIVEN. The hypothesis fields transcribe: smooth `L`-periodic sample\npaths; `Q_r` is a probability measure under which, in the pin regime `0 < r < L`, the\n`2(d+1)` pin equations hold almost surely; `W_r ≥ 0` vanishes unless `H_M` is negative\ndefinite and `H_S` has index `d-1`; in the same regime `Z_r = E_(Q_r) W_r > 0` and\n`dQ_r^W = (W_r/Z_r) dQ_r` exactly (`Measure.withDensity`); and `Q_r^W` is a probability\nmeasure. The regime `0 < r < L` is this module's reading of the source clause \"For small r>0\nthe pins are\": for `0 < r < L` the pins `M`, `S` are distinct modulo `L Z^d` (`‖S - M‖ = r`\nwhile every nonzero lattice vector has norm at least `L`), so the pin equations are\nconsistent with `L`-periodicity; without the gate the structure would have no inhabitant for\n`L > 0` (at `r = L` along a coordinate frame the two pins coincide on the torus, so the pin\nvalues `b` and `b - k r^3` would be prescribed at one point). The Gaussian-regression\nconstruction of `Q_r`, the determinant factors `|det H_M| |det H_S|` of `W_r` and the\nKac-Rice contact representation (13) of `Lambda_j` are informal in the sources and are NOT\ntranscribed. Existence of such an object is not asserted (a Dirac mass at one smooth\n`L`-periodic sample path with the prescribed pin values, a nondegenerate maximum at `M` and a\nnondegenerate index-`(d-1)` saddle at `S`, with `W = 1` on that path, would satisfy the gated\nfields; this consistency remark is not a statement of this module).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"Q_r denotes continuous Gaussian regression on these 2(d+1) observations.\"\nInterface: every field is a given property of the law, never derived; in particular `Λ` is only a given kernel (its continuity and positivity are part of the Theorem A statement, not of this interface); the pin regime `0 < r < L` gating `Q_pinned`, `Z_pos` and `QW_eq` is part of the hypothesis fields, not a derived fact.\nDoes not claim: that `Q_r` is the Gaussian regression of any field; that `W_r` equals `F_d(H_M) F_(d-1)(H_S)`; the normalizer floor `Z_r >= z_* r^2`; that `Λ` is given by (13); existence or uniqueness of an object satisfying the interface (an inhabitant is not asserted; the consistency remark above is not stated); that `0 < r < L` is the sources' unspecified `small r` threshold. -/\nstructure PinnedLawInterface (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω] where\n /-- The sample paths `ω ↦ f_ω : R^d → ℝ`. -/\n F : Ω → E d → ℝ\n /-- Section 2 clause: \"The real Fourier series therefore has smooth versions\"; every\n sample path is `C^n` for every finite `n`. -/\n smooth : ∀ (ω : Ω) (n : ℕ), ContDiff ℝ n (F ω)\n /-- Section 1 clause: the field lives \"On X=R^d/(L Z^d)\"; every sample path is `L`-periodic. -/\n periodic : ∀ (ω : Ω) (x : E d) (n : Fin d → ℤ), F ω (x + latticeVec d L n) = F ω x\n /-- Section 1 clause: \"Q_r denotes continuous Gaussian regression on these 2(d+1)\n observations\", indexed by radius `r`, birth `b`, gap mark `k` and frame `R`. -/\n Q : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Measure Ω\n /-- `Q_r` is a probability measure. -/\n Q_prob : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), IsProbabilityMeasure (Q r b k R)\n /-- Section 1 clause: the pins \"f(M)=b, f(S)=b-k r^3, grad f(M)=grad f(S)=0\" hold\n `Q_r`-almost surely in the pin regime `0 < r < L` (source: \"For small r>0 the pins are\"). -/\n Q_pinned : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →\n ∀ᵐ ω ∂(Q r b k R),\n F ω (pinM d r (R 0)) = b ∧ F ω (pinS d r (R 0)) = b - k * r ^ 3 ∧\n IsCriticalPoint d (F ω) (pinM d r (R 0)) ∧ IsCriticalPoint d (F ω) (pinS d r (R 0))\n /-- Section 1 clause: the \"actual endpoint weight\" `W_r=F_d(H_M) F_(d-1)(H_S)`, as a\n given functional of the sample. -/\n W : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Ω → ℝ\n /-- `W_r ≥ 0` (a product of filtered absolute determinants). -/\n W_nonneg : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (ω : Ω), 0 ≤ W r b k R ω\n /-- Section 1 clause: `F_j(H)=|det H| 1{H has j negative eigenvalues}`, \"with value zero\n on singular matrices\"; so `W_r ≠ 0` forces `H_M` negative definite and `H_S` of index\n `d-1`. -/\n W_typed : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)) (ω : Ω), W r b k R ω ≠ 0 →\n HessianHasInertia d (F ω) (pinM d r (R 0)) d ∧ HessianHasInertia d (F ω) (pinS d r (R 0)) (d - 1)\n /-- Section 1 clause: the \"FULL normalizer\" `Z_r=E_(Q_r) W_r` is positive in the pin\n regime `0 < r < L`. -/\n Z_pos : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →\n 0 < ∫ ω, W r b k R ω ∂(Q r b k R)\n /-- The tilted law `Q_r^W`. -/\n QW : ℝ → ℝ → ℝ → OrthonormalBasis (Fin d) ℝ (E d) → Measure Ω\n /-- Section 1 clause: `dQ_r^W=(W_r/Z_r)dQ_r`, exactly, in the pin regime `0 < r < L`. -/\n QW_eq : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), 0 < r → r < L →\n QW r b k R = (Q r b k R).withDensity\n (fun ω => ENNReal.ofReal (W r b k R ω / ∫ ω', W r b k R ω' ∂(Q r b k R)))\n /-- `Q_r^W` is a probability measure. -/\n QW_prob : ∀ (r b k : ℝ) (R : OrthonormalBasis (Fin d) ℝ (E d)), IsProbabilityMeasure (QW r b k R)\n /-- Section 5 clause (13): \"The contact kernel is Lambda_j(x;b,k,u)\", a given function of\n the index `j`, birth `b`, gap mark `k`, ax" + }, + { + "kind": "def", + "unqualified_name": "windowCount", + "line": 383, + "source_header": "al direction `u` and position `x`. -/\n Λ : ℕ → ℝ → ℝ → E d → E d → ℝ\n\n/-! ### Counts and regions -/\n\n/-- `N_(r,j)(E)`: the number of index-`j` critical points of `g` in `A` with height STRICTLY\nbetween `b - k r^3` and `b` (`Set.ncard`, which is `0` for an infinite set).\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"N_(r,j)(E)=#{x in E: grad f(x)=0, index H_x=j,\"\nInterface: none.\nDoes not claim: finiteness of the counted set; that boundary heights may be included (the source's remark about zero expected boundary counts is not stated). -/\nnoncomputable def" + }, + { + "kind": "def", + "unqualified_name": "windowCountAll", + "line": 396, + "source_header": "nt d g x ∧ HessianHasInertia d g x j ∧\n b - k * r ^ 3 < g x ∧ g x < b}\n\n/-- All-index window count: the number of critical points of `g` in `A` (degenerate ones\nincluded) with height strictly between `b - k r^3` and `b`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b\nAnchor: \"`N` is the number of critical points of `f` in `X minus {M, S}` with height in `I_r`, all\"\nInterface: none.\nDoes not claim: finiteness of the counted set; equality with the sum of the index counts (true off the degenerate locus, not stated). -/\nnoncomputab" + }, + { + "kind": "def", + "unqualified_name": "windowCountIndexSum", + "line": 406, + "source_header": "d {x : E d | x ∈ A ∧ IsCriticalPoint d g x ∧ b - k * r ^ 3 < g x ∧ g x < b}\n\n/-- `N(E) = sum_j N_j(E)`: the all-index window count of the remote-collision note, the sum\nover `j = 0, ..., d` of the index-`j` window counts (critical points with nonsingular Hessian\nof index `j`; an index above `d` does not occur in `R^d`).\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/remote_collision_20260928/PROOF.md sha256 b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2\nAnchor: \"N(E) = sum_j N_j(E).\"\nInterface: none.\nDoes not claim: finiteness of the counted sets; equality with `windowCountAll` (the two agree only off the degenerate locus). -/\nnoncomputable" + }, + { + "kind": "def", + "unqualified_name": "allHeightCount", + "line": 417, + "source_header": "A : Set (E d)) : ℕ :=\n ∑ j ∈ Finset.range (d + 1), windowCount d g b k r j A\n\n/-- `N_j(E)`: the number of index-`j` critical points of `g` in `A` at all heights.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05\nAnchor: \"let N_j(rE) count index-j critical points in rE at **all heights**.\"\nInterface: none.\nDoes not claim: finiteness of the counted set. -/\nnon" + }, + { + "kind": "def", + "unqualified_name": "remoteRegion", + "line": 426, + "source_header": "Set.ncard {x : E d | x ∈ A ∧ IsCriticalPoint d g x ∧ HessianHasInertia d g x j}\n\n/-- The remote region `D_rho = {x : dist_X(x,0) >= rho}`, represented in the fundamental\ndomain so that a Borel subset of it carries one representative per torus point.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"Fix 0=rho}.\"\nInterface: none.\nDoes not claim: anything about the representation of torus" + }, + { + "kind": "def", + "unqualified_name": "torusMinusPins", + "line": 436, + "source_header": "(L ρ : ℝ) : Set (E d) :=\n {x : E d | x ∈ FundDomain d L ∧ ρ ≤ torusDist d L x 0}\n\n/-- The torus with the two pins removed, `X minus {M, S}`, represented in the fundamental\ndomain: points at positive torus distance from both `M = -(r/2)u` and `S = (r/2)u`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b\nAnchor: \"critical points of `f` in `X minus {M, S}`\"\nInterface: none.\nDoes not claim: anything b" + }, + { + "kind": "def", + "unqualified_name": "torusWindowCount", + "line": 446, + "source_header": "ndDomain d L ∧ 0 < torusDist d L x (pinM d r u) ∧ 0 < torusDist d L x (pinS d r u)}\n\n/-- The torus-wide all-index window count `N` of the C6 notes: critical points other than\n`M, S` with height in `I_r = (b - k r^3, b)`, under the frame `R` (axial direction `R 0`).\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b\nAnchor: \"`N` is the number of critical points of `f` in `X minus {M, S}` with height in `I_r`, all\"\nInterface: `I : PinnedLawInterface` supplies the sample paths.\nDoes not claim: finiteness or measurability of the count as a function of the sample. -/\nnoncomputable def torusWindowCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]\n (I : Pin" + }, + { + "kind": "def", + "unqualified_name": "nearPinPairCount", + "line": 457, + "source_header": "ℝ (E d)) (ω : Ω) : ℕ :=\n windowCountAll d (I.F ω) b k r (torusMinusPins d L r (R 0))\n\n/-- Ordered pairs of distinct window critical points (both in `X minus {M, S}`, both with\nheight in `I_r`, at positive torus distance from each other) such that the FIRST witness is\nwithin torus distance `η` of a pin. All mutual separations are included, down to collision.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"one witness is within fixed `η` of a pin.\"\nInterface: none.\nDoes not claim: finiteness or measurability of the counted set (`Set.ncard` is `0` on an infinite set);\nthat an ordered pair whose only near-pin witness is in second position is counted (it is not: it is\nthe swap of a counted pair, so in the finite case the source's \"at least one witness near a pin\"\ncount lies between this count and twice it, and a bound `C r^3` on this count is a bound `2 C r^3`\non the source's; the two functionals are not literally the same). -/\nnonco" + }, + { + "kind": "def", + "unqualified_name": "scaledAt", + "line": 476, + "source_header": ".2 < b ∧\n (torusDist d L q.1 (pinM d r u) < η ∨ torusDist d L q.1 (pinS d r u) < η)}\n\n/-- The scaled chart `x0 + r E0` read through the frame `R`: the image of a coordinate set\n`E0` (coordinates `p` with `p 0` axial) under `p ↦ x0 + r ∑ p_i R_i`. With `x0 = 0` these\nare the midpoint scaled coordinates `X = r(u, v)`, in which the pins are `(±1/2, 0)`; with\n`x0 = M` they are the endpoint chart `M + r(p, q)`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"Scaled coordinates are `X = r(u, v)` from the midpoint, so the pins are `(±1/2, 0)`.\"\nInterface: none.\nDoes not claim: that the image lies in one fundamental domain (the sources take `r` small enough for the chart to embed in the torus). -/\nnoncomputable def scaledAt (d : ℕ) (" + }, + { + "kind": "def", + "unqualified_name": "collar", + "line": 489, + "source_header": "E d)\n (E0 : Set (E d)) : Set (E d) :=\n (fun p : E d => x0 + r • ∑ i, p i • R i) '' E0\n\n/-- The compact collar `C(eta, R)` in midpoint scaled coordinates: the ball of radius `R`\n(boundary included) with the two open balls of radius `eta` about the scaled pins\n`(-1/2, 0)` and `(1/2, 0)` removed.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"with the two open balls of radius `eta` about `(-1/2, 0)` and `(1/2, 0)` removed\"\nInterface: none.\nDoes not claim: anything beyond the definition; RECONCILIATION.md writes the same set `C_{η,R}` without defining it, and this definition is ta" + }, + { + "kind": "def", + "unqualified_name": "omegaD", + "line": 501, + "source_header": "0 : Fin d) (-(1 : ℝ) / 2)‖ ∧\n η ≤ ‖p - EuclideanSpace.single (0 : Fin d) ((1 : ℝ) / 2)‖}\n\n/-- The weight `omega_d(p, q) = max(|q|, r |p|)^(2-d)` of the endpoint chart, where `p` is\nthe axial coordinate (`p 0`) and `q` the transverse part; `omega_2 = 1`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"omega_d(p, q) = max(|q|, r |p|)^(2-d)\"\nInterface: none.\nDoes not claim: integrability of the weight over the punctured ball (part of the" + }, + { + "kind": "def", + "unqualified_name": "meanWindowCount", + "line": 511, + "source_header": "E d) : ℝ :=\n (max ‖p - EuclideanSpace.single (0 : Fin d) (p 0)‖ (r * |p 0|)) ^ ((2 : ℝ) - d)\n\n/-- `E_(Q_r^W) N_(r,j)(A)`: the expected index-`j` window count in `A` under the tilted law.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"E_(Q_r^W) N_(r,j)(E)\"\nInterface: `I : PinnedLawInterface` supplies the sample paths and the tilted law; the Kac-Rice representation (12) of this expectation is NOT used.\nDoes not claim: integrability of the count (if it is not integrable the Bochner integral is `0`). -/\nnoncomputable def meanWindowCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]\n (I : PinnedLawInte" + }, + { + "kind": "def", + "unqualified_name": "meanAllHeightCount", + "line": 522, + "source_header": "(j : ℕ)\n (A : Set (E d)) : ℝ :=\n ∫ ω, (windowCount d (I.F ω) b k r j A : ℝ) ∂(I.QW r b k R)\n\n/-- `E_(Q_r^W) N_j(A)`: the expected index-`j` all-height count in `A` under the tilted law.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05\nAnchor: \"E_(Q_r^W) N_j(rE)\"\nInterface: `I : PinnedLawInterface` supplies the sample paths and the tilted law; the weighted Kac-Rice intensity (16) is NOT used.\nDoes not claim: integrability of the count. -/\nnoncomputable def meanAllHeightCount (d : ℕ) [NeZero d] (L : ℝ) (Ω : Type) [MeasurableSpace Ω]\n (I : PinnedLawIn" + }, + { + "kind": "def", + "unqualified_name": "FixedRemoteMeanMeasureA2", + "line": 533, + "source_header": "d)) (j : ℕ)\n (A : Set (E d)) : ℝ :=\n ∫ ω, (allHeightCount d (I.F ω) j A : ℝ) ∂(I.QW r b k R)\n\n/-! ### Fixed-remote Theorem A, displays (2) and (3) -/\n\n/-- Shape of Theorem A, display (2) (fixed-remote mean measure): for fixed `d ≥ 2`, `L > 0`,\n`0 < ρ < L/4`, compact `B = [bLo, bHi]` and `K = [kLo, kHi]` with `kLo > 0`, there are\n`r_* > 0` and `C` (quantified OUTSIDE the universal quantifiers) such that for all\n`0 < r ≤ r_*`, `b ∈ B`, `k ∈ K`, frames `R`, indices `j ≤ d` and Borel `E ⊆ D_ρ`,\n`| E_(Q_r^W) N_(r,j)(E)/(k r^3) - ∫_E Lambda_j(x;b,k,u) dx | ≤ C r |E|`; and the kernel\n`Lambda_j` is continuous on `D_ρ`, bounded above and away from zero uniformly on the\ncompact parameter sets.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"| E_(Q_r^W) N_(r,j)(E)/(k r^3)\"\nInterface: `I` (sample paths, laws `Q_r`, `Q_r^W`, weight, kernel `Λ`) is a given object; the statement is about any `Λ` and any laws satisfying `PinnedLawInterface`; the Kac-Rice representation (12) and the contact formula (13) are not transcribed.\nDoes not claim: the result or its proof (uniform remote nondegeneracy, coupling (5), weight expansion (10), normalizer (11)); identification of `I.Λ` with the kernel (13); the total-variation convergence remark; the multi-witness Section 6; any numerical `C` or `r_*`; uniformity as `ρ → 0`; nonauthor review or acceptance (the landing disposition HOLD_WITH_DOMAIN is transcribed by the register, not here). -/\ndef FixedRemoteMeanMeasureA2 (d : ℕ) [NeZero d] (L" + }, + { + "kind": "def", + "unqualified_name": "FixedRemoteCountBoundA3", + "line": 561, + "source_header": "I r b k R j A / (k * r ^ 3) - ∫ x in A, I.Λ j b k (R 0) x| ≤\n C * r * (volume A).toReal\n\n/-- Shape of Theorem A, display (3) (fixed-remote count and event bounds): with the same\nfixed data and existential `r_* > 0`, `C`, for all `0 < r ≤ r_*`, `b ∈ B`, `k ∈ K`, frames,\nindices and Borel `E ⊆ D_ρ`, `E_(Q_r^W) N_(r,j)(E) ≤ C k r^3 |E|` and\n`P_(Q_r^W){N_(r,j)(E) ≥ 1} ≤ C k r^3 |E|`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/remote_window_20260924/PROOF.md sha256 a332bae9bdc0106ce17047f7e0409cc3d94eb610a0c7b74ba5ba2d01a1620cb7\nAnchor: \"E_(Q_r^W) N_(r,j)(E) <= C k r^3 |E|,\"\nInterface: `I` is a given object as in `FixedRemoteMeanMeasureA2`.\nDoes not claim: a matching lower bound on the event probability (the source says this is NOT one); the unnormalized numerator bound (14); the result or its proof; any numerical constant; nonauthor review or acceptance. -/\ndef FixedRemoteCountBoundA3 (d : ℕ) [NeZero d] (" + }, + { + "kind": "def", + "unqualified_name": "FixedAnnulusWindowCandidateA2", + "line": 581, + "source_header": "R) {ω | 1 ≤ windowCount d (I.F ω) b k r j A}).toReal ≤\n C * k * r ^ 3 * (volume A).toReal\n\n/-! ### Fixed scaled annulus (d = 2): the height-window candidate (A2) and the all-height\nbridge (2) -/\n\n/-- Shape of the fixed-annulus height-window candidate statement (A2): `d = 2`, fixed `L > 0`,\ncompact marks (`b ∈ [bLo, bHi]`, `0 < kLo ≤ k ≤ kHi`), fixed scaled annulus\n`K = {A0 ≤ |(u,t)| ≤ B0}` with `1 < A0 < B0`; there are `C, r_* > 0`, uniform in the frame,\nthe marks, the Borel `E0 ⊆ K` and `j ∈ {0,1,2}`, such that\n`E_(Q_r^W) N_j(r E0) ≤ C k r^3 area(E0)` for `0 < r ≤ r_*`, where `N_j(r E0)` counts\nindex-`j` critical points in `r E0` with height STRICTLY between `b - k r^3` and `b`.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md sha256 1fd9fe7141e464fd1c09ebf0318d8a701729c9c61ea24f73f7e20a9cf10c552b\nAnchor: \"E_Qr^W N_j(r E0) <= C*k*r^3*area(E0),\"\nInterface: `I` is a given object; `r E0` is embedded in the torus through the frame by `scaledAt`; the six-pin regression (A3)-(A5), the normalizer (A8) and the weighted Kac-Rice formula (A21) are not transcribed.\nDoes not claim: the result or its proof (contact vector (A10), eigenfloor (A12), cutoff (A13), three-Hessian estimate (A18), inner-strip bound (A26)); the all-index sum or the Markov event bound; an all-height assertion; uniformity in `L`, as `k → 0`, as `B0 → ∞`, or for `d ≥ 3`; any numerical constant; nonauthor review or acceptance (the landing disposition REVIEWED_SCOPED is transcribed by the register, not here). -/\ndef FixedAnnulusWindowCandidateA2 (" + }, + { + "kind": "def", + "unqualified_name": "AnnulusBridgeAllHeight2", + "line": 605, + "source_header": "meanWindowCount 2 L Ω I r b k R j (scaledAt 2 R r 0 E0) ≤\n C * k * r ^ 3 * (volume E0).toReal\n\n/-- Shape of the all-height fixed-annulus bridge candidate statement, display (2): `d = 2`,\nfixed `L > 0`, compact marks, fixed scaled annulus `K_AB = {A ≤ |(u,v)| ≤ B}` with\n`1 < A < B`; there are `C, r_* > 0`, uniform in the marks, frames, Borel `E ⊆ K_AB` and\n`j ∈ {0,1,2}`, such that `E_(Q_r^W) N_j(rE) ≤ C r^3 area(E)` for `0 < r ≤ r_*`, where\n`N_j(rE)` counts index-`j` critical points in `rE` at ALL heights. The review interfaces\nR1-R7 of the source are the steps of its proof, not parts of this statement.\n\nSource: d6g8k5htny-coder/Math- commit 760340e921ac4ceda296b8118da936f1133e956e path frontiers/rn_annulus_bridge_20260925/PROOF.md sha256 d55e2c03bb17e7977ff94130cc1ff21e54840cd1e20dc4e41ea9ad52228beb05\nAnchor: \"E_(Q_r^W) N_j(rE) <= C r^3 area(E), 0 0`, all frames and indices, existential constants) -/\n\n/-- Shape of row D5-a (P2, punctured pin disks): all heights; for Borel\n`E ⊂ {0 < p² + q² ≤ 1/16}` in the endpoint chart, `E_{Q_r^W} N_j(M + rE) ≤ C r³|E|`, and\nthe same at `S`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"E_{Q_r^W} N_j(M + rE) ≤ C r³|E|\"\nInterface: `I` is a given object; the chart `M + rE` is `scaledAt` based at the pin.\nDoes not claim: the P2 source (PUNCTURED_PIN_PROOF.md) or its proof; the P2 continuum review or the proposed register transitions of the reconciliation; any numerical constant; nonauthor review or acceptance. -/\ndef D5aPunctur" + }, + { + "kind": "def", + "unqualified_name": "D5bMicrodisk", + "line": 650, + "source_header": "ightCount 2 L Ω I r b k R j (scaledAt 2 R r (pinS 2 r (R 0)) E0) ≤\n C * r ^ 3 * (volume E0).toReal\n\n/-- Shape of row D5-b (microdisk): all heights; for fixed `κ > 0`, the expected index-`j`\ncount in the punctured disk of physical radius `κ r²` about each pin is `O(r⁵)`: there are\n`C, r_* > 0` with `E_{Q_r^W} N_j(disk) ≤ C r^5` for `0 < r ≤ r_*`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"the nested disks of radius `κr²` about each pin, for fixed `κ`: `O(r⁵)`\"\nInterface: `I` is a given object; the disk is punctured at the pin (the pin itself is a critical point under the law), following the dimension-lift reading \"nested ball\" inside the punctured ball `D`.\nDoes not claim: the P2 source or its nested-disk corollary; any numerical constant; uniformity in `κ`; nonauthor review or acceptance. -/\ndef" + }, + { + "kind": "def", + "unqualified_name": "D5cCollarC1", + "line": 669, + "source_header": "t 2 L Ω I r b k R j\n {x : E 2 | 0 < ‖x - pinS 2 r (R 0)‖ ∧ ‖x - pinS 2 r (R 0)‖ ≤ κ * r ^ 2} ≤ C * r ^ 5\n\n/-- Shape of row D5-c (C1, compact collar): all heights; for fixed `R ≥ 1` and\n`0 < η ≤ 1/4`, for Borel `E ⊂ C_{η,R}` in midpoint scaled coordinates,\n`E_{Q_r^W} N_j(rE) ≤ C r³|E|`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"for Borel `E ⊂ C_{η,R}`, `η ≤ 1/4`, fixed `R ≥ 1`\"\nInterface: `I` is a given object; `C_{η,R}` is `collar 2 η R` (definition taken from the dimension-lift source, since RECONCILIATION.md does not define it).\nDoes not claim: the C1 source (COLLAR_PROOF.md) or its proof; the normalizer (P14) it imports; any numerical constant; nonauthor review or acceptance. -/\nd" + }, + { + "kind": "def", + "unqualified_name": "D5dSummedPinNeighbourhoodC2", + "line": 687, + "source_header": "meanAllHeightCount 2 L Ω I r b k R j (scaledAt 2 R r 0 E0) ≤\n C * r ^ 3 * (volume E0).toReal\n\n/-- Shape of row D5-d (C2, the summed pin-neighbourhood bound): all heights; for fixed\n`R ≥ 1`, `E_{Q_r^W} N_j(r B_R ∖ {M,S}) ≤ C_R r³`, the scaled ball of radius `R` with the\ntwo pins removed.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"E_{Q_r^W} N_j(r B_R ∖ {M,S}) ≤ C_R r³\"\nInterface: `I` is a given object.\nDoes not claim: the composition `D5-a + D5-c at η = 1/4` as a proof; the \"collar to the reviewed annulus\" remark; any numerical constant; nonauthor review or acceptance. -/\ndef D5dSummedPi" + }, + { + "kind": "def", + "unqualified_name": "D5eIntermediateShellsI3I4", + "line": 705, + "source_header": "ace.single (0 : Fin 2) (-(1 : ℝ) / 2) ∧\n p ≠ EuclideanSpace.single (0 : Fin 2) ((1 : ℝ) / 2)}) ≤ C * r ^ 3\n\n/-- Shape of row D5-e (I3/I4, intermediate shells): window `I_r`; the dyadic shells and\n`{A_0 r ≤ |X| ≤ ρ}` satisfy `E N ≤ C r³(A_0^{−2} + ρ²)`: there are `C, s_0 > 0` such that\nfor `A_0 ≥ 4` and `A_0 r < ρ ≤ s_0` the expected index-`j` window count in\n`{A_0 r ≤ |X| ≤ ρ}` (distance from the midpoint) is at most `C r^3 (A_0^(-2) + ρ^2)`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"E N ≤ C r³(A_0^{−2} + ρ²)\"\nInterface: `I` is a given object; the side conditions `A_0 ≥ 4`, `A_0 r < ρ ≤ s_0` are taken from the dimension-lift display (1.6), since RECONCILIATION.md states the row without them.\nDoes not claim: the single-shell display (1.5) (stated in `DimensionLiftIntermediateShellsI`); the I3/I4 source (intermediate_window_20260928) or its proof; any numerical constant; nonauthor review or acceptance. -/\ndef D5eInte" + }, + { + "kind": "def", + "unqualified_name": "D5fGlobalWindowFirstMomentI5", + "line": 724, + "source_header": "meanWindowCount 2 L Ω I r b k R j {x : E 2 | A0 * r ≤ ‖x‖ ∧ ‖x‖ ≤ ρ} ≤\n C * r ^ 3 * ((A0 ^ 2)⁻¹ + ρ ^ 2)\n\n/-- Shape of row D5-f (I5, global window first moment and planar event order): window\n`I_r`; `E_{Q_r^W} N_{r,j}(T² ∖ {M,S}) ≤ C r³`, and for the event `A_r` that some critical\npoint other than `M, S` has height in `I_r`, `c r³ ≤ P(A_r) ≤ C r³` with `c > 0`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"E_{Q_r^W} N_{r,j}(T² ∖ {M,S}) ≤ C r³\"\nInterface: `I` is a given object; `A_r` is the event `{N ≥ 1}` for the all-index torus-wide window count.\nDoes not claim: the tiling composition `D5-d (R = 4) + I4 + remote Theorem A` as a proof; the lower bound's source (remote_collision Corollary F-) or the I5 source; any numerical constant; nonauthor review or acceptance; any register transition proposed by the reconciliation; that the count `torusWindowCount` (every critical point off the pins, degenerate ones included) equals the sum of the index counts: it dominates the source's all-index `N`, and the two agree only off the degenerate locus. -/\ndef D5fGloba" + }, + { + "kind": "def", + "unqualified_name": "DimensionLiftPuncturedPinBallP", + "line": 745, + "source_header": "nt 2 L Ω I r b k R ω}).toReal ∧\n ((I.QW r b k R) {ω | 1 ≤ torusWindowCount 2 L Ω I r b k R ω}).toReal ≤ C * r ^ 3)\n\n/-! ### The dimension lift: Theorems P_d, C_d, I_d, G_d (every fixed d ≥ 2) -/\n\n/-- Shape of Theorem P_d (all-height punctured pin ball), display (1.2): fixed `d ≥ 2`,\n`L > 0`, compact marks; there are `C, C', r_* > 0` such that for `0 < r ≤ r_*`, all `b, k, R, j`\nand every Borel `E ⊆ D = {0 < p² + |q|² ≤ 1/16}` in the endpoint chart,\n`E_(Q_r^W) N_j(M + r E) ≤ C r^3 ∫_E omega_d ≤ C' r^3`, and the same about `S`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"E_(Q_r^W) N_j(M + r E) <= C r^3 integral_E omega_d(p, q) dp dq <= C' r^3.\"\nInterface: `I` is a given object; the chart is `scaledAt` based at the pin; the weight is `omegaD`.\nDoes not claim: the result or its proof (devices D1-D5, stable gradient frame, density and conditional moments, weighted Kac-Rice (4.10), crossover); the nested-ball `O(r^5)` corollary (stated for `d = 2` as `D5bMicrodisk`); the planar P2 identification; any numerical constant; uniformity in `d`; nonauthor review or acceptance. -/\ndef DimensionLiftPuncturedPin" + }, + { + "kind": "def", + "unqualified_name": "DimensionLiftCompactCollarC", + "line": 771, + "source_header": "E0) ≤\n C * r ^ 3 * ∫ p in E0, omegaD d r p ∧\n C * r ^ 3 * ∫ p in E0, omegaD d r p ≤ C' * r ^ 3)\n\n/-- Shape of Theorem C_d (compact collar), display (1.3): fixed `d ≥ 2`, `L > 0`, compact\nmarks, fixed `R ≥ 1` and `0 < η ≤ 1/4`; there are `C, r_* > 0` such that for every Borel\n`E ⊆ C(η, R)`, `E_(Q_r^W) N_j(r E) ≤ C r^3 |E|` for `0 < r ≤ r_*`, all `b, k, R, j`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"E_(Q_r^W) N_j(r E) <= C r^3 |E|.\"\nInterface: `I` is a given object; `C(η, R)` is `collar d η R`.\nDoes not claim: the consequence (1.4) for the scaled ball with pins removed (stated for `d = 2` as `D5dSummedPinNeighbourhoodC2`); the result or its proof; any numerical constant; nonauthor review or acceptance. -/\ndef DimensionLiftCompact" + }, + { + "kind": "def", + "unqualified_name": "DimensionLiftIntermediateShellsI", + "line": 789, + "source_header": "ar d η R0 →\n meanAllHeightCount d L Ω I r b k R j (scaledAt d R r 0 E0) ≤\n C * r ^ 3 * (volume E0).toReal\n\n/-- Shape of Theorem I_d (intermediate height-window shells), displays (1.5) and (1.6):\nthere are `C, s_0 > 0` such that for `0 < r ≤ s/4` and `0 < s ≤ s_0`,\n`E_(Q_r^W) N_(r,j)({ s ≤ |X| ≤ 2 s }) ≤ C r^3 [ (r/s)^2 + s^2 ]`, and hence, uniformly for\n`A_0 ≥ 4` and `A_0 r < ρ ≤ s_0`, `E_(Q_r^W) N_(r,j)({ A_0 r ≤ |X| ≤ ρ }) ≤ C r^3 (A_0^(-2) + ρ^2)`.\n`|X|` is the distance from the midpoint.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"E_(Q_r^W) N_(r,j)({ s <= |X| <= 2 s }) <= C r^3 [ (r/s)^2 + s^2 ],\"\nInterface: `I` is a given object.\nDoes not claim: the result or its proof (polynomial row rank, Euler suppression, shell ledger, dyadic sum); the planar I3/I4 identification; any numerical constant; nonauthor review or acceptance. -/\ndef DimensionLiftIntermedia" + }, + { + "kind": "def", + "unqualified_name": "DimensionLiftGlobalWindowG", + "line": 814, + "source_header": "meanWindowCount d L Ω I r b k R j {x : E d | A0 * r ≤ ‖x‖ ∧ ‖x‖ ≤ ρ} ≤\n C * r ^ 3 * ((A0 ^ 2)⁻¹ + ρ ^ 2))\n\n/-- Shape of Theorem G_d (global height-window first moment), display (1.7): fixed `d ≥ 2`,\n`L > 0`, compact marks; there are `C, r_* > 0` such that\n`E_(Q_r^W) N_(r,j)( X minus {M, S} ) ≤ C r^3` for `0 < r ≤ r_*`, all `b, k, R, j`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/d5_dimension_lift_20260929/PROOF.md sha256 6fb94b247e8e45bca9dc02f46670ac6029fb54e0ef906001efe48fe908549b80\nAnchor: \"E_(Q_r^W) N_(r,j)( X minus {M, S} ) <= C r^3.\"\nInterface: `I` is a given object.\nDoes not claim: the tiling proof (P_d, C_d, I_d and the fixed-remote Theorem A); Corollaries F_d and M_d; the planar I5 identification; the `d = 3` SIDE24 application; any regional supersession of historical carriers; any numerical constant; nonauthor review or acceptance. -/\ndef DimensionLiftGl" + }, + { + "kind": "def", + "unqualified_name": "FourierCutoffPlanarSecondFactorialF4", + "line": 830, + "source_header": "thonormalBasis (Fin d) ℝ (E d), ∀ j : ℕ, j ≤ d →\n meanWindowCount d L Ω I r b k R j (torusMinusPins d L r (R 0)) ≤ C * r ^ 3\n\n/-! ### C6: Fourier cutoff (F4), Palm route (Theorem Q, Corollary Theta) -/\n\n/-- Shape of the planar Fourier-cutoff consequence (F4): in `d = 2`, GIVEN the\ndimension-matched first-moment hypothesis `G_2` (`E_(Q_r^W) N ≤ C r^3` for small `r`,\nuniformly in the marks and frames), there are `C` and `r_* > 0` such that\n`E_(Q_r^W) N(N-1) ≤ C r^3 log(1/r)` for `0 < r ≤ r_*`, all `b, k, R`. The source derives\nthis from Theorem W with `p = 2`; the hypothesis `G_2` is stated as a hypothesis here, not\ndischarged.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_fourier_cutoff_20260929/PROOF.md sha256 c1692379a3a066589bd2522aaa5b4d480e736b737c8c39a474d1735185793733\nAnchor: \"E_Qr^W N(N-1) <= C r^3 log(1/r),\"\nInterface: `I` is a given object; `N` is `torusWindowCount`; `(N)_2 = N(N-1)` is `Nat.descFactorial N 2`.\nDoes not claim: Theorem F (the cap `Psi_F` and its tail (F1)-(F2)); Theorem W for general `d` and `p` (F3); that `G_2` holds (the source takes it from the reviewed planar I5 composition); Proposition B; that the logarithm is sharp or removable; any numerical constant; nonauthor review or acceptance; that the count `torusWindowCount` (every critical point off the pins, degenerate ones included) equals the sum of the index counts: it dominates the source's all-index `N`, and the two agree only off the degenerate locus. -/\ndef Fo" + }, + { + "kind": "def", + "unqualified_name": "PalmRouteFactorialMomentsQ", + "line": 856, + "source_header": "∫ ω, (Nat.descFactorial (torusWindowCount 2 L Ω I r b k R ω) 2 : ℝ) ∂(I.QW r b k R) ≤\n C * r ^ 3 * Real.log (1 / r)\n\n/-- Shape of Theorem Q (Palm route, factorial moments in every fixed dimension): fixed\n`d ≥ 2`, `L > 0`, compact marks; for every fixed integer `q ≥ 2` there are `C_q, r_* > 0`\nsuch that `E_(Q_r^W)[ (N)_q ] ≤ C_q r^3` for `0 < r ≤ r_*`, all `b, k, R`. The radius\nthreshold is allowed to depend on `q` (the source's quantifier order is \"There are\n`C_q, r_* > 0` such that for `0 < r ≤ r_*`, all `b, k, R` and every fixed integer `q ≥ 2`\";\nthe weaker reading with `r_*` after `q` is stated).\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b\nAnchor: \"E_(Q_r^W)[ (N)_q ] <= C_q r^3.\"\nInterface: `I` is a given object; `N` is `torusWindowCount`; `(N)_q` is `Nat.descFactorial N q`.\nDoes not claim: the result or its proof (the cap `Psi` in `d` dimensions, the parametric Rouché tail, the marked Kac-Rice formula with Hölder insertion, the regimes R1-R4); the dependence on [C6L] and [DL] at their bytes; a lower bound for `q ≥ 3`; Corollary P; any numerical constant; nonauthor review or acceptance; that the count `torusWindowCount` (every critical point off the pins, degenerate ones included) equals the sum of the index counts: it dominates the source's all-index `N`, and the two agree only off the degenerate locus. -/\ndef PalmRoute" + }, + { + "kind": "def", + "unqualified_name": "PalmRouteSecondFactorialTheta", + "line": 876, + "source_header": "sis (Fin d) ℝ (E d),\n ∫ ω, (Nat.descFactorial (torusWindowCount d L Ω I r b k R ω) q : ℝ) ∂(I.QW r b k R) ≤\n Cq * r ^ 3\n\n/-- Shape of Corollary Theta (the C6 order is `r^3`): in every fixed `d ≥ 2`, there are\n`c > 0`, `C` and `r_* > 0` such that `c r^3 ≤ E_(Q_r^W)[ N(N-1) ] ≤ C r^3` and\n`c r^3 ≤ Q_r^W{ N ≥ 2 } ≤ C r^3` for `0 < r ≤ r_*`, all `b, k, R`.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_palm_route_20260929/PROOF.md sha256 aa37f16040ab9e05bb2e4e3f1d678367497e8dc2cf43eef197a4d6592c2f129b\nAnchor: \"c r^3 <= E_(Q_r^W)[ N(N-1) ] <= C r^3,\"\nInterface: `I` is a given object; `N` is `torusWindowCount`.\nDoes not claim: the lower bounds' source ([EDL] (A4)) or the upper bounds' sources (Theorem Q, [DL] Corollary M_d); that the logarithm of the Fourier cutoff is removed as a reviewed fact; any statement about the positions of the pairs; any numerical constant; nonauthor review or acceptance; that the count `torusWindowCount` (every critical point off the pins, degenerate ones included) equals the sum of the index counts: it dominates the source's all-index `N`, and the two agree only off the degenerate locus. -/\ndef PalmRouteS" + }, + { + "kind": "def", + "unqualified_name": "pmfTV", + "line": 897, + "source_header": "2 ≤ torusWindowCount d L Ω I r b k R ω}).toReal ∧\n ((I.QW r b k R) {ω | 2 ≤ torusWindowCount d L Ω I r b k R ω}).toReal ≤ C * r ^ 3\n\n/-! ### C6 rare-cluster consequences: Theorem O (abstract, on laws on ℕ) -/\n\n/-- Total-variation distance between two probability mass functions on `ℕ`: half the `l^1`\ndistance (the source's convention; equal to the supremum over events for probability laws).\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb\nAnchor: \"For probability laws, dTV is the supremum over measurable events, equivalently half the l1 distance on this countable state space.\"\nInterface: none; if the `l^1` series is not summable the `tsu" + }, + { + "kind": "def", + "unqualified_name": "poissonPMF", + "line": 909, + "source_header": "ith the event supremum (true for probability laws, not stated). -/\nnoncomputable def pmfTV (μ ν : ℕ → ℝ) : ℝ :=\n (1 / 2) * ∑' n : ℕ, |μ n - ν n|\n\n/-- The Poisson probability mass function `Pois(lam)(n) = exp(-lam) lam^n / n!`\n(for `lam ≥ 0`; `Pois(0) = δ_0`).\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb\nAnchor: \"dTV(Law N, Pois(lambda))\"\nInterface: none; an explicit formula (the so" + }, + { + "kind": "def", + "unqualified_name": "RareClusterPoissonObstructionO", + "line": 919, + "source_header": "one (true for `lam ≥ 0`, not stated). -/\nnoncomputable def poissonPMF (lam : ℝ) (n : ℕ) : ℝ :=\n Real.exp (-lam) * lam ^ n / (Nat.factorial n : ℝ)\n\n/-- Shape of Theorem O (sharp ordinary-Poisson obstruction): for a family of laws\n`μ_r` on `ℕ` (the law of the window count `N_r`) which, for all sufficiently small `r`\n(that is, for `0 < r ≤ r_0` for some `r_0 > 0`), are probability mass functions with\nsummable mean satisfying only (H1) `E N_r ≤ A r^3` and (H2) `P(N_r ≥ 2) ≥ a r^3` with\n`a > 0`: then, for all sufficiently small `r`,\n`(a/2) r^3 ≤ inf_{lambda ≥ 0} dTV(Law N_r, Pois(lambda)) ≤ A r^3`: every nonnegative\nintensity is at distance at least `(a/2) r^3`, and some intensity is within `A r^3`. The\nhypotheses are imposed only on `0 < r ≤ r_0`, as in the source (\"for all sufficiently small\nr\"); imposing (H2) for every `r > 0` would be unsatisfiable (`a r^3 ≤ 1` fails for large\n`r`) and would make the statement hold for every family. The source's remark that the\npremises imply `2a ≤ A` is not taken as a hypothesis.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/c6_rare_cluster_laws_20260929/PROOF.md sha256 c52a3cf197b5cf26071a8cc951e15ef3ac564b3d7453d41647f91af540a1b8eb\nAnchor: \"(a/2) r^3 <= inf_{lambda>=0} dTV(Law N, Pois(lambda)) <= A r^3.\"\nInterface: the laws `μ_r` are given probability mass functions on `ℕ` (nonnegative, summing to one, with summable mean) for `0 < r ≤ r_0`; the hypotheses (H1), (H2) are hypotheses on that range only; nothing ties `μ_r` to the Gaussian model here (the source says the only analytic inputs are H1, H2, Hq).\nDoes not claim: the result (Theorem O) or its proof; that `2a ≤ A` (derived in the source, not a hypothesis here); that H1 or H2 hold for the Gaussian window count (the source takes them from [D5] Theorem G_d and [C6] Corollary Theta); the mean-matched statement `lambda = mu`; Theorems C and S, the factorial-moment matching or the independent-replica limit; the conditional-law liminf remark; that the upper half is the source's infimum bound verbatim: `∃ lam ≥ 0, dTV(Law N_r, Pois(lam)) ≤ A r^3` implies `inf_{lam ≥ 0} dTV ≤ A r^3` and is stronger unless the infimum is attained, and the existential form is used because the source's proof exhibits the witness `lam = 0` (the source: The upper bound in (3.1) u" + }, + { + "kind": "def", + "unqualified_name": "RemoteCollisionSecondFactorialD", + "line": 945, + "source_header": "tar →\n (∀ lam : ℝ, 0 ≤ lam → (a / 2) * r ^ 3 ≤ pmfTV (μ r) (poissonPMF lam)) ∧\n (∃ lam : ℝ, 0 ≤ lam ∧ pmfTV (μ r) (poissonPMF lam) ≤ A * r ^ 3)\n\n/-! ### Remote collision (Corollary D) and the OPEN witness-collision target -/\n\n/-- Shape of Corollary D (second factorial moment in the fixed remote region): fixed `d ≥ 2`,\n`L > 0`, `0 < ρ < L/4`, compact marks; there are `C` and `r_* > 0` such that for\n`0 < r ≤ r_*`, all marks and frames and every Borel `E ⊆ D_ρ`,\n`E_(Q_r^W) N(E)(N(E)-1) ≤ C r^5 |E|` and `Q_r^W{ N(E) ≥ 2 } ≤ C r^5 |E|`, where\n`N(E) = sum_j N_j(E)` is the sum of the index-`j` window counts in `E`\n(`windowCountIndexSum`, the source's definition). Pairs at every mutual separation inside\n`D_ρ`, down to coincidence, are included.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path frontiers/remote_collision_20260928/PROOF.md sha256 b9b8b58fd8266db7ffe6537078003888ef138b445d3289ec5588f116af9050c2\nAnchor: \"E_(Q_r^W) N(E)(N(E)-1) <= C r^5 |E|,\"\nInterface: `I` is a given object; the pair Kac-Rice formula (3.1) and the divided-difference coordinates (4.1) are not transcribed.\nDoes not claim: Theorem C (the ordered near-pair count) or its proof (Lemmas 1-5); Corollaries E and F; a torus-wide second factorial moment or `math.rn-region.witness-collision` in its full sense; pairs with a witness near the pins; equality of `N(E)` with the all-critical-point count `windowCountAll` (they agree only off the degenerate locus); any numerical constant; nonauthor review or acceptance. -/\ndef Re" + }, + { + "kind": "def", + "unqualified_name": "WitnessCollisionNearPinPairsTarget", + "line": 971, + "source_header": "5 * (volume A).toReal ∧\n ((I.QW r b k R) {ω | 2 ≤ windowCountIndexSum d (I.F ω) b k r A}).toReal ≤\n C * r ^ 5 * (volume A).toReal\n\n/-- OPEN OBLIGATION, stated as a TARGET and not as a result. GRAPH node\n`math.rn-region.witness-collision` (classification OPEN_ACTIVE, catalog C6): the regional\nshrinking pin/witness-collision mechanism. The reconciliation describes what is missing as\na torus-wide second factorial moment of the window count \"with pairs where at least one\nwitness is within fixed `η` of a pin\", at every mutual separation (the fixed-remote `P_η`\nof Corollary D covers only pairs with both witnesses at distance `≥ η` from the pins). The\nProp below is that target: fixed `d ≥ 2`, `L > 0`, `η > 0`, compact marks; there are `C` and\n`r_* > 0` with `E_(Q_r^W) #{ordered window pairs with the first witness within η of a pin} ≤ C r^3`\nfor `0 < r ≤ r_*`, all `b, k, R`. No source in this packet establishes it; its register\nstatus is OPEN and this declaration does not change that.\n\nScope note (statement-shape review 5483861746 on Math- PR #419, 2026-10-11, AMEND_SCOPE_NOTE;\nnothing below changes the Prop): (i) the source's §5 states its open obligation for the planar\ncase and makes no claim for `d > 2`; the formal target quantifies every `d ≥ 2`, so its instances\nwith `d > 2` are a proposed generalisation carried by this packet, not a transcription of the\nsource's scope. (ii) `nearPinPairCount` counts ordered pairs whose FIRST witness is within `η` of\na pin; the source's \"at least one witness\" set is the union of that set with its swap, so (in the\nfinite case) it has between one and two times as many elements, and a bound `C r^3` here is a\nbound `2 C r^3` for the source's count: the orders agree, the functionals do not literally\ncoincide. (iii) `Set.ncard` is `0` on an infinite set and `PinnedLawInterface` supplies neither\nalmost-sure finiteness nor measurability of the pair population, so an infinite population would\nmake the integrand vanish spuriously; reading this Prop as the source's second factorial moment\nneeds those two facts about the law, which the interface does not provide and this Prop does not\nassume. The weighted law `I.QW` is a given field, not the source's six-pin regression.\n\nSource: d6g8k5htny-coder/Math- commit 6c020d6a72936632f2055122e71a7818a4ff497e path reviews/d5_reconciliation_20260929/RECONCILIATION.md sha256 14342b7eb0ad47c1c99b06be58fb6c901f5c7c72fc70f73e81de3dde50c23432\nAnchor: \"A torus-wide second factorial moment `E_{Q_r^W} N(N−1)` for the window count, with pairs where at least\"\nInterface: `I` is a given object; the pair count is `nearPinPairCount`.\nDoes not claim: that this target holds, is attainable, or is implied by any reviewed source (the Palm route's Theorem Q is an author-side candidate whose `q = 2` case would imply it; that candidate is stated separately as `PalmRouteFactorialMomentsQ` and is not consumed here); that the lower obstruction `E N(N−1) ≥ 2c r³` is stated here; the optimal order; any status transition of the node. -/\ndef Wit" + } + ] + } + ], + "attempts": [ + "Strict source identity checked where a gate exists; see individual logs.", + "Toolchain headers/native libraries repaired from pinned archive.", + "9/9 dependency Git commits materialized and clean.", + "Math build interrupted for official cache strategy; cache stopped at shared disk reserve." + ], + "isolation": "No Main formal import depends on Mathlib or these Math sources. Preserve all existing product source/tests and historical verdicts. This record does not silently disable repository tests or remove source files.", + "required_to_release": [ + "Reproduce the exact named package with the pinned full dependency cache and sufficient resource.", + "Run its actual all-constant axiom inventory, theorem-kind/type and proposition-premise capture, intended negative controls, and source-preservation checks.", + "For each claimed application, supply source-specific premise witnesses and exact statement alignment; do not substitute a parent claim for a generic conditional theorem." + ] + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "ALIGNMENT:MAIN_ARITHMETIC_PARENT_BOUNDARY", + "category": "statement_alignment_gap", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/MAIN_ARITHMETIC_PARENT_BOUNDARY.lean", + "sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd" + } + ], + "source_record_sha256": "23dfdecc38b625f81407baaa537221f5bdc3456b98257a5c978314443d916230", + "exact_boundary": { + "declarations": [ + "UniversalLaw.Side24.d2_endpoints_adjacent", + "UniversalLaw.Side24.d3_endpoints_adjacent" + ], + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Endpoints.lean", + "source_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd", + "gap": "These are Nat endpoint order/adjacency statements; no coefficient object occurs. No enclosure follows. ConeMoments arithmetic identities likewise do not identify Gaussian moments or spectral decompositions." + }, + "reason": "These are Nat endpoint order/adjacency statements; no coefficient object occurs. No enclosure follows. ConeMoments arithmetic identities likewise do not identify Gaussian moments or spectral decompositions.", + "attempts": [ + "Source-exposed exact declaration/source comparison recorded by Lean foundation worker; no new scientific acceptance." + ], + "minimal_repair": "Retain the31 closed literal arithmetic entries. A parent enclosure needs an exact coefficient definition plus proof-producing transcendental/integral bounds preserving the displayed endpoints.", + "original_record": { + "id": "MAIN_ARITHMETIC_PARENT_BOUNDARY", + "source_path": "/workspace/universal-law/website-repair-20261028/formal/UniversalLaw/Side24/Endpoints.lean", + "source_sha256": "095102245297707316cfd7e244d5509f9b102fe5aa638b7acdbbcf9d3c9d52bd", + "declarations": [ + "UniversalLaw.Side24.d2_endpoints_adjacent", + "UniversalLaw.Side24.d3_endpoints_adjacent" + ], + "gap": "These are Nat endpoint order/adjacency statements; no coefficient object occurs. No enclosure follows. ConeMoments arithmetic identities likewise do not identify Gaussian moments or spectral decompositions.", + "minimal_repair": "Retain the31 closed literal arithmetic entries. A parent enclosure needs an exact coefficient definition plus proof-producing transcendental/integral bounds preserving the displayed endpoints.", + "new_scientific_acceptance": false + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "ALIGNMENT:PAIR_LAW_SOURCE_BINDING", + "category": "statement_alignment_gap", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/PAIR_LAW_SOURCE_BINDING.lean", + "sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6" + } + ], + "source_record_sha256": "9a55667d3456e62385c66f9dc532120e06059512f7ba1fb6b20a287be2f72433", + "exact_boundary": { + "declarations": [ + "UniversalLaw.Spec.Lifetime.PairLawInterface", + "UniversalLaw.Spec.Lifetime.ParentUniformSelectionA", + "UniversalLaw.Spec.Lifetime.PlanarElderLowerE2", + "UniversalLaw.Spec.Lifetime.PlanarTwoSidedRateE4" + ], + "source_path": "/workspace/cbz0/repos/Math-/specifications/lean_statements_20261010/Specifications/Lifetime.lean", + "source_sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6", + "gap": "PairLawInterface fixes only0<=p<=1; no field ties p to G or I. Existing source explicitly warns universal closure of ParentUniformSelectionA over all inhabitants fails for p=0; p=1 defeats a strictly positive lower failure bound. These are existing source diagnoses, not newly kernel-checked counterexamples here." + }, + "reason": "PairLawInterface fixes only0<=p<=1; no field ties p to G or I. Existing source explicitly warns universal closure of ParentUniformSelectionA over all inhabitants fails for p=0; p=1 defeats a strictly positive lower failure bound. These are existing source diagnoses, not newly kernel-checked counterexamples here.", + "attempts": [ + "Source-exposed exact declaration/source comparison recorded by Lean foundation worker; no new scientific acceptance." + ], + "minimal_repair": "Build a separately named literal law/event binding and show it instantiates the unchanged original predicates. Preserve original Prop/source bytes and do not weaken bounds. Prove the geometric elder event identification and actual nonvacuity separately.", + "original_record": { + "id": "PAIR_LAW_SOURCE_BINDING", + "source_path": "/workspace/cbz0/repos/Math-/specifications/lean_statements_20261010/Specifications/Lifetime.lean", + "source_sha256": "90f4892608e953ecc696bb32ea159d1c178ceb8a1c6edfd11acfceb14af462c6", + "declarations": [ + "UniversalLaw.Spec.Lifetime.PairLawInterface", + "UniversalLaw.Spec.Lifetime.ParentUniformSelectionA", + "UniversalLaw.Spec.Lifetime.PlanarElderLowerE2", + "UniversalLaw.Spec.Lifetime.PlanarTwoSidedRateE4" + ], + "gap": "PairLawInterface fixes only0<=p<=1; no field ties p to G or I. Existing source explicitly warns universal closure of ParentUniformSelectionA over all inhabitants fails for p=0; p=1 defeats a strictly positive lower failure bound. These are existing source diagnoses, not newly kernel-checked counterexamples here.", + "minimal_repair": "Build a separately named literal law/event binding and show it instantiates the unchanged original predicates. Preserve original Prop/source bytes and do not weaken bounds. Prove the geometric elder event identification and actual nonvacuity separately.", + "new_scientific_acceptance": false + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "ALIGNMENT:RN_REGRESSION_PALM_BINDING", + "category": "statement_alignment_gap", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/RN_REGRESSION_PALM_BINDING.lean", + "sha256": "cad83a9d18029e66f2563f16a0850e846eb01dad0c3f08da6959ce0c186ae59c" + } + ], + "source_record_sha256": "0f60f1d0ef087b63923f51127b446732ab38e25cd0eef571a4733085b8b2dc8d", + "exact_boundary": { + "declarations": [ + "UniversalLaw.Spec.RN.PinnedLawInterface", + "UniversalLaw.Spec.RN.FixedRemoteMeanMeasureA2", + "UniversalLaw.Spec.RN.FixedRemoteCountBoundA3", + "UniversalLaw.Spec.RN.WitnessCollisionNearPinPairsTarget" + ], + "source_path": "/workspace/cbz0/repos/Math-/specifications/lean_statements_20261010/Specifications/RN.lean", + "source_sha256": "cad83a9d18029e66f2563f16a0850e846eb01dad0c3f08da6959ce0c186ae59c", + "gap": "The interface encodes pin support, weight typing, positive Z and normalized QW, while the law is not tied to the actual Gaussian field or a Kac-Rice intensity. Existing SCOPE records arbitrary-law countermodels and the regional collision target as open. Pin support and generic reweighting alone do not establish count/density assertions." + }, + "reason": "The interface encodes pin support, weight typing, positive Z and normalized QW, while the law is not tied to the actual Gaussian field or a Kac-Rice intensity. Existing SCOPE records arbitrary-law countermodels and the regional collision target as open. Pin support and generic reweighting alone do not establish count/density assertions.", + "attempts": [ + "Source-exposed exact declaration/source comparison recorded by Lean foundation worker; no new scientific acceptance." + ], + "minimal_repair": "Bind the literal whole-source conditional and weighted law to the intended field and events, prove the geometric Kac-Rice/Palm/counting identity and required regional shrinking collision bound. Do not substitute global factorial estimates.", + "original_record": { + "id": "RN_REGRESSION_PALM_BINDING", + "source_path": "/workspace/cbz0/repos/Math-/specifications/lean_statements_20261010/Specifications/RN.lean", + "source_sha256": "cad83a9d18029e66f2563f16a0850e846eb01dad0c3f08da6959ce0c186ae59c", + "declarations": [ + "UniversalLaw.Spec.RN.PinnedLawInterface", + "UniversalLaw.Spec.RN.FixedRemoteMeanMeasureA2", + "UniversalLaw.Spec.RN.FixedRemoteCountBoundA3", + "UniversalLaw.Spec.RN.WitnessCollisionNearPinPairsTarget" + ], + "gap": "The interface encodes pin support, weight typing, positive Z and normalized QW, while the law is not tied to the actual Gaussian field or a Kac-Rice intensity. Existing SCOPE records arbitrary-law countermodels and the regional collision target as open. Pin support and generic reweighting alone do not establish count/density assertions.", + "minimal_repair": "Bind the literal whole-source conditional and weighted law to the intended field and events, prove the geometric Kac-Rice/Palm/counting identity and required regional shrinking collision bound. Do not substitute global factorial estimates.", + "new_scientific_acceptance": false + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "ALIGNMENT:SIDE24_EXACT_ENCLOSURE", + "category": "statement_alignment_gap", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/SIDE24_EXACT_ENCLOSURE.lean", + "sha256": "3164ccfd527d5d443c3830ae871e5592abc6658dc3678006da368fdace3818e3" + } + ], + "source_record_sha256": "2c41caeb7435008caa7f89aa5af949e9057e072dd14a9b7029bf3db3ac0b4249", + "exact_boundary": { + "declarations": [ + "UniversalLaw.Spec.Side24.PeriodicCoefficientInterface2", + "UniversalLaw.Spec.Side24.CoefficientEnclosure2", + "UniversalLaw.Spec.Side24.ReferenceComparison2" + ], + "source_path": "/workspace/cbz0/repos/Math-/specifications/lean_statements_20261010/Specifications/Side24.lean", + "source_sha256": "3164ccfd527d5d443c3830ae871e5592abc6658dc3678006da368fdace3818e3", + "gap": "CoefficientEnclosure2 and ReferenceComparison2 remain specified Props; source scope requires proof-producing bounds for Gamma(7/6), pi, exp, theta sums and the Gaussian cone integral. Endpoint adjacency or floating estimates are insufficient." + }, + "reason": "CoefficientEnclosure2 and ReferenceComparison2 remain specified Props; source scope requires proof-producing bounds for Gamma(7/6), pi, exp, theta sums and the Gaussian cone integral. Endpoint adjacency or floating estimates are insufficient.", + "attempts": [ + "Source-exposed exact declaration/source comparison recorded by Lean foundation worker; no new scientific acceptance." + ], + "minimal_repair": "Keep exact decimal endpoints and source coefficient definition. Produce rational/proof-producing interval certificates and kernel proofs for all analytic ingredients; no float certification or weakened enclosure.", + "original_record": { + "id": "SIDE24_EXACT_ENCLOSURE", + "source_path": "/workspace/cbz0/repos/Math-/specifications/lean_statements_20261010/Specifications/Side24.lean", + "source_sha256": "3164ccfd527d5d443c3830ae871e5592abc6658dc3678006da368fdace3818e3", + "declarations": [ + "UniversalLaw.Spec.Side24.PeriodicCoefficientInterface2", + "UniversalLaw.Spec.Side24.CoefficientEnclosure2", + "UniversalLaw.Spec.Side24.ReferenceComparison2" + ], + "gap": "CoefficientEnclosure2 and ReferenceComparison2 remain specified Props; source scope requires proof-producing bounds for Gamma(7/6), pi, exp, theta sums and the Gaussian cone integral. Endpoint adjacency or floating estimates are insufficient.", + "minimal_repair": "Keep exact decimal endpoints and source coefficient definition. Produce rational/proof-producing interval certificates and kernel proofs for all analytic ingredients; no float certification or weakened enclosure.", + "new_scientific_acceptance": false + } + }, + { + "status": "QUARANTINED", + "owner": "none", + "dependencies": [], + "isolation": "Archival contribution source/application record only. Not imported by the closed dependency-free Main arithmetic modules; no CLOSED record depends on this record. No failing test is removed or disabled.", + "scientific_closure_limits": "Application-level kernel closure and exact source-statement alignment are not established. Historical classifications and source mathematics are preserved; quarantine does not assert falsity.", + "id": "ALIGNMENT:ACTUAL_FIELD_WITNESS_PRESENT_BUT_NOT_PARENT", + "category": "statement_alignment_gap", + "source_hashes": [ + { + "path": "cbz/evidence/website-foundation-20261029/sources/alignment/ACTUAL_FIELD_WITNESS_PRESENT_BUT_NOT_PARENT.lean", + "sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a" + } + ], + "source_record_sha256": "8a2879621c15f1ff20cebb8ba2bd9254ab3bcd8d1e97cebf5141c8d0e4b49065", + "exact_boundary": { + "declarations": [ + "I4LifetimeField.actualGaussianFieldInterface", + "I4LifetimeField.actualGaussianFieldInterface_exists" + ], + "source_path": "/workspace/cbz0/repos/Math-/frontiers/source_lifetime_realization_20261017/SourceLifetimeField.lean", + "source_sha256": "daf0949a14d4ed8bd19fbdc564f0f8c3fad72ed243de73e39d65b2951576919a", + "gap": "A literal GaussianFieldInterface constructor with only00.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-F", + "external_theorem_imports": [], + "fingerprint": "e955143df27a1879a7fad84a67f5eeca259cfd07a1e544a393bcb55771bff1a5", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-F", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem F, (F1)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-F:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and torus, original pin law, compact positive-gap marks; cap counts ALL critical points, not only narrow-window points.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-PALM-Q", + "external_theorem_imports": [], + "fingerprint": "14323b2c7e8213be311170d6623fba5a3f4e0f98356b7217770acc476c5fc980", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-PALM-Q", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D5d-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§1 Theorem Q / Corollary Theta", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/820d4435c5f13c12b9c2f3590e859212d2648dc0/frontiers/c6_palm_route_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/820d4435c5f13c12b9c2f3590e859212d2648dc0/frontiers/c6_palm_route_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-PALM-Q:scope", + "origin": "verbatim_curated_scope", + "text": "Each fixed d>=2,L; original weighted pins; compact B,K with k_->0; N counts window critical points excluding the pins; consumes separately accepted dimensional D5 first-moment input; no spatial Poisson law.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-RARE-CPOISSON", + "external_theorem_imports": [], + "fingerprint": "30aec8c151fbad0cd2b70232c24b9fea454020cc136c5bc44ac25c252c0c0203", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-RARE-CPOISSON", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "C6-PALM-Q", + "D5d-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§4 Theorem C (4.1)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/REVIEW_RECORD.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-RARE-CPOISSON:scope", + "origin": "verbatim_curated_scope", + "text": "H1 and H2; F=Law(N | N>0) is generally unknown and depends on r. This does not identify a limiting cluster distribution or an in-field spatial clustering process.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-RARE-POISSON", + "external_theorem_imports": [], + "fingerprint": "345f6cc5556005e92a743f9b9d86e4fde0c1a64256575392147ad8989f0e72f0", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-RARE-POISSON", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "C6-PALM-Q", + "D5d-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3 Theorem O (3.1)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/REVIEW_RECORD.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-RARE-POISSON:scope", + "origin": "verbatim_curated_scope", + "text": "Abstract assumptions H1: EN<=A r^3 and H2: P(N>=2)>=a r^3, with a,A>0; original Gaussian application needs the accepted D5 and sharp C6 inputs. Not a positive Poisson limit claim.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-RARE-REPLICAS", + "external_theorem_imports": [], + "fingerprint": "2bce1fece049732e0622a11e557f91292af4983cfae3856e600965167422b719", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-RARE-REPLICAS", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "C6-PALM-Q", + "D5d-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§6–7 Theorem S and independent replicas (7.1)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/REVIEW_RECORD.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/190cf2bd4f31c7caf219d5d9b3d1fa468c450ea6/frontiers/c6_rare_cluster_laws_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-RARE-REPLICAS:scope", + "origin": "verbatim_curated_scope", + "text": "H1,H2 and every fixed factorial Hq; subsequence with nu_r -> nu, and m_r=floor(t/r^3) independent whole-field replicas; NOT independent spatial cells in one realization; no unique limit asserted.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "C6-W", + "external_theorem_imports": [], + "fingerprint": "955674af1d533fccbbe33f2649447afe502e3172b637f1ab0fe8b524960e5693", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:C6-W", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "C6-F", + "D5-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem W, (F3)–(F4)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/4d59319b7fbe0790ebd5a1482bc91c4d9cc2d4f3/frontiers/c6_fourier_cutoff_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:C6-W:scope", + "origin": "verbatim_curated_scope", + "text": "p≥2 fixed; general dimension conditional on G_d; planar case uses reviewed D5 first moment and full reading rule.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-01", + "external_theorem_imports": [], + "fingerprint": "0440670dc5bba47a4bf87d4574d98baa2e531aee2d61f68818e8630f3a6b0648", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-01", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§1", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-01:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d ≥ 2 and side L > 0; the exact periodized model, not the minimum-image approximation.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-02", + "external_theorem_imports": [], + "fingerprint": "d8ab1e2719c8382d43e4d78d97470b052d5d9290bcf9802babf7d5adbf94bd18", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-02", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§1", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-02:scope", + "origin": "verbatim_curated_scope", + "text": "Unit axial vector u; b in compact birth interval, k in a compact positive-gap interval, and original full normalizer.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-03", + "external_theorem_imports": [], + "fingerprint": "869acbe742498050c11cf1aec0f3455053ab5dd2bb2b4a9550a7caa9760df9f4", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-03", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V10" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§2, Fourier representation", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-03:scope", + "origin": "verbatim_curated_scope", + "text": "The precise periodized covariance and nonduplicate symmetric-jet coordinates.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-04", + "external_theorem_imports": [], + "fingerprint": "a5a068fa0eb1528c15869400f1d344bb236ddadbc2095bcfcb9210a232a42e93", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-04", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3, Eq. (3.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-04:scope", + "origin": "verbatim_curated_scope", + "text": "The original axial and transverse observation ordering; r>0.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-A", + "external_theorem_imports": [], + "fingerprint": "4dc900b5d3754d41fe77da082ce280390913fb0d38fdf57423a7300b984b744b", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-A", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D1-02", + "D1-CAP-ELDER", + "D1-CAP-MATRIX", + "D1-CORR-CONG", + "D1-CORR-SCOPE", + "D1-ELDER-MEAS" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem A, Eq. (1.1)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-A:scope", + "origin": "verbatim_curated_scope", + "text": "Uniform over compact birth and strictly positive gap-mark intervals and all orthonormal frames; sufficiently small r and reading-rule corrections apply.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [ + "SRC-D1-ERRATUM", + "SRC-D1-PARENT", + "SRC-D1-RECON", + "SRC-D1-REPAIR" + ], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-B", + "external_theorem_imports": [], + "fingerprint": "928c60b2f0ad846074e6f1d7ad31f207d3736f7b0925af5f7be0227afabc4c95", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-B", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D1-A", + "D1-EQ-COMPACT", + "D1-KR-BOREL", + "D1-KR-JACOB" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem B, Eq. (1.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-B:scope", + "origin": "verbatim_curated_scope", + "text": "B,K must be compact intervals of positive length, with K bounded away from zero; restricted pair distance; fixed d,L.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [ + "SRC-D1-ERRATUM", + "SRC-D1-PARENT", + "SRC-D1-RECON", + "SRC-D1-REPAIR" + ], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-C", + "external_theorem_imports": [], + "fingerprint": "19bdf099d52360e4e2b1dacb2b7013ee61f60f28be80219322da01eb325e4b6d", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-C", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D1-A", + "D1-KR-BOREL", + "D1-KR-DOM", + "D1-KR-FAR" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem C, Eq. (1.3)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-C:scope", + "origin": "verbatim_curated_scope", + "text": "All births, positive gap marks, orientations and spatial separations at fixed d,L. Essential global maximum class excluded. The compact-window difference rate is NOT imported.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [ + "SRC-D1-ERRATUM", + "SRC-D1-PARENT", + "SRC-D1-RECON", + "SRC-D1-REPAIR" + ], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CAP-ELDER", + "external_theorem_imports": [], + "fingerprint": "4776516b32941a0342368bcada751000651b3297281d15f6fa65572177a385e7", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CAP-ELDER", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V32" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-CAP-RIDGE" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§§4–5, eqs. (13)–(14) and maximin argument", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CAP-ELDER:scope", + "origin": "verbatim_curated_scope", + "text": "C⁴ deterministic embedded cylinder; extends to a global compact Morse manifold with distinct critical values; exactly sufficient, not necessary, for pairing; unique ascending branch statement uses gradient-flow assumptions, ridge never identified with that branch.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CAP-HERMITE", + "external_theorem_imports": [], + "fingerprint": "51b845201143d307364af61000bc2b19eca21308333a1c838eb8299c4e6ea014", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CAP-HERMITE", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V29" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§§2–3, eqs. (4)–(8)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CAP-HERMITE:scope", + "origin": "verbatim_curated_scope", + "text": "C⁴ deterministic function; r>0 embedded product cylinder [-2r,2r]×closed ball radius 2r; critical pins ±r/2, exact gap κr³; normalized κ=1/6 until rescaled. Partial-block operator norms, not arbitrary scalar Hessian entries.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CAP-MATRIX", + "external_theorem_imports": [], + "fingerprint": "1e8734fb1af32ebfccbcd3fbfaa26a8c6c9607c47b1bfe7ea68bc871f0595110", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CAP-MATRIX", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V31" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§§5–6 eqs. (5.1), (5.3), (6.1), (6.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CAP-MATRIX:scope", + "origin": "verbatim_curated_scope", + "text": "d≥2, transverse m=d−1, A_M<0 on typed maximum support, H_S index d−1; |α_i|,||β_i||≤M_3/2, ||A_S-A_M||≤rM_3; sharpness refers to abstract matrix relaxation only, not Gaussian failure probability.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CAP-RIDGE", + "external_theorem_imports": [], + "fingerprint": "3fc314d535b4922eaa7a43d6767cb40157a64fc944bbedc38f23ad0077261003", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CAP-RIDGE", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V30" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-CAP-HERMITE" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§§3–4, eqs. (9)–(12)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_theorem_a_nonauthor_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/MARKED_CYLINDER_CAP_PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CAP-RIDGE:scope", + "origin": "verbatim_curated_scope", + "text": "Same embedded C⁴ marked-cylinder hypotheses as D1-CAP-HERMITE; normalized κ=1/6; F=∂x f(x,h(x)), not the gradient trajectory. No assertion that the ridge equals any Morse flow line.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-COR-CUMULATIVE", + "external_theorem_imports": [], + "fingerprint": "92bd61f41fab7921fe52c1e148cca8e4209321340b0f608367e4b03803123e2e", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-COR-CUMULATIVE", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V08" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-B" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§12 (12.1)–(12.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-COR-CUMULATIVE:scope", + "origin": "verbatim_curated_scope", + "text": "Same compact birth/gap restriction as Theorem B; t down to 0; q>-2/3 for the moment asymptotic. No unrestricted selection-loss rate.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CORR-CONG", + "external_theorem_imports": [], + "fingerprint": "9ea0e5f480fccfeaac6f6ba8a1d1302276b1fa8380fd344cc4f2448dd4043660", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CORR-CONG", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V33" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5 mandatory erratum E1; reconciliation §1", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/ERRATUM_CONGRUENCE.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CORR-CONG:scope", + "origin": "verbatim_curated_scope", + "text": "Exactly parent Section 5 A3 with amendment E1; no new theorem/status promotion.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-CORR-SCOPE", + "external_theorem_imports": [], + "fingerprint": "18cffbbac2f5f8f9a9a8c399f2743b0fc6ec3dc96ab7e31ea31ef0f810affc78", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-CORR-SCOPE", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V34" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§1 reading rule E3, §5 W1 and embedded radius", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-CORR-SCOPE:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d>=2, L>0, compact positive marks; W1 and embedding bound E3 from reconciled reading rule. Do not infer A_M -> A_0 in probability.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-ELDER-MEAS", + "external_theorem_imports": [ + "EXT-MORSE-ELDER" + ], + "fingerprint": "b11e650c3b0ca82f7b3e4d61c739fce7583433b747ff969778f5847992e3b26a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-ELDER-MEAS", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V35" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§8 pinned genericity and global Borel pairing", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-ELDER-MEAS:scope", + "origin": "verbatim_curated_scope", + "text": "Smooth functions on compact manifold, Morse and distinct critical values; rational polygonal paths only approximate strict superlevel connectivity. Identification as elder partner uses the specified superlevel H0 convention.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-EQ-COMPACT", + "external_theorem_imports": [], + "fingerprint": "7ae93560f4166610af6967943535dcd73cc92fecb23790aa1230ff54126cb388", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-EQ-COMPACT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§11 (11.3)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-EQ-COMPACT:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d,L; B,K compact positive-length intervals with k_->0; unnormalized full pin density/normalizer, sphere area measure. No numerical evaluation.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-EQ-GLOBAL", + "external_theorem_imports": [], + "fingerprint": "81df579875a93b1c7ca1b909103970ff328290c356cdbc6b2a5d50d1f022a4a6", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-EQ-GLOBAL", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§15 (15.1)–(15.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/82247833b5dd58e04291d55353b52938d73ec614/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-EQ-GLOBAL:scope", + "origin": "verbatim_curated_scope", + "text": "Exact periodized covariance, every fixed d>=2 and L. 24 is an algebraic prefactor, not the torus side length; coefficient not numerically evaluated here.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-KR-BOREL", + "external_theorem_imports": [ + "EXT-C2-KERNEL", + "EXT-KR-AAL" + ], + "fingerprint": "443019d2b2f711d2b789ea99b366db41aa7945d80f3262a312942b7cb9d5da86", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-KR-BOREL", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V37" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-ELDER-MEAS", + "D1-KR-KERNEL" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Replacement §§9.2–9.4, reviewed C1–C6", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_section9_borel_repair_20260925/REPAIR.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-KR-BOREL:scope", + "origin": "verbatim_curated_scope", + "text": "Requires verified unweighted Kac–Rice and continuous-weight theorem hypotheses on compact off-diagonal D, finite total masses, C²-valued conditional kernel, and the Borel elder mark. The cited external general theorem is imported, NOT independently proved.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [ + "SRC-D1-ERRATUM", + "SRC-D1-PARENT", + "SRC-D1-RECON", + "SRC-D1-REPAIR" + ], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-KR-DOM", + "external_theorem_imports": [ + "EXT-GAUSS-MOMENTS", + "EXT-KR-OFFDIAG" + ], + "fingerprint": "417a1f3e4f383ad486379e4bfb46e1e49f7993d9fcc0379b2a1a593f6fd7fef6", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-KR-DOM", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V39" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-KR-JACOB" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§13 (13.3)–(13.6), plus replacement §9 final exhaustion", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-KR-DOM:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d,L and r≤r0; all real b and k>0; uses prior Gaussian residual uniform moments, positivity and local convergence of full normalizer and pair density, and marked Kac–Rice. Does not prove unrestricted O(1) density remainder.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [ + "SRC-D1-ERRATUM", + "SRC-D1-PARENT", + "SRC-D1-RECON", + "SRC-D1-REPAIR" + ], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D1-KR-FAR", + "external_theorem_imports": [ + "EXT-GAUSS-MOMENTS" + ], + "fingerprint": "addba3ecbe685a865f21f88440a18fb29a7da100f06ab4dd99d9c09cebc0ff2e", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D1-KR-FAR", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V40" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§14 (14.1)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d1_chain_reconciliation_20260928/RECONCILIATION.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/imports/lifetime_parent_20260925/UNIFORM_MATRIX_CAP_AND_LIFETIME.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D1-KR-FAR:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed compact torus, r0>0, 0=2, torus L and compact birth/gap windows with k_->0, all frames, sufficiently small r. Existential constants only. Lower proof and D1 upper have separate review provenance.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-CUMULATIVE-CORRECTION", + "external_theorem_imports": [], + "fingerprint": "ef8681afbe7a78b5425b4e4b2ca7764f1c1b25e0a404aff7b0655582b5599b21", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-CUMULATIVE-CORRECTION", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V07" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Corrected cumulative theorem, §1 and proof", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/d2_cumulative_correction_20260925/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/collision_mechanism_20260925/CUMULATIVE_TRANSFER_CORRECTION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-CUMULATIVE-CORRECTION:scope", + "origin": "verbatim_curated_scope", + "text": "σ-finite (Z,λ), α>-1, m>0, κ>0; 0≤B≤G, B→B0, integrable G κ^{-β}; h continuous strictly increasing, h(0+)=0, h/(κ r^m)→1, and h≥c0 κ r^m uniformly. Positive asymptotic equivalence only if coefficient positive; zero coefficient yields o(ℓ^β). No derivative or density limit follows.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-LEM-R31", + "external_theorem_imports": [], + "fingerprint": "b24f1e88c9f35a933684039d92fbd3e15ef42f30c4dcd52c9b7f8426758e6b3d", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-LEM-R31", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V01" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3 Lemma R3.1 (R6)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-LEM-R31:scope", + "origin": "verbatim_curated_scope", + "text": "Real symmetric n by n X,Y, with F_j=0 on singular matrices; index counts negative eigenvalues.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-LEM-R32", + "external_theorem_imports": [], + "fingerprint": "e8963d2d57b16baef69ccd4d9a5bd01aa2d2ea5e27494534ff8cf6f49c77884a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-LEM-R32", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V02" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3 Lemma R3.2 (R7)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-LEM-R32:scope", + "origin": "verbatim_curated_scope", + "text": "Real symmetric A, scalar alpha, beta vector, r>=0; no inverse of A needed, even if A singular.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-OBS", + "external_theorem_imports": [], + "fingerprint": "2696ed189f5de73fb9d3140325a5eebe445c104b0e411bc0f0555527a9a1c5d7", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-OBS", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V15" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§2, axial transform and (R2)–(R4)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-OBS:scope", + "origin": "verbatim_curated_scope", + "text": "Smooth scalar axial field; r>0 and symmetric pins ±r/2; d−1 transverse derivative pairs. Formal Taylor identity alone does not prove Gaussian-field Lp coupling.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-R", + "external_theorem_imports": [], + "fingerprint": "6e41a68ceb4961bd89bd137351c9540a245885a5730291c56f49306d65e39323", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-R", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V23" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-02", + "D1-KR-BOREL", + "D1-KR-FAR", + "D1-KR-JACOB", + "D2-LEM-R31", + "D2-LEM-R32", + "D2-OBS", + "D2-R11-INTENSITY", + "D2-R12-TAILS" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem R, Eq. (R1)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-R:scope", + "origin": "verbatim_curated_scope", + "text": "For sufficiently small ℓ in the exact fixed d,L field, using the parent theorem interfaces. C and lifetime cutoff are existential; no second coefficient.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-R11-GAUSS", + "external_theorem_imports": [ + "EXT-GAUSS-MOMENTS" + ], + "fingerprint": "a531502db038fe6ea93a07eb4e3139302d8f03078b37f04dd660ebf4385aad2c", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-R11-GAUSS", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V24" + ], + "premise_bases": "source_explicit", + "premises": [ + "D1-03", + "D2-OBS" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§2 (R2)–(R5)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-R11-GAUSS:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d,L, compact orientation space, sufficiently small r; exact periodized Gaussian field with nondegenerate finite contact jets. Covariance/target interpolation, not a proof of Kac–Rice selection.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D2-R11-INTENSITY", + "external_theorem_imports": [], + "fingerprint": "4ffc803988b71225b6f2bbc441109f36f1e13800f8e257e56b13c9b7517a6f53", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D2-R11-INTENSITY", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V25" + ], + "premise_bases": "source_explicit", + "premises": [ + "D2-LEM-R31", + "D2-LEM-R32", + "D2-R11-GAUSS" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§4 (R8)–(R11)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/LIFETIME_REMAINDER.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D2-R11-INTENSITY:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d,L; every b∈R,k>0; 0=2, L, compact birth/gap marks with k_->0, fixed rho>0 and eta0<=rho/2, Borel E contained outside fixed pin disk, window I_r=(b−kr³,b), original determinant tilt and full normalizer. No torus-wide collision or elder-pairing conclusion. Scoped review accepts near O(r^5) and separated O(r^6), not full source indiscriminately.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-DET", + "external_theorem_imports": [], + "fingerprint": "b7c95becbc540ee57747516d8639f64633f31309556711cfc413745c74266d55", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-DET", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V16" + ], + "premise_bases": "source_explicit", + "premises": [ + "D4-REG" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§4 Eqs. (8)–(10)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-DET:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Every fixed finite p; full typed endpoint factors, not scalar determinants alone.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-JET", + "external_theorem_imports": [], + "fingerprint": "f74c351db4dee9bd060b66fc0182a261816d8422735bef05a5f15723aa601e1b", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-JET", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D1-02", + "D1-03" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§2 and review interface 1", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-JET:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Distinct nonduplicate derivative coordinates; full Fourier spectrum, r small.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-KERNEL", + "external_theorem_imports": [], + "fingerprint": "4a0d563150468abb8af0c82719762d38c200ff5a181edb623d0d2232b4d93b1e", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-KERNEL", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-KR" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5 Eq. (13)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-KERNEL:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Only remote sites; no independence assumption between midpoint and witness Hessians.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-KR", + "external_theorem_imports": [ + "EXT-KR-AAL" + ], + "fingerprint": "a42bd5a8500d50da781a61d1044b97972423dff33fc9e3ec12da1848a55b548d", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-KR", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V18" + ], + "premise_bases": "source_explicit", + "premises": [ + "D4-DET", + "D4-REG", + "D4-Z" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5 Eq. (12)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-KR:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. E any Borel subset of D_ρ; j any negative-Hessian index. No extra pin Jacobian.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-NUM", + "external_theorem_imports": [], + "fingerprint": "65faa7782ff91d15a1bbca4c9708ceb619f6223698a8a0807e0c8009276a4f3f", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-NUM", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V19" + ], + "premise_bases": "source_explicit", + "premises": [ + "D4-KR" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5 Eq. (14)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-NUM:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. E Borel in fixed D_ρ; no estimate when ρ→0.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-REG", + "external_theorem_imports": [ + "EXT-GAUSS-MOMENTS" + ], + "fingerprint": "d1e165c5c83610e317c496716dbd399d78e1000cf5b7822838299609d848cb3a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-REG", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-JET" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3 Eq. (5)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-REG:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Fixed finite derivative order q and moment p, t∈(b−kr³,b).", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-REMOTE-PAIR", + "external_theorem_imports": [], + "fingerprint": "74689b0bd9365b7e6324f3fc8e89046e4f4dc255d1bbfac4d98445976924d1f4", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-REMOTE-PAIR", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-TUPLE" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§6 (15)–(16)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-REMOTE-PAIR:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed remote cutoff rho>0 and pairwise witness separation eta>0; every fixed integer m; only points in the shrinking between-pin height window, not collisions at vanishing separation.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-SELECT", + "external_theorem_imports": [], + "fingerprint": "549611c183328487e2a003f87251513c16ad6bfe5be2ac034dc7963ddbec6c78", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-SELECT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-01" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§7 fixed-remote selector crosswalk", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-SELECT:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Selector must require the same index j, fixed D_ρ location and between-pin height; NOT a universal RN selector.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-TUPLE", + "external_theorem_imports": [], + "fingerprint": "dbff1ba69c6d069ad23f6fac4cad458ddefcdc4da223f4a6cee93fcdb5cb61d4", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-TUPLE", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D4-JET", + "D4-KR", + "D4-Z" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§6 Eq. (15)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-TUPLE:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. Each fixed integer m≥2 and fixed pairwise separation η>0; no η(r)→0 claim.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D4-Z", + "external_theorem_imports": [], + "fingerprint": "0fcb4f496205f6f21416a020955aa11554ffe265022be290899468f6e458b80d", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D4-Z", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V17" + ], + "premise_bases": "source_explicit", + "premises": [ + "D4-DET" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§4 Eq. (11)", + "review": "https://github.com/d6g8k5htny-coder/main/issues/76", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/191ea7d541a486736ba7bbddfd4eac25a6c4567b/frontiers/remote_window_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D4-Z:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2 and L; 0<ρ0; fixed torus, all frames, sufficiently small r; remote x∈D_ρ. Original endpoint-only normalizer. z0 uses endpoint-only contact conditioning; no geometric restriction in Z_r.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-ANN-R1", + "external_theorem_imports": [], + "fingerprint": "e98788a0c4513cfb1a5ce7be8dc39eb5c08d6ead8d0c55f1e463982f50b22f05", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-ANN-R1", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "R1; proof §§3–4, (9)–(11)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-ANN-R1:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 01. The bound relies on all minors, not just the axial minor.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-ANN-R3", + "external_theorem_imports": [], + "fingerprint": "384c89bdbf264cbdf69570e52acdface61d7498185eea299201f8203fcc87fc5", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-ANN-R3", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D5-ANN-R2" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "R3; proof §5, (14)–(15)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-ANN-R3:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 00 is essential to the uniform floor.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-ANN-R6", + "external_theorem_imports": [ + "EXT-KR-AAL" + ], + "fingerprint": "38c95ea7e9b3f02f697bd793f13c68ca5f156daa92c495e6d1c43a83d57cc5be", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-ANN-R6", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D5-ANN-R2", + "D5-ANN-R5" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "R6; proof §7, (16)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/pr28_annulus_bridge_nonauthor_20260925/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/dedc69e1b786f7ad148e6b66718277f4145c99cd/frontiers/rn_annulus_bridge_20260925/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-ANN-R6:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed dimension d=2 and torus L; original periodized covariance and six conditioned pin observations; compact birth interval and 0=k_->0; original six conditioned pins and determinant tilt; j=0,1,2; all heights. No uniform-in-L, higher-d, pin, mesoscopic, growing-annulus, collision or numerical claim.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-C", + "external_theorem_imports": [], + "fingerprint": "d7b4891419819eac69001f32321a3099afdb5352d3f895c7a54037a96b5fa192", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-C", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "D5-c / C1", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-C:scope", + "origin": "verbatim_curated_scope", + "text": "Planar, fixed collar separated from pin sites; full weighted law.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-FIXED-ANNULUS-WINDOW", + "external_theorem_imports": [], + "fingerprint": "28004e173309673f5362753b9e145a1ffec43dca4f1fd9cb178d6093d5e5aa2f", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-FIXED-ANNULUS-WINDOW", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D5-TWOSCALE-S6S21" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "A2; fixed-annulus candidate §1 and review eight interfaces", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/pr22_fixed_annulus_nonauthor_20260925/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/2804dc1db27ef3b1fdef6bb350b486162692cc4a/frontiers/rn_thin_tube_20260925/FIXED_ANNULUS_CANDIDATE.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-FIXED-ANNULUS-WINDOW:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed dimension two, fixed torus side, compact marks with positive k_-, fixed annulus 11; |w|<=W, compact b and k>=k0>0, all frames, small r. This is a gradient density only, not a weighted count or a bound on a fixed-width scaled belt.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-M", + "external_theorem_imports": [], + "fingerprint": "6dfcab6f736f0611cb39ff83edc33deadf4c13519d30593351c825f2e1ff2994", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-M", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "D5-b", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-M:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed κ, planar law; analogous estimate for S; all critical-point heights.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-P", + "external_theorem_imports": [], + "fingerprint": "9fd79cf6a9ead338bd529032e4adc1ea729d91e6cf132889b99a909b33c53e47", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-P", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "D5-a / P2", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79f9a73596b1ce925034bd426c005a3251693c1b/reviews/d5_reconciliation_20260929/RECONCILIATION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-P:scope", + "origin": "verbatim_curated_scope", + "text": "Original weighted six-observation pin law; fixed planar torus; compact strictly positive-gap marks; all heights in punctured pin disks.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5-TWOSCALE-S6S21", + "external_theorem_imports": [], + "fingerprint": "6a8734c9382069a508d8d55d260902409fc1abed93e6987f8fd9bd30a1b13e5b", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5-TWOSCALE-S6S21", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "S6–S21 and S3–S5", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/reviews/replacement_20260925_pr19_pr21/TWO_SCALE_REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/b2e1652f1374c3b45759324a1ad1fd4177458500/frontiers/rn_thin_tube_20260925/TWO_SCALE_ADDENDUM.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5-TWOSCALE-S6S21:scope", + "origin": "verbatim_curated_scope", + "text": "The S6–S21 packet is reviewed only for the stated inner two-scale interfaces and associated S3–S5 bounds, not for a whole fixed annulus, complete regional theorem, or all-height result.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-C", + "external_theorem_imports": [], + "fingerprint": "699d112c38962bed9dfdc1e0940cb77e96d73bb132a0a2c14de6a3629d788cb2", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-C", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem C_d, (1.3)–(1.4)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-C:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d≥2, fixed radius and collar exclusion, original weighted law; all heights.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-F", + "external_theorem_imports": [], + "fingerprint": "a338a8a22dfcb1bdaa8ea9fae35b73a2c7a2eba35be40522be552fb8dc86d7b0", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-F", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "D5d-G" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Corollary F_d, (1.8)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-F:scope", + "origin": "verbatim_curated_scope", + "text": "Every fixed d≥2; A_r means one or more nonpin critical points in the between-pin height window.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-G", + "external_theorem_imports": [], + "fingerprint": "b9c05069d1308ba6ea7c84865635b42818358e13aa45b3c69cd3dc907aafa318", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-G", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem G_d, (1.7)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-G:scope", + "origin": "verbatim_curated_scope", + "text": "Every fixed d≥2 and L; original pinned and tilted law; window restriction is essential.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-I", + "external_theorem_imports": [], + "fingerprint": "b35bb35632de9b11abdf130e6a84e9365f07201b53f633aea5a1fe01891950de", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-I", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem I_d, (1.5)–(1.6)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-I:scope", + "origin": "verbatim_curated_scope", + "text": "Every fixed d≥2; 00.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-M", + "external_theorem_imports": [], + "fingerprint": "5cbceb8142b3791f3f861d7b7ae285617e79112b04183aa207df2a7685b64566", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-M", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Corollary M_d, (1.9)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-M:scope", + "origin": "verbatim_curated_scope", + "text": "Every fixed d≥2; no matching upper bound for the second factorial moment claimed here.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "D5d-P", + "external_theorem_imports": [], + "fingerprint": "a58576bc63f43a6f3ac3240ac0bca84ff86ceb3e7897eca4b6675026c8bb2619", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:D5d-P", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem P_d, (1.1)–(1.2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/d5_dimension_lift_20260929/README.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/e1ca400b3414e5a7bec13b91bc4f1e5293df32be/frontiers/d5_dimension_lift_20260929/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:D5d-P:scope", + "origin": "verbatim_curated_scope", + "text": "Every fixed d≥2 and torus L; compact b,k with k bounded from zero; all heights; E within punctured scaled ball.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "H0-ADAPTER", + "external_theorem_imports": [], + "fingerprint": "b9801ee3d7661759a77966ee7395429a9e42056ae736a9f86889b2f586c50ca8", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:H0-ADAPTER", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "H0-STRUCT" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Adapter theorem (2)–(4)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/periodized_gaussian_h0/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/periodized_gaussian_h0/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:H0-ADAPTER:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d>=2 and L>0; full infinite Gaussian spectrum with random constant mode. Not a finite Fourier cutoff, rescaled/renormalized sample, coefficient digit certificate, quantitative remainder, or model-family universal law. Same-provider scoped technical PASS; scientific status unchanged.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "H0-IID", + "external_theorem_imports": [], + "fingerprint": "1f15a2acdd97bdcc3a465dd5298a6daa583a4737bfe03cc79777219d107c4d62", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:H0-IID", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "H0-ADAPTER" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§§1,4,5,7 and (25)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/iid_short_bar_process/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/iid_short_bar_process/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:H0-IID:scope", + "origin": "verbatim_curated_scope", + "text": "Fixed d>=2, L>0, ordinary finite superlevel H0 bars; independent whole copies, not points within one field or expanding domains; depends on actual-H0 adapter and the proved weighted cluster-avoidance interface. Same-provider scoped mathematical PASS, zero organizational independence and no scientific promotion.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "H0-STRUCT", + "external_theorem_imports": [], + "fingerprint": "1c4a0926103b65de1240382ff2f2657be92c79b27275b3b6527f6401f065d51f", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:H0-STRUCT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Structural theorem (1)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/periodized_gaussian_h0/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/universality/fold_structural_universality/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:H0-STRUCT:scope", + "origin": "verbatim_curated_scope", + "text": "Compact connected smooth manifold; COUNT, CONTACT, SELECT, ENVELOPE, FAR all hold for actual field, selector and conditional kernels; C finite and positive. Same-provider full technical PASS under named classical imports; scientific-status promotion NONE.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "NUM-BIN-EXACT", + "external_theorem_imports": [], + "fingerprint": "99c02d511687a46dbe8546bcddbf73b2d191435ce061fa58ba8423b981a6ba4a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:NUM-BIN-EXACT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Exact statement §§Exact statement–Dependencies", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/EXACT_SAMPLE_SHRINKING_BIN.md", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/EXACT_SAMPLE_SHRINKING_BIN.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:NUM-BIN-EXACT:scope", + "origin": "verbatim_curated_scope", + "text": "Unconditioned smooth planar periodized Gaussian field, torus L=24; exact n×n vertex samples h=24/n; 00; assumes M4-M5 continuum density and deterministic approximation interfaces. No realization-wise bound or observed confidence interval. Same-account PASS_TECHNICAL_SCOPED, not scientific-status acceptance.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "NUM-BIN-SPECTRAL", + "external_theorem_imports": [], + "fingerprint": "33dac5c3439f0b901452e2e0d9588a863ba8450aa293841a7d7759ca4874bba6", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:NUM-BIN-SPECTRAL", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "NUM-BIN-EXACT" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem and proof, §1 and schedules", + "review": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/spectral_shrinking_bins/README.md", + "source": "https://github.com/d6g8k5htny-coder/main/blob/7e9a532c13e3214bcb977a47372ad75c2c1b7b75/experiments/periodic_h0/spectral_shrinking_bins/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:NUM-BIN-SPECTRAL:scope", + "origin": "verbatim_curated_scope", + "text": "Planar L=24, exact joint Fourier coupling; M_n>=m_n or M_n=∞; beta=pi²/24²; finite-grid supplied-value errors eta_n and failure chance q_n. Imports density/count/approximation interfaces and does not certify historical floating-point samples or finite-grid threshold. PASS_TECHNICAL_SCOPED with zero organizational independence.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-01", + "external_theorem_imports": [], + "fingerprint": "32416b5d621d428a1a118f939d7b29ec6807c1906114ab16759fe98dae968a46", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-01", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V04" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "(F3)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-01:scope", + "origin": "verbatim_curated_scope", + "text": "Theorem F realized family and its price hypotheses.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-E1", + "external_theorem_imports": [], + "fingerprint": "68ee8a858736a6d5429d5c1d3f62e5d97f5a54e3da027d14071e627318ff82f6", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-E1", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem E1 (E1)–(E2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-E1:scope", + "origin": "verbatim_curated_scope", + "text": "Finite capacity family; every coordinate lies in <=2 blocks; every ai positive EVEN integer. Odd-capacity nonbipartite instances are excluded.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-E2", + "external_theorem_imports": [], + "fingerprint": "36bf16487f7ac5b6e19f4191b6114733755634927d5d330f685db236407c909a", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-E2", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V06" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Lemma E2 (E3)–(E4)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-E2:scope", + "origin": "verbatim_curated_scope", + "text": "Finite product probability measure; coordinate incidence <=q; D subset Ai for every i; extended log/hazard conventions. Not an assertion for arbitrary dependent measures.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-E3", + "external_theorem_imports": [], + "fingerprint": "db5b3cacc18bb8b86fe6b391a7138c5954c482a4e7e1175f5251c459c1283da9", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-E3", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "P15-E1", + "P15-E2" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§E3 (E5)–(E6)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/EVEN_CAPACITY_EXTENSION.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-E3:scope", + "origin": "verbatim_curated_scope", + "text": "Every ai positive even; each original coordinate in at most two blocks; |Xi|=ai di+1; K=max di>=4; original independent probabilities and transformed-price hypothesis. No claim that factor is optimal.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-F", + "external_theorem_imports": [], + "fingerprint": "09d740c2782fca35263a7adccde1969b81c3b5c193eb6c8437da077de28a0194", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-F", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V11" + ], + "premise_bases": "source_explicit", + "premises": [ + "P15-L", + "P15-SHARP", + "P15-STRUCT", + "P15-TAIL" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem F, (F1)–(F2)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-F:scope", + "origin": "verbatim_curated_scope", + "text": "Disjoint realized blocks, integer demands d_i≥2, original independent p, prices 0≤c_v≤φ(p_v), same K≥K_H(d). No arbitrary-downset extension.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-L", + "external_theorem_imports": [], + "fingerprint": "9cfeb0bec2ff7e0800da5304f342a5bd109dcff32a02c49441b81a16aed15c5b", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-L", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V05" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§2, (F4)–(F8)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-L:scope", + "origin": "verbatim_curated_scope", + "text": "Proper decreasing A containing ∅; coordinate t∈[0,1]^n, independent Bernoulli inputs; separate concavity only.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-O1", + "external_theorem_imports": [], + "fingerprint": "21f2dd2b4e58a9f72d00735318b1cfe3718a9c44aab341d16ecb414471cf34c9", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-O1", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem O1 (O1)–(O2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-O1:scope", + "origin": "verbatim_curated_scope", + "text": "Finite original coordinates X; nonempty covering blocks Xi; ai positive integers; intersecting-block graph bipartite. Each coordinate is coloured once. No macro-clutter or arbitrary read-two extension.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-O2", + "external_theorem_imports": [], + "fingerprint": "c0f89341774be2b6cb702f7a6f27d14bcdcf3225ba1fbd2dab6886198c910160", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-O2", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "P15-O1" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Corollary O2 (O3)–(O4)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-O2:scope", + "origin": "verbatim_curated_scope", + "text": "Bipartite-overlap class of P15-O1, with active blocks d_i=K. Inactive and duplicate/superset blocks require the source removal rules.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-O3", + "external_theorem_imports": [], + "fingerprint": "74ed4d4279f9129ae30f5a0cdac5bd160e73eff23edc302b0b3f4b3937a6ffca", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-O3", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "P15-O2" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem O4 (O5)–(O12)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_bipartite_overlap_20260928/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-O3:scope", + "origin": "verbatim_curated_scope", + "text": "Bipartite intersection graph; arbitrary positive capacities; K=max d_i>=4; prices 0<=cv<=min(1,-log(1-pv)); same original coordinates and full-block cover. Here 5e-4 means 5*e−4.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-SHARP", + "external_theorem_imports": [], + "fingerprint": "9a27f77b3bcae7d5978d1b223f850f3265bfef4caa5ca04f1baf262252d077a3", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-SHARP", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V14" + ], + "premise_bases": "source_explicit", + "premises": [ + "P15-TAIL" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§5, sharpness construction", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-SHARP:scope", + "origin": "verbatim_curated_scope", + "text": "Single block; empty macro H; K=2; price-one convention for every generator including the empty set. This witnesses sharpness ONLY within the stated realized family.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-STRUCT", + "external_theorem_imports": [], + "fingerprint": "93d531ca885c1082ba04b9d74b804e1216298e84a59935b2a3ee7ca880baca7d", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-STRUCT", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V12" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem P2, (P1)–(P7)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/three_fronts_20260924/P15_REALIZED_COVERS.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-STRUCT:scope", + "origin": "verbatim_curated_scope", + "text": "Finite disjoint nonempty original-coordinate blocks, a_i,d_i positive integers; H is a clutter with edges of size ≥2 (or empty). This is only the specified G, not optimality of arbitrary covers at lower K.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-T1", + "external_theorem_imports": [], + "fingerprint": "8cc1f040a87ffe126e5746d072df0bd15648f79f19a34e769d2698a0f3d3d8ed", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-T1", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "source_explicit", + "premises": [ + "P15-E1", + "P15-E2", + "P15-T3" + ], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem 1, (T1)–(T2)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-T1:scope", + "origin": "verbatim_curated_scope", + "text": "Same even-capacity read-two eligibility and palette as P15-E3, independently proved genuine cover; uniform factor is not claimed globally optimal. Formula and scope from source summary and reviewed Theorem 1 (T1)–(T2).", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-T2", + "external_theorem_imports": [], + "fingerprint": "1be1b093813b845b888b8da05da5b4ac79f8fc7b5ff81843af48c8f709b395cd", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-T2", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "Theorem 2 (T3)–(T4), (T9)–(T11)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-T2:scope", + "origin": "verbatim_curated_scope", + "text": "Finite product coordinates; true cover proved first; source (T3)–(T4), (T9)–(T11) uses coordinate-specific loads rather than replacing all with a maximum. Displayed inequality is a schematic general entropy form; consult exact source for the budget.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-T3", + "external_theorem_imports": [], + "fingerprint": "cacc46e428007ce559587cf7d6acc161cf0c1a5b3a6941e3bfd0c29212611960", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-T3", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "(T12)–(T13)", + "review": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/reviews/p15_overlap_tail_claude_20260928/REVIEW.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/79cb314d5b9f6b8b410bfd0df200414314f6b8c7/frontiers/p15_tail_load_20260928/README.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-T3:scope", + "origin": "verbatim_curated_scope", + "text": "Reference binomial-tail computation for even/read-two class; exact attainment a=2, K=4; a reference-tail sharpness, not an optimal cover factor.", + "validation": "not_independently_discharged" + } + ], + "source_corrections": [], + "status": "side_conditions_open", + "unlisted_side_conditions_possible": true + }, + { + "checker": { + "identity": "UL v15 structural validator", + "purpose": "schema and mathematical dependency consistency only", + "version": "1.0" + }, + "conclusion": "P15-TAIL", + "external_theorem_imports": [], + "fingerprint": "bf66e1ab1451cf9c7f110529c2234149bbef6e805519c95c3b782e3953d41ca1", + "full_proof_verified": false, + "full_theorem_certificate_refs": [], + "id": "OBL:P15-TAIL", + "joint_premises_not_sufficient": true, + "local_evidence_refs": [ + "V13" + ], + "premise_bases": "none_recorded", + "premises": [], + "proof_bundle": { + "interpretation": "necessary inputs, not a certified inference", + "proof_ref": "§3, (F9)–(F11)", + "review": "https://github.com/d6g8k5htny-coder/main/blob/580ede4f398ff5298969a30b2fb9aedd393bbd25/STATUS.md", + "source": "https://github.com/d6g8k5htny-coder/Math-/blob/9f3fb6918b28e6378c034ebc19e76d432f5391cb/frontiers/full_price_20260924/PROOF.md", + "source_bytes_authenticated": false + }, + "side_conditions": [ + { + "id": "SC:P15-TAIL:scope", + "origin": "verbatim_curated_scope", + "text": "a≥1 integer; d≥2 integer; p=p_*=1-e^(-1) for hazard conclusion; the recurrence holds for all 1/2